{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:47:27Z","timestamp":1742975247776,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":13,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610921"},{"type":"electronic","value":"9789819610938"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-981-96-1093-8_33","type":"book-chapter","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:18:59Z","timestamp":1739999939000},"page":"394-406","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Distributed Algorithm for\u00a0Rumor Blocking on\u00a0Social Networks"],"prefix":"10.1007","author":[{"given":"Ruidong","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenhua","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaqian","family":"Zhao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rengang","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xingjian","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-981-16-8403-6_53","volume-title":"Advances in Data Computing, Communication and Security: Proceedings of I3CS2021","author":"S Bora","year":"2022","unstructured":"Bora, S., Rao, S.: Target node protection from rumours in online social networks. In: Verma, P., Charan, C., Fernando, X., Ganesan, S. (eds.) Advances in Data Computing, Communication and Security: Proceedings of I3CS2021, pp. 581\u2013589. Springer Nature Singapore, Singapore (2022). https:\/\/doi.org\/10.1007\/978-981-16-8403-6_53"},{"key":"33_CR2","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":"33_CR3","doi-asserted-by":"crossref","unstructured":"Budak, C., Agrawal, D., El\u00a0Abbadi, A.: Limiting the spread of misinformation in social networks. In: Proceedings of the 20th International Conference on World Wide Web, pp. 665\u2013674 (2011)","DOI":"10.1145\/1963405.1963499"},{"key":"33_CR4","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 (2003)","DOI":"10.1145\/956750.956769"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Kim, J., Kim, S.K., Yu, H.: Scalable and parallelizable processing of influence maximization for large-scale social networks? In: 2013 IEEE 29th International Conference on Data Engineering (ICDE), pp. 266\u2013277. IEEE (2013)","DOI":"10.1109\/ICDE.2013.6544831"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.tcs.2020.08.030","volume":"840","author":"Q Ni","year":"2020","unstructured":"Ni, Q., Guo, J., Huang, C., Wu, W.: Community-based rumor blocking maximization in social networks: Algorithms and analysis. Theoret. Comput. Sci. 840, 257\u2013269 (2020)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"33_CR7","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.76.036106","volume":"76","author":"UN Raghavan","year":"2007","unstructured":"Raghavan, U.N., Albert, R., Kumara, S.: Near linear time algorithm to detect community structures in large-scale networks. Phys. Rev. E 76(3), 036106 (2007)","journal-title":"Phys. Rev. E"},{"issue":"5","key":"33_CR8","doi-asserted-by":"publisher","first-page":"1379","DOI":"10.1109\/TPDS.2014.2320515","volume":"26","author":"G Song","year":"2014","unstructured":"Song, G., Zhou, X., Wang, Y., Xie, K.: Influence maximization on large-scale mobile social network: a divide-and-conquer method. IEEE Trans. Parallel Distrib. Syst. 26(5), 1379\u20131392 (2014)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"2","key":"33_CR9","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1109\/TCSS.2018.2818661","volume":"5","author":"G Tong","year":"2018","unstructured":"Tong, G., Wu, W., Du, D.Z.: Distributed rumor blocking with multiple positive cascades. IEEE Trans. Comput. Social Syst. 5(2), 468\u2013480 (2018)","journal-title":"IEEE Trans. Comput. Social Syst."},{"issue":"2","key":"33_CR10","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1109\/TNSE.2017.2783190","volume":"7","author":"G Tong","year":"2017","unstructured":"Tong, G., et al.: An efficient randomized algorithm for rumor blocking in online social networks. IEEE Trans. Netw. Sci. Eng. 7(2), 845\u2013854 (2017)","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"33_CR11","unstructured":"Wang, S., Zhao, X., Chen, Y., Li, Z., Zhang, K., Xia, J.: Negative influence minimizing by blocking nodes in social networks. In: Proceedings of the 17th AAAI Conference on Late-Breaking Developments in the Field of Artificial Intelligence, pp. 134\u2013136 (2013)"},{"issue":"4","key":"33_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3441455","volume":"15","author":"R Yan","year":"2021","unstructured":"Yan, R., Li, Y., Li, D., Wang, Y., Zhu, Y., Wu, W.: A stochastic algorithm based on reverse sampling technique to fight against the cyberbullying. ACM Trans. Knowl. Discov. Data (TKDD) 15(4), 1\u201322 (2021)","journal-title":"ACM Trans. Knowl. Discov. Data (TKDD)"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Yang, D.N., Hung, H.J., Lee, W.C., Chen, W.: Maximizing acceptance probability for active friending in online social networks. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 713\u2013721 (2013)","DOI":"10.1145\/2487575.2487599"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1093-8_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:19:11Z","timestamp":1739999951000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1093-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610921","9789819610938"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1093-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}