{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:26:25Z","timestamp":1740101185276,"version":"3.37.3"},"reference-count":33,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T00:00:00Z","timestamp":1667779200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100019186","name":"MIT Portugal","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100019186","id-type":"DOI","asserted-by":"publisher"}]},{"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,11,7]]},"DOI":"10.1109\/cloudnet55617.2022.9978858","type":"proceedings-article","created":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T18:50:52Z","timestamp":1671216652000},"page":"257-261","source":"Crossref","is-referenced-by-count":1,"title":["Distributed Computations with Layered Resolution"],"prefix":"10.1109","author":[{"given":"Homa","family":"Esfahanizadeh","sequence":"first","affiliation":[{"name":"MIT,RLE,Cambridge,MA,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alejandro","family":"Cohen","sequence":"additional","affiliation":[{"name":"Technion,Faculty of Electrical and Computer Engineering,Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muriel","family":"Medard","sequence":"additional","affiliation":[{"name":"MIT,RLE,Cambridge,MA,USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomo","family":"Shamai Shitz","sequence":"additional","affiliation":[{"name":"Technion,Faculty of Electrical and Computer Engineering,Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1080\/05695557608975111"},{"key":"ref32","first-page":"201","author":"bhat","year":"2015","journal-title":"The General Queue G\/G\/1 and Approximations"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.926389"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/18.490552"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3177609"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927558"},{"key":"ref13","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2954338"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2926704"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISTC.2016.7593105"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636047"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262778"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2010.100409"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2017.8262883"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT50566.2022.9834549"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref6","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"NIPS"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2019.8682347"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437852"},{"key":"ref9","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","volume":"30","author":"yu","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3102279"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849235"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.3390\/e23010120"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM48880.2022.9796977"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.3390\/e22020182"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ITW44776.2019.8989156"}],"event":{"name":"2022 IEEE 11th International Conference on Cloud Networking (CloudNet)","start":{"date-parts":[[2022,11,7]]},"location":"Paris, France","end":{"date-parts":[[2022,11,10]]}},"container-title":["2022 IEEE 11th International Conference on Cloud Networking (CloudNet)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9978662\/9978738\/09978858.pdf?arnumber=9978858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T19:36:49Z","timestamp":1673897809000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9978858\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,7]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/cloudnet55617.2022.9978858","relation":{},"subject":[],"published":{"date-parts":[[2022,11,7]]}}}