{"total":56,"rows":[{"id":"2111.06283","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","created":"2021-11-11","cited_by_count":118,"area":null},{"id":"2109.10096","title":"Transferability of Graph Neural Networks: an Extended Graphon Approach","created":"2021-09-21","cited_by_count":53,"area":null},{"id":"2106.06946","title":"Boosting Randomized Smoothing with Variance Reduced Classifiers","created":"2021-06-13","cited_by_count":47,"area":null},{"id":"2108.13049","title":"Single Node Injection Attack against Graph Neural Networks","created":"2021-08-30","cited_by_count":45,"area":null},{"id":"2107.00228","title":"Scalable Certified Segmentation via Randomized Smoothing","created":"2021-07-01","cited_by_count":35,"area":null},{"id":"2307.16630","title":"Text-CRS: A Generalized Certified Robustness Framework against Textual Adversarial Attacks","created":"2023-07-31","cited_by_count":34,"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":"2108.09513","title":"A Hard Label Black-box Adversarial Attack Against Graph Neural Networks","created":"2021-08-21","cited_by_count":26,"area":null},{"id":"2106.07767","title":"How does Heterophily Impact the Robustness of Graph Neural Networks? Theoretical Connections and Practical Implications","created":"2021-06-14","cited_by_count":21,"area":null},{"id":"2212.04983","title":"Adversarial Weight Perturbation Improves Generalization in Graph Neural Networks","created":"2022-12-09","cited_by_count":21,"area":null},{"id":"2305.00851","title":"Revisiting Robustness in Graph Machine Learning","created":"2023-05-01","cited_by_count":19,"area":null},{"id":"2109.12727","title":"Anomalous Edge Detection in Edge Exchangeable Social Network Models","created":"2021-09-27","cited_by_count":17,"area":null},{"id":"2302.01757","title":"RS-Del: Edit Distance Robustness Certificates for Sequence Classifiers via Randomized Deletion","created":"2023-01-31","cited_by_count":17,"area":null},{"id":"2302.02829","title":"Collective Robustness Certificates: Exploiting Interdependence in Graph Neural Networks","created":"2023-02-06","cited_by_count":16,"area":null},{"id":"2407.09165","title":"Robust Yet Efficient Conformal Prediction Sets","created":"2024-07-12","cited_by_count":16,"area":null},{"id":"2206.11225","title":"RetrievalGuard: Provably Robust 1-Nearest Neighbor Image Retrieval","created":"2022-06-17","cited_by_count":15,"area":null},{"id":"2305.19521","title":"Incremental Randomized Smoothing Certification","created":"2023-05-31","cited_by_count":12,"area":null},{"id":"2208.01819","title":"Adversarial Camouflage for Node Injection Attack on Graphs","created":"2022-08-03","cited_by_count":11,"area":null},{"id":"2210.16140","title":"Localized Randomized Smoothing for Collective Robustness Certification","created":"2022-10-28","cited_by_count":10,"area":null},{"id":"2301.02039","title":"Randomized Message-Interception Smoothing: Gray-box Certificates for Graph Neural Networks","created":"2023-01-05","cited_by_count":10,"area":null},{"id":"2402.13937","title":"Verifying message-passing neural networks via topology-based bounds tightening","created":"2024-02-21","cited_by_count":10,"area":null},{"id":"2206.05070","title":"Fundamental Limits in Formal Verification of Message-Passing Neural Networks","created":"2022-06-10","cited_by_count":9,"area":null},{"id":"2310.16221","title":"Hierarchical Randomized Smoothing","created":"2023-10-24","cited_by_count":9,"area":null},{"id":"2404.17947","title":"Bounding the Expected Robustness of Graph Neural Networks Subject to Node Feature Attacks","created":"2024-04-27","cited_by_count":9,"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":"2404.15065","title":"Formal Verification of Graph Convolutional Networks with Uncertain Node Features and Uncertain Graph Structure","created":"2024-04-23","cited_by_count":8,"area":null},{"id":"2406.17830","title":"Treatment of Statistical Estimation Problems in Randomized Smoothing for Adversarial Robustness","created":"2024-06-25","cited_by_count":8,"area":null},{"id":"2108.09413","title":"Integer-arithmetic-only Certified Robustness for Quantized Neural Networks","created":"2021-08-21","cited_by_count":7,"area":null},{"id":"2210.15614","title":"Private and Reliable Neural Network Inference","created":"2022-10-27","cited_by_count":7,"area":null},{"id":"2211.14207","title":"Invariance-Aware Randomized Smoothing Certificates","created":"2022-11-25","cited_by_count":7,"area":null},{"id":"2205.13909","title":"(De-)Randomized Smoothing for Decision Stump Ensembles","created":"2022-05-27","cited_by_count":5,"area":null},{"id":"2304.02693","title":"A Certified Radius-Guided Attack Framework to Image Segmentation Models","created":"2023-04-05","cited_by_count":5,"area":null},{"id":"2310.03312","title":"Certifiably Robust Graph Contrastive Learning","created":"2023-10-05","cited_by_count":5,"area":null},{"id":"2407.10867","title":"Provable Robustness of (Graph) Neural Networks Against Data Poisoning and Backdoor Attacks","created":"2024-07-15","cited_by_count":5,"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.05239","title":"Robust Conformal Prediction with a Single Binary Certificate","created":"2025-03-07","cited_by_count":4,"area":null},{"id":"2506.16553","title":"One Sample is Enough to Make Conformal Prediction Robust","created":"2025-06-19","cited_by_count":4,"area":null},{"id":"2508.09320","title":"Exact Verification of Graph Neural Networks with Incremental Constraint Solving","created":"2025-08-12","cited_by_count":4,"area":null},{"id":"2603.26105","title":"Are LLM-Enhanced Graph Neural Networks Robust against Poisoning Attacks?","created":"2026-03-27","cited_by_count":4,"area":null},{"id":"2403.01423","title":"Collective Certified Robustness against Graph Injection Attacks","created":"2024-03-03","cited_by_count":3,"area":null},{"id":"2302.08051","title":"Graph Adversarial Immunization for Certifiable Robustness","created":"2023-02-16","cited_by_count":2,"area":null},{"id":"2306.11915","title":"Structure-Aware Robustness Certificates for Graph Classification","created":"2023-06-20","cited_by_count":2,"area":null},{"id":"2408.00895","title":"Discrete Randomized Smoothing Meets Quantum Computing","created":"2024-08-01","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":"2509.25979","title":"Reconcile Certified Robustness and Accuracy for DNN-based Smoothed Majority Vote Classifier","created":"2025-09-30","cited_by_count":2,"area":null},{"id":"2510.22652","title":"If You Want to Be Robust, Be Wary of Initialization","created":"2025-10-26","cited_by_count":1,"area":null},{"id":"2607.29190","title":"CAGE: Certified Authorization under Typed-Return Uncertainty for Tool-Using Agents","created":"2026-07-31","cited_by_count":1,"area":"agents"},{"id":"2203.11492","title":"Exploring High-Order Structure for Robust Graph Structure Learning","created":"2022-03-22","cited_by_count":0,"area":null},{"id":"2405.08645","title":"Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation","created":"2024-05-14","cited_by_count":0,"area":null},{"id":"2503.17172","title":"Principal Eigenvalue Regularization for Improved Worst-Class Certified Robustness of Smoothed Classifiers","created":"2025-03-21","cited_by_count":0,"area":null},{"id":"2505.08320","title":"Adaptive Branch Specialization in Spectral-Spatial Graph Neural Networks for Certified Robustness","created":"2025-05-13","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":"2510.22643","title":"Enhancing Graph Classification Robustness with Singular Pooling","created":"2025-10-26","cited_by_count":0,"area":null},{"id":"2511.09316","title":"AdaptDel: Adaptable Deletion Rate Randomized Smoothing for Certified Robustness","created":"2025-11-12","cited_by_count":0,"area":null},{"id":"2605.21780","title":"Provable Robustness against Backdoor Attacks via the Primal-Dual Perspective on Differential Privacy","created":"2026-05-20","cited_by_count":0,"area":null},{"id":"2607.18567","title":"Attacking Graph Foundation Models Through Their Shared Representation","created":"2026-07-20","cited_by_count":0,"area":null}],"next_cursor":null}