{"total":25,"rows":[{"id":"2306.05955","title":"Path Neural Networks: Expressive and Accurate Graph Neural Networks","created":"2023-06-09","cited_by_count":32,"area":null},{"id":"2501.18739","title":"Beyond Message Passing: Neural Graph Pattern Machine","created":"2025-01-30","cited_by_count":17,"area":null},{"id":"2505.16130","title":"Generative Graph Pattern Machine","created":"2025-05-22","cited_by_count":11,"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":"2306.13532","title":"PathMLP: Smooth Path Towards High-order Homophily","created":"2023-06-23","cited_by_count":8,"area":null},{"id":"2304.14274","title":"When Do Graph Neural Networks Help with Node Classification? Investigating the Impact of Homophily Principle on Node Distinguishability","created":"2023-04-25","cited_by_count":7,"area":null},{"id":"2505.00552","title":"Graph Spectral Filtering with Chebyshev Interpolation for Recommendation","created":"2025-05-01","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":"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":"2305.15098","title":"Referral Augmentation for Zero-Shot Information Retrieval","created":"2023-05-24","cited_by_count":3,"area":null},{"id":"2410.10320","title":"DiRW: Path-Aware Digraph Learning for Heterophily","created":"2024-10-14","cited_by_count":3,"area":null},{"id":"2402.04033","title":"On provable privacy vulnerabilities of graph representations","created":"2024-02-06","cited_by_count":1,"area":null},{"id":"2410.01802","title":"PROXI: Challenging the GNNs for Link Prediction","created":"2024-10-02","cited_by_count":1,"area":null},{"id":"2510.16311","title":"Toward General Digraph Contrastive Learning: A Dual Spatial Perspective","created":"2025-10-18","cited_by_count":1,"area":null},{"id":"2602.07256","title":"Graph homophily booster: Reimagining the role of discrete features in heterophilic graph learning","created":"2026-02-06","cited_by_count":1,"area":null},{"id":"2603.05375","title":"Robust Node Affinities via Jaccard-Biased Random Walks and Rank Aggregation","created":"2026-03-05","cited_by_count":1,"area":null},{"id":"2211.00550","title":"GLINKX: A Scalable Unified Framework For Homophilous and Heterophilous Graphs","created":"2022-11-01","cited_by_count":0,"area":null},{"id":"2404.03434","title":"Learning From Simplicial Data Based on Random Walks and 1D Convolutions","created":"2024-04-04","cited_by_count":0,"area":null},{"id":"2404.10353","title":"Rethinking the Graph Polynomial Filter via Positive and Negative Coupling Analysis","created":"2024-04-16","cited_by_count":0,"area":null},{"id":"2408.06665","title":"RW-NSGCN: A Robust Approach to Structural Attacks via Negative Sampling","created":"2024-08-13","cited_by_count":0,"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.21288","title":"Are Graph Attention Networks Able to Model Structural Information?","created":"2025-05-27","cited_by_count":0,"area":null},{"id":"2507.20127","title":"Aggregation-aware MLP: An Unsupervised Approach for Graph Message-passing","created":"2025-07-27","cited_by_count":0,"area":null},{"id":"2510.03096","title":"Adaptive Node Feature Selection For Graph Neural Networks","created":"2025-10-03","cited_by_count":0,"area":null},{"id":"2602.07903","title":"GCN-MPPR: Enhancing the Propagation of Message Passing Neural Networks via Motif-Based Personalized PageRank","created":"2026-02-08","cited_by_count":0,"area":null}],"next_cursor":null}