{"list":"other","total":51,"rows":[{"id":"2005.14165","title":"Language Models are Few-Shot Learners","created":"2020-05-28","cited_by_count":32419},{"id":"2010.11929","title":"An Image is Worth 16x16 Words: Transformers for Image Recognition at Scale","created":"2020-10-22","cited_by_count":30186},{"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":"2111.06377","title":"Masked Autoencoders Are Scalable Vision Learners","created":"2021-11-11","cited_by_count":7403},{"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":"1905.00414","title":"Similarity of Neural Network Representations Revisited","created":"2019-05-01","cited_by_count":1755},{"id":"2010.13902","title":"Graph Contrastive Learning with Augmentations","created":"2020-10-22","cited_by_count":1208},{"id":"2104.13478","title":"Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges","created":"2021-04-27","cited_by_count":1167},{"id":"1809.10341","title":"Deep Graph Infomax","created":"2018-09-27","cited_by_count":1106},{"id":"1312.6203","title":"Spectral Networks and Locally Connected Networks on Graphs","created":"2013-12-21","cited_by_count":1102},{"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":"1905.12265","title":"Strategies for Pre-training Graph Neural Networks","created":"2019-05-29","cited_by_count":971},{"id":"2205.12454","title":"Recipe for a General, Powerful, Scalable Graph Transformer","created":"2022-05-25","cited_by_count":713},{"id":"1802.04364","title":"Junction Tree Variational Autoencoder for Molecular Graph Generation","created":"2018-02-12","cited_by_count":652},{"id":"1907.04931","title":"GraphSAINT: Graph Sampling Based Inductive Learning Method","created":"2019-07-10","cited_by_count":618},{"id":"2205.10803","title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","created":"2022-05-22","cited_by_count":448},{"id":"1802.08773","title":"GraphRNN: Generating Realistic Graphs with Deep Auto-regressive Models","created":"2018-02-24","cited_by_count":413},{"id":"2103.00111","title":"Graph Self-Supervised Learning: A Survey","created":"2021-02-27","cited_by_count":289},{"id":"2305.10037","title":"Can Language Models Solve Graph Problems in Natural Language?","created":"2023-05-17","cited_by_count":252},{"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":"2308.07134","title":"Language is All a Graph Needs","created":"2023-08-14","cited_by_count":220},{"id":"2102.10757","title":"Self-Supervised Learning of Graph Neural Networks: A Unified Review","created":"2021-02-22","cited_by_count":184},{"id":"1805.09114","title":"Optimal Transport for structured data with application on graphs","created":"2018-05-23","cited_by_count":172},{"id":"2307.01504","title":"All in One: Multi-task Prompting for Graph Neural Networks","created":"2023-07-04","cited_by_count":148},{"id":"1704.00805","title":"On the Properties of the Softmax Function with Application in Game Theory and Reinforcement Learning","created":"2017-04-03","cited_by_count":142},{"id":"2304.04779","title":"GraphMAE2: A Decoding-Enhanced Masked Self-Supervised Graph Learner","created":"2023-04-10","cited_by_count":132},{"id":"2310.11829","title":"Graph Foundation Models: Concepts, Opportunities and Challenges","created":"2023-10-18","cited_by_count":103},{"id":"2306.13089","title":"GIMLET: A Unified Graph-Text Model for Instruction-Based Molecule Zero-Shot Learning","created":"2023-05-28","cited_by_count":70},{"id":"1905.10124","title":"Sliced Gromov-Wasserstein","created":"2019-05-24","cited_by_count":66},{"id":"2402.13630","title":"UniGraph: Learning a Unified Cross-Domain Foundation Model for Text-Attributed Graphs","created":"2024-02-21","cited_by_count":66},{"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":"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":"2310.18884","title":"Simple and Asymmetric Graph Contrastive Learning without Augmentations","created":"2023-10-29","cited_by_count":38},{"id":"2102.06555","title":"Online Graph Dictionary Learning","created":"2021-02-12","cited_by_count":37},{"id":"2502.03251","title":"RiemannGFM: Learning a Graph Foundation Model from Riemannian Geometry","created":"2025-02-05","cited_by_count":35},{"id":"2412.16441","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","created":"2024-12-21","cited_by_count":32},{"id":"2305.02931","title":"Beyond Homophily: Reconstructing Structure for Graph-agnostic Clustering","created":"2023-05-03","cited_by_count":29},{"id":"2312.14438","title":"PC-Conv: Unifying Homophily and Heterophily with Two-fold Filtering","created":"2023-12-22","cited_by_count":28},{"id":"2410.13798","title":"Learning Graph Quantized Tokenizers","created":"2024-10-17","cited_by_count":19},{"id":"2502.06808","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","created":"2025-02-04","cited_by_count":19},{"id":"2406.14021","title":"HIGHT: Hierarchical Graph Tokenization for Molecule-Language Alignment","created":"2024-06-20","cited_by_count":17},{"id":"2306.08854","title":"A Gromov--Wasserstein Geometric View of Spectrum-Preserving Graph Coarsening","created":"2023-06-15","cited_by_count":15},{"id":"2409.00687","title":"When Heterophily Meets Heterogeneous Graphs: Latent Graphs Guided Unsupervised Representation Learning","created":"2024-09-01","cited_by_count":12},{"id":"2409.17386","title":"Beyond Redundancy: Information-aware Unsupervised Multiplex Graph Structure Learning","created":"2024-09-25","cited_by_count":12},{"id":"2505.20853","title":"Cooperation of Experts: Fusing Heterogeneous Information with Large Margin","created":"2025-05-27","cited_by_count":6},{"id":"2601.15124","title":"RAG-GFM: Overcoming In-Memory Bottlenecks in Graph Foundation Models via Retrieval-Augmented Generation","created":"2026-01-21","cited_by_count":4},{"id":"2602.17342","title":"From Subtle to Significant: Prompt-Driven Self-Improving Optimization in Test-Time Graph OOD Detection","created":"2026-02-19","cited_by_count":1}],"next_cursor":null}