{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,11]],"date-time":"2026-05-11T10:41:30Z","timestamp":1778496090261,"version":"3.51.4"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031210167","type":"print"},{"value":"9783031210174","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21017-4_2","type":"book-chapter","created":{"date-parts":[[2022,11,8]],"date-time":"2022-11-08T18:06:34Z","timestamp":1667930794000},"page":"19-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Invited Paper: One Bit Agent Memory is Enough for Snap-Stabilizing Perpetual Exploration of Cactus Graphs with Distinguishable Cycles"],"prefix":"10.1007","author":[{"given":"Kohei","family":"Shimoyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4442-1750","authenticated-orcid":false,"given":"Yuichi","family":"Sudo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1087-410X","authenticated-orcid":false,"given":"Hirotsugu","family":"Kakugawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4628-6393","authenticated-orcid":false,"given":"Toshimitsu","family":"Masuzawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,9]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Altisen, K., Devismes, S., Dubois, S., Petit, F.: Introduction to Distributed Self-Stabilizing Algorithms. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2019)","DOI":"10.1007\/978-3-031-02013-1"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Amb\u00fchl, C., Gasieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. ACM Trans. Algorithms 7(2), 17:1\u201317:21 (2011)","DOI":"10.1145\/1921659.1921663"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1142\/S0129054107004826","volume":"18","author":"H Becha","year":"2007","unstructured":"Becha, H., Flocchini, P.: Optimal construction of sense of direction in a torus by a mobile agent. Int. J. Found. Comput. Sci. 18(3), 529\u2013546 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bui, A., Datta, A.K., Petit, F., Villain, V.: State-optimal snap-stabilizing PIF in tree networks. In: Proceedings of ICDCS Workshop on Self-stabilizing Systems, pp. 78\u201385 (1999)","DOI":"10.1109\/SLFSTB.1999.777490"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. ACM Trans. Algorithms 4(4), 42:1\u201342:18 (2008)","DOI":"10.1145\/1383369.1383373"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.tcs.2012.01.035","volume":"444","author":"J Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., et al.: More efficient periodic traversal in anonymous undirected graphs. Theor. Comput. Sci. 444, 60\u201376 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Das, S.: Graph explorations with mobile agents. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities, Current Research in Moving and Computing. LNCS, vol. 11340, pp. 403\u2013422. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_16","DOI":"10.1007\/978-3-030-11072-7_16"},{"issue":"11","key":"2_CR8","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)","journal-title":"Commun. ACM"},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.jalgor.2003.10.002","volume":"51","author":"K Diks","year":"2004","unstructured":"Diks, K., Fraigniaud, P., Kranakis, E., Pelc, A.: Tree exploration with little memory. J. Algorithms 51(1), 38\u201363 (2004)","journal-title":"J. Algorithms"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Disser, Y., Hackfeld, J., Klimm, M.: Tight bounds for undirected graph exploration with pebbles and multiple agents. J. ACM 66(6), 40:1\u201340:41 (2019)","DOI":"10.1145\/3356883"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/11429647_12","volume-title":"Structural Information and Communication Complexity","author":"S Dobrev","year":"2005","unstructured":"Dobrev, S., Jansson, J., Sadakane, K., Sung, W.-K.: Finding short right-hand-on-the-wall walks in graphs. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol. 3499, pp. 127\u2013139. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11429647_12"},{"key":"2_CR12","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, Cambridge (2000)"},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1002\/net.20240","volume":"52","author":"P Flocchini","year":"2008","unstructured":"Flocchini, P., Huang, M.J., Luccio, F.L.: Decontamination of hypercubes by mobile agents. Networks 52(3), 167\u2013178 (2008)","journal-title":"Networks"},{"key":"2_CR14","doi-asserted-by":"publisher","unstructured":"Flocchini, P., Prencipe, G., Santoro, N. (eds.): Distributed Computing by Mobile Entities, Current Research in Moving and Computing. LNCS, vol. 11340. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7","DOI":"10.1007\/978-3-030-11072-7"},{"issue":"2\u20133","key":"2_CR15","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.tcs.2005.07.014","volume":"345","author":"P Fraigniaud","year":"2005","unstructured":"Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. Theor. Comput. Sci. 345(2\u20133), 331\u2013344 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/11429647_13","volume-title":"Structural Information and Communication Complexity","author":"P Fraigniaud","year":"2005","unstructured":"Fraigniaud, P., Ilcinkas, D., Rajsbaum, S., Tixeuil, S.: Space lower bounds for graph exploration via reduced automata. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol. 3499, pp. 140\u2013154. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11429647_13"},{"issue":"5","key":"2_CR17","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1016\/j.jcss.2007.09.004","volume":"74","author":"L Gasieniec","year":"2008","unstructured":"Gasieniec, L., Klasing, R., Martin, R.A., Navarra, A., Zhang, X.: Fast periodic graph exploration with constant memory. J. Comput. Syst. Sci. 74(5), 808\u2013822 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20133","key":"2_CR18","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2008.03.035","volume":"401","author":"D Ilcinkas","year":"2008","unstructured":"Ilcinkas, D.: Setting port numbers for fast graph exploration. Theor. Comput. Sci. 401(1\u20133), 236\u2013242 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Ilcinkas, D.: Oblivious robots on graphs: exploration. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities, Current Research in Moving and Computing. LNCS, vol. 11340, pp. 218\u2013233. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_9","DOI":"10.1007\/978-3-030-11072-7_9"},{"issue":"1\u20132","key":"2_CR20","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/s00453-011-9518-1","volume":"63","author":"A Kosowski","year":"2012","unstructured":"Kosowski, A., Navarra, A.: Graph decomposition for memoryless periodic exploration. Algorithmica 63(1\u20132), 26\u201338 (2012)","journal-title":"Algorithmica"},{"issue":"14\u201315","key":"2_CR21","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1016\/j.tcs.2010.01.006","volume":"411","author":"T Masuzawa","year":"2010","unstructured":"Masuzawa, T., Tixeuil, S.: Quiescence of self-stabilizing gossiping among mobile agents in graphs. Theor. Comput. Sci. 411(14\u201315), 1567\u20131582 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ipl.2017.06.010","volume":"127","author":"A Menc","year":"2017","unstructured":"Menc, A., Pajak, D., Uznanski, P.: Time and space optimality of rotor-router graph exploration. Inf. Process. Lett. 127, 17\u201320 (2017)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"2_CR23","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1006\/jagm.1999.1043","volume":"33","author":"P Panaite","year":"1999","unstructured":"Panaite, P., Pelc, A.: Exploring unknown undirected graphs. J. Algorithms 33(2), 281\u2013295 (1999)","journal-title":"J. Algorithms"},{"key":"2_CR24","doi-asserted-by":"publisher","first-page":"5079","DOI":"10.1103\/PhysRevLett.77.5079","volume":"77","author":"VB Priezzhev","year":"1996","unstructured":"Priezzhev, V.B., Dhar, D., Dhar, A., Krishnamurthy, S.: Eulerian walkers as a model of self-organized criticality. Phys. Rev. Lett. 77, 5079\u20135082 (1996)","journal-title":"Phys. Rev. Lett."},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 17:1\u201317:24 (2008)","DOI":"10.1145\/1391289.1391291"},{"issue":"3","key":"2_CR26","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00453-003-1030-9","volume":"37","author":"V Yanovski","year":"2003","unstructured":"Yanovski, V., Wagner, I.A., Bruckstein, A.M.: A distributed ant algorithm for efficiently patrolling a network. Algorithmica 37(3), 165\u2013186 (2003)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21017-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,7]],"date-time":"2024-10-07T18:39:30Z","timestamp":1728326370000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21017-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031210167","9783031210174"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21017-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"9 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sss2022.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}