{"total":85,"rows":[{"id":"2406.18380","title":"KAGNNs: Kolmogorov-Arnold Networks meet Graph Learning","created":"2024-06-26","cited_by_count":49,"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":"2407.09618","title":"The Heterophilic Graph Learning Handbook: Benchmarks, Models, Theoretical Analysis, Applications and Challenges","created":"2024-07-12","cited_by_count":29,"area":null},{"id":"2502.09263","title":"Can Classic GNNs Be Strong Baselines for Graph-level Tasks? Simple Architectures Meet Excellence","created":"2025-02-13","cited_by_count":26,"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":"2509.21489","title":"GraphPFN: A Prior-Data Fitted Graph Foundation Model","created":"2025-09-25","cited_by_count":21,"area":null},{"id":"2503.09008","title":"Towards Quantifying Long-Range Interactions in Graph Machine Learning: a Large Graph Dataset and a Measurement","created":"2025-03-12","cited_by_count":20,"area":null},{"id":"2410.13798","title":"Learning Graph Quantized Tokenizers","created":"2024-10-17","cited_by_count":19,"area":null},{"id":"2502.18771","title":"Exploring Graph Learning Tasks with Pure LLMs: A Comprehensive Benchmark and Investigation","created":"2025-02-26","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":"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":"2501.02728","title":"OpenGU: A Comprehensive Benchmark for Graph Unlearning","created":"2025-01-06","cited_by_count":8,"area":"safety"},{"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":"2406.09675","title":"A Comprehensive Benchmark on Spectral GNNs: The Impact on Efficiency, Memory, and Effectiveness","created":"2024-06-14","cited_by_count":6,"area":null},{"id":"2502.17614","title":"Scalable Graph Condensation with Evolving Capabilities","created":"2025-02-24","cited_by_count":6,"area":null},{"id":"2511.08185","title":"Improving Long-Range Interactions in Graph Neural Simulators via Hamiltonian Dynamics","created":"2025-11-11","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":"2409.05755","title":"Revealing the Pitfalls and Re-Evaluating the Advancement of Heterophilic Graph Learning","created":"2024-09-09","cited_by_count":4,"area":null},{"id":"2411.03845","title":"Reconsidering the Performance of GAE in Link Prediction","created":"2024-11-06","cited_by_count":4,"area":null},{"id":"2502.16503","title":"FanChuan: A Multilingual and Graph-Structured Benchmark For Parody Detection and Analysis","created":"2025-02-23","cited_by_count":4,"area":null},{"id":"2601.19449","title":"Fixed Aggregation Features Can Rival GNNs","created":"2026-01-27","cited_by_count":4,"area":null},{"id":"2602.08519","title":"Bridging Academia and Industry: A Comprehensive Benchmark for Attributed Graph Clustering","created":"2026-02-09","cited_by_count":4,"area":null},{"id":"2603.16849","title":"GIST: Gauge-Invariant Spectral Transformers for Scalable Graph Neural Operators","created":"2026-03-17","cited_by_count":4,"area":null},{"id":"2605.27905","title":"AI Research Agents Narrow Scientific Exploration","created":"2026-05-27","cited_by_count":4,"area":"agents"},{"id":"2606.24509","title":"A Fair Evaluation of Graph Foundation Models for Node Property Prediction","created":"2026-06-23","cited_by_count":4,"area":null},{"id":"2505.20840","title":"Aggregation Buffer: Revisiting DropEdge with a New Parameter Block","created":"2025-05-27","cited_by_count":3,"area":null},{"id":"2506.04653","title":"The Oversmoothing Fallacy: A Misguided Narrative in GNN Research","created":"2025-06-05","cited_by_count":3,"area":null},{"id":"2412.09805","title":"Making Classic GNNs Strong Baselines Across Varying Homophily: A Smoothness-Generalization Perspective","created":"2024-12-13","cited_by_count":2,"area":null},{"id":"2505.15867","title":"SCENIR: Visual Semantic Clarity through Unsupervised Scene Graph Retrieval","created":"2025-05-21","cited_by_count":2,"area":null},{"id":"2505.18088","title":"Early-Exit Graph Neural Networks","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2505.20742","title":"'Hello, World!': Making GNNs Talk with LLMs","created":"2025-05-27","cited_by_count":2,"area":null},{"id":"2508.20583","title":"A Graph Talks, But Who's Listening? Rethinking Evaluations for Graph-Language Models","created":"2025-08-28","cited_by_count":2,"area":"lr"},{"id":"2510.10631","title":"GraphTARIF: Linear Graph Transformer with Augmented Rank and Improved Focus","created":"2025-10-12","cited_by_count":2,"area":null},{"id":"2510.18825","title":"Unifying and Enhancing Graph Transformers via a Hierarchical Mask Framework","created":"2025-10-21","cited_by_count":2,"area":"moe"},{"id":"2602.22552","title":"Relatron: Automating Relational Machine Learning over Relational Databases","created":"2026-02-26","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":"2409.06998","title":"Mixture of Scope Experts at Test: Generalizing Deeper Graph Neural Networks with Shallow Variants","created":"2024-09-11","cited_by_count":1,"area":null},{"id":"2410.05697","title":"Diffusing to the Top: Boost Graph Neural Networks with Minimal Hyperparameter Tuning","created":"2024-10-08","cited_by_count":1,"area":null},{"id":"2410.15001","title":"FIT-GNN: Faster Inference Time for GNNs that 'FIT' in Memory Using Coarsening","created":"2024-10-19","cited_by_count":1,"area":null},{"id":"2411.19392","title":"Scale-aware Message Passing For Graph Node Classification","created":"2024-11-28","cited_by_count":1,"area":null},{"id":"2505.02020","title":"Wide & Deep Learning for Node Classification","created":"2025-05-04","cited_by_count":1,"area":null},{"id":"2506.10347","title":"LightKG: Efficient Knowledge-Aware Recommendations with Simplified GNN Architecture","created":"2025-06-12","cited_by_count":1,"area":null},{"id":"2507.06538","title":"Few-shot Learning on AMS Circuits and Its Application to Parasitic Capacitance Prediction","created":"2025-07-09","cited_by_count":1,"area":null},{"id":"2601.17469","title":"Identifying and Correcting Label Noise for Robust GNNs via Influence Contradiction","created":"2026-01-24","cited_by_count":1,"area":null},{"id":"2603.19091","title":"Position: Spectral GNNs Are Neither Spectral Nor Superior for Node Classification","created":"2026-03-19","cited_by_count":1,"area":null},{"id":"2604.07492","title":"Cluster Attention for Graph Machine Learning","created":"2026-04-08","cited_by_count":1,"area":null},{"id":"2605.22480","title":"Implicit Regularization of Mini-Batch Training in Graph Neural Networks","created":"2026-05-21","cited_by_count":1,"area":null},{"id":"2606.24958","title":"Swarm-Inspired Generation of Collective Behaviors in Graph Dynamical Systems","created":"2026-06-23","cited_by_count":1,"area":null},{"id":"2410.02158","title":"SCNode: Spatial and Contextual Coordinates for Graph Representation Learning","created":"2024-10-03","cited_by_count":0,"area":null},{"id":"2505.17939","title":"Directed Semi-Simplicial Learning with Applications to Brain Activity Decoding","created":"2025-05-23","cited_by_count":0,"area":null},{"id":"2506.01404","title":"Quantitative Error Feedback for Quantization Noise Reduction of Filtering over Graphs","created":"2025-06-02","cited_by_count":0,"area":null},{"id":"2508.17531","title":"Gumbel-MPNN: Graph Rewiring with Gumbel-Softmax","created":"2025-08-24","cited_by_count":0,"area":null},{"id":"2509.10874","title":"On the Impact of Downstream Tasks on Sampling and Reconstructing Noisy Graph Signals","created":"2025-09-13","cited_by_count":0,"area":null},{"id":"2509.11675","title":"SpaPool: Soft Partition Assignment Pooling for__Graph Neural Networks","created":"2025-09-15","cited_by_count":0,"area":null},{"id":"2510.05750","title":"Are Heterogeneous Graph Neural Networks Truly Effective for Node Classification? A Causal Perspective","created":"2025-10-07","cited_by_count":0,"area":null},{"id":"2510.12233","title":"Unveiling the Vulnerability of Graph-LLMs: An Interpretable Multi-Dimensional Adversarial Attack on TAGs","created":"2025-10-14","cited_by_count":0,"area":null},{"id":"2511.12423","title":"GRAPHTEXTACK: A Realistic Black-Box Node Injection Attack on LLM-Enhanced GNNs","created":"2025-11-16","cited_by_count":0,"area":null},{"id":"2511.13062","title":"Self-Adaptive Graph Mixture of Models","created":"2025-11-17","cited_by_count":0,"area":null},{"id":"2512.08218","title":"PR-CapsNet: Pseudo-Riemannian Capsule Network with Adaptive Curvature Routing for Graph Learning","created":"2025-12-09","cited_by_count":0,"area":null},{"id":"2512.08475","title":"Solving Oversmoothing in GNNs via Nonlocal Message Passing: Algebraic Smoothing and Depth Scalability","created":"2025-12-09","cited_by_count":0,"area":null},{"id":"2603.05004","title":"Poisoning the Inner Prediction Logic of Graph Neural Networks for Clean-Label Backdoor Attacks","created":"2026-03-05","cited_by_count":0,"area":null},{"id":"2603.08825","title":"Local Message-Passing for Discrete Graph Generation","created":"2026-03-09","cited_by_count":0,"area":null},{"id":"2604.02651","title":"Communication-free Sampling and 4D Hybrid Parallelism for Scalable Mini-batch GNN Training","created":"2026-04-03","cited_by_count":0,"area":null},{"id":"2604.20736","title":"F\\textsuperscript{2}LP-AP: Fast \\& Flexible Label Propagation with Adaptive Propagation Kernel","created":"2026-04-22","cited_by_count":0,"area":null},{"id":"2605.01403","title":"Rethinking Multi-Label Node Classification: Do Tuned Classic GNNs Suffice?","created":"2026-05-02","cited_by_count":0,"area":null},{"id":"2605.20248","title":"Graph Transductive Sharpening: Leveraging Unlabeled Predictions in Node Classification","created":"2026-05-18","cited_by_count":0,"area":null},{"id":"2605.25662","title":"Closed-Form Node Classification with Exact Graph Unlearning","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2606.00757","title":"RADE: Random Add-Drop Edge as a Regularizer","created":"2026-05-30","cited_by_count":0,"area":null},{"id":"2606.03068","title":"Learn When and Where to Connect: Adaptive Virtual Nodes for Dynamic Message Passing on Graphs","created":"2026-06-02","cited_by_count":0,"area":null},{"id":"2606.03290","title":"Message Tuning Outshines Graph Prompt Tuning: A Prismatic Space Perspective","created":"2026-06-02","cited_by_count":0,"area":null},{"id":"2606.10249","title":"When Design Rules Break: Benchmark Composition Determines Whether Label Informativeness Predicts GNN Aggregator Choice","created":"2026-06-08","cited_by_count":0,"area":null},{"id":"2606.20283","title":"Boundary Embedding Shaping with Adaptive Contrastive Learning for Graph Structural Disentanglement","created":"2026-06-18","cited_by_count":0,"area":null},{"id":"2607.01553","title":"X-LogSMask: Expand Transformer for Graph-Structured Data","created":"2026-07-02","cited_by_count":0,"area":null},{"id":"2607.23225","title":"ParasGB: A Graph Benchmark Suite for Parasitic Estimation on AMS Circuits","created":"2026-07-25","cited_by_count":0,"area":null},{"id":"2607.26404","title":"How Much Does Message Passing Matter? A Drop-In Study of GNN Layers for Neural Network Graph Regression","created":"2026-07-29","cited_by_count":0,"area":null},{"id":"2608.02128","title":"CoRe-GNN: Multilevel Message passing on Coarsened graphs","created":"2026-08-03","cited_by_count":0,"area":null},{"id":"2608.09899","title":"Fairness in Link Prediction Beyond Demographic Parity: A Reproducibility Study","created":"2026-08-10","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.19210","title":"Not All Nodes Are Created Equal: Homophily-Aware Stratification for Stable GNN Evaluation","created":"2026-09-16","cited_by_count":0,"area":null},{"id":"2609.26310","title":"PreGS: A Parameter-Transfer-Based Multi-Expert Graph Neural Network for Node Classification","created":"2026-09-22","cited_by_count":0,"area":null},{"id":"2609.31466","title":"Scaffold: Support Graph Theory Based Sparsification for Graph Neural Networks","created":"2026-09-25","cited_by_count":0,"area":null},{"id":"2609.37057","title":"Message Passing Does More with Less for In-Context Learning on Graphs","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2609.39673","title":"NodeGround: A Node Classification Benchmark in the Graph Foundation Model Era","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.03556","title":"Get a GRIP, this will be a long TRIP: A Quantifiable Long-Range Framework for Verifying Over-squashing","created":"2026-10-02","cited_by_count":0,"area":null},{"id":"2610.05874","title":"Global Communication or Graph-Specific Memory?","created":"2026-10-05","cited_by_count":0,"area":null}],"next_cursor":null}