HyGRAIL, a cost-aware and evidence-grounded framework that combines heterogeneous GNN triage with LLM-based hypothesis review, is proposed, which retrieves node-level associations and multi-hop relational paths from the knowledge graph and converts this structured evidence into natural language through template-based or LLM-based naturalization.
Abstract
Scientific knowledge graphs organize entities and relations extracted from scientific literature, but they remain inherently incomplete. Missing typed links in such graphs can therefore represent plausible scientific hypotheses, such as unexplored associations between materials and applications. However, scientific hypothesis discovery is challenging because true discoveries are extremely sparse among typed candidate pairs: graph neural networks (GNNs) are efficient but unreliable for ambiguous cases, while large language models (LLMs) are knowledgeable but too costly to apply exhaustively and are not naturally grounded in graph structures. We propose HyGRAIL, a cost-aware and evidence-grounded framework that combines heterogeneous GNN triage with LLM-based hypothesis review. HyGRAIL first uses a GNN to score candidate hypotheses and identify a validation-calibrated ambiguous region, routing only graph-uncertain cases to LLM review. For each routed hypothesis, HyGRAIL retrieves node-level associations and multi-hop relational paths from the knowledge graph (KG), then converts this structured evidence into natural language through template-based or LLM-based naturalization. An LLM review agent finally judges each hard hypothesis using the naturalized evidence and validation-selected decision criteria. On MatKG, HyGRAIL achieves the best F1 score of 0.429, improving over the strongest prior baseline by 0.242 F1 points and over the GNN-only baseline by 0.322. Meanwhile, GNN triage reduces the LLM call rate by 54.36% on average. Ablation studies further show that retrieved graph evidence is crucial for reliable hypothesis verification and that compact, two-sided evidence is more effective than simply increasing retrieval quantity.
This paper proposes a deterministic, explainable framework for validating uncertain entities during Knowledge Graph (KG) expansion. The contribution is conceptual and formal: we present the framework and demonstrate its internal mathematical coherence, while empirical evaluation is explicitly deferred to future work. S...
Simon Von Oppenkowski, Benedikt Lerch, Klemens Schnattinger· European Conference on Knowl...· 0 citations
Scientific discovery depends on connecting claims scattered across a fragmented literature—yet researchers’ tools offer either creative breadth or rigorous traceability, rarely both. We present a framework that unites large language models with Semantic Web knowledge graphs, enabling hypothesis exploration grounded in...
N. D. Di Matteo, James Blustein· Proceedings of the 37th ACM...· 0 citations
ConRAG is introduced, which builds a lightweight entity-document graph from entity co-occurrence and LLM-based entity filtering that consistently improves bridge entity and reasoning chain recovery over strong RAG baselines, while reducing graph-indexing token cost by up to roughly 1.5 orders of magnitude.
Kilian Bänziger, Sonia Laguna, Markus Kreft et al.· 0 citations
A novel framework KD-GAG is proposed that efficiently constructs KGs by distilling teacher LLMs' semantics and reasoning into a smaller student LLM and a preference-based subgraph pruning method to optimize the retrieval process.
Long Zhao, Yin Xu, Yan-Yan Wang et al.· Neural Networks· 0 citations
Graph-based Retrieval-Augmented Generation (GraphRAG) supports multi-hop reasoning by organizing corpora into structured graphs. However, graph reachability often captures semantic association rather than evidence support, so a reachable passage may still fail to justify a required cross-passage transition. We propose...
Lin-Yao Zheng, Xu-Hang Shi, Zhi-Fang Mao et al.· 0 citations
This work connects papers in a graph whose edges are typed by these four facets, derived from facet items and citation signals, and distil it into a generative retriever whose identifiers are the papers'own facet text.
Italo Luis da Silva, Hanqi Yan, Yu-Jing Wang et al.· 0 citations
Flint-interactive gives AI agents a language for creating interactive visualizations. Click a chart, filter data, highlight related content, and explore beyond the view the author originally chose. The post Flint-interactive: A language for creating interactive data visualizations appeared first on Microsoft Research.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.