claim
active
claim:proposition-4-1-if-a-l-k-recurrent-block-reaches-a-fixed-point-s-k-x-x-then-any-cyclic-permutation-of-blocks-1-k-will-also-have-reached-a-different-fixed-pointProposition 4.1: If a (l,k)-Recurrent block reaches a fixed point S_k(X')=X', then any cyclic permutation of blocks 1,...,k will also have reached a (different) fixed point
Formal proposition establishing that fixed-point convergence implies cyclic fixed points for all block permutations
Source paper
extracted_from(2026) · Hugh Blayney · Álvaro Arroyo · Johan Obando-Ceron · Pablo Samuel Castro +3
Neighborhood — ranked by edge-count
Papers (1)
paper
Related by similarity (8)
cosine ≥ 0.65 · no typed edgeEntities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.
- Theoretical framing that establishes cyclic fixed points as the meaningful limiting behavior
- Caption of Figure 1 summarizing the central empirical finding of the paper
- Core mechanistic claim linking fixed point theory to observable inference stage behavior
- The key theoretical contribution: each layer in a cyclic recurrence converges to a distinct fixed point, tracing a consistent trajectory in latent space
- Strong claim that inference stage structure is architectural rather than learned
- Practical implication connecting mechanistic analysis to performance benchmarks
- Key negative result showing that not all looped models reach a true fixed point, contrasting with retrofitted models
- Shows that retrofitting preserves base model inference stage structure in the cyclic blocks