{"total":40,"rows":[{"id":"2502.14546","title":"Position: Graph Learning Will Lose Relevance Due To Poor Benchmarks","created":"2025-02-20","cited_by_count":53,"area":null},{"id":"2412.16441","title":"Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees","created":"2024-12-21","cited_by_count":32,"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":"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":"2412.00315","title":"One Model for One Graph: A New Perspective for Pretraining with Cross-domain Graphs","created":"2024-11-30","cited_by_count":12,"area":null},{"id":"2512.08798","title":"Can TabPFN Compete with GNNs for Node Classification via Graph Tabularization?","created":"2025-12-09","cited_by_count":10,"area":null},{"id":"2604.19028","title":"Learning Posterior Predictive Distributions for Node Classification from Synthetic Graph Priors","created":"2026-04-21","cited_by_count":10,"area":null},{"id":"2505.20089","title":"Homophily Enhanced Graph Domain Adaptation","created":"2025-05-26","cited_by_count":9,"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":"2504.10917","title":"Towards A Universal Graph Structural Encoder","created":"2025-04-15","cited_by_count":7,"area":null},{"id":"2512.21106","title":"Semantic Refinement with LLMs for Graph Representations","created":"2025-12-24","cited_by_count":6,"area":null},{"id":"2512.11561","title":"View Space: Learning Representation across Arbitrary Graphs","created":"2025-12-12","cited_by_count":5,"area":null},{"id":"2502.12608","title":"Unveiling Mode Connectivity in Graph Neural Networks","created":"2025-02-18","cited_by_count":3,"area":null},{"id":"2505.17599","title":"Dynamic Bundling with Large Language Models for Zero-Shot Inference on Text-Attributed Graphs","created":"2025-05-23","cited_by_count":3,"area":null},{"id":"2506.22510","title":"Towards Text-free Graph Foundation Models: Rethinking Multi-Domain Graph Contrastive Learning","created":"2025-06-26","cited_by_count":3,"area":null},{"id":"2508.17690","title":"Text Meets Topology: Rethinking Out-of-distribution Detection in Text-Rich Networks","created":"2025-08-25","cited_by_count":3,"area":null},{"id":"2602.07573","title":"Graph Domain Adaptation via Homophily-Agnostic Reconstructing Structure","created":"2026-02-07","cited_by_count":3,"area":null},{"id":"2603.13434","title":"Modality-free Graph In-context Alignment","created":"2026-03-13","cited_by_count":3,"area":null},{"id":"2504.21186","title":"GLIP-OOD: Zero-Shot Graph OOD Detection with Graph Foundation Model","created":"2025-04-29","cited_by_count":2,"area":null},{"id":"2505.19762","title":"Language Models as Messengers: Enhancing Message Passing in Heterophilic Graph Learning","created":"2025-05-26","cited_by_count":2,"area":null},{"id":"2508.06588","title":"Graph is a Natural Regularization: Revisiting Vector Quantization for Graph Representation Learning","created":"2025-08-08","cited_by_count":2,"area":null},{"id":"2607.17272","title":"Node4All: Learning Node Representation Beyond Datasets","created":"2026-07-19","cited_by_count":2,"area":null},{"id":"2410.16882","title":"SaVe-TAG: LLM-based Interpolation for Long-Tailed Text-Attributed Graphs","created":"2024-10-22","cited_by_count":1,"area":null},{"id":"2505.12027","title":"Relation-Aware Graph Foundation Model","created":"2025-05-17","cited_by_count":1,"area":null},{"id":"2511.11912","title":"A Systematic Study of Model Extraction Attacks on Graph Foundation Models","created":"2025-11-14","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":"2606.22429","title":"Enhancing LLMs for Graph Tasks via Graph-aware LoRA Generation","created":"2026-06-21","cited_by_count":1,"area":null},{"id":"2606.22462","title":"Adaptive Recurrent Message Passing for Test Time Computing on Graphs","created":"2026-06-21","cited_by_count":1,"area":null},{"id":"2506.08298","title":"H$^2$GFM: Towards unifying Homogeneity and Heterogeneity on Text-Attributed Graphs","created":"2025-06-10","cited_by_count":0,"area":null},{"id":"2509.06975","title":"GSTBench: A Benchmark Study on the Transferability of Graph Self-Supervised Learning","created":"2025-08-28","cited_by_count":0,"area":null},{"id":"2510.08774","title":"Struc-EMB: The Potential of Structure-Aware Encoding in Language Embeddings","created":"2025-10-09","cited_by_count":0,"area":null},{"id":"2605.06576","title":"On the Safety of Graph Representation Learning","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.18579","title":"S2Aligner: Pair-Efficient and Transferable Pre-Training for Sparse Text-Attributed Graphs","created":"2026-05-18","cited_by_count":0,"area":null},{"id":"2606.11898","title":"GraspLLM: Towards Zero-Shot Generalization on Text-Attributed Graphs with LLMs","created":"2026-06-10","cited_by_count":0,"area":null},{"id":"2606.17579","title":"LLM Features Can Hurt GNNs: Concatenation Interference on Homophilous Graph Benchmarks","created":"2026-06-16","cited_by_count":0,"area":null},{"id":"2607.19108","title":"OpenRTAG: A Comprehensive Benchmark for Robust Text-Attributed Graph Learning under Data Quality Degradation","created":"2026-07-21","cited_by_count":0,"area":null},{"id":"2607.20477","title":"Semi-Supervised Text-Attributed Graph Distillation","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2609.08709","title":"Chimaera: A Mixture-of-Graph-Experts Architecture for Cross-Task and Cross-Dataset Graph Learning","created":"2026-09-08","cited_by_count":0,"area":null},{"id":"2609.23547","title":"Preserving Geometric Integrity in Graph Prompting via Measure-Constrained Optimal Transport","created":"2026-09-20","cited_by_count":0,"area":null},{"id":"2609.32365","title":"Graph Memory: Spectral Associative Memory via Dirichlet Energy","created":"2026-09-26","cited_by_count":0,"area":null}],"next_cursor":null}