{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:12:44Z","timestamp":1763413964153,"version":"3.45.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111265","type":"print"},{"value":"9783032111272","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"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-11127-2_13","type":"book-chapter","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:48Z","timestamp":1763409828000},"page":"146-152","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: On the\u00a0Impact of\u00a0Unlimited Computational Power in\u00a0$$\\mathcal {OBLOT}$$: Consequences for\u00a0Synchronous Robots on\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Serafino","family":"Cicerone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessia","family":"Di Fonso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Di Stefano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,18]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Babai, L.: Canonical form for graphs in quasipolynomial time: preliminary report. In: Charikar, M., Cohen, E. (eds.) Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, pp. 1237\u20131246. ACM (2019). https:\/\/doi.org\/10.1145\/3313276.3316356","DOI":"10.1145\/3313276.3316356"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Badri, S., Cicerone, S., Di Fonso, A., Di Stefano, G.: An optimal algorithm for geodesic mutual visibility on hexagonal grids. In: Masuzawa, T., Katayama, Y., Kakugawa, H., Nakamura, J., Kim, Y. (eds.) Stabilization, Safety, and Security of Distributed Systems - 26th International Symposium, SSS 2024, Nagoya, Japan, October 20\u201322, 2024, Proceedings. Lecture Notes in Computer Science, vol. 14931, pp. 161\u2013176. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-74498-3_12","DOI":"10.1007\/978-3-031-74498-3_12"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2022.11.021","volume":"942","author":"S Cicerone","year":"2023","unstructured":"Cicerone, S., Di Fonso, A., Di Stefano, G., Navarra, A.: Arbitrary pattern formation on infinite regular tessellation graphs. Theor. Comput. Sci. 942, 1\u201320 (2023). https:\/\/doi.org\/10.1016\/j.tcs.2022.11.021","journal-title":"Theor. Comput. Sci."},{"key":"13_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2023.101842","volume":"95","author":"S Cicerone","year":"2023","unstructured":"Cicerone, S., Di Fonso, A., Di Stefano, G., Navarra, A.: The geodesic mutual visibility problem: oblivious robots on grids and trees. Pervasive Mob. Comput. 95, 101842 (2023). https:\/\/doi.org\/10.1016\/j.pmcj.2023.101842","journal-title":"Pervasive Mob. Comput."},{"key":"13_CR5","unstructured":"Cicerone, S., Di Fonso, A., Di Stefano, G., Navarra, A.: On the impact of unlimited computational power in OBLOT: consequences for synchronous robots on graphs (2025). https:\/\/arxiv.org\/abs\/2509.04383"},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/S00446-018-0325-7","volume":"32","author":"S Cicerone","year":"2019","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Asynchronous arbitrary pattern formation: the effects of a rigorous approach. Distributed Comput. 32(2), 91\u2013132 (2019). https:\/\/doi.org\/10.1007\/S00446-018-0325-7","journal-title":"Distributed Comput."},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/S00446-018-0333-7","volume":"32","author":"S Cicerone","year":"2019","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Embedded pattern formation by asynchronous robots without chirality. Distributed Comput. 32(4), 291\u2013315 (2019). https:\/\/doi.org\/10.1007\/S00446-018-0333-7","journal-title":"Distributed Comput."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2020.10.011","volume":"849","author":"S Cicerone","year":"2021","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Gathering robots in graphs: the central role of synchronicity. Theor. Comput. Sci. 849, 99\u2013120 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2020.10.011","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"13_CR9","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/100796534","volume":"41","author":"M Cieliebak","year":"2012","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41(4), 829\u2013879 (2012)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"13_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00446-014-0212-9","volume":"27","author":"G D\u2019Angelo","year":"2014","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Gathering on rings under the look-compute-move model. Distrib. Comput. 27(4), 255\u2013285 (2014)","journal-title":"Distrib. Comput."},{"issue":"2","key":"13_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s00446-014-0220-9","volume":"28","author":"S Das","year":"2015","unstructured":"Das, S., Flocchini, P., Santoro, N., Yamashita, M.: Forming sequences of geometric patterns with oblivious mobile robots. Distrib. Comput. 28(2), 131\u2013145 (2015)","journal-title":"Distrib. Comput."},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ic.2016.09.005","volume":"254","author":"GA Di Luna","year":"2017","unstructured":"Di Luna, G.A., Flocchini, P., Chaudhuri, S.G., Poloni, F., Santoro, N., Viglietta, G.: Mutual visibility by luminous robots without collisions. Inf. Comput. 254, 392\u2013418 (2017). https:\/\/doi.org\/10.1016\/j.ic.2016.09.005","journal-title":"Inf. Comput."},{"issue":"2","key":"13_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00446-016-0278-7","volume":"30","author":"G Di Stefano","year":"2017","unstructured":"Di Stefano, G., Navarra, A.: Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings. Distrib. Comput. 30(2), 75\u201386 (2017)","journal-title":"Distrib. Comput."},{"key":"13_CR14","doi-asserted-by":"publisher","unstructured":"Flocchini, P., Prencipe, G., Santoro, N. (eds.): Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Lecture Notes in Computer Science, vol. 11340. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7","DOI":"10.1007\/978-3-030-11072-7"},{"key":"13_CR15","unstructured":"Hirvonen, J., Suomela, J.: Distributed Algorithms. Aalto University, Finland (2025). https:\/\/jukkasuomela.fi\/da2020\/da2020.pdf"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"3235","DOI":"10.1016\/j.tcs.2010.05.020","volume":"411","author":"R Klasing","year":"2010","unstructured":"Klasing, R., Kosowski, A., Navarra, A.: Taking advantage of symmetries: gathering of many asynchronous oblivious robots on a ring. Theor. Comput. Sci. 411, 3235\u20133246 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"13_CR17","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial, N.: Locality in distributed graph algorithms. SIAM J. Comput. 21(1), 193\u2013201 (1992). https:\/\/doi.org\/10.1137\/0221015","journal-title":"SIAM J. Comput."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.tcs.2020.10.033","volume":"850","author":"P Poudel","year":"2021","unstructured":"Poudel, P., Aljohani, A., Sharma, G.: Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement. Theor. Comput. Sci. 850, 116\u2013134 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2020.10.033","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"13_CR19","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1137\/S009753979628292X","volume":"28","author":"I Suzuki","year":"1999","unstructured":"Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28(4), 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."},{"issue":"26\u201328","key":"13_CR20","doi-asserted-by":"publisher","first-page":"2433","DOI":"10.1016\/j.tcs.2010.01.037","volume":"411","author":"M Yamashita","year":"2010","unstructured":"Yamashita, M., Suzuki, I.: Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theor. Comput. Sci. 411(26\u201328), 2433\u20132453 (2010)","journal-title":"Theor. Comput. Sci."}],"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-032-11127-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:49Z","timestamp":1763409829000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11127-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,18]]},"ISBN":["9783032111265","9783032111272"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11127-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,18]]},"assertion":[{"value":"18 November 2025","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":"Kathmandu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nepal","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":"9 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}