{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T19:28:19Z","timestamp":1768073299125,"version":"3.49.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CAREER-1553166"],"award-info":[{"award-number":["CAREER-1553166"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Nat Comput"],"published-print":{"date-parts":[[2025,9]]},"DOI":"10.1007\/s11047-023-09942-5","type":"journal-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T02:02:30Z","timestamp":1682474550000},"page":"367-382","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fractal dimension of assemblies in the abstract tile assembly model"],"prefix":"10.1007","volume":"24","author":[{"given":"Daniel","family":"Hader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9287-4028","authenticated-orcid":false,"given":"Matthew J.","family":"Patitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Scott M.","family":"Summers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,26]]},"reference":[{"key":"9942_CR1","doi-asserted-by":"crossref","unstructured":"Barth K, Furcy D, Summers SM, et\u00a0al (2014) Scaled tree fractals do not strictly self-assemble. In: Unconventional Computation & Natural Computation (UCNC) 2014, University of Western Ontario, London, Ontario, Canada July 14-18, 2014, pp 27\u201339","DOI":"10.1007\/978-3-319-08123-6_3"},{"key":"9942_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":"9942_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.tcs.2021.09.011","volume":"894","author":"S Cannon","year":"2021","unstructured":"Cannon S, Demaine ED, Demaine ML et al (2021) On the effects of hierarchical self-assembly for reducing program-size complexity. Theor Comput Sci 894:50\u201378","journal-title":"Theor Comput Sci"},{"key":"9942_CR4","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s00453-015-0022-x","volume":"76","author":"CT Chalk","year":"2015","unstructured":"Chalk CT, Fernandez DA, Huerta A et al (2015) Strict self-assembly of fractals using multiple hands. Algorithmica 76:195\u2013224","journal-title":"Algorithmica"},{"issue":"2","key":"9942_CR5","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/s00453-015-9976-y","volume":"74","author":"ED Demaine","year":"2016","unstructured":"Demaine ED, Patitz MJ, Rogers TA et al (2016) The two-handed tile assembly model is not intrinsically universal. Algorithmica 74(2):812\u2013850. https:\/\/doi.org\/10.1007\/s00453-015-9976-y","journal-title":"Algorithmica"},{"key":"9942_CR6","doi-asserted-by":"crossref","unstructured":"Doty D, Gu X, Lutz JH, et\u00a0al (2005) Zeta-Dimension. In: Proceedings of the thirtieth international symposium on mathematical foundations of computer science. Springer-Verlag, pp 283\u2013294","DOI":"10.1007\/11549345_25"},{"key":"9942_CR7","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":"9942_CR8","unstructured":"Evans CG (2014) Crystals that count! Physical principles and experimental investigations of DNA tile self-assembly. PhD thesis, California Institute of Technology"},{"issue":"2","key":"9942_CR9","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/s11047-015-9528-z","volume":"16","author":"D Furcy","year":"2017","unstructured":"Furcy D, Summers SM (2017) Scaled pier fractals do not strictly self-assemble. Nat Comput 16(2):317\u2013338","journal-title":"Nat Comput"},{"key":"#cr-split#-9942_CR10.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#-9942_CR10.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":"9942_CR11","doi-asserted-by":"crossref","unstructured":"Hader D, Patitz MJ, Summers SM (2021) Fractal dimension of assemblies in the abstract tile assembly model. In: international conference on unconventional computation and natural computation, Springer, pp 116\u2013130","DOI":"10.1007\/978-3-030-87993-8_8"},{"key":"9942_CR12","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J Hartmanis","year":"1965","unstructured":"Hartmanis J, Stearns RE (1965) On the computational complexity of algorithms. Trans Am Math Soc 117:285\u2013306","journal-title":"Trans Am Math Soc"},{"key":"9942_CR13","doi-asserted-by":"crossref","unstructured":"Hendricks J, Opseth J (2017) Self-assembly of 4-sided fractals in the two-handed tile assembly model. In: Proceedings of the 16th annual confreence on unconventional computation and natural computation (UCNC 2017), Fayetteville, Arkansas, USA June 5-9, 2017, pp 113\u2013128","DOI":"10.1007\/978-3-319-58187-3_9"},{"key":"9942_CR14","doi-asserted-by":"crossref","unstructured":"Hendricks J, Olsen M, Patitz MJ, et\u00a0al (2016a) Hierarchical self-assembly of fractals with signal-passing tiles (extended abstract). In: Proceedings of the 22nd international conference on dna computing and molecular programming (DNA 22), Ludwig-Maximilians-Universit\u00e4t, Munich, Germany September 4-8, 2016, pp 82\u201397","DOI":"10.1007\/978-3-319-43994-5_6"},{"key":"9942_CR15","doi-asserted-by":"crossref","unstructured":"Hendricks J, Patitz MJ, Rogers TA (2016b) 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":"9942_CR16","doi-asserted-by":"crossref","unstructured":"Hendricks J, Obseth J, Patitz MJ, et\u00a0al (2018) Hierarchical growth is necessary and (sometimes) sufficient to self-assemble discrete self-similar fractals. In: Proceedings of the 24th international conference on dna computing and molecular programming (DNA 24), Shandong Normal University, Jinan, China October 8-12, pp 87\u2013104","DOI":"10.1007\/978-3-030-00030-1_6"},{"issue":"02","key":"9942_CR17","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1142\/S0129054114500087","volume":"25","author":"N Jonoska","year":"2014","unstructured":"Jonoska N, Karpenko D (2014) Active tile self-assembly, Part 1: universality at temperature 1. Int J Found Comput Sci 25(02):141\u2013163. https:\/\/doi.org\/10.1142\/S0129054114500087","journal-title":"Int J Found Comput Sci"},{"issue":"02","key":"9942_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1142\/S0129054114500099","volume":"25","author":"N Jonoska","year":"2014","unstructured":"Jonoska N, Karpenko D (2014) Active tile self-assembly, Part 2: self-similar structures and structural recursion. Int J Found Comput Sci 25(02):165\u2013194. https:\/\/doi.org\/10.1142\/S0129054114500099","journal-title":"Int J Found Comput Sci"},{"issue":"2","key":"9942_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00453-012-9691-x","volume":"67","author":"S Kautz","year":"2013","unstructured":"Kautz S, Shutters B (2013) Self-assembling rulers for approximating generalized sierpinski carpets. Algorithmica 67(2):207\u2013233","journal-title":"Algorithmica"},{"key":"9942_CR20","doi-asserted-by":"crossref","unstructured":"Kautz SM, Lathrop JI (2009) Self-assembly of the Sierpinski carpet and related fractals. In: Proceedings of The fifteenth international meeting on dna computing and molecular programming (Fayetteville, Arkansas, USA, June 8-11, 2009), pp 78\u201387","DOI":"10.1007\/978-3-642-10604-0_8"},{"key":"9942_CR21","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. Theoret Comput Sci 410:384\u2013405","journal-title":"Theoret Comput Sci"},{"issue":"3","key":"9942_CR22","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. Theory Comput Syst 48(3):617\u2013647","journal-title":"Theory Comput Syst"},{"issue":"3","key":"9942_CR23","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/s00224-011-9345-4","volume":"51","author":"JH Lutz","year":"2012","unstructured":"Lutz JH, Shutters B (2012) Approximate self-assembly of the sierpinski triangle. Theory Comput Syst 51(3):372\u2013400","journal-title":"Theory Comput Syst"},{"key":"9942_CR24","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"},{"issue":"4","key":"9942_CR25","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1142\/S0129054114400061","volume":"25","author":"JE Padilla","year":"2014","unstructured":"Padilla JE, Patitz MJ, Schweller RT et al (2014) Asynchronous signal passing for tile self-assembly: fuel efficient computation and efficient assembly of shapes. Int J Found Comput Sci 25(4):459\u2013488","journal-title":"Int J Found Comput Sci"},{"key":"9942_CR26","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11047-009-9147-7","volume":"1","author":"MJ Patitz","year":"2010","unstructured":"Patitz MJ, Summers SM (2010) Self-assembly of discrete self-similar fractals. Nat Comput 1:135\u2013172","journal-title":"Nat Comput"},{"issue":"2","key":"9942_CR27","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"},{"issue":"1\u20132","key":"9942_CR28","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.tcs.2010.08.015","volume":"412","author":"MJ Patitz","year":"2011","unstructured":"Patitz MJ, Summers SM (2011) Self-assembly of infinite structures: a survey. Theor Comput Sci 412(1\u20132):159\u2013165. https:\/\/doi.org\/10.1016\/j.tcs.2010.08.015","journal-title":"Theor Comput Sci"},{"key":"9942_CR29","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"},{"issue":"12","key":"9942_CR30","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pbio.0020424","volume":"2","author":"PWK Rothemund","year":"2004","unstructured":"Rothemund PWK, Papadakis N, Winfree E (2004) Algorithmic self-assembly of DNA Sierpinski triangles. PLoS Biol 2(12):e424","journal-title":"PLoS Biol"},{"issue":"6","key":"9942_CR31","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"},{"key":"9942_CR32","unstructured":"Winfree E (1998) Algorithmic self-assembly of DNA. PhD thesis, California Institute of Technology"},{"key":"9942_CR33","doi-asserted-by":"publisher","unstructured":"Woods D (2015) Intrinsic universality and the computational power of self-assembly. Philosophical Transactions of the Royal Society of London A: Mathematical, Physical and Engineering Sciences 373(2046). https:\/\/doi.org\/10.1098\/rsta.2014.0214,","DOI":"10.1098\/rsta.2014.0214"},{"key":"9942_CR34","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:366\u2013372","journal-title":"Nature"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-023-09942-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-023-09942-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-023-09942-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T19:19:46Z","timestamp":1757531986000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-023-09942-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,26]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,9]]}},"alternative-id":["9942"],"URL":"https:\/\/doi.org\/10.1007\/s11047-023-09942-5","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,26]]},"assertion":[{"value":"2 April 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"In the interest of complying with the ethical standards of Springer and Natural Computing, to the best of our knowledge, there have been no conflicts of interest during any process of writing this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}