{ "schema_version": 2, "title": "Reproduction: From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets", "emoji": "🎯", "space_id": "Silvestre-PO/repro-from-rashomon-theory-to-praxis-efficient-decision-tree-rashomon-sets", "paper": null, "tags": [ "icml2026-repro", "paper-Sgwd0l1u2V" ], "updated_at": "2026-07-27T22:42:15+00:00", "root": { "slug": "index", "title": "Reproduction: From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets", "file": "pages/index.md", "children": [ { "slug": "executive-summary", "title": "Executive summary", "file": "pages/executive-summary/page.md", "children": [] }, { "slug": "claim-1-polynomial-time-per-tree-theorem-3-2", "title": "Claim 1: Polynomial time per tree (Theorem 3.2)", "file": "pages/claim-1-polynomial-time-per-tree-theorem-3-2/page.md", "children": [] }, { "slug": "claim-2-linear-memory-scaling-theorem-3-4", "title": "Claim 2: Linear memory scaling (Theorem 3.4)", "file": "pages/claim-2-linear-memory-scaling-theorem-3-4/page.md", "children": [] }, { "slug": "claim-3-churn-dataset-performance", "title": "Claim 3: Churn dataset performance", "file": "pages/claim-3-churn-dataset-performance/page.md", "children": [] }, { "slug": "claim-4-higgs-dataset-scalability", "title": "Claim 4: Higgs dataset scalability", "file": "pages/claim-4-higgs-dataset-scalability/page.md", "children": [] }, { "slug": "claim-5-recall-on-22-datasets", "title": "Claim 5: Recall on 22 datasets", "file": "pages/claim-5-recall-on-22-datasets/page.md", "children": [] }, { "slug": "claim-6-trees-found-vs-resplit", "title": "Claim 6: Trees found vs RESPLIT", "file": "pages/claim-6-trees-found-vs-resplit/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": 4291, "trace_view_tokens": 10, "workspace_view_tokens": 8, "revision": "ee01f7ef1702f03cd0b8" }