{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T04:12:23Z","timestamp":1748059943202,"version":"3.41.0"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2025,6,1]],"date-time":"2025-06-01T00:00:00Z","timestamp":1748736000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"European Research Council (ERC) Advanced","award":["101020255"],"award-info":[{"award-number":["101020255"]}]},{"DOI":"10.13039\/501100001659","name":"German Research Foundation","doi-asserted-by":"crossref","award":["KO 1053\/8\u20132"],"award-info":[{"award-number":["KO 1053\/8\u20132"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1109\/tit.2025.3557393","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T18:25:37Z","timestamp":1743704737000},"page":"4260-4266","source":"Crossref","is-referenced-by-count":0,"title":["New Bounds for the Optimal Density of Covering Single-Insertion Codes via the Tur\u00e1n Density"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9657-4011","authenticated-orcid":false,"given":"Oleg","family":"Pikhurko","sequence":"first","affiliation":[{"name":"Mathematics Institute and DIMAP, University of Warwick, Coventry, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9524-1901","authenticated-orcid":false,"given":"Oleg","family":"Verbitsky","sequence":"additional","affiliation":[{"name":"Institut für Informatik, Humboldt-Universität zu Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8763-9533","authenticated-orcid":false,"given":"Maksim","family":"Zhukovskii","sequence":"additional","affiliation":[{"name":"School of Computer Science, The University of Sheffield, Sheffield, U.K."}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.66"},{"key":"ref2","first-page":"4","article-title":"Anchor-points algorithms for Hamming and edit distances using MapReduce","volume-title":"Proc. 17th Int. Conf. Database Theory (ICDT)","author":"Afrati"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3030569"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1998.2961"},{"key":"ref5","first-page":"5","article-title":"Extension of a theorem of moon and Moser on complete subgraphs","volume":"16","author":"de Caen","year":"1983","journal-title":"Ars Combinatoria"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(83)90045-X"},{"key":"ref7","first-page":"187","article-title":"The current status of Tur\u00e1n\u2019s problem on hypergraphs","volume-title":"Extremal Problems for Finite Sets","volume":"3","author":"de Caen","year":"1991"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2012.06.022"},{"volume-title":"The Optimal Densities of Covering Single-Insertion Codes","year":"2024","author":"Grozea","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139004114.004"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-004-3804-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2985691"},{"key":"ref13","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Sov. Phys. Doklady"},{"issue":"2","key":"ref14","first-page":"241","article-title":"Perfect codes in the metric of deletions and insertions","volume":"3","author":"Levenshtein","year":"1992","journal-title":"Discrete Math. Appl."},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/070710615"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.aim.2025.110148"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/090747476"},{"key":"ref18","first-page":"649","article-title":"Tur\u00e1n systems","volume-title":"CRC Handbook of Combinatorial Designs","author":"Ruszink\u00f3","year":"2007"},{"issue":"1","key":"ref19","first-page":"3","article-title":"The quadratic form method in the combinatorial Turan problem","volume":"1982","author":"Sidorenko","year":"1982","journal-title":"Vestn. Mosk. Univ., I"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01929486"},{"key":"ref21","first-page":"277","article-title":"Bounds on the cardinality of clique-free family in hypergraphs","volume":"11","author":"Tazawa","year":"1983","journal-title":"Math. Sem. Notes Kobe Univ."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(83)90035-3"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11011509\/10948504.pdf?arnumber=10948504","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T17:04:14Z","timestamp":1748019854000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10948504\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6]]},"references-count":22,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3557393","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2025,6]]}}}