Spaces:
Running
Running
File size: 1,437 Bytes
6b87be1 400ceb4 6b87be1 3679f2c bee60dc 3679f2c 6b87be1 531e9ee 400ceb4 6b87be1 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 | {
"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"
} |