{"list":"other","total":68,"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":"1706.02216","title":"Inductive Representation Learning on Large Graphs","created":"2017-06-07","cited_by_count":6320},{"id":"2006.09882","title":"Unsupervised Learning of Visual Features by Contrasting Cluster Assignments","created":"2020-06-17","cited_by_count":2857},{"id":"1306.0895","title":"Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distances","created":"2013-06-04","cited_by_count":2316},{"id":"1902.07153","title":"Simplifying Graph Convolutional Networks","created":"2019-02-19","cited_by_count":1477},{"id":"2010.13902","title":"Graph Contrastive Learning with Augmentations","created":"2020-10-22","cited_by_count":1208},{"id":"1809.10341","title":"Deep Graph Infomax","created":"2018-09-27","cited_by_count":1106},{"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":"2002.05287","title":"Geom-GCN: Geometric Graph Convolutional Networks","created":"2020-02-13","cited_by_count":826},{"id":"2006.05582","title":"Contrastive Multi-View Representation Learning on Graphs","created":"2020-06-10","cited_by_count":652},{"id":"1909.13021","title":"Multi-scale Attributed Node Embedding","created":"2019-09-28","cited_by_count":548},{"id":"2010.14945","title":"Graph Contrastive Learning with Adaptive Augmentation","created":"2020-10-27","cited_by_count":519},{"id":"1710.04087","title":"Word Translation Without Parallel Data","created":"2017-10-11","cited_by_count":487},{"id":"2006.09963","title":"GCC: Graph Contrastive Coding for Graph Neural Network Pre-Training","created":"2020-06-17","cited_by_count":463},{"id":"2205.10803","title":"GraphMAE: Self-Supervised Masked Graph Autoencoders","created":"2022-05-22","cited_by_count":448},{"id":"1908.01000","title":"InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximization","created":"2019-07-31","cited_by_count":441},{"id":"2005.10203","title":"Graph Structure Learning for Robust Graph Neural Networks","created":"2020-05-20","cited_by_count":371},{"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":"2310.00149","title":"One for All: Towards Training One Graph Model for All Classification Tasks","created":"2023-09-29","cited_by_count":243},{"id":"2102.06514","title":"Large-Scale Representation Learning on Graphs via Bootstrapping","created":"2021-02-12","cited_by_count":186},{"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":"2210.07606","title":"Revisiting Heterophily For Graph Neural Networks","created":"2022-10-14","cited_by_count":169},{"id":"2302.08043","title":"GraphPrompt: Unifying Pre-Training and Downstream Tasks for Graph Neural Networks","created":"2023-02-16","cited_by_count":167},{"id":"2202.02466","title":"Handling Distribution Shifts on Graphs: An Invariance Perspective","created":"2022-02-05","cited_by_count":164},{"id":"2307.01504","title":"All in One: Multi-task Prompting for Graph Neural Networks","created":"2023-07-04","cited_by_count":148},{"id":"2106.12484","title":"From Canonical Correlation Analysis to Self-supervised Graph Neural Networks","created":"2021-06-23","cited_by_count":141},{"id":"2304.04779","title":"GraphMAE2: A Decoding-Enhanced Masked Self-Supervised Graph Learner","created":"2023-04-10","cited_by_count":132},{"id":"1901.06003","title":"Gromov-Wasserstein Learning for Graph Matching and Node Embedding","created":"2019-01-17","cited_by_count":126},{"id":"1905.09718","title":"Meta-GNN: On Few-shot Node Classification in Graph Meta-learning","created":"2019-05-23","cited_by_count":105},{"id":"1906.01277","title":"Wasserstein Weisfeiler-Lehman Graph Kernels","created":"2019-06-04","cited_by_count":104},{"id":"2006.14744","title":"Graph Optimal Transport for Cross-Domain Alignment","created":"2020-06-26","cited_by_count":103},{"id":"2209.15240","title":"Universal Prompt Tuning for Graph Neural Networks","created":"2022-09-30","cited_by_count":100},{"id":"2305.12600","title":"PRODIGY: Enabling In-context Learning Over Graphs","created":"2023-05-21","cited_by_count":98},{"id":"2107.02392","title":"Dirichlet Energy Constrained Learning for Deep Graph Neural Networks","created":"2021-07-06","cited_by_count":97},{"id":"2006.12739","title":"Graph Prototypical Networks for Few-shot Learning on Attributed Networks","created":"2020-06-23","cited_by_count":90},{"id":"2006.07889","title":"Graph Meta Learning via Local Subgraphs","created":"2020-06-14","cited_by_count":89},{"id":"2205.10053","title":"What's Behind the Mask: Understanding Masked Graph Modeling for Graph Autoencoders","created":"2022-05-20","cited_by_count":82},{"id":"1906.02085","title":"GOT: An Optimal Transport framework for Graph comparison","created":"2019-06-05","cited_by_count":64},{"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":"2410.10329","title":"GraphCLIP: Enhancing Transferability in Graph Foundation Models for Text-Attributed Graphs","created":"2024-10-14","cited_by_count":58},{"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":"2006.09430","title":"Wasserstein Embedding for Graph Learning","created":"2020-06-16","cited_by_count":56},{"id":"2009.04266","title":"The Unbalanced Gromov Wasserstein Distance: Conic Formulation and Relaxation","created":"2020-09-09","cited_by_count":56},{"id":"2208.09957","title":"Heterogeneous Graph Masked Autoencoders","created":"2022-08-21","cited_by_count":47},{"id":"2312.01878","title":"HGPROMPT: Bridging Homogeneous and Heterogeneous Graphs for Few-shot Prompt Learning","created":"2023-12-04","cited_by_count":45},{"id":"2406.10727","title":"Text-space Graph Foundation Models: Comprehensive Benchmarks and New Insights","created":"2024-06-15","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":"2408.12594","title":"Non-Homophilic Graph Pre-Training and Prompt Learning","created":"2024-08-22","cited_by_count":31},{"id":"2406.05346","title":"ProG: A Graph Prompt Learning Benchmark","created":"2024-06-08","cited_by_count":29},{"id":"2205.15733","title":"Template based Graph Neural Network with Optimal Transport Distances","created":"2022-05-31","cited_by_count":20},{"id":"2502.06808","title":"On the Benefits of Attribute-Driven Graph Domain Adaptation","created":"2025-02-04","cited_by_count":19},{"id":"2503.00750","title":"Edge Prompt Tuning for Graph Neural Networks","created":"2025-03-02","cited_by_count":18},{"id":"2209.00793","title":"Structure-Preserving Graph Representation Learning","created":"2022-09-02","cited_by_count":17},{"id":"1606.04429","title":"Using Fuzzy Logic to Leverage HTML Markup for Web Page Representation","created":"2016-06-14","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":"2509.22416","title":"One Prompt Fits All: Universal Graph Adaptation for Pretrained Models","created":"2025-09-26","cited_by_count":11},{"id":"2410.16606","title":"GALA: Graph Diffusion-based Alignment with Jigsaw for Source-free Domain Adaptation","created":"2024-10-22","cited_by_count":8},{"id":"2605.08689","title":"Structure-Centric Graph Foundation Model via Geometric Bases","created":"2026-05-09","cited_by_count":5},{"id":"2210.03956","title":"Robust Graph Structure Learning via Multiple Statistical Tests","created":"2022-10-08","cited_by_count":3},{"id":"2410.21749","title":"Reliable and Compact Graph Fine-tuning via GraphSparse Prompting","created":"2024-10-29","cited_by_count":3},{"id":"2606.06397","title":"The Post-GCN Decade Revisited: Curvature-Stratified Evaluation of Relational Learning","created":"2026-06-04","cited_by_count":3},{"id":"2212.06339","title":"Regularized Optimal Transport Layers for Generalized Global Pooling Operations","created":"2022-12-13","cited_by_count":2},{"id":"2410.16718","title":"Learning Partial Graph Matching via Optimal Partial Transport","created":"2024-10-22","cited_by_count":2},{"id":"2608.06031","title":"Dynamic Graph Prompting via Topology-Routed Mixed-Curvature Experts","created":"2026-08-06","cited_by_count":2}],"next_cursor":null}