\section{Completions, bounded charts, and cardinality heights} \subsection{Exact completion of the stable choices} \label{sec:stable-completion} Let a finite digraph have an involution $\theta$ on vertices reversing arcs. An individually fixed arc has the form $e:u\to\theta u$. Let $D$ be an RC-invariant DAG from which all such candidate arcs have been removed. Write $a_D(v)$ and $b_D(v)$ for its longest incoming and outgoing path lengths and $L_D$ for its longest path. Reachability below includes paths of length zero. \begin{lemma}[At most one fixed arc on a path] \label{lem:one-fixed-arc} An RC-invariant DAG has no directed path containing two individually fixed arcs. \end{lemma} \begin{proof} If $e:u\to\theta u$ and $f:v\to\theta v$ occur in that order, let $P\colon\theta u\leadsto v$ be the intervening path. Then $e,P,f,\RC(P)$ is a nonempty closed directed walk, a contradiction. The argument includes an empty $P$. \end{proof} \begin{theorem}[Stable completion by 2-SAT] \label{thm:stable-completion} For a subset $R$ of the removed fixed arcs, $D\cup R$ is acyclic if and only if it satisfies the following prohibitions: \begin{enumerate} \item Do not restore $e:u\to\theta u$ if $D$ has a path $\theta u\leadsto u$. \item Do not restore distinct $e:u\to\theta u$ and $f:v\to\theta v$ together if $D$ has a path $\theta u\leadsto v$. \end{enumerate} For every acyclic completion, \begin{equation} L(D\cup R)=\max\{L_D,\ \max_{e:u\to\theta u\in R}(2a_D(u)+1)\}. \label{eq:stable-length} \end{equation} Thus, after fixing the nonstable PCR selections in an even-order RC de Bruijn graph, existence of an MDS completion with $L\le\ell$ is decided by 2-SAT in polynomial time in the explicit graph size. \end{theorem} \begin{proof} Each prohibition is necessary by closing one fixed arc or applying \Cref{lem:one-fixed-arc}. Conversely a cycle must use a restored arc. If it uses exactly one it violates the first prohibition; otherwise two consecutive restored arcs on the cycle violate the second. For the length formula, every path uses at most one such arc. The longest prefix ending at $u$ and suffix starting at $\theta u$ can be concatenated with it: any repeated vertex would give a cycle. RC gives $b_D(\theta u)=a_D(u)$, proving equality. For MDS completion delete the fixed nonstable selections and all individually fixed arcs to form $D$. If $D$ is cyclic or $L_D>\ell$, reject. Otherwise introduce a variable for restoring each fixed arc, require exactly one per stable pair, and add the two types of prohibition as unary and binary clauses. Also forbid any restored arc with $2a_D(u)+1>\ell$. These are exactly the necessary and sufficient constraints. Reachability and DAG distances are polynomial. The implication graph decides 2-SAT by checking that no variable and its negation belong to one strongly connected component. \end{proof} The implication-graph algorithm is classical \cite{AspvallPlassTarjan1979}; the complete RC reachability and length reductions are proved above. The algorithm fixes the nonstable selections first; it is not a polynomial algorithm for the global MDS optimization problem or for counting all 2-SAT models. For $\ell=106$, a restored fixed arc must have $a_D(u)\le52$. \begin{proposition}[The complete stable fibre of $M_{107}$] \label{prop:stable-fibre} Keeping all nonstable selections of the canonical $M_{107}$ fixed leaves exactly 128 RC MDS: 121 of the 128 stable choices are forced and seven are free. The resulting cube has ordinary-component minimum profile \[ 107:8,\qquad109:8,\qquad111:16,\qquad113:32,\qquad115:64. \] The 128 endpoints belong to distinct ordinary components. None of these fixed-exterior completions has $L\le106$. \end{proposition} \begin{proof}[Exact certificates] The stable-cube certificate reconstructs all fixed arcs, all reachability prohibitions and all costs in \eqref{eq:stable-length}. It verifies the 128 DAGs and, for each, a one-hit cycle one arc longer than its length. These certify the component minima, not just the fibre minima. Distinct stable assignments in this cube are neither equal nor global complements, since 121 bits are fixed. \Cref{lem:stable-pcr-parity} separates their components. A 107-arc path using only nonstable PCRs remains after every stable change, and independently obstructs the target 106. \end{proof} \subsubsection{Allowing one extra selected arc} Let $N$ be the number of PCRs. At cost at most $N+1$, an RC feedback set has exactly one selection in every nonstable PCR: surplus there comes in RC pairs and costs at least two. At cost $N+1$, exactly one stable PCR is double. Its selected pair is either its two individually fixed arcs or a nonfixed RC pair. \begin{corollary}[Complete fixed-exterior oracle for excess at most one] \label{cor:excess-one-oracle} For even $q,k$ and free alphabet complement, fix an RC selection of one arc per nonstable PCR. Existence of an RC feedback set extending it with cost at most $N+1$ and $L\le\ell$ is decided by at most $1+\sum_{P\ \mathrm{stable}}|P|/2$ instances of 2-SAT. This is polynomial in the explicit graph size. For DNA $k=8$ the number of branches is $1+128+366=495$. \end{corollary} \begin{proof} The preceding classification is exhaustive because every PCR must be hit. Take one branch with no exceptional PCR, or choose the exceptional PCR and its double selection. A stable PCR of period $p$ has one fixed pair and $(p-2)/2$ nonfixed pairs, giving $p/2$ exceptional branches. Construct $D$ by deleting the fixed nonstable selections, the chosen exceptional nonfixed pair if any, and all individually fixed arcs. Reject cyclic or overlong $D$. Ordinary stable pairs require exactly one restored fixed arc. For the exceptional pair, force both restoration variables to zero if both fixed arcs were selected, or both to one if a nonfixed pair was selected. All constraints are 2-CNF. \Cref{thm:stable-completion} applies to any subset of restored fixed arcs, including these forced cases, and gives exact clauses. Their union over the branches is precisely the desired family. The stable PCRs have 988 arcs at DNA order eight, yielding 495. \end{proof} This corollary combines the completion theorem with the surplus classification; it does not choose the 4051 nonstable RC-PCR groups of the global problem. Its finite regression includes satisfiable and unsatisfiable 2-SAT branches, not just cases rejected before the SAT step. \subsubsection{Rank projection and cuts with the correct surplus} \begin{proposition}[Continuous ranks for Boolean endpoints] \label{prop:boolean-ranks} For a Boolean arc indicator $n$ and integer $\ell\ge0$, the residual is a DAG with $L\le\ell$ if and only if there is a real rank $r\in[0,\ell]^V$ such that \[ r(h(e))-r(t(e))\ge1-(\ell+1)n(e). \] If $n$ is RC invariant the rank may have mate sum $\ell$. \end{proposition} \begin{proof} An integral longest-path rank proves necessity, including on selected arcs where the right side is $-\ell$. Conversely summing along zero arcs excludes cycles and paths longer than $\ell$. Replace $r(v)$ by $(r(v)+\ell-r(\theta v))/2$ for the last claim. \end{proof} Integrality of the signed clock in \Cref{thm:bounded-chart} remains essential; this proposition assumes Boolean $n$. The rank system can be projected exactly to a boundary $B$ of variable arcs, retaining every variable-arc inequality on its boundary endpoints. Let $D$ be the fixed residual DAG and keep all inequalities $r(v)-r(u)\ge d_D(u,v)$ for reachable boundary pairs, where $d_D$ is the longest path distance. Also keep $a_D(v)\le r(v)\le\ell-b_D(v)$ and check $L_D\le\ell$. To extend feasible boundary values, set the rank of any vertex $v$ to the maximum of $a_D(v)$ and all $r(u)+d_D(u,v)$ with $u\in B$ reaching $v$. The boundary values are preserved; the suffix bounds keep every extended rank at most $\ell$, and all fixed arc inequalities hold. This proves exact elimination. It may create many boundary-pair constraints and is not an automatic reduction in total model size. \begin{corollary}[Two-arm inequality with stable surplus] \label{cor:surplus-two-arm} Let a stable PCR $P$ have fixed arcs $e_i:u_i\to\theta u_i$, $i=0,1$. For each $i$ choose a path of $h$ nonfixed arcs ending at $u_i$, and let $U$ be the union of their arc sets. Every RC feedback set $M$ with $L(M)\le2h$ satisfies \[ \sum_{e\in U}\ind_M(e)+\bigl(|M\cap P|-1\bigr)\ge1. \] \end{corollary} \begin{proof} The PCR is hit. If it is hit at least twice the inequality is immediate. Otherwise RC forces its sole selected arc to be fixed, so the other $e_i$ is residual. If $M$ avoided both arms, RC would also leave both reflected arms residual. The arm ending at $u_i$, followed by $e_i$ and its reflected arm, would be a residual walk of $2h+1$ arcs. It is either an overlong path or contains a cycle, both impossible. \end{proof} The sum uses the full arc universe, including arcs that become selectable when surplus is allowed. The surplus belongs to the \emph{stable} PCR $P$. At MDS cost it vanishes; at cost $N+1$ it can legitimately deactivate a clause. Omitting it is false: for binary $k=4$, the RC feedback set \[ \{0000,0011,0100,0101,1000,1100,1101,1110,1111\} \] has $L=2$. The stable PCR $\{0011,0110,1001,1100\}$ is hit twice, while neither one-arc arm $0001$ or $0110$ is selected. The unlifted inequality would read $0\ge1$. \subsection{A complete bounded chart of RC endpoints} \label{sec:signed-chart} Assume throughout this section that $q$ and $k\ge2$ are even, the alphabet complement has no fixed letter, and a base indicator $m$ is RC invariant with exactly one selection per PCR. Lower vertices have odd length and occur in distinct pairs $\{u,\theta u\}$. The base need not be acyclic for the algebraic representation below. \begin{lemma}[Stable PCRs and a parity restriction] \label{lem:stable-pcr-parity} Every RC-stable PCR has exactly two individually RC-fixed arcs. An RC selection of one arc in that PCR chooses one of them. Every integral combination of paired transfers \[ g_{u,a}=\ind_{ua}-\ind_{au} +\ind_{\RC(ua)}-\ind_{\RC(au)} \] preserves the parity of each individually fixed arc coefficient. If two RC MDS differ by an integral gradient, all their fixed-arc bits are either unchanged or simultaneously complemented. \end{lemma} \begin{proof} Write $\RC(w)=\rot^j w$ on an orbit of primitive period $p$. The induced reflection of letter positions cannot fix a position, since a letter is different from its complement. Thus $p$ is even and $j$ is even. Fixed rotations solve $2i=j\pmod p$, giving two solutions. A one-element RC-invariant selection must be fixed. At a fixed arc the two summands in each RC pair in $g_{u,a}$ coincide, so its coefficient is even. For $n-m=\nabla f$, comparison of mate arcs makes $f(v)+f(\theta v)=C$ constant. On $e:u\to\theta u$, $n(e)-m(e)=2f(u)-C\equiv C\pmod2$; Boolean endpoints prove the claim. \end{proof} For DNA $k=8$, the 128 stable choices, modulo simultaneous complementation, yield a 127-bit ambient label for ordinary components. This is neither a complete invariant nor a claim that all labels are realized. Omitting independent stable corrections therefore imposes a genuine restriction on an integral transfer search. \begin{lemma}[Reconstruction from a signed cochain] \label{lem:signed-reconstruction} Let $x:E\to\Z$ be RC invariant and sum to one on every PCR. If $T\ge1$ and an integral $H$ satisfy \begin{equation} H(h(e))-H(t(e))+Tx(e)\ge1,\qquad H(v)+H(\theta v)=T-1, \label{eq:signed-clock} \end{equation} then \[ n(e)=x(e)-\floor{H(t(e))/T}+\floor{H(h(e))/T} \] is an RC MDS indicator and $L(n)\le T-1$. \end{lemma} \begin{proof} Write $H=Ta+r$, $0\le r