File size: 2,056 Bytes
2e4b051 | 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 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 | {
"schema_version": 2,
"title": "Reproduction: Networked Information Aggregation for Binary Classification",
"emoji": "🧠",
"space_id": "amkkk/repro-networked-information-aggregation-for-binary-classification",
"paper": null,
"tags": [
"icml2026-repro",
"paper-mrtg4NmvAe"
],
"updated_at": "2026-07-30T08:25:32+00:00",
"root": {
"slug": "index",
"title": "Reproduction: Networked Information Aggregation for Binary Classification",
"file": "pages/index.md",
"children": [
{
"slug": "executive-summary",
"title": "Executive summary",
"file": "pages/executive-summary/page.md",
"children": []
},
{
"slug": "claim-1-theorem37",
"title": "Claim 1: Theorem 3.7 Upper Bound",
"file": "pages/claim-1-theorem37/page.md",
"children": []
},
{
"slug": "claim-2-theorem45",
"title": "Claim 2: Theorem 4.5 Lower Bound",
"file": "pages/claim-2-theorem45/page.md",
"children": []
},
{
"slug": "claim-3-lemma31",
"title": "Claim 3: Lemma 3.1 Orthogonality",
"file": "pages/claim-3-lemma31/page.md",
"children": []
},
{
"slug": "claim-4-lemma33",
"title": "Claim 4: Lemma 3.3 KL Decomposition",
"file": "pages/claim-4-lemma33/page.md",
"children": []
},
{
"slug": "claim-5-protocol",
"title": "Claim 5: Section 2 Protocol",
"file": "pages/claim-5-protocol/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": 937,
"trace_view_tokens": 10,
"workspace_view_tokens": 8,
"revision": "8f12099e5e2c94b8c3b8"
} |