{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:05Z","timestamp":1773377765574,"version":"3.50.1"},"reference-count":24,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517819","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2143-2148","source":"Crossref","is-referenced-by-count":2,"title":["Byzantine Resilient Distributed Clustering with Redundant Data Assignment"],"prefix":"10.1109","author":[{"given":"Saikiran","family":"Bulusu","sequence":"first","affiliation":[{"name":"Syracuse University,Electrical Engineering & Computer Science Department,Syracuse,NY,13202"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Venkata","family":"Gandikota","sequence":"additional","affiliation":[{"name":"Syracuse University,Electrical Engineering & Computer Science Department,Syracuse,NY,13202"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arya","family":"Mazumdar","sequence":"additional","affiliation":[{"name":"University of California,The Halicioğlu Data Science Institute (HDSI),San Diego"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankit Singh","family":"Rawat","sequence":"additional","affiliation":[{"name":"Google Research NY,New York,NY,10011"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pramod K.","family":"Varshney","sequence":"additional","affiliation":[{"name":"Syracuse University,Electrical Engineering & Computer Science Department,Syracuse,NY,13202"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume":"70","author":"tandon","year":"2017","journal-title":"Proceedings of the 34th International Conference on Machine Learning ser Proceedings of Machine Learning Research"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref13","article-title":"Approximate gradient coding with optimal decoding","author":"glasgow","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref15","first-page":"2556","article-title":"Reliable distributed clustering with redundant data assignment","author":"gandikota","year":"0","journal-title":"2020 IEEE International Symposium on Information Theory (ISIT)"},{"key":"ref16","article-title":"Erasurehead: Distributed gradient descent without delays using approximate gradient coding","author":"wang","year":"2019","journal-title":"ArXiv Preprint"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849857"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174363"},{"key":"ref19","article-title":"Byzantine-resilient high-dimensional federated learning","author":"data","year":"2020","journal-title":"ArXiv e-prints"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087568"},{"key":"ref6","article-title":"Securing distributed machine learning in high dimensions","author":"su","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3219617.3219655"},{"key":"ref8","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume":"80","author":"yin","year":"2018","journal-title":"Proceedings of the 35th International Conference on Machine Learning ser Proceedings of Machine Learning Research"},{"key":"ref7","first-page":"693","article-title":"Hogwild: A lock-free approach to parallelizing stochastic gradient descent","author":"recht","year":"2011","journal-title":"Advances in neural information processing systems"},{"key":"ref2","article-title":"General and robust communication-efficient algorithms for distributed clustering","volume":"abs 1703 830","author":"awasthi","year":"2017","journal-title":"CoRR"},{"key":"ref1","first-page":"1063","article-title":"Fast distributed k-center clustering with outliers on massive data","volume":"1","author":"malkomes","year":"0","journal-title":"Proceedings of the 28th International Conference on Neural Information Processing Systems"},{"key":"ref9","first-page":"119","article-title":"Ma-chine learning with adversaries: Byzantine tolerant gradient descent","volume":"30","author":"blanchard","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ITA50056.2020.9245017"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"ref21","article-title":"Approximate gradient coding via sparse random graphs","author":"charles","year":"2017","journal-title":"ArXiv Preprint"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.09.012"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0029-7"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517819.pdf?arnumber=9517819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:06Z","timestamp":1773347706000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517819\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517819","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}