{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T18:21:00Z","timestamp":1767378060328,"version":"3.48.0"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62371371"],"award-info":[{"award-number":["62371371"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/lcomm.2025.3648494","type":"journal-article","created":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T18:23:51Z","timestamp":1766773431000},"page":"692-696","source":"Crossref","is-referenced-by-count":0,"title":["Multi-Bit Decision-Based Bitwise Majority Alignment Algorithm for Trace Reconstruction"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-8706-822X","authenticated-orcid":false,"given":"Dan","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1484-9844","authenticated-orcid":false,"given":"Xiaopeng","family":"Jiao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-8676-757X","authenticated-orcid":false,"given":"Chenyu","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8504-9705","authenticated-orcid":false,"given":"Jianjun","family":"Mu","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi’an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"910","article-title":"Reconstructing strings from random traces","volume-title":"Proc. ACM-SIAM Symp. Discrete Algorithms (SODA)","author":"Batu"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.904499"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3030569"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055450"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055494"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2017.29"},{"key":"ref7","article-title":"New upper bounds for trace reconstruction","author":"Chase","year":"2020","journal-title":"arXiv:2009.03296"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/20-AIHP1089"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.34"},{"key":"ref10","first-page":"52:1","article-title":"Trace reconstruction from local statistical queries","volume-title":"Approximation, Randomization, and Combinatorial Optimization\u2014Algorithms and Techniques","author":"Chen","year":"2024"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2025.3541375"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2024.3367748"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-025-01003-z"},{"volume-title":"Trace reconstruction from noisy polynucleotide sequencer reads","year":"2018","author":"Gopalan","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174050"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3033513"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-024-51730-3"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2996377"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517821"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3206527"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3269289"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4234\/11301808\/11316145.pdf?arnumber=11316145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T18:16:27Z","timestamp":1767377787000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11316145\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/lcomm.2025.3648494","relation":{},"ISSN":["1089-7798","1558-2558","2373-7891"],"issn-type":[{"type":"print","value":"1089-7798"},{"type":"electronic","value":"1558-2558"},{"type":"electronic","value":"2373-7891"}],"subject":[],"published":{"date-parts":[[2026]]}}}