{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:40:10Z","timestamp":1760028010076,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T00:00:00Z","timestamp":1685664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-2210823, CCF-2228287, CCF-2006455, CCF-2107345, CCF-1814603, CCF-2107347, 1916939"],"award-info":[{"award-number":["CCF-2210823, CCF-2228287, CCF-2006455, CCF-2107345, CCF-1814603, CCF-2107347, 1916939"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["SIEVE"],"award-info":[{"award-number":["SIEVE"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","award":["UIDB\/04516\/2020"],"award-info":[{"award-number":["UIDB\/04516\/2020"]}]},{"name":"Department of Energy","award":["NETL"],"award-info":[{"award-number":["NETL"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,2]]},"DOI":"10.1145\/3564246.3585214","type":"proceedings-article","created":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T17:34:20Z","timestamp":1684258460000},"page":"553-566","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All \u2113\n            <i>\n              <sub>p<\/sub>\n            <\/i>\n            Norms"],"prefix":"10.1145","author":[{"given":"Huck","family":"Bennett","sequence":"first","affiliation":[{"name":"Oregon State University, USA"}]},{"given":"Mahdi","family":"Cheraghchi","sequence":"additional","affiliation":[{"name":"University of Michigan, USA"}]},{"given":"Venkatesan","family":"Guruswami","sequence":"additional","affiliation":[{"name":"University of California at Berkeley, Berkeley, USA"}]},{"given":"Jo\u00e3o","family":"Ribeiro","sequence":"additional","affiliation":[{"name":"NOVA-LINCS, Portugal \/ Universidade Nova de Lisboa, Portugal"}]}],"member":"320","published-online":{"date-parts":[[2023,6,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.109"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188840"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276705"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1472"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2340869"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.11"},{"key":"e_1_3_2_1_7_1","unstructured":"Huck Bennett and Chris Peikert. 2022. Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes. arxiv:2202.07736. \t\t\t\t  Huck Bennett and Chris Peikert. 2022. Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes. arxiv:2202.07736."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2022.19"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055873"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3444942"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2018.17"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(60)90287-4"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.1998.694590"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2209198"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00290-0"},{"key":"e_1_3_2_1_17_1","unstructured":"Irit Dinur. 2016. Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover.  https:\/\/eccc.weizmann.ac.il\/report\/2016\/128\/ \t\t\t\t  Irit Dinur. 2016. Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover.  https:\/\/eccc.weizmann.ac.il\/report\/2016\/128\/"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797323571"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.806118"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.3390\/a13060146"},{"volume-title":"BCH, Reed-Muller, and concatenated codes. Lecture notes for the \u201cIntroduction to Coding Theory","author":"Guruswami Venkatesan","key":"e_1_3_2_1_23_1","unstructured":"Venkatesan Guruswami . 2010. Notes 6 : Reed-Solomon , BCH, Reed-Muller, and concatenated codes. Lecture notes for the \u201cIntroduction to Coding Theory \u201d course at CMU , available at https:\/\/www.cs.cmu.edu\/ venkatg\/teaching\/codingtheory\/notes\/notes6.pdf Venkatesan Guruswami. 2010. Notes 6: Reed-Solomon, BCH, Reed-Muller, and concatenated codes. Lecture notes for the \u201cIntroduction to Coding Theory\u201d course at CMU, available at https:\/\/www.cs.cmu.edu\/ venkatg\/teaching\/codingtheory\/notes\/notes6.pdf"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a023"},{"key":"e_1_3_2_1_25_1","first-page":"147","article-title":"Codes correcteurs d\u2019erreurs","volume":"2","author":"Hocquenghem Alexis","year":"1959","unstructured":"Alexis Hocquenghem . 1959 . Codes correcteurs d\u2019erreurs . Chiffres , 2 (1959), 147 \u2013 156 . Alexis Hocquenghem. 1959. Codes correcteurs d\u2019erreurs. Chiffres, 2 (1959), 147\u2013156.","journal-title":"Chiffres"},{"key":"e_1_3_2_1_26_1","unstructured":"Subhash Khot. 2004. Lecture 6: Minimum distance of a linear code. Lecture notes for CS 8002: PCPs and Hardness of Approximation taught at Georgia Tech. Available at. https:\/\/cs.nyu.edu\/ khot\/pcp-lecnotes\/lec6.ps \t\t\t\t  Subhash Khot. 2004. Lecture 6: Minimum distance of a linear code. Lecture notes for CS 8002: PCPs and Hardness of Approximation taught at Georgia Tech. Available at. https:\/\/cs.nyu.edu\/ khot\/pcp-lecnotes\/lec6.ps"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089023.1089027"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212622"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.134"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.5"},{"key":"e_1_3_2_1_31_1","unstructured":"Pasin Manurangsi. 2022. Personal communication. \t\t\t\t  Pasin Manurangsi. 2022. Personal communication."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2017.78"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700373039"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a022"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2014.17"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132581"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch121"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00027"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.641542"}],"event":{"name":"STOC '23: 55th Annual ACM Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Orlando FL USA","acronym":"STOC '23"},"container-title":["Proceedings of the 55th Annual ACM Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585214","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585214","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3564246.3585214","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:01Z","timestamp":1750178821000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3564246.3585214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,2]]},"references-count":39,"alternative-id":["10.1145\/3564246.3585214","10.1145\/3564246"],"URL":"https:\/\/doi.org\/10.1145\/3564246.3585214","relation":{},"subject":[],"published":{"date-parts":[[2023,6,2]]},"assertion":[{"value":"2023-06-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}