{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T01:08:31Z","timestamp":1769044111880,"version":"3.49.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T00:00:00Z","timestamp":1768953600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"ECOS-ANID","award":["C19E02"],"award-info":[{"award-number":["C19E02"]}]},{"name":"STIC Amsud","award":["CAMA 22-STIC-02"],"award-info":[{"award-number":["CAMA 22-STIC-02"]}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-18-CE40-0002"],"award-info":[{"award-number":["ANR-18-CE40-0002"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100018694","name":"HORIZON EUROPE Marie Sklodowska-Curie Actions","doi-asserted-by":"publisher","award":["HORIZON-MSCA-2022-SE-01 101131549"],"award-info":[{"award-number":["HORIZON-MSCA-2022-SE-01 101131549"]}],"id":[{"id":"10.13039\/100018694","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]]},"DOI":"10.1007\/s11047-026-10064-x","type":"journal-article","created":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T10:00:51Z","timestamp":1768989651000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the dynamics of bounded-degree automata networks"],"prefix":"10.1007","volume":"25","author":[{"given":"Julio","family":"Aracena","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Bridoux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maximilien","family":"Gadouleau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Guillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K\u00e9vin","family":"Perrot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrien","family":"Richard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guillaume","family":"Theyssier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,21]]},"reference":[{"key":"10064_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511608650","volume-title":"The theory of partitions","author":"GE Andrews","year":"1984","unstructured":"Andrews GE (1984) The theory of partitions. Cambridge University Press"},{"key":"10064_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2023.05.003","volume":"138","author":"F Bridoux","year":"2023","unstructured":"Bridoux F, Perrot K, Marchetto AP, Richard A (2023) Interaction graphs of isomorphic automata networks I: complete digraph and minimum in-degree. J Comput Syst Sci 138:103458","journal-title":"J Comput Syst Sci"},{"key":"10064_CR3","unstructured":"Cort\u00e9s AAZ (2022) Din\u00e1micas hamiltonianas en redes booleanas. Master\u2019s thesis, Universidad de Concepci\u00f3n"},{"key":"10064_CR4","unstructured":"Datta S, Limaye N, Nimbhorkar P, Thierauf T, Wagner F (2010) Planar Graph Isomorphism is in Log-Space. In Manindra Agrawal, Lance Fortnow, Thomas Thierauf, and Christopher Umans, editors, Algebraic Methods in Computational Complexity, volume 9421 of Dagstuhl Seminar Proceedings (DagSemProc), pages 1\u201332, Dagstuhl, Germany. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik"},{"issue":"2","key":"10064_CR5","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/1024041","volume":"24","author":"H Fredricksen","year":"1982","unstructured":"Fredricksen H (1982) A survey of full length nonlinear shift register cycle algorithms. SIAM Rev 24(2):195\u2013221","journal-title":"SIAM Rev"},{"issue":"3","key":"10064_CR6","volume":"25","author":"M Gadouleau","year":"2018","unstructured":"Gadouleau M (2018) On the rank and periodic rank of finite dynamical systems. Electron J Comb 25(3):P3","journal-title":"Electron J Comb"},{"issue":"1","key":"10064_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s11047-019-09732-y","volume":"19","author":"M Gadouleau","year":"2019","unstructured":"Gadouleau M (2019) On the influence of the interaction graph on a finite dynamical system. Nat Comput 19(1):15\u201328","journal-title":"Nat Comput"},{"issue":"5","key":"10064_CR8","doi-asserted-by":"publisher","first-page":"2504","DOI":"10.1109\/TIT.2016.2544344","volume":"62","author":"M Gadouleau","year":"2016","unstructured":"Gadouleau M, Richard A, Fanchon \u00c9 (2016) Reduction and fixed points of boolean networks and linear network coding solvability. IEEE Trans Inf Theory 62(5):2504\u20132519","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"10064_CR9","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0097-3165(71)90029-X","volume":"10","author":"A Lempel","year":"1971","unstructured":"Lempel A (1971) m-ary closed sequences. J Comb Theory Ser A 10(3):253\u2013258","journal-title":"J Comb Theory Ser A"},{"key":"10064_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511525926","volume-title":"Finite fields","author":"R Lidl","year":"1996","unstructured":"Lidl R, Niederreiter H (1996) Finite fields. Cambridge University Press"},{"issue":"4","key":"10064_CR11","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C Savage","year":"1997","unstructured":"Savage C (1997) A survey of combinatorial gray codes. SIAM Rev 39(4):605\u2013629","journal-title":"SIAM Rev"}],"container-title":["Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-026-10064-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11047-026-10064-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11047-026-10064-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T10:00:54Z","timestamp":1768989654000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11047-026-10064-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,21]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["10064"],"URL":"https:\/\/doi.org\/10.1007\/s11047-026-10064-x","relation":{},"ISSN":["1567-7818","1572-9796"],"issn-type":[{"value":"1567-7818","type":"print"},{"value":"1572-9796","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,21]]},"assertion":[{"value":"19 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 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":"6"}}