{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T23:32:42Z","timestamp":1776382362964,"version":"3.51.2"},"reference-count":24,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T00:00:00Z","timestamp":1750896000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/pages\/standard-publication-reuse-rights"}],"funder":[{"DOI":"10.13039\/501100011447","name":"Science and Technology Department of Henan Province","doi-asserted-by":"publisher","award":["222102210233"],"award-info":[{"award-number":["222102210233"]}],"id":[{"id":"10.13039\/501100011447","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100011447","name":"Science and Technology Department of Henan Province","doi-asserted-by":"publisher","award":["232102210064"],"award-info":[{"award-number":["232102210064"]}],"id":[{"id":"10.13039\/501100011447","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,6,26]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Network dismantling\u2014the strategic removal of nodes to disrupt connectivity in complex systems\u2014is a foundational task in domains such as infrastructure protection, epidemic containment, and systemic risk mitigation. While existing approaches range from heuristic centrality metrics to optimization-based algorithms, they often lack generalization across topologies and fail to learn task-specific node influence. Recent graph learning-based methods, including CLMA, NRAND, and MaxShot-RL, introduce structural adaptability but typically rely on auxiliary modules such as contrastive heads, epidemic simulators, or reinforcement policies, increasing complexity and limiting scalability. Compared to recent reinforcement learning-based approaches such as MaxShot-RL, our method achieves higher scalability and dismantling accuracy while avoiding sample inefficiency and unstable convergence. In this work, we present GLND, a lightweight, self-contained dismantling framework that formulates node importance prediction as a supervised ranking problem. GLND integrates hierarchical attention to capture multi-scale topological patterns, a margin-based ranking loss to enforce score separation, and role-aware attention to amplify structurally pivotal nodes. Extensive experiments on both synthetic and real-world networks demonstrate that GLND consistently improves dismantling effectiveness, suppresses dynamic propagation more efficiently, and scales favorably with graph size, all while maintaining minimal architectural overhead. These results position GLND as a practical and generalizable tool for structural intervention across diverse complex networks.<\/jats:p>","DOI":"10.1093\/comnet\/cnaf015","type":"journal-article","created":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T14:55:58Z","timestamp":1752591358000},"source":"Crossref","is-referenced-by-count":1,"title":["Graph Learning-Based Network Dismantling via hierarchical feature fusion and margin-ranked optimization"],"prefix":"10.1093","volume":"13","author":[{"given":"Jihui","family":"Han","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Zhengzhou University of Light Industry , 136 Kexue Avenue , Zhengzhou, Henan, 450000,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-7982-3049","authenticated-orcid":false,"given":"Yupeng","family":"Shi","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Zhengzhou University of Light Industry , 136 Kexue Avenue , Zhengzhou, Henan, 450000,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daoying","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Zhengzhou University of Light Industry , 136 Kexue Avenue , Zhengzhou, Henan, 450000,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziqi","family":"Huang","sequence":"additional","affiliation":[{"name":"North Information Control Research Academy Group Co., Ltd., Overall R&D Department , 528 Jiangjun Avenue, Jiangning District , Nanjing, Jiangsu, 211153,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anlin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Engineering Training Center, Zhengzhou University of Light Industry , 136 Kexue Avenue , Zhengzhou, Henan, 450000,","place":["China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2025,7,15]]},"reference":[{"key":"2025071510554838600_cnaf015-B1","doi-asserted-by":"crossref","first-page":"cnaa041","DOI":"10.1093\/comnet\/cnaa041","article-title":"The impact of human mobility networks on the global spread of COVID-19","volume":"8","author":"H\u00e2ncean","year":"2020","journal-title":"J Complex Netw"},{"key":"2025071510554838600_cnaf015-B2","doi-asserted-by":"crossref","first-page":"7155","DOI":"10.1109\/TITS.2020.3002455","article-title":"An assessment method for traffic state vulnerability based on a cloud model for urban road network traffic systems","volume":"22","author":"Deng","year":"2021","journal-title":"IEEE Trans Intell Transport Syst"},{"key":"2025071510554838600_cnaf015-B3","doi-asserted-by":"crossref","first-page":"eaaw8359","DOI":"10.1126\/sciadv.aaw8359","article-title":"The key player problem in complex oscillator networks and electric power grids: resistance centralities identify local vulnerabilities","volume":"5","author":"Tyloo","year":"2019","journal-title":"Sci Adv"},{"key":"2025071510554838600_cnaf015-B4","doi-asserted-by":"crossref","first-page":"102716","DOI":"10.1016\/j.jnca.2020.102716","article-title":"Applications of link prediction in social networks: a review","volume":"166","author":"Daud","year":"2020","journal-title":"J Netw Comput Appl"},{"key":"2025071510554838600_cnaf015-B5","first-page":"199","author":"Chen","year":"2009"},{"key":"2025071510554838600_cnaf015-B6","doi-asserted-by":"crossref","first-page":"102037","DOI":"10.1016\/j.omega.2019.02.006","article-title":"Efficient benders decomposition for distance-based critical node detection problem","volume":"93","author":"Hooshmand","year":"2020","journal-title":"Omega"},{"key":"2025071510554838600_cnaf015-B7","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1038\/nature14604","article-title":"Influence maximization in complex networks through optimal percolation","volume":"524","author":"Morone","year":"2015","journal-title":"Nature"},{"key":"2025071510554838600_cnaf015-B8","doi-asserted-by":"crossref","first-page":"37954","DOI":"10.1038\/srep37954","article-title":"Fast and simple decycling and dismantling of networks","volume":"6","author":"Zdeborov\u00e1","year":"2016","journal-title":"Sci Rep"},{"key":"2025071510554838600_cnaf015-B9","first-page":"82","article-title":"Missing link prediction in complex networks","volume":"9","author":"Akhtar","year":"2018","journal-title":"Int J Sci Eng Res"},{"key":"2025071510554838600_cnaf015-B10","doi-asserted-by":"crossref","first-page":"012305","DOI":"10.1103\/PhysRevE.94.012305","article-title":"Identifying optimal targets of network attack by belief propagation","volume":"94","author":"Mugisha","year":"2016","journal-title":"Phys Rev E"},{"key":"2025071510554838600_cnaf015-B11","doi-asserted-by":"crossref","first-page":"103221","DOI":"10.1016\/j.ipm.2022.103221","article-title":"NRAND: an efficient and robust dismantling approach for infectious disease network","volume":"60","author":"Akhtar","year":"2023","journal-title":"Inf Process Manag"},{"key":"2025071510554838600_cnaf015-B12","doi-asserted-by":"crossref","first-page":"120780","DOI":"10.1016\/j.ins.2024.120780","article-title":"Dismantling complex networks with graph contrastive learning and multi-hop aggregation","volume":"676","author":"Ma","year":"2024","journal-title":"Inf Sci"},{"key":"2025071510554838600_cnaf015-B13","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.neunet.2022.07.015","article-title":"Neural extraction of multiscale essential structure for network dismantling","volume":"154","author":"Liu","year":"2022","journal-title":"Neural Netw"},{"key":"2025071510554838600_cnaf015-B14","first-page":"2559","author":"Zhang","year":"2022"},{"key":"2025071510554838600_cnaf015-B15","doi-asserted-by":"crossref","first-page":"2766","DOI":"10.3390\/math12172766","article-title":"Reinforcement learning-based network dismantling by targeting maximum-degree nodes in the giant connected component","volume":"12","author":"Liu","year":"2024","journal-title":"Mathematics"},{"key":"2025071510554838600_cnaf015-B16","first-page":"111","author":"Zhang","year":"2023"},{"key":"2025071510554838600_cnaf015-B17","first-page":"193","author":"Burges"},{"key":"2025071510554838600_cnaf015-B18","author":"Kipf","year":"2017"},{"key":"2025071510554838600_cnaf015-B19","author":"Veli\u010dkovi\u0107","year":"2018"},{"key":"2025071510554838600_cnaf015-B20","doi-asserted-by":"crossref","first-page":"109660","DOI":"10.1016\/j.engappai.2024.109660","article-title":"Multilingual entity alignment by abductive knowledge reasoning on multiple knowledge graphs","volume":"139","author":"Akhtar","year":"2025","journal-title":"Eng Appl Artif Intell"},{"key":"2025071510554838600_cnaf015-B21","doi-asserted-by":"crossref","first-page":"12368","DOI":"10.1073\/pnas.1605083113","article-title":"Network dismantling","volume":"113","author":"Braunstein","year":"2016","journal-title":"Proc Natl Acad Sci USA"},{"key":"2025071510554838600_cnaf015-B22","doi-asserted-by":"crossref","first-page":"1175","DOI":"10.1080\/0020716041233127208","article-title":"On the maximal connected component of hypercube with faulty vertices","volume":"81","author":"Yang","year":"2004","journal-title":"Int J Comput Math"},{"key":"2025071510554838600_cnaf015-B23","doi-asserted-by":"crossref","first-page":"1702","DOI":"10.1016\/j.wasman.2008.11.009","article-title":"On the optimal design of the disassembly and recovery processes","volume":"29","author":"Xanthopoulos","year":"2009","journal-title":"Waste Manag"},{"key":"2025071510554838600_cnaf015-B24","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1079\/BJN20031054","article-title":"Effect of blood sampling schedule and method of calculating the area under the curve on validity and precision of glycaemic index values","volume":"91","author":"Wolever","year":"2004","journal-title":"Br J Nutr"}],"container-title":["Journal of Complex Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/13\/4\/cnaf015\/63768734\/cnaf015.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comnet\/article-pdf\/13\/4\/cnaf015\/63768734\/cnaf015.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,15]],"date-time":"2025-07-15T14:56:01Z","timestamp":1752591361000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comnet\/article\/doi\/10.1093\/comnet\/cnaf015\/8202883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,26]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,6,26]]}},"URL":"https:\/\/doi.org\/10.1093\/comnet\/cnaf015","relation":{},"ISSN":["2051-1329"],"issn-type":[{"value":"2051-1329","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2025,8]]},"published":{"date-parts":[[2025,6,26]]},"article-number":"cnaf015"}}