{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T22:26:44Z","timestamp":1769812004149,"version":"3.49.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032156402","type":"print"},{"value":"9783032156419","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-15641-9_22","type":"book-chapter","created":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T11:37:07Z","timestamp":1769773027000},"page":"323-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reachability in\u00a0Interactive Chemical Reaction Networks"],"prefix":"10.1007","author":[{"given":"Aberto","family":"Avila-Jimenez","sequence":"first","affiliation":[]},{"given":"Bin","family":"Fu","sequence":"additional","affiliation":[]},{"given":"Elise","family":"Grizzell","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Schweller","sequence":"additional","affiliation":[]},{"given":"Tim","family":"Wylie","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,31]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Alaniz, R.M., Fu, B., Gomez, T., Grizzell, E., Rodriguez, A., Schweller, R., Wylie, T.: Reachability in restricted chemical reaction networks (2022)","DOI":"10.2139\/ssrn.4665761"},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Anderson, R., Avila, A., Fu, B., et\u00a0al.: Computing threshold circuits with void reactions in step chemical reaction networks. In: Formenti, E., Durand-Lose, J. (eds.) Machines, Computations, and Universality. MCU 2024. LNCS, vol. 15270, pp. 52\u201371. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-81202-6_4","DOI":"10.1007\/978-3-031-81202-6_4"},{"key":"22_CR3","doi-asserted-by":"publisher","unstructured":"Anderson, R., Fu, B., Massie, A., et\u00a0al.: Computing threshold circuits with bimolecular void reactions in step chemical reaction networks. In: Cho, DJ., Kim, J. (eds.) Unconventional Computation and Natural Computation. UCNC 2024. LNCS, vol. 14776, pp. 253\u2013268. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-63742-1_18","DOI":"10.1007\/978-3-031-63742-1_18"},{"key":"22_CR4","doi-asserted-by":"publisher","unstructured":"Aris, R.: Prolegomena to the rational analysis of systems of chemical reactions. Arch. Ration. Mech. Anal. 19(2), 81\u201399 (1965). https:\/\/doi.org\/10.1007\/BF00282276","DOI":"10.1007\/BF00282276"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"1383","DOI":"10.1007\/s00453-017-0318-0","volume":"80","author":"C Chalk","year":"2018","unstructured":"Chalk, C., Martinez, E., Schweller, R., Vega, L., Winslow, A., Wylie, T.: Optimal staged self-assembly of general shapes. Algorithmica 80, 1383\u20131409 (2018)","journal-title":"Algorithmica"},{"key":"22_CR6","doi-asserted-by":"publisher","unstructured":"Cirlos, S.C., Gomez, T., Grizzell, E., Rodriguez, A., Schweller, R., Wylie, T.: Simulation of multiple stages in single bin active tile self-assembly. In: Genova, D., Kari, J. (eds.) Unconventional Computation and Natural Computation. UCNC 2023. LNCS, vol. 14003, pp. 155\u2013170. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-34034-5_11","DOI":"10.1007\/978-3-031-34034-5_11"},{"issue":"2","key":"22_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s11047-012-9359-0","volume":"12","author":"ED Demaine","year":"2013","unstructured":"Demaine, E.D., Eisenstat, S., Ishaque, M., Winslow, A.: One-dimensional staged self-assembly. Nat. Comput. 12(2), 247\u2013258 (2013)","journal-title":"Nat. Comput."},{"key":"22_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.biosystems.2019.103983","volume":"186","author":"SJ Ellis","year":"2019","unstructured":"Ellis, S.J., Klinge, T.H., Lathrop, J.I.: Robust chemical circuits. Biosystems 186, 103983 (2019)","journal-title":"Biosystems"},{"key":"22_CR9","unstructured":"Fu, B., Gomez, T., Knobel, R., et\u00a0al.: Brief announcement: reachability in deletion-only chemical reaction networks. In: Proceedings of the Symposium on Algorithmic Foundations of Dynamic Networks. SAND (2025)"},{"key":"22_CR10","unstructured":"Hearn, R.A.: Games, Puzzles, and Computation. Ph.D. thesis, Massachusetts Institute of Technology (May 2006)"},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Hesse, W., Allender, E., Mix Barrington, D.A.: Uniform constant-depth threshold circuits for division and iterated multiplication. J. Comput. Syst. Sci. 65(4), 695\u2013716 (2002). https:\/\/doi.org\/10.1016\/S0022-0000(02)00025-9, special Issue on Complexity 2001","DOI":"10.1016\/S0022-0000(02)00025-9"},{"issue":"2","key":"22_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147\u2013195 (1969). https:\/\/doi.org\/10.1016\/S0022-0000(69)80011-5","journal-title":"J. Comput. Syst. Sci."},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-319-01928-4_11","volume-title":"DNA Computing and Molecular Programming","author":"D Mo","year":"2013","unstructured":"Mo, D., Stefanovic, D.: Iterative Self-assembly with dynamic strength transformation and temperature control. In: Soloveichik, D., Yurke, B. (eds.) DNA 2013. LNCS, vol. 8141, pp. 147\u2013159. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-319-01928-4_11"},{"key":"22_CR14","unstructured":"Petri, C.A.: Communication with automata (1966)"},{"issue":"5","key":"22_CR15","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1137\/0221053","volume":"21","author":"JH Reif","year":"1992","unstructured":"Reif, J.H., Tate, S.R.: On threshold circuits and polynomial computation. SIAM J. Comput. 21(5), 896\u2013908 (1992). https:\/\/doi.org\/10.1137\/0221053","journal-title":"SIAM J. Comput."},{"issue":"4","key":"22_CR16","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1145\/146585.146609","volume":"39","author":"A Shamir","year":"1992","unstructured":"Shamir, A.: IP = PSPACE. J. ACM 39(4), 869\u2013877 (1992). https:\/\/doi.org\/10.1145\/146585.146609","journal-title":"J. ACM"},{"issue":"4","key":"22_CR17","doi-asserted-by":"publisher","first-page":"878","DOI":"10.1145\/146585.146613","volume":"39","author":"A Shen","year":"1992","unstructured":"Shen, A.: IP = PSPACE: simplified proof. J. ACM 39(4), 878\u2013880 (1992). https:\/\/doi.org\/10.1145\/146585.146613","journal-title":"J. ACM"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-030-26807-7_1","volume-title":"DNA Computing and Molecular Programming","author":"E Winfree","year":"2019","unstructured":"Winfree, E.: Chemical reaction networks and stochastic local search. In: Thachuk, C., Liu, Y. (eds.) DNA 2019. LNCS, vol. 11648, pp. 1\u201320. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26807-7_1"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-15641-9_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T11:37:09Z","timestamp":1769773029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-15641-9_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032156402","9783032156419"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-15641-9_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"31 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UCNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Unconventional Computation and Natural Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/webusers.i3s.univ-cotedazur.fr\/UCNC2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}