{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T02:18:33Z","timestamp":1774059513213,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T00:00:00Z","timestamp":1765324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T00:00:00Z","timestamp":1765324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-20-CE48-0006"],"award-info":[{"award-number":["ANR-20-CE48-0006"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s00446-025-00493-9","type":"journal-article","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T07:27:38Z","timestamp":1765351658000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic self-stabilising leader election for programmable matter with constant memory"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2988-8969","authenticated-orcid":false,"given":"J\u00e9r\u00e9mie","family":"Chalopin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4008-2445","authenticated-orcid":false,"given":"Shantanu","family":"Das","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-8892-3494","authenticated-orcid":false,"given":"Maria","family":"Kokkou","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,10]]},"reference":[{"issue":"4","key":"493_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-007-0040-2","volume":"20","author":"D Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., et al.: The computational power of population protocols. Distributed Comput 20(4), 279\u2013304 (2007). https:\/\/doi.org\/10.1007\/s00446-007-0040-2","journal-title":"Distributed Comput"},{"key":"493_CR2","doi-asserted-by":"publisher","unstructured":"Awerbuch, B., Ostrovsky, R.: Memory-efficient and self-stabilizing network reset. In: PODC 1994. ACM, pp. 254\u2013263 (1994). https:\/\/doi.org\/10.1145\/197917.198104","DOI":"10.1145\/197917.198104"},{"key":"493_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-030-34992-9_3","volume-title":"SSS 2019, Lecture Notes in Comput. Sci.","author":"RA Bazzi","year":"2019","unstructured":"Bazzi, R.A., Briones, J.L.: Stationary and deterministic leader election in self-organizing particle systems. In: SSS 2019, Lecture Notes in Comput. Sci., vol. 11914, pp. 22\u201337. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-34992-9_3"},{"issue":"2","key":"493_CR4","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s00446-017-0294-2","volume":"31","author":"L Blin","year":"2018","unstructured":"Blin, L., Tixeuil, S.: Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative. Distributed Comput 31(2), 139\u2013166 (2018). https:\/\/doi.org\/10.1007\/s00446-017-0294-2","journal-title":"Distributed Comput"},{"key":"493_CR5","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-11764-5_2","volume-title":"SSS 2014, Lecture Notes in Comput. Sci.","author":"L Blin","year":"2014","unstructured":"Blin, L., Fraigniaud, P., Patt-Shamir, B.: On proof-labeling schemes versus silent self-stabilizing algorithms. In: SSS 2014, Lecture Notes in Comput. Sci., vol. 8756, pp. 18\u201332. Springer (2014). https:\/\/doi.org\/10.1007\/978-3-319-11764-5_2"},{"key":"493_CR6","doi-asserted-by":"publisher","unstructured":"Blin, L., Feuilloley, L., Le Bouder, G.: Optimal space lower bound for deterministic self-stabilizing leader election algorithms. Discret. Math. Theor. Comput .Sci 25 (2023). https:\/\/doi.org\/10.46298\/dmtcs.9335","DOI":"10.46298\/dmtcs.9335"},{"key":"493_CR7","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/s004460100062","volume":"15","author":"P Boldi","year":"2002","unstructured":"Boldi, P., Vigna, S.: Universal dynamic synchronous self-stabilization. Distributed Comput 15, 137\u2013153 (2002). https:\/\/doi.org\/10.1007\/s004460100062","journal-title":"Distributed Comput"},{"key":"493_CR8","doi-asserted-by":"publisher","unstructured":"Briones, J.L., Chhabra, T., Daymude, J.J., et\u00a0al.: Invited paper: Asynchronous deterministic leader election in three-dimensional programmable matter. In: ICDCN 2023. ACM, pp 38\u201347 (2023) https:\/\/doi.org\/10.1145\/3571306.3571389","DOI":"10.1145\/3571306.3571389"},{"issue":"3","key":"493_CR9","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s00224-011-9313-z","volume":"50","author":"S Cai","year":"2012","unstructured":"Cai, S., Izumi, T., Wada, K.: How to prove impossibility under global fairness: On space complexity of self-stabilizing leader election on a population protocol model. Theory Comput. Syst 50(3), 433\u2013445 (2012). https:\/\/doi.org\/10.1007\/s00224-011-9313-z","journal-title":"Theory Comput. Syst"},{"key":"493_CR10","first-page":"174","volume-title":"SIROCCO 2024, Lecture Notes in Comput. Sci.","author":"J Chalopin","year":"2024","unstructured":"Chalopin, J., Das, S., Kokkou, M.: Deterministic leader election for stationary programmable matter with common direction. In: SIROCCO 2024, Lecture Notes in Comput. Sci., vol. 14662, pp. 174\u2013191. Springer (2024a)"},{"key":"493_CR11","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.4230\/LIPIcs.DISC.2024.13","volume-title":"DISC 2024, LIPIcs Leibniz Int. Proc. Inform.","author":"J Chalopin","year":"2024","unstructured":"Chalopin, J., Das, S., Kokkou, M.: Deterministic self-stabilising leader election for programmable matter with constant memory. In: DISC 2024, LIPIcs Leibniz Int. Proc. Inform., vol. 319, p. 13:1-13:17. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2024b). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2024.13"},{"issue":"40","key":"493_CR12","doi-asserted-by":"publisher","first-page":"5541","DOI":"10.1016\/j.tcs.2010.05.001","volume":"412","author":"AK Datta","year":"2011","unstructured":"Datta, A.K., Larmore, L.L., Vemula, P.: Self-stabilizing leader election in optimal space under an arbitrary scheduler. Theoretical Computer Science 412(40), 5541\u20135561 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.05.001","journal-title":"Theoretical Computer Science"},{"key":"493_CR13","doi-asserted-by":"publisher","unstructured":"Daymude, J.J., Richa, AW., Weber, JW.: Bio-inspired energy distribution for programmable matter. In: ICDCN 2021. ACM, pp 86\u201395 (2021) https:\/\/doi.org\/10.1145\/3427796.3427835","DOI":"10.1145\/3427796.3427835"},{"issue":"2","key":"493_CR14","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/s00446-023-00443-3","volume":"36","author":"JJ Daymude","year":"2023","unstructured":"Daymude, J.J., Richa, A.W., Scheideler, C.: The canonical amoebot model: algorithms and concurrency control. Distributed Comput 36(2), 159\u2013192 (2023). https:\/\/doi.org\/10.1007\/s00446-023-00443-3","journal-title":"Distributed Comput"},{"key":"493_CR15","doi-asserted-by":"publisher","unstructured":"Derakhshandeh, Z., Dolev, S., Gmyr, R., et\u00a0al.: Amoebot \u2013 A new model for programmable matter. In: SPAA 2014. ACM, pp 220\u2013222 (2014) https:\/\/doi.org\/10.1145\/2612669.2612712","DOI":"10.1145\/2612669.2612712"},{"key":"493_CR16","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-21999-8_8","volume-title":"DNA 2015, Lecture Notes in Comput. Sci.","author":"Z Derakhshandeh","year":"2015","unstructured":"Derakhshandeh, Z., Gmyr, R., Strothmann, T., et al.: Leader election and shape formation with self-organizing programmable matter. In: DNA 2015, Lecture Notes in Comput. Sci., vol. 9211, pp. 117\u2013132. Springer (2015). https:\/\/doi.org\/10.1007\/978-3-319-21999-8_8"},{"issue":"1","key":"493_CR17","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00446-019-00350-6","volume":"33","author":"GA Di Luna","year":"2020","unstructured":"Di Luna, G.A., Flocchini, P., Santoro, N., et al.: Shape formation by programmable particles. Distributed Comput. 33(1), 69\u2013101 (2020). https:\/\/doi.org\/10.1007\/s00446-019-00350-6","journal-title":"Distributed Comput."},{"issue":"11","key":"493_CR18","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"EW Dijkstra","year":"1974","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643\u2013644 (1974). https:\/\/doi.org\/10.1145\/361179.361202","journal-title":"Commun. ACM"},{"key":"493_CR19","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press (2000). https:\/\/doi.org\/10.7551\/mitpress\/6156.001.0001"},{"issue":"6","key":"493_CR20","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s002360050180","volume":"36","author":"S Dolev","year":"1999","unstructured":"Dolev, S., Gouda, M.G., Schneider, M.: Memory requirements for silent stabilization. Acta Informatica 36(6), 447\u2013462 (1999). https:\/\/doi.org\/10.1007\/s002360050180","journal-title":"Acta Informatica"},{"key":"493_CR21","doi-asserted-by":"publisher","unstructured":"Dubois, S., Tixeuil, S.: A taxonomy of daemons in self-stabilization. arXiv preprint (2011) https:\/\/doi.org\/10.48550\/arXiv.1110.0334","DOI":"10.48550\/arXiv.1110.0334"},{"key":"493_CR22","doi-asserted-by":"publisher","unstructured":"Dufoulon, F., Kutten, S., Moses\u00a0Jr. W.K.: Efficient deterministic leader election for programmable matter. In: PODC 2021. ACM, pp 103\u2013113 (2021) https:\/\/doi.org\/10.1145\/3465084.3467900","DOI":"10.1145\/3465084.3467900"},{"key":"493_CR23","doi-asserted-by":"publisher","first-page":"140:1","DOI":"10.4230\/LIPIcs.ICALP.2019.140","volume-title":"ICALP 2019, LIPIcs Leibniz Int. Proc. Inform.","author":"Y Emek","year":"2019","unstructured":"Emek, Y., Kutten, S., Lavi, R., et al.: Deterministic leader election in programmable matter. In: ICALP 2019, LIPIcs Leibniz Int. Proc. Inform., vol. 132, p. 140:1-140:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2019). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2019.140"},{"issue":"1","key":"493_CR24","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s00453-020-00761-z","volume":"83","author":"SP Fekete","year":"2021","unstructured":"Fekete, S.P., Gmyr, R., Hugo, S., et al.: Cadbots: algorithmic aspects of manipulating programmable matter with finite automata. Algorithmica 83(1), 387\u2013412 (2021). https:\/\/doi.org\/10.1007\/s00453-020-00761-z","journal-title":"Algorithmica"},{"key":"493_CR25","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-030-14094-6_11","volume-title":"ALGOSENSORS 2018, Lecture Notes in Comput. Sci.","author":"N Gastineau","year":"2018","unstructured":"Gastineau, N., Abdou, W., Mbarek, N., et al.: Distributed leader election and computation of local identifiers for programmable matter. In: ALGOSENSORS 2018, Lecture Notes in Comput. Sci., vol. 11410, pp. 159\u2013179. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-14094-6_11"},{"key":"493_CR26","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.6067","author":"N Gastineau","year":"2022","unstructured":"Gastineau, N., Abdou, W., Mbarek, N., et al.: Leader election and local identifiers for three-dimensional programmable matter. Concurrency and Computation: Practice and Experience (2022). https:\/\/doi.org\/10.1002\/cpe.6067","journal-title":"Concurrency and Computation: Practice and Experience"},{"key":"493_CR27","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-45438-1_8","volume-title":"WSS 2001, Lecture Notes in Comput. Sci.","author":"MG Gouda","year":"2001","unstructured":"Gouda, M.G.: The theory of weak stabilization. In: WSS 2001, Lecture Notes in Comput. Sci., vol. 2194, pp. 114\u2013123. Springer (2001). https:\/\/doi.org\/10.1007\/3-540-45438-1_8"},{"issue":"28","key":"493_CR28","doi-asserted-by":"publisher","first-page":"12441","DOI":"10.1073\/pnas.0914069107","volume":"107","author":"E Hawkes","year":"2010","unstructured":"Hawkes, E., An, B., Benbernou, N.M., et al.: Programmable matter by folding. Proceedings of the National Academy of Sciences 107(28), 12441\u201312445 (2010). https:\/\/doi.org\/10.1073\/pnas.0914069107","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"493_CR29","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1109\/SFCS.1994.365691","volume-title":"FOCS 1994. IEEE Computer Society","author":"G Itkis","year":"1994","unstructured":"Itkis, G., Levin, L.: Fast and lean self-stabilizing asynchronous protocols. In: FOCS 1994. IEEE Computer Society, pp. 226\u2013239. IEEE (1994). https:\/\/doi.org\/10.1109\/SFCS.1994.365691"},{"key":"493_CR30","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/BFb0022154","volume-title":"WDAG 1995, Lecture Notes in Comput. Sci.","author":"G Itkis","year":"1995","unstructured":"Itkis, G., Lin, C., Simon, J.: Deterministic, constant space, self-stabilizing leader election on uniform rings. In: WDAG 1995, Lecture Notes in Comput. Sci., vol. 972, pp. 288\u2013302. Springer (1995). https:\/\/doi.org\/10.1007\/BFb0022154"},{"issue":"4","key":"493_CR31","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/s00446-010-0095-3","volume":"22","author":"A Korman","year":"2010","unstructured":"Korman, A., Kutten, S., Peleg, D.: Proof labeling schemes. Distributed Comput. 22(4), 215\u2013233 (2010). https:\/\/doi.org\/10.1007\/s00446-010-0095-3","journal-title":"Distributed Comput."},{"key":"493_CR32","unstructured":"Le\u00a0Lann, G.: Distributed systems - towards a formal approach. In: IFIP 1977. North-Holland, pp 155\u2013160 (1977) https:\/\/inria.hal.science\/hal-03504338"},{"key":"493_CR33","doi-asserted-by":"publisher","DOI":"10.5555\/1102024","volume-title":"Theory of Self-Reproducing Automata.","author":"J Von Neumann","year":"1966","unstructured":"Von Neumann, J.: Theory of Self-Reproducing Automata. University of Illinois Press (1966). https:\/\/doi.org\/10.5555\/1102024"},{"issue":"2","key":"493_CR34","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0167-2789(91)90296-L","volume":"5","author":"T Toffoli","year":"1993","unstructured":"Toffoli, T., Margolus, N.: Programmable matter: Concepts and realization. Int. J. High Speed Comput. 5(2), 155\u2013170 (1993). https:\/\/doi.org\/10.1016\/0167-2789(91)90296-L","journal-title":"Int. J. High Speed Comput."},{"key":"493_CR35","doi-asserted-by":"publisher","unstructured":"Woods, D., Chen, H., Goodfriend, S., et\u00a0al.: Active self-assembly of algorithmic shapes and patterns in polylogarithmic time. In: ITCS 2013. ACM, pp 353\u2013354 (2013) https:\/\/doi.org\/10.1145\/2422436.2422476","DOI":"10.1145\/2422436.2422476"},{"key":"493_CR36","doi-asserted-by":"publisher","unstructured":"Yamashita, M., Kameda, T.: Computing on an anonymous network. In: PODC 1988. ACM, pp 117\u2013130 (1988) https:\/\/doi.org\/10.1145\/62546.62568","DOI":"10.1145\/62546.62568"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-025-00493-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-025-00493-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-025-00493-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T01:45:51Z","timestamp":1774057551000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-025-00493-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,10]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["493"],"URL":"https:\/\/doi.org\/10.1007\/s00446-025-00493-9","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,10]]},"assertion":[{"value":"14 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2025","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 have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"1"}}