{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:51Z","timestamp":1773376611563,"version":"3.50.1"},"reference-count":9,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206888","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"850-855","source":"Crossref","is-referenced-by-count":6,"title":["The size of Levenshtein ball with radius 2: Expectation and concentration bound"],"prefix":"10.1109","author":[{"given":"Lang","family":"He","sequence":"first","affiliation":[]},{"given":"Min","family":"Ye","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref8","first-page":"1","article-title":"On the size of balls and anticodes of small diameter under the fixed-length Levenshtein metric","author":"bar-lev","year":"2022","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517922"},{"key":"ref9","article-title":"On the size distribution of Levenshtein balls with radius one","author":"wang","year":"2022"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2413958"},{"key":"ref3","first-page":"123","article-title":"Tight bounds on the number of string subsequences","volume":"1","author":"hirschberg","year":"2000","journal-title":"Journal of Discrete Algorithms"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620761"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(69)90442-2"},{"key":"ref1","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Physics Doklady"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206888.pdf?arnumber=10206888","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:56Z","timestamp":1773347216000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206888\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206888","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}