Pith. sign in

REVIEW 1 cited by

FAIR Knowledge Graphs with Semantic Units: a Prototype

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2311.04761 v1 pith:YHEA7QIJ submitted 2023-11-08 cs.DB

FAIR Knowledge Graphs with Semantic Units: a Prototype

classification cs.DB
keywords knowledgesemanticgraphsunitsfairgraphmakingdata
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Knowledge graphs and ontologies are becoming increasingly important in the context of making data and metadata findable, accessible, interoperable, and reusable (FAIR). We introduce the concept of Semantic Units for organizing Knowledge Graphs into identifiable and semantically meaningful subgraphs. Each Semantic Unit is represented in the graph by its own resource that instantiates a Semantic Unit class. Different types of Semantic Units are distinguished, and together they can organize a Knowledge Graph into different levels of representational granularity with partially overlapping, partially enclosed subgraphs that users of Knowledge Graphs can refer to for making statements about statements. The use of Semantic Units in Knowledge Graphs supports making them FAIR and increases the human-reader-actionability of their data and metadata by increasing the graph's cognitive interoperability by increasing its explorability for a human reader. We introduce a minimal prototype web application for a user-driven FAIR Knowledge Graph that is based on Semantic Units.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. FAIR GraphRAG: A Retrieval-Augmented Generation Approach for Semantic Data Analysis

    cs.IR 2026-07 conditional novelty 6.0

    Embedding FAIR Digital Objects as graph nodes yields a GraphRAG system that measurably improves accuracy, coverage and explainability on biomedical RNA-seq queries versus a non-FAIR baseline.