{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:02Z","timestamp":1773376622128,"version":"3.50.1"},"reference-count":34,"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.10206676","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1294-1299","source":"Crossref","is-referenced-by-count":4,"title":["Gapped Binomial Complexities in Sequences"],"prefix":"10.1109","author":[{"given":"Michel","family":"Rigo","sequence":"first","affiliation":[{"name":"University of Liège,Department of Mathematics,Liège,Belgium,4000"}]},{"given":"Manon","family":"Stipulanti","sequence":"additional","affiliation":[{"name":"University of Liège,Department of Mathematics,Liège,Belgium,4000"}]},{"given":"Markus A.","family":"Whiteland","sequence":"additional","affiliation":[{"name":"University of Liège,Department of Mathematics,Liège,Belgium,4000"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(75)90012-2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.indag.2016.11.018"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1017\/S014338570200055X"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563"},{"key":"ref5","article-title":"String attractors for automatic sequences","author":"Schaeffer","year":"2021"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-20624-5_26"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834537"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00222-1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.08.012"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-05188-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/s41596-019-0244-5"},{"key":"ref12","first-page":"56","article-title":"The reconstruction of a word from fragments","author":"Kala\u0161nik","year":"1973","journal-title":"Numerical mathematics and computer technology, No. IV (Russian). Akad. Nauk Ukrain. SSR Fiz.-Tehn-Inst. Nizkih Temperatur, Kharkov"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90026-X"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054121420016"},{"key":"ref15","article-title":"Reconstructing words using queries on subwords or factors","author":"Richomme","year":"2023"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2013.08.008"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0551-0_1"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.5802\/jtnb.906"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2020.105284"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.37236\/4478"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.05.047"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.07.025"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45535-3_19"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511777653"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(80)90493-3"},{"key":"ref27","first-page":"239","article-title":"Testing k-binomial equivalence","volume-title":"Multidisciplinary Creativity: homage to Gheorghe Paun on his 65th birthday.","author":"Freydenberger","year":"2015"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/0221017"},{"key":"ref29","article-title":"IntegerSequences","volume-title":"Mathematica package","author":"Rowland"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019"},{"key":"ref31","article-title":"Characterizations of families of morphisms and words via binomial complexities","author":"Rigo","year":"2022"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-07407-4_23"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2004.06.011"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.06.010"}],"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\/10206676.pdf?arnumber=10206676","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:01Z","timestamp":1773347221000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206676\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":34,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206676","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}