{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:42:16Z","timestamp":1773376936661,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,6,22]],"date-time":"2025-06-22T00:00:00Z","timestamp":1750550400000},"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":[[2025,6,22]]},"DOI":"10.1109\/isit63088.2025.11195507","type":"proceedings-article","created":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T17:48:08Z","timestamp":1760982488000},"page":"1-6","source":"Crossref","is-referenced-by-count":1,"title":["Approximate Gradient Coding Using Convex Optimization"],"prefix":"10.1109","author":[{"given":"Sifat","family":"Munim","sequence":"first","affiliation":[{"name":"Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,U.S.A,50011"}]},{"given":"Aditya","family":"Ramamoorthy","sequence":"additional","affiliation":[{"name":"Iowa State University,Department of Electrical and Computer Engineering,Ames,IA,U.S.A,50011"}]}],"member":"263","reference":[{"key":"ref1","first-page":"3368","article-title":"Gradient coding: Avoiding stragglers in distributed learning","volume-title":"Intl. Conf. Mach. Learn. (ICML)","author":"Tandon"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3029396"},{"key":"ref3","author":"Charles","year":"2017","journal-title":"Approximate gradient coding via sparse random graphs"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3100110"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849690"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2022.3182943"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.5555\/2685048.2685095"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1561\/0100000006"},{"key":"ref10","volume-title":"Probability and Random Processes","author":"Grimmett","year":"2020"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/S0036144503423264"},{"key":"ref13","first-page":"1","author":"Diamond","year":"2016","journal-title":"CVXPY: A Python-embedded modeling language for convex optimization"},{"key":"ref14","volume-title":"Gurobi Optimizer Reference Manual","year":"2023"},{"key":"ref15","volume-title":"Repository of Approximate Gradient Coding Using Convex Optimization"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"}],"event":{"name":"2025 IEEE International Symposium on Information Theory (ISIT)","location":"Ann Arbor, MI, USA","start":{"date-parts":[[2025,6,22]]},"end":{"date-parts":[[2025,6,27]]}},"container-title":["2025 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11195206\/11195207\/11195507.pdf?arnumber=11195507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:29:27Z","timestamp":1773347367000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11195507\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,22]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit63088.2025.11195507","relation":{},"subject":[],"published":{"date-parts":[[2025,6,22]]}}}