{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T21:04:29Z","timestamp":1769634269154,"version":"3.49.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T00:00:00Z","timestamp":1529452800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Science Foundation","award":["1421918"],"award-info":[{"award-number":["1421918"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s00446-018-0336-4","type":"journal-article","created":{"date-parts":[[2018,6,20]],"date-time":"2018-06-20T09:48:33Z","timestamp":1529488113000},"page":"277-289","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Defending non-Bayesian learning against adversarial attacks"],"prefix":"10.1007","volume":"32","author":[{"given":"Lili","family":"Su","sequence":"first","affiliation":[]},{"given":"Nitin H.","family":"Vaidya","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,20]]},"reference":[{"key":"336_CR1","doi-asserted-by":"crossref","unstructured":"Su, L., Vaidya, N.H.: Non-Bayesian learning in the presence of Byzantine agents. To appear in Proceedings of ACM Symposium on Distributed Computing (DISC) (2016)","DOI":"10.1007\/978-3-662-53426-7_30"},{"key":"336_CR2","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1109\/TSP.2002.806982","volume":"51","author":"J-F Chamberland","year":"2003","unstructured":"Chamberland, J.-F., Veeravalli, V.V.: Decentralized detection in sensor networks. IEEE Trans. Signal Process. 51, 407\u2013416 (2003)","journal-title":"IEEE Trans. Signal Process."},{"key":"336_CR3","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0899-8256(03)00144-1","volume":"45","author":"D Gale","year":"2003","unstructured":"Gale, D., Kariv, S.: Bayesian learning in social networks. Games Econ. Behav. 45, 329\u2013346 (2003)","journal-title":"Games Econ. Behav."},{"key":"336_CR4","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1016\/j.geb.2012.06.001","volume":"76","author":"A Jadbabaie","year":"2012","unstructured":"Jadbabaie, A., Molavi, P., Sandroni, A., Tahbaz-Salehi, A.: Non-Bayesian social learning. Games Econ. Behav. 76, 210\u2013225 (2012)","journal-title":"Games Econ. Behav."},{"key":"336_CR5","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF02551407","volume":"1","author":"J Tsitsiklis","year":"1988","unstructured":"Tsitsiklis, J.: Decentralized detection by a large number of sensors. Math. Control Signals Syst. 1, 167\u2013182 (1988)","journal-title":"Math. Control Signals Syst."},{"key":"336_CR6","volume-title":"Advances in Statistical Signal Processing","author":"JN Tsitsiklis","year":"1993","unstructured":"Tsitsiklis, J.N.: Decentralized detection. In: Poor, H.V., Thomas, J.B. (eds.) Advances in Statistical Signal Processing. JAI Press, Greenwich (1993)"},{"key":"336_CR7","volume-title":"Distributed Detection and Data Fusion","author":"PK Varshney","year":"2012","unstructured":"Varshney, P.K.: Distributed Detection and Data Fusion. Springer, Berlin (2012)"},{"key":"336_CR8","volume-title":"Stochastic Processes in Engineering Systems","author":"E Wong","year":"2012","unstructured":"Wong, E., Hajek, B.: Stochastic Processes in Engineering Systems. Springer, Berlin (2012)"},{"issue":"11","key":"336_CR9","doi-asserted-by":"publisher","first-page":"5987","DOI":"10.1109\/TSP.2012.2210885","volume":"60","author":"D Bajovi\u0107","year":"2012","unstructured":"Bajovi\u0107, D., Jakoveti\u0107, D., Moura, J.M., Xavier, J., Sinopoli, B.: Large deviations performance of consensus+ innovations distributed detection with non-Gaussian observations. IEEE Trans. Signal Process. 60(11), 5987\u20136002 (2012)","journal-title":"IEEE Trans. Signal Process."},{"issue":"5","key":"336_CR10","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1109\/TSP.2011.2107902","volume":"59","author":"FS Cattivelli","year":"2011","unstructured":"Cattivelli, F.S., Sayed, A.H.: Distributed detection over adaptive networks using diffusion adaptation. IEEE Trans. Signal Process. 59(5), 1917\u20131932 (2011)","journal-title":"IEEE Trans. Signal Process."},{"issue":"8","key":"336_CR11","doi-asserted-by":"publisher","first-page":"4306","DOI":"10.1109\/TSP.2012.2197395","volume":"60","author":"D Jakoveti\u0107","year":"2012","unstructured":"Jakoveti\u0107, D., Moura, J.M., Xavier, J.: Distributed detection over noisy networks: large deviations analysis. IEEE Trans. Signal Process. 60(8), 4306\u20134320 (2012)","journal-title":"IEEE Trans. Signal Process."},{"key":"336_CR12","doi-asserted-by":"crossref","unstructured":"Jadbabaie, A., Molavi, P., Tahbaz-Salehi, A.: Information heterogeneity and the speed of learning in social networks. Columbia Business School Research Paper (13-28) (2013)","DOI":"10.2139\/ssrn.2266979"},{"key":"336_CR13","doi-asserted-by":"crossref","unstructured":"Nedi\u0107, A., Olshevsky, A., Uribe, C.A.: Nonasymptotic convergence rates for cooperative learning over time-varying directed graphs. arXiv preprint arXiv:1410.1977 (2014)","DOI":"10.1109\/ACC.2015.7172262"},{"key":"336_CR14","doi-asserted-by":"crossref","unstructured":"Rad, K.R., Tahbaz-Salehi, A.: Distributed parameter estimation in networks. In: IEEE Conference on Decision and Control (CDC), pp. 5050\u20135055. IEEE (2010)","DOI":"10.1109\/CDC.2010.5717946"},{"key":"336_CR15","doi-asserted-by":"crossref","unstructured":"Shahrampour, S., Jadbabaie, A.: Exponentially fast parameter estimation in networks using distributed dual averaging. In: IEEE Conference on Decision and Control (CDC), pp. 6196\u20136201. IEEE (2013)","DOI":"10.1109\/CDC.2013.6760868"},{"key":"336_CR16","doi-asserted-by":"crossref","unstructured":"Lalitha, A., Sarwate, A., Javidi, T.: Social learning and distributed hypothesis testing. In 2014 IEEE International Symposium on Information Theory (ISIT), pp. 551\u2013555, June 2014. Extended version at arXiv:1410.4307","DOI":"10.1109\/ISIT.2014.6874893"},{"key":"336_CR17","doi-asserted-by":"crossref","unstructured":"Shahrampour, S., Rakhlin, A., Jadbabaie, A.: Finite-time analysis of the distributed detection problem. arXiv preprint arXiv:1512.09311 (2015)","DOI":"10.1109\/ALLERTON.2015.7447059"},{"key":"336_CR18","unstructured":"Shahrampour, S., Rakhlin, A., Jadbabaie, A.: Distributed detection: finite-time analysis and impact of network topology. arXiv preprint arXiv:1409.8606 (2014)"},{"key":"336_CR19","doi-asserted-by":"publisher","unstructured":"Molavi, P., Tahbaz-Salehi, A., Jadbabaie, A.:. Foundations of non-Bayesian social learning. Columbia Business School Research Paper No. 15-95. SSRN: https:\/\/ssrn.com\/abstract=2683607 or https:\/\/doi.org\/10.2139\/ssrn.2683607 (2017)","DOI":"10.2139\/ssrn.2683607"},{"key":"336_CR20","unstructured":"Olfati-Saber, R., Franco, E., Frazzoli, E., Shamma, J.: Belief consensus and distributed hypothesis testing in sensor networks. In: Networked Embedded Sensing and Control. Springer (2006)"},{"key":"336_CR21","doi-asserted-by":"publisher","unstructured":"Rahimian, M.A., Jadbabaie, M.A.: Learning without recall: a case for log-linear learning. IFAC-PapersOnLine 48(22), 46\u201351, ISSN 2405-8963 (2015). https:\/\/doi.org\/10.1016\/j.ifacol.2015.10.305","DOI":"10.1016\/j.ifacol.2015.10.305"},{"key":"336_CR22","unstructured":"Su, L., Vaidya, N.H.: Asynchronous distributed hypothesis testing in the presence of crash failures University of Illinois at Urbana-Champaign, technical report. arXiv:1606.03418 (2016)"},{"key":"336_CR23","unstructured":"Shahin, S., Ali, J.: An online optimization approach for multi-agent tracking of dynamic parameters in the presence of adversarial noise. In: American Control Conference (ACC). IEEE (2017)"},{"key":"336_CR24","doi-asserted-by":"crossref","unstructured":"Bedi, A.S., Sarma, P., Rajawat, K.: Adversarial multi-agent target tracking with inexact online gradient descent. arXiv preprint arXiv:1710.05133 (2017)","DOI":"10.1109\/ICASSP.2018.8461346"},{"issue":"2","key":"336_CR25","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease\u0107","year":"1980","unstructured":"Pease\u0107, M., Shostak\u0107, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980)","journal-title":"J. ACM"},{"issue":"3","key":"336_CR26","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":"336_CR27","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. Distrib. Comput. 4(1), 9\u201329 (1990)","journal-title":"Distrib. Comput."},{"key":"336_CR28","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 \u201912, pp. 1\u201310, New York, NY, USA. ACM (2012)","DOI":"10.1145\/2185505.2185507"},{"key":"336_CR29","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H.: Iterative byzantine vector consensus in incomplete graphs. In: Distributed Computing and Networking, pp. 14\u201328. Springer (2014)","DOI":"10.1007\/978-3-642-45249-9_2"},{"key":"336_CR30","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":"336_CR31","doi-asserted-by":"crossref","unstructured":"Mendes, H., Herlihy, M.: Multidimensional approximate agreement in Byzantine asynchronous systems. In: Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, STOC \u201913, pp. 391\u2013400, New York, NY, USA. ACM (2013)","DOI":"10.1145\/2488608.2488657"},{"key":"336_CR32","doi-asserted-by":"crossref","unstructured":"Su, L., Vaidya, N.H.: Reaching approximate byzantine consensus with multi-hop communication. In: Proceedings of International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (2015)","DOI":"10.1007\/978-3-319-21741-3_2"},{"key":"336_CR33","volume-title":"Distributed Algorithms","author":"NA Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)"},{"key":"336_CR34","doi-asserted-by":"crossref","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, pp. 65\u201373. ACM (2013)","DOI":"10.1145\/2484239.2484256"},{"key":"336_CR35","unstructured":"Perles, M.A., Sigron, M.: A generalization of Tverberg\u2019s theorem. arXiv:0710.4668 (2007)"},{"key":"336_CR36","doi-asserted-by":"crossref","unstructured":"Hajnal, J., Bartlett, M.: Weak ergodicity in non-homogeneous markov chains. In: Mathematical Proceedings of the Cambridge Philosophical Society, vol. 54, pp. 233\u2013246. Cambridge University Press, Cambridge (1958)","DOI":"10.1017\/S0305004100033399"},{"key":"336_CR37","doi-asserted-by":"crossref","unstructured":"Wolfowitz, J.: Products of indecomposable, aperiodic, stochastic matrices. In: Proceedings of the American Mathematical Society, pp. 733\u2013737. JSTOR (1963)","DOI":"10.1090\/S0002-9939-1963-0154756-3"},{"key":"336_CR38","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H.: Matrix representation of iterative approximate Byzantine consensus in directed graphs. arXiv:1203.1888 (2012)","DOI":"10.21236\/ADA558910"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-018-0336-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-018-0336-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-018-0336-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T06:35:17Z","timestamp":1751697317000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-018-0336-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,20]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["336"],"URL":"https:\/\/doi.org\/10.1007\/s00446-018-0336-4","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,20]]},"assertion":[{"value":"10 August 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}