{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:36:25Z","timestamp":1767915385775,"version":"3.49.0"},"reference-count":195,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/jsait.2025.3595457","type":"journal-article","created":{"date-parts":[[2025,8,4]],"date-time":"2025-08-04T18:47:48Z","timestamp":1754333268000},"page":"352-366","source":"Crossref","is-referenced-by-count":0,"title":["Survey of Sequence Reconstruction Problems and Their Applications in DNA-Based Storage"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-8771-4965","authenticated-orcid":false,"given":"Yaoyu","family":"Yang","sequence":"first","affiliation":[{"name":"School of Science and Engineering, The Chinese University of Hong Kong, Shenzhen, Shenzhen, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(91)90026-X"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.2023"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/nature24286"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.csbj.2019.11.002"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/s41576-019-0125-3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/s43588-024-00717-1"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3030569"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-51730-3"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3227128"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3304565"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.1997.2732"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.3390\/math7030227"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0097-3165(03)00103-1"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0551-0_1"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISCIT.2019.8905191"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006740"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834537"},{"key":"ref19","first-page":"910","article-title":"Reconstructing strings from random traces","volume-title":"Proc. ACM\/SIAM Symp. Discr. Algorithm (SODA)","author":"Batu"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44777-2_57"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451118"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1214\/20-AIHP1089"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1214\/19-AAP1506"},{"key":"ref24","first-page":"389","article-title":"Trace reconstruction with constant deletion probability and related results","volume-title":"Proc. ACM\/SIAM Symp. Discr. Algorithm (SODA)","author":"Holenstein"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055494"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3168624"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055450"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3541375"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3418377"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611978315.31"},{"key":"ref31","first-page":"52","article-title":"Trace reconstruction from local statistical queries","volume-title":"Proc. Approx. Random. Comb. Optim. Algorithms Techn. (APPROX\/RANDOM)","volume":"317","author":"Chen"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.29"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.4171\/msl\/16"},{"key":"ref34","first-page":"102","article-title":"Average-case to (shifted) worst-case reduction for the trace reconstruction problem","volume-title":"Proc. 50th Int. Colloq. Autom. Lang. Program. (ICALP)","author":"Rubinstein"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2996377"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00052"},{"key":"ref37","article-title":"Approximate trace reconstruction of random strings from a constant number of traces","author":"Chase","year":"2021","journal-title":"arXiv:2107.06454"},{"key":"ref38","article-title":"Near-optimal trace reconstruction for mildly separated strings","author":"Aamand","year":"2024","journal-title":"arXiv:2411.18765"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3066010"},{"key":"ref40","first-page":"18","article-title":"Circular trace reconstruction","volume-title":"Proc. 12th Innov. Theor. Comput. Sci. Conf. (ITCS)","author":"Narayanan"},{"key":"ref41","article-title":"Trace reconstruction of first-order Reed-Muller codewords using run statistics","author":"Rathore","year":"2025","journal-title":"arXiv:2501.11393"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977554.ch27"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2997329"},{"issue":"8","key":"ref44","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Soviet Phys. Doklady"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3069446"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3285012"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3028702"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3417894"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517821"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/CISS59072.2024.10480213"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/CISS59072.2024.10480213"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1006\/jcta.2000.3081"},{"issue":"5","key":"ref53","first-page":"593","article-title":"Reconstruction of objects from the minimum number of distorted patterns","volume":"354","author":"Levenshtein","year":"1997","journal-title":"Doklady Akademii Nauk"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2413958"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-010-2298-9_8"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2800044"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2024.105980"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3226296"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619639"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2649493"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9780511807077"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620761"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-024-01382-1"},{"key":"ref64","article-title":"On the fixed-length-burst Levenshtein ball with unit radius","author":"Xi","year":"2025","journal-title":"arXiv:2506.07817"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2317698"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/tmbmc.2025.3590000"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3110710"},{"key":"ref68","article-title":"Minimum size of insertion\/deletion\/substitution balls","author":"Pi","year":"2025","journal-title":"arXiv:2503.07132"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3568068"},{"key":"ref70","article-title":"On the size of error ball in DNA storage channels","author":"Abbasian","year":"2024","journal-title":"arXiv:2410.15290"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2025.3597013"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2807480"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3122798"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3260872"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3184868"},{"key":"ref76","article-title":"Optimal reconstruction codes with given reads in multiple burst-substitutions channels","author":"Yu","year":"2025","journal-title":"arXiv:2506.12924"},{"key":"ref77","article-title":"Sequence reconstruction for sticky insertion\/deletion channels","author":"Pham","year":"2025","journal-title":"arXiv:2504.19363"},{"key":"ref78","article-title":"Binary reconstruction codes for correcting one deletion and one substitution","author":"Li","year":"2025","journal-title":"arXiv:2505.04232"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-024-01377-y"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3016269"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3318354"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2878750"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/ITW61385.2024.10807014"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1995.492591"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1994.1.105"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1007\/11538462_38"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45713-5_5"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2010.03.002"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1080\/07391102.1991.10507920"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1089\/10665270252935548"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1089\/106652701752236188"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90143-4"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1007\/BF01188582"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.1996.3.425"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1080\/07391102.1989.10507752"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555321"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2747557"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3092056"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3084864"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3269124"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2935973"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3454119"},{"key":"ref103","first-page":"609","article-title":"Problems and results on 3-chromatic hypergraphs and some related questions","volume":"10","author":"Erd\u0151s","year":"1973","journal-title":"Colloquia Mathematica Societatis Janos Bolyai"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2024.3382499"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1016\/0888-7543(88)90007-9"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2270273"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm451"},{"key":"ref108","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-genom-090314-050032"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-S5-S18"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw450"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541302"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-15-S9-S4"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2016.2641440"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620505"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2024.3403759"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3151737"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619286"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9348147"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3120920"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2020.3035370"},{"key":"ref121","article-title":"Reassembly codes for the chop-and-shuffle channel","author":"Nassirpour","year":"2022","journal-title":"arXiv:2201.03590"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518272"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3292895"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3058966"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619135"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1137\/140962486"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1145\/98524.98598"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3493762"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3267620"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3252045"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2022.3222341"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3315784"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619697"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.3390\/e27010039"},{"key":"ref135","article-title":"Coding methods for string reconstruction from erroneous prefix-suffix compositions","author":"Chen","year":"2025","journal-title":"arXiv:2503.12342"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1145\/3696672"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI61997.2024.00096"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-023-06980-y"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.1038\/s41570-018-0051-5"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.1021\/jacs.2c10316"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1126\/science.1226355"},{"key":"ref142","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3367748"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.1002\/adma.202307499"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1145\/3723166"},{"key":"ref145","doi-asserted-by":"publisher","DOI":"10.1002\/smtd.202001094"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.4079"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1038\/s41570-022-00456-9"},{"key":"ref148","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-18681-5"},{"key":"ref149","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.abi6714"},{"key":"ref150","doi-asserted-by":"publisher","DOI":"10.1039\/D3CS00469D"},{"key":"ref151","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-019-45832-6"},{"key":"ref152","doi-asserted-by":"publisher","DOI":"10.1038\/s41586-024-08040-5"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.1002\/anie.201605531"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-15588-z"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-30140-x"},{"key":"ref156","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-42223-4"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1016\/j.ccr.2024.215816"},{"key":"ref158","doi-asserted-by":"publisher","DOI":"10.1016\/j.humimm.2021.02.012"},{"key":"ref159","doi-asserted-by":"publisher","DOI":"10.3390\/biology12070997"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.1038\/s41587-021-01108-x"},{"key":"ref161","doi-asserted-by":"publisher","DOI":"10.1093\/nargab\/lqab019"},{"key":"ref162","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0257521"},{"key":"ref163","doi-asserted-by":"publisher","DOI":"10.1002\/anie.201411378"},{"key":"ref164","doi-asserted-by":"publisher","DOI":"10.1126\/science.aaj2038"},{"key":"ref165","doi-asserted-by":"publisher","DOI":"10.1016\/j.celrep.2024.113699"},{"key":"ref166","doi-asserted-by":"publisher","DOI":"10.1038\/nature11875"},{"key":"ref167","doi-asserted-by":"publisher","DOI":"10.1038\/srep14138"},{"key":"ref168","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btv053"},{"key":"ref169","first-page":"3362","article-title":"Clustering billions of reads for DNA data storage","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Rashtchian"},{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3127174"},{"key":"ref171","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkh340"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-19148-3"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-019-10978-4"},{"key":"ref174","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-83806-5"},{"key":"ref175","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-025-01003-z"},{"key":"ref176","doi-asserted-by":"publisher","DOI":"10.1016\/j.csbj.2024.02.019"},{"key":"ref177","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-017-05188-1"},{"key":"ref178","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-022-33046-w"},{"key":"ref179","article-title":"Outer channel of DNA-based data storage: Capacity and efficient coding schemes","author":"He","year":"2023","journal-title":"arXiv:2312.11854"},{"key":"ref180","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3513040"},{"key":"ref181","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053049"},{"key":"ref182","doi-asserted-by":"publisher","DOI":"10.1109\/TMBMC.2024.3403488"},{"key":"ref183","doi-asserted-by":"publisher","DOI":"10.1109\/MBITS.2023.3318516"},{"key":"ref184","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3241773"},{"key":"ref185","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-023-36297-3"},{"key":"ref186","article-title":"High information density and low coverage data storage in DNA with efficient channel coding schemes","author":"Ding","year":"2024","journal-title":"arXiv:2410.04886"},{"key":"ref187","doi-asserted-by":"publisher","DOI":"10.1016\/j.csbj.2024.04.048"},{"key":"ref188","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btab246"},{"key":"ref189","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.2004821117"},{"key":"ref190","doi-asserted-by":"publisher","DOI":"10.1038\/s43588-022-00231-2"},{"key":"ref191","article-title":"Reconstructing graphs with subgraph compositions","author":"Dailly","year":"2025","journal-title":"arXiv:2504.00169"},{"key":"ref192","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619334"},{"key":"ref193","doi-asserted-by":"publisher","DOI":"10.1038\/nbt.3982"},{"key":"ref194","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3380615"},{"key":"ref195","doi-asserted-by":"publisher","DOI":"10.1109\/MBITS.2024.3355883"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/8700143\/10852562\/11111682.pdf?arnumber=11111682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T18:15:45Z","timestamp":1767896145000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11111682\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":195,"URL":"https:\/\/doi.org\/10.1109\/jsait.2025.3595457","relation":{},"ISSN":["2641-8770"],"issn-type":[{"value":"2641-8770","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}