{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,29]],"date-time":"2026-08-29T16:13:35Z","timestamp":1788020015979,"version":"build-2784847793"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006094","name":"University of Delaware","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006094","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2021,4,1]]},"DOI":"10.1109\/tnse.2021.3065272","type":"journal-article","created":{"date-parts":[[2021,3,11]],"date-time":"2021-03-11T21:18:25Z","timestamp":1615497505000},"page":"1600-1613","source":"Crossref","is-referenced-by-count":11,"title":["On Multi-Cascade Influence Maximization: Model, Hardness and Algorithmic Framework"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3247-4019","authenticated-orcid":false,"given":"Guangmo","family":"Tong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ruiqi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0692-7486","authenticated-orcid":false,"given":"Zheng","family":"Dong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Correlated cascades: Compete or cooperate","author":"zarezade","year":"2017","journal-title":"Proc 31st AAAI Conf Artif Intell"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2017.163"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487649"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.07.029"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524472"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396837"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783392"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17572-5_48"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.153"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2014-970"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24829-0_20"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35311-6_1"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723710"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1201\/b17231-3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807843"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2015.06.012"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2017.10.015"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2017.2783190"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.11.006"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850581"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426222"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25280-8_13"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/2380718.2380746"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737485"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00243-8"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1145\/1282100.1282167"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1963405.1963499"},{"key":"ref11","first-page":"339","article-title":"On misinformation containment in online social networks","author":"tong","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref40","first-page":"4663","article-title":"Balancing information exposure in social networks","author":"garimella","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835934"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.70"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593670"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723734"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915207"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.40"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.34"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3162007"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8462-3_7"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.52"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972818.33"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0102199"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2018.2818661"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"ref45","author":"vazirani","year":"2013","journal-title":"Approximation Algorithms"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2002.1181966"},{"key":"ref47","doi-asserted-by":"crossref","DOI":"10.1038\/srep02980","article-title":"The anatomy of a scientific rumor","volume":"3","author":"domenico","year":"2013","journal-title":"Sci Rep"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055412"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2740284"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.05.007"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/9475902\/09376649.pdf?arnumber=9376649","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:53:30Z","timestamp":1652194410000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9376649\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4,1]]},"references-count":53,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2021.3065272","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4,1]]}}}