logbook.json

{
  "schema_version": 1,
  "title": "Repro - FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPU",
  "emoji": "\ud83d\udd2c",
  "space_id": "bertfil/VzIA4MASxK",
  "paper": {
    "arxiv_id": "2602.03067",
    "openreview_id": "VzIA4MASxK",
    "title": "FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPU",
    "url": "https://arxiv.org/abs/2602.03067"
  },
  "tags": [
    "icml2026-repro",
    "paper-VzIA4MASxK"
  ],
  "updated_at": "2026-07-20T03:52:33+00:00",
  "root": {
    "slug": "index",
    "title": "Repro - FlashSinkhorn: IO-Aware Entropic Optimal Transport on GPU",
    "file": "pages/index.md",
    "children": [
      {
        "slug": "00-scored-evidence-summary",
        "title": "00 - Scored evidence summary",
        "file": "pages/00-scored-evidence-summary/page.md",
        "children": []
      },
      {
        "slug": "claim-1-flashsinkhorn-achieves-up-to-32x-forward-pass-spee",
        "title": "Claim 1 - FlashSinkhorn achieves up to 32x forward-pass speedup and up\u2026",
        "file": "pages/claim-1-flashsinkhorn-achieves-up-to-32x-forward-pass-spee/page.md",
        "children": []
      },
      {
        "slug": "claim-2-flashsinkhorn-is-compared-against-geomloss-tensori",
        "title": "Claim 2 - FlashSinkhorn is compared against GeomLoss (tensorized and K\u2026",
        "file": "pages/claim-2-flashsinkhorn-is-compared-against-geomloss-tensori/page.md",
        "children": []
      },
      {
        "slug": "claim-3-at-n-m-10-000-and-d-64-flashsinkhorn-reduces-hbm-t",
        "title": "Claim 3 - At n=m=10,000 and d=64, FlashSinkhorn reduces HBM traffic to\u2026",
        "file": "pages/claim-3-at-n-m-10-000-and-d-64-flashsinkhorn-reduces-hbm-t/page.md",
        "children": []
      },
      {
        "slug": "claim-4-theorem-2-establishes-flashsinkhorn-s-theoretical",
        "title": "Claim 4 - Theorem 2 establishes FlashSinkhorn's theoretical IO complex\u2026",
        "file": "pages/claim-4-theorem-2-establishes-flashsinkhorn-s-theoretical/page.md",
        "children": []
      },
      {
        "slug": "claim-5-on-the-otdd-optimal-transport-dataset-distance-dow",
        "title": "Claim 5 - On the OTDD (Optimal Transport Dataset Distance) downstream \u2026",
        "file": "pages/claim-5-on-the-otdd-optimal-transport-dataset-distance-dow/page.md",
        "children": []
      },
      {
        "slug": "claim-6-for-hessian-vector-products-used-in-ot-based-shuff",
        "title": "Claim 6 - For Hessian-vector products used in OT-based shuffled regres\u2026",
        "file": "pages/claim-6-for-hessian-vector-products-used-in-ot-based-shuff/page.md",
        "children": []
      },
      {
        "slug": "reproduction-protocol-and-provenance",
        "title": "Reproduction protocol and provenance",
        "file": "pages/reproduction-protocol-and-provenance/page.md",
        "children": []
      },
      {
        "slug": "conclusion",
        "title": "Conclusion",
        "file": "pages/conclusion/page.md",
        "children": []
      }
    ]
  },
  "agent_view_tokens": 9355,
  "revision": "1784519553814928200"
}