{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:41:26Z","timestamp":1771702886598,"version":"3.50.1"},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"Foundation for Innovative Research Groups of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61221061"],"award-info":[{"award-number":["61221061"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61271194"],"award-info":[{"award-number":["61271194"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"China National 973 Program","award":["2011CB707000"],"award-info":[{"award-number":["2011CB707000"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/lcomm.2014.2344047","type":"journal-article","created":{"date-parts":[[2014,7,30]],"date-time":"2014-07-30T20:44:58Z","timestamp":1406753098000},"page":"470-473","source":"Crossref","is-referenced-by-count":6,"title":["On the Performance of Multi-Message Algebraic Gossip Algorithms in Dynamic Random Geometric Graphs"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6326-7114","authenticated-orcid":false,"given":"Gang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zun","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620341"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2247462"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/1300000014"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874532"},{"key":"ref6","author":"vasudevan","year":"2009","journal-title":"Algebraic gossip on arbitrary networks"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261654"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513272"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.060112.120632"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177753"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/8309483\/06868190.pdf?arnumber=6868190","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:28:32Z","timestamp":1642004912000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6868190\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":14,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2014.2344047","relation":{},"ISSN":["1089-7798"],"issn-type":[{"value":"1089-7798","type":"print"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}