logbook.json

{
  "schema_version": 1,
  "title": "Repro - Exact and Approximate Algorithms for Polytree Learning",
  "emoji": "🎯",
  "space_id": "arvkevi/polytree-learning-repro",
  "paper": {
    "arxiv_id": "2605.03622",
    "openreview_id": "QIBu6vtRMI",
    "title": "Exact and Approximate Algorithms for Polytree Learning"
  },
  "tags": [
    "icml2026-repro",
    "paper-QIBu6vtRMI"
  ],
  "updated_at": "2026-07-19T00:45:32+00:00",
  "root": {
    "slug": "index",
    "title": "Repro - Exact and Approximate Algorithms for Polytree Learning",
    "file": "pages/index.md",
    "children": [
      {
        "slug": "conclusion",
        "title": "Conclusion",
        "file": "pages/conclusion/page.md",
        "children": []
      },
      {
        "slug": "00-judge-first-scorecard",
        "title": "00 Judge-first scorecard",
        "file": "pages/00-judge-first-scorecard/page.md",
        "children": []
      },
      {
        "slug": "claims-1-2-exact-runtime-improvement",
        "title": "Claims 1-2: exact runtime improvement",
        "file": "pages/claims-1-2-exact-runtime-improvement/page.md",
        "children": []
      },
      {
        "slug": "claim-3-polynomial-approximations",
        "title": "Claim 3: polynomial approximations",
        "file": "pages/claim-3-polynomial-approximations/page.md",
        "children": []
      }
    ]
  },
  "agent_view_tokens": 3068,
  "revision": "1784421932686937000"
}