{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T02:07:20Z","timestamp":1772590040063,"version":"3.50.1"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2019,1,28]],"date-time":"2019-01-28T00:00:00Z","timestamp":1548633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2019,1,28]]},"abstract":"<jats:p>Diffusion speed and scale depend on all kinds of information, not just which users have the most or fewest connections.<\/jats:p>","DOI":"10.1145\/3224203","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T13:16:22Z","timestamp":1548767782000},"page":"61-67","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":55,"title":["Even central users do not always drive information diffusion"],"prefix":"10.1145","volume":"62","author":[{"given":"Chao","family":"Gao","sequence":"first","affiliation":[{"name":"Southwest University, Chongqing, China and Humboldt University of Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhen","family":"Su","sequence":"additional","affiliation":[{"name":"Southwest University, Chongqing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiming","family":"Liu","sequence":"additional","affiliation":[{"name":"Hong Kong Baptist University, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Kurths","sequence":"additional","affiliation":[{"name":"Humboldt University of Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,1,28]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1134271.1134277"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.74.47"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.008"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2629438"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184338"},{"key":"e_1_2_1_6_1","first-page":"1","volume":"47","author":"Gao C.","year":"2017","unstructured":"Gao , C. and Liu , J.M. Network -based modeling for characterizing human collective behaviors during extreme events. IEEE Transactions on System, Man , and Cybernetics : Systems 47 , 1 ( Jan. 2017 ), 171--183. Gao, C. and Liu, J.M. Network-based modeling for characterizing human collective behaviors during extreme events. IEEE Transactions on System, Man, and Cybernetics: Systems 47, 1 (Jan. 2017), 171--183.","journal-title":"Systems"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2012.29"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229058"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.68.065103"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400214.1400220"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1038\/nphys1746"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.78.046110"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature10011"},{"key":"e_1_2_1_15_1","volume-title":"The Telegraph (May 18","author":"McGoogan C.","year":"2017","unstructured":"McGoogan , C. What is WannaCry and how does ransomware work ? The Telegraph (May 18 , 2017 ); http:\/\/www.telegraph.co.uk\/technology\/0\/ransomware-does-work\/ McGoogan, C. What is WannaCry and how does ransomware work? The Telegraph (May 18, 2017); http:\/\/www.telegraph.co.uk\/technology\/0\/ransomware-does-work\/"},{"key":"e_1_2_1_16_1","first-page":"8","volume":"113","author":"Nematzadeh A.","year":"2014","unstructured":"Nematzadeh , A. , Ferrara , E. , Flammini , A. , and Ahn , Y.-Y. Optimal network modularity for information diffusion. Physical Review Letters 113 , 8 ( Aug. 2014 ), 088701. Nematzadeh, A., Ferrara, E., Flammini, A., and Ahn, Y.-Y. Optimal network modularity for information diffusion. Physical Review Letters 113, 8 (Aug. 2014), 088701.","journal-title":"Physical Review Letters"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0307545100"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2014.01.002"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6633\/aa5398"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2501654.2501657"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2007.1001"}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3224203","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3224203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:06Z","timestamp":1750210746000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3224203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,28]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,1,28]]}},"alternative-id":["10.1145\/3224203"],"URL":"https:\/\/doi.org\/10.1145\/3224203","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,28]]},"assertion":[{"value":"2019-01-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}