TiramemsuPapers
Tiramemsu stores every statement as one record with its own id and two clocks. Each paper asks a different question about that record and answers it with definitions and proofs. Each also comes with executable checks, and the second and third with Lean proofs.
-
Paper 1 · consistency
Layered Bitemporal Graphs
Statement Identity, Two Clocks, and Metagraphs as Tags. What it means for a memory of layered statements to stay grounded when facts are retracted, corrected and read in the past. One operator, the ground core, explains the cascade, as-of views, valid-time slices and corrections. Revision 4, 3 October 2026.
-
Paper 2 · representation
Metagraph Encodings over Identified Triples
Exact Images, Temporal Integrity, and Structural Depth. Hypergraphs, metagraphs and nested containers all fit on identified triples. Getting them back out needs exact image constraints, and the paper shows each one is necessary. Also covers executable metapaths and what reference rank costs. Revision 2, 5 October 2026.
-
Paper 3 · interoperability
When Is a Temporal Statement Store a Statement Graph?
Export Boundaries for Occurrence Records with Two Clocks. Which part of the store can leave as a Statement Graph, the model behind OneGraph, without inventing or renaming an occurrence. It also covers what is dropped, what must be reported, and how both clocks travel into RDF-star. Revision 4, 12 October 2026.
How they fit together
The first paper fixes the model: occurrence records, two clocks, the live-reference discipline, cascade and correction by replay. The second keeps the model and asks about structures built on top of it: which metagraphs it can hold without losing anything. The third asks the opposite question: which parts of the store can leave it, as a standard graph model, without losing identity. The series overview walks through the three in order, with one running example.
Status and evidence
All three are draft preprints under CC BY 4.0, archived on Zenodo with permanent DOIs. They have not been peer reviewed. Each comes with executable evidence in the repository:
- Paper 1: a retained verification artifact and the arXiv source package.
- Paper 2: exhaustive and randomized checkers, SHACL and SPARQL validators, and a Lean proof of the directed roundtrip.
- Paper 3: a validator over exhaustive stores and random protocol histories, engine traces, and a Lean development of its combinatorial results. All of it is in a validation archive on Zenodo.
None of them reports performance numbers.
Cite
@misc{pavlyshyn2026layered,
author = {Pavlyshyn, Volodymyr},
title = {Layered Bitemporal Graphs: Statement Identity, Two Clocks,
and Metagraphs as Tags},
year = {2026},
note = {Draft preprint, revision 4. CC BY 4.0},
doi = {10.5281/zenodo.23139228}
}
@misc{pavlyshyn2026metagraphenc,
author = {Pavlyshyn, Volodymyr},
title = {Metagraph Encodings over Identified Triples: Exact Images,
Temporal Integrity, and Structural Depth},
year = {2026},
note = {Draft preprint, revision 2. CC BY 4.0},
doi = {10.5281/zenodo.23167938}
}
@misc{pavlyshyn2026export,
author = {Pavlyshyn, Volodymyr},
title = {When Is a Temporal Statement Store a Statement Graph?
Export Boundaries for Occurrence Records with Two Clocks},
year = {2026},
note = {Draft preprint, revision 4. CC BY 4.0},
doi = {10.5281/zenodo.23335652}
}