{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T13:12:25Z","timestamp":1783775545390,"version":"3.55.0"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T00:00:00Z","timestamp":1783728000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T00:00:00Z","timestamp":1783728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004794","name":"Centre National de la Recherche Scientifique","doi-asserted-by":"publisher","award":["CalcADN (ANR-24-RRII-0001)"],"award-info":[{"award-number":["CalcADN (ANR-24-RRII-0001)"]}],"id":[{"id":"10.13039\/501100004794","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2026,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>During evolution, some living systems grow more complex. They develop new functions and new structures: flying and wings, digestion and digestive systems, swimming and fins, etc. Due to natural selection, this increase in complexity must be operated while keeping livelihood, i.e., the new structures and functions are added while maintaining the original behavior. In this work, we continue the effort of representing the phenomenon of structural and behavioral extension in abstract discrete dynamical systems in order to elucidate some big-picture tendencies. We choose reaction systems as the formal tool, and propose a translation into this new language of the extensibility framework we developed previously. We argue that using reaction systems makes definitions lighter and therefore should allow for better insights from future exhaustive exploration of the extension space.<\/jats:p>","DOI":"10.1007\/s11047-026-10077-6","type":"journal-article","created":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T12:35:53Z","timestamp":1783773353000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A theoretical biology framework for exploring the behavioral extensibility of reaction systems"],"prefix":"10.1007","volume":"25","author":[{"given":"Artiom","family":"Alhazov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rudolf","family":"Freund","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Glade","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergiu","family":"Ivanov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sergey","family":"Verlan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,11]]},"reference":[{"key":"10077_CR1","doi-asserted-by":"publisher","DOI":"10.1016\/J.TCS.2023.114056","volume":"970","author":"A Alhazov","year":"2023","unstructured":"Alhazov A, Ferrari-Dominguez V, Freund R, Glade N, Ivanov S (2023) A P systems variant for reasoning about sequential controllability of Boolean networks. Theor Comput Sci 970:114056. https:\/\/doi.org\/10.1016\/J.TCS.2023.114056","journal-title":"Theor Comput Sci"},{"issue":"2","key":"10077_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/S11047-024-09986-1","volume":"23","author":"A Alhazov","year":"2024","unstructured":"Alhazov A, Freund R, Ivanov S (2024) On the spectrum between reaction systems and string rewriting. Nat Comput 23(2):159\u2013175. https:\/\/doi.org\/10.1007\/S11047-024-09986-1","journal-title":"Nat Comput"},{"issue":"4","key":"10077_CR3","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1007\/S11047-025-10037-6","volume":"24","author":"A Alhazov","year":"2025","unstructured":"Alhazov A, Freund R, Ivanov S, Verlan S (2025) The busy beaver game for reaction systems. Nat Comput 24(4):1013\u20131027. https:\/\/doi.org\/10.1007\/S11047-025-10037-6","journal-title":"Nat Comput"},{"key":"10077_CR4","doi-asserted-by":"publisher","unstructured":"Alhazov A, Aman B, Freund R, Ivanov S (2016) Simulating R systems by P systems. In: Leporati A, Rozenberg G, Salomaa A, Zandron C (eds) Membrane computing - 17th international conference, CMC 2016, Milan, Italy, July 25\u201329, 2016, Revised selected papers. Lecture notes in computer science, vol 10105. Springer, Cham, pp 51\u201366. https:\/\/doi.org\/10.1007\/978-3-319-54072-6_4","DOI":"10.1007\/978-3-319-54072-6_4"},{"issue":"3","key":"10077_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/S41965-020-00043-1","volume":"2","author":"B Aman","year":"2020","unstructured":"Aman B, Ciobanu G (2020) Mutual exclusion and reversibility in reaction systems. J Membr Comput 2(3):171\u2013178. https:\/\/doi.org\/10.1007\/S41965-020-00043-1","journal-title":"J Membr Comput"},{"issue":"3","key":"10077_CR6","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/S11047-025-10034-9","volume":"24","author":"B Aman","year":"2025","unstructured":"Aman B, Ciobanu G (2025) Reaction systems with nondeterministic behaviour. Nat Comput 24(3):719\u2013730. https:\/\/doi.org\/10.1007\/S11047-025-10034-9","journal-title":"Nat Comput"},{"issue":"3\u20134","key":"10077_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.3233\/FI-2014-1016","volume":"131","author":"S Azimi","year":"2014","unstructured":"Azimi S, Iancu B, Petre I (2014) Reaction system models for the heat shock response. Fundam Inf 131(3\u20134):299\u2013312. https:\/\/doi.org\/10.3233\/FI-2014-1016","journal-title":"Fundam Inf"},{"key":"10077_CR8","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/J.TCS.2015.02.014","volume":"598","author":"S Azimi","year":"2015","unstructured":"Azimi S, Gratie C, Ivanov S, Petre I (2015a) Dependency graphs and mass conservation in reaction systems. Theor Comput Sci 598:23\u201339. https:\/\/doi.org\/10.1016\/J.TCS.2015.02.014","journal-title":"Theor Comput Sci"},{"issue":"2","key":"10077_CR9","first-page":"9","volume":"I","author":"S Azimi","year":"2015","unstructured":"Azimi S, Panchal C, Czeizler E, Petre I (2015b) Reaction systems models for the self-assembly of intermediate filaments. Ann Univ Bucharest LXI I(2):9\u201324","journal-title":"Ann Univ Bucharest LXI"},{"key":"10077_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/J.TCS.2015.11.040","volume":"623","author":"S Azimi","year":"2016","unstructured":"Azimi S, Gratie C, Ivanov S, Manzoni L, Petre I, Porreca AE (2016) Complexity of model checking for reaction systems. Theor Comput Sci 623:103\u2013113. https:\/\/doi.org\/10.1016\/J.TCS.2015.11.040","journal-title":"Theor Comput Sci"},{"issue":"7","key":"10077_CR11","doi-asserted-by":"publisher","first-page":"1499","DOI":"10.1142\/S0129054111008842","volume":"22","author":"R Brijder","year":"2011","unstructured":"Brijder R, Ehrenfeucht A, Main MG, Rozenberg G (2011) A tour of reaction systems. Int J Found Comput Sci 22(7):1499\u20131517. https:\/\/doi.org\/10.1142\/S0129054111008842","journal-title":"Int J Found Comput Sci"},{"issue":"2\u20133","key":"10077_CR12","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/J.TCS.2006.11.022","volume":"372","author":"M Cavaliere","year":"2007","unstructured":"Cavaliere M, Freund R, Oswald M, Sburlan D (2007) Multiset random context grammars, checkers, and transducers. Theor Comput Sci 372(2\u20133):136\u2013151. https:\/\/doi.org\/10.1016\/J.TCS.2006.11.022","journal-title":"Theor Comput Sci"},{"key":"10077_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s10441-019-09358-8","volume":"68","author":"U Christen","year":"2020","unstructured":"Christen U, Ivanov S, Segretain R, Trilling L, Glade N (2020) On computing structural and behavioral complexities of threshold Boolean networks. Acta Biotheor 68:119\u2013138","journal-title":"Acta Biotheor"},{"key":"10077_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.tcs.2012.04.003","volume":"454","author":"L Corolli","year":"2012","unstructured":"Corolli L, Maj C, Marini F, Besozzi D, Mauri G (2012) An excursion in reaction systems: from computer science to biology. Theor Comput Sci 454:95\u2013108. https:\/\/doi.org\/10.1016\/j.tcs.2012.04.003","journal-title":"Theor Comput Sci"},{"issue":"2","key":"10077_CR15","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/S11047-024-09974-5","volume":"23","author":"E Csuhaj-Varj\u00fa","year":"2024","unstructured":"Csuhaj-Varj\u00fa E, Vaszil G (2024) Variants of distributed reaction systems. Nat Comput 23(2):269\u2013284. https:\/\/doi.org\/10.1007\/S11047-024-09974-5","journal-title":"Nat Comput"},{"key":"10077_CR16","doi-asserted-by":"publisher","unstructured":"Csuhaj-Varj\u00fa E, Salomaa A (1997) Networks of parallel language processors. In: Paun G, Salomaa A (eds) New trends in formal languages - control, cooperation, and combinatorics (to J\u00fcrgen Dassow on the occasion of his 50th birthday). Lecture notes in computer science. Springer, Cham, pp 299\u2013318. https:\/\/doi.org\/10.1007\/3-540-62844-4_22","DOI":"10.1007\/3-540-62844-4_22"},{"key":"10077_CR17","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/J.TCS.2015.06.001","volume":"598","author":"A Dennunzio","year":"2015","unstructured":"Dennunzio A, Formenti E, Manzoni L (2015a) Reaction systems and extremal combinatorics properties. Theor Comput Sci 598:138\u2013149. https:\/\/doi.org\/10.1016\/J.TCS.2015.06.001","journal-title":"Theor Comput Sci"},{"key":"10077_CR18","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2015.05.046","volume":"608","author":"A Dennunzio","year":"2015","unstructured":"Dennunzio A, Formenti E, Manzoni L, Porreca AE (2015b) Ancestors, descendants, and gardens of Eden in reaction systems. Theor Comput Sci 608:16\u201326. https:\/\/doi.org\/10.1016\/j.tcs.2015.05.046","journal-title":"Theor Comput Sci"},{"key":"10077_CR19","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.ic.2019.03.006","volume":"267","author":"A Dennunzio","year":"2019","unstructured":"Dennunzio A, Formenti E, Manzoni L, Porreca AE (2019) Complexity of the dynamics of reaction systems. Inf Comput 267:96\u2013109. https:\/\/doi.org\/10.1016\/j.ic.2019.03.006","journal-title":"Inf Comput"},{"key":"10077_CR20","doi-asserted-by":"publisher","unstructured":"Ehrenfeucht A, Rozenberg G (2007) Events and modules in reaction systems. Theoret Comput Sci 376(1):3\u201316. https:\/\/doi.org\/10.1016\/j.tcs.2007.01.008. Developments in Language Theory","DOI":"10.1016\/j.tcs.2007.01.008"},{"issue":"1\u20134","key":"10077_CR21","first-page":"263","volume":"75","author":"A Ehrenfeucht","year":"2007","unstructured":"Ehrenfeucht A, Rozenberg G (2007a) Reaction systems. Fundam Inf 75(1\u20134):263\u2013280","journal-title":"Fundam Inf"},{"key":"10077_CR22","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.tcs.2017.03.003","volume":"690","author":"A Ehrenfeucht","year":"2017","unstructured":"Ehrenfeucht A, Kleijn J, Koutny M, Rozenberg G (2017b) Evolving reaction systems Theoret Comput Sci 690:31\u201348. https:\/\/doi.org\/10.1016\/j.tcs.2017.03.003","journal-title":"Evolving reaction systems Theoret Comput Sci"},{"issue":"1","key":"10077_CR23","first-page":"51","volume":"12","author":"R Freund","year":"2016","unstructured":"Freund R, Ivanov S, Staiger L (2016) Going beyond Turing with P automata: Regular observer $$\\omega $$-languages and partial adult halting. Int J Unconv Comput 12(1):51\u201369","journal-title":"Int J Unconv Comput"},{"issue":"6\u20137","key":"10077_CR24","doi-asserted-by":"publisher","first-page":"1005","DOI":"10.1142\/S0129054119400264","volume":"30","author":"R Freund","year":"2019","unstructured":"Freund R, Rogojin V, Verlan S (2019) Variants of networks of evolutionary processors with polarizations and a small number of processors. Int J Found Comput Sci 30(6\u20137):1005\u20131027. https:\/\/doi.org\/10.1142\/S0129054119400264","journal-title":"Int J Found Comput Sci"},{"key":"10077_CR25","unstructured":"Glade N (2022) Le Vivant Rare, Faible et Amorphe - \u00c9volution Depuis les Origines Jusqu\u2019\u00e0 la Vie Telle Qu\u2019elle Nous Appara\u00eet. (rare, weak and amorphous life - evolution of life from the origins until life as it appears nowadays). Habilitation thesis (HDR), Grenoble. https:\/\/tel.archives-ouvertes.fr\/tel-04075075"},{"key":"10077_CR26","unstructured":"Ivanov S (2026) Various tools for dealing with reaction systems in Hy. Software repository. https:\/\/git.marvid.fr\/scolobb\/rs-hy. Accessed 20 May 2026"},{"issue":"4","key":"10077_CR27","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/S41965-020-00055-X","volume":"2","author":"S Ivanov","year":"2020","unstructured":"Ivanov S, Petre I (2020) Controllability of reaction systems. J Membr Comput 2(4):290\u2013302. https:\/\/doi.org\/10.1007\/S41965-020-00055-X","journal-title":"J Membr Comput"},{"key":"10077_CR28","doi-asserted-by":"publisher","unstructured":"Ivanov S, Rogojin V, Azimi S, Petre I (2018) WEBRSIM: A web-based reaction systems simulator. In: D\u00edaz CG, Riscos-N\u00fa\u00f1ez A, Paun G, Rozenberg G, Salomaa A(eds) Enjoying natural computing - essays dedicated to Mario de Jes\u00fas P\u00e9rez-Jim\u00e9nez on the occasion of his 70th birthday. Lecture notes in computer science, vol 11270. Springer, Cham, pp 170\u2013181. https:\/\/doi.org\/10.1007\/978-3-030-00265-7_14","DOI":"10.1007\/978-3-030-00265-7_14"},{"key":"10077_CR29","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.ins.2015.03.048","volume":"313","author":"A M\u0229ski","year":"2015","unstructured":"M\u0229ski A, Penczek W, Rozenberg G (2015) Model checking temporal properties of reaction systems. Inf Sci 313:22\u201342. https:\/\/doi.org\/10.1016\/j.ins.2015.03.048","journal-title":"Inf Sci"},{"key":"10077_CR30","doi-asserted-by":"publisher","first-page":"289","DOI":"10.3233\/FI-2017-1567","volume":"154","author":"A M\u0229ski","year":"2017","unstructured":"M\u0229ski A, Koutny M, Penczek W (2017) Verification of linear-time temporal properties for reaction systems with discrete concentrations. Fund Inf 154:289\u2013306. https:\/\/doi.org\/10.3233\/FI-2017-1567","journal-title":"Fund Inf"},{"key":"10077_CR31","first-page":"139","volume":"67","author":"Gh P\u0103un","year":"1999","unstructured":"P\u0103un Gh (1999) Computing with membranes: an introduction. Bull EATCS 67:139\u2013152","journal-title":"Bull EATCS"},{"key":"10077_CR32","doi-asserted-by":"publisher","unstructured":"Rozenberg G, Salomaa A (eds) (1997) Handbook of formal languages, vol 1\u20133. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-59136-5","DOI":"10.1007\/978-3-642-59136-5"},{"key":"10077_CR33","doi-asserted-by":"publisher","unstructured":"Salomaa A (2014) Minimal reaction systems defining subset functions. In: Calude CS, Freivalds R, Iwama K (eds) Computing with new resources - essays dedicated to Jozef Gruska on the occasion of his 80th birthday. Lecture notes in computer science, vol 8808. Springer, Cham, pp 436\u2013446. https:\/\/doi.org\/10.1007\/978-3-319-13350-8_32","DOI":"10.1007\/978-3-319-13350-8_32"},{"key":"10077_CR34","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/J.TCS.2012.07.022","volume":"466","author":"A Salomaa","year":"2012","unstructured":"Salomaa A (2012) Functions and sequences generated by reaction systems. Theor Comput Sci 466:87\u201396. https:\/\/doi.org\/10.1016\/J.TCS.2012.07.022","journal-title":"Theor Comput Sci"},{"issue":"2","key":"10077_CR35","doi-asserted-by":"publisher","first-page":"247","DOI":"10.14232\/actacyb.22.2.2015.2","volume":"22","author":"A Salomaa","year":"2015","unstructured":"Salomaa A (2015) Two-step simulations of reaction systems by minimal ones. Acta Cybern 22(2):247\u2013257. https:\/\/doi.org\/10.14232\/actacyb.22.2.2015.2","journal-title":"Acta Cybern"},{"issue":"1","key":"10077_CR36","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1142\/S0129054113500044","volume":"24","author":"A Salomaa","year":"2013","unstructured":"Salomaa A (2013) Functional constructions between reaction systems and propositional logic. Int J Found Comput Sci 24(1):147\u2013160. https:\/\/doi.org\/10.1142\/S0129054113500044","journal-title":"Int J Found Comput Sci"},{"key":"10077_CR37","doi-asserted-by":"publisher","unstructured":"Segretain R, Ivanov S, Trilling L, Glade N (2020a) A methodology for evaluating the extensibility of Boolean networks\u2019 structure and function. In: Benito RM, Cherifi C, Cherifi H, Moro E, Rocha LM, Sales-Pardo M (eds) Complex networks & their applications IX, vol 2, Proceedings of the ninth international conference on complex networks and their applications, Complex networks 2020, 1\u20133 December 2020, Madrid, Spain. Studies in computational intelligence, vol 944. Springer, Cham, pp 372\u2013385. https:\/\/doi.org\/10.1007\/978-3-030-65351-4_30","DOI":"10.1007\/978-3-030-65351-4_30"},{"key":"10077_CR38","doi-asserted-by":"publisher","DOI":"10.1101\/2020.10.02.323949","author":"R Segretain","year":"2020","unstructured":"Segretain R, Ivanov S, Trilling L, Glade N (2020b) Implementation of a computing pipeline for evaluating the extensibility of Boolean networks\u2019 structure and function. bioRxiv. https:\/\/doi.org\/10.1101\/2020.10.02.323949","journal-title":"bioRxiv"},{"key":"10077_CR39","doi-asserted-by":"publisher","unstructured":"Segretain R, Trilling L, Glade N, Ivanov S (2021) Who plays complex music? On the correlations between structural and behavioral complexity measures in sign Boolean networks. In: 21st IEEE International Conference on Bioinformatics and Bioengineering, BIBE 2021, Kragujevac, Serbia, 25\u201327 October 2021. IEEE, New York, pp 1\u20136. https:\/\/doi.org\/10.1109\/BIBE52308.2021.9635403","DOI":"10.1109\/BIBE52308.2021.9635403"},{"key":"10077_CR40","unstructured":"The Hy programming language (2026). https:\/\/hylang.org\/. Accessed 20 May 2026"},{"key":"10077_CR41","unstructured":"The Reaction Systems Webpage. https:\/\/www.reactionsystems.org\/. Accessed 13 Feb 2013"},{"key":"10077_CR42","doi-asserted-by":"publisher","unstructured":"Vuong Q, Chauvin RJ, Ivanov S, Glade N, Trilling L (2017) A logical constraint-based approach to infer and explore diversity and composition in thresholded Boolean automaton networks. In: Cherifi C, Cherifi H, Karsai M, Musolesi M (eds) Complex networks & their applications VI - proceedings of complex networks 2017 (the sixth international conference on complex networks and their applications), Complex networks 2017, Lyon, France, November 29\u2013December 1, 2017. Studies in computational intelligence, vol 689. Springer, Cham, pp 567\u2013579. https:\/\/doi.org\/10.1007\/978-3-319-72150-7_46","DOI":"10.1007\/978-3-319-72150-7_46"},{"key":"10077_CR43","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1098\/rspb.2007.1137","volume":"275","author":"A Wagner","year":"2008","unstructured":"Wagner A (2008) Robustness and evolvability: a paradox resolved. Proc Biol Sci 275:91\u2013100. https:\/\/doi.org\/10.1098\/rspb.2007.1137","journal-title":"Proc Biol Sci"},{"key":"10077_CR44","unstructured":"Wikipedia contributors (2025) Periodic sequence\u2014Wikipedia. The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Periodic_sequence&oldid=1300095478. Accessed 19 Mar 2026"},{"key":"10077_CR45","unstructured":"Wikipedia contributors (2026) Pareidolia\u2014Wikipedia. The Free Encyclopedia. https:\/\/en.wikipedia.org\/w\/index.php?title=Pareidolia&oldid=1343421437. Accessed 20 Mar 2026"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-026-10077-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-026-10077-6","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-026-10077-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T12:35:56Z","timestamp":1783773356000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-026-10077-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,11]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,12]]}},"alternative-id":["10077"],"URL":"https:\/\/doi.org\/10.1007\/s11047-026-10077-6","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,11]]},"assertion":[{"value":"31 March 2026","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"No generative AI tools were used in preparing this paper. The authors explicitly oppose combining this paper with generative AI tools in any way: no summarizing of this paper, no reviewing of this paper, no derived work based on this paper, etc.\u00a0using generative AI tools.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"No generative AI"}}],"article-number":"22"}}