{"total":45,"rows":[{"id":"2205.12454","title":"Recipe for a General, Powerful, Scalable Graph Transformer","created":"2022-05-25","cited_by_count":713,"area":null},{"id":"2112.09992","title":"Weisfeiler and Leman go Machine Learning: The Story so far","created":"2021-12-18","cited_by_count":122,"area":null},{"id":"2301.09505","title":"Rethinking the Expressive Power of GNNs via Graph Biconnectivity","created":"2023-01-23","cited_by_count":119,"area":null},{"id":"2309.00367","title":"Where Did the Gap Go? Reassessing the Long-Range Graph Benchmark","created":"2023-09-01","cited_by_count":85,"area":null},{"id":"2203.13913","title":"SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks","created":"2022-03-25","cited_by_count":37,"area":null},{"id":"2310.01267","title":"Cooperative Graph Neural Networks","created":"2023-10-02","cited_by_count":36,"area":null},{"id":"2306.05955","title":"Path Neural Networks: Expressive and Accurate Graph Neural Networks","created":"2023-06-09","cited_by_count":32,"area":null},{"id":"2312.16560","title":"Adaptive Message Passing: A General Framework to Mitigate Oversmoothing, Oversquashing, and Underreaching","created":"2023-12-27","cited_by_count":24,"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":"2501.18739","title":"Beyond Message Passing: Neural Graph Pattern Machine","created":"2025-01-30","cited_by_count":17,"area":null},{"id":"2405.13526","title":"Understanding Virtual Nodes: Oversquashing and Node Heterogeneity","created":"2024-05-22","cited_by_count":14,"area":null},{"id":"2111.06592","title":"Implicit vs Unfolded Graph Neural Networks","created":"2021-11-12","cited_by_count":13,"area":null},{"id":"2402.02005","title":"Topology-Informed Graph Transformer","created":"2024-02-03","cited_by_count":13,"area":null},{"id":"2407.01214","title":"Revisiting Random Walks for Learning on Graphs","created":"2024-07-01","cited_by_count":13,"area":null},{"id":"2411.12732","title":"Benchmarking Positional Encodings for GNNs and Graph Transformers","created":"2024-11-19","cited_by_count":13,"area":null},{"id":"2502.02216","title":"Flatten Graphs as Sequences: Transformers are Scalable Graph Generators","created":"2025-02-04","cited_by_count":13,"area":null},{"id":"2401.10119","title":"Towards Principled Graph Transformers","created":"2024-01-18","cited_by_count":11,"area":null},{"id":"2408.00165","title":"Non-convolutional Graph Neural Networks","created":"2024-07-31","cited_by_count":11,"area":null},{"id":"2505.16130","title":"Generative Graph Pattern Machine","created":"2025-05-22","cited_by_count":11,"area":null},{"id":"2510.01510","title":"Flock: A Knowledge Graph Foundation Model via Learning on Random Walks","created":"2025-10-01","cited_by_count":9,"area":null},{"id":"2410.05499","title":"Unitary convolutions for learning on graphs and groups","created":"2024-10-07","cited_by_count":8,"area":null},{"id":"2411.15671","title":"Best of Both Worlds: Advantages of Hybrid Graph Sequence Models","created":"2024-11-23","cited_by_count":6,"area":null},{"id":"2512.21106","title":"Semantic Refinement with LLMs for Graph Representations","created":"2025-12-24","cited_by_count":6,"area":null},{"id":"2303.00613","title":"Diffusing Graph Attention","created":"2023-03-01","cited_by_count":5,"area":null},{"id":"2404.13604","title":"CKGConv: General Graph Convolution with Continuous Kernels","created":"2024-04-21","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":"2405.19779","title":"Automatic Graph Topology-Aware Transformer","created":"2024-05-30","cited_by_count":4,"area":null},{"id":"2110.01872","title":"Permute Me Softly: Learning Soft Permutations for Graph Representations","created":"2021-10-05","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":"2511.13010","title":"Are Graph Transformers Necessary? Efficient Long-Range Message Passing with Fractal Nodes in MPNNs","created":"2025-11-17","cited_by_count":3,"area":null},{"id":"2511.08028","title":"Generalizable Insights for Graph Transformers in Theory and Practice","created":"2025-11-11","cited_by_count":2,"area":null},{"id":"2604.17324","title":"Capacity-Controlled Global Attention for Graph Transformers","created":"2026-04-19","cited_by_count":2,"area":null},{"id":"2412.02285","title":"GQWformer: A Quantum-based Transformer for Graph Representation Learning","created":"2024-12-03","cited_by_count":1,"area":null},{"id":"2508.05070","title":"TANGO: Graph Neural Dynamics via Learned Energy and Tangential Flows","created":"2025-08-07","cited_by_count":1,"area":null},{"id":"2510.22520","title":"Random Search Neural Networks for Efficient and Expressive Graph Learning","created":"2025-10-26","cited_by_count":1,"area":null},{"id":"2605.12358","title":"From Message-Passing to Linearized Graph Sequence Models","created":"2026-05-12","cited_by_count":1,"area":null},{"id":"2606.06364","title":"End-to-End Subgraph Detection with GraphDETR","created":"2026-06-04","cited_by_count":1,"area":null},{"id":"2404.03434","title":"Learning From Simplicial Data Based on Random Walks and 1D Convolutions","created":"2024-04-04","cited_by_count":0,"area":null},{"id":"2502.18026","title":"ExPath: Targeted Pathway Inference for Biological Knowledge Bases via Graph Learning and Explanation","created":"2025-02-25","cited_by_count":0,"area":null},{"id":"2506.06784","title":"Caterpillar GNN: Replacing Message Passing with Efficient Aggregation","created":"2025-06-07","cited_by_count":0,"area":null},{"id":"2509.01381","title":"Learn to Jump: Adaptive Random Walks for Long-Range Propagation through Graph Hierarchies","created":"2025-09-01","cited_by_count":0,"area":null},{"id":"2510.14336","title":"DARTS-GT: Differentiable Architecture Search for Graph Transformers with Quantifiable Instance-Specific Interpretability Analysis","created":"2025-10-16","cited_by_count":0,"area":null},{"id":"2605.13383","title":"Beyond Oversquashing: Understanding Signal Propagation in GNNs Via Observables","created":"2026-05-13","cited_by_count":0,"area":null},{"id":"2608.09031","title":"HOPPER: Learnable Hop Extraction for Linearized Graph Sequence Models","created":"2026-08-10","cited_by_count":0,"area":null},{"id":"2610.03556","title":"Get a GRIP, this will be a long TRIP: A Quantifiable Long-Range Framework for Verifying Over-squashing","created":"2026-10-02","cited_by_count":0,"area":null}],"next_cursor":null}