{"total":15,"rows":[{"id":"2202.07082","title":"Graph Neural Networks for Graphs with Heterophily: A Survey","created":"2022-02-14","cited_by_count":175,"area":null},{"id":"2302.12357","title":"Auto-HeG: Automated Graph Neural Network on Heterophilic Graphs","created":"2023-02-23","cited_by_count":23,"area":null},{"id":"2312.09708","title":"GraphRARE: Reinforcement Learning Enhanced Graph Neural Network with Relative Entropy","created":"2023-12-15","cited_by_count":9,"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":"2302.14806","title":"Framelet Message Passing","created":"2023-02-28","cited_by_count":3,"area":null},{"id":"2306.14340","title":"GPatcher: A Simple and Adaptive MLP Model for Alleviating Graph Heterophily","created":"2023-06-25","cited_by_count":3,"area":null},{"id":"2502.12412","title":"Incomplete Graph Learning: A Comprehensive Survey","created":"2025-02-18","cited_by_count":3,"area":null},{"id":"2510.10864","title":"HeroFilter: Adaptive Spectral Graph Filter for Varying Heterophilic Relations","created":"2025-10-13","cited_by_count":3,"area":null},{"id":"2505.18088","title":"Early-Exit Graph Neural Networks","created":"2025-05-23","cited_by_count":2,"area":null},{"id":"2304.04474","title":"Data Imputation from the Perspective of Graph Dirichlet Energy","created":"2023-04-10","cited_by_count":1,"area":null},{"id":"2310.01272","title":"A Unified View on Neural Message Passing with Opinion Dynamics for Social Networks","created":"2023-10-02","cited_by_count":1,"area":null},{"id":"2402.14802","title":"Link Prediction with Physics-Inspired Graph Neural Networks","created":"2024-02-22","cited_by_count":1,"area":null},{"id":"2201.01381","title":"Graph Decipher: A transparent dual-attention graph neural network to understand the message-passing mechanism for the node classification","created":"2022-01-04","cited_by_count":0,"area":null},{"id":"2605.06814","title":"Model-to-Data Distillation for Graph Neural Networks","created":"2026-05-07","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}],"next_cursor":null}