{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T22:45:15Z","timestamp":1769553915873,"version":"3.49.0"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,11,1]],"date-time":"2022-11-01T00:00:00Z","timestamp":1667260800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF CAREER","doi-asserted-by":"publisher","award":["DMS 1348721"],"award-info":[{"award-number":["DMS 1348721"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DMS 2011140"],"award-info":[{"award-number":["DMS 2011140"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF BIGDATA","doi-asserted-by":"publisher","award":["DMS 1740325"],"award-info":[{"award-number":["DMS 1740325"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["DMS 2211318"],"award-info":[{"award-number":["DMS 2211318"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1109\/tit.2022.3202733","type":"journal-article","created":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T21:40:36Z","timestamp":1661809236000},"page":"7515-7527","source":"Crossref","is-referenced-by-count":5,"title":["Paving the Way for Consensus: Convergence of Block Gossip Algorithms"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1449-2574","authenticated-orcid":false,"given":"Jamie","family":"Haddock","sequence":"first","affiliation":[{"name":"Department of Mathematics, Harvey Mudd College, Claremont, CA, USA"}]},{"given":"Benjamin","family":"Jarman","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of California at Los Angeles, Los Angeles, CA, USA"}]},{"given":"Chen","family":"Yap","sequence":"additional","affiliation":[{"name":"Planet Labs Inc., San Francisco, CA, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6427110"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3390\/s19183829"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IPSN.2005.1440896"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(89)90021-X"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2006.08.010"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2016247"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2052531"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.908946"},{"key":"ref11","article-title":"Privacy preserving randomized gossip algorithms","author":"Hanzely","year":"2017","journal-title":"arXiv:1706.07636"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2013.01.001"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2817461"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/060678324"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ECC.2015.7330819"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2021.3113285"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/19M1251643"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2012.12.022"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2015.06.027"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2060050"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2952082"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.887293"},{"issue":"2","key":"ref23","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1023\/A:1022398014630","article-title":"Block-projections algorithms with blocks containing mutually orthogonal rows and columns","volume":"39","author":"Popa","year":"1999","journal-title":"BIT Numer. Math."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0346-0158-0_34"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2016.7905880"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10543-010-0265-5"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.2307\/2285509"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"ref29","first-page":"335","article-title":"Angen\u00e4herte aufl\u00f6sung von systemen linearer gleichungen","author":"Kaczmarz","year":"1937","journal-title":"Bull. Int. Acad. Polonaise Sci. Lett. A"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9030-4"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1137\/120889897"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(81)90139-7"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF01396365"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/19M1307044"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0163-9"},{"key":"ref36","article-title":"Statistical models applied to the rating of sports teams","author":"Massey","year":"1077"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0419-x"},{"key":"ref38","volume-title":"The Stanford GraphBase: A Platform for Combinatorial Computing","author":"Knuth","year":"1993"},{"key":"ref39","doi-asserted-by":"crossref","DOI":"10.25080\/TCWV9851","article-title":"Exploring network structure, dynamics, and function using NetworkX","author":"Hagberg","year":"2008"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevResearch.2.023041"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/9925894\/9869773-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/9925894\/09869773.pdf?arnumber=9869773","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T19:53:28Z","timestamp":1727898808000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9869773\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11]]},"references-count":40,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3202733","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,11]]}}}