{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:57Z","timestamp":1773376977805,"version":"3.50.1"},"reference-count":50,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195412","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Decoding Insertions\/Deletions via List Recovery"],"prefix":"10.1109","author":[{"given":"Anisha","family":"Banerjee","sequence":"first","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich (TUM),Munich,Germany"}]},{"given":"Roni","family":"Con","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"}]},{"given":"Antonia","family":"Wachter-Zeh","sequence":"additional","affiliation":[{"name":"Institute for Communications Engineering, Technical University of Munich (TUM),Munich,Germany"}]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[{"name":"Technion - Israel Institute of Technology,Department of Computer Science,Haifa,Israel,3200003"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.796406"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023642"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3468265"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2746566"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659765"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2661747"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2876281"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3561046"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174241"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9173986"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00029"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3056317"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384262"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.2"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3223023"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/08-PS141"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2997329"},{"key":"ref19","article-title":"Synchronization strings: List decoding for insertions and deletions","author":"Haeupler","year":"2018","journal-title":"45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743426"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-44993-5_6"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-7865-4_24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-006-9032-7"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3065618"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2021.101841"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3237711"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3387848"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3398587"},{"key":"ref29","article-title":"Random reed-solomon codes achieve the half-singleton bound for insertions and deletions over linear-sized alphabets","author":"Con","year":"2024","journal-title":"arXiv preprint arXiv"},{"key":"ref30","article-title":"Optimally decoding two-dimensional reed-solomon codes up to the half-singleton bound","author":"Singhvi","year":"2024","journal-title":"arXiv preprint arXiv"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/18.910582"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.819332"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1538902.1538904"},{"key":"ref34","article-title":"High-probability list-recovery, and applications to heavy hitters","volume-title":"Leibniz international proceedings in informatics","author":"Doron"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.91"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.42"},{"key":"ref37","article-title":"On the list recoverability of randomly punctured codes","author":"Lund","year":"2020","journal-title":"arXiv preprint arXiv"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3402171"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/21M1463707"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3023962"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3206527"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ITW55543.2023.10161631"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174050"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517821"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1998.743426"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3405322"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/isit63088.2025.11195607"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195412.pdf?arnumber=11195412","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:43Z","timestamp":1773347383000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195412\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195412","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}