{"total":196,"rows":[{"id":"2102.09544","title":"Combinatorial optimization and reasoning with graph neural networks","created":"2021-02-18","cited_by_count":268,"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.03336","title":"Frame Averaging for Invariant and Equivariant Network Design","created":"2021-10-07","cited_by_count":168,"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":"2110.13197","title":"Nested Graph Neural Networks","created":"2021-10-25","cited_by_count":137,"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":"2111.06283","title":"DropGNN: Random Dropouts Increase the Expressiveness of Graph Neural Networks","created":"2021-11-11","cited_by_count":118,"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":"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":"2104.14624","title":"The Logic of Graph Neural Networks","created":"2021-04-29","cited_by_count":85,"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":"2110.00577","title":"Reconstruction for Powerful Graph Representations","created":"2021-10-01","cited_by_count":65,"area":null},{"id":"2203.04810","title":"Benchmarking Graphormer on Large-Scale Molecular Modeling Datasets","created":"2022-03-09","cited_by_count":64,"area":null},{"id":"2111.12128","title":"On the Unreasonable Effectiveness of Feature propagation in Learning on Graphs with Missing Node Features","created":"2021-11-23","cited_by_count":63,"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":"2206.11168","title":"Ordered Subgraph Aggregation Networks","created":"2022-06-22","cited_by_count":57,"area":null},{"id":"2209.15059","title":"Provably expressive temporal graph networks","created":"2022-09-29","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":"2106.06707","title":"Graph Neural Networks with Local Graph Parameters","created":"2021-06-12","cited_by_count":52,"area":null},{"id":"2305.19987","title":"InGram: Inductive Knowledge Graph Embedding via Relation Graphs","created":"2023-05-31","cited_by_count":52,"area":null},{"id":"2107.01495","title":"On Positional and Structural Node Features for Graph Neural Networks on Non-attributed Graphs","created":"2021-07-03","cited_by_count":49,"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":"2206.01003","title":"Shortest Path Networks for Graph Property Prediction","created":"2022-06-02","cited_by_count":46,"area":null},{"id":"2109.10129","title":"Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limits","created":"2021-09-21","cited_by_count":38,"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":"2310.01267","title":"Cooperative Graph Neural Networks","created":"2023-10-02","cited_by_count":36,"area":null},{"id":"2304.01575","title":"The expressive power of pooling in Graph Neural Networks","created":"2023-04-04","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":"2307.07107","title":"Graph Positional and Structural Encoder","created":"2023-07-14","cited_by_count":33,"area":null},{"id":"2302.02209","title":"A Theory of Link Prediction via Relational Weisfeiler-Leman on Knowledge Graphs","created":"2023-02-04","cited_by_count":32,"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":"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":"2312.11143","title":"Learning Domain-Independent Heuristics for Grounded and Lifted Planning","created":"2023-12-18","cited_by_count":31,"area":null},{"id":"2208.10227","title":"One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction","created":"2022-08-22","cited_by_count":27,"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":"2405.18378","title":"A Canonicalization Perspective on Invariant and Equivariant Learning","created":"2024-05-28","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":"2303.04613","title":"The Descriptive Complexity of Graph Neural Networks","created":"2023-03-08","cited_by_count":26,"area":null},{"id":"2306.02866","title":"Learning Probabilistic Symmetrization for Architecture Agnostic Equivariance","created":"2023-06-05","cited_by_count":26,"area":null},{"id":"2310.02156","title":"Probabilistically Rewired Message-Passing Neural Networks","created":"2023-10-03","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":"2502.01122","title":"Learning Efficient Positional Encodings with Graph Neural Networks","created":"2025-02-03","cited_by_count":24,"area":null},{"id":"2210.10759","title":"On Representing Mixed-Integer Linear Programs by Graph Neural Networks","created":"2022-10-19","cited_by_count":23,"area":null},{"id":"2205.06002","title":"Learning Generalized Policies Without Supervision Using GNNs","created":"2022-05-12","cited_by_count":22,"area":null},{"id":"2309.16014","title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","created":"2023-09-27","cited_by_count":22,"area":null},{"id":"2310.04987","title":"Data-centric Graph Learning: A Survey","created":"2023-10-08","cited_by_count":22,"area":null},{"id":"2211.03232","title":"Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks","created":"2022-11-06","cited_by_count":21,"area":null},{"id":"2302.01313","title":"Double Equivariance for Inductive Link Prediction for Both New Nodes and New Relation Types","created":"2023-02-02","cited_by_count":21,"area":null},{"id":"2302.11603","title":"Some Might Say All You Need Is Sum","created":"2023-02-22","cited_by_count":21,"area":null},{"id":"2310.18716","title":"Laplacian Canonization: A Minimalist Approach to Sign and Basis Invariant Spectral Embedding","created":"2023-10-28","cited_by_count":21,"area":null},{"id":"2311.14156","title":"Variational Annealing on Graphs for Combinatorial Optimization","created":"2023-11-23","cited_by_count":21,"area":null},{"id":"2509.21489","title":"GraphPFN: A Prior-Data Fitted Graph Foundation Model","created":"2025-09-25","cited_by_count":21,"area":null},{"id":"2210.09521","title":"A Practical, Progressively-Expressive GNN","created":"2022-10-18","cited_by_count":20,"area":null},{"id":"2405.11951","title":"Distinguished In Uniform: Self Attention Vs. Virtual Nodes","created":"2024-05-20","cited_by_count":20,"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":"2207.11311","title":"Understanding Non-linearity in Graph Neural Networks from the Bayesian-Inference Perspective","created":"2022-07-22","cited_by_count":19,"area":null},{"id":"2210.02636","title":"Geodesic Graph Neural Network for Efficient Graph Representation Learning","created":"2022-10-06","cited_by_count":19,"area":null},{"id":"2210.17224","title":"Improving Graph Neural Networks with Learnable Propagation Operators","created":"2022-10-31","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":"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":"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":"2402.08595","title":"Homomorphism Counts for Graph Neural Networks: All About That Basis","created":"2024-02-13","cited_by_count":16,"area":null},{"id":"2503.21985","title":"Improving Equivariant Networks with Probabilistic Symmetry Breaking","created":"2025-03-27","cited_by_count":16,"area":null},{"id":"2201.13410","title":"Weisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-Colorings","created":"2022-01-31","cited_by_count":15,"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":"2312.02339","title":"Expressive Sign Equivariant Networks for Spectral Geometric Learning","created":"2023-12-04","cited_by_count":15,"area":null},{"id":"2405.17311","title":"Probabilistic Graph Rewiring via Virtual Nodes","created":"2024-05-27","cited_by_count":15,"area":null},{"id":"2306.03032","title":"Classification of Edge-dependent Labels of Nodes in Hypergraphs","created":"2023-06-05","cited_by_count":14,"area":null},{"id":"2310.19285","title":"Facilitating Graph Neural Networks with Random Walk on Simplicial Complexes","created":"2023-10-30","cited_by_count":14,"area":null},{"id":"2206.11010","title":"Agent-based Graph Neural Networks","created":"2022-06-22","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":"2402.07568","title":"Weisfeiler-Leman at the margin: When more expressivity matters","created":"2024-02-12","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":"2206.07729","title":"Taxonomy of Benchmarks in Graph Representation Learning","created":"2022-06-15","cited_by_count":12,"area":null},{"id":"2210.03990","title":"Weisfeiler-Lehman goes Dynamic: An Analysis of the Expressive Power of Graph Neural Networks for Attributed and Dynamic Graphs","created":"2022-10-08","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":"2307.01180","title":"PlanE: Representation Learning over Planar Graphs","created":"2023-07-03","cited_by_count":11,"area":null},{"id":"2310.19142","title":"MAG-GNN: Reinforcement Learning Boosted Graph Neural Network","created":"2023-10-29","cited_by_count":11,"area":null},{"id":"2306.05838","title":"Expectation-Complete Graph Representations with Homomorphisms","created":"2023-06-09","cited_by_count":10,"area":null},{"id":"2402.02484","title":"Weisfeiler Leman for Euclidean Equivariant Machine Learning","created":"2024-02-04","cited_by_count":10,"area":null},{"id":"2407.20871","title":"Co-Neighbor Encoding Schema: A Light-cost Structure Encoding Method for Dynamic Link Prediction","created":"2024-07-30","cited_by_count":10,"area":null},{"id":"2106.08992","title":"On the approximation capability of GNNs in node classification/regression tasks","created":"2021-06-16","cited_by_count":9,"area":null},{"id":"2203.02424","title":"R-GCN: The R Could Stand for Random","created":"2022-03-04","cited_by_count":9,"area":null},{"id":"2402.04621","title":"Feature Distribution on Graph Topology Mediates the Effect of Graph Convolution: Homophily Perspective","created":"2024-02-07","cited_by_count":9,"area":null},{"id":"2406.19244","title":"Improving the Expressiveness of $K$-hop Message-Passing GNNs by Injecting Contextualized Substructure Information","created":"2024-06-27","cited_by_count":9,"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":"2109.10061","title":"Graph Neural Networks for Graph Drawing","created":"2021-09-21","cited_by_count":8,"area":null},{"id":"2203.09555","title":"On the expressive power of message-passing neural networks as global feature map transformers","created":"2022-03-17","cited_by_count":8,"area":null},{"id":"2408.16717","title":"GREAT: A Graph Edge Attention Network for the Electric Vehicle Routing Problem with Asymmetric Costs","created":"2024-08-29","cited_by_count":8,"area":null}],"next_cursor":"100"}