{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:17:21Z","timestamp":1759335441858,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T00:00:00Z","timestamp":1716336000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T00:00:00Z","timestamp":1716336000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS 1059540"],"award-info":[{"award-number":["CNS 1059540"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W-911-NF-0710287"],"award-info":[{"award-number":["W-911-NF-0710287"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s00446-024-00468-2","type":"journal-article","created":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T03:38:20Z","timestamp":1716349100000},"page":"225-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Iterative approximate Byzantine consensus in arbitrary directed graphs"],"prefix":"10.1007","volume":"37","author":[{"given":"Lewis","family":"Tseng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guanfeng","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nitin H.","family":"Vaidya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,22]]},"reference":[{"key":"468_CR1","doi-asserted-by":"publisher","unstructured":"Antoniadis, K., Guerraoui, R., Malkhi, D., Seredinschi, D.: State machine replication is more expensive than consensus. In: Schmid, U., Widder, J. (eds.) 32nd International Symposium on Distributed Computing, DISC 2018, New Orleans, LA, USA, October 15\u201319, 2018, LIPIcs, vol. 121, pp. 7:1\u20137:18. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2018.7","DOI":"10.4230\/LIPIcs.DISC.2018.7"},{"key":"468_CR2","doi-asserted-by":"crossref","unstructured":"Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Wiley Series on Parallel and Distributed Computing (2004)","DOI":"10.1002\/0471478210"},{"key":"468_CR3","doi-asserted-by":"publisher","unstructured":"Azadmanesh, A., Bajwa, H.: Global convergence in partially fully connected networks (PFCN) with limited relays. In: Industrial Electronics Society, 2001. IECON \u201901. The 27th Annual Conference of the IEEE, vol. 3(3), pp. 2022\u20132025 (2001). https:\/\/doi.org\/10.1109\/IECON.2001.975602","DOI":"10.1109\/IECON.2001.975602"},{"issue":"1","key":"468_CR4","first-page":"26","volume":"5","author":"MH Azadmanesh","year":"2002","unstructured":"Azadmanesh, M.H., Kieckhafer, R.: Asynchronous approximate agreement in partially connected networks. Int. J. Parallel Distrib. Syst. Netw. 5(1), 26\u201334 (2002)","journal-title":"Int. J. Parallel Distrib. Syst. Netw."},{"key":"468_CR5","doi-asserted-by":"publisher","unstructured":"B\u00e9n\u00e9zit, F., Blondel, V.D., Thiran, P., Tsitsiklis, J.N., Vetterli, M.: Weighted gossip: distributed averaging using non-doubly stochastic matrices. In: IEEE International Symposium on Information Theory, ISIT 2010, June 13\u201318, 2010, Austin, Texas, USA, Proceedings, pp. 1753\u20131757. IEEE (2010). https:\/\/doi.org\/10.1109\/ISIT.2010.5513273","DOI":"10.1109\/ISIT.2010.5513273"},{"key":"468_CR6","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Optimization and Neural Computation Series. Athena Scientific (1997)"},{"key":"468_CR7","doi-asserted-by":"publisher","unstructured":"Biely, M., Widder, J., Charron-Bost, B., Gaillard, A., Hutle, M., Schiper, A.: Tolerating corrupted communication. In: Gupta, I., Wattenhofer, R. (eds.) Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, PODC 2007, Portland, Oregon, USA, August 12\u201315, 2007, pp. 244\u2013253. ACM (2007). https:\/\/doi.org\/10.1145\/1281100.1281136","DOI":"10.1145\/1281100.1281136"},{"key":"468_CR8","doi-asserted-by":"publisher","unstructured":"Charron-Bost, B., F\u00fcgger, M., Nowak, T.: Approximate consensus in highly dynamic networks: the role of averaging algorithms. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) Automata, Languages, and Programming\u201442nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6\u201310, 2015, Proceedings, Part II, Lecture Notes in Computer Science, vol. 9135, pp. 528\u2013539. Springer, Berlin (2015). https:\/\/doi.org\/10.1007\/978-3-662-47666-6_42","DOI":"10.1007\/978-3-662-47666-6_42"},{"issue":"1","key":"468_CR9","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00446-009-0084-6","volume":"22","author":"B Charron-Bost","year":"2009","unstructured":"Charron-Bost, B., Schiper, A.: The heard-of model: computing in distributed systems with benign faults. Distrib. Comput. 22(1), 49\u201371 (2009). https:\/\/doi.org\/10.1007\/s00446-009-0084-6","journal-title":"Distrib. Comput."},{"key":"468_CR10","unstructured":"Dasgupta, S., Papadimitriou, C., Vazirani, U.: Algorithms. McGraw-Hill Higher Education (2006)"},{"key":"468_CR11","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/5925.5931","volume":"33","author":"D Dolev","year":"1986","unstructured":"Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. J. ACM 33, 499\u2013516 (1986). https:\/\/doi.org\/10.1145\/5925.5931","journal-title":"J. ACM"},{"key":"468_CR12","doi-asserted-by":"publisher","unstructured":"Fekete, A.D.: Asymptotically optimal algorithms for approximate agreement. In: Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, PODC\u201986, pp. 73\u201387. ACM, New York (1986). https:\/\/doi.org\/10.1145\/10590.10597","DOI":"10.1145\/10590.10597"},{"key":"468_CR13","doi-asserted-by":"publisher","unstructured":"Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. In: Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, PODC\u201985, pp. 59\u201370. ACM, New York (1985). https:\/\/doi.org\/10.1145\/323596.323602","DOI":"10.1145\/323596.323602"},{"key":"468_CR14","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM 32, 374\u2013382 (1985). https:\/\/doi.org\/10.1145\/3149.214121","journal-title":"J. ACM"},{"issue":"6","key":"468_CR15","doi-asserted-by":"publisher","first-page":"46:1","DOI":"10.1145\/3485242","volume":"68","author":"M F\u00fcgger","year":"2021","unstructured":"F\u00fcgger, M., Nowak, T., Schwarz, M.: Tight bounds for asymptotic and approximate consensus. J. ACM 68(6), 46:1-46:35 (2021). https:\/\/doi.org\/10.1145\/3485242","journal-title":"J. ACM"},{"key":"468_CR16","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1017\/S0305004100033399","volume":"54","author":"J Hajnal","year":"1958","unstructured":"Hajnal, J.: Weak ergodicity in non-homogeneous Markov chains. Proc. Camb. Philos. Soc. 54, 233\u2013246 (1958)","journal-title":"Proc. Camb. Philos. Soc."},{"issue":"6","key":"468_CR17","doi-asserted-by":"publisher","first-page":"988","DOI":"10.1109\/TAC.2003.812781","volume":"48","author":"A Jadbabaie","year":"2003","unstructured":"Jadbabaie, A., Lin, J., Morse, A.S.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Trans. Autom. Control 48(6), 988\u20131001 (2003). https:\/\/doi.org\/10.1109\/TAC.2003.812781","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"468_CR18","first-page":"53","volume":"3","author":"RM Kieckhafer","year":"1993","unstructured":"Kieckhafer, R.M., Azadmanesh, M.H.: Low cost approximate agreement in partially connected networks. J. Comput. Inf. 3(1), 53\u201385 (1993)","journal-title":"J. Comput. Inf."},{"key":"468_CR19","doi-asserted-by":"crossref","unstructured":"Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. (1982)","DOI":"10.1145\/357172.357176"},{"key":"468_CR20","doi-asserted-by":"crossref","unstructured":"LeBlanc, H., Koutsoukos, X.: Consensus in networked multi-agent systems with adversaries. In: 14th International conference on Hybrid Systems: Computation and Control (HSCC) (2011)","DOI":"10.1145\/1967701.1967742"},{"key":"468_CR21","doi-asserted-by":"crossref","unstructured":"LeBlanc, H., Koutsoukos, X.: Low complexity resilient consensus in networked multi-agent systems with adversaries. In: 15th International conference on Hybrid Systems: Computation and Control (HSCC) (2012)","DOI":"10.1145\/2185632.2185637"},{"key":"468_CR22","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1109\/JSAC.2013.130413","volume":"31","author":"H LeBlanc","year":"2013","unstructured":"LeBlanc, H., Zhang, H., Koutsoukos, X., Sundaram, S.: Resilient asymptotic consensus in robust networks. IEEE J. Sel. Areas Commun. Special Issue Netw. Comput. 31, 766\u2013781 (2013)","journal-title":"IEEE J. Sel. Areas Commun. Special Issue Netw. Comput."},{"key":"468_CR23","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann (1996)"},{"key":"468_CR24","doi-asserted-by":"crossref","unstructured":"Santoro, N., Widmayer, P.: Time is not a healer. In: Proceedings of the 6th Annual Symposium on Theoretical Aspects of Computer Science on STACS 89, pp. 304\u2013313. Springer-Verlag New York, Inc., New York (1989). http:\/\/dl.acm.org\/citation.cfm?id=73228.73254","DOI":"10.1007\/BFb0028994"},{"issue":"2\u20133","key":"468_CR25","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.tcs.2007.04.036","volume":"384","author":"N Santoro","year":"2007","unstructured":"Santoro, N., Widmayer, P.: Agreement in synchronous networks with ubiquitous faults. Theor. Comput. Sci. 384(2\u20133), 232\u2013249 (2007). https:\/\/doi.org\/10.1016\/j.tcs.2007.04.036","journal-title":"Theor. Comput. Sci."},{"key":"468_CR26","doi-asserted-by":"publisher","unstructured":"Su, L., Vaidya, N.H.: Reaching approximate byzantine consensus with multi-hop communication. In: Pelc, A., Schwarzmann, A.A. (eds.) Stabilization, Safety, and Security of Distributed Systems\u201417th International Symposium, SSS 2015, Edmonton, AB, Canada, August 18\u201321, 2015, Proceedings, Lecture Notes in Computer Science, vol. 9212, pp. 21\u201335. Springer, Berlin (2015). https:\/\/doi.org\/10.1007\/978-3-319-21741-3_2","DOI":"10.1007\/978-3-319-21741-3_2"},{"key":"468_CR27","doi-asserted-by":"publisher","unstructured":"Tseng, L., Vaidya, N.H.: Asynchronous convex hull consensus in the presence of crash faults. In: Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing, PODC\u201914, pp. 396\u2013405. ACM, New York (2014). https:\/\/doi.org\/10.1145\/2611462.2611470","DOI":"10.1145\/2611462.2611470"},{"key":"468_CR28","doi-asserted-by":"crossref","unstructured":"Tseng, L., Vaidya, N.H.: Iterative approximate byzantine consensus under a generalized fault model. In: In International Conference on Distributed Computing and Networking (ICDCN) (2013)","DOI":"10.21236\/ADA564090"},{"key":"468_CR29","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H.: Matrix representation of iterative approximate byzantine consensus in directed graphs. CoRR. arXiv:1203.1888 (2012)","DOI":"10.21236\/ADA558910"},{"key":"468_CR30","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H.: Iterative byzantine vector consensus in incomplete graphs. In: In International Conference on Distributed Computing and Networking (ICDCN) (2014)","DOI":"10.1007\/978-3-642-45249-9_2"},{"key":"468_CR31","doi-asserted-by":"publisher","unstructured":"Vaidya, N.H., Garg, V.K.: Byzantine vector consensus in complete graphs. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing, PODC\u201913, pp. 65\u201373. ACM, New York (2013). https:\/\/doi.org\/10.1145\/2484239.2484256","DOI":"10.1145\/2484239.2484256"},{"key":"468_CR32","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H., Tseng, L., Liang, G.: Iterative approximate byzantine consensus in arbitrary directed graphs. In: Proceedings of the Thirty-First Annual ACM Symposium on Principles of Distributed Computing, PODC\u201912. ACM (2012)","DOI":"10.1145\/2332432.2332505"},{"key":"468_CR33","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H., Tseng, L., Liang, G.: Iterative approximate byzantine consensus in arbitrary directed graphs. CoRR arXiv:1201.4183 (2012)","DOI":"10.21236\/ADA558910"},{"key":"468_CR34","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H., Tseng, L., Liang, G.: Iterative approximate byzantine consensus in arbitrary directed graphs\u2014part II: Synchronous and asynchronous systems. CoRR arXiv:1202.6094 (2012)","DOI":"10.21236\/ADA558910"},{"key":"468_CR35","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1090\/S0002-9939-1963-0154756-3","volume":"14","author":"J Wolfowitz","year":"1963","unstructured":"Wolfowitz, J.: Products of indecomposable, aperiodic, stochastic matrices. Proc. Am. Math. Soc. 14, 733\u2013737 (1963)","journal-title":"Proc. Am. Math. Soc."},{"key":"468_CR36","unstructured":"Zhang, H., Sundaram, S.: Robustness of information diffusion algorithms to locally bounded adversaries. CoRR arXiv:1110.3843 (2011)"},{"key":"468_CR37","doi-asserted-by":"crossref","unstructured":"Zhang, H., Sundaram, S.: Robustness of complex networks with implications for consensus and contagion. In: Proceedings of CDC 2012, the 51st IEEE Conference on Decision and Control (2012)","DOI":"10.1109\/CDC.2012.6425841"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-024-00468-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00446-024-00468-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-024-00468-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T05:03:55Z","timestamp":1722661435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00446-024-00468-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,22]]},"references-count":37,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["468"],"URL":"https:\/\/doi.org\/10.1007\/s00446-024-00468-2","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2024,5,22]]},"assertion":[{"value":"28 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 April 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This research is supported in part by National Science Foundation award CNS 1059540 and Army Research Office grant W-911-NF-0710287. Any opinions, findings, and conclusions or recommendations expressed here are those of the authors and do not necessarily reflect the views of the funding agencies or the U.S. government. The preliminary work was conducted while all three authors were affiliated with University of Illinois at Urbana-Champaign (UIUC).","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}