{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:53:20Z","timestamp":1787500400326,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,1,11]],"date-time":"2015-01-11T00:00:00Z","timestamp":1420934400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-0844796"],"award-info":[{"award-number":["CCF-0844796"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007270","name":"University of Michigan","doi-asserted-by":"publisher","award":["Rackham Predoctoral Fellowship"],"award-info":[{"award-number":["Rackham Predoctoral Fellowship"]}],"id":[{"id":"10.13039\/100007270","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,1,11]]},"DOI":"10.1145\/2688073.2688092","type":"proceedings-article","created":{"date-parts":[[2015,1,12]],"date-time":"2015-01-12T15:42:45Z","timestamp":1421077365000},"page":"287-296","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["It'll Probably Work Out"],"prefix":"10.1145","author":[{"given":"Atri","family":"Rudra","sequence":"first","affiliation":[{"name":"University at Buffalo, SUNY, Buffalo, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mary","family":"Wootters","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2015,1,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627848"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214010"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/090778274"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/874063.875548"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780562"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.855587"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.71"},{"key":"e_1_3_2_1_9_1","volume-title":"RANDOM","author":"Guruswami Venkatesan","year":"2013"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.911222"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1467247.1467269"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2059572"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/2013878.2014014"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2246813"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214009"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488715"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634208"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/080734030"},{"key":"e_1_3_2_1_20_1","volume-title":"List-decoding multiplicity codes. Electronic Colloquium on Computational Complexity (ECCC), 19:44","author":"Kopparty Swastik","year":"2012"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.29"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591797"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.556668"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/346048.346049"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946354"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488716"},{"key":"e_1_3_2_1_27_1","first-page":"90","article-title":"Quarterly Progress Report, Research Laboratory of Electronics","volume":"48","author":"Wozencraft John M.","year":"1958","journal-title":"MIT"},{"issue":"4","key":"e_1_3_2_1_28_1","first-page":"29","article-title":"List cascade decoding","volume":"17","author":"Zyablov Victor V.","year":"1981","journal-title":"Problems of Information Transmission"}],"event":{"name":"ITCS'15: Innovations in Theoretical Computer Science","location":"Rehovot Israel","acronym":"ITCS'15","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688073.2688092","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2688073.2688092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:03Z","timestamp":1750212783000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2688073.2688092"}},"subtitle":["Improved List-Decoding Through Random Operations"],"short-title":[],"issued":{"date-parts":[[2015,1,11]]},"references-count":26,"alternative-id":["10.1145\/2688073.2688092","10.1145\/2688073"],"URL":"https:\/\/doi.org\/10.1145\/2688073.2688092","relation":{},"subject":[],"published":{"date-parts":[[2015,1,11]]},"assertion":[{"value":"2015-01-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}