{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T21:20:17Z","timestamp":1768598417108,"version":"3.49.0"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:00:00Z","timestamp":1768521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T00:00:00Z","timestamp":1768521600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2329908"],"award-info":[{"award-number":["2329908"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2329908"],"award-info":[{"award-number":["2329908"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2329908"],"award-info":[{"award-number":["2329908"]}],"id":[{"id":"10.13039\/100000001","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,6]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    The abstract Tile Assembly Model (aTAM) provides an excellent foundation for the mathematical study of DNA-tile-based self-assembling systems, especially those wherein logic is embedded within the designs of the tiles so that they follow prescribed algorithms. While such algorithmic self-assembling systems are theoretically powerful, being computationally universal and capable of building complex shapes using information-theoretically optimal numbers of tiles, physical DNA-based implementations of these systems still encounter formidable error rates and undesired nucleation that hinder this theoretical potential. Slat-based self-assembly is a recent development wherein DNA forms long slats that combine together in 2 layers, rather than square tiles in a plane. In this approach, the length of the slats is key; while tiles typically only bind to 2 neighboring tiles at a time, slats may bind to dozens of other slats. This increased coordination between slats means that several mismatched slats must coincidentally meet in just the right way for errors to persist, unlike tiles where only a few are required. Consequently, while still a novel technology, large slat-based DNA constructions have been successfully implemented in the lab with resilience to many tile-based construction problems. These improved error characteristics come at a cost however, as slat-based systems are often more difficult to design and simulate than tile-based ones. Moreover, it has not been clear whether slats, with their larger sizes and different geometries, have the same theoretical capabilities as tiles. In this paper, we show that slats are capable of doing anything that tiles can, at least at scale. We demonstrate that any aTAM system may be converted to and simulated by an effectively equivalent system of slats. Furthermore, we show that these simulating slat systems can be made more efficiently, using shorter slats and a smaller scale factor, if the simulated tile system avoids certain uncommon growth patterns. Specifically, we consider 5 classes of aTAM systems with increasing complexity, from zig-zag systems which grow in a rigid pattern to the full class of all aTAM systems, and show how they may be converted to equivalent slat systems. We show that the simplest class may be simulated by slats at only a\n                    <jats:inline-formula>\n                      <jats:tex-math>$$2c \\times 2c$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    scale, where\n                    <jats:italic>c<\/jats:italic>\n                    is the freely chosen coordination number of the slats, and further show that the full class of aTAM systems can be simulated at only a\n                    <jats:inline-formula>\n                      <jats:tex-math>$$5c \\times 5c$$<\/jats:tex-math>\n                    <\/jats:inline-formula>\n                    scale. These results prove that slats have the full theoretical power of aTAM tiles while also providing constructions that are compact enough for potential DNA-based implementations of slat systems that are both capable of powerful algorithmic self-assembly and possessing of the strong error resilience of slats. This paper is an extended version of a version that appeared in the proceedings of the 30th International Conference on DNA Computing and Molecular Programming (DNA 30).\n                  <\/jats:p>","DOI":"10.1007\/s11047-025-10057-2","type":"journal-article","created":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T11:16:30Z","timestamp":1768562190000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Simulation of the abstract Tile Assembly Model using crisscross slats (extended version)"],"prefix":"10.1007","volume":"25","author":[{"given":"Phillip","family":"Drake","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Hader","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew J.","family":"Patitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,16]]},"reference":[{"key":"10057_CR1","doi-asserted-by":"crossref","unstructured":"Alseth A, Patitz MJ (2023) The need for seed (in the abstract tile assembly model). In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), SIAM, pp 4540\u20134589","DOI":"10.1137\/1.9781611977554.ch172"},{"key":"10057_CR2","unstructured":"Cannon S, Demaine ED, Demaine ML et\u00a0al (2013) Two hands are better than one (up to constant factors): Self-assembly in the 2HAM vs. aTAM. In: Portier N, Wilke T (eds) STACS, LIPIcs, vol\u00a020. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pp 172\u2013184"},{"key":"10057_CR3","first-page":"62","volume-title":"10th International Workshop on DNA Computing, DNA10, LNCS","author":"HL Chen","year":"2005","unstructured":"Chen HL, Goel A (2005) Error free self-assembly using error prone tiles. In: Ferretti C, Mauri G, Zandron C (eds) 10th International Workshop on DNA Computing, DNA10, LNCS, vol 3384. Springer Verlag, pp 62\u201375"},{"key":"10057_CR4","unstructured":"Chen H, Goel A, Winfree E et\u00a0al (2007a) Self-assembling tile systems that heal from small fragments. In: in Preliminary Proceedings of DNA Computing 13, pp 30\u201346"},{"issue":"9","key":"10057_CR5","doi-asserted-by":"publisher","first-page":"2913","DOI":"10.1021\/nl070793o","volume":"7","author":"HL Chen","year":"2007","unstructured":"Chen HL, Schulman R, Goel A et al (2007b) Reducing facet nucleation during algorithmic self-assembly. Nano Lett 7(9):2913\u20132919. https:\/\/doi.org\/10.1021\/nl070793o","journal-title":"Nano Lett"},{"key":"10057_CR6","doi-asserted-by":"crossref","unstructured":"Cook M, Fu Y, Schweller RT (2011) Temperature 1 self-assembly: Deterministic assembly in 3D and probabilistic assembly in 2D. In: SODA 2011: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM","DOI":"10.1137\/1.9781611973082.45"},{"key":"10057_CR7","doi-asserted-by":"publisher","DOI":"10.1021\/jacs.4c00097","author":"J Deng","year":"2024","unstructured":"Deng J, Minev D, Ershova A et al (2024) Branching crisscross polymerization of single-stranded DNA slats. J Am Chem Soc. https:\/\/doi.org\/10.1021\/jacs.4c00097","journal-title":"J Am Chem Soc"},{"key":"10057_CR8","doi-asserted-by":"crossref","unstructured":"Doty D, Lutz JH, Patitz MJ, et\u00a0al (2012) The tile assembly model is intrinsically universal. In: Proceedings of the 53rd Annual IEEE Symposium on Foundations of Computer Science, FOCS 2012, pp 302\u2013310","DOI":"10.1109\/FOCS.2012.76"},{"key":"10057_CR9","unstructured":"Doty D, Fleming H, Hader D, et\u00a0al (2023) Accelerating self-assembly of crisscross slat systems. In: 29th International Conference on DNA Computing and Molecular Programming (DNA 29)(2023), Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik"},{"key":"10057_CR10","doi-asserted-by":"publisher","DOI":"10.1038\/nature08016","volume":"459","author":"SM Douglas","year":"2009","unstructured":"Douglas SM, Dietz H, Liedl T et al (2009) Self-assembly of DNA into nanoscale three-dimensional shapes. Nature 459:414. https:\/\/doi.org\/10.1038\/nature08016","journal-title":"Nature"},{"key":"10057_CR11","unstructured":"Drake P, Hader D, Patitz MJ (2024) Simulation of the abstract tile assembly model using crisscross slats. In: 30th International Conference on DNA Computing and Molecular Programming (DNA 30)(2024), Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik, pp 3\u20131"},{"issue":"1","key":"10057_CR12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1021\/jacs.3c08205","volume":"146","author":"A Ershova","year":"2023","unstructured":"Ershova A, Minev D, Corea-Dilbert FE et al (2023) Enzyme-free exponential amplification via growth and scission of crisscross ribbons from single-stranded DNA components. J Am Chem Soc 146(1):218\u2013227","journal-title":"J Am Chem Soc"},{"key":"10057_CR13","unstructured":"Evans CG (2014) Crystals that count! Physical principles and experimental investigations of DNA tile self-assembly. PhD thesis, California Institute of Technology"},{"key":"10057_CR14","doi-asserted-by":"crossref","unstructured":"Fekete SP, Hendricks J, Patitz MJ, et\u00a0al (2015) Universal computation with arbitrary polyomino tiles in non-cooperative self-assembly. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015), San Diego, CA, USA, January 4-6, 2015, pp 148\u2013167","DOI":"10.1137\/1.9781611973730.12"},{"issue":"7295","key":"10057_CR15","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1038\/nature09026","volume":"465","author":"H Gu","year":"2010","unstructured":"Gu H, Chao J, Xiao SJ et al (2010) A proximity-based programmable DNA nanoscale assembly line. Nature 465(7295):202\u2013205. https:\/\/doi.org\/10.1038\/nature09026","journal-title":"Nature"},{"key":"10057_CR16","unstructured":"Hader D, Patitz MJ (2023a) Abstract slat assembly model (asam). http:\/\/self-assembly.net\/wiki\/index.php\/Abstract_Slat_Assembly_Model_(aSAM), [Online; accessed 9-July-2024]"},{"key":"10057_CR17","doi-asserted-by":"publisher","unstructured":"Hader D, Patitz MJ (2023b) The impacts of dimensionality, diffusion, and directedness on intrinsic cross-model simulation in tile-based self-assembly. In: Etessami K, Feige U, Puppis G (eds) 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023, July 10-14, 2023, Paderborn, Germany, LIPIcs, vol 261. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, pp 71:1\u201371:19. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2023.71","DOI":"10.4230\/LIPIcs.ICALP.2023.71"},{"key":"#cr-split#-10057_CR18.1","doi-asserted-by":"crossref","unstructured":"Hader D, Koch A, Patitz MJ, et\u00a0al (2020) The impacts of dimensionality, diffusion, and directedness on intrinsic universality in the abstract tile assembly model. In: Chawla S","DOI":"10.1137\/1.9781611975994.159"},{"key":"#cr-split#-10057_CR18.2","unstructured":"(ed) Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, Salt Lake City, UT, USA, January 5-8, 2020. SIAM, pp 2607-2624"},{"key":"10057_CR19","doi-asserted-by":"crossref","unstructured":"Hendricks J, Patitz MJ, Rogers TA (2016) Universal simulation of directed systems in the abstract tile assembly model requires undirectedness. In: Proceedings of the 57th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2016), New Brunswick, New Jersey, USA October 9-11, 2016, pp 800\u2013809","DOI":"10.1109\/FOCS.2016.90"},{"key":"10057_CR20","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.tcs.2015.12.008","volume":"743","author":"J Hendricks","year":"2018","unstructured":"Hendricks J, Patitz MJ, Rogers TA et al (2018) The power of duples (in self-assembly): it\u2019s not so hip to be square. Theor Comput Sci 743:148\u2013166","journal-title":"Theor Comput Sci"},{"issue":"6111","key":"10057_CR21","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1126\/science.1227268","volume":"338","author":"Y Ke","year":"2012","unstructured":"Ke Y, Ong LL, Shih WM et al (2012) Three-dimensional structures self-assembled from DNA bricks. Science 338(6111):1177\u20131183","journal-title":"Science"},{"key":"10057_CR22","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/j.tcs.2008.09.062","volume":"410","author":"JI Lathrop","year":"2009","unstructured":"Lathrop JI, Lutz JH, Summers SM (2009) Strict self-assembly of discrete Sierpinski triangles. Theor Comput Sci 410:384\u2013405","journal-title":"Theor Comput Sci"},{"issue":"3","key":"10057_CR23","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/s00224-010-9252-0","volume":"48","author":"JI Lathrop","year":"2011","unstructured":"Lathrop JI, Lutz JH, Patitz MJ et al (2011) Computability and complexity in self-assembly. Theor Comput Syst 48(3):617\u2013647","journal-title":"Theor Comput Syst"},{"issue":"1","key":"10057_CR24","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1002\/anie.201005911","volume":"50","author":"W Liu","year":"2011","unstructured":"Liu W, Zhong H, Wang R et al (2011) Crystalline two-dimensional DNA-origami arrays. Angew Chem Int Ed 50(1):264\u2013267. https:\/\/doi.org\/10.1002\/anie.201005911","journal-title":"Angew Chem Int Ed"},{"issue":"7295","key":"10057_CR25","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1038\/nature09012","volume":"465","author":"K Lund","year":"2010","unstructured":"Lund K, Manzo AJ, Dabby N et al (2010) Molecular robots guided by prescriptive landscapes. Nature 465(7295):206\u2013210. https:\/\/doi.org\/10.1038\/nature09012","journal-title":"Nature"},{"key":"10057_CR26","doi-asserted-by":"publisher","unstructured":"Meunier PE, Woods D (2017) The non-cooperative tile assembly model is not intrinsically universal or capable of bounded turing machine simulation. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. ACM, New York, NY, USA, STOC 2017, pp 328\u2013341, https:\/\/doi.org\/10.1145\/3055399.3055446","DOI":"10.1145\/3055399.3055446"},{"key":"10057_CR27","doi-asserted-by":"crossref","unstructured":"Meunier PE, Patitz MJ, Summers SM et\u00a0al (2014) Intrinsic universality in tile self-assembly requires cooperation. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2014), (Portland, OR, USA, January 5-7, 2014), pp 752\u2013771","DOI":"10.1137\/1.9781611973402.56"},{"issue":"1","key":"10057_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-021-21755-7","volume":"12","author":"D Minev","year":"2021","unstructured":"Minev D, Wintersinger CM, Ershova A et al (2021) Robust nucleation control via crisscross polymerization of highly coordinated DNA slats. Nat Commun 12(1):1\u20139","journal-title":"Nat Commun"},{"key":"10057_CR29","doi-asserted-by":"crossref","unstructured":"Ollinger N (2003) The intrinsic universality problem of one-dimensional cellular automata. In: Annual Symposium on Theoretical Aspects of Computer Science, Springer, pp 632\u2013641","DOI":"10.1007\/3-540-36494-3_55"},{"key":"10057_CR30","doi-asserted-by":"crossref","unstructured":"Ollinger N (2008) Intrinsically universal cellular automata. In: The Complexity of Simple Programs, in Electronic Proceedings in Theoretical Computer Science, pp 199\u2013204","DOI":"10.4204\/EPTCS.1.19"},{"issue":"2","key":"10057_CR31","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s11047-011-9268-7","volume":"11","author":"JE Padilla","year":"2012","unstructured":"Padilla JE, Liu W, Seeman NC (2012) Hierarchical self assembly of patterns from the robinson tilings: DNA tile design in an enhanced tile assembly model. Nat Comput 11(2):323\u2013338","journal-title":"Nat Comput"},{"issue":"2","key":"10057_CR32","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s11047-010-9218-9","volume":"10","author":"MJ Patitz","year":"2011","unstructured":"Patitz MJ, Summers SM (2011) Self-assembly of decidable sets. Nat Comput 10(2):853\u2013877","journal-title":"Nat Comput"},{"key":"10057_CR33","doi-asserted-by":"crossref","unstructured":"Patitz MJ, Schweller RT, Summers SM (2011) Exact shapes and Turing universality at temperature 1 with a single negative glue. In: Cardelli L, Shih WM (eds) DNA Computing and Molecular Programming - 17th International Conference, DNA 17, Pasadena, CA, USA, September 19-23, 2011. Proceedings, Lecture Notes in Computer Science, vol 6937. Springer, pp 175\u2013189","DOI":"10.1007\/978-3-642-23638-9_15"},{"key":"10057_CR34","doi-asserted-by":"crossref","unstructured":"Reif J, Sahu S, Yin P (2004) Compact error-resilient computational DNA tiling assemblies. In: DNA: International Workshop on DNA-Based Computers. LNCS","DOI":"10.1007\/11493785_26"},{"issue":"12","key":"10057_CR35","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pbio.0020424","volume":"2","author":"PW Rothemund","year":"2004","unstructured":"Rothemund PW, Papadakis N, Winfree E (2004) Algorithmic self-assembly of DNA sierpinski triangles. PLoS Biol 2(12):e424","journal-title":"PLoS Biol"},{"issue":"7082","key":"10057_CR36","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1038\/nature04586","volume":"440","author":"PWK Rothemund","year":"2006","unstructured":"Rothemund PWK (2006) Folding DNA to create nanoscale shapes and patterns. Nature 440(7082):297\u2013302. https:\/\/doi.org\/10.1038\/nature04586","journal-title":"Nature"},{"key":"10057_CR37","doi-asserted-by":"crossref","unstructured":"Rothemund PWK, Winfree E (2000) The program-size complexity of self-assembled squares (extended abstract). In: STOC \u201900: Proceedings of the thirty-second annual ACM Symposium on Theory of Computing. ACM, Portland, Oregon, United States, pp 459\u2013468","DOI":"10.1145\/335305.335358"},{"key":"10057_CR38","doi-asserted-by":"crossref","unstructured":"Soloveichik D, Winfree E (2005) Complexity of compact proofreading for self-assembled patterns. In: Carbone A, Pierce NA (eds) DNA Computing, 11th International Workshop on DNA Computing, DNA11, London, ON, Canada, June 6-9, 2005. Revised Selected Papers, Lecture Notes in Computer Science, vol 3892. Springer, pp 305\u2013324","DOI":"10.1007\/11753681_24"},{"issue":"6","key":"10057_CR39","doi-asserted-by":"publisher","first-page":"1544","DOI":"10.1137\/S0097539704446712","volume":"36","author":"D Soloveichik","year":"2007","unstructured":"Soloveichik D, Winfree E (2007) Complexity of self-assembled shapes. SIAM J Comput 36(6):1544\u20131569","journal-title":"SIAM J Comput"},{"issue":"2","key":"10057_CR40","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s11047-007-9036-x","volume":"7","author":"D Soloveichik","year":"2008","unstructured":"Soloveichik D, Cook M, Winfree E (2008) Combining self-healing and proofreading in self-assembly. Nat Comput 7(2):203\u2013218","journal-title":"Nat Comput"},{"issue":"7683","key":"10057_CR41","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1038\/nature24655","volume":"552","author":"G Tikhomirov","year":"2017","unstructured":"Tikhomirov G, Petersen P, Qian L (2017) Fractal assembly of micrometre-scale DNA origami arrays with arbitrary patterns. Nature 552(7683):67\u201371","journal-title":"Nature"},{"key":"10057_CR42","unstructured":"Winfree E (1998) Algorithmic self-assembly of DNA. PhD thesis, California Institute of Technology"},{"key":"10057_CR43","doi-asserted-by":"crossref","unstructured":"Winfree E, Bekbolatov R (2003) Proofreading tile sets: Error correction for algorithmic self-assembly. In: Chen J, Reif JH (eds) DNA Computing, 9th International Workshop on DNA Based Computers, DNA9, Madison, WI, USA, June 1\u20133, 2003, revised Papers, vol 2943. Lecture Notes in Computer Science. Springer, pp 126\u2013144","DOI":"10.1007\/978-3-540-24628-2_13"},{"key":"10057_CR44","doi-asserted-by":"publisher","DOI":"10.1038\/s41565-022-01283-1","author":"CM Wintersinger","year":"2022","unstructured":"Wintersinger CM, Minev D, Ershova A et al (2022) Multi-micron crisscross structures grown from DNA-origami slats. Nat Nanotechnol. https:\/\/doi.org\/10.1038\/s41565-022-01283-1","journal-title":"Nat Nanotechnol"},{"key":"10057_CR45","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2014.0214","author":"D Woods","year":"2015","unstructured":"Woods D (2015) Intrinsic universality and the computational power of self-assembly. Philos Trans R Soc Lond A Math Phys Eng Sci. https:\/\/doi.org\/10.1098\/rsta.2014.0214","journal-title":"Philos Trans R Soc Lond A Math Phys Eng Sci"},{"issue":"7748","key":"10057_CR46","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1038\/s41586-019-1014-9","volume":"567","author":"D Woods","year":"2019","unstructured":"Woods D, Doty D, Myhrvold C et al (2019) Diverse and robust molecular algorithms using reprogrammable DNA self-assembly. Nature 567(7748):366\u2013372","journal-title":"Nature"},{"issue":"1","key":"10057_CR47","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-017-00070-0","volume":"8","author":"Y Zhang","year":"2017","unstructured":"Zhang Y, McMullen A, Pontani LL et al (2017) Sequential self-assembly of DNA functionalized droplets. Nat Commun 8(1):21. https:\/\/doi.org\/10.1038\/s41467-017-00070-0","journal-title":"Nat Commun"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-025-10057-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-025-10057-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-025-10057-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T11:16:46Z","timestamp":1768562206000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-025-10057-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,16]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["10057"],"URL":"https:\/\/doi.org\/10.1007\/s11047-025-10057-2","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,16]]},"assertion":[{"value":"1 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 January 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":"4"}}