{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T20:24:41Z","timestamp":1774124681797,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T00:00:00Z","timestamp":1601164800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T00:00:00Z","timestamp":1601164800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1747818"],"award-info":[{"award-number":["1747818"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["91324012"],"award-info":[{"award-number":["91324012"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Project of Promoting Scientific Research Ability of Excellent Young Teachers in University of Chinese Academy of Sciences"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1007\/s11280-020-00841-8","type":"journal-article","created":{"date-parts":[[2020,9,27]],"date-time":"2020-09-27T08:02:33Z","timestamp":1601193753000},"page":"229-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":32,"title":["Robust rumor blocking problem with uncertain rumor sources in social networks"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8147-8254","authenticated-orcid":false,"given":"Jianming","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Smita","family":"Ghosh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weili","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,27]]},"reference":[{"key":"841_CR1","doi-asserted-by":"crossref","unstructured":"Aslay, C., Lakshmanan, L.V.S., Lu, W., Xiao, X.: Influence maximization in online social networks. In: Proceedings of the Eleventh ACM International Conference on Web Search and Data Mining, pp. 775\u2013776. ACM (2018)","DOI":"10.1145\/3159652.3162007"},{"key":"841_CR2","unstructured":"Batagelj, V., Mrvar, A.: Pajek datasets. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/ (2006)"},{"key":"841_CR3","doi-asserted-by":"crossref","unstructured":"Bharathi, S., Kempe, D., Salek, M.: Competitive influence maximization in social networks. In: International Workshop on Web and Internet Economics, pp. 306\u2013311. Springer (2007)","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"841_CR4","unstructured":"Bian, A.A., Buhmann, J.M, Krause, A., Tschiatschek, S.: Guarantees for greedy maximization of non-submodular functions with applications. arXiv:1703.02100 (2017)"},{"key":"841_CR5","doi-asserted-by":"crossref","unstructured":"Borgs, C., Brautbar, M., Chayes, J., Lucier, B.: Maximizing social influence in nearly optimal time. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pp. 946\u2013957. SIAM (2014)","DOI":"10.1137\/1.9781611973402.70"},{"key":"841_CR6","doi-asserted-by":"crossref","unstructured":"Budak, C., Agrawal, D., El Abbadi, A: Limiting the spread of misinformation in social networks. In: Proceedings of the 20th international conference on World wide web, pp. 665\u2013674. ACM (2011)","DOI":"10.1145\/1963405.1963499"},{"key":"841_CR7","unstructured":"Burkitt, L.: Fearing radiation, chinese rush to buy table salt. The Wall Street Journal (2011)"},{"key":"841_CR8","doi-asserted-by":"crossref","unstructured":"Chen, W., Lin, T., Tan, Z., Zhao, M., Zhou, X.: Robust influence maximization. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 795\u2013804. ACM (2016)","DOI":"10.1145\/2939672.2939745"},{"issue":"5","key":"841_CR9","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539797315306","volume":"29","author":"P Dagum","year":"2000","unstructured":"Dagum, P., Karp, R., Luby, M., Ross, S.: An optimal algorithm for monte carlo estimation. SIAM J. Comput. 29(5), 1484\u20131496 (2000)","journal-title":"SIAM J. Comput."},{"key":"841_CR10","unstructured":"Das, A., Kempe, D.: Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. arXiv:1102.3975 (2011)"},{"key":"841_CR11","doi-asserted-by":"crossref","unstructured":"Du, N., Liang, Y., Balcan, M-F, Gomez-Rodriguez, M., Zha, H., Le, S.: Scalable influence maximization for multiple products in continuous-time diffusion networks. J. Mach. Learn. Res. 18(2), 1\u201345 (2017)","DOI":"10.1145\/2824253"},{"issue":"4","key":"841_CR12","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J ACM (JACM) 45(4), 634\u2013652 (1998)","journal-title":"J ACM (JACM)"},{"key":"841_CR13","unstructured":"Fujishige, S.: Submodular functions and optimization, vol. 58. Elsevier (2005)"},{"key":"841_CR14","doi-asserted-by":"crossref","unstructured":"Goyal, A., Lu, W., Lakshmanan, L.VS: Simpath: An efficient algorithm for influence maximization under the linear threshold model. In: 2011 IEEE 11th International Conference on Data Mining (ICDM), pp. 211\u2013220. IEEE (2011)","DOI":"10.1109\/ICDM.2011.132"},{"key":"841_CR15","doi-asserted-by":"crossref","unstructured":"Kempe, D., Kleinberg, J., Tardos, \u00c9: Maximizing the spread of influence through a social network. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 137\u2013146. ACM (2003)","DOI":"10.1145\/956750.956769"},{"issue":"2","key":"841_CR16","first-page":"9","volume":"3","author":"M Kimura","year":"2009","unstructured":"Kimura, M., Saito, K., Motoda, H.: Blocking links to minimize contamination spread in a social network. ACM Trans Knowl Discov Data (TKDD) 3(2), 9 (2009)","journal-title":"ACM Trans Knowl Discov Data (TKDD)"},{"key":"841_CR17","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Krause, A., Guestrin, C., Faloutsos, C., VanBriesen, J., Glance, N.: Cost-effective outbreak detection in networks. In: Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining, pp. 420\u2013429. ACM (2007)","DOI":"10.1145\/1281192.1281239"},{"key":"841_CR18","doi-asserted-by":"crossref","unstructured":"Li, S., Zhu, Y., Li, D., Kim, D., Huang, H.: Rumor restriction in online social networks. In: 2013 IEEE 32nd International Performance Computing and Communications Conference (IPCCC), pp. 1\u201310. IEEE (2013)","DOI":"10.1109\/PCCC.2013.6742780"},{"key":"841_CR19","unstructured":"Lowalekar, M., Varakantham, P., Kumar, A.: Robust influence maximization.. In: Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, pp. 1395\u20131396. International Foundation for Autonomous Agents and Multiagent Systems (2016)"},{"key":"841_CR20","unstructured":"Morozov, E.: Swine flu: Twitters power to misinform Foreign policy (2009)"},{"key":"841_CR21","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0304-0208(08)73471-6","volume":"11","author":"GL Nemhauser","year":"1981","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Maximizing submodular set functions: formulations and analysis of algorithms. Stud Graph Discret Programm 11, 279\u2013301 (1981)","journal-title":"Stud Graph Discret Programm"},{"issue":"1","key":"841_CR22","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functionsi. Math Programm 14(1), 265\u2013294 (1978)","journal-title":"Math Programm"},{"key":"841_CR23","doi-asserted-by":"crossref","unstructured":"Nguyen, H.T., Thai, M y T, Dinh, T.N.: Stop-and-stare Optimal sampling algorithms for viral marketing in billion-scale networks.. In: Proceedings of the 2016 International Conference on Management of Data, pp. 695\u2013710. ACM (2016)","DOI":"10.1145\/2882903.2915207"},{"issue":"6","key":"841_CR24","doi-asserted-by":"publisher","first-page":"1084","DOI":"10.1109\/JSAC.2013.130610","volume":"31","author":"H Nguyen","year":"2013","unstructured":"Nguyen, H., Zheng, R.: On budgeted influence maximization in social networks. IEEE J Sel Areas Commun 31(6), 1084\u20131094 (2013)","journal-title":"IEEE J Sel Areas Commun"},{"key":"841_CR25","doi-asserted-by":"crossref","unstructured":"Ohsaka, N., Akiba, T., Yoshida, Y., Kawarabayashi, K-i: Fast and accurate influence maximization on large networks with pruned monte-carlo simulations. In: AAAI, pp. 138\u2013144 (2014)","DOI":"10.1609\/aaai.v28i1.8726"},{"issue":"2","key":"841_CR26","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.socnet.2011.07.001","volume":"35","author":"T Opsahl","year":"2013","unstructured":"Opsahl, T.: Triadic closure in two-mode networks: Redefining the global and local clustering coefficients. Soc. Netw. 35(2), 159\u2013167 (2013)","journal-title":"Soc. Netw."},{"key":"841_CR27","doi-asserted-by":"crossref","unstructured":"Ping, Y., Cao, Z., Zhu, H.: Sybil-aware least cost rumor blocking in social networks. In: 2014 IEEE Global Communications Conference (GLOBECOM), pp. 692\u2013697. IEEE (2014)","DOI":"10.1109\/GLOCOM.2014.7036888"},{"key":"841_CR28","doi-asserted-by":"crossref","unstructured":"Rossi, Ryxan A. , Ahmed, NK.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9277"},{"issue":"2","key":"841_CR29","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1287\/moor.2016.0842","volume":"42","author":"WJ Sviridenko","year":"2017","unstructured":"Sviridenko, WJ., Vondrk, M.J.: Optimal approximation for submodular and supermodular optimization with bounded curvature. Math. Oper. Res. 42 (2), 1197\u20131218 (2017)","journal-title":"Math. Oper. Res."},{"key":"841_CR30","doi-asserted-by":"crossref","unstructured":"Tang, Y., Shi, Y., Xiao, X.: Influence maximization in near-linear time A martingale approach.. In: Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, pp. 1539\u20131554. ACM (2015)","DOI":"10.1145\/2723372.2723734"},{"key":"841_CR31","doi-asserted-by":"crossref","unstructured":"Tang, Y., Xiao, X., Shi, Y.: Influence maximization: Near-optimal time complexity meets practical efficiency. In: Proceedings of the 2014 ACM SIGMOD international conference on Management of data, pp. 75\u201386. ACM (2014)","DOI":"10.1145\/2588555.2593670"},{"key":"841_CR32","doi-asserted-by":"crossref","unstructured":"Tong, G., Wu, W., Guo, L., Li, D., Liu, C., Liu, B., Du, D-Z: An efficient randomized algorithm for rumor blocking in online social networks. IEEE Transactions on Network Science and Engineering (2017)","DOI":"10.1109\/INFOCOM.2017.8056957"},{"key":"841_CR33","doi-asserted-by":"crossref","unstructured":"Tsai, J., Nguyen, T.H., Tambe, M.: Security games for controlling contagion. In: AAAI (2012)","DOI":"10.1109\/SocialCom.2013.11"},{"key":"841_CR34","doi-asserted-by":"crossref","unstructured":"Wang, B., Ge, C., Fu, L., Li, S., Wang, X., Liu, X.: Drimux: Dynamic rumor influence minimization with user experience in social networks. In: AAAI, vol. 16, pp. 791\u2013797 (2016)","DOI":"10.1609\/aaai.v30i1.10063"},{"issue":"6684","key":"841_CR35","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-worldnetworks. Nature 393(6684), 440 (1998)","journal-title":"Nature"},{"key":"841_CR36","unstructured":"Wu, W., Zhang, Z., Du, D.Z.: Set function optimization. J. Oper. Res. Soc. China (3), 1\u201311 (2018)"},{"issue":"3","key":"841_CR37","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/TCSS.2017.2719056","volume":"4","author":"Y Yang","year":"2017","unstructured":"Yang, Y., Lu, Z., Li, Vi.O., Xu, K.: Noncooperative information diffusion in online social networks under the independent cascade model. IEEE Trans. Comput. Soc. Syst. 4(3), 150\u2013162 (2017)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"841_CR38","doi-asserted-by":"crossref","unstructured":"Zhang, H., Zhang, H., Li, K., Thai, M.T.: Limiting the spread of misinformation while effectively raising awareness in social networks. In: International Conference on Computational Social Networks, pp. 35\u201347. Springer (2015)","DOI":"10.1007\/978-3-319-21786-4_4"},{"key":"841_CR39","unstructured":"Zhu, J., Zhu, J., Ghosh, S., Wu, W., Yuan, J.: Social influence maximization in hypergraph in social network. IEEE Transactions on Network Science and Engineering, pp. 1\u20131 (2018)"},{"key":"841_CR40","doi-asserted-by":"crossref","unstructured":"Zhu, J., Ghosh, S., Zhu, J., Wu, W.: Near-optimal convergent approach for composed influence maximization problem in social networks. IEEE Access 7, 142488\u2013142497 (2019)","DOI":"10.1109\/ACCESS.2019.2944207"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-020-00841-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11280-020-00841-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-020-00841-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,20]],"date-time":"2022-11-20T16:58:09Z","timestamp":1668963489000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11280-020-00841-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,27]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1]]}},"alternative-id":["841"],"URL":"https:\/\/doi.org\/10.1007\/s11280-020-00841-8","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,27]]},"assertion":[{"value":"2 June 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 September 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}