{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T14:57:05Z","timestamp":1774277825093,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T00:00:00Z","timestamp":1770595200000},"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":["No. 12231013 and No. 11871295"],"award-info":[{"award-number":["No. 12231013 and No. 11871295"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00236-026-00521-6","type":"journal-article","created":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T11:00:29Z","timestamp":1770634829000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Opacity complexity of automatic sequences: the general case"],"prefix":"10.1007","volume":"63","author":[{"given":"Jean-Paul","family":"Allouche","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia-Yan","family":"Yao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,9]]},"reference":[{"issue":"2","key":"521_CR1","doi-asserted-by":"publisher","first-page":"547","DOI":"10.4007\/annals.2007.165.547","volume":"165","author":"B Adamczewski","year":"2007","unstructured":"Adamczewski, B., Bugeaud, Y.: On the complexity of algebraic numbers. I. Expansions in integer bases. Annals of Mathematics 165(2), 547\u2013565 (2007)","journal-title":"Annals of Mathematics"},{"key":"521_CR2","first-page":"133","volume":"1","author":"J-P Allouche","year":"1994","unstructured":"Allouche, J.-P.: Sur la complexit\u00e9 des suites infinies. Bulletin of the Belgian Mathematical Society 1, 133\u2013143 (1994)","journal-title":"Bulletin of the Belgian Mathematical Society"},{"key":"521_CR3","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0304-3975(01)00212-2","volume":"292","author":"J-P Allouche","year":"2003","unstructured":"Allouche, J.-P., Baake, M., Cassaigne, J., Damanik, D.: Palindrome complexity. Theoretical Computer Science 292, 9\u201331 (2003)","journal-title":"Theoretical Computer Science"},{"key":"521_CR4","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s00224-025-10234-x","volume":"69","author":"J-P Allouche","year":"2025","unstructured":"Allouche, J.-P., Campbell, J.M., Li, S., Stipulanti, M., Shallit, J.: The reflection complexity of sequences over finite alphabets. Theory Comput. Syst. 69, 31 (2025)","journal-title":"Theory Comput. Syst."},{"key":"521_CR5","doi-asserted-by":"crossref","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences. Theory, Applications, Generalizations, Cambridge University Press, Cambridge, (2003)","DOI":"10.1017\/CBO9780511546563"},{"key":"521_CR6","unstructured":"Allouche, J.-P., Yao, J.-Y.: Opacity complexity of automatic sequences: the quadratic case, in preparation (2023)"},{"issue":"795\u2013804","key":"521_CR7","volume":"12","author":"H Ardal","year":"2012","unstructured":"Ardal, H., Brown, T., Jungi\u0107, V., Sahasrabudhe, J.: On abelian and additive complexity in infinite words. Integers 12 (795\u2013804), a21 (2012)","journal-title":"Integers"},{"key":"521_CR8","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1142\/9789812704979_0004","volume-title":"Words, languages & combinatorics, III (Kyoto, 2000)","author":"SV Avgustinovich","year":"2003","unstructured":"Avgustinovich, S.V., Fon-Der-Flaass, D.G., Frid, A.E.: Arithmetical complexity of infinite words. In: Words, languages & combinatorics, III (Kyoto, 2000), pp. 51\u201362. World Sci. Publ., River Edge, NJ (2003)"},{"key":"521_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2021.109836","volume":"133","author":"RJ Barcelos","year":"2021","unstructured":"Barcelos, R.J., Basilio, J.C.: Enforcing current-state opacity through shuffle and deletions of event observations. Automatica 133, 109836 (2021)","journal-title":"Automatica"},{"key":"521_CR10","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.tcs.2022.06.001","volume":"927","author":"JP Bell","year":"2022","unstructured":"Bell, J.P., Shallit, J.: Lie complexity of words. Theoret. Comput. Sci. 927, 98\u2013108 (2022)","journal-title":"Theoret. Comput. Sci."},{"key":"521_CR11","doi-asserted-by":"publisher","first-page":"1467","DOI":"10.1093\/imrn\/rnv185","volume":"2016","author":"Y Bugeaud","year":"2016","unstructured":"Bugeaud, Y., Han, G.-N., Wen, Z.-Y., Yao, J.-Y.: Hankel determinants, Pad\u00e9 approximations, and irrationality exponents. Int. Math. Res. Not. IMRN 2016, 1467\u20131496 (2016)","journal-title":"Int. Math. Res. Not. IMRN"},{"key":"521_CR12","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1090\/tran\/7378","volume":"371","author":"Y Bugeaud","year":"2019","unstructured":"Bugeaud, Y., Kim, D.H.: A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers. Trans. Amer. Math. Soc. 371, 3281\u20133308 (2019)","journal-title":"Trans. Amer. Math. Soc."},{"key":"521_CR13","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.ipl.2014.09.001","volume":"115","author":"B B\u00e9rard","year":"2015","unstructured":"B\u00e9rard, B., Chatterjee, K., Sznajder, N.: Probabilistic opacity for Markov decision processes. Information Processing Letters 115, 52\u201359 (2015)","journal-title":"Information Processing Letters"},{"key":"521_CR14","doi-asserted-by":"crossref","unstructured":"Broglio, A., Liardet, P.: Predictions with automata. Symbolic dynamics and its applications (New Haven, CT, 1991), 111\u2013124, Contemp. Math. 135. Amer. Math. Soc., Providence, RI (1992)","DOI":"10.1090\/conm\/135\/1185084"},{"key":"521_CR15","doi-asserted-by":"crossref","unstructured":"Carton, O.: Preservation of normality by unambiguous transducers. Developments in language theory, 90\u2013101, Lecture Notes in Comput. Sci. 13257. Springer (2022)","DOI":"10.1007\/978-3-031-05578-2_7"},{"key":"521_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2020.104650","volume":"282","author":"O Carton","year":"2022","unstructured":"Carton, O., Orduna, E.: Preservation of normality by transducers. Information and Computation 282, 104650 (2022)","journal-title":"Information and Computation"},{"key":"521_CR17","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jcta.2016.07.002","volume":"145","author":"J Cassaigne","year":"2017","unstructured":"Cassaigne, J., Fici, G., Sciortino, M., Zamboni, L.Q.: Cyclic complexity of words. Journal of Combinatorial Theory, Series A 145, 36\u201356 (2017)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"521_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2024.105936","volume":"208","author":"J Cassaigne","year":"2024","unstructured":"Cassaigne, J., Gheeraert, F., Restivo, A., Romana, G., Sciortino, M., Stipulanti, M.: New string attractor-based complexities for infinite words. Journal of Combinatorial Theory, Series A 208, 105936 (2024)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"521_CR19","first-page":"127","volume":"2","author":"J Cassaigne","year":"2010","unstructured":"Cassaigne, J., Kabor\u00e9, I., Tapsoba, T.: On a new notion of complexity on infinite words. Acta Univ. Sapientiae Math. 2, 127\u2013136 (2010)","journal-title":"Acta Univ. Sapientiae Math."},{"key":"521_CR20","first-page":"196","volume-title":"Proceedings 2008","author":"J. Cassaigne, T. K\u00e4rki, Tomi, and L. Q. Zamboni, Relationally periodic sequences and subword complexity in Developments in Language Theory. 12th International Conference, DLT 2008, Kyoto, Japan, September 16\u201319","year":"2008","unstructured":"J. Cassaigne, T. K\u00e4rki, Tomi, and L. Q. Zamboni, Relationally periodic sequences and subword complexity in Developments in Language Theory. 12th International Conference, DLT 2008, Kyoto, Japan, September 16\u201319: Proceedings 2008, pp. 196\u2013205. Springer, Berlin (2008)"},{"key":"521_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0012-365X(01)00160-1","volume":"247","author":"G-L Chen","year":"2002","unstructured":"Chen, G.-L., Yao, J.-Y.: Characterization of opaque automata. Discrete Mathematics 247, 65\u201378 (2002)","journal-title":"Discrete Mathematics"},{"key":"521_CR22","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BF01746527","volume":"3","author":"A Cobham","year":"1969","unstructured":"Cobham, A.: On the base-dependence of sets of numbers recognizable by finite automata. Mathematical Systems Theory 3, 186\u2013192 (1969)","journal-title":"Mathematical Systems Theory"},{"key":"521_CR23","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/BF01706087","volume":"6","author":"A Cobham","year":"1972","unstructured":"Cobham, A.: Uniform tag sequences. Mathematical Systems Theory 6, 164\u2013192 (1972)","journal-title":"Mathematical Systems Theory"},{"key":"521_CR24","volume-title":"Regular Algebra and Finite Machines","author":"JH Conway","year":"1971","unstructured":"Conway, J.H.: Regular Algebra and Finite Machines. Chapman and Hall Ltd. (1971)"},{"key":"521_CR25","first-page":"343","volume":"28","author":"H Hu","year":"2008","unstructured":"Hu, H., Chen, X.M.: Opacity of composed finite automaton systems (Chinese). J. Math. (Wuhan) 28, 343\u2013348 (2008)","journal-title":"J. Math. (Wuhan)"},{"key":"521_CR26","volume-title":"Automata, Languages and Machines, vol. A","author":"S Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol. A. Academic Press, New York (1974)"},{"key":"521_CR27","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1142\/S0129054118420066","volume":"29","author":"J Endrullis","year":"2018","unstructured":"Endrullis, J., Karhum\u00e4ki, J., Klop, J.W., Saarela, A.: Degrees of infinite words, polynomials and atoms. Internat. J. Found. Comput. Sci. 29, 825\u2013843 (2018)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"521_CR28","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1023\/A:1008295603824","volume":"10","author":"D Erdmann","year":"1997","unstructured":"Erdmann, D., Murphy, S.: An approximate distribution for the maximum order complexity. Designs, Codes and Cryptography 10, 325\u2013339 (1997)","journal-title":"Designs, Codes and Cryptography"},{"key":"521_CR29","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0012-365X(98)00400-2","volume":"206","author":"S Ferenczi","year":"1999","unstructured":"Ferenczi, S.: Complexity of sequences and dynamical systems. Discrete Mathematics 206, 145\u2013154 (1999)","journal-title":"Discrete Mathematics"},{"key":"521_CR30","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(98)00258-8","volume":"218","author":"S Ferenczi","year":"1999","unstructured":"Ferenczi, S., K\u00e1sa, Z.: Complexity for finite factors of infinite sequences. Theoretical Computer Science 218, 177\u2013195 (1999)","journal-title":"Theoretical Computer Science"},{"key":"521_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2022.100532","volume":"47","author":"G Fici","year":"2023","unstructured":"Fici, G., Puzynina, S.: Abelian combinatorics on words: a survey. Comput. Sci. Rev. 47, 100532 (2023)","journal-title":"Comput. Sci. Rev."},{"key":"521_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2021.104772","volume":"281","author":"LA Hemaspaandra","year":"2021","unstructured":"Hemaspaandra, L.A., Narv\u00e1ez, D.E.: The opacity of backbones. Information and Computation 281, 104772 (2021)","journal-title":"Information and Computation"},{"key":"521_CR33","first-page":"349","volume":"64","author":"T Kamae","year":"1996","unstructured":"Kamae, T., Mend\u00e8s France, M.: A continuous family of automata: the Ising automata. Ann. Inst. H. Poincar\u00e9. Phys. Th\u00e9or. 64, 349\u2013372 (1996)","journal-title":"Ann. Inst. H. Poincar\u00e9. Phys. Th\u00e9or."},{"key":"521_CR34","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1017\/S014338570200055X","volume":"22","author":"T Kamae","year":"2002","unstructured":"Kamae, T., Zamboni, L.: Sequence entropy and the maximal pattern complexity of infinite words. Ergodic Theory and Dynamical Systems 22, 1191\u20131199 (2002)","journal-title":"Ergodic Theory and Dynamical Systems"},{"key":"521_CR35","doi-asserted-by":"publisher","first-page":"2189","DOI":"10.1016\/j.jcta.2013.08.008","volume":"120","author":"J Karhumaki","year":"2013","unstructured":"Karhumaki, J., Saarela, A., Zamboni, L.Q.: On a generalization of abelian equivalence and complexity of infinite words. Journal of Combinatorial Theory, Series A 120, 2189\u20132206 (2013)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"521_CR36","first-page":"369","volume":"25","author":"A. N. Kolmogorov","year":"1963","unstructured":"Kolmogorov, A. N.: On tables of random numbers. Sankhy\u0101. Ser. A 25, 369\u2013376 (1963)","journal-title":"Sankhy\u0101. Ser. A"},{"key":"521_CR37","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.arcontrol.2018.04.002","volume":"45","author":"S Lafortune","year":"2018","unstructured":"Lafortune, S., Lin, F., Hadjicostis, C.N.: On the history of diagnosability and opacity in discrete event systems. Annu. Rev. Control. 45, 257\u2013266 (2018)","journal-title":"Annu. Rev. Control."},{"key":"521_CR38","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A Lempel","year":"1976","unstructured":"Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Transactions on Information Theory 22, 75\u201381 (1976)","journal-title":"IEEE Transactions on Information Theory"},{"key":"521_CR39","unstructured":"Li, X., Hadjicostis, C.N., Li, Z.: Reduced-complexity verification for $$K$$-step and infinite-step opacity in discrete event systems, Preprint, (2023). https:\/\/arxiv.org\/abs\/2310.11825"},{"key":"521_CR40","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF02352498","volume":"139","author":"M Mend\u00e8s France","year":"1991","unstructured":"Mend\u00e8s France, M.: Opacity of an automaton. Application to the inhomogeneous Ising chain. Communications in Mathematical Physics 139, 341\u2013352 (1991)","journal-title":"Communications in Mathematical Physics"},{"key":"521_CR41","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1142\/S0218196713400080","volume":"23","author":"F Mignosi","year":"2013","unstructured":"Mignosi, F., Restivo, A.: A new complexity function for words based on periodicity. International Journal of Algebra and Computation 23, 963\u2013987 (2013)","journal-title":"International Journal of Algebra and Computation"},{"key":"521_CR42","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/j.tcs.2011.11.013","volume":"420","author":"TKS Moothathu","year":"2012","unstructured":"Moothathu, T.K.S.: Eulerian entropy and non-repetitive subword complexity. Theoretical Computer Science 420, 80\u201388 (2012)","journal-title":"Theoretical Computer Science"},{"key":"521_CR43","doi-asserted-by":"crossref","unstructured":"Niederreiter, H.: Linear complexity and related complexity measures for sequences in Progress in Cryptology \u2013 INDOCRYPT 2003. 4th International Conference on Cryptology in India, New Delhi, India, December 8\u201310, 2003. Proceedings, Springer, Berlin, pp.\u00a01\u201317 (2003)","DOI":"10.1007\/978-3-540-24582-7_1"},{"key":"521_CR44","unstructured":"Parshina, O., Postic, M.: Open and closed complexity of infinite words, Preprint, (2020). https:\/\/arxiv.org\/abs\/2005.06254"},{"key":"521_CR45","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2013.05.028","volume":"500","author":"J Peltom\u00e4ki","year":"2013","unstructured":"Peltom\u00e4ki, J.: Introducing privileged words: privileged complexity of Sturmian words. Theoret. Comput. Sci. 500, 57\u201367 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"521_CR46","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2015.07.025","volume":"601","author":"M Rigo","year":"2015","unstructured":"Rigo, M., Salimov, P.: Another generalization of abelian equivalence: binomial complexity of infinite words. Theoret. Comput. Sci. 601, 47\u201357 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"521_CR47","first-page":"1294","volume-title":"Gapped binomial complexities in sequences in IEEE International Symposium on Information Theory (ISIT)","author":"M Rigo","year":"2023","unstructured":"Rigo, M., Stipulanti, M., Whiteland, M.: Gapped binomial complexities in sequences in IEEE International Symposium on Information Theory (ISIT), pp. 1294\u20131299. Taiwan, IEEE, Tapai (2023)"},{"key":"521_CR48","unstructured":"Schaeffer, L., Shallit, J.: String Attractors for Automatic Sequences, Preprint, (2021). https:\/\/arxiv.org\/abs\/2012.06840"},{"key":"521_CR49","volume-title":"Information Transmission, Modulation, and Noises","author":"M Schwartz","year":"1970","unstructured":"Schwartz, M.: Information Transmission, Modulation, and Noises. McGraw-Hill (1970)"},{"key":"521_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114399","volume":"990","author":"G Viliam","year":"2024","unstructured":"Viliam, G., Dominika, P., Alexander, S.: State complexity of binary coded regular languages. Theoret. Comput. Sci. 990, 114399 (2024)","journal-title":"Theoret. Comput. Sci."},{"key":"521_CR51","first-page":"253","volume":"32","author":"A Wintenberg","year":"2022","unstructured":"Wintenberg, A., Blischke, M., Lafortune, S., Ozay, N.: A general language-based framework for specifying and verifying notions of opacity, Discrete Event. Dyn. Syst. 32, 253\u2013289 (2022)","journal-title":"Dyn. Syst."},{"key":"521_CR52","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1016\/j.ins.2020.07.017","volume":"543","author":"J Yang","year":"2021","unstructured":"Yang, J., Deng, W., Qiu, D., Jiang, C.: Opacity of networked discrete event systems. Inform. Sci. 543, 328\u2013344 (2021)","journal-title":"Inform. Sci."},{"key":"521_CR53","unstructured":"Yao, J.-Y.: Contribution \u00e0 l\u2019\u00e9tude des automates finis (Th\u00e8se), Universit\u00e9 Bordeaux I (1996)"},{"key":"521_CR54","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0012-365X(98)00361-6","volume":"202","author":"J-Y Yao","year":"1999","unstructured":"Yao, J.-Y.: Opacit\u00e9s des automates finis. Discrete Mathematics 202, 279\u2013298 (1999)","journal-title":"Discrete Mathematics"},{"key":"521_CR55","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0166-218X(01)00363-8","volume":"125","author":"J-Y Yao","year":"2003","unstructured":"Yao, J.-Y.: Opacity of a finite automaton, method of calculation and the Ising chain. Discrete Applied Mathematics 125, 289\u2013318 (2003)","journal-title":"Discrete Applied Mathematics"},{"key":"521_CR56","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.tcs.2003.12.020","volume":"314","author":"J-Y Yao","year":"2004","unstructured":"Yao, J.-Y.: Some properties of Ising automata. Theoretical Computer Science 314, 251\u2013279 (2004)","journal-title":"Theoretical Computer Science"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-026-00521-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00236-026-00521-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-026-00521-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T14:03:11Z","timestamp":1774274591000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00236-026-00521-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,9]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["521"],"URL":"https:\/\/doi.org\/10.1007\/s00236-026-00521-6","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,9]]},"assertion":[{"value":"25 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 February 2026","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"}}],"article-number":"7"}}