{"id":"https://openalex.org/W7151342542","doi":"https://doi.org/10.48550/arxiv.2604.04188","title":"Expanders Meet Reed-Muller: Easy Instances of Noisy k-XOR","display_name":"Expanders Meet Reed-Muller: Easy Instances of Noisy k-XOR","publication_year":2026,"publication_date":"2026-04-05","ids":{"openalex":"https://openalex.org/W7151342542","doi":"https://doi.org/10.48550/arxiv.2604.04188"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.04188","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04188","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.04188","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5036388879","display_name":"Jaros\u0142aw B\u0142asiok","orcid":"https://orcid.org/0000-0002-4372-9745"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"B\u0142asiok, Jaros\u0142aw","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002073784","display_name":"Paul Lou","orcid":"https://orcid.org/0000-0002-8709-2205"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lou, Paul","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051186002","display_name":"Alon Rosen","orcid":"https://orcid.org/0000-0002-3021-7150"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rosen, Alon","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101519422","display_name":"Madhu Sudan","orcid":"https://orcid.org/0000-0003-3718-6489"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sudan, Madhu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5036388879"],"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3659000098705292,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3659000098705292,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.19750000536441803,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.06780000030994415,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.5952000021934509},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5583000183105469},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5376999974250793},{"id":"https://openalex.org/keywords/expander-graph","display_name":"Expander graph","score":0.5047000050544739},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.42989999055862427},{"id":"https://openalex.org/keywords/pseudorandomness","display_name":"Pseudorandomness","score":0.4059000015258789},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.39800000190734863},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.37770000100135803},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.36959999799728394},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.36309999227523804}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5972999930381775},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.5952000021934509},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5583000183105469},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5428000092506409},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5376999974250793},{"id":"https://openalex.org/C154547637","wikidata":"https://www.wikidata.org/wiki/Q776602","display_name":"Expander graph","level":3,"score":0.5047000050544739},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4569000005722046},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.42989999055862427},{"id":"https://openalex.org/C19086982","wikidata":"https://www.wikidata.org/wiki/Q2115856","display_name":"Pseudorandomness","level":3,"score":0.4059000015258789},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4018000066280365},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.39800000190734863},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.37770000100135803},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.36959999799728394},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.36309999227523804},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.3499999940395355},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.3228999972343445},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3179999887943268},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.3100999891757965},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.30630001425743103},{"id":"https://openalex.org/C99498987","wikidata":"https://www.wikidata.org/wiki/Q2210247","display_name":"Noise (video)","level":3,"score":0.3052999973297119},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.3034999966621399},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C64812099","wikidata":"https://www.wikidata.org/wiki/Q176604","display_name":"Random matrix","level":3,"score":0.29510000348091125},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.2906000018119812},{"id":"https://openalex.org/C527412718","wikidata":"https://www.wikidata.org/wiki/Q855395","display_name":"Interpretation (philosophy)","level":2,"score":0.28999999165534973},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.2824000120162964},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.2816999852657318},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.28139999508857727},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2745000123977661},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.26170000433921814},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.2614000141620636},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2563999891281128},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.25540000200271606}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.04188","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04188","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.04188","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04188","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"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],"the":[1,27,68,131,151,156,162,181,235],"noisy":[2,98,157,203],"$k$-XOR":[3,99,204],"problem,":[4],"one":[5],"is":[6,26,43,47,100,144,205],"given":[7],"$y":[8,18],"\\in":[9],"\\mathbb{F}_2^M$":[10],"and":[11,17,38,45,61,115,137,225,252],"must":[12],"distinguish":[13],"between":[14],"$y$":[15],"uniform":[16],"=":[19,218,222,245],"A":[20],"x":[21],"+":[22],"e$,":[23],"where":[24],"$A$":[25],"adjacency":[28],"matrix":[29],"of":[30,70,91,111,134,150,153,164,178,187],"a":[31,175],"$k$-left-regular":[32],"bipartite":[33],"graph":[34],"with":[35,49,93,216,243],"$N$":[36],"variables":[37],"$M$":[39],"constraints,":[40],"$x\\in":[41],"\\mathbb{F}_2^N$":[42],"random,":[44],"$e$":[46],"noise":[48,210,256],"rate":[50,211,257],"$\u03b7$.":[51],"Lower":[52],"bounds":[53],"in":[54,102,113],"restricted":[55],"computational":[56],"models":[57],"such":[58,82],"as":[59],"Sum-of-Squares":[60],"low-degree":[62],"polynomials":[63],"are":[64,84,128],"closely":[65],"tied":[66],"to":[67,73,241],"expansion":[69,76,95,249],"$A$,":[71],"leading":[72],"conjectures":[74,83,230],"that":[75,81,118,145],"implies":[77],"hardness.":[78],"We":[79],"show":[80],"false":[85],"by":[86,146],"constructing":[87],"an":[88,147],"explicit":[89,199],"family":[90],"graphs":[92,127,215],"near-optimal":[94],"for":[96,201,214],"which":[97,202],"solvable":[101,207],"polynomial":[103],"time.":[104],"Our":[105,141],"construction":[106],"combines":[107],"two":[108],"powerful":[109,176],"directions":[110],"work":[112,179],"pseudorandomness":[114],"coding":[116],"theory":[117],"have":[119],"not":[120],"been":[121],"previously":[122],"put":[123],"together.":[124],"Specifically,":[125],"our":[126,194],"based":[129],"on":[130,174,231],"lossless":[132],"expanders":[133],"Guruswami,":[135],"Umans":[136],"Vadhan":[138],"(JACM":[139],"2009).":[140],"key":[142],"insight":[143],"appropriate":[148],"interpretation":[149],"vertices":[152],"their":[154],"graphs,":[155],"XOR":[158],"problem":[159,163],"turns":[160],"into":[161],"decoding":[165],"Reed-Muller":[166,232],"codes":[167,233],"from":[168,180,184],"random":[169,188],"errors.":[170,189],"Then":[171],"we":[172,197],"build":[173],"body":[177],"2010s":[182],"correcting":[183],"large":[185],"amounts":[186],"Putting":[190],"these":[191],"together":[192],"yields":[193],"construction.":[195],"Concretely,":[196],"obtain":[198],"families":[200,242],"polynomial-time":[206,253],"at":[208,255],"constant":[209],"$\u03b7=":[212,258],"1/3$":[213],"$M":[217,244],"2^{O(\\log^2":[219],"N)}$,":[220],"$k":[221],"(\\log":[223],"N)^{O(1)}$,":[224,248],"$(N^{1-\u03b1},":[226,250],"1-o(1))$-expansion.":[227],"Under":[228],"standard":[229],"over":[234],"binary":[236],"erasure":[237],"channel,":[238],"this":[239],"extends":[240],"N^{O(1)}$,":[246],"$k=(\\log":[247],"1-o(1))$":[251],"algorithms":[254],"N^{-c}$.":[259]},"counts_by_year":[],"updated_date":"2026-04-15T05:59:14.812645","created_date":"2026-04-08T00:00:00"}