{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:44:17Z","timestamp":1782927857270,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":57,"publisher":"ACM","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"German Research Foundation (DFG)","award":["511099228"],"award-info":[{"award-number":["511099228"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,7,6]]},"DOI":"10.1145\/3796701.3815960","type":"proceedings-article","created":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:40:43Z","timestamp":1782924043000},"page":"527-538","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Network-Agnostic Multidimensional Approximate Agreement with Optimal Resilience"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5294-9459","authenticated-orcid":false,"given":"Diana","family":"Ghinea","sequence":"first","affiliation":[{"name":"Lucerne University of Applied Sciences and Arts, Rotkreuz, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5614-8563","authenticated-orcid":false,"given":"Darya","family":"Melnyk","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8014-2600","authenticated-orcid":false,"given":"Tijana","family":"Milentijevi\u0107","sequence":"additional","affiliation":[{"name":"TU Berlin, Berlin, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,7]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Principles of Distributed Systems","author":"Abraham Ittai","unstructured":"Ittai Abraham, Yonatan Amit, and Danny Dolev. 2005. Optimal Resilience Asynchronous Approximate Agreement. In Principles of Distributed Systems. Springer Berlin Heidelberg, Berlin, Heidelberg, 229\u2013239."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467914"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0345-3"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22963-3_23"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-79527-6_6"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538417"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2022.6"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2025.46"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2023.6"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN58291.2024.00051"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS60910.2024.00026"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 24th International Conference on Distributed Computing","author":"Ben-Or Michael","unstructured":"Michael Ben-Or, Danny Dolev, and Ezra N. Hoch. 2010. Brief Anouncement: Simple Gradecast Based Algorithms. In Proceedings of the 24th International Conference on Distributed Computing (Cambridge, MA) (DISC'10). Springer-Verlag, Berlin, Heidelberg, 194\u2013197."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/197917.198088"},{"key":"e_1_3_2_1_14_1","volume-title":"Theory of Cryptography","author":"Blum Erica","unstructured":"Erica Blum, Jonathan Katz, and Julian Loss. 2019. Synchronous Consensus with Optimal Asynchronous Fallback Guarantees. In Theory of Cryptography. Springer International Publishing, Cham, 131\u2013150."},{"key":"e_1_3_2_1_15_1","volume-title":"Advances in Cryptology - CRYPTO","author":"Blum Erica","year":"2020","unstructured":"Erica Blum, Chen-Da Liu-Zhang, and Julian Loss. 2020. Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback. In Advances in Cryptology - CRYPTO 2020. Springer International Publishing, Cham, 707\u2013731."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90054-X"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-032-11127-2_10"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3694906.3743343"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167105"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.9732"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2025.24"},{"key":"e_1_3_2_1_22_1","unstructured":"Andrei Constantinescu Diana Ghinea Roger Wattenhofer and Floris Westermann. 2023. Convex Consensus with Asynchronous Fallback. Cryptology ePrint Archive Paper 2023\/1364. https:\/\/eprint.iacr.org\/2023\/1364"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2024.15"},{"key":"e_1_3_2_1_24_1","volume-title":"Theory of Cryptography","author":"Deligios Giovanni","unstructured":"Giovanni Deligios, Martin Hirt, and Chen-Da Liu-Zhang. 2021. Round-Efficient Byzantine Agreement and Multi-party Computation with Asynchronous Fallback. In Theory of Cryptography. Springer International Publishing, Cham, 623\u2013653."},{"key":"e_1_3_2_1_25_1","volume-title":"Advances in Cryptology - EUROCRYPT","author":"Deligios Giovanni","year":"2024","unstructured":"Giovanni Deligios and Mose Mizrahi Erbes. 2024. Closing the Efficiency Gap Between Synchronous and Network-Agnostic Consensus. In Advances in Cryptology - EUROCRYPT 2024. Springer Nature Switzerland, Cham, 432\u2013461."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90004-9"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5931"},{"key":"e_1_3_2_1_28_1","unstructured":"Maya Dotan Gilad Stern and Aviv Zohar. 2022. Validated Byzantine Asynchronous Multidimensional Approximate Agreement. arXiv:2211.02126 [cs.DC] https:\/\/arxiv.org\/abs\/2211.02126"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/3540261.3542179"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405695"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/10590.10597"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41846"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62225"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467907"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3732772.3733555"},{"key":"e_1_3_2_1_37_1","unstructured":"Marc Fuchs Diana Ghinea Zahra Parsaeian and Joel Rybicki. 2026. Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs. arXiv:2502.05591 [cs.DC] https:\/\/arxiv.org\/abs\/2502.05591"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2018.27"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485242"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06944-4_4"},{"key":"e_1_3_2_1_41_1","unstructured":"Diana Ghinea and Chen-Da Liu-Zhang. 2025. SoK: Approximate Agreement. Cryptology ePrint Archive Paper 2025\/2339. https:\/\/eprint.iacr.org\/2025\/2339"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538442"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591105"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3732772.3733551"},{"key":"e_1_3_2_1_45_1","unstructured":"Diana Ghinea Darya Melnyk and Tijana Milentijevi\u0107. 2026. Network-Agnostic Multidimensional Approximate Agreement with Optimal Resilience. Cryptology ePrint Archive Paper 2026\/287. https:\/\/eprint.iacr.org\/2026\/287"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3465084.3467946"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538444"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2022.22"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488657"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0240-5"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","unstructured":"Mose Mizrahi Erbes and Roger Wattenhofer. 2026. Asynchronous Approximate Agreement with Quadratic Communication. 16:1\u201316:26 pages. doi:10.4230\/LIPIcs.OPODIS.2025.16","DOI":"10.4230\/LIPIcs.OPODIS.2025.16"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.DISC.2019.29"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933105"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484256"},{"key":"e_1_3_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935808"},{"key":"e_1_3_2_1_57_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2016.26"}],"event":{"name":"PODC '26: ACM Symposium on Principles of Distributed Computing","location":"Egham United Kingdom","acronym":"PODC '26","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\/3796701.3815960","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T16:47:09Z","timestamp":1782924429000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3796701.3815960"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":57,"alternative-id":["10.1145\/3796701.3815960","10.1145\/3796701"],"URL":"https:\/\/doi.org\/10.1145\/3796701.3815960","relation":{},"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"2026-07-01","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}