The FAIR Digital Object (FDO) framework mandates that metadata attribute values be expressed as persistent identifiers (PIDs) wherever possible, to produce a fully machine-actionable graph in which ev...
The paper introduces an end‑to‑end pipeline that harvests, validates, and models links between scholarly articles and their source code from journals such as JOSS, SoftwareX, and IPOL, as well as SIGMOD ARI reproducibility reports. It produces a curated set of 4,397 DOI‑repository pairs and defines two Wikidata‑based application profiles—one for articles and one for software—aligned with schema.org and CodeMeta. Using these profiles, the authors created 4,182 new Wikidata software items linked to their papers, while only 82 repositories were previously represented, and they demonstrate compatibility with the COAR Notify protocol for future live enrichment.
arXiv:2608. 14228v1 Announce Type: new Abstract: Life science knowledge graphs make large collections of structured data available through SPARQL, but each resource uses its own schema, identifiers, and links.
arXiv:2608. 10644v1 Announce Type: new Abstract: Extraction produces candidate entities and relationships; writing them into a graph is where identity is decided, and identity decisions are destructive in a way extraction errors are not.
The paper presents a system that transforms open‑problem listings in research fields into a structured, queryable knowledge graph. It combines a hand‑curated problem layer with an evidence layer derived from bibliographic data, linked through typed, provenance‑carrying connections. The authors evaluate the approach on database and AI problem catalogs, showing that the new graph can answer all previously answerable queries and additional ones about recent work, but also reveal limitations in automated status judgments, leading to a design recommendation that status changes must be proposed with evidence and reviewed by humans.
arXiv:2606. 05415v1 Announce Type: cross Abstract: Real-world data spans tables, documents, and semi-structured files with implicit semantics.
arXiv:2608.28642v1 Announce Type: new Abstract: Knowledge graphs used by agentic systems are often treated as flat stores of extracted triples, with little record of who owns a fact, why it was admit...
arXiv:2607. 28662v1 Announce Type: new Abstract: Large language models extract entities and relationships from unstructured documents fluently but inconsistently: type vocabularies fracture across documents, the same person surfaces under several name variants, relationships duplicate, and distinct individuals who share a name risk silent conflation.
arXiv:2607. 05970v1 Announce Type: cross Abstract: Dataset search depends heavily on metadata, making LLM-generated metadata a consequential form of synthetic content in retrieval systems.
arXiv:2607. 14494v1 Announce Type: new Abstract: Complex knowledge base question answering (KBQA) is commonly approached through either information retrieval over a question-specific subgraph or semantic parsing into an executable logical form.
The paper investigates whether a knowledge graph can enhance retrieval for enterprise retrieval‑augmented generation (RAG) systems compared to traditional similarity search. Using a snapshot of SEC EDGAR filings, the authors built a graph with 430,257 nodes and 561,144 edges, then evaluated three architectures—text‑to‑SQL, dense‑vector RAG, and a two‑stage GraphRAG. GraphRAG outperformed the other methods, correctly answering 16 of 20 questions across all attempts, while the other approaches lagged behind, especially in structured aggregation and single‑document queries.
arXiv:2508. 01815v2 Announce Type: replace-cross Abstract: Text-to-SPARQL maps natural-language questions to executable SPARQL queries over RDF knowledge graphs.