{"id":"https://openalex.org/W4416781452","doi":"https://doi.org/10.1145/3798129.3800923","title":"Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies","display_name":"Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W4416781452","doi":"https://doi.org/10.1145/3798129.3800923"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800923","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800923","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.3800923","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Guy Goldberg","orcid":"https://orcid.org/0000-0003-3772-4494"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Guy Goldberg","raw_affiliation_strings":["Weizmann Institute of Science, Rehovot, Israel"],"raw_orcid":"https://orcid.org/0000-0003-3772-4494","affiliations":[{"raw_affiliation_string":"Weizmann Institute of Science, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"middle","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":"last","author":{"id":"https://openalex.org/A5059723204","display_name":"Sidhant Saraogi","orcid":null},"institutions":[{"id":"https://openalex.org/I184565670","display_name":"Georgetown University","ror":"https://ror.org/05vzafd60","country_code":"US","type":"education","lineage":["https://openalex.org/I184565670"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sidhant Saraogi","raw_affiliation_strings":["Georgetown University, Washington, D.C., USA"],"raw_orcid":"https://orcid.org/0009-0007-5923-699X","affiliations":[{"raw_affiliation_string":"Georgetown University, Washington, D.C., USA","institution_ids":["https://openalex.org/I184565670"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"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.01255176,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2210","last_page":"2217"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.44130000472068787,"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"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.44130000472068787,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1096000000834465,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.0885000005364418,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7749000191688538},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6424999833106995},{"id":"https://openalex.org/keywords/pseudorandom-number-generator","display_name":"Pseudorandom number generator","score":0.534500002861023},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.2757999897003174},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.24639999866485596}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7749000191688538},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7009000182151794},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6424999833106995},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5789999961853027},{"id":"https://openalex.org/C140642157","wikidata":"https://www.wikidata.org/wiki/Q1623338","display_name":"Pseudorandom number generator","level":2,"score":0.534500002861023},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5162000060081482},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.2757999897003174},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.24639999866485596},{"id":"https://openalex.org/C19086982","wikidata":"https://www.wikidata.org/wiki/Q2115856","display_name":"Pseudorandomness","level":3,"score":0.241799995303154},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.23890000581741333}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3798129.3800923","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800923","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:2511.21659","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.21659","pdf_url":"https://arxiv.org/pdf/2511.21659","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.21659","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.21659","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.1145/3798129.3800923","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800923","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/G2291411185","display_name":null,"funder_award_id":"CCF-1845125","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G482765451","display_name":null,"funder_award_id":"2073/21","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G518025447","display_name":null,"funder_award_id":"101163189","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"},{"id":"https://openalex.org/G536424028","display_name":"CAREER: The Polynomial Method in Complexity and Cryptography","funder_award_id":"1845125","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6654660187","display_name":null,"funder_award_id":"MR/X023583/1","funder_id":"https://openalex.org/F4320314731","funder_display_name":"UK Research and Innovation"},{"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/G7363464068","display_name":null,"funder_award_id":"772839","funder_id":"https://openalex.org/F4320334678","funder_display_name":"European Research Council"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320314731","display_name":"UK Research and Innovation","ror":"https://ror.org/001aqnf71"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320334678","display_name":"European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"show":[1],"a":[2,72],"nearly":[3],"optimal":[4],"lower":[5],"bound":[6,35,41],"on":[7],"the":[8,38,58],"length":[9],"of":[10,42,60],"linear":[11,23],"relaxed":[12,65],"locally":[13],"decodable":[14],"codes":[15],"(RLDCs).":[16],"Specifically,":[17],"we":[18],"prove":[19],"that":[20],"any":[21],"$q$-query":[22],"RLDC":[24],"$C\\colon":[25],"\\{0,1\\}^k":[26],"\\to":[27],"\\{0,1\\}^n$":[28],"must":[29],"satisfy":[30],"$n":[31,43],"=":[32,44],"k^{1+\u03a9(1/q)}$.":[33],"This":[34],"closely":[36],"matches":[37],"known":[39],"upper":[40],"k^{1+O(1/q)}$":[45],"by":[46],"Ben-Sasson,":[47],"Goldreich,":[48],"Harsha,":[49],"Sudan,":[50],"and":[51,70],"Vadhan":[52],"(STOC":[53],"2004).":[54],"Our":[55],"proof":[56],"introduces":[57],"notion":[59],"robust":[61,79],"daisies,":[62],"which":[63],"are":[64],"sunflowers":[66],"with":[67],"pseudorandom":[68],"structure,":[69],"leverages":[71],"new":[73],"spread":[74],"lemma":[75],"to":[76],"extract":[77],"dense":[78],"daisies":[80],"from":[81],"arbitrary":[82],"distributions.":[83]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-11-28T00:00:00"}