{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:18:01Z","timestamp":1763468281429,"version":"3.41.0"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319217406"},{"type":"electronic","value":"9783319217413"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21741-3_2","type":"book-chapter","created":{"date-parts":[[2015,8,3]],"date-time":"2015-08-03T12:21:28Z","timestamp":1438604488000},"page":"21-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Reaching Approximate Byzantine Consensus with Multi-hop Communication"],"prefix":"10.1007","author":[{"given":"Lili","family":"Su","sequence":"first","affiliation":[]},{"given":"Nitin","family":"Vaidya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,4]]},"reference":[{"issue":"6","key":"2_CR1","doi-asserted-by":"publisher","first-page":"988","DOI":"10.1109\/TAC.2003.812781","volume":"48","author":"J Ali","year":"2003","unstructured":"Ali, J., Jie, L., Morse, A.S.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control 48(6), 988\u20131001 (2003)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Bnzit, F., Blondel, V., Thiran, P., Tsitsiklis, J., Vetterli, M.: Weighted gossip:Distributed averaging using non-doubly stochastic matrices. In: 2010 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1753\u20131757, June 2010","DOI":"10.1109\/ISIT.2010.5513273"},{"key":"2_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C., et al.: Introduction toalgorithms, vol. 2. MIT Press Cambridge (2001)"},{"issue":"3","key":"2_CR4","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(3), 499\u2013516 (1986)","journal-title":"J. ACM"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF01783662","volume":"4","author":"AD Fekete","year":"1990","unstructured":"Fekete, A.D.: Asymptotically optimal algorithms for approximate agreement. Distributed Computing 4(1), 9\u201329 (1990)","journal-title":"Distributed Computing"},{"key":"2_CR6","doi-asserted-by":"crossref","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 1985, pp. 59\u201370. ACM, New York (1985)","DOI":"10.1145\/323596.323602"},{"key":"2_CR7","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)","journal-title":"J. ACM"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"LeBlanc, H.J., Zhang, H., Sundaram, S., Koutsoukos, X.: Consensus of multi-agent networks in the presence of adversaries using only local information. In: Proceedings of the 1st International Conference on High Confidence Networked Systems, HiCoNS 2012, pp. 1\u201310. ACM, New York (2012)","DOI":"10.1145\/2185505.2185507"},{"issue":"2","key":"2_CR9","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Su, L., Vaidya, N.: Reaching approximate byzantine consensus with multi-hop communication (2014). arXiv preprint arXiv:1411.5282","DOI":"10.1007\/978-3-319-21741-3_2"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/978-3-319-09581-3_7","volume-title":"Networked Systems","author":"L Tseng","year":"2014","unstructured":"Tseng, L., Vaidya, N.: Iterative approximate consensus in the presence of byzantine link failures. In: Noubir, G., Raynal, M. (eds.) NETYS 2014. LNCS, vol. 8593, pp. 84\u201398. Springer, Heidelberg (2014)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Tseng, L., Vaidya, N.H.: Fault-tolerant consensus in directed graphs. In: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing. ACM (to appear, 2015)","DOI":"10.1145\/2767386.2767399"},{"key":"2_CR13","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":"2_CR14","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H., Tseng, L., Liang, G.: Iterative approximate byzantine consensus in arbitrary directed graphs. In: Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing, pp. 365\u2013374. ACM (2012)","DOI":"10.1145\/2332432.2332505"},{"key":"2_CR15","unstructured":"West, D.B., et al.: Introduction to graph theory, vol. 2. Prentice Hall, Upper Saddle River (2001)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Zhang, H., Sundaram, S.: Robustness of information diffusion algorithms to locally bounded adversaries. In: American Control Conference (ACC 2012), pp. 5855\u20135861 (2012)","DOI":"10.1109\/ACC.2012.6315661"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21741-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T21:15:54Z","timestamp":1748553354000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21741-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319217406","9783319217413"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21741-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"4 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}