{"total":41,"rows":[{"id":"2411.06070","title":"GFT: Graph Foundation Model with Transferable Tree Vocabulary","created":"2024-11-09","cited_by_count":85,"area":null},{"id":"2303.14859","title":"Mind the Label Shift of Augmentation-based Graph OOD Generalization","created":"2023-03-27","cited_by_count":34,"area":null},{"id":"2310.02579","title":"On the Stability of Expressive Positional Encodings for Graphs","created":"2023-10-04","cited_by_count":33,"area":null},{"id":"2412.16441","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","created":"2024-12-21","cited_by_count":32,"area":null},{"id":"2306.03698","title":"Fine-grained Expressivity of Graph Neural Networks","created":"2023-06-06","cited_by_count":25,"area":null},{"id":"2403.01092","title":"Pairwise Alignment Improves Graph Domain Adaptation","created":"2024-03-02","cited_by_count":25,"area":null},{"id":"2301.12906","title":"Curvature Filtrations for Graph Generative Model Evaluation","created":"2023-01-30","cited_by_count":19,"area":null},{"id":"2306.04495","title":"Limits, approximation and size transferability for GNNs on sparse graphs via graphops","created":"2023-06-07","cited_by_count":18,"area":null},{"id":"2406.03386","title":"Learning Long Range Dependencies on Graphs via Random Walks","created":"2024-06-05","cited_by_count":18,"area":null},{"id":"2402.08907","title":"Subgraph Pooling: Tackling Negative Transfer on Graphs","created":"2024-02-14","cited_by_count":17,"area":null},{"id":"2410.19265","title":"A Survey of Deep Graph Learning under Distribution Shifts: from Graph Out-of-Distribution Generalization to Adaptation","created":"2024-10-25","cited_by_count":17,"area":null},{"id":"2502.02379","title":"No Metric to Rule Them All: Toward Principled Evaluations of Graph-Learning Datasets","created":"2025-02-04","cited_by_count":16,"area":null},{"id":"2306.03256","title":"Explaining and Adapting Graph Conditional Shift","created":"2023-06-05","cited_by_count":14,"area":null},{"id":"2401.03350","title":"Accurate and Scalable Estimation of Epistemic Uncertainty for Graph Neural Networks","created":"2024-01-07","cited_by_count":8,"area":null},{"id":"2410.09118","title":"FSW-GNN: A Bi-Lipschitz WL-Equivalent Graph Neural Network","created":"2024-10-10","cited_by_count":8,"area":null},{"id":"2302.00713","title":"The Weisfeiler-Lehman Distance: Reinterpretation and Connection with GNNs","created":"2023-02-01","cited_by_count":7,"area":null},{"id":"2402.11153","title":"Beyond Generalization: A Survey of Out-Of-Distribution Adaptation on Graphs","created":"2024-02-17","cited_by_count":7,"area":null},{"id":"2505.17293","title":"Graph Data Selection for Domain Adaptation: A Model-Free Approach","created":"2025-05-22","cited_by_count":7,"area":null},{"id":"2401.03597","title":"Few-Shot Causal Representation Learning for Out-of-Distribution Generalization on Heterogeneous Graphs","created":"2024-01-07","cited_by_count":6,"area":null},{"id":"2402.02287","title":"Future Directions in the Theory of Graph Machine Learning","created":"2024-02-03","cited_by_count":6,"area":null},{"id":"2406.04056","title":"Bisimulation Metrics are Optimal Transport Distances, and Can be Computed Efficiently","created":"2024-06-06","cited_by_count":6,"area":null},{"id":"2406.06984","title":"On the H\\\"{o}lder Stability of Multiset and Graph Neural Networks","created":"2024-06-11","cited_by_count":6,"area":null},{"id":"2501.03113","title":"Balancing Efficiency and Expressiveness: Subgraph GNNs with Walk-Based Centrality","created":"2025-01-06","cited_by_count":5,"area":null},{"id":"2505.11298","title":"Graph Representational Learning: When Does More Expressivity Hurt Generalization?","created":"2025-05-16","cited_by_count":5,"area":null},{"id":"2502.16703","title":"Subsampling Graphs with GNN Performance Guarantees","created":"2025-02-23","cited_by_count":4,"area":null},{"id":"2302.08621","title":"Distances for Markov Chains, and Their Differentiation","created":"2023-02-16","cited_by_count":2,"area":null},{"id":"2503.00547","title":"Performance Heterogeneity in Graph Neural Networks: Lessons for Architecture Design and Preprocessing","created":"2025-03-01","cited_by_count":2,"area":null},{"id":"2507.00927","title":"Understanding Generalization in Node and Link Prediction","created":"2025-07-01","cited_by_count":2,"area":null},{"id":"2508.06588","title":"Graph is a Natural Regularization: Revisiting Vector Quantization for Graph Representation Learning","created":"2025-08-08","cited_by_count":2,"area":null},{"id":"2509.01254","title":"What Expressivity Theory Misses: Message Passing Complexity for GNNs","created":"2025-09-01","cited_by_count":2,"area":null},{"id":"2510.10101","title":"On the Rademacher Complexity of Graph Neural Networks: Unifying Expressivity and Geometry","created":"2025-10-11","cited_by_count":2,"area":null},{"id":"2305.12039","title":"Learning for Transductive Threshold Calibration in Open-World Recognition","created":"2023-05-19","cited_by_count":1,"area":null},{"id":"2605.18893","title":"Position: Graph Condensation Needs a Reset -- Move Beyond Full-dataset Training and Model-Dependence","created":"2026-05-17","cited_by_count":1,"area":null},{"id":"2309.10976","title":"Accurate and Scalable Estimation of Epistemic Uncertainty for Graph Neural Networks","created":"2023-09-20","cited_by_count":0,"area":null},{"id":"2406.10500","title":"A Spectral Framework for Evaluating Geodesic Distances Between Graphs","created":"2024-06-15","cited_by_count":0,"area":null},{"id":"2412.08419","title":"Energy Guided smoothness to improve Robustness in Graph Classification","created":"2024-12-11","cited_by_count":0,"area":null},{"id":"2505.24403","title":"On the Lipschitz Continuity of Set Aggregation Functions and Neural Networks for Sets","created":"2025-05-30","cited_by_count":0,"area":null},{"id":"2505.24642","title":"WILTing Trees: Interpreting the Distance Between MPNN Embeddings","created":"2025-05-30","cited_by_count":0,"area":null},{"id":"2602.10031","title":"Graph Learning Should Move Beyond Restrictive Views of Spectral and Message-Passing GNNs","created":"2026-02-10","cited_by_count":0,"area":null},{"id":"2610.15427","title":"Riemannian Graph Tokenizer for Structural Knowledge Transfer","created":"2026-10-11","cited_by_count":0,"area":null},{"id":"2610.19279","title":"Dimension-Free Scaling Laws for Size Generalization: An Exponential Separation","created":"2026-10-13","cited_by_count":0,"area":null}],"next_cursor":null}