{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T20:00:37Z","timestamp":1766088037788},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T00:00:00Z","timestamp":1676592000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T00:00:00Z","timestamp":1676592000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1007\/s00453-023-01103-5","type":"journal-article","created":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T05:07:26Z","timestamp":1676610446000},"page":"2427-2453","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Unique Assembly Verification in Two-Handed Self-Assembly"],"prefix":"10.1007","volume":"85","author":[{"given":"David","family":"Caballero","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timothy","family":"Gomez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Schweller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tim","family":"Wylie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,17]]},"reference":[{"key":"1103_CR1","unstructured":"Winfree, E.: Algorithmic self-assembly of DNA. Ph.D. thesis, California Institute of Technology (1998)"},{"key":"1103_CR2","doi-asserted-by":"publisher","unstructured":"Meunier, P.-E., Regnault, D., Woods, D.: The program-size complexity of self-assembled paths. In: STOC: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. STOC 2020, pp. 727\u2013737. Association for Computing Machinery (2020). https:\/\/doi.org\/10.1145\/3357713.3384263","DOI":"10.1145\/3357713.3384263"},{"key":"1103_CR3","doi-asserted-by":"publisher","unstructured":"Meunier, P.-E., Woods, D.: The non-cooperative tile assembly model is not intrinsically universal or capable of bounded turing machine simulation. In: STOC: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing. STOC 2017, pp. 328\u2013341. Association for Computing Machinery (2017). https:\/\/doi.org\/10.1145\/3055399.3055446","DOI":"10.1145\/3055399.3055446"},{"key":"1103_CR4","unstructured":"Cannon, S., Demaine, E.D., Demaine, M.L., Eisenstat, S., Patitz, M.J., Schweller, R.T., Summers, S.M., Winslow, A.: Two hands are better than one (up to constant factors): self-assembly in the 2HAM vs. aTAM. In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013). Leibniz International Proceedings in Informatics (LIPIcs), vol. 20, pp. 172\u2013184. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik(2013)"},{"key":"1103_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-015-0022-x","author":"C Chalk","year":"2014","unstructured":"Chalk, C., Fernandez, D., Huerta, A., Maldonado, M., Schweller, R., Sweet, L.: Strict self-assembly of fractals using multiple hands. Algorithmica (2014). https:\/\/doi.org\/10.1007\/s00453-015-0022-x","journal-title":"Algorithmica"},{"key":"1103_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s11047-018-9718-6","volume":"18","author":"J Hendricks","year":"2018","unstructured":"Hendricks, J., Opseth, J.: Self-assembly of 4-sided fractals in the two-handed tile assembly model. Nat. Comput. 18, 75\u201392 (2018)","journal-title":"Nat. Comput."},{"key":"1103_CR7","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, E.D., Demaine, M.L., Eisenstat, S., Furcy, D., Patitz, M.J., Schweller, R., Summers, S.M., Winslow, A.: On the effects of hierarchical self-assembly for reducing program-size complexity. Theoret. Comput. Sci. 894, 50\u201378 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.09.011","journal-title":"Theoret. Comput. Sci."},{"key":"1103_CR8","doi-asserted-by":"crossref","unstructured":"Chen, H.-L., Doty, D.: Parallelism and time in hierarchical self-assembly. SIAM J. Comput. 46(2), 661\u2013709 (2017)","DOI":"10.1137\/151004161"},{"key":"1103_CR9","doi-asserted-by":"crossref","unstructured":"Adleman, L.M., Cheng, Q., Goel, A., Huang, M.-D.A., Kempe, D., de Espan\u00e9s, P.M., Rothemund, P.W.K.: Combinatorial optimization problems in self-assembly. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 23\u201332 (2002)","DOI":"10.1145\/509907.509913"},{"key":"1103_CR10","unstructured":"Winfree, E., Schulman, R., Evans, C.: The Xgrow Simulator. https:\/\/www.dna.caltech.edu\/Xgrow\/"},{"key":"1103_CR11","unstructured":"Patitz, M.: PyTAS. http:\/\/self-assembly.net\/wiki\/index.php?title=PyTAS"},{"key":"1103_CR12","unstructured":"Group, A.S.-A.R.: VersaTile. https:\/\/github.com\/asarg\/VersaTile (2014)"},{"issue":"3","key":"1103_CR13","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11047-008-9073-0","volume":"7","author":"ED Demaine","year":"2008","unstructured":"Demaine, E.D., Demaine, M.L., Fekete, S.P., Ishaque, M., Rafalin, E., Schweller, R.T., Souvaine, D.L.: Staged self-assembly: nanomanufacture of arbitrary shapes with o(1) glues. Nat. Comput. 7(3), 347\u2013370 (2008)","journal-title":"Nat. Comput."},{"issue":"6","key":"1103_CR14","doi-asserted-by":"publisher","first-page":"1493","DOI":"10.1137\/S0097539704445202","volume":"34","author":"G Aggarwal","year":"2005","unstructured":"Aggarwal, G., Cheng, Q., Goldwasser, M.H., Kao, M.-Y., de Espanes, P.M., Schweller, R.T.: Complexities for generalized models of self-assembly. SIAM J. Comput. 34(6), 1493\u20131515 (2005). https:\/\/doi.org\/10.1137\/S0097539704445202","journal-title":"SIAM J. Comput."},{"issue":"2","key":"1103_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11047-013-9379-4","volume":"13","author":"MJ Patitz","year":"2014","unstructured":"Patitz, M.J.: An introduction to tile-based self-assembly and a survey of recent results. Nat. Comput. 13(2), 195\u2013224 (2014)","journal-title":"Nat. Comput."},{"issue":"2046","key":"1103_CR16","doi-asserted-by":"publisher","first-page":"20140214","DOI":"10.1098\/rsta.2014.0214","volume":"373","author":"D Woods","year":"2015","unstructured":"Woods, D.: Intrinsic universality and the computational power of self-assembly. Philos. Trans. R. Soc. A Math. Phys. Eng. Sci. 373(2046), 20140214 (2015)","journal-title":"Philos. Trans. R. Soc. A Math. Phys. Eng. Sci."},{"issue":"12","key":"1103_CR17","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/2380656.2380675","volume":"55","author":"D Doty","year":"2012","unstructured":"Doty, D.: Theory of algorithmic self-assembly. Commun. ACM 55(12), 78\u201388 (2012)","journal-title":"Commun. ACM"},{"issue":"7748","key":"1103_CR18","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., Hui, J., Zhou, F., Yin, P., Winfree, E.: Diverse and robust molecular algorithms using reprogrammable DNA self-assembly. Nature 567(7748), 366\u2013372 (2019). https:\/\/doi.org\/10.1038\/s41586-019-1014-9","journal-title":"Nature"},{"key":"1103_CR19","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-319-08123-6_12","volume-title":"Unconventional Computation and Natural Computation","author":"D Doty","year":"2014","unstructured":"Doty, D.: Producibility in hierarchical self-assembly. In: Ibarra, O.H., Kari, L., Kopecki, S. (eds.) Unconventional Computation and Natural Computation, pp. 142\u2013154. Springer, Cham (2014)"},{"key":"1103_CR20","doi-asserted-by":"crossref","unstructured":"Schweller, R., Winslow, A., Wylie, T.: Complexities for high-temperature two-handed tile self-assembly. In: Brijder, R., Qian, L. (eds.) DNA Computing and Molecular Programming, pp. 98\u2013109. Springer (2017)","DOI":"10.1007\/978-3-319-66799-7_7"},{"key":"1103_CR21","unstructured":"Caballero, D., Gomez, T., Schweller, R., Wylie, T.: Complexity of verification in self-assembly with prebuilt assemblies. In: Proceedings of the Symposium on Algorithmic Foundations of Dynamic Networks. SAND\u201922, vol. 221, pp. 8\u20131815 (2022)"},{"key":"1103_CR22","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s00453-020-00764-w","volume":"83","author":"AA Cantu","year":"2021","unstructured":"Cantu, A.A., Luchsinger, A., Schweller, R., Wylie, T.: Covert Computation in self-assembled circuits. Algorithmica 83, 531\u2013552 (2021). https:\/\/doi.org\/10.1007\/s00453-020-00764-w","journal-title":"Algorithmica"},{"key":"1103_CR23","first-page":"1","volume-title":"Unconventional Computation and Natural Computation","author":"D Caballero","year":"2021","unstructured":"Caballero, D., Gomez, T., Schweller, R., Wylie, T.: The complexity of multiple handed self-assembly. In: Kostitsyna, I., Orponen, P. (eds.) Unconventional Computation and Natural Computation, pp. 1\u201318. Springer, Cham (2021)"},{"issue":"1","key":"1103_CR24","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s11047-018-9701-2","volume":"18","author":"R Schweller","year":"2019","unstructured":"Schweller, R., Winslow, A., Wylie, T.: Verification in staged tile self-assembly. Nat. Comput. 18(1), 107\u2013117 (2019)","journal-title":"Nat. Comput."},{"key":"1103_CR25","unstructured":"Caballero, D., Gomez, T., Schweller, R., Wylie, T.: Covert computation in staged self-assembly: Verification is pspace-complete. In: Proceedings of the 29th European Symposium on Algorithms. ESA\u201921, pp. 23\u201312318 (2021)"},{"key":"1103_CR26","doi-asserted-by":"publisher","unstructured":"Agarwal, P.K., Aronov, B., Geft, T., Halperin, D.: On two-handed planar assembly partitioning with connectivity constraints. In: Marx, D. (ed.) Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10\u201313, 2021, pp. 1740\u20131756. SIAM (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.105","DOI":"10.1137\/1.9781611976465.105"},{"key":"1103_CR27","doi-asserted-by":"publisher","unstructured":"Caballero, D., Gomez, T., Schweller, R., Wylie, T.: Unique assembly verification in two-handed self-assembly. In: Boja\u0144czyk, M., Merelli, E., Woodruff, D.P. (eds.) 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022). ICALP\u201922, vol. 229, pp. 34\u201313421. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.34.https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2022\/16375","DOI":"10.4230\/LIPIcs.ICALP.2022.34."},{"issue":"3","key":"1103_CR28","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/0405033","volume":"5","author":"DE Knuth","year":"1992","unstructured":"Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM J. Discrete Math. 5(3), 422\u2013427 (1992). https:\/\/doi.org\/10.1137\/0405033","journal-title":"SIAM J. Discrete Math."},{"key":"1103_CR29","doi-asserted-by":"crossref","unstructured":"Rothemund, P.W., Winfree, E.: The program-size complexity of self-assembled squares. In: Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing, pp. 459\u2013468 (2000)","DOI":"10.1145\/335305.335358"},{"key":"1103_CR30","doi-asserted-by":"publisher","first-page":"3521","DOI":"10.1109\/LRA.2018.2853758","volume":"3","author":"A Schmidt","year":"2018","unstructured":"Schmidt, A., Manzoor, S., Huang, L., Becker, A., Fekete, S.P.: Efficient parallel self-assembly under uniform control inputs. Robot. Autom. Lett. 3, 3521\u20133528 (2018)","journal-title":"Robot. Autom. Lett."},{"key":"1103_CR31","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.tcs.2016.11.020","volume":"671","author":"ED Demaine","year":"2017","unstructured":"Demaine, E.D., Fekete, S.P., Scheffer, C., Schmidt, A.: New geometric algorithms for fully connected staged self-assembly. Theoret. Comput. Sci. 671, 4\u201318 (2017)","journal-title":"Theoret. Comput. Sci."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01103-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-023-01103-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-023-01103-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,7]],"date-time":"2023-08-07T12:04:39Z","timestamp":1691409879000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-023-01103-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,17]]},"references-count":31,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2023,8]]}},"alternative-id":["1103"],"URL":"https:\/\/doi.org\/10.1007\/s00453-023-01103-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,17]]},"assertion":[{"value":"7 December 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"To the best of our knowledge, we have no conflicts of interest related to the research. For publishing, Robert Schweller currently serves as an editor for the Algorithmica journal. For funding, Robert Schweller and Tim Wylie are PIs and received funding from the National Science Foundation (Grant CCF-1817602).","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}