diff --git a/paper/README.md b/paper/README.md
index 6585783..305f683 100644
--- a/paper/README.md
+++ b/paper/README.md
@@ -17,7 +17,10 @@ two-sided dilemma explicitly in the introduction and aligns the
 introduction's question with the abstract (label, not verdict). The
 version submitted for review (July 17, 2026, sha256 `7f140356…`) is
 preserved unchanged in this repository's git history. The live copy at
-<https://ltl.zkdefi.org/paper> serves the current revision.
+<https://ltl.zkdefi.org/paper> serves the current revision; the v0.15
+revision is archived with DOI
+[10.5281/zenodo.22057482](https://doi.org/10.5281/zenodo.22057482)
+(CC BY 4.0).
 
 Superseded early drafts (v0.1, v0.2) were removed from the working tree
 on 2026-08-15; like every prior state of this folder, they remain
diff --git a/provider/src/pacta_provider/webdocs.py b/provider/src/pacta_provider/webdocs.py
index 306578f..57bb7b2 100644
--- a/provider/src/pacta_provider/webdocs.py
+++ b/provider/src/pacta_provider/webdocs.py
@@ -398,7 +398,7 @@ our roadmap.</strong> (The full walk-through is lecture&nbsp;11 of the Jupyter c
 <div class="card"><a href="{base}/paper"><strong>Accountable Distribution of Machine-Checked
 Correctness Evidence: A Transparency Model and the Lean Transparency Log</strong></a>
 (PDF, 25 pages, <strong>v0.15 — revised August&nbsp;2026</strong>; the version is printed on the
-title page) — the trust decomposition (expensive verification produces an
+title page; DOI <a href="https://doi.org/10.5281/zenodo.22057482">10.5281/zenodo.22057482</a>) — the trust decomposition (expensive verification produces an
 observation; transparency makes the observation accountable; consumer-local policy decides
 acceptance), collision-extracting soundness for inclusion and consistency, scheme-level
 accountability GAMES with an explicit composition theorem (head authenticity, position