{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T18:50:22Z","timestamp":1769971822621,"version":"3.49.0"},"reference-count":78,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Shanghai Municipal Science and Technology Major Project","award":["2018SHZDZX01"],"award-info":[{"award-number":["2018SHZDZX01"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U20B2051"],"award-info":[{"award-number":["U20B2051"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ZJ Laboratory"},{"DOI":"10.13039\/100020441","name":"Shanghai Center for Brain Science and Brain-Inspired Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100020441","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/tifs.2023.3279979","type":"journal-article","created":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T17:47:54Z","timestamp":1685036874000},"page":"3350-3362","source":"Crossref","is-referenced-by-count":7,"title":["Measures and Optimization for Robustness and Vulnerability in Disconnected Networks"],"prefix":"10.1109","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3296-597X","authenticated-orcid":false,"given":"Liwang","family":"Zhu","sequence":"first","affiliation":[{"name":"Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7862-2051","authenticated-orcid":false,"given":"Qi","family":"Bao","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1260-2079","authenticated-orcid":false,"given":"Zhongzhi","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Intelligent Information Processing, School of Computer Science, Fudan University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-14413-5_10"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/MPOT.2009.933498"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jjimei.2021.100013"},{"key":"ref4","article-title":"Graph measures and network robustness","author":"Ellens","year":"2013","journal-title":"arXiv:1311.5064"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.3390\/math9080895"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0400054101"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.009"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31856-9_44"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1038\/524038a"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/108"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2605088"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2005.1498374"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.87.925"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2017.2687883"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/RISP.1991.130801"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/RISP.1993.287647"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2012.72"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2016.2581305"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/20m1377011"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1288107.1288113"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-018-2112-7"},{"issue":"9","key":"ref22","first-page":"1505","article-title":"The matrix-forest theorem and measuring relations in small social groups","volume":"58","author":"Chebotarev","year":"1997","journal-title":"Autom. Remote Control"},{"issue":"10","key":"ref23","first-page":"1443","article-title":"On proximity measures for graph vertices","volume":"59","author":"Chebotarev","year":"1998","journal-title":"Automat. Remote Control"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/03081089808818591"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.08.030"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.54"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2022.3163672"},{"key":"ref28","first-page":"175","article-title":"Structural robustness of complex networks","volume":"3","author":"Ng","year":"2006","journal-title":"Phys. Rev."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.835750"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2009.5400448"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/050645452"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.153"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2018.2868955"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052610"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxy028"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482274"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2017.2763578"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2018.10.028"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1002\/net.21680"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380093"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371777"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3464390"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/24.370220"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/24.690884"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.016101"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2396795"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.3301533"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190110315"},{"issue":"4","key":"ref50","first-page":"197","article-title":"Finding the most vital edge for graph minimization problems on meshes and hypercubes","volume":"3","author":"Liang","year":"2000","journal-title":"Int. J. Paral. Distrib. Syst. Netw."},{"key":"ref51","first-page":"1","article-title":"A game theoretic approach for k-core minimization","volume-title":"Proc. 19th Int. Conf. Auton. Agents MultiAgent Syst.","author":"Medya"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2170849"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2215882"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.2018.0829"},{"key":"ref55","volume-title":"Scalable Algorithms for Network Design","author":"Medya","year":"2019"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220019"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3170460"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377282"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2019.2940263"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975321.14"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1145\/2903148"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132867"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/3442342"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2719026"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00044"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"key":"ref68","first-page":"498","article-title":"Guarantees for greedy maximization of non-submodular functions with applications","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Bian"},{"issue":"8","key":"ref69","first-page":"64","article-title":"Doubly stochastic graph matrices","volume":"1","author":"Merris","year":"1997","journal-title":"Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat."},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1137\/0124033"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/026\/737400"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375608"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1137\/090771430"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.68"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.2001.9990249"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxab132"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206\/9970396\/10136212.pdf?arnumber=10136212","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,1]],"date-time":"2024-03-01T06:20:09Z","timestamp":1709274009000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10136212\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":78,"URL":"https:\/\/doi.org\/10.1109\/tifs.2023.3279979","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"value":"1556-6013","type":"print"},{"value":"1556-6021","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}