{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T17:04:12Z","timestamp":1780419852175,"version":"3.54.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T00:00:00Z","timestamp":1780358400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T00:00:00Z","timestamp":1780358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural and Science Foundation of China","doi-asserted-by":"crossref","award":["62532105"],"award-info":[{"award-number":["62532105"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Henan Province Science and Technology Key Project","award":["252102221021"],"award-info":[{"award-number":["252102221021"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-026-08592-5","type":"journal-article","created":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T16:09:59Z","timestamp":1780416599000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Building highly reliable large-scale network through connectivity core-based node protection"],"prefix":"10.1007","volume":"82","author":[{"given":"Gaojie","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,2]]},"reference":[{"issue":"2","key":"8592_CR1","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1038\/s42254-023-00676-y","volume":"6","author":"O Artime","year":"2024","unstructured":"Artime O, Grassia M, De Domenico M, Gleeson JP, Makse HA, Mangioni G, Perc M, Radicchi F (2024) Robustness and resilience of complex networks. Nat Rev Phys 6(2):114\u2013131","journal-title":"Nat Rev Phys"},{"issue":"8","key":"8592_CR2","doi-asserted-by":"publisher","first-page":"885","DOI":"10.3390\/math9080895","volume":"9","author":"M Oehlers","year":"2021","unstructured":"Oehlers M, Fabian B (2021) Graph metrics for network robustness: a survey. Mathematics 9(8):885\u2013895","journal-title":"Mathematics"},{"issue":"1","key":"8592_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2024.110497","volume":"253","author":"C Qian","year":"2025","unstructured":"Qian C, Zhao D, Zhong M, Peng H, Wang W (2025) Modeling and analysis of cascading failures in multilayer higher-order networks. Reliab Eng Syst Saf 253(1):110497","journal-title":"Reliab Eng Syst Saf"},{"issue":"1","key":"8592_CR4","first-page":"136","volume":"70","author":"X Gao","year":"2023","unstructured":"Gao X, Peng M, Tse CK (2023) Cascading failure analysis of cyber-physical power systems considering routing strategy. IEEE Trans Circuits Syst II Express Briefs 70(1):136\u2013140","journal-title":"IEEE Trans Circuits Syst II Express Briefs"},{"issue":"1","key":"8592_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2025.110950","volume":"259","author":"Y Li","year":"2025","unstructured":"Li Y, Zhang M (2025) Cascading failure analysis of interdependent water-power networks based on functional coupling. Reliab Eng Syst Saf 259(1):110950","journal-title":"Reliab Eng Syst Saf"},{"issue":"2","key":"8592_CR6","doi-asserted-by":"publisher","first-page":"3282","DOI":"10.1109\/JSYST.2023.3248044","volume":"17","author":"MJ Li","year":"2023","unstructured":"Li MJ, Tse CK, Liu D, Zhang X (2023) Cascading failure propagation and mitigation strategies in power systems. IEEE Syst J 17(2):3282\u20133293","journal-title":"IEEE Syst J"},{"issue":"5","key":"8592_CR7","doi-asserted-by":"publisher","first-page":"1738","DOI":"10.1109\/JSAC.2025.3543482","volume":"43","author":"R Wang","year":"2025","unstructured":"Wang R, Zhang Q, Zhang J, Gu Z, Ibrahimi M, Yu H (2025) Multi-failure localization in high-degree roadm-based optical networks using rules-informed neural networks. IEEE J Sel Areas Commun 43(5):1738\u20131754","journal-title":"IEEE J Sel Areas Commun"},{"issue":"1","key":"8592_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.trd.2023.103861","volume":"122","author":"X Guo","year":"2023","unstructured":"Guo X, Du Q, Li Y, Zhou Y, Wang Y, Huang Y, Martinez-Pastor B (2023) Cascading failure and recovery of metro-bus double-layer network considering recovery propagation. Transp Res Part D: Transp Environ 122(1):103861","journal-title":"Transp Res Part D: Transp Environ"},{"issue":"2","key":"8592_CR9","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1109\/LCOMM.2020.3028620","volume":"25","author":"W Wei","year":"2020","unstructured":"Wei W, Gong X, Yang W, Mu Y (2020) Minimum cut acceleration by exploiting tree-cut injection for upper bound estimation. IEEE Commun Lett 25(2):455\u2013459","journal-title":"IEEE Commun Lett"},{"issue":"1","key":"8592_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.advengsoft.2022.103256","volume":"173","author":"W Wei","year":"2022","unstructured":"Wei W, Hu Q, Yang W (2022) Accelerate minimum cut calculation by tree-cut mapping with local pruning. Adv Eng Softw 173(1):103256","journal-title":"Adv Eng Softw"},{"issue":"1","key":"8592_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2023.119768","volume":"652","author":"W Wei","year":"2024","unstructured":"Wei W, Liu Y, Zhang Q (2024) An optimal pruned traversal tree-based fast minimum cut solver in dense graph. Inf Sci 652(1):119768","journal-title":"Inf Sci"},{"issue":"3","key":"8592_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.20517\/ces.2025.34","volume":"5","author":"D Chen","year":"2025","unstructured":"Chen D, Chen J, Zhang X, Jia Q, Liu X, Sun Y, Lv L, Yu W (2025) Critical nodes identification in complex networks: a survey. Complex Eng Syst 5(3):1\u201314","journal-title":"Complex Eng Syst"},{"issue":"4","key":"8592_CR13","doi-asserted-by":"publisher","first-page":"4662","DOI":"10.1109\/TR.2025.3586415","volume":"74","author":"O Ugurlu","year":"2025","unstructured":"Ugurlu O (2025) Critical node detection for enhanced network reliability: a comparative analysis across real-world complex networks. IEEE Trans Reliab 74(4):4662\u20134676","journal-title":"IEEE Trans Reliab"},{"issue":"1","key":"8592_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s42005-023-01483-8","volume":"7","author":"Y Huang","year":"2024","unstructured":"Huang Y, Wang H, Ren X-L, Lv L (2024) Identifying key players in complex networks via network entanglement. Commun Phys 7(1):1\u201319","journal-title":"Commun Phys"},{"issue":"1","key":"8592_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.126292","volume":"268","author":"Y Ruan","year":"2025","unstructured":"Ruan Y, Liu S, Tang J, Guo Y, Yu T (2025) Glc: a dual-perspective approach for identifying influential nodes in complex networks. Expert Syst Appl 268(1):126292","journal-title":"Expert Syst Appl"},{"issue":"3","key":"8592_CR16","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1109\/TPWRD.2022.3230926","volume":"38","author":"A Palomino","year":"2023","unstructured":"Palomino A, Giraldo J, Parvania M (2023) Graph-based interdependent cyber-physical risk analysis of power distribution networks. IEEE Trans Power Deliv 38(3):1510\u20131520","journal-title":"IEEE Trans Power Deliv"},{"issue":"1","key":"8592_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.apenergy.2025.125608","volume":"388","author":"H Liu","year":"2025","unstructured":"Liu H, Zhou S, Gu W, Zhuang W, Zhou A, Peng L, Liu M (2025) Fast dynamic identification algorithm for key nodes in distribution networks with large-scale dg and ev integration. Appl Energy 388(1):125608","journal-title":"Appl Energy"},{"issue":"1","key":"8592_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2024.125979","volume":"265","author":"L Zhou","year":"2025","unstructured":"Zhou L, Liao H, Tan F, Chen Z (2025) K-core percolation and node protection strategy for edge-coupling partially interdependent networks. Expert Syst Appl 265(1):125979","journal-title":"Expert Syst Appl"},{"key":"8592_CR19","doi-asserted-by":"crossref","unstructured":"Yano H, Yoneyama S, Miwa H (2022) Reliable network design problem by improving node reliability. In: Proceedings of International Conference on Emerging Internetworking, Data and Web Technologies. pp 42\u201351","DOI":"10.1007\/978-3-030-95903-6_6"},{"issue":"1","key":"8592_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.comcom.2021.12.013","volume":"185","author":"MA Khan","year":"2022","unstructured":"Khan MA, Javaid N (2022) Computationally efficient topology optimization of scale-free iot networks. Comput Commun 185(1):1\u201312","journal-title":"Comput Commun"},{"issue":"1","key":"8592_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2023.109747","volume":"242","author":"W Wei","year":"2024","unstructured":"Wei W, Hu Q, Zhang Q (2024) Improving node connectivity by optimized dual tree-based effective node consolidation. Reliab Eng Syst Saf 242(1):109747","journal-title":"Reliab Eng Syst Saf"},{"issue":"1","key":"8592_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.ress.2024.110612","volume":"254","author":"W Wei","year":"2025","unstructured":"Wei W, Sun G, Li P, Zhang Q (2025) Employing the cluster of node cut sets to improve the robustness of the network measured by connectivity. Reliab Eng Syst Saf 254(1):110612","journal-title":"Reliab Eng Syst Saf"},{"key":"8592_CR23","unstructured":"CPLEX home page (2024). https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08592-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08592-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08592-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T16:10:01Z","timestamp":1780416601000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08592-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6,2]]},"references-count":23,"journal-issue":{"issue":"8","published-online":{"date-parts":[[2026,6]]}},"alternative-id":["8592"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08592-5","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,6,2]]},"assertion":[{"value":"25 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 June 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors state that they don\u2019t have any financial conflict of interest or personal connections that could affect the research presented in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}}],"article-number":"470"}}