{"total":993,"rows":[{"id":"2101.00797","title":"Beyond Low-frequency Information in Graph Convolutional Networks","created":"2021-01-04","cited_by_count":362,"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":"2106.10994","title":"BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximation","created":"2021-06-21","cited_by_count":195,"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":"2106.07476","title":"Training Graph Neural Networks with 1000 Layers","created":"2021-06-14","cited_by_count":169,"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":"2110.08727","title":"Graph-less Neural Networks: Teaching Old MLPs New Tricks via Distillation","created":"2021-10-17","cited_by_count":152,"area":null},{"id":"2110.07580","title":"Graph Condensation for Graph Neural Networks","created":"2021-10-14","cited_by_count":150,"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":"2206.04910","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","created":"2022-06-10","cited_by_count":137,"area":null},{"id":"2202.08235","title":"Data Augmentation for Deep Graph Learning: A Survey","created":"2022-02-16","cited_by_count":133,"area":null},{"id":"2306.10759","title":"SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations","created":"2023-06-19","cited_by_count":133,"area":null},{"id":"2101.11859","title":"Interpreting and Unifying Graph Neural Networks with An Optimization Framework","created":"2021-01-28","cited_by_count":131,"area":null},{"id":"2106.13264","title":"You are AllSet: A Multiset Function Framework for Hypergraph Neural Networks","created":"2021-06-24","cited_by_count":127,"area":null},{"id":"2204.08570","title":"A Comprehensive Survey on Trustworthy Graph Neural Networks: Privacy, Robustness, Fairness, and Explainability","created":"2022-04-18","cited_by_count":118,"area":null},{"id":"2102.01987","title":"Learning Graph Embeddings for Compositional Zero-shot Learning","created":"2021-02-03","cited_by_count":112,"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":"2206.07746","title":"Condensing Graphs via One-Step Gradient Matching","created":"2022-06-15","cited_by_count":100,"area":null},{"id":"2107.02392","title":"Dirichlet Energy Constrained Learning for Deep Graph Neural Networks","created":"2021-07-06","cited_by_count":97,"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":"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":"2109.14285","title":"Be Confident! Towards Trustworthy Graph Neural Networks via Confidence Calibration","created":"2021-09-29","cited_by_count":92,"area":null},{"id":"2106.05609","title":"GNNAutoScale: Scalable and Expressive Graph Neural Networks via Historical Embeddings","created":"2021-06-10","cited_by_count":90,"area":null},{"id":"2108.01099","title":"Shift-Robust GNNs: Overcoming the Limitations of Localized Graph Training Data","created":"2021-08-02","cited_by_count":87,"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.02216","title":"Position: Graph Foundation Models are Already Here","created":"2024-02-03","cited_by_count":86,"area":null},{"id":"2102.00546","title":"GraphEBM: Molecular Graph Generation with Energy-Based Models","created":"2021-01-31","cited_by_count":85,"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":"2206.04355","title":"Graph Attention Multi-Layer Perceptron","created":"2022-06-09","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":"2106.05150","title":"Scaling Up Graph Neural Networks Via Graph Coarsening","created":"2021-06-09","cited_by_count":80,"area":null},{"id":"2110.14012","title":"Graph Posterior Network: Bayesian Predictive Uncertainty for Node Classification","created":"2021-10-26","cited_by_count":80,"area":null},{"id":"2210.03930","title":"Hierarchical Graph Transformer with Adaptive Node Sampling","created":"2022-10-08","cited_by_count":72,"area":null},{"id":"2110.03051","title":"Prior and Posterior Networks: A Survey on Evidential Deep Learning Methods For Uncertainty Estimation","created":"2021-10-06","cited_by_count":71,"area":null},{"id":"2306.02664","title":"Structure-free Graph Condensation: From Large-scale Graphs to Condensed Graph-free Data","created":"2023-06-05","cited_by_count":71,"area":null},{"id":"2402.12984","title":"Can GNN be Good Adapter for LLMs?","created":"2024-02-20","cited_by_count":71,"area":null},{"id":"2103.02885","title":"Extract the Knowledge of Graph Neural Networks and Go Beyond it: An Effective Knowledge Distillation Framework","created":"2021-03-04","cited_by_count":69,"area":"distill"},{"id":"2106.15535","title":"Subgroup Generalization and Fairness of Graph Neural Networks","created":"2021-06-29","cited_by_count":69,"area":null},{"id":"2206.01535","title":"Rethinking and Scaling Up Graph Contrastive Learning: An Extremely Efficient Approach with Group Discrimination","created":"2022-06-03","cited_by_count":69,"area":null},{"id":"2106.06663","title":"TDGIA:Effective Injection Attacks on Graph Neural Networks","created":"2021-06-12","cited_by_count":67,"area":null},{"id":"2107.06996","title":"Elastic Graph Neural Networks","created":"2021-07-05","cited_by_count":67,"area":null},{"id":"2210.03561","title":"Empowering Graph Representation Learning with Test-Time Graph Transformation","created":"2022-10-07","cited_by_count":67,"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":"2402.13630","title":"UniGraph: Learning a Unified Cross-Domain Foundation Model for Text-Attributed Graphs","created":"2024-02-21","cited_by_count":66,"area":null},{"id":"2108.06504","title":"LinkTeller: Recovering Private Edges from Graph Neural Networks via Influence Analysis","created":"2021-08-14","cited_by_count":65,"area":null},{"id":"2403.01232","title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","created":"2024-03-02","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":"2103.11318","title":"Language-Agnostic Representation Learning of Source Code from Structure and Context","created":"2021-03-21","cited_by_count":63,"area":null},{"id":"2110.13094","title":"Gophormer: Ego-Graph Transformer for Node Classification","created":"2021-10-25","cited_by_count":63,"area":null},{"id":"2202.08871","title":"Graph Data Augmentation for Graph Machine Learning: A Survey","created":"2022-02-17","cited_by_count":62,"area":null},{"id":"2206.13510","title":"Structural Entropy Guided Graph Hierarchical Pooling","created":"2022-06-26","cited_by_count":62,"area":null},{"id":"2204.02782","title":"GemNet-OC: Developing Graph Neural Networks for Large and Diverse Molecular Simulation Datasets","created":"2022-04-06","cited_by_count":61,"area":null},{"id":"2206.03426","title":"Improving Fairness in Graph Neural Networks via Mitigating Sensitive Attribute Leakage","created":"2022-06-07","cited_by_count":61,"area":null},{"id":"2302.01018","title":"Graph Neural Networks for temporal graphs: State of the art, open challenges, and opportunities","created":"2023-02-02","cited_by_count":61,"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":"2206.13697","title":"Graph Condensation via Receptive Field Distribution Matching","created":"2022-06-28","cited_by_count":60,"area":null},{"id":"2102.10739","title":"Dissecting the Diffusion Process in Linear Graph Convolutional Networks","created":"2021-02-22","cited_by_count":58,"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":"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":"2110.04099","title":"Topology-Imbalance Learning for Semi-Supervised Node Classification","created":"2021-10-08","cited_by_count":56,"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.07494","title":"A Comprehensive Study on Large-Scale Graph Training: Benchmarking and Rethinking","created":"2022-10-14","cited_by_count":56,"area":null},{"id":"2104.09376","title":"Scalable and Adaptive Graph Neural Networks with Self-Label-Enhanced training","created":"2021-04-19","cited_by_count":54,"area":null},{"id":"2109.03856","title":"Local Augmentation for Graph Neural Networks","created":"2021-09-08","cited_by_count":53,"area":null},{"id":"2108.07567","title":"How Powerful is Graph Convolution for Recommendation?","created":"2021-08-17","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":"2105.01017","title":"Learning Graph Embeddings for Open World Compositional Zero-Shot Learning","created":"2021-05-03","cited_by_count":49,"area":null},{"id":"2206.04798","title":"A*Net: A Scalable Path-based Reasoning Approach for Knowledge Graphs","created":"2022-06-07","cited_by_count":49,"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":"2212.01026","title":"Spectral Feature Augmentation for Graph Contrastive Learning and Beyond","created":"2022-12-02","cited_by_count":49,"area":null},{"id":"2212.10701","title":"A Non-Asymptotic Analysis of Oversmoothing in Graph Neural Networks","created":"2022-12-21","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":"2406.18380","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","created":"2024-06-26","cited_by_count":49,"area":null},{"id":"2502.00806","title":"UniGraph2: Learning a Unified Embedding Space to Bind Multimodal Graphs","created":"2025-02-02","cited_by_count":49,"area":"moe"},{"id":"2207.06680","title":"Equivariant Hypergraph Diffusion Neural Operators","created":"2022-07-14","cited_by_count":47,"area":null},{"id":"2206.09140","title":"Certified Graph Unlearning","created":"2022-06-18","cited_by_count":46,"area":"safety"},{"id":"2108.13049","title":"Single Node Injection Attack against Graph Neural Networks","created":"2021-08-30","cited_by_count":45,"area":null},{"id":"2110.14377","title":"Node Dependent Local Smoothing for Scalable Graph Learning","created":"2021-10-27","cited_by_count":45,"area":null},{"id":"2305.13084","title":"A Fractional Graph Laplacian Approach to Oversmoothing","created":"2023-05-22","cited_by_count":45,"area":null},{"id":"2310.09192","title":"Does Graph Distillation See Like Vision Dataset Counterpart?","created":"2023-10-13","cited_by_count":45,"area":null},{"id":"2101.08543","title":"Boost then Convolve: Gradient Boosting Meets Graph Neural Networks","created":"2021-01-21","cited_by_count":44,"area":null},{"id":"2111.04314","title":"Graph Robustness Benchmark: Benchmarking the Adversarial Robustness of Graph Machine Learning","created":"2021-11-08","cited_by_count":44,"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":"2305.08048","title":"Towards Understanding the Generalization of Graph Neural Networks","created":"2023-05-14","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":"2103.13355","title":"Bag of Tricks for Node Classification with Graph Neural Networks","created":"2021-03-24","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":"2108.00261","title":"ECLARE: Extreme Classification with Label Graph Correlations","created":"2021-07-31","cited_by_count":38,"area":null},{"id":"2201.11349","title":"Confidence May Cheat: Self-Training on Graph Neural Networks under Distribution Shift","created":"2022-01-27","cited_by_count":38,"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":"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":"2302.12432","title":"Graph Neural Networks with Learnable and Optimal Polynomial Bases","created":"2023-02-24","cited_by_count":36,"area":null},{"id":"2310.11046","title":"Fast Graph Condensation with Structure-based Neural Tangent Kernel","created":"2023-10-17","cited_by_count":36,"area":null},{"id":"2105.08621","title":"Zorro: Valid, Sparse, and Stable Explanations in Graph Neural Networks","created":"2021-05-18","cited_by_count":35,"area":null}],"next_cursor":"100"}