{"total":227,"rows":[{"id":"2103.03212","title":"Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks","created":"2021-03-04","cited_by_count":221,"area":null},{"id":"2106.12575","title":"Weisfeiler and Lehman Go Cellular: CW Networks","created":"2021-06-23","cited_by_count":218,"area":null},{"id":"2207.02505","title":"Pure Transformers are Powerful Graph Learners","created":"2022-07-06","cited_by_count":188,"area":null},{"id":"2202.13013","title":"Sign and Basis Invariant Networks for Spectral Graph Representation Learning","created":"2022-02-25","cited_by_count":179,"area":null},{"id":"2205.11172","title":"How Powerful are Spectral Graph Neural Networks","created":"2022-05-23","cited_by_count":169,"area":null},{"id":"2110.03753","title":"From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awareness","created":"2021-10-07","cited_by_count":155,"area":null},{"id":"2110.02910","title":"Equivariant Subgraph Aggregation Networks","created":"2021-10-06","cited_by_count":154,"area":null},{"id":"2202.05441","title":"Learning Causally Invariant Representations for Out-of-Distribution Generalization on Graphs","created":"2022-02-11","cited_by_count":144,"area":null},{"id":"2110.13197","title":"Nested Graph Neural Networks","created":"2021-10-25","cited_by_count":137,"area":null},{"id":"2106.06610","title":"Scalars are universal: Equivariant machine learning, structured like classical physics","created":"2021-06-11","cited_by_count":127,"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":"2107.12375","title":"Geometric Deep Learning on Molecular Representations","created":"2021-07-26","cited_by_count":113,"area":null},{"id":"2206.11140","title":"Understanding and Extending Subgraph GNNs by Rethinking Their Symmetries","created":"2022-06-22","cited_by_count":112,"area":null},{"id":"2205.15659","title":"The CLRS Algorithmic Reasoning Benchmark","created":"2022-05-31","cited_by_count":106,"area":null},{"id":"2106.04319","title":"Breaking the Limits of Message Passing Graph Neural Networks","created":"2021-06-08","cited_by_count":101,"area":null},{"id":"2203.00199","title":"Equivariant and Stable Positional Encoding for More Powerful Graph Neural Networks","created":"2022-03-01","cited_by_count":94,"area":null},{"id":"2212.13350","title":"A Generalization of ViT/MLP-Mixer to Graphs","created":"2022-12-27","cited_by_count":93,"area":null},{"id":"2205.13328","title":"How Powerful are K-hop Message Passing Graph Neural Networks","created":"2022-05-26","cited_by_count":90,"area":null},{"id":"2102.07835","title":"Topological Graph Neural Networks","created":"2021-02-15","cited_by_count":87,"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":"2103.05045","title":"Size-Invariant Graph Representations for Graph Classification Extrapolations","created":"2021-03-08","cited_by_count":84,"area":null},{"id":"2209.15486","title":"Graph Neural Networks for Link Prediction with Subgraph Sketching","created":"2022-09-30","cited_by_count":81,"area":null},{"id":"2206.10071","title":"BOND: Benchmarking Unsupervised Outlier Node Detection on Static Attributed Graphs","created":"2022-06-21","cited_by_count":80,"area":null},{"id":"2304.05055","title":"A Comprehensive Survey on Deep Graph Representation Learning","created":"2023-04-11","cited_by_count":72,"area":null},{"id":"2204.01855","title":"A Survey on Graph Representation Learning Methods","created":"2022-04-04","cited_by_count":66,"area":null},{"id":"2110.00577","title":"Reconstruction for Powerful Graph Representations","created":"2021-10-01","cited_by_count":65,"area":null},{"id":"2204.04661","title":"Expressiveness and Approximation Properties of Graph Neural Networks","created":"2022-04-10","cited_by_count":64,"area":null},{"id":"2302.07090","title":"A Complete Expressiveness Hierarchy for Subgraph GNNs via Subgraph Weisfeiler-Lehman Tests","created":"2023-02-14","cited_by_count":64,"area":null},{"id":"2204.07697","title":"Theory of Graph Neural Networks: Representation and Learning","created":"2022-04-16","cited_by_count":61,"area":null},{"id":"2110.15174","title":"On Provable Benefits of Depth in Training Graph Convolutional Networks","created":"2021-10-28","cited_by_count":58,"area":null},{"id":"2203.00112","title":"GraphWorld: Fake Graphs Bring Real Insights for GNNs","created":"2022-02-28","cited_by_count":56,"area":null},{"id":"2210.13978","title":"Boosting the Cycle Counting Power of Graph Neural Networks with I$^2$-GNNs","created":"2022-10-22","cited_by_count":56,"area":null},{"id":"2306.03589","title":"How does over-squashing affect the power of GNNs?","created":"2023-06-06","cited_by_count":53,"area":null},{"id":"2106.06707","title":"Graph Neural Networks with Local Graph Parameters","created":"2021-06-12","cited_by_count":52,"area":null},{"id":"2204.07321","title":"Graph Pooling for Graph Neural Networks: Progress, Challenges, and Opportunities","created":"2022-04-15","cited_by_count":52,"area":null},{"id":"2306.16424","title":"Realistic Synthetic Financial Transactions for Anti-Money Laundering Models","created":"2023-06-22","cited_by_count":50,"area":null},{"id":"2201.12884","title":"A Theoretical Comparison of Graph Neural Network Extensions","created":"2022-01-30","cited_by_count":48,"area":null},{"id":"2102.08786","title":"Walking Out of the Weisfeiler Leman Hierarchy: Graph Learning Beyond Message Passing","created":"2021-02-17","cited_by_count":47,"area":null},{"id":"2202.11097","title":"Message passing all the way up","created":"2022-02-22","cited_by_count":47,"area":null},{"id":"2201.12380","title":"GStarX: Explaining Graph Neural Networks with Structure-Aware Cooperative Games","created":"2022-01-28","cited_by_count":42,"area":null},{"id":"2304.14621","title":"MUDiff: Unified Diffusion for Complete Molecule Generation","created":"2023-04-28","cited_by_count":42,"area":null},{"id":"2302.04451","title":"Generalization in Graph Neural Networks: Improved PAC-Bayesian Bounds on Graph Diffusion","created":"2023-02-09","cited_by_count":40,"area":null},{"id":"2103.01710","title":"Autobahn: Automorphism-based Graph Neural Nets","created":"2021-03-02","cited_by_count":39,"area":null},{"id":"2401.08514","title":"Beyond Weisfeiler-Lehman: A Quantitative Framework for GNN Expressiveness","created":"2024-01-16","cited_by_count":39,"area":null},{"id":"2302.11556","title":"Equivariant Polynomials for Graph Neural Networks","created":"2023-02-22","cited_by_count":38,"area":null},{"id":"2203.13913","title":"SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks","created":"2022-03-25","cited_by_count":37,"area":null},{"id":"2308.16212","title":"RetroBridge: Modeling Retrosynthesis with Markov Bridges","created":"2023-08-30","cited_by_count":36,"area":null},{"id":"2210.15304","title":"Explaining the Explainers in Graph Neural Networks: a Comparative Study","created":"2022-10-27","cited_by_count":35,"area":null},{"id":"2304.07702","title":"An Empirical Study of Realized GNN Expressiveness","created":"2023-04-16","cited_by_count":33,"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":"2301.11039","title":"WL meet VC","created":"2023-01-26","cited_by_count":31,"area":null},{"id":"2303.02918","title":"Graph Positional Encoding via Random Feature Propagation","created":"2023-03-06","cited_by_count":31,"area":null},{"id":"2211.00692","title":"Towards Better Out-of-Distribution Generalization of Neural Algorithmic Reasoning Tasks","created":"2022-11-01","cited_by_count":30,"area":null},{"id":"2410.05298","title":"How Do Large Language Models Understand Graph Patterns? A Benchmark for Graph Pattern Comprehension","created":"2024-10-04","cited_by_count":30,"area":null},{"id":"2202.13538","title":"Algorithm and System Co-design for Efficient Subgraph-based Graph Representation Learning","created":"2022-02-28","cited_by_count":28,"area":null},{"id":"2306.11586","title":"Provably Powerful Graph Neural Networks for Directed Multigraphs","created":"2023-06-20","cited_by_count":27,"area":null},{"id":"2308.08235","title":"The Expressive Power of Graph Neural Networks: A Survey","created":"2023-08-16","cited_by_count":27,"area":null},{"id":"2105.13099","title":"On the Universality of Graph Neural Networks on Large Random Graphs","created":"2021-05-27","cited_by_count":26,"area":null},{"id":"2310.10121","title":"From Continuous Dynamics to Graph Neural Networks: Neural Diffusion and Beyond","created":"2023-10-16","cited_by_count":26,"area":null},{"id":"2306.03698","title":"Fine-grained Expressivity of Graph Neural Networks","created":"2023-06-06","cited_by_count":25,"area":null},{"id":"2305.07100","title":"E(n) Equivariant Message Passing Simplicial Networks","created":"2023-05-11","cited_by_count":23,"area":null},{"id":"2106.03693","title":"Learning by Transference: Training Graph Neural Networks on Growing Graphs","created":"2021-06-07","cited_by_count":22,"area":null},{"id":"2206.08005","title":"Evaluating Self-Supervised Learning for Molecular Graph Embeddings","created":"2022-06-16","cited_by_count":22,"area":null},{"id":"2402.10011","title":"Clifford Group Equivariant Simplicial Message Passing Networks","created":"2024-02-15","cited_by_count":22,"area":null},{"id":"2210.09521","title":"A Practical, Progressively-Expressive GNN","created":"2022-10-18","cited_by_count":20,"area":null},{"id":"2402.14202","title":"Comparing Graph Transformers via Positional Encodings","created":"2024-02-22","cited_by_count":20,"area":null},{"id":"2104.02995","title":"Theoretically Improving Graph Neural Networks via Anonymous Walk Graph Kernels","created":"2021-04-07","cited_by_count":19,"area":null},{"id":"2105.05911","title":"The Power of the Weisfeiler-Leman Algorithm for Machine Learning with Graphs","created":"2021-05-12","cited_by_count":19,"area":null},{"id":"2301.12906","title":"Curvature Filtrations for Graph Generative Model Evaluation","created":"2023-01-30","cited_by_count":19,"area":null},{"id":"2302.09826","title":"On the Expressivity of Persistent Homology in Graph Learning","created":"2023-02-20","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":"2309.00976","title":"Pure Message Passing Can Estimate Common Neighbor for Link Prediction","created":"2023-09-02","cited_by_count":18,"area":null},{"id":"2204.00887","title":"Dimensionless machine learning: Imposing exact units equivariance","created":"2022-04-02","cited_by_count":17,"area":null},{"id":"2305.04963","title":"From Relational Pooling to Subgraph GNNs: A Universal Framework for More Expressive Graph Neural Networks","created":"2023-05-08","cited_by_count":17,"area":null},{"id":"2306.13411","title":"Neural Algorithmic Reasoning Without Intermediate Supervision","created":"2023-06-23","cited_by_count":17,"area":null},{"id":"2310.20082","title":"Efficient Subgraph GNNs by Learning Effective Selection Policies","created":"2023-10-30","cited_by_count":17,"area":null},{"id":"2501.18739","title":"Beyond Message Passing: Neural Graph Pattern Machine","created":"2025-01-30","cited_by_count":17,"area":null},{"id":"2204.01376","title":"Synthetic Graph Generation to Benchmark Graph Learning","created":"2022-04-04","cited_by_count":16,"area":null},{"id":"2308.10436","title":"Approximately Equivariant Graph Networks","created":"2023-08-21","cited_by_count":16,"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":"2202.10156","title":"1-WL Expressiveness Is (Almost) All You Need","created":"2022-02-21","cited_by_count":15,"area":null},{"id":"2205.14368","title":"Going Deeper into Permutation-Sensitive Graph Neural Networks","created":"2022-05-28","cited_by_count":15,"area":null},{"id":"2303.00579","title":"Are More Layers Beneficial to Graph Transformers?","created":"2023-03-01","cited_by_count":15,"area":null},{"id":"2312.02339","title":"Expressive Sign Equivariant Networks for Spectral Geometric Learning","created":"2023-12-04","cited_by_count":15,"area":null},{"id":"2403.06095","title":"RepoHyper: Search-Expand-Refine on Semantic Graphs for Repository-Level Code Completion","created":"2024-03-10","cited_by_count":15,"area":null},{"id":"2208.10428","title":"Equivariant Hypergraph Neural Networks","created":"2022-08-22","cited_by_count":14,"area":null},{"id":"2405.13526","title":"Understanding Virtual Nodes: Oversquashing and Node Heterogeneity","created":"2024-05-22","cited_by_count":14,"area":null},{"id":"2206.08561","title":"Boosting Graph Structure Learning with Dummy Nodes","created":"2022-06-17","cited_by_count":13,"area":null},{"id":"2302.03266","title":"Learning to Count Isomorphisms with Graph Neural Networks","created":"2023-02-07","cited_by_count":13,"area":null},{"id":"2303.10576","title":"An Efficient Subgraph GNN with Provable Substructure Counting Power","created":"2023-03-19","cited_by_count":13,"area":null},{"id":"2306.03266","title":"Extending the Design Space of Graph Neural Networks by Rethinking Folklore Weisfeiler-Lehman","created":"2023-06-05","cited_by_count":13,"area":null},{"id":"2401.01869","title":"On the hardness of learning under symmetries","created":"2024-01-03","cited_by_count":13,"area":null},{"id":"2406.05815","title":"What Can We Learn from State Space Models for Machine Learning on Graphs?","created":"2024-06-09","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":"2211.16494","title":"On the Ability of Graph Neural Networks to Model Interactions Between Vertices","created":"2022-11-29","cited_by_count":12,"area":null},{"id":"2309.04941","title":"Distance-Restricted Folklore Weisfeiler-Leman GNNs with Provable Cycle Counting Power","created":"2023-09-10","cited_by_count":12,"area":null},{"id":"2112.08764","title":"Graph Convolutional Networks with Dual Message Passing for Subgraph Isomorphism Counting and Matching","created":"2021-12-16","cited_by_count":11,"area":null},{"id":"2209.12054","title":"From Local to Global: Spectral-Inspired Graph Neural Networks","created":"2022-09-24","cited_by_count":11,"area":null},{"id":"2308.06838","title":"Weisfeiler and Lehman Go Paths: Learning Topological Features via Path Complexes","created":"2023-08-13","cited_by_count":11,"area":null}],"next_cursor":"100"}