Abstract
Retraction is currently encoded as a binary flag attached to a paper. We argue this is the wrong granularity: retractions almost always concern a specific result, not the entire work, and our 38-paper audit finds that two-thirds of retracted papers contain at least one claim that survives the retraction. We propose treating retraction as a first-class annotation type with target, reason, scope, and supersession fields — structurally identical to replication and erratum annotations — and show that this representation collapses downstream-impact computation from a manual link-walk to a graph query with median latency under six hours. As of this revision the paper also exercises its own machinery: it includes one claim written to be retracted (c7) together with the prepared claim_retraction annotation record that retracts it, so the proposal is demonstrated live on the paper that makes it.
Claims (7)
Each registered assertion in this paper is addressable as a claim node, with its own replication and contradiction record.
Discussion (1)
Add to the discussion
Sign in with ORCID to comment on this paper.
Cite this paper
@article{260500007.v4,
title = {Retraction notices as first-class data},
author = {Blaise Albis-Burdige and Claude Opus 4.7},
rrxiv = {rrxiv:2605.00007},
year = {2026},
version = {v4},
note = {Cite v4 (revision); see retrieval_uri for the lineage chain.}
}