REVIEW 1 major objections 2 minor 1 cited by
A Python library performs all six types of temporal SPARQL queries live on any triplestore by reading existing provenance records.
Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →
T0 review · grok-4.3
2026-05-24 11:04 UTC
load-bearing objection The library gives live full-coverage temporal SPARQL on any triplestore, but only when data already follows OCDM with PROV-O and SPARQL UPDATE provenance. the 1 major comments →
Time travel for knowledge graphs: live queries over RDF change histories
The pith
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
By reading the provenance information recorded through PROV-O and SPARQL UPDATE operations in the OpenCitations Data Model, the Time Agnostic Library can reconstruct and query any past version or delta of an RDF graph directly from a standard SPARQL triplestore, delivering full coverage of the six temporal retrieval needs while updates continue to arrive.
What carries the argument
The Time Agnostic Library, which reconstructs temporal states from PROV-O provenance and SPARQL update logs to answer live queries without additional indexing or preprocessing.
Load-bearing premise
The RDF dataset must already store all changes using the OpenCitations Data Model with PROV-O provenance and SPARQL UPDATE operations.
What would settle it
Executing the library against an RDF dataset that lacks OCDM-style PROV-O provenance records and finding that no temporal version or delta can be reconstructed or queried.
If this is right
- All six temporal retrieval needs identified in the literature become available on live data.
- Concurrent updates remain possible during query execution.
- Execution time and memory scale sub-linearly with the number of versions on the BEAR-B benchmark.
- Query performance exceeds that of R43ples across every tested query type.
Where Pith is reading between the lines
- Dynamic knowledge graphs could keep full historical query access without maintaining separate archival copies.
- The same provenance-driven approach might apply to other change-tracking models beyond OCDM.
- Real-time historical analysis becomes feasible in production linked-data systems that already record provenance.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper presents the Time Agnostic Library, a Python library for live temporal SPARQL queries over RDF change histories on any SPARQL-compliant triplestore. It supports all six temporal retrieval needs (version materialization, single-version and cross-version structured queries, delta materialization, single-delta and cross-delta structured queries over multi-triple patterns) by leveraging provenance recorded via the OpenCitations Data Model (OCDM), PROV-O, and SPARQL UPDATE operations. Evaluation on the BEAR-B benchmark reports sub-linear scaling in execution time and memory consumption, with faster performance than R43ples across query types while supporting concurrent updates.
Significance. If the results hold, this provides a practical contribution by enabling temporal querying on dynamic RDF datasets without offline ingestion, addressing a limitation of systems like OSTRICH. The support for concurrent updates and direct benchmark comparison to R43ples are strengths. The implementation-focused evaluation on a standard benchmark adds concrete evidence of utility for knowledge graph applications.
major comments (1)
- [Abstract] Abstract: The claim of supporting temporal queries 'live on any SPARQL-compliant triplestore' for 'RDF change histories' is load-bearing for the central contribution but rests on the data already being modeled per OCDM using PROV-O and SPARQL UPDATE operations to record provenance. Without this specific structure, temporal information cannot be reconstructed from the triplestore state alone. Although the abstract notes that the methodology builds on OCDM, the scope implications for arbitrary change histories should be stated more explicitly in the introduction to avoid overstating generality.
minor comments (2)
- [Evaluation] Evaluation section: Additional details on data exclusion criteria, exact query coverage, and error handling in the BEAR-B experiments would allow better verification of the reported sub-linear scaling and performance comparisons.
- The paper would benefit from an explicit statement of whether the library code and benchmark scripts are publicly available to support reproducibility.
Simulated Author's Rebuttal
We thank the referee for the positive assessment of our contribution and the constructive comment. We address the point below and will revise the manuscript to improve clarity on scope.
read point-by-point responses
-
Referee: [Abstract] Abstract: The claim of supporting temporal queries 'live on any SPARQL-compliant triplestore' for 'RDF change histories' is load-bearing for the central contribution but rests on the data already being modeled per OCDM using PROV-O and SPARQL UPDATE operations to record provenance. Without this specific structure, temporal information cannot be reconstructed from the triplestore state alone. Although the abstract notes that the methodology builds on OCDM, the scope implications for arbitrary change histories should be stated more explicitly in the introduction to avoid overstating generality.
Authors: We agree that explicit clarification of scope is warranted to prevent misinterpretation. The library operates on RDF change histories that have been recorded using the OCDM (with PROV-O and SPARQL UPDATE provenance), as stated in the abstract and methodology sections; it does not reconstruct temporal information from arbitrary triplestore states. We will add a dedicated paragraph in the introduction (Section 1) that explicitly delineates this requirement and its implications for generality, while preserving the existing mention in the abstract. revision: yes
Circularity Check
Minor self-citation of OCDM; central claims rest on library implementation and external benchmarks
full rationale
The paper presents an implementation of the Time Agnostic Library for temporal SPARQL queries on any triplestore, explicitly building on the OpenCitations Data Model (OCDM) with PROV-O and SPARQL UPDATE for provenance. A self-citation to OCDM is present, but the core results—support for all six retrieval needs, sub-linear scaling on BEAR-B, and faster performance than R43ples—are shown via architecture description and direct empirical comparison to external systems. No equations, fitted parameters, or derivations reduce to inputs by construction; the work is self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Any SPARQL-compliant triplestore supports the necessary UPDATE operations and can be queried for provenance data recorded in PROV-O.
read the original abstract
Performing time-traversal queries on RDF datasets remains unsupported in the most extensive knowledge graphs. Existing solutions either require offline ingestion, which prevents concurrent querying and updating, or operate live but with limited query coverage or triplestore dependency. This article presents the Time Agnostic Library, a Python library for performing temporal SPARQL queries live on any SPARQL-compliant triplestore, supporting all six temporal retrieval needs identified in the literature and concurrent updates. The methodology builds on the OpenCitations Data Model (OCDM), which records provenance using the Provenance Ontology (PROV-O) and SPARQL UPDATE operations. The library supports version materialization, single-version and cross-version structured queries, delta materialization, and single-delta and cross-delta structured queries over multi-triple patterns. Evaluation on the BEAR-B benchmark shows sub-linear scaling in both execution time and memory consumption as the number of versions increases. While preprocessing-based systems such as OSTRICH achieve faster query times, they require offline ingestion and cannot handle concurrent data updates. Against R43ples, the closest live system in architecture, the Time Agnostic Library is faster across all query types.
Forward citations
Cited by 1 Pith paper
-
HERITRACE: a domain-agnostic framework for SHACL-driven RDF curation with provenance and change tracking
HERITRACE is a domain-agnostic framework for SHACL-driven RDF curation with automatic provenance and change tracking.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.