{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:57:50Z","timestamp":1781078270167,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T00:00:00Z","timestamp":1780963200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["772839"],"award-info":[{"award-number":["772839"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["101163189"],"award-info":[{"award-number":["101163189"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100014013","name":"UK Research and Innovation","doi-asserted-by":"publisher","award":["MR\/X023583\/1"],"award-info":[{"award-number":["MR\/X023583\/1"]}],"id":[{"id":"10.13039\/100014013","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1845125"],"award-info":[{"award-number":["CCF-1845125"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["2073\/21"],"award-info":[{"award-number":["2073\/21"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,6,9]]},"DOI":"10.1145\/3798129.3800923","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"2210-2217","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3772-4494","authenticated-orcid":false,"given":"Guy","family":"Goldberg","sequence":"first","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7864-7013","authenticated-orcid":false,"given":"Tom","family":"Gur","sequence":"additional","affiliation":[{"name":"University of Cambridge, Cambridge, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-5923-699X","authenticated-orcid":false,"given":"Sidhant","family":"Saraogi","sequence":"additional","affiliation":[{"name":"Georgetown University, Washington, D.C., USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"TR22-101","author":"Alrabiah Omar","year":"2022","unstructured":"Omar Alrabiah, Venkatesan Guruswami, Pravesh Kothari, and Peter Manohar. 2022. A Near-Cubic Lower Bound for 3-Query Locally Decodable Codes from Semirandom CSP Refutation. Electron. Colloquium Comput. Complex., TR22-101 (2022)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2021.194.3.5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2021.18"},{"key":"e_1_3_2_1_4_1","volume-title":"Lin","author":"Basu Arpon","year":"2025","unstructured":"Arpon Basu, Jun-Ting Hsieh, Pravesh K. Kothari, and Andrew D. Lin. 2025. Improved Lower Bounds for all Odd-Query Locally Decodable Codes. In FOCS."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112367"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705446810"},{"key":"e_1_3_2_1_7_1","unstructured":"Bruno Cavalar Mika G\u00f6\u00f6s Artur Riazanov Anastasia Sofronova and Dmitry Sokolov. 2025. Monotone Circuit Complexity of Matching. arXiv:2507.16105."},{"key":"e_1_3_2_1_8_1","unstructured":"Bruno Pasqualotto Cavalar Mrinal Kumar and Benjamin Rossman. 2022. Monotone circuit lower bounds from robust sunflowers. Algorithmica."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M135515X"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00010"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2024.8"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.22331\/q-2022-10-13-834"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/21M1422781"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/090772721"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.75"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2021.194.2.2"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2024.74"},{"key":"e_1_3_2_1_18_1","volume-title":"TR23-064","author":"Goldreich Oded","year":"2023","unstructured":"Oded Goldreich. 2023. On the Lower Bound on the Length of Relaxed Locally Decodable Codes. Electron. Colloquium Comput. Complex., TR23-064 (2023), ECCC:TR23-064. https:\/\/eccc.weizmann.ac.il\/report\/2023\/064"},{"key":"e_1_3_2_1_19_1","volume-title":"TR24-078","author":"Goldreich Oded","year":"2024","unstructured":"Oded Goldreich. 2024. On the relaxed LDC of BGHSV: A survey that corrects the record. Electron. Colloquium Comput. Complex., TR24-078 (2024), ECCC:TR24-078. https:\/\/eccc.weizmann.ac.il\/report\/2024\/078"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.4086\/cjtcs.2018.003"},{"key":"e_1_3_2_1_21_1","volume-title":"Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP. Theoretical computer science, 878","author":"Goldreich Oded","year":"2021","unstructured":"Oded Goldreich and Tom Gur. 2021. Universal locally verifiable codes and 3-round interactive proofs of proximity for CSP. Theoretical computer science, 878 (2021), 83\u2013101."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3319907"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1307834"},{"key":"e_1_3_2_1_24_1","volume-title":"STOC","author":"Gur Tom","year":"2026","unstructured":"Tom Gur, Dor Minzer, Guy Weissenberg, and Kai Zhe Zheng. 2026. 3-Query RLDCs are Strictly Stronger than 3-Query LDCs. STOC 2026."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2020.v016a018"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-016-0136-9"},{"key":"e_1_3_2_1_27_1","unstructured":"Oliver Janzer and Peter Manohar. 2025. A k^q\/(q-2) Lower Bound for Odd Query Locally Decodable Codes from Bipartite Kikuchi Graphs. In FOCS."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335315"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Iordanis Kerenidis and Ronald de Wolf. 2003. Exponential lower bound for 2-query locally decodable codes via a quantum argument. In STOC. ACM 106\u2013115.","DOI":"10.1145\/780542.780560"},{"key":"e_1_3_2_1_30_1","volume-title":"TR17-126","author":"Kopparty Swastik","year":"2017","unstructured":"Swastik Kopparty and Shubhangi Saraf. 2017. Local Testing and Decoding of High-Rate Error-Correcting Codes. Electron. Colloquium Comput. Complex., TR17-126 (2017)."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649611"},{"key":"e_1_3_2_1_32_1","volume-title":"Proceedings of the 34th Computational Complexity Conference (CCC \u201919)","author":"Lovett Shachar","year":"2020","unstructured":"Shachar Lovett, Noam Solomon, and Jiapeng Zhang. 2020. From DNF compression to sunflower theorems via regularity. In Proceedings of the 34th Computational Complexity Conference (CCC \u201919). Article 5, 14 pages."},{"key":"e_1_3_2_1_33_1","volume-title":"A Bayesian proof of the spread lemma. Random Struct. Algorithms, 66, 4","author":"Mossel Elchanan","year":"2025","unstructured":"Elchanan Mossel, Jonathan Niles-Weed, Nike Sun, and Ilias Zadik. 2025. A Bayesian proof of the spread lemma. Random Struct. Algorithms, 66, 4 (2025), July."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1090\/jams\/1028"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","unstructured":"Anup Rao. 2020. Coding for Sunflowers. Discrete Analysis feb 25 https:\/\/doi.org\/10.19086\/da.11887 10.19086\/da.11887","DOI":"10.19086\/da.11887"},{"key":"e_1_3_2_1_36_1","unstructured":"Anup Rao. 2025. The Story of Sunflowers. arXiv preprint arXiv:2509.14790."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/110839059"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806693"},{"key":"e_1_3_2_1_39_1","volume-title":"TR07-006","author":"Woodruff David P.","year":"2007","unstructured":"David P. Woodruff. 2007. New Lower Bounds for General Locally Decodable Codes. Electron. Colloquium Comput. Complex., TR07-006 (2007)."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-012-1254-8"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1326554.1326555"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000030"}],"event":{"name":"STOC '26: 58th Annual ACM Symposium on Theory of Computing","location":"Salt Lake City UT USA","acronym":"STOC '26","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 58th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800923","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800923","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:55:06Z","timestamp":1781027706000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800923"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":42,"alternative-id":["10.1145\/3798129.3800923","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800923","relation":{},"subject":[],"published":{"date-parts":[[2026,6,9]]},"assertion":[{"value":"2026-06-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}