Linear Jordan-block growth — 0.1.0-candidate

Anonymous, unrefereed constructive theorem candidate for AIM Problem 1.3(1): f(n)=Theta(n), with a fixed maximum-degree strengthening. Includes the eight-page paper, exact code and receipts, five-role internal review and the unchanged frozen editorial target. Linux Python 3.11 and 3.13 normal/optimized replay passed. No external specialist validation, formal proof, exhaustive novelty or priority certificate; part (2) and optimal constants are not claimed. DOI: 10.5281/zenodo.22375005. Original prose/data CC0; code MIT; third-party rights separate.