{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T04:01:22Z","timestamp":1751774482528,"version":"3.41.0"},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Young Scientists Fund of the Natural Science Foundation of Shandong Province","doi-asserted-by":"publisher","award":["ZR2022QF134"],"award-info":[{"award-number":["ZR2022QF134"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research and Implementation of Trusted Situation Defense and Threat Trapping Platform Technology for University Data Centers","award":["20230203030SF"],"award-info":[{"award-number":["20230203030SF"]}]},{"name":"Cloud-Edge Collaborative Vehicle Exterior Error-Proof Detection Based on Federated Learning","award":["JJKH20240860KJ"],"award-info":[{"award-number":["JJKH20240860KJ"]}]},{"name":"Fraud Call Detection Based on Federated Learning","award":["JJKH20240861KJ"],"award-info":[{"award-number":["JJKH20240861KJ"]}]},{"name":"Anti-Telecom Network Fraud Detection Based on Graph Federated Learning","award":["20250203124SF"],"award-info":[{"award-number":["20250203124SF"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans.Inform.Forensic Secur."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/tifs.2025.3580218","type":"journal-article","created":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T17:37:28Z","timestamp":1750354648000},"page":"6651-6661","source":"Crossref","is-referenced-by-count":0,"title":["Hypergraph Unlearning: A Size-Based Hyperedge Selection and Coverage Aggregation Approach"],"prefix":"10.1109","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-9094-0638","authenticated-orcid":false,"given":"Jiaquan","family":"Liang","sequence":"first","affiliation":[{"name":"Department of Computer Technology, Changchun University of Technology, Changchun, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8654-2369","authenticated-orcid":false,"given":"Zhiyu","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Computer Technology, Changchun University of Technology, Changchun, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1018-8727","authenticated-orcid":false,"given":"Qi","family":"Luo","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong University, Qingdao, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8907-2064","authenticated-orcid":false,"given":"Zhenzhen","family":"Xie","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong University, Qingdao, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-9747-8969","authenticated-orcid":false,"given":"Gang","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Computer Technology, Changchun University of Technology, Changchun, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6017-975X","authenticated-orcid":false,"given":"Zhipeng","family":"Cai","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Georgia State University, Atlanta, GA, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57959-7"},{"key":"ref2","first-page":"68","article-title":"The California consumer privacy act: Towards a European-style privacy regime in the United States","volume":"23","author":"Pardau","year":"2018","journal-title":"J. Tech. L. Pol\u2019y"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.33242\/rbdc.2020.04.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1108\/IJLMA-05-2024-0174"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.hcc.2024.100211"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.26599\/TST.2023.9010080"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3071274"},{"volume-title":"Graph Machine Learning: Take Graph Data To the Next Level By Applying Machine Learning Techniques and Algorithms","year":"2021","author":"Stamile","key":"ref8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.126441"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3389\/fgene.2021.690049"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3535101"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-022-00763-z"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE51399.2021.00199"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2021.11.078"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00039"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-023-01196-6"},{"key":"ref17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory With Applications","author":"Bondy","year":"1976"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013558"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-024-01253-8"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2024.3377915"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3627673.3679765"},{"key":"ref22","first-page":"722","article-title":"Effective and efficient community search over large-scale hypergraphs","volume-title":"Proc. EDBT","author":"Liu","year":"2025"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-025-00915-x"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.aiopen.2021.01.001"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"ref28","first-page":"13052","article-title":"Let invariant rationale discovery inspire graph contrastive learning","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Li"},{"key":"ref29","article-title":"Learn to unlearn: A survey on machine unlearning","author":"Qu","year":"2023","journal-title":"arXiv:2305.07512"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SP40001.2021.00019"},{"key":"ref31","first-page":"1092","article-title":"Machine unlearning for random forests","volume-title":"Proc. 38th Int. Conf. Mach. Learn.","author":"Brophy"},{"key":"ref32","first-page":"931","article-title":"Descent-to-delete: Gradient-based methods for machine unlearning","volume-title":"Proc. 32nd Int. Conf. Algorithmic Learn. Theory","author":"Neel"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3090019"},{"key":"ref34","first-page":"16319","article-title":"Adaptive machine unlearning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Gupta"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2023.3266233"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3265506"},{"key":"ref37","first-page":"19972","article-title":"Towards unbounded machine unlearning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Kurmanji"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3516576"},{"key":"ref39","article-title":"A survey of machine unlearning","author":"Tam Nguyen","year":"2022","journal-title":"arXiv:2209.02299"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3559352"},{"key":"ref41","article-title":"Certified graph unlearning","author":"Chien","year":"2022","journal-title":"arXiv:2206.09140"},{"key":"ref42","first-page":"3205","article-title":"Inductive graph unlearning","volume-title":"Proc. 32nd USENIX Secur. Symp.","author":"Wang"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3589335.3651265"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/3589335.3651578"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583521"},{"key":"ref46","article-title":"GNNDelete: A general strategy for unlearning in graph neural networks","author":"Cheng","year":"2023","journal-title":"arXiv:2302.13406"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599271"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583547"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2024.3422799"},{"key":"ref50","article-title":"A survey of graph unlearning","author":"Said","year":"2023","journal-title":"arXiv:2310.02164"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3182052"},{"volume-title":"The Partition of India","year":"2009","author":"Talbot","key":"ref52"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1007912.1007931"},{"key":"ref54","first-page":"1885","article-title":"Understanding black-box predictions via influence functions","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Koh"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.2307\/1912791.1969"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1080\/07474930600972467"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2007.366913"}],"container-title":["IEEE Transactions on Information Forensics and Security"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10206\/10810755\/11044357.pdf?arnumber=11044357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:33:42Z","timestamp":1751690022000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11044357\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/tifs.2025.3580218","relation":{},"ISSN":["1556-6013","1556-6021"],"issn-type":[{"type":"print","value":"1556-6013"},{"type":"electronic","value":"1556-6021"}],"subject":[],"published":{"date-parts":[[2025]]}}}