{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T02:26:01Z","timestamp":1747189561914,"version":"3.40.5"},"reference-count":14,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","funder":[{"DOI":"10.13039\/100006227","name":"Lawrence Livermore National Laboratory","doi-asserted-by":"publisher","award":["DE-AC52-07NA27344","21-FS-007","22-ERD-045","LLNL-JRNL-853510-DRAFT"],"award-info":[{"award-number":["DE-AC52-07NA27344","21-FS-007","22-ERD-045","LLNL-JRNL-853510-DRAFT"]}],"id":[{"id":"10.13039\/100006227","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-2144181","DMS-2324958"],"award-info":[{"award-number":["DMS-2144181","DMS-2324958"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Sci. Comput."],"published-print":{"date-parts":[[2024,10,31]]},"DOI":"10.1137\/23m1605648","type":"journal-article","created":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T08:19:21Z","timestamp":1728461961000},"page":"A3258-A3281","source":"Crossref","is-referenced-by-count":0,"title":["Modifying the Asynchronous Jacobi Method for Data Corruption Resilience"],"prefix":"10.1137","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3855-694X","authenticated-orcid":true,"given":"Christopher J.","family":"Vogl","sequence":"first","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA 94550 USA."}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2491-0725","authenticated-orcid":true,"given":"Zachary R.","family":"Atkins","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Colorado, Boulder, CO 80309 USA."}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7140-3614","authenticated-orcid":true,"given":"Alyson","family":"Fox","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA 94550 USA."}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2995-7426","authenticated-orcid":true,"given":"Agnieszka","family":"Mi\u0229dlar","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Virginia Tech, Blacksburg, VA 24060 USA."}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6720-8805","authenticated-orcid":true,"given":"Colin","family":"Ponce","sequence":"additional","affiliation":[{"name":"Lawrence Livermore National Laboratory, Livermore, CA 94550 USA."}]}],"member":"351","published-online":{"date-parts":[[2024,10,9]]},"reference":[{"key":"ref1","first-page":"1","author":"IEEE, 754-2019\u2014IEEE Standard for Floating-point Arithmetic","year":"2019","journal-title":"(revision of IEEE 754-2008)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2005.2"},{"key":"ref4","volume":"53","author":"Canal R.","year":"2020","journal-title":"ACM Comput. Surv."},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(69)90028-7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-0427(00)00409-X"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s11075-017-0342-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.3390\/s21175922"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2915983"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2780856"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2018.2816644"},{"key":"ref18","doi-asserted-by":"crossref","unstructured":"A. Olshevsky, I. C. Paschalidis, and A. Spiridonoff, Fully asynchronous push-sum with growing intercommunication intervals, in 2018 Annual American Control Conference (ACC), IEEE, New York, 2018, pp. 591\u2013596, https:\/\/doi.org\/10.23919\/ACC.2018.8431414.","DOI":"10.23919\/ACC.2018.8431414"},{"key":"ref19","unstructured":"C. Ponce, K. Harter, A. Fox, and C. J. Vogl, Skywing, https:\/\/doi.org\/10.11578\/dc.20221110.2, 2022."},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2020.102896"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1631\/FITEE.1800590"}],"container-title":["SIAM Journal on Scientific Computing"],"original-title":[],"language":"en","deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T08:19:25Z","timestamp":1728461965000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/23M1605648"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,9]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10,31]]}},"alternative-id":["10.1137\/23M1605648"],"URL":"https:\/\/doi.org\/10.1137\/23m1605648","relation":{},"ISSN":["1064-8275","1095-7197"],"issn-type":[{"type":"print","value":"1064-8275"},{"type":"electronic","value":"1095-7197"}],"subject":[],"published":{"date-parts":[[2024,10,9]]}}}