{"total":23,"rows":[{"id":"2103.14991","title":"Graph Unlearning","created":"2021-03-27","cited_by_count":138,"area":"safety"},{"id":"2304.02835","title":"GIF: A General Graph Unlearning Strategy via Influence Function","created":"2023-04-06","cited_by_count":60,"area":"safety"},{"id":"2211.03216","title":"Unlearning Graph Classifiers with Limited Data Resources","created":"2022-11-06","cited_by_count":31,"area":"safety"},{"id":"2304.03093","title":"Inductive Graph Unlearning","created":"2023-04-06","cited_by_count":31,"area":"safety"},{"id":"2401.11760","title":"Towards Effective and General Graph Unlearning via Mutual Evolution","created":"2024-01-22","cited_by_count":29,"area":"safety"},{"id":"2302.08990","title":"Efficiently Forgetting What You Have Learned in Graph Representation Learning via Projection","created":"2023-02-17","cited_by_count":20,"area":"safety"},{"id":"2403.07353","title":"Graph Unlearning with Efficient Partial Retraining","created":"2024-03-12","cited_by_count":20,"area":"safety"},{"id":"2310.02164","title":"A Survey of Graph Unlearning","created":"2023-08-23","cited_by_count":12,"area":"safety"},{"id":"2501.02728","title":"OpenGU: A Comprehensive Benchmark for Graph Unlearning","created":"2025-01-06","cited_by_count":8,"area":"safety"},{"id":"2505.24089","title":"Practical Bayes-Optimal Membership Inference Attacks","created":"2025-05-30","cited_by_count":5,"area":"safety"},{"id":"2505.09702","title":"Enabling Group Fairness in Graph Unlearning via Bi-level Debiasing","created":"2025-05-14","cited_by_count":3,"area":"safety"},{"id":"2408.09705","title":"Community-Centric Graph Unlearning","created":"2024-08-19","cited_by_count":2,"area":"safety"},{"id":"2501.11823","title":"Toward Scalable Graph Unlearning: A Node Influence Maximization based Approach","created":"2025-01-21","cited_by_count":2,"area":"safety"},{"id":"2505.12614","title":"Adaptive Graph Unlearning","created":"2025-05-19","cited_by_count":2,"area":"safety"},{"id":"2508.12622","title":"Consiglieres in the Shadow: Understanding the Use of Uncensored Large Language Models in Cybercrimes","created":"2025-08-18","cited_by_count":2,"area":"safety"},{"id":"2601.14694","title":"Re-understanding Graph Unlearning through Memorization","created":"2026-01-21","cited_by_count":2,"area":"safety"},{"id":"2506.09803","title":"Devil's Hand: Data Poisoning Attacks to Locally Private Graph Learning Protocols","created":"2025-06-11","cited_by_count":1,"area":"safety"},{"id":"2608.29369","title":"Unlearning on Spatio-Temporal Graphs through Subgraph Virtual Edge Reconstruction","created":"2026-08-29","cited_by_count":1,"area":"safety"},{"id":"2508.02485","title":"Federated Graph Unlearning","created":"2025-08-04","cited_by_count":0,"area":"safety"},{"id":"2511.10936","title":"GraphToxin: Reconstructing Full Unlearned Graphs from Graph Unlearning","created":"2025-11-14","cited_by_count":0,"area":"safety"},{"id":"2603.20339","title":"Graph-Aware Stealthy Poison-Text Backdoors for Text-Attributed Graphs","created":"2026-03-20","cited_by_count":0,"area":"safety"},{"id":"2607.28708","title":"MMFGU: Multimodal Federated Graph Unlearning","created":"2026-07-30","cited_by_count":0,"area":"safety"},{"id":"2609.07063","title":"Trust-But-Verify: Poisoning-Resilient Locally Private Graph Learning Protocols","created":"2026-09-07","cited_by_count":0,"area":"safety"}],"next_cursor":null}