Post-search theory and validation addendum, 8 November 2026.
The 9356-case protocol was executed unchanged. The following were developed after
examining its results and must not be presented as frozen pre-search predictions:
(1) Survivors in the searched parameter ranges match pair-balanced attachments or
    weights (a,a,b,b). The latter extends to all positive a,b by exact polynomial
    coefficient enumeration on the four-letter seeds, in symbolic_blowup_v12.py.
(2) Independently of this finite neighbourhood, compare C_n with
    C_floor(n/2) disjoint-union C_ceil(n/2). The standard directed-cycle net-length
    criterion yields least separating order floor(n/2), hence a linear lower bound.
    Relevant antecedent: ten Cate--Kolaitis--Kristjansson, MFCS 2025, Lemma 4.2
    and Proposition 2.4. The family/proof is a specialization, not claimed as a new
    directed-cycle counting theorem. The verifier checks full laws through the
    applicable order up to 5 for n=4..13 and cycle witnesses for n=4..40.
This changes the V11 open growth question: binary growth is Theta(n) when combined
with the manuscript's 2n upper bound. Exact b_Lin(6,2) is still not determined.
