{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T04:04:32Z","timestamp":1752984272438,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T00:00:00Z","timestamp":1714608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T00:00:00Z","timestamp":1714608000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12001134"],"award-info":[{"award-number":["12001134"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012190","name":"Ministry of Science and Higher Education of the Russian Federation","doi-asserted-by":"publisher","award":["075-15-2022-281"],"award-info":[{"award-number":["075-15-2022-281"]}],"id":[{"id":"10.13039\/501100012190","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s12095-024-00717-y","type":"journal-article","created":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T07:02:08Z","timestamp":1714633328000},"page":"1033-1057","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The sequence reconstruction problem for permutations with the Hamming distance"],"prefix":"10.1007","volume":"16","author":[{"given":"Xiang","family":"Wang","sequence":"first","affiliation":[]},{"given":"Elena V.","family":"Konstantinova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,2]]},"reference":[{"issue":"11","key":"717_CR1","doi-asserted-by":"publisher","first-page":"7094","DOI":"10.1109\/TIT.2018.2807480","volume":"64","author":"YM Chee","year":"2018","unstructured":"Chee, Y.M., Kiah, H.M., Vardy, A., Yaakobi, E., Vu, V.K.: Coding for racetrack memories. IEEE Trans. Inf. Theory 64(11), 7094\u20137112 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6102","key":"717_CR2","doi-asserted-by":"publisher","first-page":"1628","DOI":"10.1126\/science.1226355","volume":"337","author":"GM Church","year":"2012","unstructured":"Church, G.M., Gao, Y., Kosuri, S.: Next-generation digital information storage in DNA. Science 337(6102), 1628\u20131628 (2012)","journal-title":"Science"},{"key":"717_CR3","unstructured":"Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes, Ser. North-Holland Mathematical Library, Vol.\u00a054. pp.\u00a016-17. North-Holland, Amsterdam, The Netherlands (1997)"},{"issue":"4","key":"717_CR4","doi-asserted-by":"publisher","first-page":"2924","DOI":"10.1109\/TIT.2018.2800044","volume":"64","author":"R Gabrys","year":"2018","unstructured":"Gabrys, R., Yaakobi, E.: Sequence reconstruction over the deletion channel. IEEE Trans. Inf. Theory 64(4), 2924\u20132931 (2018)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"717_CR5","volume-title":"Rank Correlation Methods","author":"M Kendall","year":"1990","unstructured":"Kendall, M., Gibbons, J.D.: Rank Correlation Methods. Oxford Univ. Press, New York (1990)"},{"key":"717_CR6","doi-asserted-by":"publisher","first-page":"2426","DOI":"10.1016\/j.dam.2007.05.043","volume":"155","author":"E Konstantinova","year":"2007","unstructured":"Konstantinova, E.: Reconstruction of permutations distorted by single reversal errors. Discrete Appl. Math. 155, 2426\u20132434 (2007)","journal-title":"Discrete Appl. Math."},{"key":"717_CR7","unstructured":"Konstantinova, E., Levenshtein, V., Siemons, J.: Reconstruction of permutations distorted by single transposition errors. (2007) http:\/\/arxiv.org\/abs\/math\/0702191v1"},{"key":"717_CR8","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1016\/j.disc.2007.08.003","volume":"308","author":"E Konstantinova","year":"2008","unstructured":"Konstantinova, E.: On reconstruction of signed permutations distorted by reversal errors. Discret. Math. 308, 974\u2013984 (2008)","journal-title":"Discret. Math."},{"key":"717_CR9","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.disc.2008.07.039","volume":"309","author":"EV Konstantinova","year":"2009","unstructured":"Konstantinova, E.V.: Vertex reconstruction in Cayley graphs. Discret. Math. 309, 548\u2013559 (2009)","journal-title":"Discret. Math."},{"key":"717_CR10","unstructured":"Knuth, D.E.: Sorting and Searching, Vol. 3 of The Art of Computer Programming, Addison\u2013Wesley, Reading, Massachusetts, second edition. (1998)"},{"issue":"4","key":"717_CR11","doi-asserted-by":"publisher","first-page":"2331","DOI":"10.1109\/TIT.2019.2961265","volume":"66","author":"A Lenz","year":"2020","unstructured":"Lenz, A., Siegel, P.H., Wachter-Zeh, A., Yaakobi, E.: Coding over sets for DNA storage. IEEE Trans. Inf. Theory 66(4), 2331\u20132351 (2020)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"717_CR12","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/18.904499","volume":"47","author":"VI Levenshtein","year":"2001","unstructured":"Levenshtein, V.I.: Efficient reconstruction of sequences. IEEE Trans. Inform. Theory 47(1), 2\u201322 (2001)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"717_CR13","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1006\/jcta.2000.3081","volume":"93","author":"VI Levenshtein","year":"2001","unstructured":"Levenshtein, V.I.: Efficient reconstruction of sequences from their subsequences or supersequences. J. Combin. Theory Ser. A 93(2), 310\u2013332 (2001)","journal-title":"J. Combin. Theory Ser. A"},{"key":"717_CR14","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.jcta.2008.11.005","volume":"116","author":"VI Levenshtein","year":"2009","unstructured":"Levenshtein, V.I., Siemons, J.: Error graphs and the reconstruction of elements in groups. J. Combin. Theory Ser. A 116, 795\u2013815 (2009)","journal-title":"J. Combin. Theory Ser. A"},{"key":"717_CR15","doi-asserted-by":"crossref","unstructured":"Pham, V.L.P., Goyal, K., Kiah, H.M.: Sequence reconstruction problem for deletion channels: a complete asymptotic solution. In: Proc. Int. Symp. Inform. Theory. pp. 992\u2013997. Espoo, Finland, (2022)","DOI":"10.1109\/ISIT50566.2022.9834433"},{"key":"717_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139058520","volume-title":"Enumerative Combinatorics","author":"R Stanley","year":"2011","unstructured":"Stanley, R.: Enumerative Combinatorics, 2nd edn. Cambridge Studies in Advanced Mathematics. Cambridge University Press, Cambridge (2011)","edition":"2"},{"key":"717_CR17","doi-asserted-by":"crossref","unstructured":"Yaakobi, E., Schwartz, M., Langberg, M., Bruck, J.: Sequence reconstruction for Grassmann graphs and permutations. In: Proc. Int. Symp. Inform. Theory. pp. 874\u2013878. (2013)","DOI":"10.1109\/ISIT.2013.6620351"},{"issue":"4","key":"717_CR18","doi-asserted-by":"publisher","first-page":"2155","DOI":"10.1109\/TIT.2018.2878750","volume":"65","author":"E Yaakobi","year":"2019","unstructured":"Yaakobi, E., Bruck, J.: On the uncertainty of information retrieval in associative memories. IEEE Trans. Inf. Theory 65(4), 2155\u20132165 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"717_CR19","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s12095-022-00595-2","volume":"15","author":"X Wang","year":"2023","unstructured":"Wang, X.: Reconstruction of permutations distorted by single Kendall $$\\tau $$-errors. Cryptogr. Commun. 15, 131\u2013144 (2023)","journal-title":"Cryptogr. Commun."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00717-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00717-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00717-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T22:12:30Z","timestamp":1731881550000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00717-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,2]]},"references-count":19,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["717"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00717-y","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2024,5,2]]},"assertion":[{"value":"5 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}