{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:56:53Z","timestamp":1781031413617,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":47,"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\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2211972"],"award-info":[{"award-number":["CCF-2211972"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-24-1-2491"],"award-info":[{"award-number":["N00014-24-1-2491"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["Investigator Award"],"award-info":[{"award-number":["Investigator Award"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR0011-25-C-0300"],"award-info":[{"award-number":["HR0011-25-C-0300"]}],"id":[{"id":"10.13039\/100000185","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.3800864","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"1558-1568","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Proximity Gaps for Subspace-Design Codes and (Random) Reed-Solomon Codes"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3123-2732","authenticated-orcid":false,"given":"Rohan","family":"Goyal","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7926-3396","authenticated-orcid":false,"given":"Venkatesan","family":"Guruswami","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.19086\/aic.2025.8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_12"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_12"},{"key":"e_1_3_2_1_5_1","volume-title":"Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes. arXiv preprint arXiv:2508.12548. arxiv:2508.12548. To appear in SODA 2026","author":"Ashvinkumar Vikrant","unstructured":"Vikrant Ashvinkumar, Mursalin Habib, and Shashank Srivastava. 2025. Algorithmic Improvements to List Decoding of Folded Reed-Solomon Codes. arXiv preprint arXiv:2508.12548. arxiv:2508.12548. To appear in SODA 2026"},{"key":"e_1_3_2_1_6_1","unstructured":"Eli Ben-Sasson. 2021. ethSTARK Documentation. Cryptology ePrint Archive Paper 2021\/582. https:\/\/eprint.iacr.org\/2021\/582"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.14"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.14"},{"key":"e_1_3_2_1_9_1","unstructured":"Eli Ben-Sasson Dan Carmon Ulrich Hab\u00f6ck Swastik Kopparty and Shubhangi Saraf. 2025. On Proximity Gaps for Reed\u2013Solomon Codes. Manuscript"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3614423"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2020.5"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/3235586.3235610"},{"key":"e_1_3_2_1_14_1","unstructured":"Joshua Brakensiek Yeyuan Chen Manik Dhar and Zihan Zhang. 2025. Combinatorial Bounds for List Recovery via Discrete Brascamp\u2013Lieb Inequalities. arXiv preprint arXiv:2510.13775. arxiv:2510.13775. arxiv:2510.13775"},{"key":"e_1_3_2_1_15_1","unstructured":"Joshua Brakensiek Yeyuan Chen Manik Dhar and Zihan Zhang. 2025. From Random to Explicit via Subspace Designs With Applications to Local Properties and Matroids. arxiv:2510.13777. arxiv:2510.13777"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3577506"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/23M1598064"},{"key":"e_1_3_2_1_18_1","unstructured":"Dan Carmon Lior Goldberg Ulrich Hab\u00f6ck Leonardo Lerer Ilya Lesokhin Shahar Papini and Shahar Samocha. 2026. S-two Whitepaper. Cryptology ePrint Archive Paper 2026\/532. https:\/\/eprint.iacr.org\/2026\/532"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718114"},{"key":"e_1_3_2_1_20_1","unstructured":"Elizabeth Crites and Alistair Stewart. 2025. On Reed\u2013Solomon Proximity Gaps Conjectures. Cryptology ePrint Archive Paper 2025\/2046. https:\/\/eprint.iacr.org\/2025\/2046"},{"key":"e_1_3_2_1_21_1","volume-title":"Diamond and Angus Gruen","author":"Benjamin","year":"2025","unstructured":"Benjamin E. Diamond and Angus Gruen. 2025. On the Distribution of the Distances of Random Words. Cryptology ePrint Archive, Paper 2025\/2010. https:\/\/eprint.iacr.org\/2025\/2010"},{"key":"e_1_3_2_1_22_1","unstructured":"Ethereum Foundation. 2025. The Proximity Prize \u2013 $1M Proximity Gaps Challenge. https:\/\/proximityprize.org\/ https:\/\/proximityprize.org\/ Accessed: 2025-11-02"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"e_1_3_2_1_24_1","unstructured":"Yiwen Gao Dongliang Cai Yang Xu and Haibin Kan. 2025. From List-Decodability to Proximity Gaps. Cryptology ePrint Archive Paper 2025\/870. https:\/\/eprint.iacr.org\/2025\/870"},{"key":"e_1_3_2_1_25_1","unstructured":"Yiwen Gao Haibin Kan and Yuan Li. 2024. Linear Proximity Gap for Linear Codes within the 1.5 Johnson Bound. Cryptology ePrint Archive Paper 2024\/1810. https:\/\/eprint.iacr.org\/2024\/1810"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS61266.2024.00111"},{"key":"e_1_3_2_1_27_1","volume-title":"Rothblum","author":"Gurkan Kobi","year":"2026","unstructured":"Kobi Gurkan, Andrija Novakovic, and Ron D. Rothblum. 2026. Bolt: Faster SNARKs from Sketched Codes. Cryptology ePrint Archive, Paper 2026\/310. https:\/\/eprint.iacr.org\/2026\/310"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-3169-1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2021.3127126"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00011"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3123497"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","unstructured":"Venkatesan Guruswami and Carol Wang. 2013. Linear-Algebraic List Decoding for Variants of Reed-Solomon Codes. http:\/\/dx.doi.org\/10.1109\/TIT.2013.2246813 IEEE Transactions on Information Theory 59 6 (2013) 3257\u20133268. 10.1109\/TIT.2013.2246813","DOI":"10.1109\/TIT.2013.2246813"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488715"},{"key":"e_1_3_2_1_35_1","unstructured":"Hexens. 2025. The Ethereum Proximity Prize: Reed\u2013Solomon Codes and MCA. https:\/\/hexens.io\/blog\/proximity-gaps https:\/\/hexens.io\/blog\/proximity-gaps Accessed: 2025-11-02"},{"key":"e_1_3_2_1_36_1","unstructured":"Fernando Granha Jeronimo and Nikhil Shagrithaya. 2025. Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes. arXiv preprint arXiv:2510.06185. arxiv:2510.06185. arxiv:2510.06185"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/625\/12497"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1370215"},{"key":"e_1_3_2_1_39_1","volume-title":"Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent. arXiv preprint arXiv:2406.02238. arxiv:2406.02238. arxiv:2406.02238 To appear in FOCS 2025","author":"Levi Matan","unstructured":"Matan Levi, Jonathan Mosheiff, and Nikhil Shagrithaya. 2025. Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent. arXiv preprint arXiv:2406.02238. arxiv:2406.02238. arxiv:2406.02238 To appear in FOCS 2025"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/20m1365934"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1365934"},{"key":"e_1_3_2_1_42_1","unstructured":"Ron Roth and Gilles Z\u00e9mor. 2018. Personal communication to the authors of [AHIV17]. Personal communication. Cited in Ligero[AHIV17] https:\/\/eprint.iacr.org\/2022\/1608"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488709"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.64"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3402171"},{"key":"e_1_3_2_1_46_1","volume-title":"Khatam: Reducing the Communication Complexity of Code-Based SNARKs. Cryptology ePrint Archive, Paper 2024\/1843. https:\/\/eprint.iacr.org\/2024\/1843","author":"Zeilberger Hadas","year":"2024","unstructured":"Hadas Zeilberger. 2024. Khatam: Reducing the Communication Complexity of Code-Based SNARKs. Cryptology ePrint Archive, Paper 2024\/1843. https:\/\/eprint.iacr.org\/2024\/1843"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_5"}],"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.3800864","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:58:26Z","timestamp":1781027906000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800864"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":47,"alternative-id":["10.1145\/3798129.3800864","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800864","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"}}]}}