{"total":19,"rows":[{"id":"2202.08235","title":"Data Augmentation for Deep Graph Learning: A Survey","created":"2022-02-16","cited_by_count":133,"area":null},{"id":"2205.07424","title":"Trustworthy Graph Neural Networks: Aspects, Methods and Trends","created":"2022-05-16","cited_by_count":89,"area":null},{"id":"2306.02664","title":"Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Data","created":"2023-06-05","cited_by_count":71,"area":null},{"id":"2310.04987","title":"Data-centric Graph Learning: A Survey","created":"2023-10-08","cited_by_count":22,"area":null},{"id":"2411.01410","title":"PageRank Bandits for Link Prediction","created":"2024-11-03","cited_by_count":14,"area":null},{"id":"2410.06976","title":"Matcha: Mitigating Graph Structure Shifts with Test-Time Adaptation","created":"2024-10-09","cited_by_count":10,"area":null},{"id":"2301.02780","title":"Rethinking Explaining Graph Neural Networks via Non-parametric Subgraph Matching","created":"2023-01-07","cited_by_count":8,"area":null},{"id":"2210.13815","title":"FocusedCleaner: Sanitizing Poisoned Graphs for Robust GNN-based Node Classification","created":"2022-10-25","cited_by_count":7,"area":null},{"id":"2403.09171","title":"ADEdgeDrop: Adversarial Edge Dropping for Robust Graph Neural Networks","created":"2024-03-14","cited_by_count":7,"area":null},{"id":"2410.02296","title":"How to Make LMs Strong Node Classifiers?","created":"2024-10-03","cited_by_count":4,"area":null},{"id":"2409.19620","title":"DropEdge not Foolproof: Effective Augmentation Method for Signed Graph Neural Networks","created":"2024-09-29","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":"2311.07929","title":"Variational Graph Autoencoder for Heterogeneous Information Networks with Missing and Inaccurate Attributes","created":"2023-11-14","cited_by_count":1,"area":null},{"id":"2312.07859","title":"Fine-grained Graph Rationalization","created":"2023-12-13","cited_by_count":1,"area":null},{"id":"2405.11531","title":"Knowledge Graph Pruning for Recommendation","created":"2024-05-19","cited_by_count":1,"area":null},{"id":"2205.02998","title":"Optimal Propagation for Graph Neural Networks","created":"2022-05-06","cited_by_count":0,"area":null},{"id":"2305.15811","title":"Unifying gradient regularization for Heterogeneous Graph Neural Networks","created":"2023-05-25","cited_by_count":0,"area":null},{"id":"2307.12555","title":"Robust Graph Contrastive Learning with Information Restoration","created":"2023-07-24","cited_by_count":0,"area":null},{"id":"2310.09705","title":"SGA: A Graph Augmentation Method for Signed Graph Neural Networks","created":"2023-10-15","cited_by_count":0,"area":null}],"next_cursor":null}