{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T04:06:25Z","timestamp":1749873985556,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,16]]},"DOI":"10.1145\/3732772.3733555","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:23:34Z","timestamp":1749824614000},"page":"54-57","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Towards Round-Optimal Approximate Agreement on Trees"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2272-4483","authenticated-orcid":false,"given":"Marc","family":"Fuchs","sequence":"first","affiliation":[{"name":"University of Freiburg, Freiburg im Breisgau, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5294-9459","authenticated-orcid":false,"given":"Diana","family":"Ghinea","sequence":"additional","affiliation":[{"name":"Lucerne University of Applied Sciences and Arts, Zug, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3848-1796","authenticated-orcid":false,"given":"Zahra","family":"Parsaeian","sequence":"additional","affiliation":[{"name":"University of Freiburg, Freiburg im Breisgau, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN58291.2024.00051"},{"key":"e_1_3_2_1_2_1","volume-title":"Hoch","author":"Ben-Or Michael","year":"2010","unstructured":"Michael Ben-Or, Danny Dolev, and Ezra N. Hoch. 2010. Brief Announcement: Simple Gradecast Based Algorithms. In Distributed Computing, Nancy A. Lynch and Alexander A. Shvartsman (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 194\u2013197."},{"key":"e_1_3_2_1_3_1","volume-title":"Bender and Mart\u00edn Farach-Colton","author":"Michael","year":"2000","unstructured":"Michael A. Bender and Mart\u00edn Farach-Colton. 2000. The LCA Problem Revisited. In LATIN 2000: Theoretical Informatics, Gaston H. Gonnet and Alfredo Viola (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 88\u201394."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5931"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0212045"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/3540261.3542179"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405695"},{"key":"e_1_3_2_1_8_1","unstructured":"Mose Mizrahi Erbes and Roger Wattenhofer. 2024. Asynchronous Approximate Agreement with Quadratic Communication. arXiv:2408.05495 [cs.DC] https:\/\/arxiv.org\/abs\/2408.05495"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01783662"},{"key":"e_1_3_2_1_10_1","unstructured":"Marc Fuchs Diana Ghinea and Zahra Parsaeian. 2025. Towards Round-Optimal Approximate Agreement on Trees. arXiv:2502.05591 [cs.DC] https:\/\/arxiv.org\/abs\/2502.05591"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538442"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538444"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/SRDS.2018.00036"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488657"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0240-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2019.29"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/NBiS.2011.55"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2015.22"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933105"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484256"}],"event":{"name":"PODC '25: ACM Symposium on Principles of Distributed Computing","location":"Hotel Las Brisas Huatulco Huatulco Mexico","acronym":"PODC '25","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3732772.3733555","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T14:25:09Z","timestamp":1749824709000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3732772.3733555"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":21,"alternative-id":["10.1145\/3732772.3733555","10.1145\/3732772"],"URL":"https:\/\/doi.org\/10.1145\/3732772.3733555","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}