finding
active
finding:eqr-generated-maze-solution-path-lengths-vary-between-101-169-stepsEqR generated maze solution path lengths vary between 101–169 steps
Methodological detail characterizing maze task difficulty range.
Source paper
extracted_from(2026) · Jeffrey Lai · Anthony Bao · J. Quinn · William Gilpin
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.
- Methodological detail characterizing the maze task-instance distribution used.
- Quantifies extreme redundancy in transformer routing; supports claim that introspection and interference patterns are architecturally permitted.
- Evidence that reasoning length does not track safety performance
- Cross-domain realignment is effective but less complete than in-domain realignment
- Alexander's striking quantification of the rarity of good sequences, underscoring why finding the right order is so difficult and precious.
- 30 meters of cuts per square meter × 8,000 m².
- Evidence that FPRM-Maze basins are true (scale-free) fractals, contrasting with EqR-Sudoku's slim fractal.
- Key empirical result showing that optimizing for behavioral outputs and fitting representation geometry produce the same path in activation space.