arXiv:2608. 07254v1 Announce Type: cross Abstract: The increasing specialization of scientific research challenges existing classification systems, which provide effective representations of broad disciplines and research topics but often fail to capture the fine-grained conceptual structure of contemporary science.
The zbMATH Open Knowledge Graph is a large-scale RDF knowledge graph that spans more than 250 years of mathematical scholarship. It goes beyond traditional bibliographic metadata by incorporating expert-curated semantic content such as reviews, keywords, subject classifications, software references, and disambiguated authorship. With 34 million entities and 168 million RDF triples, the graph enables fine-grained, historically grounded exploration of mathematical concepts, research fields, and scholarly relationships over time.
arXiv:2608.24559v1 Announce Type: cross Abstract: Despite the critical role of grey literature in scholarly communication, artefacts such as Calls for Papers (CfPs) remain largely isolated from moder...
arXiv:2606. 29180v1 Announce Type: new Abstract: A Knowledge Graph (KG) represents facts as structured triples and is widely used to organize relational knowledge across diverse domains.
arXiv:2606. 13669v1 Announce Type: new Abstract: Current LLM-based research agents have advanced through agent orchestration, yet largely overlook scientific knowledge orchestration.
arXiv:2608. 04144v1 Announce Type: cross Abstract: Biomedical entity linking grounds mentions in clinical and scientific text to entities in a curated knowledge base (KB) with ontological structure, which supports downstream applications such as literature-scale information extraction and patient-record normalization.
The paper introduces a time‑aligned evolving concept graph framework that jointly models semantic and structural changes in scientific literature. By treating dated papers as shared update events, it reconstructs both semantic and structural states from the same publication history for each prediction time, and fuses these states at the pair level to forecast co‑occurrence, relation formation, and conditional relation type. Experiments on a large graph of 187,848 papers and 270,687 concepts show that refreshing context with graph updates boosts mean relation AUPRC by 16.6% and raises mean relation AUROC from 0.9290 to 0.9722.
W-RAG is a source-aware retrieval framework designed for enterprise document generation from heterogeneous knowledge bases. It uses ontology-guided retrieval, local ranking within each knowledge base, and source-level weighting to balance evidence from diverse sources. A new dataset covering multiple document types and industry domains demonstrates that W-RAG improves document coverage and generation quality compared to standard RAG pipelines.
The paper introduces a second-pass method for uncovering hidden relationships in knowledge graphs extracted from text, without altering the original facts. By chunking documents and embedding each chunk once, the approach uses top‑k nearest‑neighbor queries and Shepard inverse‑distance weighting to score candidate node pairs, avoiding threshold issues inherent in cosine scoring. The technique is order‑independent, scalable, and has been implemented across multiple graph databases, demonstrating high edge fidelity with lower‑dimensional embeddings and a 25× speedup in top‑k computation.
arXiv:2606.22342v2 Announce Type: replace Abstract: How does research evolve, and can we trace it at the level of individual claims? Scientific progress is not simply a uniform accumulation of facts....
arXiv:2606. 11898v1 Announce Type: cross Abstract: Research on Text-Attributed Graphs (TAGs) has gained significant attention recently due to its broad applications across various real-world data scenarios, such as citation networks, e-commerce platforms, social media, and web pages.
arXiv:2204. 04888v2 Announce Type: replace-cross Abstract: In recent years, with the continuous progress of science and technology, the number of scientific research achievements has increased rapidly.