finding
active
finding:information-paths-from-a-to-b-can-exceed-c-m-n-n-distinct-routes-where-m-position-displacement-and-n-layer-displacement

Information paths from A to B can exceed C(m+n, n) distinct routes, where m=position displacement and n=layer displacement.

Quantifies extreme redundancy in transformer routing; supports claim that introspection and interference patterns are architecturally permitted.

Neighborhood — ranked by edge-count

Claims (2)

claim

Communities (3)

community

Artifacts (1)

artifact

Findings (1)

finding

Related by similarity (8)

cosine ≥ 0.65 · no typed edge

Entities in the same semantic neighborhood but without a typed relation to this one — candidates for new edges or unrecognized duplicates.