{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T04:06:02Z","timestamp":1750824362431,"version":"3.41.0"},"reference-count":94,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["CNS-1850483","CCF-1563742","CCF-1814603"],"award-info":[{"award-number":["CNS-1850483","CCF-1563742","CCF-1814603"]}]},{"name":"Adaptive, Intelligent and Distributed Assurance Platform (AIDA) Project","award":["POCI-01-0247-FEDER-045907"],"award-info":[{"award-number":["POCI-01-0247-FEDER-045907"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1109\/tit.2025.3565558","type":"journal-article","created":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T17:31:18Z","timestamp":1745947878000},"page":"5684-5699","source":"Crossref","is-referenced-by-count":0,"title":["A Locality-Based Lens for Coded Computation"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6253-1689","authenticated-orcid":false,"given":"Michael","family":"Rudow","sequence":"first","affiliation":[{"name":"Department of Computer Science, Carnegie Mellon University (CMU), Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2227-7460","authenticated-orcid":false,"given":"K. V.","family":"Rashmi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Carnegie Mellon University (CMU), Pittsburgh, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7926-3396","authenticated-orcid":false,"given":"Venkatesan","family":"Guruswami","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Mathematics, University of California at Berkeley, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518056"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3366706"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927558"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437473"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437852"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref12","first-page":"4406","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst. (NIPS)","author":"Yu"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref14","first-page":"5152","article-title":"Coded sparse matrix multiplication","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636019"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437669"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3064827"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICC40277.2020.9149322"},{"key":"ref24","article-title":"Parity-checked strassen algorithm","author":"Wang","year":"2020","journal-title":"arXiv:2011.15082"},{"key":"ref25","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist.","author":"Yu"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2208937"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2325570"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620355"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2321280"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2351404"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2524510"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282779"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2934124"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1186\/s13634-015-0292-0"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437593"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2939135"},{"key":"ref37","first-page":"126","article-title":"Local testing and decoding of high-rate error-correcting Codes","volume-title":"Proc. Electron. Colloq. Comput. Complex. (ECCC)","volume":"24","author":"Kopparty"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1561\/0400000030"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52282-4_44"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52282-4_30"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103429"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90195-2"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/090772721"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1326554.1326555"},{"issue":"3","key":"ref45","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.jcss.2004.04.007","article-title":"Exponential lower bound for 2-query locally decodable codes via a quantum argument","volume":"69","author":"Kerenidis","year":"2004","journal-title":"J. Comput. Syst. Sci."},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2002.1004353"},{"key":"ref47","first-page":"1","article-title":"New lower bounds for general locally decodable codes","volume-title":"Proc. Electronic Colloquium  Comput. Complex. (ECCC)","author":"Woodruff"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_115"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2002.1004354"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/IREPGELC.1954.6499441"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1954.1057465"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/NetCod.2013.6570829"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620541"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2555813"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2288784"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2015.7133123"},{"key":"ref57","article-title":"Locally repairable codes with functional repair and multiple erasure tolerance","author":"Song","year":"2015","journal-title":"arXiv:1507.02796"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262863"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2477406"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2518663"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2700859"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284028"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/2435204.2435207"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934901"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676475"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1986.13535"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20943-2"},{"issue":"4","key":"ref68","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1016\/j.jpdc.2008.12.002","article-title":"Algorithm-based fault tolerance applied to high performance computing","volume":"69","author":"Bosilca","year":"2009","journal-title":"J. Parallel Distrib. Comput."},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206890"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206923"},{"key":"ref71","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Tandon"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2018.00137"},{"key":"ref74","first-page":"903","article-title":"DRACO: Byzantine-resilient distributed training via redundant gradients","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref75","first-page":"5610","article-title":"Communication-computation efficient gradient coding","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Ye"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref77","article-title":"Approximate gradient coding via sparse random graphs","author":"Charles","year":"2017","journal-title":"arXiv:1711.06771"},{"key":"ref78","first-page":"5434","article-title":"Straggler mitigation in distributed optimization through data encoding","volume-title":"Proc. Neural Inf. Process. Syst. (NIPS)","author":"Karakus"},{"key":"ref79","article-title":"Learning a code: Machine learning for approximate non-linear coded computation","author":"Kosaian","year":"2018","journal-title":"arXiv:1806.01259"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2983165"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359654"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS47774.2020.00024"},{"volume-title":"Error correction for algebraic block codes","year":"1986","author":"Welch","key":"ref83"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3050526"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3137266"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1145\/3086466"},{"volume-title":"Complex matrix multiplication operations with data pre-conditioning in a high performance computing architecture","year":"2014","author":"Eichenberger","key":"ref87"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1137\/0613043"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1137\/19M1282040"},{"issue":"7","key":"ref90","first-page":"595","article-title":"Multiplication of multidigit numbers on automata","volume":"7","author":"Karatsuba","year":"1963","journal-title":"Sov. Phys. Doklady"},{"key":"ref91","first-page":"224","article-title":"Generalizations of the Karatsuba algorithm for efficient Implementations","volume":"2006","author":"Weimerskirch","year":"2006","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/ICSPCom.2015.7150666"},{"issue":"4","key":"ref93","first-page":"714","article-title":"The complexity of a scheme of functional elements realizing the multiplication of integers","volume":"3","author":"Toom","year":"1963","journal-title":"Soviet Phys. Doklady"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.48550\/arxiv.1710.09412"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/11045245\/10980104-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11045245\/10980104.pdf?arnumber=10980104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T06:15:04Z","timestamp":1750745704000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10980104\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":94,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3565558","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2025,7]]}}}