mlsanityData to 14 Oct 2026

Unifying biomedical knowledge in a modern multimodal graph

arXiv 2604.27269 ↗First posted 29 Apr 2026cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Biomedical knowledge graphs (KGs) are widely used in the life sciences, yet many are derived from unstructured documents and therefore lack schema-level constraints, whereas graphs assembled from structured resources are difficult to harmonize into a unified representation. We present OptimusKG, a multimodal biomedical labeled property graph (LPG) built from structured and semi-structured resources to preserve factual, type-specific metadata across molecular, anatomical, clinical, and environmental domains. OptimusKG contains 190,939 nodes across 10 entity types, 21,818,752 edges across 27 edge types, and 67,070,490 property instances encoding 109,665,797 values across 145 distinct property keys, derived from 18 ontologies and controlled vocabularies. The graph enforces a top-level schema for nodes and edges and retains granular, type-specific properties, cross-references, and provenance. We assessed the validity of OptimusKG by evaluating whether graph relationships are supported by evidence from the scientific literature using a multimodal agent, PaperQA3. PaperQA3 identified supporting evidence for 70.0% of sampled edges, whereas 83.4% of sampled false edges received no supporting evidence. Edges without literature support were concentrated in associations derived from experimental and functional genomics resources, suggesting that OptimusKG captures biomedical knowledge that may precede synthesis in the scientific literature. OptimusKG is distributed as Apache Parquet files, providing a standardized resource for graph-based machine learning, knowledge-grounded retrieval with large language models, and biomedical discovery use cases such as hypothesis generation.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 19 of its 93 references that are in the map. First posted on arXiv 29 Apr 2026.

Builds on

19 of 93 references.

References · 19

  1. 2023GraphGPT: Graph Instruction Tuning for Large Language Modelscited by 226
  2. 2024Language agents achieve superhuman synthesis of scientific knowledgecited by 137
  3. 2020Learning to Drop: Robust Graph Neural Network via Topological Denoisingcited by 127
  4. 2023Graph Neural Prompting with Large Language Modelscited by 64
  5. 2024LLMs as Zero-shot Graph Learners: Alignment of GNN Representations with LLM Token Embeddingscited by 61
  6. 2024Paths-over-Graph: Knowledge Graph Empowered Large Language Model Reasoningcited by 44
  7. 2024Can Graph Learning Improve Planning in LLM-based Agents?cited by 43
  8. 2020Building a PubMed knowledge graphcited by 38
  9. 2021A Review of Biomedical Datasets Relating to Drug Discovery: A Knowledge Graph Perspectivecited by 38
  10. 2020COVID-19 Literature Knowledge Graph Construction and Drug Repurposing Report Generationcited by 32
  11. 2019OpenBioLink: A benchmarking framework for large-scale biomedical link predictioncited by 28
  12. 2020Few-shot link prediction via graph neural networks for Covid-19 drug-repurposingcited by 22
7 more
  1. 2024KGARevion: An AI Agent for Knowledge-Intensive Biomedical QAcited by 20
  2. 2022Biolink Model: A Universal Schema for Knowledge Graphs in Clinical, Biomedical, and Translational Sciencecited by 13
  3. 2022Mining On Alzheimer's Diseases Related Knowledge Graph to Identity Potential AD-related Semantic Triples for Drug Repurposingcited by 7
  4. 2024CancerKG.ORG A Web-scale, Interactive, Verifiable Knowledge Graph-LLM Hybrid for Assisting with Optimal Cancer Treatment and Carecited by 6
  5. 2023RNA-KG: An ontology-based knowledge graph for representing interactions involving RNA moleculescited by 5
  6. 2025RNA-KG v2.0: An RNA-centered Knowledge Graph with Propertiescited by 2
  7. 2023Reproducible Domain-Specific Knowledge Graphs in the Life Sciences: a Systematic Literature Reviewcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.