Claim·Untested·2605.00001

Claim lineage-acyclic

The previous_version graph of the corpus forms a strict DAG. The submission handler enforces this by minting a fresh paper_id whenever the submitted CIR's id field collides with the previous_version parameter, preventing self-loops (paper.id == paper.previous_version) at write time. Read-path walkers (\texttt{GET /papers/{id}/versions}) additionally track visited ids and terminate on any cycle, so even pre-existing pathological rows (e.g.\ rows imported from a buggy upstream) do not produce infinite loops.

Knowledge graph

No claim-graph edges declared for this claim yet.

Discussion

No replications, contradictions, or comments registered yet for this claim.

Replicate or annotate this claim

Replicate to register a fresh attempt; contradict, extend, or comment otherwise. Authors can post a claim-retraction with the reason taxonomy from RRP-0020.

Sign in with ORCID to annotate this claim.