{"total":826,"rows":[{"id":"2111.14522","title":"Understanding over-squashing and bottlenecks on graphs via curvature","created":"2021-11-29","cited_by_count":478,"area":null},{"id":"2101.00797","title":"Beyond Low-frequency Information in Graph Convolutional Networks","created":"2021-01-04","cited_by_count":362,"area":null},{"id":"2302.11640","title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","created":"2023-02-22","cited_by_count":343,"area":null},{"id":"2110.14446","title":"Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods","created":"2021-10-27","cited_by_count":311,"area":null},{"id":"2206.08164","title":"Long Range Graph Benchmark","created":"2022-06-16","cited_by_count":263,"area":null},{"id":"2303.10993","title":"A Survey on Oversmoothing in Graph Neural Networks","created":"2023-03-20","cited_by_count":247,"area":null},{"id":"2308.07134","title":"Language is All a Graph Needs","created":"2023-08-14","cited_by_count":220,"area":null},{"id":"2202.04579","title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","created":"2022-02-09","cited_by_count":214,"area":null},{"id":"2306.08385","title":"NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification","created":"2023-06-14","cited_by_count":210,"area":null},{"id":"2106.10994","title":"BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximation","created":"2021-06-21","cited_by_count":195,"area":null},{"id":"2102.06462","title":"Two Sides of the Same Coin: Heterophily and Oversmoothing in Graph Convolutional Neural Networks","created":"2021-02-12","cited_by_count":182,"area":null},{"id":"2106.06134","title":"Is Homophily a Necessity for Graph Neural Networks?","created":"2021-06-11","cited_by_count":182,"area":null},{"id":"2205.07308","title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","created":"2022-05-15","cited_by_count":179,"area":null},{"id":"2202.07082","title":"Graph Neural Networks for Graphs with Heterophily: A Survey","created":"2022-02-14","cited_by_count":175,"area":null},{"id":"2205.11172","title":"How Powerful are Spectral Graph Neural Networks","created":"2022-05-23","cited_by_count":169,"area":null},{"id":"2210.07606","title":"Revisiting Heterophily For Graph Neural Networks","created":"2022-10-14","cited_by_count":169,"area":null},{"id":"2111.00064","title":"Node Feature Extraction by Self-Supervised Multi-scale Neighborhood Prediction","created":"2021-10-29","cited_by_count":138,"area":null},{"id":"2202.02296","title":"Graph-Coupled Oscillator Networks","created":"2022-02-04","cited_by_count":124,"area":null},{"id":"2310.01089","title":"GraphText: Graph Reasoning in Text Space","created":"2023-10-02","cited_by_count":111,"area":"lr"},{"id":"2102.11391","title":"MagNet: A Neural Network for Directed Graphs","created":"2021-02-22","cited_by_count":107,"area":null},{"id":"2108.01938","title":"PDE-GCN: Novel Architectures for Graph Neural Networks Motivated by Partial Differential Equations","created":"2021-08-04","cited_by_count":106,"area":null},{"id":"2204.04879","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","created":"2022-04-11","cited_by_count":102,"area":null},{"id":"2303.01028","title":"Specformer: Spectral Graph Neural Networks Meet Transformers","created":"2023-03-02","cited_by_count":102,"area":null},{"id":"2211.15779","title":"Revisiting Over-smoothing and Over-squashing Using Ollivier-Ricci Curvature","created":"2022-11-28","cited_by_count":98,"area":null},{"id":"2106.06586","title":"Breaking the Limit of Graph Neural Networks by Improving the Assortativity of Graphs with Local Mixing Patterns","created":"2021-06-11","cited_by_count":95,"area":null},{"id":"2305.10498","title":"Edge Directionality Improves Learning on Heterophilic Graphs","created":"2023-05-17","cited_by_count":90,"area":null},{"id":"2110.13100","title":"Parameter Prediction for Unseen Deep Architectures","created":"2021-10-25","cited_by_count":89,"area":null},{"id":"2202.03580","title":"Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited","created":"2022-02-04","cited_by_count":87,"area":null},{"id":"2402.09834","title":"All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretraining","created":"2024-02-15","cited_by_count":86,"area":null},{"id":"2406.08993","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","created":"2024-06-13","cited_by_count":85,"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":"2110.15777","title":"GBK-GNN: Gated Bi-Kernel Graph Neural Networks for Modeling Both Homophily and Heterophily","created":"2021-10-29","cited_by_count":84,"area":null},{"id":"2302.04181","title":"Attending to Graph Transformers","created":"2023-02-08","cited_by_count":83,"area":null},{"id":"2109.05641","title":"Is Heterophily A Real Nightmare For Graph Neural Networks To Do Node Classification?","created":"2021-09-12","cited_by_count":82,"area":null},{"id":"2104.01404","title":"New Benchmarks for Learning on Non-Homophilous Graphs","created":"2021-04-03","cited_by_count":81,"area":null},{"id":"2210.03930","title":"Hierarchical Graph Transformer with Adaptive Node Sampling","created":"2022-10-08","cited_by_count":72,"area":null},{"id":"2302.01524","title":"Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing","created":"2023-02-03","cited_by_count":67,"area":null},{"id":"2204.01855","title":"A Survey on Graph Representation Learning Methods","created":"2022-04-04","cited_by_count":66,"area":null},{"id":"2206.08702","title":"Sheaf Neural Networks with Connection Laplacians","created":"2022-06-17","cited_by_count":65,"area":null},{"id":"2212.02374","title":"On the Trade-off between Over-smoothing and Over-squashing in Deep Graph Neural Networks","created":"2022-12-05","cited_by_count":64,"area":null},{"id":"2304.02806","title":"Graph Mixture of Experts: Learning on Large-Scale Graphs with Explicit Diversity Modeling","created":"2023-04-06","cited_by_count":64,"area":"moe"},{"id":"2202.08057","title":"Understanding and Improving Graph Injection Attack by Promoting Unnoticeability","created":"2022-02-16","cited_by_count":62,"area":null},{"id":"2502.05424","title":"SAMGPT: Text-free Graph Foundation Model for Multi-domain Pre-training and Cross-domain Adaptation","created":"2025-02-08","cited_by_count":62,"area":null},{"id":"2103.06064","title":"Graph Neural Networks Inspired by Classical Iterative Algorithms","created":"2021-03-10","cited_by_count":60,"area":null},{"id":"2209.06177","title":"Characterizing Graph Datasets for Node Classification: Homophily-Heterophily Dichotomy and Beyond","created":"2022-09-13","cited_by_count":60,"area":null},{"id":"2210.09789","title":"Anti-Symmetric DGN: a stable architecture for Deep Graph Networks","created":"2022-10-18","cited_by_count":60,"area":null},{"id":"2206.10991","title":"Understanding convolution on graphs via energies","created":"2022-06-22","cited_by_count":59,"area":null},{"id":"2111.04840","title":"Cold Brew: Distilling Graph Node Representations with Incomplete or Missing Neighborhoods","created":"2021-11-08","cited_by_count":58,"area":null},{"id":"2206.09677","title":"GraphFramEx: Towards Systematic Evaluation of Explainability Methods for Graph Neural Networks","created":"2022-06-20","cited_by_count":58,"area":null},{"id":"2211.14065","title":"Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating","created":"2022-11-25","cited_by_count":57,"area":null},{"id":"2111.06748","title":"Simplifying approach to Node Classification in Graph Neural Networks","created":"2021-11-12","cited_by_count":56,"area":null},{"id":"2211.14208","title":"GREAD: Graph Neural Reaction-Diffusion Networks","created":"2022-11-25","cited_by_count":54,"area":null},{"id":"2104.06942","title":"A Hyperbolic-to-Hyperbolic Graph Convolutional Network","created":"2021-04-14","cited_by_count":53,"area":null},{"id":"2109.03856","title":"Local Augmentation for Graph Neural Networks","created":"2021-09-08","cited_by_count":53,"area":null},{"id":"2106.05470","title":"Automated Self-Supervised Learning for Graphs","created":"2021-06-10","cited_by_count":50,"area":null},{"id":"2201.00491","title":"KerGNNs: Interpretable Graph Neural Networks with Graph Kernels","created":"2022-01-03","cited_by_count":50,"area":null},{"id":"2310.05174","title":"GSLB: The Graph Structure Learning Benchmark","created":"2023-10-08","cited_by_count":50,"area":null},{"id":"2210.00513","title":"Gradient Gating for Deep Multi-Rate Learning on Graphs","created":"2022-10-02","cited_by_count":49,"area":null},{"id":"2305.16102","title":"Demystifying Oversmoothing in Attention-Based Graph Neural Networks","created":"2023-05-25","cited_by_count":49,"area":null},{"id":"2104.06608","title":"Search to aggregate neighborhood for graph neural network","created":"2021-04-14","cited_by_count":48,"area":null},{"id":"2207.06680","title":"Equivariant Hypergraph Diffusion Neural Operators","created":"2022-07-14","cited_by_count":47,"area":null},{"id":"2305.13084","title":"A Fractional Graph Laplacian Approach to Oversmoothing","created":"2023-05-22","cited_by_count":45,"area":null},{"id":"2502.10818","title":"On Vanishing Gradients, Over-Smoothing, and Over-Squashing in GNNs: Bridging Recurrent and Graph Learning","created":"2025-02-15","cited_by_count":43,"area":null},{"id":"2212.09034","title":"Graph Neural Networks are Inherently Good Generalizers: Insights by Bridging GNNs and MLPs","created":"2022-12-18","cited_by_count":42,"area":null},{"id":"2502.02017","title":"Multi-Domain Graph Foundation Models: Robust Knowledge Transfer via Topology Alignment","created":"2025-02-04","cited_by_count":42,"area":null},{"id":"2105.07634","title":"Improving Graph Neural Networks with Simple Architecture Design","created":"2021-05-17","cited_by_count":41,"area":null},{"id":"2206.12917","title":"TAM: Topology-Aware Margin Loss for Class-Imbalanced Node Classification","created":"2022-06-26","cited_by_count":41,"area":null},{"id":"2306.01323","title":"Demystifying Structural Disparity in Graph Neural Networks: Can One Size Fit All?","created":"2023-06-02","cited_by_count":41,"area":null},{"id":"2309.09384","title":"Mitigating Over-Smoothing and Over-Squashing using Augmentations of Forman-Ricci Curvature","created":"2023-09-17","cited_by_count":41,"area":null},{"id":"2103.13355","title":"Bag of Tricks for Node Classification with Graph Neural Networks","created":"2021-03-24","cited_by_count":40,"area":null},{"id":"2204.09860","title":"Remote Sensing Cross-Modal Text-Image Retrieval Based on Global and Local Information","created":"2022-04-21","cited_by_count":40,"area":null},{"id":"2210.06391","title":"What Makes Graph Neural Networks Miscalibrated?","created":"2022-10-12","cited_by_count":40,"area":null},{"id":"2111.07337","title":"$p$-Laplacian Based Graph Neural Networks","created":"2021-11-14","cited_by_count":39,"area":null},{"id":"2405.20445","title":"Fully-inductive Node Classification on Arbitrary Graphs","created":"2024-05-30","cited_by_count":39,"area":null},{"id":"2310.18884","title":"Simple and Asymmetric Graph Contrastive Learning without Augmentations","created":"2023-10-29","cited_by_count":38,"area":null},{"id":"2110.04375","title":"Neural Link Prediction with Walk Pooling","created":"2021-10-08","cited_by_count":37,"area":null},{"id":"2203.00638","title":"PaSca: a Graph Neural Architecture Search System under the Scalable Paradigm","created":"2022-03-01","cited_by_count":37,"area":null},{"id":"2203.13913","title":"SpeqNets: Sparsity-aware Permutation-equivariant Graph Networks","created":"2022-03-25","cited_by_count":37,"area":null},{"id":"2108.10521","title":"Bag of Tricks for Training Deeper Graph Neural Networks: A Comprehensive Benchmark Study","created":"2021-08-24","cited_by_count":36,"area":null},{"id":"2310.01267","title":"Cooperative Graph Neural Networks","created":"2023-10-02","cited_by_count":36,"area":null},{"id":"2108.11022","title":"Tree Decomposed Graph Neural Network","created":"2021-08-25","cited_by_count":35,"area":null},{"id":"2210.02016","title":"Multi-task Self-supervised Graph Neural Networks Enable Stronger Task Generalization","created":"2022-10-05","cited_by_count":35,"area":null},{"id":"2303.09778","title":"SE-GSL: A General and Effective Graph Structure Learning Framework through Structural Entropy Optimization","created":"2023-03-17","cited_by_count":35,"area":null},{"id":"2308.02117","title":"VQGraph: Rethinking Graph Representation Space for Bridging GNNs and MLPs","created":"2023-08-04","cited_by_count":35,"area":"distill"},{"id":"2406.02997","title":"Residual Connections and Normalization Can Provably Prevent Oversmoothing in GNNs","created":"2024-06-05","cited_by_count":34,"area":null},{"id":"2112.13507","title":"Block Modeling-Guided Graph Convolutional Neural Networks","created":"2021-12-27","cited_by_count":32,"area":null},{"id":"2202.10720","title":"EIGNN: Efficient Infinite-Depth Graph Neural Networks","created":"2022-02-22","cited_by_count":32,"area":null},{"id":"2206.05437","title":"ACMP: Allen-Cahn Message Passing with Attractive and Repulsive Forces for Graph Neural Networks","created":"2022-06-11","cited_by_count":31,"area":null},{"id":"2208.08302","title":"Position-aware Structure Learning for Graph Topology-imbalance by Relieving Under-reaching and Over-squashing","created":"2022-08-17","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":"2408.12594","title":"Non-Homophilic Graph Pre-Training and Prompt Learning","created":"2024-08-22","cited_by_count":31,"area":null},{"id":"2202.10688","title":"Graph Lifelong Learning: A Survey","created":"2022-02-22","cited_by_count":30,"area":null},{"id":"2306.10280","title":"OpenGSL: A Comprehensive Benchmark for Graph Structure Learning","created":"2023-06-17","cited_by_count":30,"area":null},{"id":"2204.10037","title":"DropMessage: Unifying Random Dropping for Graph Neural Networks","created":"2022-04-21","cited_by_count":29,"area":null},{"id":"2305.02931","title":"Beyond Homophily: Reconstructing Structure for Graph-agnostic Clustering","created":"2023-05-03","cited_by_count":29,"area":null},{"id":"2308.06714","title":"Learning on Graphs with Out-of-Distribution Nodes","created":"2023-08-13","cited_by_count":29,"area":null},{"id":"2406.05346","title":"ProG: A Graph Prompt Learning Benchmark","created":"2024-06-08","cited_by_count":29,"area":null},{"id":"2111.15422","title":"Hierarchical Prototype Networks for Continual Graph Representation Learning","created":"2021-11-30","cited_by_count":28,"area":null},{"id":"2202.09025","title":"Graph Auto-Encoder Via Neighborhood Wasserstein Reconstruction","created":"2022-02-18","cited_by_count":28,"area":null},{"id":"2206.14418","title":"Optimization-Induced Graph Implicit Nonlinear Diffusion","created":"2022-06-29","cited_by_count":28,"area":null}],"next_cursor":"100"}