{"total":103,"rows":[{"id":"2303.10993","title":"A Survey on Oversmoothing in Graph Neural Networks","created":"2023-03-20","cited_by_count":247,"area":null},{"id":"2504.02732","title":"Why do LLMs attend to the first token?","created":"2025-04-03","cited_by_count":127,"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":"2305.13084","title":"A Fractional Graph Laplacian Approach to Oversmoothing","created":"2023-05-22","cited_by_count":45,"area":null},{"id":"2311.15317","title":"Generalized Graph Prompt: Toward a Unification of Pre-Training and Downstream Tasks on Graphs","created":"2023-11-26","cited_by_count":39,"area":null},{"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":"2404.04612","title":"Spectral Graph Pruning Against Over-Squashing and Over-Smoothing","created":"2024-04-06","cited_by_count":24,"area":null},{"id":"2307.01951","title":"A Neural Collapse Perspective on Feature Evolution in Graph Neural Networks","created":"2023-07-04","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":"2308.16800","title":"Rank Collapse Causes Over-Smoothing and Over-Correlation in Graph Neural Networks","created":"2023-08-31","cited_by_count":18,"area":null},{"id":"2402.08907","title":"Subgraph Pooling: Tackling Negative Transfer on Graphs","created":"2024-02-14","cited_by_count":17,"area":null},{"id":"2404.03473","title":"Generalization Bounds for Message Passing Networks on Mixture of Graphons","created":"2024-04-04","cited_by_count":17,"area":null},{"id":"2210.09277","title":"Unsupervised Optimal Power Flow Using Graph Neural Networks","created":"2022-10-17","cited_by_count":14,"area":null},{"id":"2212.13069","title":"Homophily modulates double descent generalization in graph convolution networks","created":"2022-12-26","cited_by_count":13,"area":null},{"id":"2305.10391","title":"Optimality of Message-Passing Architectures for Sparse Graphs","created":"2023-05-17","cited_by_count":13,"area":null},{"id":"2308.09198","title":"Half-Hop: A graph upsampling approach for slowing down message passing","created":"2023-08-17","cited_by_count":13,"area":null},{"id":"2406.05815","title":"What Can We Learn from State Space Models for Machine Learning on Graphs?","created":"2024-06-09","cited_by_count":13,"area":null},{"id":"2409.10944","title":"Contrasformer: A Brain Network Contrastive Transformer for Neurodegenerative Condition Identification","created":"2024-09-17","cited_by_count":13,"area":null},{"id":"2410.01401","title":"Question-guided Knowledge Graph Re-scoring and Injection for Knowledge Graph Question Answering","created":"2024-10-02","cited_by_count":13,"area":null},{"id":"2502.04891","title":"GNNs Getting ComFy: Community and Feature Similarity Guided Rewiring","created":"2025-02-07","cited_by_count":13,"area":null},{"id":"2305.14814","title":"What functions can Graph Neural Networks compute on random graphs? The role of Positional Encoding","created":"2023-05-24","cited_by_count":12,"area":null},{"id":"2312.04234","title":"Graph Convolutions Enrich the Self-Attention in Transformers!","created":"2023-12-07","cited_by_count":11,"area":null},{"id":"2304.11140","title":"Convergence of Message Passing Graph Neural Networks with Generic Aggregation On Large Random Graphs","created":"2023-04-21","cited_by_count":9,"area":null},{"id":"2405.18127","title":"Graph Coarsening with Message-Passing Guarantees","created":"2024-05-28","cited_by_count":9,"area":null},{"id":"2210.09809","title":"Analysis of Convolutions, Non-linearity and Depth in Graph Neural Networks using Neural Tangent Kernel","created":"2022-10-18","cited_by_count":8,"area":null},{"id":"2309.17417","title":"Networked Inequality: Preferential Attachment Bias in Graph Neural Network Link Prediction","created":"2023-09-29","cited_by_count":8,"area":null},{"id":"2405.20652","title":"Sign is Not a Remedy: Multiset-to-Multiset Message Passing for Learning on Heterophilic Graphs","created":"2024-05-31","cited_by_count":8,"area":null},{"id":"2406.11891","title":"Towards Adaptive Neighborhood for Advancing Temporal Interaction Graph Modeling","created":"2024-06-14","cited_by_count":8,"area":null},{"id":"2410.05499","title":"Unitary convolutions for learning on graphs and groups","created":"2024-10-07","cited_by_count":8,"area":null},{"id":"2305.04746","title":"Understanding Noise-Augmented Training for Randomized Smoothing","created":"2023-05-08","cited_by_count":7,"area":null},{"id":"2306.01610","title":"Centered Self-Attention Layers","created":"2023-06-02","cited_by_count":7,"area":null},{"id":"2406.02269","title":"Graph Neural Networks Do Not Always Oversmooth","created":"2024-06-04","cited_by_count":7,"area":null},{"id":"2501.00762","title":"Residual connections provably mitigate oversmoothing in graph neural networks","created":"2025-01-01","cited_by_count":7,"area":null},{"id":"2510.17457","title":"Deeper with Riemannian Geometry: Overcoming Oversmoothing and Oversquashing for Graph Foundation Models","created":"2025-10-20","cited_by_count":7,"area":null},{"id":"2409.11504","title":"Preventing Representational Rank Collapse in MPNNs by Splitting the Computational Graph","created":"2024-09-17","cited_by_count":6,"area":null},{"id":"2411.10000","title":"DuSEGO: Dual Second-order Equivariant Graph Ordinary Differential Equation","created":"2024-11-15","cited_by_count":6,"area":null},{"id":"2502.04591","title":"Are We Measuring Oversmoothing in Graph Neural Networks Correctly?","created":"2025-02-07","cited_by_count":6,"area":null},{"id":"2502.06751","title":"What makes a good feedforward computational graph?","created":"2025-02-10","cited_by_count":5,"area":null},{"id":"2509.03691","title":"Graph Random Features for Scalable Gaussian Processes","created":"2025-09-03","cited_by_count":5,"area":null},{"id":"2212.08966","title":"Graph Learning and Its Advancements on Large Language Models: A Holistic Survey","created":"2022-12-17","cited_by_count":4,"area":null},{"id":"2305.08233","title":"Addressing Heterophily in Node Classification with Graph Echo State Networks","created":"2023-05-14","cited_by_count":4,"area":null},{"id":"2307.08430","title":"Long-range Meta-path Search on Large-scale Heterogeneous Graphs","created":"2023-07-17","cited_by_count":4,"area":null},{"id":"2405.00957","title":"IntraMix: Intra-Class Mixup Generation for Accurate Labels and Neighbors","created":"2024-05-02","cited_by_count":4,"area":null},{"id":"2407.17219","title":"Graph Neural Networks: A suitable Alternative to MLPs in Latent 3D Medical Image Classification?","created":"2024-07-24","cited_by_count":4,"area":null},{"id":"2510.18910","title":"Large Connectome Model: An fMRI Foundation Model of Brain Connectomes Empowered by Brain-Environment Interaction in Multitask Learning Landscape","created":"2025-10-21","cited_by_count":4,"area":null},{"id":"2306.11668","title":"Principles for Initialization and Architecture Selection in Graph Neural Networks with ReLU Activations","created":"2023-06-20","cited_by_count":3,"area":null},{"id":"2309.09924","title":"DYMAG: Rethinking Message Passing Using Dynamical-systems-based Waveforms","created":"2023-09-18","cited_by_count":3,"area":null},{"id":"2402.02634","title":"Key-Graph Transformer for Image Restoration","created":"2024-02-04","cited_by_count":3,"area":null},{"id":"2407.19420","title":"UniGAP: A Universal and Adaptive Graph Upsampling Approach to Mitigate Over-Smoothing in Node Classification Tasks","created":"2024-07-28","cited_by_count":3,"area":null},{"id":"2410.04824","title":"Taming Gradient Oversmoothing and Expansion in Graph Neural Networks","created":"2024-10-07","cited_by_count":3,"area":null},{"id":"2410.14109","title":"Improving Graph Neural Networks by Learning Continuous Edge Directions","created":"2024-10-18","cited_by_count":3,"area":null},{"id":"2505.16736","title":"Backward Oversmoothing: why is it hard to train deep Graph Neural Networks?","created":"2025-05-22","cited_by_count":3,"area":null},{"id":"2506.04653","title":"The Oversmoothing Fallacy: A Misguided Narrative in GNN Research","created":"2025-06-05","cited_by_count":3,"area":null},{"id":"2605.09993","title":"Learning Graph Foundation Models on Riemannian Graph-of-Graphs","created":"2026-05-11","cited_by_count":3,"area":null},{"id":"2308.03306","title":"Implicit Graph Neural Diffusion Networks: Convergence, Generalization, and Over-Smoothing","created":"2023-08-07","cited_by_count":2,"area":null},{"id":"2405.13987","title":"Analysis of Corrected Graph Convolutions","created":"2024-05-22","cited_by_count":2,"area":null},{"id":"2412.09805","title":"Making Classic GNNs Strong Baselines Across Varying Homophily: A Smoothness-Generalization Perspective","created":"2024-12-13","cited_by_count":2,"area":null},{"id":"2412.15496","title":"Graph Attention is Not Always Beneficial: A Theoretical Analysis of Graph Attention Mechanisms via Contextual Stochastic Block Models","created":"2024-12-20","cited_by_count":2,"area":null},{"id":"2501.19089","title":"Resolving Oversmoothing with Opinion Dissensus","created":"2025-01-31","cited_by_count":2,"area":null},{"id":"2503.01361","title":"Statistical physics analysis of graph neural networks: Approaching optimality in the contextual stochastic block model","created":"2025-03-03","cited_by_count":2,"area":null},{"id":"2509.10659","title":"M4GN: Mesh-based Multi-segment Hierarchical Graph Network for Dynamic Simulations","created":"2025-09-12","cited_by_count":2,"area":null},{"id":"2511.17848","title":"Scaling Kinetic Monte-Carlo Simulations of Grain Growth with Combined Convolutional and Graph Neural Networks","created":"2025-11-22","cited_by_count":2,"area":null},{"id":"2512.10989","title":"Generalization of Long-Range Machine Learning Potentials in Complex Chemical Spaces","created":"2025-12-08","cited_by_count":2,"area":null},{"id":"2601.07419","title":"Position: Don't be Afraid of Over-Smoothing And Over-Squashing","created":"2026-01-12","cited_by_count":2,"area":null},{"id":"2603.17569","title":"Gaussian Process Limit Reveals Structural Benefits of Graph Transformers","created":"2026-03-18","cited_by_count":2,"area":null},{"id":"2309.13459","title":"A Model-Agnostic Graph Neural Network for Integrating Local and Global Information","created":"2023-09-23","cited_by_count":1,"area":null},{"id":"2403.16133","title":"SSHPool: The Separated Subgraph-based Hierarchical Pooling","created":"2024-03-24","cited_by_count":1,"area":null},{"id":"2407.01281","title":"Bridging Smoothness and Approximation: Theoretical Insights into Over-Smoothing in Graph Neural Networks","created":"2024-07-01","cited_by_count":1,"area":null},{"id":"2408.16871","title":"GSTAM: Efficient Graph Distillation with Structural Attention-Matching","created":"2024-08-29","cited_by_count":1,"area":null},{"id":"2409.13851","title":"Learning Ordering in Crystalline Materials with Symmetry-Aware Graph Neural Networks","created":"2024-09-20","cited_by_count":1,"area":null},{"id":"2412.07243","title":"A Dynamical Systems-Inspired Pruning Strategy for Addressing Oversmoothing in Graph Neural Networks","created":"2024-12-10","cited_by_count":1,"area":null},{"id":"2508.19352","title":"Memorization in Graph Neural Networks","created":"2025-08-26","cited_by_count":1,"area":null},{"id":"2511.09605","title":"TomoGraphView: 3D Medical Image Classification with Omnidirectional Slice Representations and Graph Neural Networks","created":"2025-11-12","cited_by_count":1,"area":null},{"id":"2603.11944","title":"Effective Resistance Rewiring: A Simple Topological Correction for Over-Squashing","created":"2026-03-12","cited_by_count":1,"area":null},{"id":"2603.20829","title":"Beyond the Academic Monoculture: A Unified Framework and Industrial Perspective for Attributed Graph Clustering","created":"2026-03-21","cited_by_count":1,"area":null},{"id":"2605.12358","title":"From Message-Passing to Linearized Graph Sequence Models","created":"2026-05-12","cited_by_count":1,"area":null},{"id":"2303.13964","title":"Gradient scarcity with Bilevel Optimization for Graph Learning","created":"2023-03-24","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},{"id":"2410.22026","title":"Enhance Hyperbolic Representation Learning via Second-order Pooling","created":"2024-10-29","cited_by_count":0,"area":null},{"id":"2503.12034","title":"Real-Time Manipulation Action Recognition with a Factorized Graph Sequence Encoder","created":"2025-03-15","cited_by_count":0,"area":null},{"id":"2504.07645","title":"Prediction of Usage Probabilities of Shopping-Mall Corridors Using Heterogeneous Graph Neural Networks","created":"2025-04-10","cited_by_count":0,"area":null},{"id":"2506.03919","title":"Weisfeiler and Leman Go Gambling: Why Expressive Lottery Tickets Win","created":"2025-06-04","cited_by_count":0,"area":null},{"id":"2508.06917","title":"CROP: Integrating Topological and Spatial Structures via Cross-View Prefixes for Molecular LLMs","created":"2025-08-09","cited_by_count":0,"area":null},{"id":"2508.12993","title":"Predicting the Performance of Graph Convolutional Networks with Spectral Properties of the Graph Laplacian","created":"2025-08-18","cited_by_count":0,"area":null},{"id":"2508.17126","title":"Token Homogenization under Positional Bias","created":"2025-08-23","cited_by_count":0,"area":null},{"id":"2509.02803","title":"A Graph Laplacian Eigenvector-based Pre-training Method for Graph Neural Networks","created":"2025-09-02","cited_by_count":0,"area":null},{"id":"2509.10337","title":"Exact Generalisation Error Exposes Benchmarks Skew Graph Neural Networks Success (or Failure)","created":"2025-09-12","cited_by_count":0,"area":null},{"id":"2510.17106","title":"Fighter: Unveiling the Graph Convolutional Nature of Transformers in Time Series Modeling","created":"2025-10-20","cited_by_count":0,"area":null},{"id":"2512.15600","title":"How Smoothing is N-simplicial Attention?","created":"2025-12-17","cited_by_count":0,"area":null},{"id":"2602.05352","title":"Smoothness Errors in Dynamics Models and How to Avoid Them","created":"2026-02-05","cited_by_count":0,"area":null},{"id":"2603.22854","title":"Avoiding Over-smoothing in Social Media Rumor Detection with Pre-trained Propagation Tree Transformer","created":"2026-03-24","cited_by_count":0,"area":null},{"id":"2605.04724","title":"From Beats to Breaches:How Offensive AI Infers Sensitive User Information from Playlists","created":"2026-05-06","cited_by_count":0,"area":null},{"id":"2605.08074","title":"GRAPHLCP: Structure-Aware Localized Conformal Prediction on Graphs","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2605.10975","title":"Hierarchical Multi-Scale Graph Neural Networks: Scalable Heterophilous Learning with Oversmoothing and Oversquashing Mitigation","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2605.21247","title":"Graph Navier Stokes Networks","created":"2026-05-20","cited_by_count":0,"area":null},{"id":"2605.25452","title":"Different Statistical Perspectives for Understanding Generalisation in Graph Neural Networks","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2606.17684","title":"Geometrical fairness in graph neural networks","created":"2026-06-16","cited_by_count":0,"area":null},{"id":"2606.20162","title":"Implicit Semantic-Aware Communication Based on Hypergraph Reasoning","created":"2026-06-18","cited_by_count":0,"area":null},{"id":"2606.23572","title":"A Spectral Theory of Normalized Corrected GNN Propagation","created":"2026-06-22","cited_by_count":0,"area":null}],"next_cursor":"100"}