{"list":"other","total":62,"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":"1704.01212","title":"Neural Message Passing for Quantum Chemistry","created":"2017-04-04","cited_by_count":3487},{"id":"1903.02428","title":"Fast Graph Representation Learning with PyTorch Geometric","created":"2019-03-06","cited_by_count":2434},{"id":"1306.0895","title":"Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances","created":"2013-06-04","cited_by_count":2316},{"id":"1606.09375","title":"Convolutional Neural Networks on Graphs with Fast Localized Spectral Filtering","created":"2016-06-30","cited_by_count":2089},{"id":"1812.08434","title":"Graph Neural Networks: A Review of Methods and Applications","created":"2018-12-20","cited_by_count":1576},{"id":"1902.07153","title":"Simplifying Graph Convolutional Networks","created":"2019-02-19","cited_by_count":1477},{"id":"1806.01973","title":"Graph Convolutional Neural Networks for Web-Scale Recommender Systems","created":"2018-06-06","cited_by_count":1138},{"id":"1312.6203","title":"Spectral Networks and Locally Connected Networks on Graphs","created":"2013-12-21","cited_by_count":1102},{"id":"1801.07606","title":"Deeper Insights into Graph Convolutional Networks for Semi-Supervised Learning","created":"2018-01-22","cited_by_count":1102},{"id":"1807.05520","title":"Deep Clustering for Unsupervised Learning of Visual Features","created":"2018-07-15","cited_by_count":1028},{"id":"1810.05997","title":"Predict then Propagate: Graph Neural Networks meet Personalized PageRank","created":"2018-10-14","cited_by_count":993},{"id":"1603.08861","title":"Revisiting Semi-Supervised Learning with Graph Embeddings","created":"2016-03-29","cited_by_count":976},{"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":"2205.12454","title":"Recipe for a General, Powerful, Scalable Graph Transformer","created":"2022-05-25","cited_by_count":713},{"id":"2006.05205","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","created":"2020-06-09","cited_by_count":631},{"id":"2006.07988","title":"Adaptive Universal Generalized PageRank Graph Neural Network","created":"2020-06-14","cited_by_count":595},{"id":"2009.03509","title":"Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification","created":"2020-09-08","cited_by_count":506},{"id":"2111.14522","title":"Understanding over-squashing and bottlenecks on graphs via curvature","created":"2021-11-29","cited_by_count":478},{"id":"1905.00067","title":"MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing","created":"2019-04-30","cited_by_count":443},{"id":"2101.00797","title":"Beyond Low-frequency Information in Graph Convolutional Networks","created":"2021-01-04","cited_by_count":362},{"id":"2302.11640","title":"A critical look at the evaluation of GNNs under heterophily: Are we really making progress?","created":"2023-02-22","cited_by_count":343},{"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},{"id":"2006.13318","title":"A Note on Over-Smoothing for Graph Neural Networks","created":"2020-06-23","cited_by_count":249},{"id":"2303.10993","title":"A Survey on Oversmoothing in Graph Neural Networks","created":"2023-03-20","cited_by_count":247},{"id":"2009.13566","title":"Graph Neural Networks with Heterophily","created":"2020-09-28","cited_by_count":202},{"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":"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":"2006.16904","title":"Graph Clustering with Graph Neural Networks","created":"2020-06-30","cited_by_count":163},{"id":"2210.11790","title":"FoSR: First-order spectral rewiring for addressing oversquashing in GNNs","created":"2022-10-21","cited_by_count":105},{"id":"2211.15779","title":"Revisiting Over-smoothing and Over-squashing Using Ollivier-Ricci Curvature","created":"2022-11-28","cited_by_count":98},{"id":"2302.06835","title":"Understanding Oversquashing in GNNs through the Lens of Effective Resistance","created":"2023-02-14","cited_by_count":97},{"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},{"id":"2205.13328","title":"How Powerful are K-hop Message Passing Graph Neural Networks","created":"2022-05-26","cited_by_count":90},{"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.04181","title":"Attending to Graph Transformers","created":"2023-02-08","cited_by_count":83},{"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},{"id":"2206.07369","title":"DiffWire: Inductive Graph Rewiring via the Lov\\'asz Bound","created":"2022-06-15","cited_by_count":79},{"id":"2003.01998","title":"Neural Enhanced Belief Propagation on Factor Graphs","created":"2020-03-04","cited_by_count":57},{"id":"2111.06748","title":"Simplifying approach to Node Classification in Graph Neural Networks","created":"2021-11-12","cited_by_count":56},{"id":"2006.07107","title":"Understanding and Resolving Performance Degradation in Graph Convolutional Networks","created":"2020-06-12","cited_by_count":53},{"id":"2208.03471","title":"Oversquashing in GNNs through the lens of information contraction and graph expansion","created":"2022-08-06","cited_by_count":53},{"id":"2104.12840","title":"AdaGNN: Graph Neural Networks with Adaptive Frequency Response Filter","created":"2021-04-26","cited_by_count":43},{"id":"2111.07337","title":"$p$-Laplacian Based Graph Neural Networks","created":"2021-11-14","cited_by_count":39},{"id":"1803.07710","title":"Inference in Probabilistic Graphical Models by Graph Neural Networks","created":"2018-03-21","cited_by_count":38},{"id":"2212.02229","title":"GPS++: An Optimised Hybrid MPNN/Transformer for Molecular Property Prediction","created":"2022-11-18","cited_by_count":28},{"id":"2209.03473","title":"Higher-order Clustering and Pooling for Graph Neural Networks","created":"2022-09-02","cited_by_count":26},{"id":"2006.04804","title":"Optimal Transport Graph Neural Networks","created":"2020-06-08","cited_by_count":24},{"id":"2205.15733","title":"Template based Graph Neural Network with Optimal Transport Distances","created":"2022-05-31","cited_by_count":20},{"id":"2306.03209","title":"End-to-end Differentiable Clustering with Associative Memories","created":"2023-06-05","cited_by_count":15},{"id":"2308.00887","title":"Factor Graph Neural Networks","created":"2023-08-02","cited_by_count":15},{"id":"1801.02790","title":"Better and Simpler Error Analysis of the Sinkhorn-Knopp Algorithm for Matrix Scaling","created":"2018-01-09","cited_by_count":14},{"id":"2305.16358","title":"Differentiable Clustering with Perturbed Spanning Forests","created":"2023-05-25","cited_by_count":14},{"id":"2210.08195","title":"HP-GMN: Graph Memory Networks for Heterophilous Graphs","created":"2022-10-15","cited_by_count":13},{"id":"2007.06737","title":"Representation Transfer by Optimal Transport","created":"2020-07-13","cited_by_count":8},{"id":"2010.09283","title":"Neuralizing Efficient Higher-order Belief Propagation","created":"2020-10-19","cited_by_count":5}],"next_cursor":null}