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

{
  "doc": "janus-information-flow-transformers-2025.md",
  "author": null,
  "context": "Quantifies extreme redundancy in transformer routing; supports claim that introspection and interference patterns are architecturally permitted.",
  "enrichment": {
    "is_stale": true
  },
  "norm_label": "Information paths from A to B can exceed C(m+n, n) distinct routes, where m=position displacement and n=layer displacement.",
  "source_url": null,
  "graphify_id": "exponential_path_combinatorics",
  "source_file": "janus-information-flow-transformers-2025.md",
  "imported_from": "/Users/antonborzov/Documents/Research.nosync/papers/extract_typed_out/janus-information-flow-transformers-2025/graph.json",
  "extracted_type": "finding",
  "graphify_file_type": "finding"
}