{"total":17,"rows":[{"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":"2404.04612","title":"Spectral Graph Pruning Against Over-Squashing and Over-Smoothing","created":"2024-04-06","cited_by_count":24,"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":"2501.17207","title":"Rethinking Functional Brain Connectome Analysis: Do Graph Deep Learning Models Help","created":"2025-01-28","cited_by_count":9,"area":null},{"id":"2505.16284","title":"Only Large Weights (And Not Skip Connections) Can Prevent the Perils of Rank Collapse","created":"2025-05-22","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":"2502.04591","title":"Are We Measuring Oversmoothing in Graph Neural Networks Correctly?","created":"2025-02-07","cited_by_count":6,"area":null},{"id":"2511.08185","title":"Improving Long-Range Interactions in Graph Neural Simulators via Hamiltonian Dynamics","created":"2025-11-11","cited_by_count":6,"area":null},{"id":"2407.11876","title":"Simplifying the Theory on Over-Smoothing","created":"2024-07-16","cited_by_count":4,"area":null},{"id":"2410.08024","title":"Pretraining Graph Transformers with Atom-in-a-Molecule Quantum Properties for Improved ADMET Modeling","created":"2024-10-10","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":"2410.15578","title":"Generalized Probabilistic Attention Mechanism in Transformers","created":"2024-10-21","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":"2505.11346","title":"What Can We Learn From MIMO Graph Convolutions?","created":"2025-05-16","cited_by_count":1,"area":null},{"id":"2407.02758","title":"Differential Encoding for Improved Representation Learning over Graphs","created":"2024-07-03","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":"2609.14977","title":"LiftGCN: Efficient Energy-Preserving Graph Learning via Joukowski Spectral Lifting for Finite Element Stress Prediction","created":"2026-09-14","cited_by_count":0,"area":null}],"next_cursor":null}