{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:51Z","timestamp":1773377811466,"version":"3.50.1"},"reference-count":19,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834447","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"820-825","source":"Crossref","is-referenced-by-count":7,"title":["Identifying Reliable Machines for Distributed Matrix-Vector Multiplication"],"prefix":"10.1109","author":[{"given":"Sarthak","family":"Jain","sequence":"first","affiliation":[{"name":"University of Minnesota,Minneapolis,USA,MN 55455"}]},{"given":"Martina","family":"Cardone","sequence":"additional","affiliation":[{"name":"University of Minnesota,Minneapolis,USA,MN 55455"}]},{"given":"Soheil","family":"Mohajer","sequence":"additional","affiliation":[{"name":"University of Minnesota,Minneapolis,USA,MN 55455"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437563"},{"key":"ref11","article-title":"Efficient replication for straggler mitigation in distributed computing","author":"behrouzi-far","year":"2020"},{"key":"ref12","article-title":"Secure private and adaptive matrix multiplication beyond the singleton bound","author":"hofmeister","year":"2021"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref14","first-page":"2100","article-title":"short-dot”: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"Proceedings of the 30th International Conference on Neural Information Processing Systems"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS53621.2022.00067"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849371"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177731363"},{"key":"ref18","volume":"2","author":"du","year":"2000","journal-title":"Combinatorial Group Testing and its Applications"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2148691"},{"key":"ref4","article-title":"Folding@Home","year":"0"},{"key":"ref3","article-title":"IBM World Community Grid","year":"0"},{"key":"ref6","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume":"70","author":"tandon","year":"2017","journal-title":"Proc of the International Conference on Machine Learning (ICML)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989337"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref7","first-page":"4406","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"Adv in Neural Info Proc Syst"},{"key":"ref2","article-title":"Lagrange coded computing: Optimal design for resiliency, security and privacy","author":"yu","year":"2018"},{"key":"ref1","author":"goodfellow","year":"2016","journal-title":"Deep Learning"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ITW48936.2021.9611400"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834447.pdf?arnumber=9834447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:14Z","timestamp":1773347714000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834447\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834447","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}