logbook.json

{
  "schema_version": 1,
  "title": "Reproduction: CAffNet: Hard Constraint-Affine Neural Networks",
  "emoji": "🔗",
  "space_id": "SabaPivot/repro-caffnet",
  "paper": {
    "arxiv_id": "2605.24437",
    "openreview_id": "20hdQQQrA4"
  },
  "tags": [
    "icml2026-repro",
    "paper-20hdQQQrA4"
  ],
  "updated_at": "2026-07-29T08:38:02.106052+00:00",
  "root": {
    "slug": "index",
    "title": "Reproduction: CAffNet: Hard Constraint-Affine Neural Networks",
    "file": "pages/index.md",
    "children": [
      {
        "slug": "executive-summary",
        "title": "Executive summary",
        "file": "pages/executive-summary/page.md",
        "children": []
      },
      {
        "slug": "claim-5-claim-c3-constraint",
        "title": "Claim 3 — Provable constraint adherence",
        "file": "pages/claim-5-claim-c3-constraint/page.md",
        "children": []
      },
      {
        "slug": "claim-6-methods-environment",
        "title": "Methods & environment",
        "file": "pages/claim-6-methods-environment/page.md",
        "children": []
      },
      {
        "slug": "claim-7-negative-controls",
        "title": "Negative controls",
        "file": "pages/claim-7-negative-controls/page.md",
        "children": []
      },
      {
        "slug": "claim-8-claim-caffnet-hard",
        "title": "CAffNet: hard affine constraints + universal approximation",
        "file": "pages/claim-8-claim-caffnet-hard/page.md",
        "children": []
      },
      {
        "slug": "claim-4-control",
        "title": "CAffNet safety-critical control (claim 4)",
        "file": "pages/claim-4-control/page.md",
        "children": []
      },
      {
        "slug": "claim-9-claim-hardnet-unicycle-control",
        "title": "Claim 5 — named HardNet baseline on the paper's unicycle task",
        "file": "pages/claim-9-claim-hardnet-unicycle-control/page.md",
        "children": []
      },
      {
        "slug": "claim-10-claim-theorem35-exact-bound",
        "title": "Theorem 3.5 — exact universal-approximation bound",
        "file": "pages/claim-10-claim-theorem35-exact-bound/page.md",
        "children": []
      },
      {
        "slug": "claim-1",
        "title": "Claim 1 — Arbitrary-cardinality hard constraints",
        "file": "pages/claim-1/page.md",
        "children": []
      },
      {
        "slug": "claim-2",
        "title": "Claim 2 — Joint null-space optimization",
        "file": "pages/claim-2/page.md",
        "children": []
      },
      {
        "slug": "claim-3",
        "title": "Claim 3 — Universal approximation and adherence",
        "file": "pages/claim-3/page.md",
        "children": []
      },
      {
        "slug": "claim-11-paper-scale-caffnet-tf-benchmark",
        "title": "Claim 4 — paper-scale CAffNet-TF benchmark",
        "file": "pages/claim-11-paper-scale-caffnet-tf-benchmark/page.md",
        "children": []
      },
      {
        "slug": "conclusion",
        "title": "Conclusion",
        "file": "pages/conclusion/page.md",
        "children": []
      }
    ]
  },
  "agent_view_tokens": 1368,
  "revision": "1784740758000"
}