Graph neural networks on assurance case graphs reach 0.76 ROC-AUC for link prediction and 0.94 F1 for distinguishing human from LLM-generated cases, with observed differences in hierarchical linking patterns.
Title resolution pending
4 Pith papers cite this work. Polarity classification is still indexing.
citation-role summary
citation-polarity summary
years
2026 4roles
background 1polarities
background 1representative citing papers
MMP-Refer augments LLMs with multimodal retrieval paths and a trainable collaborative adapter to produce more accurate and explainable recommendations.
A shared graph neural network framework jointly solves ACOPF and SCUC problems using physics constraints and shows improved generalization to unseen grid topologies.
Inductive subgraphs serve as shortcuts in heterophilic graphs, and CD-GNN disentangles spurious from causal subgraphs by blocking non-causal paths to improve robustness and accuracy.
citing papers explorer
-
Evaluating Assurance Cases as Text-Attributed Graphs for Structure and Provenance Analysis
Graph neural networks on assurance case graphs reach 0.76 ROC-AUC for link prediction and 0.94 F1 for distinguishing human from LLM-generated cases, with observed differences in hierarchical linking patterns.
-
MMP-Refer: Multimodal Path Retrieval-augmented LLMs For Explainable Recommendation
MMP-Refer augments LLMs with multimodal retrieval paths and a trainable collaborative adapter to produce more accurate and explainable recommendations.
-
Towards Systematic Generalization for Power Grid Optimization Problems
A shared graph neural network framework jointly solves ACOPF and SCUC problems using physics constraints and shows improved generalization to unseen grid topologies.
-
Inductive Subgraphs as Shortcuts: Causal Disentanglement for Heterophilic Graph Learning
Inductive subgraphs serve as shortcuts in heterophilic graphs, and CD-GNN disentangles spurious from causal subgraphs by blocking non-causal paths to improve robustness and accuracy.