{"id":"https://openalex.org/W7163526740","doi":"https://doi.org/10.48550/arxiv.2606.04934","title":"The local complexity of certifying parity","display_name":"The local complexity of certifying parity","publication_year":2026,"publication_date":"2026-06-03","ids":{"openalex":"https://openalex.org/W7163526740","doi":"https://doi.org/10.48550/arxiv.2606.04934"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.04934","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.04934","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2606.04934","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137868750","display_name":"Nicolas Bousquet","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bousquet, Nicolas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080881555","display_name":"Laurent Feuilloley","orcid":"https://orcid.org/0000-0002-3994-0898"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Feuilloley, Laurent","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5137884588","display_name":"Jorge Valenzuela","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Valenzuela, Jorge","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5093887447","display_name":"S\u00e9bastien Zeitoun","orcid":"https://orcid.org/0009-0003-2675-8581"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zeitoun, S\u00e9bastien","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6384000182151794,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.6384000182151794,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.30489999055862427,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.016100000590085983,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7897999882698059},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.7677000164985657},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6843000054359436},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4374000132083893},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42480000853538513},{"id":"https://openalex.org/keywords/graph-property","display_name":"Graph property","score":0.3840000033378601},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.35179999470710754},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.3292999863624573}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7897999882698059},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.7677000164985657},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6843000054359436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6593999862670898},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5256999731063843},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5170000195503235},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4374000132083893},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42480000853538513},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.3840000033378601},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.3292999863624573},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.3160000145435333},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.3138999938964844},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.3075000047683716},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.28940001130104065},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C140532419","wikidata":"https://www.wikidata.org/wiki/Q249748","display_name":"Spectral radius","level":3,"score":0.28189998865127563},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.2680000066757202},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2615000009536743},{"id":"https://openalex.org/C193435613","wikidata":"https://www.wikidata.org/wiki/Q2997928","display_name":"Connected component","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.2531999945640564},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25189998745918274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.04934","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.04934","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2606.04934","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.04934","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,106,135],"this":[1],"paper,":[2],"we":[3,200,212],"consider":[4],"the":[5,11,32,46,53,74,85,88,93,101,108,111,115,159,189,196,240],"problem":[6,112],"of":[7,13,31,52,87,104,110,154,161,234,239],"locally":[8],"certifying":[9,100],"that":[10,211],"size":[12,86],"a":[14,70,123,151,203,225,231,246],"network":[15],"is":[16,29,50,60,90],"even,":[17],"or":[18],"more":[19],"generally,":[20],"congruent":[21],"to":[22,62,214,223],"some":[23],"fixed":[24],"number.":[25],"The":[26],"parity":[27,127,146,170],"property":[28],"one":[30,47,51],"simplest":[33,54],"global":[34],"properties,":[35],"and":[36,64,92,131,164,186,242,245,254],"it":[37,49,59],"plays":[38],"an":[39],"intriguing":[40],"role":[41],"in":[42,56,77,99,158,177,195,217,220],"local":[43],"certification.":[44,205],"On":[45,73],"hand,":[48,76],"properties":[55],"cycles":[57],"because":[58],"equivalent":[61],"2-colorability,":[63],"hence":[65],"can":[66,147,201],"be":[67,148,215],"certified":[68,149],"with":[69,139,150,230,251],"single":[71],"bit.":[72],"other":[75,218],"general":[78,136],"graphs,":[79],"no":[80],"non-trivial":[81],"lower":[82,117,190,248],"bound":[83,96,118,191,249],"on":[84],"certificates":[89],"known,":[91],"known":[94,116],"upper":[95],"basically":[97],"consists":[98],"\\emph{exact}":[102],"value":[103],"$n$.":[105],"addition,":[107],"nature":[109],"makes":[113],"all":[114],"approaches":[119],"fail.":[120],"We":[121,206],"uncover":[122],"surprising":[124],"landscape":[125],"for":[126],"across":[128],"different":[129],"models":[130],"graph":[132,180],"structures:":[133],"*":[134,156,175],"graphs":[137,163,185],"equipped":[138],"identifiers,":[140],"when":[141],"allowing":[142,165],"verification":[143,166],"radius":[144,167],"2,":[145],"constant":[152,232],"number":[153,233],"bits.":[155,174],"But":[157],"model":[160,199],"anonymous":[162],"only":[168],"1,":[169],"requires":[171],"$\u03a9(\\log":[172],"\\log^*n)$":[173],"Finally,":[176],"bounded":[178],"expansion":[179],"classes":[181],"(such":[182],"as":[183],"bounded-degree":[184],"planar":[187],"graphs),":[188],"does":[192],"not":[193],"apply:":[194],"same":[197],"restricted":[198],"design":[202],"constant-size":[204],"introduce":[207],"several":[208],"new":[209,247],"tools":[210],"expect":[213],"useful":[216],"contexts,":[219],"particular":[221],"ways":[222],"\\emph{encode":[224],"parent":[226],"at":[227],"each":[228],"node":[229],"bits}":[235],"(via":[236],"implicit":[237],"use":[238],"IDs":[241],"conflict-free":[243],"colorings)":[244],"technique,":[250],"complex":[252],"topologies":[253],"higher-order":[255],"Ramsey-type":[256],"arguments.":[257]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-05T00:00:00"}