{"total":877,"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":"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":"2003.00638","title":"Permutation Invariant Graph Generation via Score-Based Generative Modeling","created":"2020-03-02","cited_by_count":270,"area":"diffusion"},{"id":"2103.00550","title":"A Survey on Deep Semi-supervised Learning","created":"2021-02-28","cited_by_count":251,"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":"2103.03212","title":"Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networks","created":"2021-03-04","cited_by_count":221,"area":null},{"id":"2308.07134","title":"Language is All a Graph Needs","created":"2023-08-14","cited_by_count":220,"area":null},{"id":"2106.12575","title":"Weisfeiler and Lehman Go Cellular: CW Networks","created":"2021-06-23","cited_by_count":218,"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":"2201.08821","title":"Representing Long-Range Context for Graph Neural Networks with Global Attention","created":"2022-01-21","cited_by_count":195,"area":null},{"id":"2102.10757","title":"Self-Supervised Learning of Graph Neural Networks: A Unified Review","created":"2021-02-22","cited_by_count":184,"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":"2112.14936","title":"Are we really making much progress? Revisiting, benchmarking, and refining heterogeneous graph neural networks","created":"2021-12-30","cited_by_count":176,"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":"2106.07476","title":"Training Graph Neural Networks with 1000 Layers","created":"2021-06-14","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":"2302.02941","title":"On Over-Squashing in Message Passing Neural Networks: The Impact of Width, Depth, and Topology","created":"2023-02-06","cited_by_count":166,"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":"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":"2105.00956","title":"UniGNN: a Unified Framework for Graph and Hypergraph Neural Networks","created":"2021-05-03","cited_by_count":130,"area":null},{"id":"2102.13186","title":"Towards a Unified Framework for Fair and Stable Graph Representation Learning","created":"2021-02-25","cited_by_count":128,"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":"2202.02296","title":"Graph-Coupled Oscillator Networks","created":"2022-02-04","cited_by_count":124,"area":null},{"id":"2102.11533","title":"Accurate Learning of Graph Representations with Graph Multiset Pooling","created":"2021-02-23","cited_by_count":120,"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":"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":"2107.01188","title":"Combinatorial Optimization with Physics-Inspired Graph Neural Networks","created":"2021-07-02","cited_by_count":108,"area":null},{"id":"2202.08455","title":"Transformer for Graphs: An Overview from Architecture Perspective","created":"2022-02-17","cited_by_count":107,"area":null},{"id":"2205.12156","title":"Not too little, not too much: a theoretical analysis of graph (over)smoothing","created":"2022-05-24","cited_by_count":106,"area":null},{"id":"2210.11790","title":"FoSR: First-order spectral rewiring for addressing oversquashing in GNNs","created":"2022-10-21","cited_by_count":105,"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":"2107.02392","title":"Dirichlet Energy Constrained Learning for Deep Graph Neural Networks","created":"2021-07-06","cited_by_count":97,"area":null},{"id":"2302.06835","title":"Understanding Oversquashing in GNNs through the Lens of Effective Resistance","created":"2023-02-14","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":"2201.07858","title":"Decoupling the Depth and Scope of Graph Neural Networks","created":"2022-01-19","cited_by_count":94,"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":"2205.13328","title":"How Powerful are K-hop Message Passing Graph Neural Networks","created":"2022-05-26","cited_by_count":90,"area":null},{"id":"2305.10498","title":"Edge Directionality Improves Learning on Heterophilic Graphs","created":"2023-05-17","cited_by_count":90,"area":null},{"id":"2211.13009","title":"Federated Learning on Non-IID Graphs via Structural Knowledge Sharing","created":"2022-11-23","cited_by_count":88,"area":null},{"id":"2105.13495","title":"Learning Dynamic Graph Representation of Brain Connectome with Spatio-Temporal Attention","created":"2021-05-27","cited_by_count":87,"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":"2305.08018","title":"DRew: Dynamically Rewired Message Passing with Delay","created":"2023-05-13","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":"2104.04883","title":"Graph Representation Learning in Biomedicine","created":"2021-04-11","cited_by_count":80,"area":null},{"id":"2102.13303","title":"Graph-based Semi-supervised Learning: A Comprehensive Review","created":"2021-02-26","cited_by_count":79,"area":null},{"id":"2206.04216","title":"Neo-GNNs: Neighborhood Overlap-aware Graph Neural Networks for Link Prediction","created":"2022-06-09","cited_by_count":78,"area":null},{"id":"2202.08625","title":"Revisiting Over-smoothing in BERT from the Perspective of Graph","created":"2022-02-17","cited_by_count":72,"area":null},{"id":"2210.03930","title":"Hierarchical Graph Transformer with Adaptive Node Sampling","created":"2022-10-08","cited_by_count":72,"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":"2111.10657","title":"Generalizing Graph Neural Networks on Out-Of-Distribution Graphs","created":"2021-11-20","cited_by_count":71,"area":null},{"id":"2106.02172","title":"Learning from Counterfactual Links for Link Prediction","created":"2021-06-03","cited_by_count":69,"area":null},{"id":"2302.02914","title":"Energy-based Out-of-Distribution Detection for Graph Neural Networks","created":"2023-02-06","cited_by_count":68,"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":"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":"2110.00577","title":"Reconstruction for Powerful Graph Representations","created":"2021-10-01","cited_by_count":65,"area":null},{"id":"2110.13094","title":"Gophormer: Ego-Graph Transformer for Node Classification","created":"2021-10-25","cited_by_count":63,"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":"2108.07181","title":"Learning Skeletal Graph Neural Networks for Hard 3D Pose Estimation","created":"2021-08-16","cited_by_count":62,"area":null},{"id":"2202.08057","title":"Understanding and Improving Graph Injection Attack by Promoting Unnoticeability","created":"2022-02-16","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":"2304.02835","title":"GIF: A General Graph Unlearning Strategy via Influence Function","created":"2023-04-06","cited_by_count":60,"area":"safety"},{"id":"2102.11057","title":"Hierarchical Graph Representations in Digital Pathology","created":"2021-02-22","cited_by_count":59,"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":"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":"2201.03662","title":"Learning Fair Node Representations with Graph Counterfactual Fairness","created":"2022-01-10","cited_by_count":58,"area":null},{"id":"2206.11168","title":"Ordered Subgraph Aggregation Networks","created":"2022-06-22","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":"2209.13232","title":"A Survey on Graph Neural Networks and Graph Transformers in Computer Vision: A Task-Oriented Perspective","created":"2022-09-27","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":"2310.01668","title":"Locality-Aware Graph-Rewiring in GNNs","created":"2023-10-02","cited_by_count":56,"area":null},{"id":"2105.04550","title":"Optimization of Graph Neural Networks: Implicit Acceleration by Skip Connections and More Depth","created":"2021-05-10","cited_by_count":55,"area":null},{"id":"2209.03299","title":"Multimodal learning with graphs","created":"2022-09-07","cited_by_count":54,"area":null},{"id":"2211.14208","title":"GREAD: Graph Neural Reaction-Diffusion Networks","created":"2022-11-25","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":"2208.03471","title":"Oversquashing in GNNs through the lens of information contraction and graph expansion","created":"2022-08-06","cited_by_count":53,"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":"2306.03589","title":"How does over-squashing affect the power of GNNs?","created":"2023-06-06","cited_by_count":53,"area":null},{"id":"2502.14546","title":"Position: Graph Learning Will Lose Relevance Due To Poor Benchmarks","created":"2025-02-20","cited_by_count":53,"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":"2105.01017","title":"Learning Graph Embeddings for Open World Compositional Zero-Shot Learning","created":"2021-05-03","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":"2104.06608","title":"Search to aggregate neighborhood for graph neural network","created":"2021-04-14","cited_by_count":48,"area":null},{"id":"2502.06784","title":"RelGNN: Composite Message Passing for Relational Deep Learning","created":"2025-02-10","cited_by_count":48,"area":null},{"id":"2203.00949","title":"GAP: Differentially Private Graph Neural Networks with Aggregation Perturbation","created":"2022-03-02","cited_by_count":46,"area":null},{"id":"2303.04791","title":"Ewald-based Long-Range Message Passing for Molecular Graphs","created":"2023-03-08","cited_by_count":46,"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":"2205.13845","title":"Raising the Bar in Graph-level Anomaly Detection","created":"2022-05-27","cited_by_count":45,"area":null},{"id":"2206.11972","title":"Task-Adaptive Few-shot Node Classification","created":"2022-06-23","cited_by_count":43,"area":null},{"id":"2212.08174","title":"Non-IID Transfer Learning on Graphs","created":"2022-12-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":"2310.19035","title":"Does Invariant Graph Learning via Environment Augmentation Learn Invariance?","created":"2023-10-29","cited_by_count":42,"area":null}],"next_cursor":"100"}