{"total":18,"rows":[{"id":"2409.16670","title":"GraphLoRA: Structure-Aware Contrastive Low-Rank Adaptation for Cross-Graph Transfer Learning","created":"2024-09-25","cited_by_count":21,"area":null},{"id":"2401.09769","title":"A Survey on Learning from Graphs with Heterophily: Recent Advances and Future Directions","created":"2024-01-18","cited_by_count":13,"area":null},{"id":"2509.22416","title":"One Prompt Fits All: Universal Graph Adaptation for Pretrained Models","created":"2025-09-26","cited_by_count":11,"area":null},{"id":"2310.15523","title":"Generative and Contrastive Paradigms Are Complementary for Graph Self-Supervised Learning","created":"2023-10-24","cited_by_count":9,"area":null},{"id":"2403.16137","title":"A Survey on Self-Supervised Graph Foundation Models: Knowledge-Based Perspective","created":"2024-03-24","cited_by_count":9,"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":"2411.01157","title":"Negative-Free Self-Supervised Gaussian Embedding of Graphs","created":"2024-11-02","cited_by_count":5,"area":null},{"id":"2505.05533","title":"Rethinking Graph Contrastive Learning through Relative Similarity Preservation","created":"2025-05-08","cited_by_count":5,"area":null},{"id":"2507.07141","title":"Str-GCL: Structural Commonsense Driven Graph Contrastive Learning","created":"2025-07-09","cited_by_count":3,"area":null},{"id":"2403.03465","title":"Self-Attention Empowered Graph Convolutional Network for Structure Learning and Node Embedding","created":"2024-03-06","cited_by_count":2,"area":null},{"id":"2407.16726","title":"Topology Reorganized Graph Contrastive Learning with Mitigating Semantic Drift","created":"2024-07-23","cited_by_count":1,"area":null},{"id":"2603.08159","title":"Learning Hierarchical Knowledge in Text-Rich Networks with Taxonomy-Informed Representation Learning","created":"2026-03-09","cited_by_count":1,"area":null},{"id":"2405.00172","title":"Bypassing Skip-Gram Negative Sampling: Dimension Regularization as a More Efficient Alternative for Graph Embeddings","created":"2024-04-30","cited_by_count":0,"area":null},{"id":"2409.08010","title":"Multiplex Graph Contrastive Learning with Soft Negatives","created":"2024-09-12","cited_by_count":0,"area":null},{"id":"2512.15744","title":"How Do Graph Signals Affect Recommendation: Unveiling the Mystery of Low and High-Frequency Graph Signals","created":"2025-12-10","cited_by_count":0,"area":null},{"id":"2601.01703","title":"Beyond Homophily: Community Search on Heterophilic Graphs","created":"2026-01-05","cited_by_count":0,"area":null},{"id":"2604.14746","title":"Disentangle-then-Refine: LLM-Guided Decoupling and Structure-Aware Refinement for Graph Contrastive Learning","created":"2026-04-16","cited_by_count":0,"area":null},{"id":"2606.10284","title":"Revisiting Positive Samples in Graph Contrastive Learning: From the Perspective of Message Passing","created":"2026-06-09","cited_by_count":0,"area":null}],"next_cursor":null}