{"total":39,"rows":[{"id":"2402.02216","title":"Position: Graph Foundation Models are Already Here","created":"2024-02-03","cited_by_count":86,"area":null},{"id":"2411.06070","title":"GFT: Graph Foundation Model with Transferable Tree Vocabulary","created":"2024-11-09","cited_by_count":85,"area":null},{"id":"2407.00379","title":"GraphArena: Evaluating and Exploring Large Language Models on Graph Computation","created":"2024-06-29","cited_by_count":49,"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":"2405.18378","title":"A Canonicalization Perspective on Invariant and Equivariant Learning","created":"2024-05-28","cited_by_count":27,"area":null},{"id":"2501.18739","title":"Beyond Message Passing: Neural Graph Pattern Machine","created":"2025-01-30","cited_by_count":17,"area":null},{"id":"2402.08595","title":"Homomorphism Counts for Graph Neural Networks: All About That Basis","created":"2024-02-13","cited_by_count":16,"area":null},{"id":"2406.04336","title":"On the Expressive Power of Spectral Invariant Graph Neural Networks","created":"2024-06-06","cited_by_count":15,"area":null},{"id":"2407.01214","title":"Revisiting Random Walks for Learning on Graphs","created":"2024-07-01","cited_by_count":13,"area":null},{"id":"2410.10051","title":"Towards Bridging Generalization and Expressivity of Graph Neural Networks","created":"2024-10-14","cited_by_count":12,"area":null},{"id":"2505.16130","title":"Generative Graph Pattern Machine","created":"2025-05-22","cited_by_count":11,"area":null},{"id":"2410.18676","title":"Homomorphism Counts as Structural Encodings for Graph Learning","created":"2024-10-24","cited_by_count":7,"area":null},{"id":"2512.21106","title":"Semantic Refinement with LLMs for Graph Representations","created":"2025-12-24","cited_by_count":6,"area":null},{"id":"2409.08389","title":"Higher-Order Topological Directionality and Directed Simplicial Neural Networks","created":"2024-09-12","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":"2603.00618","title":"Multi-Domain Riemannian Graph Gluing for Building Graph Foundation Models","created":"2026-02-28","cited_by_count":5,"area":null},{"id":"2406.12841","title":"Demystifying Higher-Order Graph Neural Networks","created":"2024-06-18","cited_by_count":4,"area":null},{"id":"2412.07407","title":"Towards Graph Foundation Models: A Study on the Generalization of Positional and Structural Encodings","created":"2024-12-10","cited_by_count":4,"area":null},{"id":"2503.00485","title":"Homomorphism Expressivity of Spectral Invariant Graph Neural Networks","created":"2025-03-01","cited_by_count":4,"area":null},{"id":"2506.02293","title":"On Universality Classes of Equivariant Networks","created":"2025-06-02","cited_by_count":4,"area":null},{"id":"2407.03125","title":"Foundations and Frontiers of Graph Learning Theory","created":"2024-07-03","cited_by_count":3,"area":null},{"id":"2504.12588","title":"Plain Transformers Can be Powerful Graph Learners","created":"2025-04-17","cited_by_count":3,"area":null},{"id":"2403.13749","title":"Weisfeiler and Leman Go Loopy: A New Hierarchy for Graph Representational Learning","created":"2024-03-20","cited_by_count":2,"area":null},{"id":"2406.08966","title":"Separation Power of Equivariant Neural Networks","created":"2024-06-13","cited_by_count":2,"area":null},{"id":"2501.12554","title":"Generalization Performance of Hypergraph Neural Networks","created":"2025-01-22","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":"2601.07419","title":"Position: Don't be Afraid of Over-Smoothing And Over-Squashing","created":"2026-01-12","cited_by_count":2,"area":null},{"id":"2410.03517","title":"Fine-Grained Expressive Power of Weisfeiler-Leman: A Homomorphism Counting Perspective","created":"2024-10-04","cited_by_count":1,"area":null},{"id":"2411.02542","title":"Enhancing Graph Neural Networks in Large-scale Traffic Incident Analysis with Concurrency Hypothesis","created":"2024-11-04","cited_by_count":1,"area":null},{"id":"2601.19094","title":"FloydNet: A Learning Paradigm for Global Relational Reasoning","created":"2026-01-27","cited_by_count":1,"area":null},{"id":"2602.18409","title":"Unifying approach to uniform expressivity of graph neural networks","created":"2026-02-20","cited_by_count":1,"area":null},{"id":"2605.05759","title":"Full-Spectrum Graph Neural Networks: Expressive and Scalable","created":"2026-05-07","cited_by_count":1,"area":null},{"id":"2606.26705","title":"Algorithmic Foundations of Deep Learning: Complexity-Theoretic Rates and a Characterization of Universal Approximation","created":"2026-06-25","cited_by_count":1,"area":null},{"id":"2410.01367","title":"Towards Dynamic Graph Neural Networks with Provably High-Order Expressive Power","created":"2024-10-02","cited_by_count":0,"area":null},{"id":"2510.02565","title":"On The Expressive Power of GNN Derivatives","created":"2025-10-02","cited_by_count":0,"area":null},{"id":"2511.12838","title":"Connectivity-Guided Sparsification of 2-FWL GNNs: Preserving Full Expressivity with Improved Efficiency","created":"2025-11-16","cited_by_count":0,"area":null},{"id":"2601.12751","title":"A Boolean Function-Theoretic Framework for Expressivity in GNNs with Applications to Fair Graph Mining","created":"2026-01-19","cited_by_count":0,"area":null},{"id":"2605.00725","title":"Weisfeiler Lehman Test on Combinatorial Complexes: Generalized Expressive Power of Topological Neural Networks","created":"2026-05-01","cited_by_count":0,"area":null},{"id":"2609.34729","title":"Edge-Level Automorphism in GNNs: A Quantitative Framework and Effective Designs For Link Prediction","created":"2026-09-28","cited_by_count":0,"area":null}],"next_cursor":null}