{"list":"other","total":55,"rows":[{"id":"1512.03385","title":"Deep Residual Learning for Image Recognition","created":"2015-12-10","cited_by_count":52096},{"id":"1609.02907","title":"Semi-Supervised Classification with Graph Convolutional Networks","created":"2016-09-09","cited_by_count":11361},{"id":"1710.10903","title":"Graph Attention Networks","created":"2017-10-30","cited_by_count":8923},{"id":"1706.02216","title":"Inductive Representation Learning on Large Graphs","created":"2017-06-07","cited_by_count":6320},{"id":"1810.00826","title":"How Powerful are Graph Neural Networks?","created":"2018-10-01","cited_by_count":4393},{"id":"1409.4842","title":"Going Deeper with Convolutions","created":"2014-09-17","cited_by_count":4241},{"id":"1704.01212","title":"Neural Message Passing for Quantum Chemistry","created":"2017-04-04","cited_by_count":3487},{"id":"1606.09375","title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","created":"2016-06-30","cited_by_count":2089},{"id":"1603.05027","title":"Identity Mappings in Deep Residual Networks","created":"2016-03-16","cited_by_count":1965},{"id":"1902.07153","title":"Simplifying Graph Convolutional Networks","created":"2019-02-19","cited_by_count":1477},{"id":"1810.05997","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","created":"2018-10-14","cited_by_count":993},{"id":"1806.03536","title":"Representation Learning on Graphs with Jumping Knowledge Networks","created":"2018-06-09","cited_by_count":877},{"id":"2007.02133","title":"Simple and Deep Graph Convolutional Networks","created":"2020-07-04","cited_by_count":860},{"id":"2002.05287","title":"Geom-GCN: Geometric Graph Convolutional Networks","created":"2020-02-13","cited_by_count":826},{"id":"1902.07243","title":"Graph Neural Networks for Social Recommendation","created":"2019-02-19","cited_by_count":714},{"id":"1907.10903","title":"DropEdge: Towards Deep Graph Convolutional Networks on Node Classification","created":"2019-07-25","cited_by_count":680},{"id":"2006.07988","title":"Adaptive Universal Generalized PageRank Graph Neural Network","created":"2020-06-14","cited_by_count":595},{"id":"1905.00067","title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing","created":"2019-04-30","cited_by_count":443},{"id":"1805.10965","title":"Lipschitz regularity of deep neural networks: analysis and efficient estimation","created":"2018-05-28","cited_by_count":415},{"id":"2101.00797","title":"Beyond Low-frequency Information in Graph Convolutional Networks","created":"2021-01-04","cited_by_count":362},{"id":"2007.09296","title":"Towards Deeper Graph Neural Networks","created":"2020-07-18","cited_by_count":296},{"id":"2004.11198","title":"SIGN: Scalable Inception Graph Neural Networks","created":"2020-04-23","cited_by_count":284},{"id":"2202.04579","title":"Neural Sheaf Diffusion: A Topological Perspective on Heterophily and Oversmoothing in GNNs","created":"2022-02-09","cited_by_count":214},{"id":"2306.08385","title":"NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification","created":"2023-06-14","cited_by_count":210},{"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},{"id":"2106.06134","title":"Is Homophily a Necessity for Graph Neural Networks?","created":"2021-06-11","cited_by_count":182},{"id":"2205.07308","title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","created":"2022-05-15","cited_by_count":179},{"id":"2205.11172","title":"How Powerful are Spectral Graph Neural Networks","created":"2022-05-23","cited_by_count":169},{"id":"2210.07606","title":"Revisiting Heterophily For Graph Neural Networks","created":"2022-10-14","cited_by_count":169},{"id":"2306.10759","title":"SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations","created":"2023-06-19","cited_by_count":133},{"id":"2101.11859","title":"Interpreting and Unifying Graph Neural Networks with An Optimization Framework","created":"2021-01-28","cited_by_count":131},{"id":"2010.01777","title":"A Unified View on Graph Neural Networks as Graph Signal Denoising","created":"2020-10-05","cited_by_count":110},{"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},{"id":"2301.09474","title":"DIFFormer: Scalable (Graph) Transformers Induced by Energy Constrained Diffusion","created":"2023-01-23","cited_by_count":87},{"id":"2406.08993","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","created":"2024-06-13","cited_by_count":85},{"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},{"id":"2302.01524","title":"Ordered GNN: Ordering Message Passing to Deal with Heterophily and Over-smoothing","created":"2023-02-03","cited_by_count":67},{"id":"2403.01232","title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","created":"2024-03-02","cited_by_count":65},{"id":"2110.15174","title":"On Provable Benefits of Depth in Training Graph Convolutional Networks","created":"2021-10-28","cited_by_count":58},{"id":"2305.16102","title":"Demystifying Oversmoothing in Attention-Based Graph Neural Networks","created":"2023-05-25","cited_by_count":49},{"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},{"id":"2305.08048","title":"Towards Understanding the Generalization of Graph Neural Networks","created":"2023-05-14","cited_by_count":41},{"id":"2306.01323","title":"Demystifying Structural Disparity in Graph Neural Networks: Can One Size Fit All?","created":"2023-06-02","cited_by_count":41},{"id":"2310.01267","title":"Cooperative Graph Neural Networks","created":"2023-10-02","cited_by_count":36},{"id":"2402.05660","title":"Rethinking Propagation for Unsupervised Graph Domain Adaptation","created":"2024-02-08","cited_by_count":31},{"id":"2305.02931","title":"Beyond Homophily: Reconstructing Structure for Graph-agnostic Clustering","created":"2023-05-03","cited_by_count":29},{"id":"2407.09618","title":"The Heterophilic Graph Learning Handbook: Benchmarks, Models, Theoretical Analysis, Applications and Challenges","created":"2024-07-12","cited_by_count":29},{"id":"2302.10886","title":"Some Fundamental Aspects about Lipschitz Continuity of Neural Networks","created":"2023-02-21","cited_by_count":26},{"id":"2405.12474","title":"How Universal Polynomial Bases Enhance Spectral Graph Neural Networks: Heterophily, Over-smoothing, and Over-squashing","created":"2024-05-21","cited_by_count":24},{"id":"2404.12008","title":"How Do Recommendation Models Amplify Popularity Bias? An Analysis from the Spectral Perspective","created":"2024-04-18","cited_by_count":21},{"id":"2210.17224","title":"Improving Graph Neural Networks with Learnable Propagation Operators","created":"2022-10-31","cited_by_count":19},{"id":"2410.23686","title":"Towards Dynamic Message Passing on Graphs","created":"2024-10-31","cited_by_count":11},{"id":"2403.10543","title":"Mitigating Oversmoothing Through Reverse Process of GNNs for Heterophilic Graphs","created":"2024-03-11","cited_by_count":10},{"id":"2405.17768","title":"Revisiting the Message Passing in Heterophilous Graph Neural Networks","created":"2024-05-28","cited_by_count":5},{"id":"2406.00452","title":"Towards a Unified Framework of Clustering-based Anomaly Detection","created":"2024-06-01","cited_by_count":1}],"next_cursor":null}