{"list":"other","total":54,"rows":[{"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":"1705.07874","title":"A Unified Approach to Interpreting Model Predictions","created":"2017-05-22","cited_by_count":6555},{"id":"1706.02216","title":"Inductive Representation Learning on Large Graphs","created":"2017-06-07","cited_by_count":6320},{"id":"1603.02754","title":"XGBoost: A Scalable Tree Boosting System","created":"2016-03-09","cited_by_count":5166},{"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":"1902.07153","title":"Simplifying Graph Convolutional Networks","created":"2019-02-19","cited_by_count":1477},{"id":"1811.05868","title":"Pitfalls of Graph Neural Network Evaluation","created":"2018-11-14","cited_by_count":1007},{"id":"2105.14491","title":"How Attentive are Graph Attention Networks?","created":"2021-05-30","cited_by_count":835},{"id":"2205.12454","title":"Recipe for a General, Powerful, Scalable Graph Transformer","created":"2022-05-25","cited_by_count":713},{"id":"2006.07988","title":"Adaptive Universal Generalized PageRank Graph Neural Network","created":"2020-06-14","cited_by_count":595},{"id":"1909.13021","title":"Multi-scale Attributed Node Embedding","created":"2019-09-28","cited_by_count":548},{"id":"2004.05718","title":"Principal Neighbourhood Aggregation for Graph Nets","created":"2020-04-12","cited_by_count":478},{"id":"2111.14522","title":"Understanding over-squashing and bottlenecks on graphs via curvature","created":"2021-11-29","cited_by_count":478},{"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":"2004.11198","title":"SIGN: Scalable Inception Graph Neural Networks","created":"2020-04-23","cited_by_count":284},{"id":"2007.02901","title":"Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks","created":"2020-07-06","cited_by_count":260},{"id":"1912.09893","title":"A Fair Comparison of Graph Neural Networks for Graph Classification","created":"2019-12-20","cited_by_count":244},{"id":"2306.08385","title":"NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification","created":"2023-06-14","cited_by_count":210},{"id":"1810.11363","title":"CatBoost: gradient boosting with categorical features support","created":"2018-10-24","cited_by_count":208},{"id":"2009.13566","title":"Graph Neural Networks with Heterophily","created":"2020-09-28","cited_by_count":202},{"id":"2203.05556","title":"On Embeddings for Numerical Features in Tabular Deep Learning","created":"2022-03-10","cited_by_count":186},{"id":"2205.07308","title":"Finding Global Homophily in Graph Neural Networks When Meeting Heterophily","created":"2022-05-15","cited_by_count":179},{"id":"2303.06147","title":"Exphormer: Sparse Transformers for Graphs","created":"2023-03-10","cited_by_count":170},{"id":"2206.04910","title":"NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs","created":"2022-06-10","cited_by_count":137},{"id":"2306.10759","title":"SGFormer: Simplifying and Empowering Transformers for Large-Graph Representations","created":"2023-06-19","cited_by_count":133},{"id":"2007.15884","title":"The Kolmogorov-Arnold representation theorem revisited","created":"2020-07-31","cited_by_count":89},{"id":"2406.08993","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","created":"2024-06-13","cited_by_count":85},{"id":"2206.04355","title":"Graph Attention Multi-Layer Perceptron","created":"2022-06-09","cited_by_count":83},{"id":"2212.04481","title":"A Survey of Graph Neural Networks for Social Recommender Systems","created":"2022-12-08","cited_by_count":65},{"id":"2403.01232","title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","created":"2024-03-02","cited_by_count":65},{"id":"2209.06177","title":"Characterizing Graph Datasets for Node Classification: Homophily-Heterophily Dichotomy and Beyond","created":"2022-09-13","cited_by_count":60},{"id":"2111.06748","title":"Simplifying approach to Node Classification in Graph Neural Networks","created":"2021-11-12","cited_by_count":56},{"id":"2502.14546","title":"Position: Graph Learning Will Lose Relevance Due To Poor Benchmarks","created":"2025-02-20","cited_by_count":53},{"id":"2508.20906","title":"Turning Tabular Foundation Models into Graph Foundation Models","created":"2025-08-28","cited_by_count":35},{"id":"2111.11146","title":"On the Existence of Universal Lottery Tickets","created":"2021-11-22","cited_by_count":30},{"id":"2309.13775","title":"The Rashomon Importance Distribution: Getting RID of Unstable, Single Model-based Variable Importance","created":"2023-09-24","cited_by_count":29},{"id":"2502.09263","title":"Can Classic GNNs Be Strong Baselines for Graph-level Tasks? Simple Architectures Meet Excellence","created":"2025-02-13","cited_by_count":26},{"id":"2404.04612","title":"Spectral Graph Pruning Against Over-Squashing and Over-Smoothing","created":"2024-04-06","cited_by_count":24},{"id":"2409.14500","title":"GraphLand: Evaluating Graph Machine Learning Models on Diverse Industrial Data","created":"2024-09-22","cited_by_count":20},{"id":"2502.02379","title":"No Metric to Rule Them All: Toward Principled Evaluations of Graph-Learning Datasets","created":"2025-02-04","cited_by_count":16},{"id":"2411.12732","title":"Benchmarking Positional Encodings for GNNs and Graph Transformers","created":"2024-11-19","cited_by_count":13},{"id":"2502.04891","title":"GNNs Getting ComFy: Community and Feature Similarity Guided Rewiring","created":"2025-02-07","cited_by_count":13},{"id":"2205.15142","title":"Special Properties of Gradient Descent with Large Learning Rates","created":"2022-05-30","cited_by_count":10},{"id":"2310.07235","title":"Are GATs Out of Balance?","created":"2023-10-11","cited_by_count":10},{"id":"2512.08798","title":"Can TabPFN Compete with GNNs for Node Classification via Graph Tabularization?","created":"2025-12-09","cited_by_count":10},{"id":"2409.11504","title":"Preventing Representational Rank Collapse in MPNNs by Splitting the Computational Graph","created":"2024-09-17","cited_by_count":6},{"id":"2410.22113","title":"Where Do Large Learning Rates Lead Us?","created":"2024-10-29","cited_by_count":6},{"id":"2406.00418","title":"GATE: How to Keep Out Intrusive Neighbors","created":"2024-06-01","cited_by_count":5},{"id":"2505.21422","title":"When Shift Happens - Confounding Is to Blame","created":"2025-05-27","cited_by_count":5},{"id":"2406.16687","title":"Link Prediction with Untrained Message Passing Layers","created":"2024-06-24","cited_by_count":3},{"id":"2305.19717","title":"An Empirical Evaluation of Rewiring Approaches in Graph Neural Networks","created":"2023-05-31","cited_by_count":2},{"id":"2410.13416","title":"Partially Trained Graph Convolutional Networks Resist Oversmoothing","created":"2024-10-17","cited_by_count":1}],"next_cursor":null}