{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T03:04:59Z","timestamp":1770779099214,"version":"3.50.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:00:00Z","timestamp":1755820800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U1811263"],"award-info":[{"award-number":["U1811263"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Sci. Eng."],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>In the digital age, social networks have become critical platforms for information dissemination, but they also pose significant risks due to the rapid spread of rumors and misinformation. Existing approaches to rumor control often rely on models that assume a single exposure to anti-rumor information is sufficient to mitigate its impact, overlooking the necessity of multiple impressions for effective behavior change. In this work, we address the Rumor Control with Impression Counts problem by proposing the first-ever Machine Learning (ML)-based solution. Our approach leverages Graph Neural Networks combined with a greedy algorithm to efficiently manage large-scale social networks. To further enhance computational efficiency, we incorporate Evolutionary Optimization, resulting in a method that not only addresses the effectiveness challenges but also scales efficiently with network size. Extensive experiments on real-world datasets demonstrate that our approach outperforms existing methods in both effectiveness and scalability, improving computational efficiency by 1 to 2 orders of magnitude.<\/jats:p>","DOI":"10.1007\/s41019-025-00304-y","type":"journal-article","created":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T07:49:32Z","timestamp":1755848972000},"page":"753-763","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Proactive Rumor Control Using Graph Neural Networks and Evolutionary Optimization"],"prefix":"10.1007","volume":"10","author":[{"given":"Pengfei","family":"Xu","sequence":"first","affiliation":[]},{"given":"Liwei","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1062-0970","authenticated-orcid":false,"given":"Zhiyong","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"issue":"6794","key":"304_CR1","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1038\/35019019","volume":"406","author":"R Albert","year":"2000","unstructured":"Albert R, Jeong H, Barab\u00e1si AL (2000) Error and attack tolerance of complex networks. Nature 406(6794):378","journal-title":"Nature"},{"key":"304_CR2","doi-asserted-by":"crossref","unstructured":"Bharathi S, Kempe D, Salek M (2007) Competitive influence maximization in social networks. In: WINE. pp. 306\u2013311","DOI":"10.1007\/978-3-540-77105-0_31"},{"key":"304_CR3","doi-asserted-by":"crossref","unstructured":"Borodin A, Filmus Y, Oren J (2010) Threshold models for competitive influence in social networks. In: WINE. pp. 539\u2013550","DOI":"10.1007\/978-3-642-17572-5_48"},{"key":"304_CR4","doi-asserted-by":"crossref","unstructured":"Budak C, Agrawal D, El Abbadi A (2011) Limiting the spread of misinformation in social networks. In: WWW. pp. 665\u2013674","DOI":"10.1145\/1963405.1963499"},{"key":"304_CR5","doi-asserted-by":"crossref","unstructured":"Carnes T, Nagarajan C, Wild SM, van Zuylen A (2007) Maximizing influence in a competitive social network: a follower\u2019s perspective. In: ACMicec. pp. 351\u2013360","DOI":"10.1145\/1282100.1282167"},{"key":"304_CR6","doi-asserted-by":"crossref","unstructured":"Fan L, Lu Z, Wu W, Thuraisingham BM, Ma H, Bi Y (2013) Least cost rumor blocking in social networks. In: ICDCS. pp. 540\u2013549","DOI":"10.1109\/ICDCS.2013.34"},{"key":"304_CR7","doi-asserted-by":"crossref","unstructured":"Habiba, Yu Y, Berger-Wolf TY, Saia J (2008) Finding spread blockers in dynamic networks. In: SNAKDD. pp. 55\u201376","DOI":"10.1007\/978-3-642-14929-0_4"},{"issue":"4","key":"304_CR8","first-page":"560","volume":"14","author":"S Mo","year":"2020","unstructured":"Mo S, Bao Z, Zhang P, Peng Z (2020) Towards an efficient weighted random walk domination. PVLDB 14(4):560\u2013572","journal-title":"PVLDB"},{"key":"304_CR9","doi-asserted-by":"crossref","unstructured":"Mo S, Tian S, Wang L, Peng Z (2019) Minimizing the spread of rumor within budget constraint in online network. In: NCTCS. vol.\u00a01069, Springer, pp 131\u2013149","DOI":"10.1007\/978-981-15-0105-0_9"},{"issue":"3","key":"304_CR10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.66.035101","volume":"66","author":"ME Newman","year":"2002","unstructured":"Newman ME, Forrest S, Balthrop J (2002) Email networks and the spread of computer viruses. Phys Rev E 66(3):035101","journal-title":"Phys Rev E"},{"key":"304_CR11","doi-asserted-by":"crossref","unstructured":"Nguyen NP, Yan G, Thai MT, Eidenbenz S (2012) Containment of misinformation spread in online social networks. In: WebSci. pp 213\u2013222","DOI":"10.1145\/2380718.2380746"},{"key":"304_CR12","volume-title":"Principles of random walk","author":"F Spitzer","year":"2013","unstructured":"Spitzer F (2013) Principles of random walk, vol 34. Springer Science & Business Media, New York"},{"key":"304_CR13","doi-asserted-by":"crossref","unstructured":"Tripathy RM, Bagchi A, Mehta S (2010) A study of rumor control strategies on social networks. In: CIKM. pp 1817\u20131820","DOI":"10.1145\/1871437.1871737"},{"key":"304_CR14","doi-asserted-by":"crossref","unstructured":"Xu P, Peng Z, Wang L (2023) Proactive rumor control: When impression counts. In: PAKDD. Springer, vol. 13938, pp 30\u201342","DOI":"10.1007\/978-3-031-33383-5_3"},{"key":"304_CR15","doi-asserted-by":"crossref","unstructured":"Zhang H, Zhang H, Li X, Thai MT (2015) Limiting the spread of misinformation while effectively raising awareness in social networks. In: CSoNet. pp 35\u201347","DOI":"10.1007\/978-3-319-21786-4_4"},{"issue":"4","key":"304_CR16","first-page":"1799","volume":"22","author":"P Zhang","year":"2019","unstructured":"Zhang P, Bao Z, Niu Y, Zhang Y, Mo S, Geng F, Peng Z (2019) Proactive rumor control in online networks. WWW 22(4):1799\u20131818","journal-title":"WWW"},{"issue":"3","key":"304_CR17","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s41019-021-00158-0","volume":"6","author":"Y Zhao","year":"2021","unstructured":"Zhao Y, Hu Y, Yuan P, Jin H (2021) Maximizing influence over streaming graphs with query sequence. Data Sci Eng 6(3):339\u2013357","journal-title":"Data Sci Eng"}],"container-title":["Data Science and Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00304-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41019-025-00304-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41019-025-00304-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T08:42:02Z","timestamp":1765528922000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41019-025-00304-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,22]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["304"],"URL":"https:\/\/doi.org\/10.1007\/s41019-025-00304-y","relation":{},"ISSN":["2364-1185","2364-1541"],"issn-type":[{"value":"2364-1185","type":"print"},{"value":"2364-1541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,22]]},"assertion":[{"value":"5 November 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest, financial or non-financial, that are directly or indirectly related to the work submitted for publication.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}