diff --git a/paper/appendix.tex b/paper/appendix.tex
index a64a254..1437916 100644
--- a/paper/appendix.tex
+++ b/paper/appendix.tex
@@ -511,7 +511,7 @@ All three confirm that sparse surgery is strictly more efficient than random row
 Following the NeurIPS/ICML reproducibility guidelines:
 
 \begin{enumerate}[leftmargin=*]
-\item \textbf{Code availability}: Full source code released under AGPL-3.0 at \url{https://github.com/obliteratus-project/OBLITERATUS}. Version 0.1.0 archived on Zenodo (DOI pending).
+\item \textbf{Code availability}: Full source code released under AGPL-3.0 at \url{https://github.com/elder-plinius/OBLITERATUS}. Version 0.1.0 archived on Zenodo (DOI pending).
 \item \textbf{Dependencies}: All dependencies pinned in \texttt{pyproject.toml}; Docker image available for exact environment reproduction.
 \item \textbf{Random seeds}: The platform defaults to seed 42 and supports multi-seed sweeps ($s \in \{42, 137, 2024\}$) with bootstrap CIs. All tables in this paper report single-run results with seed 42. See Section~\ref{para:stat_limitations} for a discussion of statistical limitations and confidence intervals.
 \item \textbf{Compute}: All pipeline stages are designed to run on a single GPU. Full evaluation (7 models $\times$ 3 methods) requires ${\sim}$12 GPU-hours on an NVIDIA A100 (80\,GB). Reproducible on consumer hardware (RTX 3090/4090) with quantization.