{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,18]],"date-time":"2024-08-18T01:12:10Z","timestamp":1723943530510},"reference-count":13,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437459","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"source":"Crossref","is-referenced-by-count":9,"title":["Coding for a Single Sparse Inverse Problem"],"prefix":"10.1109","author":[{"given":"Yaoqing","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pulkit","family":"Grover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soummya","family":"Kar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","author":"yang","year":"2018","journal-title":"Coded iterative computing using substitute decoding"},{"key":"ref11","first-page":"709","article-title":"Coded distributed computing for inverse problems","author":"yang","year":"2017","journal-title":"NIPS"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511513"},{"key":"ref13","first-page":"539","article-title":"Learning to discover social circles in ego networks","author":"leskovec","year":"2012","journal-title":"NIPS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541478"},{"key":"ref3","first-page":"655","article-title":"Power iteration clustering","author":"lin","year":"2010","journal-title":"ICML"},{"key":"ref6","first-page":"2092","article-title":"Short-dot: Computing large linear transforms distributedly using coded short dot products","author":"dutta","year":"2016","journal-title":"NIPS"},{"key":"ref5","article-title":"Gradient coding","author":"tandon","year":"2017","journal-title":"ICML"},{"key":"ref8","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"NIPS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2756959"},{"key":"ref2","first-page":"912","article-title":"Semi-supervised learning using gaussian fields and harmonic functions","author":"zhu","year":"2003","journal-title":"ICML"},{"key":"ref1","article-title":"The pagerank citation ranking: Bringing order to the web","author":"page","year":"1999","journal-title":"Stanford Info Lab Technical Report"},{"key":"ref9","first-page":"5440","article-title":"Straggler mitigation $\\text{in}$ distributed optimization through data encoding","author":"karakus","year":"2017","journal-title":"NIPS"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","location":"Vail, CO, USA","start":{"date-parts":[[2018,6,17]]},"end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437459.pdf?arnumber=8437459","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T04:09:12Z","timestamp":1598242152000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437459\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437459","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}