Decoupled Feature Propagation and Structural Boosting: A Robust Framework for Node Classification on Heterophilous Graphs

Counts differ because each database indexes a different set of publications. We treat OpenAlex as the canonical count; Google Scholar is not shown (no API, and crawling it violates its ToS).

Standard Graph Neural Networks (GNNs) frequently struggle with heterophilous structures where local proximity does not imply label similarity, leading to significant performance degradation due to signal oversmoothing. This study aimed to bridge the gap between theoretical complexity and empirical reliability by proposing a rigorously deterministic framework that evaluates decoupled feature diffusion and structural boosting strategies. Using five standardized heterophilous benchmarks, including Roman-Empire and Minesweeper, Multi-hop Propagated Features and Gradient Boosting architectures were validated under a strict anti-leakage protocol. Empirical results demonstrate a fundamental dichotomy in learning dynamics: the Multi-hop model achieves a Macro-F1 of 70.07% on Roman-Empire, drastically outperforming the graph-only baseline of 4.45%, whereas structural boosting dominates on attribute-heavy datasets like Questions with 60.94% Macro-F1. Furthermore, ablation studies reveal that removing multi-hop propagation induces a massive 35% performance drop on synthetic structures, confirming the critical necessity of capturing long-range dependencies in specific topologies. These findings challenge the prevailing reliance on complex deep architectures, advocating instead for an adaptive methodological taxonomy where model selection is directly anchored to the specific spectral and structural characteristics of the graph data.