{
  "schema_version": 2,
  "title": "Reproduction: A Capacity-Based Rationale for Multi-Head Attention",
  "emoji": "🎯",
  "space_id": "vimarsh/repro-a-capacity-based-rationale-for-multi-head-attention",
  "paper": {
    "arxiv_id": "2509.22840",
    "openreview_id": "rIbK1X14la",
    "title": "A Capacity-Based Rationale for Multi-Head Attention",
    "author": "Micah Adler"
  },
  "tags": [
    "icml2026-repro",
    "paper-rIbK1X14la"
  ],
  "updated_at": "2026-07-22T08:39:25+00:00",
  "root": {
    "slug": "index",
    "title": "Reproduction: A Capacity-Based Rationale for Multi-Head Attention",
    "file": "pages/index.md",
    "children": [
      {
        "slug": "executive-summary",
        "title": "Executive summary",
        "file": "pages/executive-summary/page.md",
        "children": []
      },
      {
        "slug": "claim-1-capacity-law-d-k-theta-m-log-m-2-m-d-model",
        "title": "Claim 1: Capacity law D_K = Theta(m' log(m^2/m') / d_model)",
        "file": "pages/claim-1-capacity-law-d-k-theta-m-log-m-2-m-d-model/page.md",
        "children": []
      },
      {
        "slug": "claim-2-permutation-graphs-d-k-theta-m-log-m-d-model",
        "title": "Claim 2: Permutation graphs D_K = Theta(m log m / d_model)",
        "file": "pages/claim-2-permutation-graphs-d-k-theta-m-log-m-d-model/page.md",
        "children": []
      },
      {
        "slug": "claim-3-multi-head-advantage-via-block-size-noise-n3-b",
        "title": "Claim 3: Multi-head advantage via block-size / noise N3(B)",
        "file": "pages/claim-3-multi-head-advantage-via-block-size-noise-n3-b/page.md",
        "children": []
      },
      {
        "slug": "claim-4-empirical-scaling-d-k-1-19-m-log-m-d-model",
        "title": "Claim 4: Empirical scaling D_K* ~ 1.19 m log m/d_model",
        "file": "pages/claim-4-empirical-scaling-d-k-1-19-m-log-m-d-model/page.md",
        "children": []
      },
      {
        "slug": "claim-5-advantage-persists-with-softmax-value-routing-gpt-2",
        "title": "Claim 5: Advantage persists with softmax, value routing, GPT-2",
        "file": "pages/claim-5-advantage-persists-with-softmax-value-routing-gpt-2/page.md",
        "children": []
      },
      {
        "slug": "claim-6-insensitivity-to-context-length",
        "title": "Claim 6: Insensitivity to context length",
        "file": "pages/claim-6-insensitivity-to-context-length/page.md",
        "children": []
      },
      {
        "slug": "conclusion",
        "title": "Conclusion",
        "file": "pages/conclusion/page.md",
        "children": []
      }
    ]
  },
  "traces": [],
  "workspace": {
    "file": "workspace.json",
    "file_count": 0,
    "total_size": 0,
    "bucket_id": null
  },
  "agent_view_tokens": 6874,
  "trace_view_tokens": 42060,
  "workspace_view_tokens": 27,
  "revision": "e9b4d3a13cbd53762eca",
  "traces_ref": {
    "repo_id": "vimarsh/repro-a-capacity-based-rationale-for-multi-head-attention-traces",
    "repo_type": "dataset",
    "repo_url": "https://huggingface.co/datasets/vimarsh/repro-a-capacity-based-rationale-for-multi-head-attention-traces",
    "private": true
  },
  "trace_dataset": "https://huggingface.co/datasets/vimarsh/repro-a-capacity-based-rationale-for-multi-head-attention-traces",
  "workspace_ref": {
    "repo_id": "vimarsh/repro-a-capacity-based-rationale-for-multi-head-attention-artifacts",
    "repo_type": "bucket",
    "repo_url": "https://huggingface.co/buckets/vimarsh/repro-a-capacity-based-rationale-for-multi-head-attention-artifacts",
    "private": true
  },
  "workspace_bucket": "https://huggingface.co/buckets/vimarsh/repro-a-capacity-based-rationale-for-multi-head-attention-artifacts"
}