{"id":"https://openalex.org/W4417452918","doi":"https://doi.org/10.1145/3798129.3800857","title":"3-Query RLDCs Are Strictly Stronger Than 3-Query LDCs","display_name":"3-Query RLDCs Are Strictly Stronger Than 3-Query LDCs","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4417452918","doi":"https://doi.org/10.1145/3798129.3800857"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800857","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800857","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800857","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074192050","display_name":"Tom Gur","orcid":"https://orcid.org/0000-0001-7864-7013"},"institutions":[{"id":"https://openalex.org/I241749","display_name":"University of Cambridge","ror":"https://ror.org/013meh722","country_code":"GB","type":"education","lineage":["https://openalex.org/I241749"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Tom Gur","raw_affiliation_strings":["University of Cambridge, Cambridge, United Kingdom"],"raw_orcid":"https://orcid.org/0000-0001-7864-7013","affiliations":[{"raw_affiliation_string":"University of Cambridge, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I241749"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063520549","display_name":"Dor Minzer","orcid":"https://orcid.org/0000-0002-8093-1328"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dor Minzer","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":"https://orcid.org/0000-0002-8093-1328","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120841898","display_name":"Guy Weissenberg","orcid":null},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Guy Weissenberg","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"raw_orcid":"https://orcid.org/0009-0009-1213-8473","affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032517198","display_name":"Kai Zheng","orcid":"https://orcid.org/0000-0003-1578-1818"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kai Zhe Zheng","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, USA"],"raw_orcid":"https://orcid.org/0000-0002-0436-8131","affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.03291238,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1489","last_page":"1496"},"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.5568000078201294,"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.5568000078201294,"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/T11269","display_name":"Algorithms and Data Compression","score":0.08110000193119049,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.05790000036358833,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/soundness","display_name":"Soundness","score":0.7946000099182129},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.6646000146865845},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6118000149726868},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5515999794006348},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.515500009059906},{"id":"https://openalex.org/keywords/transformation","display_name":"Transformation (genetics)","score":0.49390000104904175}],"concepts":[{"id":"https://openalex.org/C39920170","wikidata":"https://www.wikidata.org/wiki/Q693083","display_name":"Soundness","level":2,"score":0.7946000099182129},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7497000098228455},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.6646000146865845},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6118000149726868},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5515999794006348},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.515500009059906},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.49390000104904175},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.44760000705718994},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.421999990940094},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.37619999051094055},{"id":"https://openalex.org/C40231798","wikidata":"https://www.wikidata.org/wiki/Q1333743","display_name":"Composition (language)","level":2,"score":0.36250001192092896},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34290000796318054}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800857","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800857","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2512.12960","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2512.12960","pdf_url":"https://arxiv.org/pdf/2512.12960","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2512.12960","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2512.12960","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800857","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800857","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5169580875","display_name":null,"funder_award_id":"2239160","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G539115378","display_name":null,"funder_award_id":"2141064","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5997410712","display_name":null,"funder_award_id":"DGE-2141064","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7317299890","display_name":null,"funder_award_id":"2227876","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309369","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44"},{"id":"https://openalex.org/F4320314731","display_name":"UK Research and Innovation","ror":"https://ror.org/001aqnf71"},{"id":"https://openalex.org/F4320320915","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052"},{"id":"https://openalex.org/F4320329018","display_name":"Ethereum Foundation","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"construct":[1],"$3$-query":[2],"relaxed":[3],"locally":[4,36],"decodable":[5,37,139],"codes":[6,38],"(RLDCs)":[7],"with":[8,19,40,85,142,191],"constant":[9,90],"alphabet":[10,91,197,212],"size":[11,213],"and":[12,50,61,95,145,160,171,199],"length":[13,34],"$\\tilde{O}(k^2)$":[14],"for":[15],"$k$-bit":[16],"messages.":[17],"Combined":[18],"the":[20,33,41,130,150,162,184,211],"lower":[21],"bound":[22],"of":[23,25,35,56,78,82,132,153,166],"$\\tilde\u03a9(k^3)$":[24],"[Alrabiah,":[26],"Guruswami,":[27],"Kothari,":[28],"Manohar,":[29],"STOC":[30,158],"2023]":[31],"on":[32,69,149,161],"(LDCs)":[39],"same":[42],"parameters,":[43,144],"we":[44,73,120,178],"obtain":[45],"a":[46,75,109,122,137,189,195],"separation":[47],"between":[48],"RLDCs":[49],"LDCs,":[51],"resolving":[52],"an":[53,202],"open":[54],"problem":[55],"[Ben-Sasson,":[57],"Goldreich,":[58],"Harsha,":[59,173],"Sudan":[60],"Vadhan,":[62],"SICOMP":[63,174],"2006].":[64],"Our":[65],"RLDC":[66],"construction":[67,77,135,147,186],"relies":[68],"two":[70],"components.":[71],"First,":[72],"give":[74,121],"new":[76],"probabilistically":[79],"checkable":[80],"proofs":[81],"proximity":[83],"(PCPPs)":[84],"$3$":[86],"queries,":[87],"quasi-linear":[88],"size,":[89,92,198],"perfect":[93],"completeness,":[94],"small":[96],"soundness":[97,115],"error.":[98],"This":[99],"improves":[100],"upon":[101],"all":[102],"previous":[103],"PCPP":[104,134],"constructions,":[105],"which":[106],"either":[107],"had":[108],"much":[110],"higher":[111],"query":[112],"complexity":[113],"or":[114],"close":[116],"to":[117,127,182,187,209],"$1$.":[118],"Second,":[119],"query-preserving":[123],"transformation":[124],"from":[125],"PCPPs":[126],"RLDCs.":[128],"At":[129],"heart":[131],"our":[133,146],"is":[136],"$2$-query":[138],"PCP":[140,152],"(dPCP)":[141],"matching":[143,192],"builds":[148],"HDX-based":[151,185],"[Bafna,":[154],"Minzer,":[155],"Vyas,":[156],"Yun,":[157],"2025]":[159],"efficient":[163],"composition":[164,204],"framework":[165],"[Moshkovitz,":[167],"Raz,":[168],"JACM":[169],"2010]":[170],"[Dinur,":[172],"2013].":[175],"More":[176],"specifically,":[177],"first":[179],"show":[180],"how":[181],"use":[183],"get":[188],"dPCP":[190],"parameters":[193],"but":[194],"large":[196],"then":[200],"prove":[201],"appropriate":[203],"theorem":[205],"(and":[206],"related":[207],"transformations)":[208],"reduce":[210],"in":[214],"dPCPs.":[215]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-12-17T00:00:00"}