{"list":"other","total":52,"rows":[{"id":"2002.05709","title":"A Simple Framework for Contrastive Learning of Visual Representations","created":"2020-02-13","cited_by_count":12049},{"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":"1701.06538","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","created":"2017-01-23","cited_by_count":3509},{"id":"1704.01212","title":"Neural Message Passing for Quantum Chemistry","created":"2017-04-04","cited_by_count":3487},{"id":"1505.07818","title":"Domain-Adversarial Training of Neural Networks","created":"2015-05-28","cited_by_count":3044},{"id":"2005.00687","title":"Open Graph Benchmark: Datasets for Machine Learning on Graphs","created":"2020-05-02","cited_by_count":2163},{"id":"1703.06103","title":"Modeling Relational Data with Graph Convolutional Networks","created":"2017-03-17","cited_by_count":1694},{"id":"2010.13902","title":"Graph Contrastive Learning with Augmentations","created":"2020-10-22","cited_by_count":1208},{"id":"2002.02126","title":"LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation","created":"2020-02-06","cited_by_count":1139},{"id":"1806.01973","title":"Graph Convolutional Neural Networks for Web-Scale Recommender Systems","created":"2018-06-06","cited_by_count":1138},{"id":"1809.10341","title":"Deep Graph Infomax","created":"2018-09-27","cited_by_count":1106},{"id":"1703.00564","title":"MoleculeNet: A Benchmark for Molecular Machine Learning","created":"2017-03-02","cited_by_count":1051},{"id":"1811.05868","title":"Pitfalls of Graph Neural Network Evaluation","created":"2018-11-14","cited_by_count":1007},{"id":"1603.08861","title":"Revisiting Semi-Supervised Learning with Graph Embeddings","created":"2016-03-29","cited_by_count":976},{"id":"1802.09691","title":"Link Prediction Based on Graph Neural Networks","created":"2018-02-27","cited_by_count":832},{"id":"2002.05287","title":"Geom-GCN: Geometric Graph Convolutional Networks","created":"2020-02-13","cited_by_count":826},{"id":"1506.04757","title":"Image-based Recommendations on Styles and Substitutes","created":"2015-06-15","cited_by_count":706},{"id":"2006.05205","title":"On the Bottleneck of Graph Neural Networks and its Practical Implications","created":"2020-06-09","cited_by_count":631},{"id":"1301.2115","title":"Domain Generalization via Invariant Feature Representation","created":"2013-01-10","cited_by_count":623},{"id":"2004.09813","title":"Making Monolingual Sentence Embeddings Multilingual using Knowledge Distillation","created":"2020-04-21","cited_by_count":593},{"id":"2205.10803","title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","created":"2022-05-22","cited_by_count":448},{"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":"1904.05801","title":"Bridging Theory and Algorithm for Domain Adaptation","created":"2019-04-11","cited_by_count":332},{"id":"2310.00149","title":"One for All: Towards Training One Graph Model for All Classification Tasks","created":"2023-09-29","cited_by_count":243},{"id":"2310.13023","title":"GraphGPT: Graph Instruction Tuning for Large Language Models","created":"2023-10-19","cited_by_count":226},{"id":"2206.00272","title":"Vision GNN: An Image is Worth Graph of Nodes","created":"2022-06-01","cited_by_count":186},{"id":"2302.08043","title":"GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networks","created":"2023-02-16","cited_by_count":167},{"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":"2209.15240","title":"Universal Prompt Tuning for Graph Neural Networks","created":"2022-09-30","cited_by_count":100},{"id":"2402.09834","title":"All in One and One for All: A Simple yet Effective Method towards Cross-domain Graph Pretraining","created":"2024-02-15","cited_by_count":86},{"id":"2403.07652","title":"Harder Tasks Need More Experts: Dynamic Routing in MoE Models","created":"2024-03-12","cited_by_count":72},{"id":"2402.12984","title":"Can GNN be Good Adapter for LLMs?","created":"2024-02-20","cited_by_count":71},{"id":"2502.05424","title":"SAMGPT: Text-free Graph Foundation Model for Multi-domain Pre-training and Cross-domain Adaptation","created":"2025-02-08","cited_by_count":62},{"id":"2407.09709","title":"GOFA: A Generative One-For-All Model for Joint Graph Language Modeling","created":"2024-07-12","cited_by_count":57},{"id":"2408.10700","title":"AnyGraph: Graph Foundation Model in the Wild","created":"2024-08-20","cited_by_count":53},{"id":"2505.15116","title":"Graph Foundation Models: A Comprehensive Survey","created":"2025-05-21","cited_by_count":44},{"id":"2502.02017","title":"Multi-Domain Graph Foundation Models: Robust Knowledge Transfer via Topology Alignment","created":"2025-02-04","cited_by_count":42},{"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},{"id":"2310.18884","title":"Simple and Asymmetric Graph Contrastive Learning without Augmentations","created":"2023-10-29","cited_by_count":38},{"id":"2502.03251","title":"RiemannGFM: Learning a Graph Foundation Model from Riemannian Geometry","created":"2025-02-05","cited_by_count":35},{"id":"2408.12594","title":"Non-Homophilic Graph Pre-Training and Prompt Learning","created":"2024-08-22","cited_by_count":31},{"id":"2005.05537","title":"GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions","created":"2020-05-12","cited_by_count":29},{"id":"2306.11586","title":"Provably Powerful Graph Neural Networks for Directed Multigraphs","created":"2023-06-20","cited_by_count":27},{"id":"2412.11085","title":"GraphMoRE: Mitigating Topological Heterogeneity via Mixture of Riemannian Experts","created":"2024-12-15","cited_by_count":24},{"id":"2501.18739","title":"Beyond Message Passing: Neural Graph Pattern Machine","created":"2025-01-30","cited_by_count":17},{"id":"2407.19944","title":"Noise-Resilient Unsupervised Graph Representation Learning via Multi-Hop Feature Quality Estimation","created":"2024-07-29","cited_by_count":11},{"id":"2505.16130","title":"Generative Graph Pattern Machine","created":"2025-05-22","cited_by_count":11},{"id":"2212.13202","title":"2-hop Neighbor Class Similarity (2NCS): A graph structural metric indicative of graph neural network performance","created":"2022-12-26","cited_by_count":8},{"id":"2403.17404","title":"Generalization Error Analysis for Sparse Mixture-of-Experts: A Preliminary Study","created":"2024-03-26","cited_by_count":5}],"next_cursor":null}