{"total":242,"rows":[{"id":"2103.00111","title":"Graph Self-Supervised Learning: A Survey","created":"2021-02-27","cited_by_count":289,"area":null},{"id":"2310.00149","title":"One for All: Towards Training One Graph Model for All Classification Tasks","created":"2023-09-29","cited_by_count":243,"area":null},{"id":"2102.06514","title":"Large-Scale Representation Learning on Graphs via Bootstrapping","created":"2021-02-12","cited_by_count":186,"area":null},{"id":"2105.07342","title":"Self-supervised Learning on Graphs: Contrastive, Generative,or Predictive","created":"2021-05-16","cited_by_count":136,"area":null},{"id":"2101.11859","title":"Interpreting and Unifying Graph Neural Networks with An Optimization Framework","created":"2021-01-28","cited_by_count":131,"area":null},{"id":"2109.01116","title":"An Empirical Study of Graph Contrastive Learning","created":"2021-09-02","cited_by_count":113,"area":null},{"id":"2102.11391","title":"MagNet: A Neural Network for Directed Graphs","created":"2021-02-22","cited_by_count":107,"area":null},{"id":"2204.04879","title":"How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision","created":"2022-04-11","cited_by_count":102,"area":null},{"id":"2112.02472","title":"Augmentation-Free Self-Supervised Learning on Graphs","created":"2021-12-05","cited_by_count":94,"area":null},{"id":"2106.05609","title":"GNNAutoScale: Scalable and Expressive Graph Neural Networks via Historical Embeddings","created":"2021-06-10","cited_by_count":90,"area":null},{"id":"2106.02466","title":"Graph Barlow Twins: A self-supervised representation learning framework for graphs","created":"2021-06-04","cited_by_count":85,"area":null},{"id":"2406.08993","title":"Classic GNNs are Strong Baselines: Reassessing GNNs for Node Classification","created":"2024-06-13","cited_by_count":85,"area":null},{"id":"2110.02027","title":"ProGCL: Rethinking Hard Negative Mining in Graph Contrastive Learning","created":"2021-10-05","cited_by_count":72,"area":null},{"id":"2310.04668","title":"Label-free Node Classification on Graphs with Large Language Models (LLMS)","created":"2023-10-07","cited_by_count":72,"area":null},{"id":"2403.01232","title":"Polynormer: Polynomial-Expressive Graph Transformer in Linear Time","created":"2024-03-02","cited_by_count":65,"area":null},{"id":"2211.14065","title":"Beyond Smoothing: Unsupervised Graph Representation Learning with Edge Heterophily Discriminating","created":"2022-11-25","cited_by_count":57,"area":null},{"id":"2407.09709","title":"GOFA: A Generative One-For-All Model for Joint Graph Language Modeling","created":"2024-07-12","cited_by_count":57,"area":null},{"id":"2106.05470","title":"Automated Self-Supervised Learning for Graphs","created":"2021-06-10","cited_by_count":50,"area":null},{"id":"2212.01026","title":"Spectral Feature Augmentation for Graph Contrastive Learning and Beyond","created":"2022-12-02","cited_by_count":49,"area":null},{"id":"2206.04726","title":"COSTA: Covariance-Preserving Feature Augmentation for Graph Contrastive Learning","created":"2022-06-09","cited_by_count":39,"area":null},{"id":"2210.00643","title":"Spectral Augmentation for Self-Supervised Learning on Graphs","created":"2022-10-02","cited_by_count":39,"area":null},{"id":"2405.20445","title":"Fully-inductive Node Classification on Arbitrary Graphs","created":"2024-05-30","cited_by_count":39,"area":null},{"id":"2106.11133","title":"GraphMixup: Improving Class-Imbalanced Node Classification on Graphs by Self-supervised Context Prediction","created":"2021-06-21","cited_by_count":36,"area":null},{"id":"2407.07457","title":"GLBench: A Comprehensive Benchmark for Graph with Large Language Models","created":"2024-07-10","cited_by_count":36,"area":null},{"id":"2502.03251","title":"RiemannGFM: Learning a Graph Foundation Model from Riemannian Geometry","created":"2025-02-05","cited_by_count":35,"area":null},{"id":"2508.20906","title":"Turning Tabular Foundation Models into Graph Foundation Models","created":"2025-08-28","cited_by_count":35,"area":null},{"id":"2110.14863","title":"Graph Communal Contrastive Learning","created":"2021-10-28","cited_by_count":34,"area":null},{"id":"2308.06714","title":"Learning on Graphs with Out-of-Distribution Nodes","created":"2023-08-13","cited_by_count":29,"area":null},{"id":"2306.15427","title":"Adversarial Training for Graph Neural Networks: Pitfalls, Solutions, and New Directions","created":"2023-06-27","cited_by_count":28,"area":null},{"id":"2106.15762","title":"Curvature Graph Neural Network","created":"2021-06-30","cited_by_count":24,"area":null},{"id":"2304.04300","title":"Class-Imbalanced Learning on Graphs: A Survey","created":"2023-04-09","cited_by_count":24,"area":null},{"id":"2306.02376","title":"Towards Deep Attention in Graph Neural Networks: Problems and Remedies","created":"2023-06-04","cited_by_count":24,"area":null},{"id":"2304.01391","title":"Counterfactual Learning on Graphs: A Survey","created":"2023-04-03","cited_by_count":22,"area":null},{"id":"2402.07225","title":"Rethinking Graph Masked Autoencoders through Alignment and Uniformity","created":"2024-02-11","cited_by_count":22,"area":null},{"id":"2503.03313","title":"LLM as GNN: Graph Vocabulary Learning for Text-Attributed Graph Foundation Models","created":"2025-03-05","cited_by_count":22,"area":null},{"id":"2106.07451","title":"Noise-robust Graph Learning by Estimating and Leveraging Pairwise Interactions","created":"2021-06-14","cited_by_count":21,"area":null},{"id":"2210.08345","title":"Augmentation-Free Graph Contrastive Learning of Invariant-Discriminative Representations","created":"2022-10-15","cited_by_count":21,"area":null},{"id":"2308.09663","title":"GiGaMAE: Generalizable Graph Masked Autoencoder via Collaborative Latent Space Reconstruction","created":"2023-08-18","cited_by_count":21,"area":null},{"id":"2408.00295","title":"Contrastive Graph Representation Learning with Adversarial Cross-view Reconstruction and Information Bottleneck","created":"2024-08-01","cited_by_count":21,"area":null},{"id":"2502.00829","title":"When Do LLMs Help With Node Classification? A Comprehensive Analysis","created":"2025-02-02","cited_by_count":21,"area":null},{"id":"2201.05540","title":"Compact Graph Structure Learning via Mutual Information Compression","created":"2022-01-14","cited_by_count":20,"area":null},{"id":"2201.07951","title":"Informative Pseudo-Labeling for Graph Neural Networks with Few Labels","created":"2022-01-20","cited_by_count":19,"area":null},{"id":"2211.10782","title":"Let Graph be the Go Board: Gradient-free Node Injection Attack for Graph Neural Networks via Reinforcement Learning","created":"2022-11-19","cited_by_count":19,"area":null},{"id":"2410.13798","title":"Learning Graph Quantized Tokenizers","created":"2024-10-17","cited_by_count":19,"area":null},{"id":"2201.08932","title":"Overcoming Oversmoothness in Graph Convolutional Networks via Hybrid Scattering Networks","created":"2022-01-22","cited_by_count":18,"area":null},{"id":"2202.10793","title":"PyTorch Geometric Signed Directed: A Software Package on Graph Neural Networks for Signed and Directed Graphs","created":"2022-02-22","cited_by_count":18,"area":null},{"id":"2301.12230","title":"Continual Graph Learning: A Survey","created":"2023-01-28","cited_by_count":18,"area":null},{"id":"2210.07441","title":"Characterizing the Influence of Graph Elements","created":"2022-10-14","cited_by_count":16,"area":null},{"id":"2509.07143","title":"Bringing Graphs to the Table: Zero-shot Node Classification via Tabular Foundation Models","created":"2025-09-08","cited_by_count":16,"area":null},{"id":"2207.07408","title":"pathGCN: Learning General Graph Spatial Operators from Paths","created":"2022-07-15","cited_by_count":15,"area":null},{"id":"2406.12608","title":"Bridging Local Details and Global Context in Text-Attributed Graphs","created":"2024-06-18","cited_by_count":15,"area":null},{"id":"2505.19024","title":"Learn Beneficial Noise as Graph Augmentation","created":"2025-05-25","cited_by_count":15,"area":null},{"id":"2201.09830","title":"Learning Graph Augmentations to Learn Graph Representations","created":"2022-01-24","cited_by_count":14,"area":null},{"id":"2412.21151","title":"PyG-SSL: A Graph Self-Supervised Learning Toolkit","created":"2024-12-30","cited_by_count":14,"area":null},{"id":"2505.12684","title":"Towards Effective Federated Graph Foundation Model via Mitigating Knowledge Entanglement","created":"2025-05-19","cited_by_count":14,"area":null},{"id":"2308.09198","title":"Half-Hop: A graph upsampling approach for slowing down message passing","created":"2023-08-17","cited_by_count":13,"area":null},{"id":"2411.16278","title":"Even Sparser Graph Transformers","created":"2024-11-25","cited_by_count":13,"area":null},{"id":"2511.05592","title":"GRAVER: Generative Graph Vocabularies for Robust Graph Foundation Models Fine-tuning","created":"2025-11-05","cited_by_count":13,"area":null},{"id":"2206.07729","title":"Taxonomy of Benchmarks in Graph Representation Learning","created":"2022-06-15","cited_by_count":12,"area":null},{"id":"2208.13685","title":"FedEgo: Privacy-preserving Personalized Federated Graph Learning with Ego-graphs","created":"2022-08-29","cited_by_count":12,"area":null},{"id":"2408.03765","title":"Reliable Node Similarity Matrix Guided Contrastive Graph Clustering","created":"2024-08-07","cited_by_count":12,"area":null},{"id":"2208.10493","title":"Relational Self-Supervised Learning on Graphs","created":"2022-08-21","cited_by_count":11,"area":null},{"id":"2401.11772","title":"LightDiC: A Simple yet Effective Approach for Large-scale Digraph Representation Learning","created":"2024-01-22","cited_by_count":11,"area":null},{"id":"2402.03814","title":"Masked Graph Autoencoder with Non-discrete Bandwidths","created":"2024-02-06","cited_by_count":11,"area":null},{"id":"2407.12068","title":"Learning on Graphs with Large Language Models(LLMs): A Deep Dive into Model Robustness","created":"2024-07-16","cited_by_count":11,"area":null},{"id":"2411.10023","title":"Model Inversion Attacks: A Survey of Approaches and Countermeasures","created":"2024-11-15","cited_by_count":11,"area":null},{"id":"2202.08391","title":"Graph Masked Autoencoders with Transformers","created":"2022-02-17","cited_by_count":10,"area":null},{"id":"2405.16435","title":"Node Identifiers: Compact, Discrete Representations for Efficient Graph Learning","created":"2024-05-26","cited_by_count":10,"area":null},{"id":"2301.13340","title":"Affinity Uncertainty-based Hard Negative Mining in Graph Contrastive Learning","created":"2023-01-31","cited_by_count":9,"area":null},{"id":"2402.04621","title":"Feature Distribution on Graph Topology Mediates the Effect of Graph Convolution: Homophily Perspective","created":"2024-02-07","cited_by_count":9,"area":null},{"id":"2406.14683","title":"TAGLAS: An atlas of text-attributed graph datasets in the era of large graph and language models","created":"2024-06-20","cited_by_count":9,"area":null},{"id":"2406.18854","title":"What Is Missing In Homophily? Disentangling Graph Homophily For Graph Neural Networks","created":"2024-06-27","cited_by_count":9,"area":null},{"id":"2111.03264","title":"Graph Denoising with Framelet Regularizer","created":"2021-11-05","cited_by_count":8,"area":null},{"id":"2201.12994","title":"MGNN: Graph Neural Networks Inspired by Distance Geometry Problem","created":"2022-01-31","cited_by_count":8,"area":null},{"id":"2211.10929","title":"Towards Generalizable Graph Contrastive Learning: An Information Theory Perspective","created":"2022-11-20","cited_by_count":8,"area":null},{"id":"2211.14568","title":"BeGin: Extensive Benchmark Scenarios and An Easy-to-use Framework for Graph Continual Learning","created":"2022-11-26","cited_by_count":8,"area":null},{"id":"2305.09938","title":"Mastering Long-Tail Complexity on Graphs: Characterization, Learning, and Generalization","created":"2023-05-17","cited_by_count":8,"area":null},{"id":"2502.11836","title":"Model Generalization on Text Attribute Graphs: Principles with Large Language Models","created":"2025-02-17","cited_by_count":8,"area":null},{"id":"2503.17908","title":"Does GCL Need a Large Number of Negative Samples? Enhancing Graph Contrastive Learning with Effective and Efficient Negative Sampling","created":"2025-03-23","cited_by_count":8,"area":null},{"id":"2505.02130","title":"Attention Mechanisms Perspective: Exploring LLM Processing of Graph-Structured Data","created":"2025-05-04","cited_by_count":8,"area":null},{"id":"2510.07755","title":"FedBook: A Unified Federated Graph Foundation Codebook with Intra-domain and Inter-domain Knowledge Modeling","created":"2025-10-09","cited_by_count":8,"area":null},{"id":"2205.09389","title":"Simplifying Node Classification on Heterophilous Graphs with Compatible Label Propagation","created":"2022-05-19","cited_by_count":7,"area":null},{"id":"2305.04658","title":"CSGCL: Community-Strength-Enhanced Graph Contrastive Learning","created":"2023-05-08","cited_by_count":7,"area":null},{"id":"2406.13250","title":"LangTopo: Aligning Language Descriptions of Graphs with Tokenized Topological Modeling","created":"2024-06-19","cited_by_count":7,"area":null},{"id":"2202.03233","title":"A Variational Edge Partition Model for Supervised Graph Representation Learning","created":"2022-02-07","cited_by_count":6,"area":null},{"id":"2202.04936","title":"Robust Graph Representation Learning for Local Corruption Recovery","created":"2022-02-10","cited_by_count":6,"area":null},{"id":"2205.10070","title":"On the Prediction Instability of Graph Neural Networks","created":"2022-05-20","cited_by_count":6,"area":null},{"id":"2306.10649","title":"CompanyKG: A Large-Scale Heterogeneous Graph for Company Similarity Quantification","created":"2023-06-18","cited_by_count":6,"area":null},{"id":"2307.08235","title":"Towards Heterogeneous Long-tailed Learning: Benchmarking, Metrics, and Toolbox","created":"2023-07-17","cited_by_count":6,"area":null},{"id":"2308.06801","title":"SAILOR: Structural Augmentation Based Tail Node Representation Learning","created":"2023-08-13","cited_by_count":6,"area":null},{"id":"2312.16788","title":"Mitigating Degree Biases in Message Passing Mechanism by Utilizing Community Structures","created":"2023-12-28","cited_by_count":6,"area":null},{"id":"2401.12564","title":"Graph Contrastive Invariant Learning from the Causal Perspective","created":"2024-01-23","cited_by_count":6,"area":null},{"id":"2403.01942","title":"Mitigating Label Noise on Graph via Topological Sample Selection","created":"2024-03-04","cited_by_count":6,"area":null},{"id":"2406.05482","title":"Efficient Topology-aware Data Augmentation for High-Degree Graph Neural Networks","created":"2024-06-08","cited_by_count":6,"area":null},{"id":"2408.05087","title":"Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning","created":"2024-08-09","cited_by_count":6,"area":null},{"id":"2410.02622","title":"Diss-l-ECT: Dissecting Graph Data with Local Euler Characteristic Transforms","created":"2024-10-03","cited_by_count":6,"area":null},{"id":"2412.00537","title":"Exact Certification of (Graph) Neural Networks Against Label Poisoning","created":"2024-11-30","cited_by_count":6,"area":null},{"id":"2503.22097","title":"Few-Shot Graph Out-of-Distribution Detection with LLMs","created":"2025-03-28","cited_by_count":6,"area":null},{"id":"2504.02343","title":"Toward General and Robust LLM-enhanced Text-attributed Graph Learning","created":"2025-04-03","cited_by_count":6,"area":null},{"id":"2504.21198","title":"Graph Synthetic Out-of-Distribution Exposure with Large Language Models","created":"2025-04-29","cited_by_count":6,"area":null}],"next_cursor":"100"}