{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T23:03:30Z","timestamp":1784934210718,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Innovation Funding of Institute of Computing Technology, CAS","award":["E361120"],"award-info":[{"award-number":["E361120"]}]},{"DOI":"10.13039\/501100006374","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2022YFB3103700,2022YFB3103704"],"award-info":[{"award-number":["2022YFB3103700,2022YFB3103704"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U21B2046"],"award-info":[{"award-number":["U21B2046"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589335.3651578","type":"proceedings-article","created":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T18:41:21Z","timestamp":1715539281000},"page":"489-492","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Unlink to Unlearn: Simplifying Edge Unlearning in GNNs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-6428-5847","authenticated-orcid":false,"given":"Jiajun","family":"Tan","sequence":"first","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences & University of Chinese Academy of Sciences, Beijing, China, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6146-148X","authenticated-orcid":false,"given":"Fei","family":"Sun","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-2835-4110","authenticated-orcid":false,"given":"Ruichen","family":"Qiu","sequence":"additional","affiliation":[{"name":"University of Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6767-6019","authenticated-orcid":false,"given":"Du","family":"Su","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1081-8119","authenticated-orcid":false,"given":"Huawei","family":"Shen","sequence":"additional","affiliation":[{"name":"Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Aleksandar Bojchevski and Stephan G\u00fcnnemann. 2018. Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Ranking. In ICLR."},{"key":"e_1_3_2_2_2_1","volume-title":"Machine Unlearning","author":"Bourtoule Lucas","unstructured":"Lucas Bourtoule, Varun Chandrasekaran, Christopher A. Choquette-Choo, Hengrui Jia, Adelin Travers, Baiwu Zhang, David Lie, and Nicolas Papernot. 2021. Machine Unlearning. In IEEE S&P. 141--159."},{"key":"e_1_3_2_2_3_1","volume-title":"Towards making systems forget with machine unlearning","author":"Cao Yinzhi","unstructured":"Yinzhi Cao and Junfeng Yang. 2015. Towards making systems forget with machine unlearning. In IEEE S&P. 463--480."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"crossref","unstructured":"Chong Chen Fei Sun Min Zhang and Bolin Ding. 2022a. Recommendation Unlearning. In WebConf. 2768--2777.","DOI":"10.1145\/3485447.3511997"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"crossref","unstructured":"Min Chen Zhikun Zhang Tianhao Wang Michael Backes Mathias Humbert and Yang Zhang. 2022b. Graph unlearning. In SIGSAC. 499--513.","DOI":"10.1145\/3548606.3559352"},{"key":"e_1_3_2_2_6_1","unstructured":"Jiali Cheng George Dasoulas Huan He Chirag Agarwal and Marinka Zitnik. 2022. GNNDelete: A General Strategy for Unlearning in Graph Neural Networks. In ICLR."},{"key":"e_1_3_2_2_7_1","unstructured":"Weilin Cong and Mehrdad Mahdavi. 2023. Efficiently Forgetting What You Have Learned in Graph Representation Learning via Projection. In AISTATS. 6674--6703."},{"key":"e_1_3_2_2_8_1","first-page":"22118","article-title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","volume":"33","author":"Hu Weihua","year":"2020","unstructured":"Weihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec. 2020. Open Graph Benchmark: Datasets for Machine Learning on Graphs. In NIPS, Vol. 33. 22118--22133.","journal-title":"NIPS"},{"key":"e_1_3_2_2_9_1","volume-title":"Kipf and Max Welling","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-Supervised Classification with Graph Convolutional Networks. In ICLR."},{"key":"e_1_3_2_2_10_1","volume-title":"Birds of a feather: Homophily in social networks. Annual review of sociology","author":"McPherson Miller","year":"2001","unstructured":"Miller McPherson, Lynn Smith-Lovin, and James M Cook. 2001. Birds of a feather: Homophily in social networks. Annual review of sociology, Vol. 27, 1 (2001), 415--444."},{"key":"e_1_3_2_2_11_1","volume-title":"Membership inference attack on graph neural networks","author":"Olatunji Iyiola E","unstructured":"Iyiola E Olatunji, Wolfgang Nejdl, and Megha Khosla. 2021. Membership inference attack on graph neural networks. In TPS-ISA. IEEE, 11--20."},{"key":"e_1_3_2_2_12_1","volume-title":"Pitfalls of graph neural network evaluation. arXiv","author":"Shchur Oleksandr","year":"2018","unstructured":"Oleksandr Shchur, Maximilian Mumme, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2018. Pitfalls of graph neural network evaluation. arXiv (2018)."},{"key":"e_1_3_2_2_13_1","unstructured":"Guillem Cucurull Arantxa Casanova Adriana Romero Pietro Li\u00f2 and Yoshua Bengio. 2018. Graph Attention Networks. In ICLR."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Jiancan Wu Yi Yang Yuchun Qian Yongduo Sui Xiang Wang and Xiangnan He. 2023 b. GIF: A General Graph Unlearning Strategy via Influence Function. In WebConf. 651--661.","DOI":"10.1145\/3543507.3583521"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"crossref","unstructured":"Kun Wu Jie Shen Yue Ning Ting Wang and Wendy Hui Wang. 2023 a. Certified edge unlearning for graph neural networks. In SIGKDD. 2606--2617.","DOI":"10.1145\/3580305.3599271"},{"key":"e_1_3_2_2_16_1","first-page":"4","article-title":"A Comprehensive Survey on Graph Neural Networks","volume":"32","author":"Wu Zonghan","year":"2021","unstructured":"Zonghan Wu, Shirui Pan, Fengwen Chen, Guodong Long, Chengqi Zhang, and Philip S. Yu. 2021. A Comprehensive Survey on Graph Neural Networks. IEEE TNNLS, Vol. 32, 1 (2021), 4--24.","journal-title":"IEEE TNNLS"},{"key":"e_1_3_2_2_17_1","unstructured":"Keyulu Xu Weihua Hu Jure Leskovec and Stefanie Jegelka. 2019. How Powerful are Graph Neural Networks?. In ICLR."}],"event":{"name":"WWW '24: The ACM Web Conference 2024","location":"Singapore Singapore","acronym":"WWW '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Companion Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589335.3651578","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589335.3651578","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:33:22Z","timestamp":1755822802000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589335.3651578"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":17,"alternative-id":["10.1145\/3589335.3651578","10.1145\/3589335"],"URL":"https:\/\/doi.org\/10.1145\/3589335.3651578","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}