{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T17:20:47Z","timestamp":1787937647963,"version":"build-2784847793"},"reference-count":24,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T00:00:00Z","timestamp":1654041600000},"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":["No. CCF-2101388"],"award-info":[{"award-number":["No. CCF-2101388"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSF Research Experiences for Undergraduates (REU) supplement award"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1109\/tcomm.2022.3165201","type":"journal-article","created":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T19:33:15Z","timestamp":1649273595000},"page":"3641-3654","source":"Crossref","is-referenced-by-count":7,"title":["Rook Coding for Batch Matrix Multiplication"],"prefix":"10.1109","volume":"70","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7120-7362","authenticated-orcid":false,"given":"Pedro","family":"Soto","sequence":"first","affiliation":[{"name":"Graduate Center, The City University of New York, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaodi","family":"Fan","sequence":"additional","affiliation":[{"name":"Graduate Center, The City University of New York, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Angel","family":"Saldivia","sequence":"additional","affiliation":[{"name":"Microsoft, Redmond, WA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8266-7463","authenticated-orcid":false,"given":"Jun","family":"Li","sequence":"additional","affiliation":[{"name":"Queens College and the Graduate Center, The City University of New York, New York, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174239"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3102980.3103005"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref4","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Tandon"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref7","first-page":"4406","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","author":"Yu"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2015.2506161"},{"key":"ref10","first-page":"185","article-title":"Effective straggler mitigation: Attack of the clones","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","author":"Ananthanarayanan"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2496593"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2637364.2592042"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2622248"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3104970"},{"key":"ref15","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist. (AISTATS)","author":"Yu"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3064827"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0908017"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1988-0917825-9"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0898-1221(98)00091-1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1137\/08073408x"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0129-8_3"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174167"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174230"},{"key":"ref24","article-title":"Fast multipoint evaluation on n arbitrary points","author":"Gauthier","year":"2007"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/26\/9796992\/9750133-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9796992\/09750133.pdf?arnumber=9750133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T00:19:35Z","timestamp":1705537175000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9750133\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6]]},"references-count":24,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2022.3165201","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,6]]}}}