{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T09:54:44Z","timestamp":1740131684163,"version":"3.37.3"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T00:00:00Z","timestamp":1569888000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1149018"],"award-info":[{"award-number":["CCF-1149018"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF-1149018"],"award-info":[{"award-number":["CCF-1149018"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1109\/tit.2019.2916927","type":"journal-article","created":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T20:50:13Z","timestamp":1557953413000},"page":"5971-6000","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Interactive Coding for Insertions, Deletions, and Substitutions"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2488-7852","authenticated-orcid":false,"given":"Alexander A.","family":"Sherstov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4418-5900","authenticated-orcid":false,"given":"Pei","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973730.86"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2294186"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.49"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591872"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.32"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17364-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054893"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488699"},{"key":"ref18","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Phys Doklady"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021303"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.33"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.39"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2353994"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2734881"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2367094"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2582176"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2661628"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541368"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1561\/0400000079"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267778"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.556671"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167279"},{"key":"ref24","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"yao","year":"1979","journal-title":"Proc 11th Annu ACM Symp Theory Comput (STOC)"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.796406"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8836351\/8715460-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8836351\/08715460.pdf?arnumber=8715460","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T21:07:57Z","timestamp":1657746477000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8715460\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10]]},"references-count":24,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2019.2916927","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2019,10]]}}}