{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T12:07:02Z","timestamp":1780920422828,"version":"3.54.1"},"reference-count":42,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T00:00:00Z","timestamp":1779148800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1016\/j.tcs.2026.116044","type":"journal-article","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T23:25:11Z","timestamp":1779319511000},"page":"116044","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Centroid approximation with multidimensional approximate agreement protocols"],"prefix":"10.1016","volume":"1080","author":[{"given":"M\u00e9lanie","family":"Cambus","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5614-8563","authenticated-orcid":false,"given":"Darya","family":"Melnyk","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.116044_bib0001","doi-asserted-by":"crossref","DOI":"10.1007\/s00530-015-0470-9","article-title":"Optimized residual vector quantization for efficient approximate nearest neighbor search","volume":"23","author":"Ai","year":"2017","journal-title":"Multimed. Syst."},{"key":"10.1016\/j.tcs.2026.116044_bib0002","series-title":"Advances in Neural Information Processing Systems","article-title":"Collaborative learning in the jungle (decentralized, Byzantine, heterogeneous, asynchronous and nonconvex learning)","volume":"34","author":"El-Mhamdi","year":"2021"},{"issue":"2","key":"10.1016\/j.tcs.2026.116044_bib0003","doi-asserted-by":"crossref","first-page":"575","DOI":"10.2307\/1954111","article-title":"Committee decisions under majority rule: an experimental study","volume":"72","author":"Fiorina","year":"1978","journal-title":"Am. Polit. Sci. Rev."},{"key":"10.1016\/j.tcs.2026.116044_bib0004","series-title":"2016 IEEE 30th International Conference on Advanced Information Networking and Applications (AINA)","first-page":"548","article-title":"Approximate-centroid election in large-scale distributed embedded systems","author":"Naz","year":"2016"},{"key":"10.1016\/j.tcs.2026.116044_bib0005","article-title":"Centroid-based multiple local community detection","author":"Li","year":"2022","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"issue":"2","key":"10.1016\/j.tcs.2026.116044_bib0006","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","article-title":"Least squares quantization in PCM","volume":"28","author":"Lloyd","year":"1982","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"10.1016\/j.tcs.2026.116044_bib0007","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s00446-014-0240-5","article-title":"Multidimensional agreement in Byzantine systems","volume":"28","author":"Mendes","year":"2015","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.tcs.2026.116044_bib0008","series-title":"36th International Symposium on Distributed Computing (DISC 2022)","article-title":"Byzantine consensus is \u0398 (n2): the Dolev-Reischuk bound is tight even in partial synchrony!","author":"Civit","year":"2022"},{"key":"10.1016\/j.tcs.2026.116044_bib0009","series-title":"2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS)","first-page":"403","article-title":"Polygraph: accountable byzantine agreement","author":"Civit","year":"2021"},{"key":"10.1016\/j.tcs.2026.116044_bib0010","series-title":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","first-page":"347","article-title":"HotStuff: BFT consensus with linearity and responsiveness","author":"Yin","year":"2019"},{"key":"10.1016\/j.tcs.2026.116044_bib0011","series-title":"30th Annual Symposium on Foundations of Computer Science","article-title":"Towards optimal distributed consensus","author":"Berman","year":"1989"},{"key":"10.1016\/j.tcs.2026.116044_bib0012","series-title":"31st International Symposium on Distributed Computing (DISC 2017)","article-title":"Brief announcement: practical synchronous Byzantine consensus","author":"Abraham","year":"2017"},{"key":"10.1016\/j.tcs.2026.116044_bib0013","series-title":"2018 IEEE 17th International Symposium on Network Computing and Applications (NCA)","article-title":"DBFT: efficient leaderless byzantine consensus and its application to blockchains","author":"Crain","year":"2018"},{"key":"10.1016\/j.tcs.2026.116044_bib0014","series-title":"2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS)","article-title":"Byzantine agreement with interval validity","author":"Melnyk","year":"2018"},{"key":"10.1016\/j.tcs.2026.116044_bib0015","series-title":"32nd International Symposium on Distributed Computing (DISC 2018)","article-title":"Fast multidimensional asymptotic and approximate consensus","author":"F\u00fcgger","year":"2018"},{"issue":"3","key":"10.1016\/j.tcs.2026.116044_bib0016","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1109\/TRO.2017.2658604","article-title":"Fault-tolerant rendezvous of multirobot systems","volume":"33","author":"Park","year":"2017","journal-title":"IEEE Trans. Robot."},{"key":"10.1016\/j.tcs.2026.116044_bib0017","doi-asserted-by":"crossref","DOI":"10.1016\/j.automatica.2021.110046","article-title":"Resilient distributed vector consensus using centerpoint","volume":"136","author":"Abbas","year":"2022","journal-title":"Automatica"},{"issue":"3","key":"10.1016\/j.tcs.2026.116044_bib0018","doi-asserted-by":"crossref","first-page":"269","DOI":"10.3934\/naco.2019018","article-title":"A resilient convex combination for consensus-based distributed algorithms","volume":"9","author":"Wang","year":"2019","journal-title":"Numer. Algebra Contr. Optim."},{"key":"10.1016\/j.tcs.2026.116044_bib0019","series-title":"26th International Conference on Principles of Distributed Systems (OPODIS 2022)","article-title":"The step complexity of multidimensional approximate agreement","author":"Attiya","year":"2023"},{"issue":"3","key":"10.1016\/j.tcs.2026.116044_bib0020","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/5925.5931","article-title":"Reaching approximate agreement in the presence of faults","volume":"33","author":"Dolev","year":"1986","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/j.tcs.2026.116044_bib0021","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","article-title":"A lower bound for the time to assure interactive consistency","volume":"14","author":"Fischer","year":"1982","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"10.1016\/j.tcs.2026.116044_bib0022","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/3149.214121","article-title":"Impossibility of distributed consensus with one faulty process","volume":"32","author":"Fischer","year":"1985","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/j.tcs.2026.116044_bib0023","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01783662","article-title":"Asymptotically optimal algorithms for approximate agreement","volume":"4","author":"Fekete","year":"1990","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.tcs.2026.116044_bib0024","series-title":"Proceedings of the 8th International Conference on Principles of Distributed Systems","first-page":"229","article-title":"Optimal resilience asynchronous approximate agreement","author":"Abraham","year":"2005"},{"issue":"2","key":"10.1016\/j.tcs.2026.116044_bib0025","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1016\/0890-5401(87)90054-X","article-title":"Asynchronous Byzantine agreement protocols","volume":"75","author":"Bracha","year":"1987","journal-title":"Inf. Comput."},{"issue":"2","key":"10.1016\/j.tcs.2026.116044_bib0026","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/BF01667080","article-title":"Simulating authenticated broadcasts to derive simple fault-tolerant algorithms","volume":"2","author":"Srikanth","year":"1987","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.tcs.2026.116044_bib0027","series-title":"Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing","article-title":"Multidimensional approximate agreement in Byzantine asynchronous systems","author":"Mendes","year":"2013"},{"key":"10.1016\/j.tcs.2026.116044_bib0028","series-title":"Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing","article-title":"Byzantine vector consensus in complete graphs","author":"Vaidya","year":"2013"},{"issue":"1","key":"10.1016\/j.tcs.2026.116044_bib0029","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1112\/jlms\/s1-41.1.123","article-title":"A generalization of Radon\u2019s theorem","volume":"s1-41","author":"Tverberg","year":"1966","journal-title":"J. Lond. Math. Soc."},{"key":"10.1016\/j.tcs.2026.116044_bib0030","series-title":"20th International Conference on Principles of Distributed Systems (OPODIS 2016)","article-title":"Relaxed Byzantine vector consensus","author":"Xiang","year":"2017"},{"key":"10.1016\/j.tcs.2026.116044_bib0031","article-title":"Validated Byzantine asynchronous multidimensional approximate agreement","volume":"abs\/2211.02126","author":"Dotan","year":"2022","journal-title":"CoRR"},{"key":"10.1016\/j.tcs.2026.116044_bib0032","series-title":"19th International Conference on Priniciples of Distributed Systems","article-title":"Byzantine agreement with median validity","author":"Stolz","year":"2015"},{"key":"10.1016\/j.tcs.2026.116044_bib0033","series-title":"Web and Internet Economics (WINE)","first-page":"327","article-title":"Byzantine preferential voting","author":"Melnyk","year":"2018"},{"key":"10.1016\/j.tcs.2026.116044_bib0034","article-title":"Robust sparse voting","volume":"abs\/2202.08656","author":"Allouah","year":"2022","journal-title":"CoRR"},{"key":"10.1016\/j.tcs.2026.116044_bib0035","series-title":"Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing","first-page":"332","article-title":"On the validity of consensus","author":"Civit","year":"2023"},{"key":"10.1016\/j.tcs.2026.116044_bib0036","series-title":"Distributed Computing: Fundamentals, Simulations, and Advanced Topics","author":"Attiya","year":"2004"},{"key":"10.1016\/j.tcs.2026.116044_bib0037","series-title":"Introduction to Reliable and Secure Distributed Programming","author":"Cachin","year":"2011"},{"key":"10.1016\/j.tcs.2026.116044_bib0038","series-title":"Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing","article-title":"Resilient consensus protocols","author":"Bracha","year":"1983"},{"key":"10.1016\/j.tcs.2026.116044_bib0039","series-title":"VLSI Algorithms and Architectures","article-title":"Families of consensus algorithms","author":"Bar-Noy","year":"1988"},{"key":"10.1016\/j.tcs.2026.116044_bib0040","series-title":"Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing","article-title":"On k-set consensus problems in asynchronous systems","author":"De Prisco","year":"1999"},{"key":"10.1016\/j.tcs.2026.116044_bib0041","series-title":"Proceedings of the 35th International Conference on Machine Learning","first-page":"3521","article-title":"The hidden vulnerability of distributed learning in Byzantium","volume":"80","author":"El Mhamdi","year":"2018"},{"key":"10.1016\/j.tcs.2026.116044_bib0042","series-title":"Stabilization, Safety, and Security of Distributed Systems","first-page":"93","article-title":"Centroid approximation with multidimensional approximate agreement protocols","author":"Cambus","year":"2026"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600294X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439752600294X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T11:32:29Z","timestamp":1780918349000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439752600294X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":42,"alternative-id":["S030439752600294X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116044","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Centroid approximation with multidimensional approximate agreement protocols","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.116044","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"116044"}}