{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T10:49:47Z","timestamp":1746787787050,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T00:00:00Z","timestamp":1698883200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T00:00:00Z","timestamp":1698883200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001779","name":"Monash University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100001779","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2024,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Families of new, multi-level integer 2<jats:italic>D<\/jats:italic> arrays are introduced here as an extension of the well-known binary Legendre sequences that are derived from quadratic residues. We present a construction, based on Fourier and Finite Radon Transforms, for families of periodic perfect arrays, each of size <jats:inline-formula><jats:alternatives><jats:tex-math>$$p\\times p$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>\u00d7<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> for many prime values <jats:italic>p<\/jats:italic>. Previously delta functions were used as the discrete projections which, when back-projected, build 2<jats:italic>D<\/jats:italic> perfect arrays. Here we employ perfect sequences as the discrete projected views. The base family size is <jats:inline-formula><jats:alternatives><jats:tex-math>$$p+1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. All members of these multi-level array families have perfect autocorrelation and constant, minimal cross-correlation. Proofs are given for four useful and general properties of these new arrays. 1) They are comprised of odd integers, with values between at most <jats:inline-formula><jats:alternatives><jats:tex-math>$$-p$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>-<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and <jats:inline-formula><jats:alternatives><jats:tex-math>$$+p$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, with a zero value at just one location. 2) They have the property of \u2018conjugate\u2019 spatial symmetry, where the value at location (<jats:italic>i<\/jats:italic>,\u00a0<jats:italic>j<\/jats:italic>) is always the negative of the value at location <jats:inline-formula><jats:alternatives><jats:tex-math>$$(p-i, p-j)$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mo>(<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>-<\/mml:mo>\n                    <mml:mi>i<\/mml:mi>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>-<\/mml:mo>\n                    <mml:mi>j<\/mml:mi>\n                    <mml:mo>)<\/mml:mo>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. 3) Any change in the value assigned to the array\u2019s origin leaves all of its off-peak autocorrelation values unchanged. 4) A family of <jats:inline-formula><jats:alternatives><jats:tex-math>$$p+1$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>+<\/mml:mo>\n                    <mml:mn>1<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, <jats:inline-formula><jats:alternatives><jats:tex-math>$$p\\times p$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>\u00d7<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> arrays can be compressed to size <jats:inline-formula><jats:alternatives><jats:tex-math>$$(p+1)^2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mo>(<\/mml:mo>\n                      <mml:mi>p<\/mml:mi>\n                      <mml:mo>+<\/mml:mo>\n                      <mml:mn>1<\/mml:mn>\n                      <mml:mo>)<\/mml:mo>\n                    <\/mml:mrow>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and each family member can be exactly and rapidly unpacked in a single <jats:inline-formula><jats:alternatives><jats:tex-math>$$p\\times p$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>p<\/mml:mi>\n                    <mml:mo>\u00d7<\/mml:mo>\n                    <mml:mi>p<\/mml:mi>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> decompression pass.<\/jats:p>","DOI":"10.1007\/s10472-023-09903-9","type":"journal-article","created":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T05:07:00Z","timestamp":1698901620000},"page":"169-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Families of multi-level Legendre-like arrays"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8714-1484","authenticated-orcid":false,"given":"Timothy","family":"Petersen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Cavy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7758-7140","authenticated-orcid":false,"given":"David","family":"Paganin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Imants","family":"Svalbe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,2]]},"reference":[{"key":"9903_CR1","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1109\/TIT.1983.1056744","volume":"29","author":"M Golay","year":"1983","unstructured":"Golay, M.: The merit factor of Legendre sequences (corresp.). IEEE Trans. Inf. Theory 29, 934\u2013936 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9903_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1109\/18.2620","volume":"34","author":"T Hoholdt","year":"1988","unstructured":"Hoholdt, T., Jensen, H.E.: Determination of the merit factor of Legendre sequences. IEEE Trans. Inf. Theory 34, 161\u2013164 (1988)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9903_CR3","doi-asserted-by":"crossref","unstructured":"Borwein, P., Choi, K.-K.S., Jedwab, J.: Binary sequences with merit factor greater than 6.34. IEEE Trans. Inf. Theory 50(12), 3234\u20133249 (2004)","DOI":"10.1109\/TIT.2004.838341"},{"issue":"3","key":"9903_CR4","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1109\/7.192096","volume":"24","author":"HD Luke","year":"1988","unstructured":"Luke, H.D.: Sequences and arrays with perfect periodic correlation. IEEE Trans. Aerosp. Electron. Syst. 24(3), 287\u2013294 (1988)","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"9903_CR5","doi-asserted-by":"publisher","first-page":"4344","DOI":"10.1364\/AO.28.004344","volume":"28","author":"SR Gottesman","year":"1989","unstructured":"Gottesman, S.R., Fenimore, E.E.: New family of binary arrays for coded aperture imaging. Appl. Opt. 28, 4344\u20134352 (1989)","journal-title":"Appl. Opt."},{"issue":"4","key":"9903_CR6","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1109\/TIT.1967.1054048","volume":"13","author":"R Gold","year":"1967","unstructured":"Gold, R.: Optimal binary sequences for spread spectrum multiplexing (corresp.). IEEE Trans. Inf. Theory 13(4), 619\u2013621 (1967)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9903_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/9780470022962","volume-title":"The Next Generation CDMA Technologies","author":"H-H Chen","year":"2007","unstructured":"Chen, H.-H.: The Next Generation CDMA Technologies. John Wiley & Sons, New York (2007)"},{"issue":"5","key":"9903_CR8","doi-asserted-by":"publisher","first-page":"828","DOI":"10.1109\/49.298056","volume":"12","author":"H Fukumasa","year":"1994","unstructured":"Fukumasa, H., Kohno, R., Imai, H.: Design of pseudonoise sequences with good odd and even correlation properties for DS\/CDMA. IEEE J. Sel. Areas Commun. 12(5), 828\u2013836 (1994)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"1","key":"9903_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10623-015-0154-7","volume":"78","author":"K-U Schmidt","year":"2016","unstructured":"Schmidt, K.-U.: Sequences with small correlation. Des. Codes Cryptogr. 78(1), 237\u2013267 (2016)","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"9903_CR10","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1016\/j.dsp.2004.06.002","volume":"14","author":"P Kumar","year":"2004","unstructured":"Kumar, P., Merchant, S.N., Desai, U.B.: Improving performance in pulse radar detection using Bayesian regularization for neural network training. Digit. Signal Process. 14(5), 438\u2013448 (2004)","journal-title":"Digit. Signal Process."},{"key":"9903_CR11","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s12095-017-0237-6","volume":"10","author":"S Bozta\u015f","year":"2018","unstructured":"Bozta\u015f, S., \u00d6zbudak, F., Tekin, E.: Generalized nonbinary sequences with perfect autocorrelation, flexible alphabets and new periods. Cryptogr. Commun. 10, 509\u2013517 (2018)","journal-title":"Cryptogr. Commun."},{"issue":"4","key":"9903_CR12","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1109\/TIT.1972.1054840","volume":"18","author":"D Chu","year":"1972","unstructured":"Chu, D.: Polyphase codes with good periodic correlation properties (corresp.). IEEE Trans. Inf. Theory 18(4), 531\u2013532 (1972)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"9903_CR13","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/49.136073","volume":"10","author":"L Bomer","year":"1992","unstructured":"Bomer, L., Antweiler, M.: Perfect n-phase sequences and arrays (spread spectrum communication). IEEE J. Sel. Areas Commun. 10(4), 782\u2013789 (1992)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9903_CR14","doi-asserted-by":"crossref","unstructured":"Blake, S.T., Tirkel, A.Z.: A construction for perfect periodic autocorrelation sequences. In: Schmidt, K.-U., Winterhof, A. (eds.) Sequences and Their Applications - SETA 2014, pp. 104\u2013108. Springer, Cham (2014)","DOI":"10.1007\/978-3-319-12325-7_9"},{"issue":"2","key":"9903_CR15","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/7.1049","volume":"24","author":"JW Taylor","year":"1988","unstructured":"Taylor, J.W., Blinchikoff, H.J.: Quadriphase code - a radar pulse compression signal with unique characteristics. IEEE Trans. Aerosp. Electron. Syst. 24(2), 156\u2013170 (1988)","journal-title":"IEEE Trans. Aerosp. Electron. Syst."},{"key":"9903_CR16","unstructured":"Antweiler, M., Acker, C., B\u00f6mer, L.: New quadriphase sequences with good periodic and odd correlation properties. In: Proc. Int. Symp. Systems, Signals, and Electronics (ISSSE\u201989), pp. 540\u2013543 (1989)"},{"key":"9903_CR17","first-page":"580","volume":"1","author":"RG Van Schyndel","year":"1999","unstructured":"Van Schyndel, R.G., Tirkel, A.Z., Svalbe, I.D.: Key independent watermark detection. Proc. Int. Conf. Multimedia Comput. Syst. 1, 580\u2013585 (1999)","journal-title":"Proc. Int. Conf. Multimedia Comput. Syst."},{"key":"9903_CR18","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10851-018-0848-3","volume":"61","author":"M Ceko","year":"2019","unstructured":"Ceko, M., Svalbe, I., Petersen, T., Tirkel, A.: Large families of \u201cgrey\u2019\u2019 arrays with perfect auto-correlation and optimal cross-correlation. J. Math. Imaging Vis. 61, 237\u2013248 (2019)","journal-title":"J. Math. Imaging Vis."},{"issue":"5","key":"9903_CR19","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/TIT.1962.1057778","volume":"8","author":"D Huffman","year":"1962","unstructured":"Huffman, D.: The generation of impulse-equivalent pulse trains. IRE Trans. Inf. Theory 8(5), 10\u201316 (1962)","journal-title":"IRE Trans. Inf. Theory"},{"key":"9903_CR20","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1109\/TCI.2020.3007549","volume":"6","author":"ID Svalbe","year":"2020","unstructured":"Svalbe, I.D., Paganin, D.M., Petersen, T.C.: Sharp computational images from diffuse beams: factorization of the discrete delta function. IEEE Trans. Comput. Imaging 6, 1258\u20131271 (2020)","journal-title":"IEEE Trans. Comput. Imaging"},{"key":"9903_CR21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.105.013512","volume":"105","author":"D Ceddia","year":"2022","unstructured":"Ceddia, D., Paganin, D.M.: Ghost projection. Phys. Rev. A 105, 013512 (2022)","journal-title":"Phys. Rev. A"},{"key":"9903_CR22","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1049\/el.2015.1046","volume":"51","author":"A Tirkel","year":"2015","unstructured":"Tirkel, A., Cavy, B., Svalbe, I.: Families of multi-dimensional arrays with optimal correlations between all members. Elect. Lett. 51, 1167\u20131168 (2015)","journal-title":"Elect. Lett."},{"key":"9903_CR23","volume-title":"The Mojette transform: theory and applications","author":"J Gu\u00e9don","year":"2013","unstructured":"Gu\u00e9don, J.: The Mojette transform: theory and applications. John Wiley & Sons, Hoboken (2013)"},{"key":"9903_CR24","doi-asserted-by":"publisher","first-page":"996","DOI":"10.1109\/34.254058","volume":"15","author":"F Matus","year":"1993","unstructured":"Matus, F., Flusser, J.: Image representation via a finite Radon transform. IEEE Trans. Pattern Anal. Mach. Intell. 15, 996\u20131006 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"9903_CR25","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1186\/s13634-017-0455-2","volume":"2017","author":"ID Svalbe","year":"2017","unstructured":"Svalbe, I.D., Tirkel, A.Z.: Extended families of 2D arrays with near optimal auto and low cross-correlation. EURASIP J. Adv. Signal Process 2017, 18 (2017)","journal-title":"EURASIP J. Adv. Signal Process"},{"key":"9903_CR26","unstructured":"Ceko, M.: Discrete projection: highly correlated arrays and ghosts for image reconstruction. PhD thesis, School of Physics and Astronomy (2021). Chapter 3, Sections 3.5.1 to 3.5.3"},{"issue":"8","key":"9903_CR27","doi-asserted-by":"publisher","first-page":"2864","DOI":"10.1109\/TIT.2007.899468","volume":"53","author":"A Bekir","year":"2007","unstructured":"Bekir, A., Golomb, S.W.: There are no further counterexamples to S. Piccard\u2019s theorem. IEEE Trans. Inf. Theory 53(8), 2864\u20132867 (2007)","journal-title":"Piccard\u2019s theorem. IEEE Trans. Inf. Theory"},{"issue":"3","key":"9903_CR28","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1090\/S0002-9947-1938-1501951-4","volume":"43","author":"J Singer","year":"1938","unstructured":"Singer, J.: A theorem in finite projective geometry and some applications to number theory. Trans. Amer. Math. Soc. 43(3), 377\u2013385 (1938)","journal-title":"Trans. Amer. Math. Soc."},{"key":"9903_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5579-4","volume-title":"Introduction to Analytic Number Theory","author":"T Apostol","year":"1976","unstructured":"Apostol, T.: Introduction to Analytic Number Theory. Ser. UTM. Springer, New York (1976)"},{"key":"9903_CR30","unstructured":"Phillip\u00e9, O.: Image representation for joint source-channel coding for QoS networks. PhD thesis, University of Nantes (1998)"},{"key":"9903_CR31","unstructured":"MATLAB: R2021b Update 2 (9.11.0.1837725). The MathWorks Inc., Natick, Massachusetts (2021)"},{"key":"9903_CR32","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1214\/aos\/1176344370","volume":"6","author":"A Hedayat","year":"1978","unstructured":"Hedayat, A., Wallis, W.D.: Hadamard matrices and their applications. Ann. Stat. 6, 1184\u20131238 (1978)","journal-title":"Ann. Stat."},{"key":"9903_CR33","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/0097-3165(76)90062-5","volume":"21","author":"J Seberry Wallis","year":"1976","unstructured":"Seberry Wallis, J.: On the existence of Hadamard matrices. J. Comb. Theory Ser. A. 21, 188\u2013195 (1976)","journal-title":"J. Comb. Theory Ser. A."},{"issue":"6","key":"9903_CR34","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1002\/jcd.20043","volume":"13","author":"H Kharaghani","year":"2005","unstructured":"Kharaghani, H., Tayfeh-Rezaie, B.: A Hadamard matrix of order 428. J. Comb. Des. 13(6), 435\u2013440 (2005)","journal-title":"J. Comb. Des."},{"issue":"2\u20133","key":"9903_CR35","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00184-005-0415-y","volume":"62","author":"J Seberry","year":"2005","unstructured":"Seberry, J., Wysocki, B.J., Wysocki, T.A.: On some applications of Hadamard matrices. Metrika 62(2\u20133), 221\u2013239 (2005)","journal-title":"Metrika"},{"key":"9903_CR36","doi-asserted-by":"crossref","unstructured":"Sylvester, J.J.: LX. Thoughts on inverse orthogonal matrices, simultaneous sign successions, and tessellated pavements in two or more colours, with applications to Newton\u2019s rule, ornamental tile-work, and the theory of numbers. Lond. Edinb. Dublin Philos. Mag. 34(232), 461\u2013475 (1867)","DOI":"10.1080\/14786446708639914"},{"issue":"1\u20134","key":"9903_CR37","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1002\/sapm1933121311","volume":"12","author":"REAC Paley","year":"1933","unstructured":"Paley, R.E.A.C.: On orthogonal matrices. J. Math. Phys. 12(1\u20134), 311\u2013320 (1933)","journal-title":"J. Math. Phys."},{"key":"9903_CR38","doi-asserted-by":"crossref","unstructured":"Petersen, T., Ceko, M., Paganin, D., Svalbe, I.: A curious invariance property of certain perfect Legendre arrays: Stirring without mixing. In: Discrete Geometry and Mathematical Morphology: Second International Joint Conference. DGMM 2022, Strasbourg, France, October 24\u201327, 2022, Proceedings, pp. 330\u2013340. Springer, Berlin, Heidelberg (2022)","DOI":"10.1007\/978-3-031-19897-7_26"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-023-09903-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10472-023-09903-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-023-09903-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,8]],"date-time":"2024-02-08T07:13:41Z","timestamp":1707376421000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10472-023-09903-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,2]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["9903"],"URL":"https:\/\/doi.org\/10.1007\/s10472-023-09903-9","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2023,11,2]]},"assertion":[{"value":"16 October 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 November 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}