{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:31:13Z","timestamp":1780054273096,"version":"3.54.0"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,4,1]],"date-time":"2023-04-01T00:00:00Z","timestamp":1680307200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1814603"],"award-info":[{"award-number":["CCF-1814603"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-2210823"],"award-info":[{"award-number":["CCF-2210823"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Simons Investigator Award"},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DGE-1656518"],"award-info":[{"award-number":["DGE-1656518"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DGE-1656518"],"award-info":[{"award-number":["DGE-1656518"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1814629"],"award-info":[{"award-number":["CCF-1814629"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jacob Fox\u2019s Packard Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1109\/tit.2022.3223023","type":"journal-article","created":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T20:38:18Z","timestamp":1668717498000},"page":"2218-2239","source":"Crossref","is-referenced-by-count":10,"title":["The Zero-Rate Threshold for Adversarial Bit-Deletions is Less Than 1\/2"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7926-3396","authenticated-orcid":false,"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[{"name":"Departments of EECS and Mathematics, Simons Institute for the Theory of Computing, UC Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2958-6845","authenticated-orcid":false,"given":"Xiaoyu","family":"He","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Princeton University, Princeton, NJ, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3441-2364","authenticated-orcid":false,"given":"Ray","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Stanford University, Stanford, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2968298"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541373"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2070170"},{"key":"ref14","first-page":"5:1","article-title":"Sharp threshold rates for random codes","volume":"185","author":"guruswami","year":"2021","journal-title":"Proc 12th Innov Theor Comput Sci Conf"},{"key":"ref31","article-title":"Beyond unique decoding: Topics in error-correcting codes","author":"wang","year":"2015"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053954"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384262"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/S0021900200047999"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ITA50056.2020.9244978"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2013.01.001"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2018.05.013"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00029"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188940"},{"key":"ref18","first-page":"491","article-title":"Quasi-random words and limits of word sequences","author":"h\u00e0n","year":"2021","journal-title":"Proc Latin Amer Symp Theor Informat"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516519"},{"key":"ref23","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"10","author":"vladmir","year":"1966","journal-title":"Sov Phys Doklady"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3056317"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2011.5743594"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2004.10.012"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/18.796406"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174009"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/b13794"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00028"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-016-1323-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2997329"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2621044"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/140975000"},{"key":"ref5","first-page":"7","article-title":"Bounds for codes in the case of list decoding of finite volume","volume":"22","author":"blinovsky","year":"1986","journal-title":"Problems Inf Transmiss"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10073961\/9954058-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10073961\/09954058.pdf?arnumber=9954058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,10]],"date-time":"2023-04-10T19:09:29Z","timestamp":1681153769000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9954058\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4]]},"references-count":32,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3223023","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4]]}}}