{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:37:03Z","timestamp":1773376623175,"version":"3.50.1"},"reference-count":43,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206923","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2171-2176","source":"Crossref","is-referenced-by-count":3,"title":["On expanding the toolkit of locality-based coded computation to the coordinates of inputs"],"prefix":"10.1109","author":[{"given":"Michael","family":"Rudow","sequence":"first","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Venkatesan","family":"Guruswami","sequence":"additional","affiliation":[{"name":"University of California,Berkeley"}]},{"given":"K.V.","family":"Rashmi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]}],"member":"263","reference":[{"key":"ref13","first-page":"5152","article-title":"Coded sparse matrix multiplication","author":"wang","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref35","article-title":"Approximate gradient coding via sparse random graphs","author":"charles","year":"2017"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2929328"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437871"},{"key":"ref37","article-title":"Learning a code: Machine learning for approximate non-linear coded computation","author":"kosaian","year":"2018"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437549"},{"key":"ref36","first-page":"5434","article-title":"Straggler mitigation in distributed optimization through data encoding","volume":"30","author":"karakus","year":"2017","journal-title":"Advances in neural information processing systems"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2018.00137"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437467"},{"key":"ref11","first-page":"4406","article-title":"Polynomial codes: an optimal design for high-dimensional coded matrix multiplication","author":"yu","year":"2017","journal-title":"NeurIPS"},{"key":"ref33","first-page":"5610","article-title":"Communication-computation efficient gradient coding","author":"ye","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006963"},{"key":"ref32","first-page":"903","article-title":"Draco: Byzantine-resilient distributed training via redundant gradients","author":"chen","year":"2018","journal-title":"International Conference on Machine Learning"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2736066"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408794"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2963864"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3341301.3359654"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636019"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2983165"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3064827"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437669"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676475"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/0613043"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1986.13535"},{"key":"ref25","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-20943-2","author":"herault","year":"2015","journal-title":"Fault-tolerance techniques for highperformance computing"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849451"},{"key":"ref42","first-page":"5095","article-title":"Approximate weighted cr coded matrix multiplication","author":"charalambides","year":"2021","journal-title":"ICASSP"},{"key":"ref41","first-page":"1","article-title":"?-approximate coded matrix multiplication is nearly twice as efficient as exact multiplication","author":"jeong","year":"2021","journal-title":"IEEE Journal on Selected Areas in Information Theory"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518056"},{"key":"ref21","first-page":"1215","article-title":"Lagrange coded computing: Optimal design for resiliency, security, and privacy","author":"yu","year":"2019","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT54713.2023.10206923"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/12.9736"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2008.12.002"},{"key":"ref29","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","author":"tandon","year":"2017","journal-title":"International Conference on Machine Learning"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437473"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2927558"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437852"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2904055"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2016.7848828"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2017.8006960"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3366706"},{"key":"ref40","article-title":"Collage inference: Using coded redundancy for lowering latency variation in distributed image classification systems","author":"narra","year":"2020","journal-title":"ICDCS"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206923.pdf?arnumber=10206923","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:02Z","timestamp":1773347222000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206923\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":43,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206923","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}