{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:57:32Z","timestamp":1773377852044,"version":"3.50.1"},"reference-count":31,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1910659,CCF-1910411"],"award-info":[{"award-number":["CCF-1910659,CCF-1910411"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Investigator Award","doi-asserted-by":"publisher","award":["CCF 1715187"],"award-info":[{"award-number":["CCF 1715187"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517874","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2531-2536","source":"Crossref","is-referenced-by-count":2,"title":["Limitations of Mean-Based Algorithms for Trace Reconstruction at Small Distance"],"prefix":"10.1109","author":[{"given":"Elena","family":"Grigorescu","sequence":"first","affiliation":[{"name":"Purdue University,Department of Computer Science"}]},{"given":"Madhu","family":"Sudant","sequence":"additional","affiliation":[{"name":"Harvard University.,School of Engineering and Applied Sciences"}]},{"given":"Minshen","family":"Zhu","sequence":"additional","affiliation":[{"name":"Purdue University,Department of Computer Science"}]}],"member":"263","reference":[{"key":"ref31","first-page":"3","article-title":"The Prouhet-Tarry-Escott problem revisited","volume":"40","author":"borwein","year":"1994","journal-title":"Enseign Math"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1112\/S0024611599011831"},{"key":"ref10","first-page":"1799","article-title":"Subpolynomial trace reconstruction for random strings and arbitrary deletion probability","volume":"75","author":"holden","year":"2018","journal-title":"COLT"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1214\/19-AAP1506"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975062.6"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2935973"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989261"},{"key":"ref15","first-page":"68:1","article-title":"Trace reconstruction: Generalized and parameterized","volume":"144","author":"krishnamurthy","year":"2019","journal-title":"ESA"},{"key":"ref16","author":"brakensiek","year":"2020","journal-title":"Coded trace reconstruction in a constant number of traces"},{"key":"ref17","author":"chen","year":"2020","journal-title":"Polynomial-time trace reconstruction in the smoothed complexity model"},{"key":"ref18","author":"chase","year":"2020","journal-title":"New upper bounds for trace reconstruction"},{"key":"ref19","author":"narayanan","year":"2020","journal-title":"Circular trace reconstruction"},{"key":"ref28","article-title":"Coppersmith-rivlin type inequalities and the order of vanishing of polynomials at 1","author":"erd\u00e9lyi","year":"2014","journal-title":"ArXiv Preprint"},{"key":"ref4","first-page":"389","article-title":"Trace reconstruction with constant deletion probability and related results","author":"holenstein","year":"2008","journal-title":"SODA"},{"key":"ref27","author":"descartes","year":"1886","journal-title":"La géométric"},{"key":"ref3","first-page":"399","article-title":"Improved string reconstruction over insertion-deletion channels","author":"viswanathan","year":"2008","journal-title":"SODA"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.29"},{"key":"ref29","author":"erd\u00e9lyi","year":"2019","journal-title":"On the multiplicity of the zeros of polynomials with constrained coefficients"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_57"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055450"},{"key":"ref7","first-page":"1042","article-title":"Trace reconstruction with exp(O(n1\/3)) samples","author":"nazarov","year":"2017","journal-title":"STOC"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523342"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006740"},{"key":"ref1","first-page":"910","article-title":"Reconstructing strings from random traces","author":"batu","year":"2004","journal-title":"SODA"},{"key":"ref20","article-title":"New lower bounds for trace reconstruction","author":"chase","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1997.2732"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1512\/iumj.1997.46.1435"},{"key":"ref24","article-title":"Limitations of mean-based algorithms for trace reconstruction at small distance","volume":"abs 2011 13737","author":"grigorescu","year":"2020","journal-title":"CoRR"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(96)00153-7"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.2307\/2309513"},{"key":"ref25","first-page":"1851","article-title":"Mémoire sur quelques relations entre les puissances des nombres","volume":"33","author":"prouhet","year":"1851","journal-title":"CR Acad Sci Paris"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517874.pdf?arnumber=9517874","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:21Z","timestamp":1773347721000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517874\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517874","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}