{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:46:57Z","timestamp":1765500417092,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62432003,92267206"],"award-info":[{"award-number":["62432003,92267206"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,10]]},"DOI":"10.1145\/3746252.3761073","type":"proceedings-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T18:37:32Z","timestamp":1762799852000},"page":"2791-2800","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Discovering Group Collapser for Network Resilience"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-2933-8044","authenticated-orcid":false,"given":"Guozhang","family":"Sun","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang, China and Key Laboratory of Intelligent Computing in Medical Image of Ministry of Education, Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3493-2612","authenticated-orcid":false,"given":"Haoyuan","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang, China and Key Laboratory of Intelligent Computing in Medical Image of Ministry of Education, Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1080-0859","authenticated-orcid":false,"given":"Yuhai","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang, China and Key Laboratory of Intelligent Computing in Medical Image of Ministry of Education, Northeastern University, Shenyang, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4554-0791","authenticated-orcid":false,"given":"Zhengkui","family":"Wang","sequence":"additional","affiliation":[{"name":"Singapore Institute of Technology, Singapore, Singapore"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3567-2101","authenticated-orcid":false,"given":"Yuan","family":"Li","sequence":"additional","affiliation":[{"name":"North China University of Technology, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2856-4716","authenticated-orcid":false,"given":"Xingwei","family":"Wang","sequence":"additional","affiliation":[{"name":"Northeastern University, Shenyang, China"}]}],"member":"320","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"378","volume-title":"Nature","volume":"406","author":"Albert R\u00e9ka","year":"2000","unstructured":"R\u00e9ka Albert, Hawoong Jeong, and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 2000. Error and attack tolerance of complex networks. Nature, Vol. 406, 6794 (2000), 378-382."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1038\/s42254-023-00676-y"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1186\/1471-2105-4-2"},{"volume-title":"Proceedings of the 48th IEEE Conference on Decision and Control. IEEE, 3751-3756","author":"John","unstructured":"John S. Baras and Pedram Hovareshti. 2009. Efficient and robust communication topologies for distributed decision making in networked systems. In Proceedings of the 48th IEEE Conference on Decision and Control. IEEE, 3751-3756.","key":"e_1_3_2_1_4_1"},{"key":"e_1_3_2_1_5_1","volume-title":"arXiv preprint","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. arXiv preprint, Vol. arXiv: cs\/0310049 (2003)."},{"key":"e_1_3_2_1_6_1","volume-title":"Improving network robustness by edge modification. Physica A: Statistical Mechanics and its Applications","author":"Beygelzimer Alina","year":"2005","unstructured":"Alina Beygelzimer, Geoffrey Grinstein, Ralph Linsker, and Irina Rish. 2005. Improving network robustness by edge modification. Physica A: Statistical Mechanics and its Applications, Vol. 357, 3 (2005), 593-612."},{"key":"e_1_3_2_1_7_1","first-page":"440","article-title":"Preventing Unraveling in Social Networks: The Anchored k-Core Problem","volume":"7392","author":"Bhawalkar Kshipra","year":"2012","unstructured":"Kshipra Bhawalkar, Jon M. Kleinberg, Kevin Lewi, Tim Roughgarden, and Aneesh Sharma. 2012. Preventing Unraveling in Social Networks: The Anchored k-Core Problem. In Automata, Languages, and Programming, Vol. 7392. 440-451.","journal-title":"Automata, Languages, and Programming"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1137\/14097032X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1051\/ita\/2016022"},{"key":"e_1_3_2_1_10_1","first-page":"1","article-title":"Algebraic connectivity and graph robustness","volume":"87185","author":"Byrne R","year":"2005","unstructured":"R Byrne, J Feddema, and C Abdallah. 2005. Algebraic connectivity and graph robustness. SANDIA Report, Vol. 87185 (2005), 1-34.","journal-title":"SANDIA Report"},{"key":"e_1_3_2_1_11_1","first-page":"390","article-title":"Edge Manipulation Approaches for K-Core Minimization","volume":"35","author":"Chen Chen","year":"2023","unstructured":"Chen Chen, Qiuyu Zhu, Renjie Sun, Xiaoyang Wang, and Yanping Wu. 2023. Edge Manipulation Approaches for K-Core Minimization: Metrics and Analytics. IEEE Trans. Knowl. Data Eng., Vol. 35, 1 (2023), 390-403.","journal-title":"Metrics and Analytics. IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_2_1_12_1","article-title":"Greedily Improving Our Own Closeness Centrality in a Network","volume":"11","author":"Crescenzi Pierluigi","year":"2016","unstructured":"Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, and Yllka Velaj. 2016. Greedily Improving Our Own Closeness Centrality in a Network. ACM Trans. Knowl. Discov. Data, Vol. 11, 1 (2016), 9:1-9:32.","journal-title":"ACM Trans. Knowl. Discov. Data"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.5555\/3463952.3464008"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/1513876.1513879"},{"key":"e_1_3_2_1_15_1","volume-title":"Kooij","author":"Ellens Wendy","year":"2013","unstructured":"Wendy Ellens and Robert E. Kooij. 2013. Graph measures and network robustness. arXiv preprint, Vol. arXiv: 1311.5064 (2013)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.1109\/DSIT61374.2024.10881965"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1109\/TKDE.2022.3163672"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1145\/2512938.2512946"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1137\/050645452"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1137\/0110037"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.14778\/2850578.2850580"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/956750.956769"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/2623330.2623704"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.14778\/2850469.2850471"},{"volume-title":"Network analysis: Methodological foundations","author":"Klau Gunnar W","unstructured":"Gunnar W Klau and Ren\u00e9 Weiskircher. 2005. Robustness and resilience. In Network analysis: Methodological foundations. Springer, 417-437.","key":"e_1_3_2_1_25_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1007\/978-3-662-56039-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1137\/1.9781611976236.37"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1109\/TKDE.2018.2807843"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1145\/3318464.3389744"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1007\/s00778-021-00673-6"},{"volume-title":"22nd ACM International Conference on Information and Knowledge Management. 469-478","author":"Fragkiskos","unstructured":"Fragkiskos D. Malliaros and Michalis Vazirgiannis. 2013. To stay or not to stay: modeling engagement dynamics in social graphs. In 22nd ACM International Conference on Information and Knowledge Management. 469-478.","key":"e_1_3_2_1_31_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_1_33_1","volume-title":"Mathematics","volume":"9","author":"Oehlers Milena","year":"2021","unstructured":"Milena Oehlers and Benjamin Fabian. 2021. Graph Metrics for Network Robustness-A Survey. Mathematics, Vol. 9, 8 (2021)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1016\/j.jksuci.2023.101882"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1093\/comnet\/cnab018"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.1016\/0378-8733(83)90028-X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.5555\/3192424.3192513"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1007\/s13278-017-0429-2"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_39_1","DOI":"10.1145\/3589334.3645465"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_40_1","DOI":"10.1073\/pnas.1116502109"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_41_1","DOI":"10.14778\/3067421.3067429"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.14778\/3648160.3648171"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1109\/TKDE.2018.2880976"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_44_1","DOI":"10.1145\/3580305.3599480"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_45_1","DOI":"10.1007\/s11280-021-00905-3"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_46_1","DOI":"10.14778\/3055330.3055332"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_47_1","DOI":"10.1609\/aaai.v31i1.10482"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_48_1","DOI":"10.1109\/ICDE.2018.00057"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_49_1","DOI":"10.1109\/ICDE.2017.93"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_50_1","DOI":"10.1209\/0295-5075\/90\/68002"},{"key":"e_1_3_2_1_51_1","first-page":"456","article-title":"Finding Critical Users in Social Communities via Graph Convolutions","volume":"35","author":"Zhao Kangfei","year":"2023","unstructured":"Kangfei Zhao, Zhiwei Zhang, Yu Rong, Jeffrey Xu Yu, and Junzhou Huang. 2023. Finding Critical Users in Social Communities via Graph Convolutions. IEEE Trans. Knowl. Data Eng., Vol. 35, 1 (2023), 456-468.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_52_1","DOI":"10.1145\/3269206.3269254"}],"event":{"sponsor":["SIGIR ACM Special Interest Group on Information Retrieval","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"acronym":"CIKM '25","name":"CIKM '25: The 34th ACM International Conference on Information and Knowledge Management","location":"Seoul Republic of Korea"},"container-title":["Proceedings of the 34th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3746252.3761073","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:43:29Z","timestamp":1765500209000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3746252.3761073"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,10]]},"references-count":52,"alternative-id":["10.1145\/3746252.3761073","10.1145\/3746252"],"URL":"https:\/\/doi.org\/10.1145\/3746252.3761073","relation":{},"subject":[],"published":{"date-parts":[[2025,11,10]]},"assertion":[{"value":"2025-11-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}