{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T21:02:30Z","timestamp":1776286950543,"version":"3.50.1"},"reference-count":50,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.ins.2026.123228","type":"journal-article","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:01:53Z","timestamp":1770969713000},"page":"123228","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Finding critical users in social networks with reinforcement learning"],"prefix":"10.1016","volume":"741","author":[{"given":"Xulu","family":"Gong","sequence":"first","affiliation":[]},{"given":"Hanchen","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2032-7727","authenticated-orcid":false,"given":"Jianke","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Kecheng","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6471-1010","authenticated-orcid":false,"given":"Xubo","family":"Wang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2674-1638","authenticated-orcid":false,"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2026.123228_bib0005","series-title":"Proceedings of the AAAI Conference on Artificial Intelligence","article-title":"Finding critical users for social network engagement: the collapsed k-core problem","volume":"vol. 31","author":"Zhang","year":"2017"},{"key":"10.1016\/j.ins.2026.123228_bib0010","series-title":"Proceedings of the 27th ACM International Conference on Information and Knowledge Management","first-page":"1667","article-title":"K-core minimization: An edge manipulation approach","author":"Zhu","year":"2018"},{"key":"10.1016\/j.ins.2026.123228_bib0015","series-title":"Proceedings of the 20th International Conference on Autonomous Agents and MultiAgent Systems","doi-asserted-by":"crossref","first-page":"438","DOI":"10.65109\/TUYI1747","article-title":"Network robustness via global k-cores","author":"Dey","year":"2021"},{"issue":"1","key":"10.1016\/j.ins.2026.123228_bib0020","first-page":"456","article-title":"Finding critical users in social communities via graph convolutions","volume":"35","author":"Zhao","year":"2021","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"10.1016\/j.ins.2026.123228_bib0025","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s00778-021-00673-6","article-title":"Anchored coreness: efficient reinforcement of social networks","volume":"31","author":"Linghu","year":"2022","journal-title":"The VLDB J."},{"key":"10.1016\/j.ins.2026.123228_bib0030","series-title":"2022 IEEE 38th International Conference on Data Engineering (ICDE)","first-page":"2291","article-title":"Discovering hierarchy of bipartite graphs with cohesive subgraphs","author":"Wang","year":"2022"},{"issue":"2","key":"10.1016\/j.ins.2026.123228_bib0035","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1007\/s11280-021-00926-y","article-title":"Key-core: cohesive keyword subgraph exploration in large graphs","volume":"25","author":"Zhang","year":"2022","journal-title":"World Wide Web"},{"issue":"1","key":"10.1016\/j.ins.2026.123228_bib0040","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/s00778-019-00587-4","article-title":"The core decomposition of networks: theory, algorithms and applications","volume":"29","author":"Malliaros","year":"2020","journal-title":"The VLDB J."},{"key":"10.1016\/j.ins.2026.123228_bib0045","series-title":"Proceedings of the 2020 ACM SIGMOD International Conference on Management of Data","first-page":"2211","article-title":"Global reinforcement of social networks: the anchored coreness problem","author":"Linghu","year":"2020"},{"key":"10.1016\/j.ins.2026.123228_bib0050","series-title":"Proceedings of the 30th ACM International Conference on Information & Knowledge Management","first-page":"4799","article-title":"A cohesive structure based bipartite graph analytics system","author":"Wang","year":"2021"},{"issue":"3","key":"10.1016\/j.ins.2026.123228_bib0055","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.104001","article-title":"Few-shot multi-hop reasoning via reinforcement learning and path search strategy over temporal knowledge graphs","volume":"62","author":"Bai","year":"2025","journal-title":"Inf. Process. Manag."},{"issue":"8","key":"10.1016\/j.ins.2026.123228_bib0060","doi-asserted-by":"crossref","first-page":"1243","DOI":"10.1007\/s00224-021-10045-w","article-title":"A parameterized complexity view on collapsing k-cores","volume":"65","author":"Luo","year":"2021","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"10.1016\/j.ins.2026.123228_bib0065","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0378-8733(83)90028-X","article-title":"Network structure and minimum degree","volume":"5","author":"Seidman","year":"1983","journal-title":"Soc. Netw."},{"key":"10.1016\/j.ins.2026.123228_bib0070","series-title":"2021 IEEE 37th International Conference on Data Engineering (ICDE)","first-page":"85","article-title":"Efficient and effective community search on large-scale bipartite graphs","author":"Wang","year":"2021"},{"key":"10.1016\/j.ins.2026.123228_bib0075","series-title":"Proceedings of the 2021 International Conference on Management of Data","first-page":"2829","article-title":"Cohesive subgraph search over big heterogeneous information networks: Applications, challenges, and solutions","author":"Fang","year":"2021"},{"key":"10.1016\/j.ins.2026.123228_bib0080","series-title":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","first-page":"47","article-title":"Detecting critical nodes in hypergraphs via hypergraph convolutional network","author":"Miao","year":"2023"},{"key":"10.1016\/j.ins.2026.123228_bib0085","series-title":"Proceedings of the 2018 World Wide Web Conference","first-page":"609","article-title":"Measuring and improving the core resilience of networks","author":"Laishram","year":"2018"},{"issue":"1","key":"10.1016\/j.ins.2026.123228_bib0090","first-page":"390","article-title":"Edge manipulation approaches for k-core minimization: Metrics and analytics","volume":"35","author":"Chen","year":"2021","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.ins.2026.123228_bib0095","series-title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, August 10-16, 2019","first-page":"4867","article-title":"K-core maximization: An edge addition approach","author":"Zhou","year":"2019"},{"issue":"7","key":"10.1016\/j.ins.2026.123228_bib0100","doi-asserted-by":"crossref","first-page":"1350","DOI":"10.14778\/3523210.3523214","article-title":"Fast algorithms for core maximization on large graphs","volume":"15","author":"Sun","year":"2022","journal-title":"Proc. VLDB Endow."},{"key":"10.1016\/j.ins.2026.123228_bib0105","article-title":"Ag-gnn: Adaptive gating mechanism for robust node classification in graph neural networks","author":"Begga","year":"2025","journal-title":"Inf. Sci."},{"key":"10.1016\/j.ins.2026.123228_bib0110","series-title":"International Conference on Learning Representations","article-title":"Semi-supervised classification with graph convolutional networks","author":"Kipf","year":"2017"},{"key":"10.1016\/j.ins.2026.123228_bib0115","author":"Veli\u010dkovi\u0107"},{"key":"10.1016\/j.ins.2026.123228_bib0120","article-title":"Inductive representation learning on large graphs","volume":"30","author":"Hamilton","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ins.2026.123228_bib0125","series-title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020","first-page":"1317","article-title":"Gognn: Graph of graphs neural network for predicting structured entity interactions","author":"Wang","year":"2020"},{"key":"10.1016\/j.ins.2026.123228_bib0130","series-title":"Proceedings of the 2022 International Conference on Management of Data","first-page":"160","article-title":"Neural subgraph counting with wasserstein estimator","author":"Wang","year":"2022"},{"key":"10.1016\/j.ins.2026.123228_bib0135","series-title":"Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","first-page":"5463","article-title":"Group-based fraud detection network on e-commerce platforms","author":"Yu","year":"2023"},{"key":"10.1016\/j.ins.2026.123228_bib0140","article-title":"Learning combinatorial optimization algorithms over graphs","volume":"30","author":"Khalil","year":"2017","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ins.2026.123228_bib0145","series-title":"International conference on machine learning","first-page":"2702","article-title":"Discriminative embeddings of latent variable models for structured data","author":"Dai","year":"2016"},{"key":"10.1016\/j.ins.2026.123228_bib0150","article-title":"Combinatorial optimization with graph convolutional networks and guided tree search","volume":"31","author":"Li","year":"2018","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ins.2026.123228_bib0155","first-page":"21453","article-title":"A bi-level framework for learning to solve combinatorial optimization on graphs","volume":"34","author":"Wang","year":"2021","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ins.2026.123228_bib0160","series-title":"International conference on machine learning","first-page":"9622","article-title":"Lense: Learning to navigate subgraph embeddings for large-scale combinatorial optimisation","author":"Ireland","year":"2022"},{"key":"10.1016\/j.ins.2026.123228_bib0165","first-page":"73124","article-title":"Are graph neural networks optimal approximation algorithms?","volume":"37","author":"Yau","year":"2024","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ins.2026.123228_bib0170","doi-asserted-by":"crossref","first-page":"31226","DOI":"10.52202\/068431-2264","article-title":"Learning generalizable models for vehicle routing problems via knowledge distillation","volume":"35","author":"Bi","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ins.2026.123228_bib0175","first-page":"31444","article-title":"Unsupervised learning for combinatorial optimization with principled objective relaxation","volume":"35","author":"Wang","year":"2022","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ins.2026.123228_bib0180","series-title":"European Conference on Computer Vision","first-page":"370","article-title":"Self-supervised learning of visual graph matching","author":"Liu","year":"2022"},{"key":"10.1016\/j.ins.2026.123228_bib0185","article-title":"Efficient meta neural heuristic for multi-objective combinatorial optimization","volume":"36","author":"Chen","year":"2024","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ins.2026.123228_bib0190","author":"Batagelj"},{"key":"10.1016\/j.ins.2026.123228_bib0195","series-title":"Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining","first-page":"701","article-title":"Deepwalk: Online learning of social representations","author":"Perozzi","year":"2014"},{"key":"10.1016\/j.ins.2026.123228_bib0200","article-title":"Actor-critic algorithms","volume":"12","author":"Konda","year":"1999","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"10.1016\/j.ins.2026.123228_bib0205","author":"Leskovec"},{"key":"10.1016\/j.ins.2026.123228_bib0210","author":"Kunegis"},{"key":"10.1016\/j.ins.2026.123228_bib0215","series-title":"Proceedings of the AAAI conference on artificial intelligence","article-title":"The network data repository with interactive graph analytics and visualization","volume":"vol. 29","author":"Rossi","year":"2015"},{"issue":"6749","key":"10.1016\/j.ins.2026.123228_bib0220","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1038\/43601","article-title":"Diameter of the world-wide web","volume":"401","author":"Albert","year":"1999","journal-title":"nature"},{"key":"10.1016\/j.ins.2026.123228_bib0225","series-title":"The Web Conference","article-title":"The pagerank citation ranking: Bringing order to the web","author":"Page","year":"1999"},{"issue":"5","key":"10.1016\/j.ins.2026.123228_bib0230","doi-asserted-by":"crossref","first-page":"1170","DOI":"10.1086\/228631","article-title":"Power and centrality: A family of measures","volume":"92","author":"Bonacich","year":"1987","journal-title":"Am. J. Sociol."},{"key":"10.1016\/j.ins.2026.123228_bib0235","author":"Cen"},{"key":"10.1016\/j.ins.2026.123228_bib0240","author":"Kingma"},{"key":"10.1016\/j.ins.2026.123228_bib0245","series-title":"International Conference on Learning Representations","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2019"},{"issue":"2","key":"10.1016\/j.ins.2026.123228_bib0250","doi-asserted-by":"crossref","DOI":"10.1103\/PhysRevE.75.027105","article-title":"Generalizations of the clustering coefficient to weighted complex networks","volume":"75","author":"Saram\u00e4ki","year":"2007","journal-title":"Phys. Rev. E"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526001593?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020025526001593?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T20:29:42Z","timestamp":1776284982000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020025526001593"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":50,"alternative-id":["S0020025526001593"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123228","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Finding critical users in social networks with reinforcement learning","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123228","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123228"}}