{"total":118,"rows":[{"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":"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":"2301.09505","title":"Rethinking the Expressive Power of GNNs via Graph Biconnectivity","created":"2023-01-23","cited_by_count":119,"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":"2301.12780","title":"Equivariant Architectures for Learning in Deep Weight Spaces","created":"2023-01-30","cited_by_count":107,"area":null},{"id":"2301.09308","title":"On the Expressive Power of Geometric Graph Neural Networks","created":"2023-01-23","cited_by_count":90,"area":null},{"id":"2302.04181","title":"Attending to Graph Transformers","created":"2023-02-08","cited_by_count":83,"area":null},{"id":"2206.11168","title":"Ordered Subgraph Aggregation Networks","created":"2022-06-22","cited_by_count":57,"area":null},{"id":"2211.08854","title":"Graph Filters for Signal Processing and Machine Learning on Graphs","created":"2022-11-16","cited_by_count":53,"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":"2202.11097","title":"Message passing all the way up","created":"2022-02-22","cited_by_count":47,"area":null},{"id":"2304.04757","title":"A new perspective on building efficient and expressive 3D equivariant graph neural networks","created":"2023-04-07","cited_by_count":47,"area":null},{"id":"2212.01842","title":"GraphGDP: Generative Diffusion Processes for Permutation Invariant Graph Generation","created":"2022-12-04","cited_by_count":43,"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":"2205.02956","title":"Low Dimensional Invariant Embeddings for Universal Geometric Learning","created":"2022-05-05","cited_by_count":38,"area":null},{"id":"2205.15117","title":"OOD Link Prediction Generalization Capabilities of Message-Passing GNNs in Larger Test Graphs","created":"2022-05-30","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":"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":"2211.04952","title":"Graph Neural Networks with Adaptive Readouts","created":"2022-11-09","cited_by_count":29,"area":null},{"id":"2303.04613","title":"The Descriptive Complexity of Graph Neural Networks","created":"2023-03-08","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":"2210.15956","title":"Generalized Laplacian Positional Encoding for Graph Representation Learning","created":"2022-10-28","cited_by_count":21,"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":"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":"2505.15547","title":"Oversmoothing, Oversquashing, Heterophily, Long-Range, and more: Demystifying Common Beliefs in Graph Machine Learning","created":"2025-05-21","cited_by_count":19,"area":null},{"id":"2410.06530","title":"TopoTune : A Framework for Generalized Combinatorial Complex Neural Networks","created":"2024-10-09","cited_by_count":18,"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":"2202.10156","title":"1-WL Expressiveness Is (Almost) All You Need","created":"2022-02-21","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":"2406.04336","title":"On the Expressive Power of Spectral Invariant Graph Neural Networks","created":"2024-06-06","cited_by_count":15,"area":null},{"id":"2502.16533","title":"A Survey of Graph Transformers: Architectures, Theories and Applications","created":"2025-02-23","cited_by_count":14,"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":"2208.04852","title":"Graph neural networks for the prediction of molecular structure-property relationships","created":"2022-07-25","cited_by_count":12,"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":"2203.01216","title":"A Simple and Universal Rotation Equivariant Point-cloud Network","created":"2022-03-02","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":"2401.10119","title":"Towards Principled Graph Transformers","created":"2024-01-18","cited_by_count":11,"area":null},{"id":"2402.02484","title":"Weisfeiler Leman for Euclidean Equivariant Machine Learning","created":"2024-02-04","cited_by_count":10,"area":null},{"id":"2503.01431","title":"How simple can you go? An off-the-shelf transformer approach to molecular dynamics","created":"2025-03-03","cited_by_count":10,"area":null},{"id":"2205.10914","title":"Weisfeiler and Leman Go Walking: Random Walk Kernels Revisited","created":"2022-05-22","cited_by_count":9,"area":null},{"id":"2303.12853","title":"Three iterations of $(d-1)$-WL test distinguish non isometric clouds of $d$-dimensional points","created":"2023-03-22","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":"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":"2402.08450","title":"Subgraphormer: Unifying Subgraph GNNs and Graph Transformers via Graph Products","created":"2024-02-13","cited_by_count":8,"area":null},{"id":"2406.03148","title":"Aligning Transformers with Weisfeiler-Leman","created":"2024-06-05","cited_by_count":8,"area":null},{"id":"2406.09291","title":"A Flexible, Equivariant Framework for Subgraph GNNs via Graph Products and Graph Coarsening","created":"2024-06-13","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":"2211.02501","title":"Weisfeiler and Leman go Hyperbolic: Learning Distance Preserving Node Representations","created":"2022-11-04","cited_by_count":7,"area":null},{"id":"2304.10933","title":"Self-Attention in Colors: Another Take on Encoding Graph Structure in Transformers","created":"2023-04-21","cited_by_count":7,"area":null},{"id":"2404.13344","title":"GRANOLA: Adaptive Normalization for Graph Neural Networks","created":"2024-04-20","cited_by_count":7,"area":null},{"id":"2407.08244","title":"Synchronous Diffusion for Unsupervised Smooth Non-Rigid 3D Shape Matching","created":"2024-07-11","cited_by_count":7,"area":null},{"id":"2206.09567","title":"Two-Dimensional Weisfeiler-Lehman Graph Neural Networks for Link Prediction","created":"2022-06-20","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":"2409.17510","title":"NeuroPath: A Neural Pathway Transformer for Joining the Dots of Human Connectomes","created":"2024-09-26","cited_by_count":6,"area":null},{"id":"2410.02622","title":"Diss-l-ECT: Dissecting Graph Data with Local Euler Characteristic Transforms","created":"2024-10-03","cited_by_count":6,"area":null},{"id":"2209.09048","title":"Gradual Weisfeiler-Leman: Slow and Steady Wins the Race","created":"2022-09-19","cited_by_count":5,"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":"2206.02059","title":"Empowering GNNs via Edge-Aware Weisfeiler-Leman Algorithm","created":"2022-06-04","cited_by_count":4,"area":null},{"id":"2209.06589","title":"Towards Better Generalization with Flexible Representation of Multi-Module Graph Neural Networks","created":"2022-09-14","cited_by_count":4,"area":null},{"id":"2308.15283","title":"Structural Node Embeddings with Homomorphism Counts","created":"2023-08-29","cited_by_count":4,"area":null},{"id":"2312.05905","title":"Improving Subgraph-GNNs via Edge-Level Ego-Network Encodings","created":"2023-12-10","cited_by_count":4,"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":"2403.07849","title":"Iterative Graph Neural Network Enhancement via Frequent Subgraph Mining of Explanations","created":"2024-03-12","cited_by_count":3,"area":null},{"id":"2409.08217","title":"CliquePH: Higher-Order Information for Graph Neural Networks through Persistent Homology on Clique Graphs","created":"2024-09-12","cited_by_count":3,"area":null},{"id":"2504.13786","title":"On the Relationship Between Robustness and Expressivity of Graph Neural Networks","created":"2025-04-18","cited_by_count":3,"area":null},{"id":"2506.05530","title":"Spectral Graph Neural Networks are Incomplete on Graphs with a Simple Spectrum","created":"2025-06-05","cited_by_count":3,"area":null},{"id":"2506.13911","title":"Logical Expressiveness of Graph Neural Networks with Hierarchical Node Individualization","created":"2025-06-16","cited_by_count":3,"area":null},{"id":"2511.08846","title":"On topological descriptors for graph products","created":"2025-11-12","cited_by_count":3,"area":null},{"id":"2206.06758","title":"Universally Expressive Communication in Multi-Agent Reinforcement Learning","created":"2022-06-14","cited_by_count":2,"area":null},{"id":"2211.14906","title":"Beyond 1-WL with Local Ego-Network Encodings","created":"2022-11-27","cited_by_count":2,"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":"2407.02013","title":"DiGRAF: Diffeomorphic Graph-Adaptive Activation Function","created":"2024-07-02","cited_by_count":2,"area":null},{"id":"2411.02271","title":"On the Utilization of Unique Node Identifiers in Graph Neural Networks","created":"2024-11-04","cited_by_count":2,"area":null},{"id":"2505.24438","title":"Weisfeiler and Leman Follow the Arrow of Time: Expressive Power of Message Passing in Temporal Event Graphs","created":"2025-05-30","cited_by_count":2,"area":null},{"id":"2506.06571","title":"Graph Persistence goes Spectral","created":"2025-06-06","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":"2604.19212","title":"The Logical Expressiveness of Topological Neural Networks","created":"2026-04-21","cited_by_count":2,"area":null},{"id":"2605.07397","title":"Have Graph -- Will Lift? The Case for Higher-Order Benchmarks","created":"2026-05-08","cited_by_count":2,"area":null},{"id":"2310.11281","title":"Self-supervision meets kernel graph neural models: From architecture to augmentations","created":"2023-10-17","cited_by_count":1,"area":null},{"id":"2403.06817","title":"Are Targeted Messages More Effective?","created":"2024-03-11","cited_by_count":1,"area":null},{"id":"2506.05814","title":"Positional Encoding meets Persistent Homology on Graphs","created":"2025-06-06","cited_by_count":1,"area":null},{"id":"2507.01825","title":"MILP-SAT-GNN: Yet Another Neural SAT Solver","created":"2025-07-02","cited_by_count":1,"area":null},{"id":"2507.12380","title":"Heat Kernel Goes Topological","created":"2025-07-16","cited_by_count":1,"area":null},{"id":"2511.03068","title":"Graph Homomorphism Distortion: A structural (pseudo)-metric for attributed graphs","created":"2025-11-04","cited_by_count":1,"area":null},{"id":"2511.03824","title":"Sketch-Augmented Features Improve Learning Long-Range Dependencies in Graph Neural Networks","created":"2025-11-05","cited_by_count":1,"area":null},{"id":"2601.19037","title":"XIMP: Cross Graph Inter-Message Passing for Molecular Property Prediction","created":"2026-01-26","cited_by_count":1,"area":null},{"id":"2602.06787","title":"Weisfeiler and Lehman Go Categorical","created":"2026-02-06","cited_by_count":1,"area":null},{"id":"2604.27786","title":"On the Expressive Power of GNNs to Solve Linear SDPs","created":"2026-04-30","cited_by_count":1,"area":null},{"id":"2605.06462","title":"Measuring Structure in Graph Benchmark Datasets Using Graph Invariants","created":"2026-05-07","cited_by_count":1,"area":null},{"id":"2605.08102","title":"Path-Based Gradient Boosting for Graph-Level Prediction","created":"2026-04-26","cited_by_count":1,"area":null},{"id":"2311.01205","title":"Attacking Graph Neural Networks with Bit Flips: Weisfeiler and Lehman Go Indifferent","created":"2023-11-02","cited_by_count":0,"area":null},{"id":"2402.08085","title":"Message Detouring: A Simple Yet Effective Cycle Representation for Expressive Graph Learning","created":"2024-02-12","cited_by_count":0,"area":null}],"next_cursor":"100"}