{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T18:56:51Z","timestamp":1781031411232,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":68,"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":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2236931"],"award-info":[{"award-number":["CCF-2236931"]}],"id":[{"id":"10.13039\/100000001","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.3800795","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"806-813","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8586-1533","authenticated-orcid":false,"given":"Fernando Granha","family":"Jeronimo","sequence":"first","affiliation":[{"name":"University of Illinois, Urbana-Champaign, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7242-6416","authenticated-orcid":false,"given":"Nikhil","family":"Shagrithaya","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, 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.3390\/e26040348"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492581"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649634"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"e_1_3_2_1_5_1","volume-title":"Combinatorial bounds for list recovery via discrete brascamp\u2013lieb inequalities","author":"Brakensiek Joshua","year":"2025","unstructured":"Joshua Brakensiek, Yeyuan Chen, Manik Dhar, and Zihan Zhang. Combinatorial bounds for list recovery via discrete brascamp\u2013lieb inequalities, 2025."},{"key":"e_1_3_2_1_6_1","volume-title":"From random to explicit via subspace designs with applications to local properties and matroids","author":"Brakensiek Joshua","year":"2025","unstructured":"Joshua Brakensiek, Yeyuan Chen, Manik Dhar, and Zihan Zhang. From random to explicit via subspace designs with applications to local properties and matroids, 2025."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585128"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17659-4_21"},{"key":"e_1_3_2_1_9_1","volume-title":"Optimal erasure codes and codes on graphs. CoRR, abs\/2504.03090","author":"Chen Yeyuan","year":"2025","unstructured":"Yeyuan Chen, Mahdi Cheraghchi, and Nikhil Shagrithaya. Optimal erasure codes and codes on graphs. CoRR, abs\/2504.03090, 2025."},{"key":"e_1_3_2_1_10_1","first-page":"3362","volume-title":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025","author":"Chen Yeyuan","year":"2025","unstructured":"Yeyuan Chen. Unique-neighbor expanders with better expansion for polynomial-sized sets. In Yossi Azar and Debmalya Panigrahi, editors, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, New Orleans, LA, USA, January 12-15, 2025, pages 3335\u20133362. SIAM, 2025."},{"key":"e_1_3_2_1_11_1","volume-title":"Chen and Zihan Zhang. Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds. In Proceedings of the 57th ACM Symposium on Theory of Computing","author":"Yeyuan","year":"2025","unstructured":"Yeyuan Chen and Zihan Zhang. Explicit Folded Reed-Solomon and Multiplicity Codes Achieve Relaxed Generalized Singleton Bounds. In Proceedings of the 57th ACM Symposium on Theory of Computing, 2025."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520024"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806118"},{"key":"e_1_3_2_1_14_1","first-page":"17","volume-title":"49th International Colloquium on Automata, Languages, and Programming, ICALP 2022","volume":"229","author":"Doron Dean","year":"2022","unstructured":"Dean Doron and Mary Wootters. High-probability list-recovery, and applications to heavy hitters. In Mikolaj Bojanczyk, Emanuela Merelli, and David P. Woodruff, editors, 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4-8, 2022, Paris, France, volume 229 of LIPIcs, pages 55:1\u201355:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2022."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.01.002"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2095170"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.995539"},{"key":"e_1_3_2_1_18_1","first-page":"821","volume-title":"Proceedings of the 34th ACM Symposium on Theory of Computing","author":"Guruswami Venkatesan","year":"2002","unstructured":"Venkatesan Guruswami and Piotr Indyk. Near-optimal linear-time codes for unique decoding and new list-decodable codes over small alphabets. In Proceedings of the 34th ACM Symposium on Theory of Computing, pages 812\u2013821, 2002."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780562"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1952.tb01393.x"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3127126"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/21M1463707"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00011"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3123497"},{"key":"e_1_3_2_1_26_1","first-page":"4971","volume-title":"Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024","author":"Golowich Louis","year":"2024","unstructured":"Louis Golowich. New explicit constant-degree lossless expanders. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024, pages 4963\u20134971. SIAM, 2024."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132518"},{"key":"e_1_3_2_1_28_1","first-page":"10","volume-title":"Proceedings of the 38th Annual ACM Symposium on Theory of Computing","author":"Guruswami Venkatesan","year":"2006","unstructured":"Venkatesan Guruswami and Atri Rudra. Explicit capacity-achieving list-decodable codes. In Jon M. Kleinberg, editor, Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA, May 21-23, 2006, pages 1\u201310. ACM, 2006."},{"key":"e_1_3_2_1_29_1","volume-title":"Book","author":"Guruswami Venkatesan","year":"2023","unstructured":"Venkatesan Guruswami, Atri Rudra, and Madhu Sudan. Essential coding theory. Book, 2023."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743426"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538904"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00019"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718241"},{"key":"e_1_3_2_1_34_1","volume-title":"Explicit lossless vertex expanders. CoRR, abs\/2504.15087","author":"Hsieh Jun-Ting","year":"2025","unstructured":"Jun-Ting Hsieh, Alexander Lubotzky, Sidhanth Mohanty, Assaf Reiner, and Rachel Yun Zhang. Explicit lossless vertex expanders. CoRR, abs\/2504.15087, 2025."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3618260.3649705"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M116149X"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718302"},{"key":"e_1_3_2_1_38_1","volume-title":"List decoding expander-based codes via fast approximation of expanding csps: I","author":"Jeronimo Fernando Granha","year":"2025","unstructured":"Fernando Granha Jeronimo and Aman Singh. List decoding expander-based codes via fast approximation of expanding csps: I, 2025."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3051093"},{"key":"e_1_3_2_1_40_1","series-title":"SIAM J. Comput","volume-title":"Improved list decoding of folded reed-solomon and multiplicity codes","author":"Kopparty Swastik","year":"2023","unstructured":"Swastik Kopparty, Noga Ron-Zewi, Shubhangi Saraf, and Mary Wootters. Improved list decoding of folded reed-solomon and multiplicity codes. SIAM J. Comput., 2023."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS63196.2025.00112"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3339185"},{"key":"e_1_3_2_1_43_1","unstructured":"Ben Lund and Aditya Potukuchi. On the list recoverability of randomly punctured codes. In Jaroslaw Byrka and Raghu Meka editors Approximation Randomization and Combinatorial Optimization. Algorithms and Techniques APPROX\/RANDOM 2020 August 17-19 2020 Virtual Conference volume 176 of LIPIcs pages 30:1\u201330:11. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik 2020."},{"key":"e_1_3_2_1_44_1","volume-title":"Near-optimal list-recovery of linear code families. CoRR, abs\/2502.13877","author":"Li Ray","year":"2025","unstructured":"Ray Li and Nikhil Shagrithaya. Near-optimal list-recovery of linear code families. CoRR, abs\/2502.13877, 2025."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00050"},{"key":"e_1_3_2_1_46_1","volume-title":"LDPC codes achieve list decoding capacity","author":"Mosheiff Jonathan","year":"2019","unstructured":"Jonathan Mosheiff, Nicolas Resch, Noga Ron-Zewi, Shashwat Silas, and Mary Wootters. LDPC codes achieve list decoding capacity, 2019."},{"key":"e_1_3_2_1_47_1","first-page":"241","volume-title":"29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd","volume":"14","author":"Ngo Hung Q.","year":"2012","unstructured":"Hung Q. Ngo, Ely Porat, and Atri Rudra. Efficiently decodable compressed sensing by list-recoverable codes and recursion. In Christoph D\u00fcrr and Thomas Wilke, editors, 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012, February 29th - March 3rd, 2012, Paris, France, volume 14 of LIPIcs, pages 230\u2013241. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 2012."},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(05)80043-1"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520017"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718206"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.29"},{"key":"e_1_3_2_1_52_1","unstructured":"Nicholas Resch. List-decodable codes:(randomized) constructions and applications. PhD thesis Carnegie Mellon University 2020 2020."},{"key":"e_1_3_2_1_53_1","volume-title":"List recoverable codes: The good, the bad, and the unknown (hopefully not ugly)","author":"Resch Nicolas","year":"2025","unstructured":"Nicolas Resch and S. Venkitesh. List recoverable codes: The good, the bad, and the unknown (hopefully not ugly), 2025."},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.42"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"e_1_3_2_1_56_1","first-page":"2050","volume-title":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025","author":"Srivastava Shashank","year":"2025","unstructured":"Shashank Srivastava. Improved list size for folded reed-solomon codes. In Yossi Azar and Debmalya Panigrahi, editors, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2025, New Orleans, LA, USA, January 12-15, 2025, pages 2040\u20132050. SIAM, 2025."},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384295"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS63196.2025.00077"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcom.1997.0439"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3402171"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301289"},{"key":"e_1_3_2_1_64_1","first-page":"251","volume-title":"Proceedings of the 49th ACM Symposium on Theory of Computing, STOC 2017","author":"Ta-Shma Amnon","year":"2017","unstructured":"Amnon Ta-Shma. Explicit, almost optimal, epsilon-balanced codes. In Proceedings of the 49th ACM Symposium on Theory of Computing, STOC 2017, pages 238\u2013251, New York, NY, USA, 2017. ACM."},{"key":"e_1_3_2_1_65_1","volume-title":"Now Publishers Inc","author":"Vadhan Salil P.","year":"2012","unstructured":"Salil P. Vadhan. Pseudorandomness. Now Publishers Inc., 2012."},{"key":"e_1_3_2_1_66_1","first-page":"739","article-title":"Estimate of the number of signals in error correcting codes","volume":"117","author":"Varshamov R.R.","year":"1957","unstructured":"R.R. Varshamov. Estimate of the number of signals in error correcting codes. Doklady Akademii Nauk SSSR, 117:739\u2013741, 1957.","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"e_1_3_2_1_67_1","doi-asserted-by":"publisher","DOI":"10.1145\/3658665"},{"key":"e_1_3_2_1_68_1","volume-title":"Problems of Information Transmission","author":"Victor","year":"1982","unstructured":"Victor V. Zyablov and Mark S. Pinsker. List cascade decoding. Problems of Information Transmission, 1982."}],"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.3800795","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:57:00Z","timestamp":1781027820000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":68,"alternative-id":["10.1145\/3798129.3800795","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800795","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"}}]}}