{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:05:52Z","timestamp":1730196352452,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1109\/allerton.2012.6483387","type":"proceedings-article","created":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T16:58:45Z","timestamp":1364403525000},"page":"1438-1444","source":"Crossref","is-referenced-by-count":1,"title":["Extracting influential information sources for gossiping"],"prefix":"10.1109","author":[{"given":"Wenxiang","family":"Dong","sequence":"first","affiliation":[]},{"given":"Wenyi","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Guo","family":"Wei","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.906655"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1137\/0137041"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0921"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.04.002"},{"journal-title":"Algorithms for deterministic and stochastic scheduling","year":"2001","author":"uetz","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096245"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.924648"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2046593"},{"key":"2","first-page":"1","volume":"3","author":"shah","year":"2009","journal-title":"Gossip Algorithms"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90059-9"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675796"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973075.114"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02930-1_31"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.909171"},{"key":"4","article-title":"Epidemic routing for partially-connected ad hoc networks","author":"vahdat","year":"2000","journal-title":"Duke Tech Report CS-2000-06"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.129"}],"event":{"name":"2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2012,10,1]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2012,10,5]]}},"container-title":["2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6475439\/6483185\/06483387.pdf?arnumber=6483387","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T22:29:51Z","timestamp":1490221791000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6483387\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/allerton.2012.6483387","relation":{},"subject":[],"published":{"date-parts":[[2012,10]]}}}