PathMoG: A Pathway-Centric Modular Graph Neural Network for Multi-Omics Survival Prediction Di Wang,1 Chupei Tang,2 Junxiao Kong,3 Jixiu Zhai,4 Moyu Tang5 and Tianchi Lu6,∗ 1
arXiv:2604.24371v1 [cs.LG] 27 Apr 2026
Cuiying Honors College, Lanzhou University, China, 2 School of Mathematics and Statistics, Lanzhou University, China, 3 School of Mathematics and Statistics, Lanzhou University, China, 4 School of Mathematics and Statistics, Lanzhou University, China and Shanghai Innovation Institute, 5 School of Mathematics and Statistics, Lanzhou University, China and 6 Department of Computer Science, City University of Hong Kong, China ∗
Corresponding author. Email: [email protected]
Abstract Motivation: Cancer survival prediction from multi-omics data remains challenging because prognostic signals are high dimensional, heterogeneous, and distributed across interacting genes and pathways. Existing survival models either ignore biological structure, rely on genome-scale monolithic graphs, or fuse expression, mutation, and copy number variation (CNV) too coarsely for the low-sample, high-dimensional setting. Results: In this article, we propose PathMoG (Pathway-centric Modular Omics Graph), a biologically structured multi-omics graph neural network for cancer survival prediction. PathMoG first reorganizes genome-scale inputs into 354 KEGG-informed pathway modules, introducing functional priors that constrain representation learning in the high-dimensional, low-sample regime. We then use a Hierarchical Omics Modulation (HOM) module to condition gene-expression representations on mutation, CNV, pathway, and clinical context, enabling semantically aligned cross-omics integration rather than coarse feature concatenation. A dual-level attention mechanism further captures both intra-pathway driver signals and inter-pathway clinical relevance to generate patient-level Cox risk estimates with multi-level interpretability. We comprehensively evaluated PathMoG on 5,650 patients across 10 TCGA cancer types, and the results demonstrate clear superiority over representative survival baselines, while the framework provided interpretable gene-level, pathway-level, and patient-level readouts for biologically grounded and clinically actionable risk stratification. Availability and implementation: TCGA data were accessed through UCSC Xena and external validation used METABRIC. Source code is available at https://github.com/wangzoyou/pathmog. Key words: Multi-omics integration; Graph Neural Networks; Survival Analysis; Cancer Genomics; Interpretability; Modular Design
1. Introduction
designed to directly capture the high-order cross-gene interactions and cross-omics dependencies that dominate modern cancer data. Deep survival and multimodal fusion models emerged to address this representational bottleneck. CAMR introduced crossaligned multimodal representation learning to improve crossomics consistency in prognosis prediction (11); HFBSurv used hierarchical fusion with factorized bilinear interactions to model cross-modal feature coupling (15); and PCLSurv incorporated prototypical contrastive learning to strengthen class-aware multiomics representations for survival modeling (17). However, many of these methods still rely on coarse fusion, where omics views are treated as parallel feature blocks and merged by concatenation or weakly constrained attention, which can blur biological directionality between upstream genomic alterations and downstream transcriptional readouts. Graph-based prognosis models were introduced as a secondstage correction to this limitation by injecting prior biological structure. Representative studies follow a clear progression:
Cancer prognosis is intrinsically a multi-factor problem, because clinically similar patients can follow markedly different trajectories driven by distinct molecular programs (22; 23). In modern cohorts, prognostic signals are rarely confined to one modality and instead span expression, mutation, and copy-number variation (CNV), making multi-omics integration essential for risk modeling (8). At the same time, cancer datasets typically operate under a high-dimensional low-sample regime (p ≫ n), where robust generalization is difficult. Methodologically, survival modeling still builds on three classical families: non-parametric, parametric, and semi-parametric formulations (2). Cox proportional hazards and its extensions remain central in biomedical applications (3), and random survival forest provides a strong nonlinear baseline (9). These approaches are statistically grounded and interpretable, but they are not
1
2 GraphSurv combined GCN encoding with a Cox survival objective for multi-omics prognosis (26); PathGNN introduced pathwayoriented interpretable graph modeling for risk stratification and pathway analysis (18); FGCNSurv jointly learned omics feature representations and feature-relation structure for pancancer survival prediction (27); and prior knowledge-guided multilevel GNNs further strengthened biologically constrained prognosis modeling (28). In adjacent but highly relevant graphcentric settings, DeepKEGG used biologically informed graph modeling to capture cell heterogeneity from single-cell and spatial transcriptomics data, while PathHDNN used pathway-hierarchical deep architecture for immunotherapy response prediction and mechanism interpretation (14; 16). In adjacent tasks such as multi-omics cancer subtyping, graph contrastive learning has also reinforced the value of structure-aware representations (29). Yet many graph pipelines remain monolithic at genome scale, and this “one-big-graph” strategy often introduces three practical issues in p ≫ n cohorts: noise propagation through task-irrelevant longrange edges, explanatory dilution of patient-specific drivers, and excessive hypothesis complexity that increases overfitting risk. Taken together, the field has progressed from black-box fusion toward biologically informed graphs, but a key tension remains: prior biology is necessary, while unconstrained global graphs are often too blunt for stable survival learning. This tension defines two gaps addressed in this work: a graph structure gap (how to encode biology as a useful constraint rather than a massive graph prior) and an omics semantics gap (how to preserve directional relations across omics layers rather than treating them as symmetric channels). To resolve these gaps, we propose PathMoG, a pathway-centric modular graph neural network for multi-omics survival prediction. Instead of a monolithic graph, PathMoG decomposes the interactome into 354 KEGG-informed predefined pathway modules; applies a Hierarchical Omics Modulation (HOM) mechanism to condition expression on mutation, CNV, pathway, and clinical context via FiLM-style modulation; and aggregates evidence through dual-level attention for patient-level Cox risk estimation with interpretable outputs. We evaluate PathMoG across 10 TCGA cancer types and further examine transferability on METABRIC, clinical relevance in BRCA, and mechanistic validity through ablation and interpretability analyses. The end-to-end workflow is shown in Figure 1.
2. Materials and methods 2.1. Datasets We evaluated PathMoG on a harmonized pan-cancer cohort of 5,650 patients from 10 TCGA cancer types, where each patient was represented by gene expression, somatic mutation, CNV, and survival outcome information. These cohorts span diverse tissue origins, event rates, and sample sizes, making them suitable for assessing generalizability across heterogeneous disease settings. We additionally reserved the METABRIC breast cancer cohort as an external transfer cohort for independent testing without model finetuning. Cohort-wise sample sizes and event rates are summarized in Table 1. Expression profiles were log-transformed and standardized, somatic mutation calls were binarized at the gene level, and GISTIC CNV calls were encoded on a five-level scale from −2 to +2 (6; 20). Let I denote the patient set used for modeling. In
PathMoG: A Pathway-Centric Modular GNN Table 1. Dataset characteristics for 10 TCGA cancer types. The cohort covers diverse tissue origins and survival event rates, providing a rigorous testbed for generalizability. All cancer types use 7,595 genes from 354 KEGG pathways, and the total event rate is reported as a sample-size-weighted average across cohorts. Cancer Type
Samples
Event Rate (%)
BRCA (Breast Invasive Carcinoma) COAD (Colon Adenocarcinoma) GBM (Glioblastoma Multiforme) KIRC (Kidney Renal Clear Cell) LGG (Lower Grade Glioma) LIHC (Liver Hepatocellular) LUAD (Lung Adenocarcinoma) UCEC (Uterine Corpus Endometrial) HNSC (Head & Neck Squamous) OV (Ovarian Serous Cystadenocarcinoma)
1,082 430 580 534 511 371 506 541 525 570
14.0 22.2 80.6 33.1 24.5 35.6 36.1 16.5 35.1 59.7
Total
5,650
34.4
the implementation, I is defined by the intersection of patients with both clinical and survival annotations, after which all omics matrices are reindexed to a common patient order. Likewise, let U = {g1 , . . . , gM } denote the aligned gene universe, where M = 7,595 genes are induced by the curated gene–pathway mapping used throughout the study. Expression, CNV, and mutation matrices are reindexed to this common gene order before pathwaylevel graph instantiation. Missing modality-specific entries are preserved during alignment and converted to zero only at the final tensor-materialization stage, which avoids mixing patient alignment with imputation. Clinical covariates were compressed into a numerically stable feature vector containing age, sex, and aggregated stage variables, with cancer-specific markers retained when clinically standard information was available, such as receptor status and PAM50 subtype in BRCA. All preprocessing parameters were estimated within training folds to avoid information leakage. Detailed preprocessing, cohort descriptors, and leakage-prevention rules are provided in Supplementary Sections S1, S3, and S4.
2.2. Overview of PathMoG PathMoG follows a pathway-first pipeline. Multi-omics inputs are first mapped onto KEGG pathway graphs, then gene expression is modulated by genomic and clinical context through HOM, pathway-specific node embeddings are updated with heterogeneous graph message passing, pathway vectors are aggregated through gene-to-pathway and pathway-to-patient attention, and the final patient representation is fused with clinical covariates for Cox-based survival prediction. A key implementation feature is that the model does not operate on a single fixed graph tensor. Instead, it uses a nested representation in which pathway topologies are precomputed once and each patient is instantiated as a variable-length collection of pathway graphs plus one clinical vector. This hierarchical data structure is central to both the computational tractability and the biological interpretability of the framework.
2.3. Pathway-centric modular graph construction The central design choice in PathMoG is to replace a single global gene graph with pathway modules. This modular design introduces an explicit biological prior, constrains the search space, and reduces spurious interactions in the p ≫ n regime, rather than asking the model to infer all genome-wide dependencies from limited patient samples (5; 13; 12). In this sense, pathway modularity acts as an
3
PathMoG: A Pathway-Centric Modular GNN
Fig. 1: Workflow overview of PathMoG. The framework combines pathway-centric graph construction, HOM-based omics modulation, heterogeneous message passing within each pathway module, dual-level attention, and Cox-based survival prediction with clinical fusion. inductive bias for survival modeling rather than as a visualization convenience. Formally, let P = {1, . . . , K} denote the pathway catalogue with K = 354 modules. The implementation first constructs a patient-invariant library of local pathway topologies. For pathway k ∈ P, the static graph is (r) Gktopo = Vk , {Ek }r∈Rk , where Vk ⊆ U is the set of genes belonging to pathway k after intersection with the global aligned gene universe, and (r)
Ek
2.4. Hierarchical Omics Modulation (HOM) Rather than treating multi-omics inputs as interchangeable channels, we model gene expression as the target signal modulated by genomic and clinical context. This reflects the biological intuition that mutation and CNV states act as regulatory conditions that shape the functional meaning of transcript abundance, while pathway identity and patient context provide higher-order information about the state in which a gene is being interpreted. In the implemented model, HOM conditions each gene on three nested contexts. For gene u ∈ Vk in patient i, define the local genomic context
= {(u, v) : u, v ∈ Vk , rel(u, v) = r}
collects all directed edges of relation type r whose two endpoints both remain inside the pathway. Relation labels are normalized from the curated pathway interaction file and stored explicitly as typed edges in HeteroData. Pathways retaining fewer than two mapped genes after alignment are not instantiated. This static precomputation step fixes a pathway-local node ordering and avoids rebuilding the same biological topology for every patient. For patient i ∈ I and pathway k, omics measurements are then injected into the precomputed topology through a pathway-local feature matrix Xk,i ∈ R|Vk |×3 ,
cnv mut Xk,i (u, :) = [xexpr u,i , xu,i , xu,i ],
where the column order follows the implementation exactly: expression, CNV, then mutation. If all three modalities are absent for every gene in pathway k for patient i, that pathway is omitted from the patient’s package; otherwise missing entries are mapped to 0 only when the tensor is materialized. The resulting patient-level input is therefore not a monolithic graph but a hierarchical object Di = {Gk,i }k∈Ki , ci ,
mut 2 mu,k,i = [xcnv u,i , xu,i ] ∈ R ,
the encoded patient context zi = fclin (ci ), and the pathway context m̄k,i =
1 X mu,k,i , |Vk | u∈V
where ek is a learnable embedding representing pathway identity. HOM then forms the context vector ctxu,k,i = [mu,k,i ; pk,i ; zi ] and feeds it to a modulation network. Following a FiLM-style parameterization (21), the network predicts raw coefficients (γ̂u,k,i , β̂u,k,i ), which are range-controlled in the implementation as γu,k,i = 1 + 0.5 tanh(γ̂u,k,i ),
where Ki ⊆ P is the set of pathway graphs instantiated for patient i, Gk,i carries the typed pathway edges together with node features Xk,i , and ci is the processed clinical feature vector. Supplementary Section S4 provides the full graph-construction rules, patient-package definition, and code-level batching details.
pk,i = fpath ([ek ; m̄k,i ]),
k
βu,k,i = 2 tanh(β̂u,k,i ),
so that the modulated expression remains numerically stable while still being patient- and pathway-specific. The actual modulation is expr x̃expr u,k,i = γu,k,i xu,i + βu,k,i .
4
PathMoG: A Pathway-Centric Modular GNN
The initial node representation passed to the graph encoder is then the fused vector (0)
expr cnv mut hu,k,i = [x̃expr u,k,i , xu,i , xu,i , xu,i , γu,k,i , βu,k,i , ek , m̄k,i ],
which has dimension 16 in the current implementation. Hence, HOM does not merely rescale one channel; it creates an explicit, inspectable representation in which modulation coefficients, pathway identity, and pathway state all remain accessible to downstream analysis. Full mathematical details are provided in Supplementary Section S4.2.
to pathways and then to genes without padding every patient to a fixed number of pathways, which is essential because different patients instantiate different subsets of pathway modules after modality-aware filtering.
2.6. Survival objective and evaluation protocol Model parameters were optimized with Cox partial likelihood and L2 regularization, L(θ) = −
h(ℓ+1) = σ v
θi − log
i:Ei =1
2.5. Heterogeneous graph learning and dual-level attention Within each pathway module, PathMoG applies Heterogeneous Graph Transformer (HGT) layers to account for typed regulatory edges such as activation, inhibition, and phosphorylation (7). Each instantiated pathway graph contains one node type (gene) and multiple relation types inherited from the pathway interaction (ℓ) file. If hv denotes the embedding of gene v at layer ℓ, then the relation-aware update can be written abstractly as
X
X
θj
e
+ λ∥W∥22 ,
j∈R(ti )
where θi is the predicted risk score for patient i, Ei is the event indicator, and R(ti ) is the risk set at time ti (2). We used stratified 5-fold cross-validation within each TCGA cohort. The concordance index (C-index) served as the primary metric, with time-dependent AUC used as a secondary metric. Detailed implementation, evaluation metrics, and reproducibility settings are provided in Supplementary Sections S2–S4.
X
X
, α(ℓ,r) Wr(ℓ) h(ℓ) uv u
3. Results
r∈Rk u∈N (r) (v)
where N (r) (v) denotes the neighbors of v connected by relation (ℓ,r) type r, and the attention coefficients αuv depend jointly on source state, target state, and relation type. In the current implementation, two HGT layers are used inside each pathway module. After message passing, node embeddings are summarized through two attention stages. For pathway k in patient i, gene-to-pathway attention computes (L)
au,k,i = wg⊤ tanh(Wg hu,k,i ), αu,k,i = P
exp(au,k,i ) v∈Vk exp(av,k,i )
,
and forms the pathway vector gk,i =
X
(L)
αu,k,i hu,k,i .
u∈Vk
Pathway-to-patient attention then aggregates the variable-length pathway set {gk,i }k∈Ki by ⊤ bk,i = wp tanh(Wp gk,i ),
πk,i = P Hi =
exp(bk,i ) ℓ∈Ki exp(bℓ,i )
X
,
πk,i gk,i .
k∈Ki
This representation is fused with encoded clinical features and passed to a multilayer perceptron to produce the final survival risk score. The corresponding batching strategy is also hierarchical. A custom collate function concatenates all pathway graphs from all patients in a minibatch into a single PyG batch, while retaining three mappings: the gene-to-pathway batch index generated automatically by PyG, an explicit pathway-to-patient map, and the global pathway index vector used to retrieve pathway embeddings. These mappings allow patient-level clinical context to be broadcast
3.1. Benchmark performance We benchmarked PathMoG against eight representative methods under the same stratified 5-fold protocol: Cox-PH, RSF, GraphSurv (Wang et al., BIBM 2021), CAMR, PathGNN (Liang et al., BMC Bioinformatics 2022), HFBSurv, FGCNSurv, and PCLSurv. This comparison spans classical survival analysis, deep survival learning, multi-omics integration, and graph-based survival modeling, providing a broad view of how PathMoG behaves relative to established baselines. All methods were trained under a consistent evaluation protocol (Supplementary Sections S2–S4). Under this controlled benchmark, PathMoG delivered the best overall discrimination performance across TCGA cohorts (Table 2), ranking first in C-index in all 10 cancer types and showing especially strong gains in GBM, UCEC, BRCA, and COAD. These results provide direct evidence that pathway-constrained modular learning is more effective than unconstrained global interaction modeling when prognostic signals are noisy, heterogeneous, and distributed across biological programs. The superiority of PathMoG also transferred to external testing: a model trained on TCGA BRCA maintained significant risk separation in METABRIC without fine-tuning, indicating that the learned representations generalize beyond a single cohort distribution. Across TCGA cohorts, the PathMoG score likewise achieved significant high-versus-low risk stratification in Kaplan– Meier analysis (all log-rank p < 0.05), supporting clinical utility beyond point-estimate ranking metrics. Full external-validation results and cohort-wise Kaplan–Meier curves are provided in Supplementary Sections S5 and S6, respectively. Having established the overall performance advantage of PathMoG, we next examined which architectural choices produced that gain.
3.2. Architecture validation To explain why PathMoG performs well, we next tested whether pathway modularity acts as a genuine regularizer rather than a cosmetic architectural choice.
5
PathMoG: A Pathway-Centric Modular GNN
Table 2. Concordance Index (C-index) and Time-dependent AUC across 10 TCGA cancer types. Per-cohort entries are mean test-set metrics from 5-fold cross-validation, and the Overall row reports sample-size-weighted averages across the 10 cohorts. PathMoG ranks first in C-index for all 10 cohorts and in AUC for 8 of 10 cohorts. Cancer
C-index/AUC
N Cox
RSF
CAMR
PathG
GraphS
FGCN
HFB
PCL
PathMoG
BRCA
1082 0.712/0.663 0.695/0.642 0.667/0.717 0.685/0.776 0.640/0.687 0.756/0.690 0.671/0.627 0.760/0.740 0.784/0.811
KIRC
534 0.726/0.626 0.718/0.619 0.702/0.756 0.658/0.675 0.687/0.652 0.742/0.738 0.574/0.581 0.748/0.765 0.751/0.780
GBM
580 0.520/0.550 0.542/0.573 0.659/0.650 0.569/0.605 0.553/0.592 0.610/0.592 0.563/0.443 0.654/0.665 0.724/0.810
LUAD
506 0.607/0.547 0.615/0.560 0.651/0.676 0.605/0.660 0.555/0.618 0.605/0.702 0.584/0.563 0.683/0.630 0.709/0.757
COAD
430 0.517/0.546 0.538/0.567 0.650/0.660 0.597/0.667 0.504/0.623 0.650/0.700 0.673/0.477 0.650/0.680 0.694/0.699
LGG
511 0.713/0.738 0.702/0.727 0.704/0.732 0.692/0.718 0.711/0.732 0.720/0.725 0.698/0.735 0.715/0.748 0.753/0.814
HNSC
525 0.590/0.673 0.582/0.655 0.595/0.672 0.600/0.658 0.585/0.672 0.605/0.660 0.588/0.638 0.602/0.650 0.610/0.668
OV
570 0.564/0.617 0.572/0.625 0.645/0.671 0.576/0.637 0.617/0.671 0.609/0.598 0.594/0.548 0.600/0.680 0.629/0.691
UCEC
541 0.503/0.531 0.519/0.548 0.592/0.624 0.568/0.585 0.503/0.602 0.598/0.602 0.582/0.532 0.600/0.623 0.680/0.714
LIHC
371 0.626/0.598 0.642/0.615 0.625/0.661 0.647/0.653 0.597/0.638 0.652/0.580 0.524/0.563 0.640/0.650 0.654/0.666
Overall (weighted) 5650 0.618/0.615 0.620/0.616 0.651/0.686 0.625/0.674 0.601/0.653 0.664/0.662 0.612/0.576 0.675/0.689 0.708/0.751
Cox: Cox-PH; RSF: random survival forest; CAMR: cross-modal attention; PathG: PathGNN (Liang et al., BMC Bioinformatics 2022); GraphS: GraphSurv (Wang et al., BIBM 2021); FGCN: FGCNSurv; HFB: HFBSurv; PCL: PCLSurv. AUC: Area Under ROC Curve at median survival time. PathMoG achieves the highest C-index in all 10 cancer types. $ E O D W L R Q 6 W X G \ &