{"total":37,"rows":[{"id":"2310.19737","title":"Adversarial Attacks and Defenses in Large Language Models: Old and New Threats","created":"2023-10-30","cited_by_count":49,"area":null},{"id":"2306.15427","title":"Adversarial Training for Graph Neural Networks: Pitfalls, Solutions, and New Directions","created":"2023-06-27","cited_by_count":28,"area":null},{"id":"2408.08685","title":"Can Large Language Models Improve the Adversarial Robustness of Graph Neural Networks?","created":"2024-08-16","cited_by_count":23,"area":null},{"id":"2305.00851","title":"Revisiting Robustness in Graph Machine Learning","created":"2023-05-01","cited_by_count":19,"area":null},{"id":"2407.09165","title":"Robust Yet Efficient Conformal Prediction Sets","created":"2024-07-12","cited_by_count":16,"area":null},{"id":"2506.17709","title":"CEGA: A Cost-Effective Approach for Graph-Based Model Extraction and Acquisition","created":"2025-06-21","cited_by_count":10,"area":null},{"id":"2308.10779","title":"Spear and Shield: Adversarial Attacks and Defense Methods for Model-Based Link Prediction on Continuous-Time Dynamic Graphs","created":"2023-08-21","cited_by_count":9,"area":null},{"id":"2310.16221","title":"Hierarchical Randomized Smoothing","created":"2023-10-24","cited_by_count":9,"area":null},{"id":"2308.07834","title":"Simple and Efficient Partial Graph Adversarial Attack: A New Perspective","created":"2023-08-15","cited_by_count":8,"area":null},{"id":"2311.14934","title":"Robust Graph Neural Networks via Unbiased Aggregation","created":"2023-11-25","cited_by_count":8,"area":null},{"id":"2312.03979","title":"Node-aware Bi-smoothing: Certified Robustness against Graph Injection Attacks","created":"2023-12-07","cited_by_count":8,"area":null},{"id":"2305.15792","title":"IDEA: Invariant Defense for Graph Adversarial Robustness","created":"2023-05-25","cited_by_count":4,"area":null},{"id":"2503.11910","title":"RTD-Lite: Scalable Topological Analysis for Comparing Weighted Graphs in Learning Tasks","created":"2025-03-14","cited_by_count":4,"area":null},{"id":"2311.17853","title":"On the Adversarial Robustness of Graph Contrastive Learning Methods","created":"2023-11-29","cited_by_count":2,"area":null},{"id":"2406.03833","title":"Talos: A More Effective and Efficient Adversarial Defense for GNN Models Based on the Global Homophily of Graphs","created":"2024-06-06","cited_by_count":2,"area":null},{"id":"2407.19155","title":"Debiased Graph Poisoning Attack via Contrastive Surrogate Objective","created":"2024-07-27","cited_by_count":2,"area":null},{"id":"2503.18503","title":"Deterministic Certification of Graph Neural Networks against Graph Poisoning Attacks with Arbitrary Perturbations","created":"2025-03-24","cited_by_count":2,"area":null},{"id":"2503.22998","title":"AuditVotes: Elevating Provable Defense for GNNs with Efficient Augmentation and Conditional Smoothing","created":"2025-03-29","cited_by_count":2,"area":null},{"id":"2605.14605","title":"A Few Steps Further: Why Defenses Against Malicious Finetuning Erode Under Continued Training","created":"2026-05-14","cited_by_count":2,"area":null},{"id":"2306.02002","title":"Can Directed Graph Neural Networks be Adversarially Robust?","created":"2023-06-03","cited_by_count":1,"area":null},{"id":"2311.06942","title":"Resilient Graph Neural Networks: A Coupled Dynamical Systems Approach","created":"2023-11-12","cited_by_count":1,"area":null},{"id":"2312.06568","title":"Sparse but Strong: Crafting Adversarially Robust Graph Lottery Tickets","created":"2023-12-11","cited_by_count":1,"area":null},{"id":"2406.13920","title":"Understanding the Robustness of Graph Neural Networks against Adversarial Attacks","created":"2024-06-20","cited_by_count":1,"area":null},{"id":"2407.11764","title":"Adversarial Robustness of Graph Transformers","created":"2024-07-16","cited_by_count":1,"area":null},{"id":"2501.05015","title":"On Measuring Unnoticeability of Graph Adversarial Attacks: Observations, New Measure, and Applications","created":"2025-01-09","cited_by_count":1,"area":null},{"id":"2510.17185","title":"Robustness in Text-Attributed Graph Learning: Insights, Trade-offs, and New Defenses","created":"2025-10-20","cited_by_count":1,"area":null},{"id":"2309.03648","title":"Promoting Fairness in GNNs: A Characterization of Stability","created":"2023-09-07","cited_by_count":0,"area":null},{"id":"2312.05502","title":"Poisoning $\\times$ Evasion: Symbiotic Adversarial Robustness for Graph Neural Networks","created":"2023-12-09","cited_by_count":0,"area":null},{"id":"2403.09901","title":"Robust Subgraph Learning by Monitoring Early Training Representations","created":"2024-03-14","cited_by_count":0,"area":null},{"id":"2403.12399","title":"Dynamic Gradient Influencing for Viral Marketing Using Graph Neural Networks","created":"2024-03-19","cited_by_count":0,"area":null},{"id":"2406.02059","title":"Graph Adversarial Diffusion Convolution","created":"2024-06-04","cited_by_count":0,"area":null},{"id":"2411.04512","title":"Normalized Space Alignment: A Versatile Metric for Representation Analysis","created":"2024-11-07","cited_by_count":0,"area":null},{"id":"2502.01272","title":"Boosting Graph Robustness Against Backdoor Attacks: An Over-Similarity Perspective","created":"2025-02-03","cited_by_count":0,"area":null},{"id":"2507.08212","title":"EvA: Evolutionary Attacks on Graphs","created":"2025-07-10","cited_by_count":0,"area":null},{"id":"2605.05534","title":"Adversarial Graph Neural Network Benchmarks: Towards Practical and Fair Evaluation","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.23239","title":"Self-supervised Adversarial Purification for Graph Neural Networks","created":"2026-05-22","cited_by_count":0,"area":null},{"id":"2608.29054","title":"Let Prompts Bridge Defense Knowledge: Transferable Graph Purification via Vulnerability-Aware GPL","created":"2026-08-29","cited_by_count":0,"area":null}],"next_cursor":null}