{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T10:42:22Z","timestamp":1770892942936,"version":"3.50.1"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2217058"],"award-info":[{"award-number":["2217058"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2112665"],"award-info":[{"award-number":["2112665"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,4]]},"DOI":"10.1109\/tit.2025.3536323","type":"journal-article","created":{"date-parts":[[2025,1,29]],"date-time":"2025-01-29T18:48:45Z","timestamp":1738176525000},"page":"2888-2908","source":"Crossref","is-referenced-by-count":1,"title":["Robust Distributed Clustering With Redundant Data Assignment"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4594-4844","authenticated-orcid":false,"given":"Saikiran","family":"Bulusu","sequence":"first","affiliation":[{"name":"Electrical and Computer Engineering Department, The Ohio State University, Columbus, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2381-7788","authenticated-orcid":false,"given":"Venkata","family":"Gandikota","sequence":"additional","affiliation":[{"name":"Electrical Engineering and Computer Science Department, Syracuse University, Syracuse, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4605-7996","authenticated-orcid":false,"given":"Arya","family":"Mazumdar","sequence":"additional","affiliation":[{"name":"The Halioğlu Data Science Institute (HDSI), University of California at San Diego, San Diego, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ankit","family":"Singh Rawat","sequence":"additional","affiliation":[{"name":"Google Research NY, New York City, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4504-5088","authenticated-orcid":false,"given":"Pramod K.","family":"Varshney","sequence":"additional","affiliation":[{"name":"Electrical and Computer Engineering Department, The Ohio State University, Columbus, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174299"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9517819"},{"key":"ref3","article-title":"The hardness of K-means clustering","author":"Dasgupta","year":"2008"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"ref5","first-page":"1","article-title":"Distributed K-means and K-median clustering on general topologies","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"26","author":"Balcan"},{"key":"ref6","first-page":"1063","article-title":"Fast distributed K-center clustering with outliers on massive data","volume-title":"Proc. 28th Int. Conf. Neural Inf. Process. Syst.","volume":"1","author":"Malkomes"},{"key":"ref7","first-page":"3727","article-title":"Communication-optimal distributed clustering","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Chen"},{"key":"ref8","article-title":"General and robust communication-efficient algorithms for distributed clustering","author":"Awasthi","year":"2017","journal-title":"arXiv:1703.00830"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087568"},{"key":"ref10","first-page":"570","article-title":"Distributed clustering via LSH based data partitioning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Bhaskara"},{"key":"ref11","first-page":"5434","article-title":"Straggler mitigation in distributed optimization through data encoding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"30","author":"Karakus"},{"key":"ref12","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","volume":"70","author":"Tandon"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref14","first-page":"803","article-title":"Slow and stale gradients can win the race: Error-runtime trade-offs in distributed SGD","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Dutta"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICC42927.2021.9500346"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"ref19","article-title":"Securing distributed gradient descent in high dimensional statistical learning","author":"Su","year":"2018","journal-title":"arXiv:1804.10140"},{"key":"ref20","first-page":"693","article-title":"Hogwild: A lock-free approach to parallelizing stochastic gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","author":"Recht"},{"key":"ref21","first-page":"5650","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","volume-title":"Proc. Int. Conf. Mach. Learn.","volume":"80","author":"Yin"},{"key":"ref22","first-page":"119","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","volume-title":"Proc. Annu. Conf. Neural Inf. Process. Syst.","volume":"30","author":"Blanchard"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3100110"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref26","article-title":"ErasureHead: Distributed gradient descent without delays using approximate gradient coding","author":"Wang","year":"2019","journal-title":"arXiv:1901.09671"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849857"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174363"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2023.3284427"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ITA50056.2020.9245017"},{"key":"ref31","first-page":"948","article-title":"Efficient coreset constructions via sensitivity sampling","volume-title":"Proc. Asian Conf. Mach. Learn.","author":"Braverman"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3322808"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.106"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973105.103"},{"key":"ref35","first-page":"620","article-title":"Constant-factor approximation for ordered k-median","volume-title":"Proc. 50th Annu. ACM SIGACT Symp. Theory Comput.","author":"Byrka"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.7"},{"key":"ref37","first-page":"569","article-title":"A unified framework for approximating and clustering data","volume-title":"Proc. 43rd Annu. ACM Symp. Theory Comput.","author":"Feldman"},{"key":"ref38","first-page":"1329","article-title":"A near-linear algorithm for projective clustering integer points","volume-title":"Proc. 23rd Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Varadarajan"},{"key":"ref39","first-page":"630","article-title":"Coresets and sketches for high dimensional subspace approximation problems","volume-title":"Proc. 21st Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Feldman"},{"key":"ref40","first-page":"497","article-title":"On the sensitivity of shape fitting problems","volume-title":"Proc. IARCS Annu. Conf. Found. Softw. Technol. Theor. Comput. Sci. (FSTTCS)","volume":"18","author":"Varadarajan"},{"issue":"3","key":"ref41","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/18M1209854","article-title":"Turning big data into tiny data: Constant-size coresets for k-means, PCA, and projective clustering","volume":"49","author":"Feldman","year":"2020","journal-title":"SIAM J. Comput."},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00081"},{"key":"ref43","first-page":"3220","article-title":"Dimensionality reduction for the sum-of-distances metric","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Feng"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451022"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3519946"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00051"},{"key":"ref47","first-page":"62:1","article-title":"Streaming coreset constructions for M-estimators","volume-title":"Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques (APPROX\/RANDOM)","volume":"145","author":"Braverman","year":"2019"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"issue":"5","key":"ref49","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s00493-006-0029-7","article-title":"Lifts, discrepancy and nearly optimal spectral gap","volume":"26","author":"Bilu","year":"2006","journal-title":"Combinatorica"},{"key":"ref50","article-title":"Approximate gradient coding via sparse random graphs","author":"Charles","year":"2017","journal-title":"arXiv:1711.06771"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.09.012"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009783824328"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10935829\/10857440-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10935829\/10857440.pdf?arnumber=10857440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:28:12Z","timestamp":1743042492000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10857440\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4]]},"references-count":52,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3536323","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4]]}}}