{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T17:45:25Z","timestamp":1770227125953,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":30,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819561957","type":"print"},{"value":"9789819561964","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-6196-4_23","type":"book-chapter","created":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T05:59:41Z","timestamp":1770184781000},"page":"323-337","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Adaptive Rumor Blocking with\u00a0Pertinence Set"],"prefix":"10.1007","author":[{"given":"Renzhe","family":"Miao","sequence":"first","affiliation":[]},{"given":"Fangsong","family":"Xiang","sequence":"additional","affiliation":[]},{"given":"Xiaoxian","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xijuan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,5]]},"reference":[{"issue":"5","key":"23_CR1","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1038\/scientificamerican1155-31","volume":"193","author":"SE Asch","year":"1955","unstructured":"Asch, S.E.: Opinions and social pressure. Sci. Am. 193(5), 31\u201335 (1955)","journal-title":"Sci. Am."},{"key":"23_CR2","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":"23_CR3","doi-asserted-by":"crossref","unstructured":"Fan, L., Lu, Z., Wu, W., Thuraisingham, B., Ma, H., Bi, Y.: Least cost rumor blocking in social networks. In: 2013 IEEE 33rd International Conference on Distributed Computing Systems, pp. 540\u2013549. IEEE (2013)","DOI":"10.1109\/ICDCS.2013.34"},{"key":"23_CR4","unstructured":"He, C.C.: Study and application of optimal suppression for multi-round spread of rumors on social networks. Ph.D. thesis, Zhejiang University, Zhejiang (2020)"},{"issue":"5","key":"23_CR5","doi-asserted-by":"publisher","first-page":"2244","DOI":"10.1109\/TCSS.2022.3188701","volume":"10","author":"Q He","year":"2022","unstructured":"He, Q., et al.: Graph convolutional network-based rumor blocking on social networks. IEEE Trans. Comput. Soc. Syst. 10(5), 2244\u20132253 (2022)","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"issue":"7","key":"23_CR6","doi-asserted-by":"publisher","first-page":"5404","DOI":"10.3390\/ijerph20075404","volume":"20","author":"S Kemp","year":"2023","unstructured":"Kemp, S., Erades P\u00e9rez, N.: Consumer fraud against older adults in digital society: examining victimization and its impact. Int. J. Environ. Res. Public Health 20(7), 5404 (2023)","journal-title":"Int. J. Environ. Res. Public Health"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-540-69355-0_16","volume-title":"Structural Information and Communication Complexity","author":"J Kostka","year":"2008","unstructured":"Kostka, J., Oswald, Y.A., Wattenhofer, R.: Word of mouth: rumor dissemination in social networks. In: Shvartsman, A.A., Felber, P. (eds.) SIROCCO 2008. LNCS, vol. 5058, pp. 185\u2013196. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-69355-0_16"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Li, C., Lou, J., Liu, S., Chen, Z., Yuan, X.: Shapley explainer-an interpretation method for GNNs used in SDN. In: GLOBECOM 2022-2022 IEEE Global Communications Conference, pp. 5534\u20135540. IEEE (2022)","DOI":"10.1109\/GLOBECOM48099.2022.10001460"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Liu, S., Feng, Y., Yang, S., Ma, B., Li, C.: An efficient ray tracing framework for urban scenarios powered by heterogeneous graph neural networks. IEEE Antennas Wirel. Propag. Lett. (2025)","DOI":"10.1109\/LAWP.2025.3576376"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Liu, S., et al.: Geek-explainer: an efficient interpretation method for graph neural networks in SDN. IEEE Trans. Cogn. Commun. Network. (2025)","DOI":"10.1109\/TCCN.2025.3586942"},{"key":"23_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2023.109812","volume":"231","author":"B Ma","year":"2023","unstructured":"Ma, B., Kuang, H., Liu, S., Li, C.: UAV assisted cellular network traffic offloading: joint swarm, 3D deployment, and user allocation optimization based on a data-aware method. Comput. Netw. 231, 109812 (2023)","journal-title":"Comput. Netw."},{"issue":"7","key":"23_CR12","doi-asserted-by":"publisher","first-page":"4578","DOI":"10.1109\/TSMC.2021.3098630","volume":"52","author":"MA Manouchehri","year":"2021","unstructured":"Manouchehri, M.A., Helfroush, M.S., Danyali, H.: Temporal rumor blocking in online social networks: a sampling-based approach. IEEE Trans. Syst. Man Cybern. Syst. 52(7), 4578\u20134588 (2021)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"11","key":"23_CR13","doi-asserted-by":"publisher","first-page":"4944","DOI":"10.1287\/mnsc.2019.3478","volume":"66","author":"G Pennycook","year":"2020","unstructured":"Pennycook, G., Bear, A., Collins, E.T., Rand, D.G.: The implied truth effect: attaching warnings to a subset of fake news headlines increases perceived accuracy of headlines without warnings. Manage. Sci. 66(11), 4944\u20134957 (2020)","journal-title":"Manage. Sci."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Sun, R., et al.: Efficient maximum signed biclique and biplex identification in signed bipartite graphs: R. sun et al. VLDB J. 34(5), 60 (2025)","DOI":"10.1007\/s00778-025-00939-3"},{"issue":"10","key":"23_CR15","doi-asserted-by":"publisher","first-page":"5051","DOI":"10.1109\/TKDE.2020.3047224","volume":"34","author":"R Sun","year":"2020","unstructured":"Sun, R., Chen, C., Wang, X., Zhang, Y., Wang, X.: Stable community detection in signed social networks. IEEE Trans. Knowl. Data Eng. 34(10), 5051\u20135055 (2020)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"12","key":"23_CR16","doi-asserted-by":"publisher","first-page":"12513","DOI":"10.1109\/TKDE.2023.3272636","volume":"35","author":"R Sun","year":"2023","unstructured":"Sun, R., Wu, Y., Wang, X., Chen, C., Zhang, W., Lin, X.: Clique identification in signed graphs: a balance theory based model. IEEE Trans. Knowl. Data Eng. 35(12), 12513\u201312527 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"3","key":"23_CR17","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1109\/TKDE.2023.3296721","volume":"36","author":"R Sun","year":"2023","unstructured":"Sun, R., Wu, Y., Wang, X., Chen, C., Zhang, W., Lin, X.: Efficient balanced signed biclique search in signed bipartite graphs. IEEE Trans. Knowl. Data Eng. 36(3), 1069\u20131083 (2023)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Tan, X., Wang, X., Liu, Q., Xu, X., Yuan, X., Zhang, W.: Paths-over-graph: knowledge graph empowered large language model reasoning. In: WWW, pp. 3505\u20133522. ACM (2025)","DOI":"10.1145\/3696410.3714892"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Tan, X., et al.: Hydra: structured cross-source enhanced large language model reasoning. arXiv preprint arXiv:2505.17464 (2025)","DOI":"10.18653\/v1\/2025.emnlp-main.730"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Tong, G., Wu, W., Du, D.: Distributed rumor blocking with multiple positive cascades. IEEE Trans. Comput. Soc. Syst. (TCSS) 468\u2013480 (2018)","DOI":"10.1109\/TCSS.2018.2818661"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Tong, G., et al.: An efficient randomized algorithm for rumor blocking in online social networks. IEEE Trans. Netw. Sci. Eng. (2017)","DOI":"10.1109\/INFOCOM.2017.8056957"},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"Wang, J., Wu, Y., Wang, X., Chen, C., Zhang, Y., Qin, L.: Effective influence maximization with priority. In: WWW, pp. 4673\u20134683. ACM (2025)","DOI":"10.1145\/3696410.3714888"},{"issue":"10","key":"23_CR23","doi-asserted-by":"publisher","first-page":"2501","DOI":"10.14778\/3675034.3675042","volume":"17","author":"J Wang","year":"2024","unstructured":"Wang, J., et al.: Efficient influence minimization via node blocking. Proc. VLDB Endow. 17(10), 2501\u20132513 (2024)","journal-title":"Proc. VLDB Endow."},{"issue":"2","key":"23_CR24","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1109\/TKDE.2016.2624734","volume":"29","author":"X Wang","year":"2016","unstructured":"Wang, X., Zhang, Y., Zhang, W., Lin, X., Chen, C.: Bring order into the samples: a novel scalable method for influence maximization. IEEE Trans. Knowl. Data Eng. 29(2), 243\u2013256 (2016)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"11","key":"23_CR25","doi-asserted-by":"publisher","first-page":"3243","DOI":"10.14778\/3681954.3681997","volume":"17","author":"Y Wu","year":"2024","unstructured":"Wu, Y., et al.: Efficient maximal frequent group enumeration in temporal bipartite graphs. Proc. VLDB Endow. 17(11), 3243\u20133255 (2024)","journal-title":"Proc. VLDB Endow."},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Wu, Y., et al.: Efficient maximal temporal plex enumeration. In: ICDE, pp. 3098\u20133110. IEEE (2024)","DOI":"10.1109\/ICDE60146.2024.00240"},{"key":"23_CR27","doi-asserted-by":"crossref","unstructured":"Wu, Y., et al.: Efficient $$k$$-plex mining in temporal graphs. IEEE Trans. Knowl. Data Eng. (2025)","DOI":"10.1109\/TKDE.2025.3620605"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Wu, Y., Wang, J., Sun, R., Chen, C., Wang, X., Zhang, Y.: Targeted filter bubbles mitigating via edges insertion. In: WWW (Companion Volume), pp. 734\u2013737. ACM (2024)","DOI":"10.1145\/3589335.3651566"},{"issue":"3","key":"23_CR29","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/s41019-021-00163-3","volume":"6","author":"Y Wu","year":"2021","unstructured":"Wu, Y., Zhao, J., Sun, R., Chen, C., Wang, X.: Efficient personalized influential community search in large networks. Data Sci. Eng. 6(3), 310\u2013322 (2021)","journal-title":"Data Sci. Eng."},{"issue":"1","key":"23_CR30","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1007\/s11280-024-01235-w","volume":"27","author":"F Xiang","year":"2024","unstructured":"Xiang, F., Wang, J., Wu, Y., Wang, X., Chen, C., Zhang, Y.: Rumor blocking with pertinence set in large graphs. World Wide Web (WWW) 27(1), 6 (2024)","journal-title":"World Wide Web (WWW)"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-6196-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T05:59:46Z","timestamp":1770184786000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-6196-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819561957","9789819561964"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-6196-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"5 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/adc-conference.github.io\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}