{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:58:09Z","timestamp":1781218689364,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":65,"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\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2503280"],"award-info":[{"award-number":["DMS-2503280"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"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"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2440926"],"award-info":[{"award-number":["CCF-2440926"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["Simons Investigator award"],"award-info":[{"award-number":["Simons Investigator award"]}],"id":[{"id":"10.13039\/100000893","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.3800756","type":"proceedings-article","created":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T17:53:56Z","timestamp":1781027636000},"page":"365-376","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Combinatorial Bounds for List Recovery via Discrete Brascamp-Lieb Inequalities"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4149-7298","authenticated-orcid":false,"given":"Joshua","family":"Brakensiek","sequence":"first","affiliation":[{"name":"University of California at Berkeley, Berkeley, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5696-4628","authenticated-orcid":false,"given":"Yeyuan","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Michigan, Ann Arbor, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-5570-7116","authenticated-orcid":false,"given":"Manik","family":"Dhar","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5393-514X","authenticated-orcid":false,"given":"Zihan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Ohio State University, Columbus, 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.1109\/SFCS.1995.492581"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.19086\/aic.2025.8"},{"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.1145\/258533.258642"},{"key":"e_1_3_2_1_5_1","volume-title":"Finite bounds for Holder-Brascamp-Lieb multilinear inequalities. arXiv preprint math\/0505691","author":"Bennett Jonathan","year":"2005","unstructured":"Jonathan Bennett, Anthony Carbery, Michael Christ, and Terence Tao. 2005. Finite bounds for Holder-Brascamp-Lieb multilinear inequalities. arXiv preprint math\/0505691 (2005)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-007-0619-6"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0305004121000608"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1112\/plms.12633"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00220-023-04678-w"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2510.13775"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2510"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3564246.3585128"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0001-8708(76)90184-5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49116-3_8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00039-009-0001-y"},{"key":"e_1_3_2_1_16_1","volume-title":"Evidence Toward a Conjecture in List Recoverability of Folded Reed-Solomon Codes. Manuscript","author":"Chen Yeyuan","year":"2025","unstructured":"Yeyuan Chen, Mahdi Cheraghchi, King-Siong Si, and Zihan Zhang. 2025. Evidence Toward a Conjecture in List Recoverability of Folded Reed-Solomon Codes. Manuscript (2025)."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3717823.3718114"},{"key":"e_1_3_2_1_18_1","volume-title":"The optimal constants in Holder-Brascamp-Lieb inequalities for discrete Abelian groups. arXiv preprint arXiv:1307.8442","author":"Christ Michael","year":"2013","unstructured":"Michael Christ. 2013. The optimal constants in Holder-Brascamp-Lieb inequalities for discrete Abelian groups. arXiv preprint arXiv:1307.8442 (2013)."},{"key":"e_1_3_2_1_19_1","volume-title":"Communication lower bounds and optimal algorithms for programs that reference arrays-Part 1. arXiv preprint arXiv:1308.0068","author":"Christ Michael","year":"2013","unstructured":"Michael Christ, James Demmel, Nicholas Knight, Thomas Scanlon, and Katherine Yelick. 2013. Communication lower bounds and optimal algorithms for programs that reference arrays-Part 1. arXiv preprint arXiv:1308.0068 (2013)."},{"key":"e_1_3_2_1_20_1","volume-title":"On multilinear inequalities of H\u00f6lder-Brascamp-Lieb type for torsionfree discrete abelian groups. Journal of Logic and Analysis 16","author":"Christ Michael","year":"2024","unstructured":"Michael Christ, James Demmel, Nicholas Knight, Thomas Scanlon, and Katherine Yelick. 2024. On multilinear inequalities of H\u00f6lder-Brascamp-Lieb type for torsionfree discrete abelian groups. Journal of Logic and Analysis 16 (2024)."},{"key":"e_1_3_2_1_21_1","volume-title":"Parallelepipeds obtaining HBL lower bounds. arXiv preprint arXiv:1611.05944","author":"Demmel James","year":"2016","unstructured":"James Demmel and Alex Rusciano. 2016. Parallelepipeds obtaining HBL lower bounds. arXiv preprint arXiv:1611.05944 (2016)."},{"key":"e_1_3_2_1_22_1","first-page":"1","article-title":"High-Probability List-Recovery, and Applications to Heavy Hitters. In 49th International Colloquium on Automata, Languages, and Programming (ICALP) (LIPIcs, Vol. 229)","volume":"55","author":"Doron Dean","year":"2022","unstructured":"Dean Doron and Mary Wootters. 2022. High-Probability List-Recovery, and Applications to Heavy Hitters. In 49th International Colloquium on Automata, Languages, and Programming (ICALP) (LIPIcs, Vol. 229). Schloss Dagstuhl -Leibniz- Zentrum f\u00fcr Informatik, 55:1-55:17.","journal-title":"Schloss Dagstuhl -Leibniz- Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_23_1","first-page":"99","volume-title":"Wescon Convention Record, Part 2, Institute of Radio Engineers","author":"Elias Peter","year":"1957","unstructured":"Peter Elias. 1957. List decoding for noisy channels. Wescon Convention Record, Part 2, Institute of Radio Engineers (1957), 99-104."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch62"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-019-09417-z"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3222877"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1137\/21M1463707"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS57990.2023.00019"},{"key":"e_1_3_2_1_30_1","volume-title":"List decoding of error correcting codes. Ph. D. Dissertation","author":"Guruswami Venkatesan","unstructured":"Venkatesan Guruswami. 2001. List decoding of error correcting codes. Ph. D. Dissertation. Massachusetts Institute of Technology. http:\/\/dspace.mit.edu\/ handle\/1721.1\/8700"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959942"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-014-3169-1"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3127126"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of the 38th Annual ACM Symposium on Theory of Computing. 1-10","author":"Guruswami Venkatesan","year":"2006","unstructured":"Venkatesan Guruswami and Atri Rudra. 2006. Explicit capacity-achieving listdecodable codes. In Proceedings of the 38th Annual ACM Symposium on Theory of Computing. 1-10."},{"key":"e_1_3_2_1_35_1","unstructured":"Venkatesan Guruswami and Madhu Sudan. 2001. Extensions to the Johnson bound. https:\/\/api.semanticscholar.org\/CorpusID:9865945"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538904"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2246813"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488715"},{"key":"e_1_3_2_1_39_1","volume-title":"Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms. SIAM, 1126-1142","author":"Indyk Piotr","year":"2010","unstructured":"Piotr Indyk, Hung Q Ngo, and Atri Rudra. 2010. Efficiently decodable nonadaptive group testing. In Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms. SIAM, 1126-1142."},{"key":"e_1_3_2_1_40_1","volume-title":"Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes. arXiv preprint arXiv:2510.06185","author":"Jeronimo Fernando Granha","year":"2025","unstructured":"Fernando Granha Jeronimo and Nikhil Shagrithaya. 2025. Probabilistic Guarantees to Explicit Constructions: Local Properties of Linear Codes. arXiv preprint arXiv:2510.06185 (2025)."},{"key":"e_1_3_2_1_41_1","first-page":"12","article-title":"Unbalanced expanders from multiplicity codes. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2022)","author":"Kalev Itay","year":"2022","unstructured":"Itay Kalev and Amnon Ta-Shma. 2022. Unbalanced expanders from multiplicity codes. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2022). Schloss Dagstuhl-Leibniz- Zentrum f\u00fcr Informatik, 12-1.","journal-title":"Schloss Dagstuhl-Leibniz- Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2015.v011a005"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00029"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1370215"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.819333"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.16"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Matan Levi Jonathan Mosheiff and Nikhil Shagrithaya. 2025. Random Reed-Solomon Codes and Random Linear Codes are Locally Equivalent. arXiv:2406.02238 [cs.IT] https:\/\/arxiv.org\/abs\/2406.02238","DOI":"10.1109\/FOCS63196.2025.00112"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPICS.APPROX\/RANDOM.2025.53"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1323345"},{"key":"e_1_3_2_1_50_1","first-page":"1","article-title":"On the List Recoverability of Randomly Punctured Codes. In Approximation, Randomization, and Combinatorial Optimization. Algorithms (APPROX\/RANDOM) (LIPIcs, Vol. 176)","volume":"30","author":"Lund Ben","year":"2020","unstructured":"Ben Lund and Aditya Potukuchi. 2020. On the List Recoverability of Randomly Punctured Codes. In Approximation, Randomization, and Combinatorial Optimization. Algorithms (APPROX\/RANDOM) (LIPIcs, Vol. 176). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 30:1-30:11.","journal-title":"Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_51_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Ngo Hung Q","unstructured":"Hung Q Ngo, Ely Porat, and Atri Rudra. 2011. Efficiently decodable errorcorrecting list disjunct matrices and applications. In International Colloquium on Automata, Languages, and Programming. Springer, 557-568."},{"key":"e_1_3_2_1_52_1","volume-title":"List-decodable codes:(randomized) constructions and applications. Ph. D. Dissertation","author":"Resch Nicolas","year":"2020","unstructured":"Nicolas Resch. 2020. List-decodable codes:(randomized) constructions and applications. Ph. D. Dissertation. Carnegie Mellon University. http:\/\/reportsarchive.adm.cs.cmu.edu\/anon\/anon\/home\/ftp\/2020\/CMU-CS-20-113.pdf"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","unstructured":"Nicolas Resch and S. Venkitesh. 2025. List Recoverable Codes: The Good the Bad and the Unknown (Hopefully Not Ugly). arXiv:2510.07597 (Oct. 2025). https:\/\/doi.org\/10.48550\/arXiv.2510.07597 arXiv:2510.07597 [cs] 10.48550\/arXiv.2510.07597","DOI":"10.48550\/arXiv.2510.07597"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591797"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.42"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M138795X"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978322.64"},{"key":"e_1_3_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2504.20333"},{"key":"e_1_3_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1999.766253"},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2012.25"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-007-0053-2"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3402171"},{"key":"e_1_3_2_1_63_1","volume-title":"Proceedings of the thirty-first annual ACM symposium on Theory of computing. 141-148","author":"Trevisan Luca","year":"1999","unstructured":"Luca Trevisan. 1999. Construction of extractors using pseudo-random generators. In Proceedings of the thirty-first annual ACM symposium on Theory of computing. 141-148."},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019"},{"key":"e_1_3_2_1_65_1","first-page":"29","article-title":"List concatenated decoding","volume":"17","author":"Zyablov Victor Vasilievich","year":"1981","unstructured":"Victor Vasilievich Zyablov and Mark Semenovich Pinsker. 1981. List concatenated decoding. Problemy Peredachi Informatsii 17, 4 (1981), 29-33.","journal-title":"Problemy Peredachi Informatsii"}],"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.3800756","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3798129.3800756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T22:32:25Z","timestamp":1781217145000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3798129.3800756"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,9]]},"references-count":65,"alternative-id":["10.1145\/3798129.3800756","10.1145\/3798129"],"URL":"https:\/\/doi.org\/10.1145\/3798129.3800756","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"}}]}}