{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,26]],"date-time":"2025-12-26T07:12:46Z","timestamp":1766733166249,"version":"3.37.3"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T00:00:00Z","timestamp":1630454400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1109\/jsait.2021.3102853","type":"journal-article","created":{"date-parts":[[2021,8,5]],"date-time":"2021-08-05T20:18:38Z","timestamp":1628194718000},"page":"919-930","source":"Crossref","is-referenced-by-count":4,"title":["Sequential Gradient Coding for Packet-Loss Networks"],"prefix":"10.1109","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0089-676X","authenticated-orcid":false,"given":"M. Nikhil","family":"Krishnan","sequence":"first","affiliation":[]},{"given":"Erfan","family":"Hosseini","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2331-8965","authenticated-orcid":false,"given":"Ashish","family":"Khisti","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","volume":"89","author":"yu","year":"2019","journal-title":"Proc Int Conf Artif Intell Stat (AISTATS)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2974149"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849615"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682404"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849684"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174120"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/040616413"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.2992721"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2005.03.010"},{"key":"ref3","first-page":"5606","article-title":"Communication-computation efficient gradient coding","volume":"80","author":"ye","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref5","first-page":"4403","article-title":"Polynomial codes: An optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Proc Annu Conf Neural Inf Process Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849235"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref9","first-page":"253","article-title":"Random Khatri-Rao-Product codes for numerically stable distributed matrix multiplication","author":"subramaniam","year":"2019","journal-title":"Proc Allerton Conf Commun Control Comput"},{"key":"ref1","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume":"70","author":"tandon","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00062"},{"journal-title":"ErasureHead Distributed gradient descent without delays using approximate gradient coding","year":"2019","author":"wang","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8683267"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1561\/0100000103"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3366700"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2016.02.034"},{"key":"ref25","first-page":"1","article-title":"Coded sequential matrix multiplication for straggler mitigation","volume":"33","author":"krishnan","year":"2020","journal-title":"Proc Annu Conf Neural Inf Process Syst"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9540917\/09507554.pdf?arnumber=9507554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,17]],"date-time":"2021-11-17T23:18:02Z","timestamp":1637191082000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9507554\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9]]},"references-count":28,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2021.3102853","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2021,9]]}}}