{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:27:50Z","timestamp":1759638470918,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,21]],"date-time":"2021-07-21T00:00:00Z","timestamp":1626825600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,21]]},"DOI":"10.1145\/3465084.3467946","type":"proceedings-article","created":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T21:09:28Z","timestamp":1627074568000},"page":"427-430","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Brief Announcement: Variants of Approximate Agreement on Graphs and Simplicial Complexes"],"prefix":"10.1145","author":[{"given":"J\u00e9r\u00e9my","family":"Ledent","sequence":"first","affiliation":[{"name":"University of Strathclyde, Glasgow, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2021,7,23]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1090\/proc\/13002"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0345-3"},{"key":"e_1_3_2_2_3_1","unstructured":"Dan Alistarh Faith Ellen and Joel Rybicki. 2021. Wait-free approximate agreement on graphs. (2021). arxiv: cs.DC\/2103.08949  Dan Alistarh Faith Ellen and Joel Rybicki. 2021. Wait-free approximate agreement on graphs. (2021). arxiv: cs.DC\/2103.08949"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00008933"},{"key":"e_1_3_2_2_5_1","article-title":"Convergence and covering on graphs for wait-free robots","volume":"24","author":"Armando Casta","year":"2018","unstructured":"Armando Casta n eda, Sergio Rajsbaum , and Matthieu Roy . 2018 . Convergence and covering on graphs for wait-free robots . J. Braz. Comput. Soc. , Vol. 24 , 1 (2018), 1:1--1:15. https:\/\/doi.org\/10.1186\/s13173-017-0065-8 Armando Casta n eda, Sergio Rajsbaum, and Matthieu Roy. 2018. Convergence and covering on graphs for wait-free robots. J. Braz. Comput. Soc., Vol. 24, 1 (2018), 1:1--1:15. https:\/\/doi.org\/10.1186\/s13173-017-0065-8","journal-title":"J. Braz. Comput. Soc."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5931"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Maurice Herlihy Dmitry N. Kozlov and Sergio Rajsbaum. 2013. Distributed Computing Through Combinatorial Topology. Morgan Kaufmann. https:\/\/store.elsevier.com\/product.jsp?isbn=9780124045781  Maurice Herlihy Dmitry N. Kozlov and Sergio Rajsbaum. 2013. Distributed Computing Through Combinatorial Topology. Morgan Kaufmann. https:\/\/store.elsevier.com\/product.jsp?isbn=9780124045781","DOI":"10.1016\/B978-0-12-404578-1.00003-6"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258652"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167125"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.01.033"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0240-5"},{"key":"e_1_3_2_2_12_1","volume-title":"Byzantine Approximate Agreement on Graphs. In 33rd International Symposium on Distributed Computing, DISC 2019 (LIPIcs),, Jukka Suomela (Ed.)","volume":"146","author":"Nowak Thomas","year":"2019","unstructured":"Thomas Nowak and Joel Rybicki . 2019 . Byzantine Approximate Agreement on Graphs. In 33rd International Symposium on Distributed Computing, DISC 2019 (LIPIcs),, Jukka Suomela (Ed.) , Vol. 146 . Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 29:1--29:17. https:\/\/doi.org\/10.4230\/LIPIcs.DISC. 2019.29 Thomas Nowak and Joel Rybicki. 2019. Byzantine Approximate Agreement on Graphs. In 33rd International Symposium on Distributed Computing, DISC 2019 (LIPIcs),, Jukka Suomela (Ed.), Vol. 146. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 29:1--29:17. https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2019.29"}],"event":{"name":"PODC '21: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Virtual Event Italy","acronym":"PODC '21"},"container-title":["Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467946","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3465084.3467946","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:11Z","timestamp":1750191431000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3465084.3467946"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,21]]},"references-count":12,"alternative-id":["10.1145\/3465084.3467946","10.1145\/3465084"],"URL":"https:\/\/doi.org\/10.1145\/3465084.3467946","relation":{},"subject":[],"published":{"date-parts":[[2021,7,21]]},"assertion":[{"value":"2021-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}