← AMRAL · BSD 猜想 · 二 · 計算與重現 · RUN-101

RUN-101

RUN-101 — C9, the residual holonomy audit: the complete transport graph built before any quotient (RUN-097's five lines, PC-001's `B̂` vertex, four actual arrows, `A′` and two dictionary edges, eight tagged loops, the E-labels and R0.5's divisors placed), then quotiented in the web line's two repres