FloorIsAwake/repro-networked-information-aggregation-binary-classification
0
1{2 "schema_version": 1,3 "title": "Repro - Networked Information Aggregation for Binary Classification",4 "emoji": "🎯",5 "space_id": "FloorIsAwake/repro-networked-information-aggregation-binary-classification",6 "paper": {7 "arxiv_id": "2605.01082",8 "openreview_id": "mrtg4NmvAe",9 "icml_paper_number": "30204"10 },11 "tags": [12 "icml2026-repro",13 "paper-mrtg4NmvAe"14 ],15 "updated_at": "2026-07-16T12:56:04+00:00",16 "root": {17 "slug": "index",18 "title": "Repro - Networked Information Aggregation for Binary Classification",19 "file": "pages/index.md",20 "children": [21 {22 "slug": "sources-and-methodology",23 "title": "Sources and methodology",24 "file": "pages/sources-and-methodology/page.md",25 "children": []26 },27 {28 "slug": "claim-1-upper-bound-under-m-coverage",29 "title": "Claim 1 - Upper bound under M-coverage",30 "file": "pages/claim-1-upper-bound-under-m-coverage/page.md",31 "children": []32 },33 {34 "slug": "claim-2-lower-bound-k-over-d",35 "title": "Claim 2 - Lower bound k over D",36 "file": "pages/claim-2-lower-bound-k-over-d/page.md",37 "children": []38 },39 {40 "slug": "claim-3-bce-residual-orthogonality",41 "title": "Claim 3 - BCE residual orthogonality",42 "file": "pages/claim-3-bce-residual-orthogonality/page.md",43 "children": []44 },45 {46 "slug": "claim-4-bce-kl-decomposition",47 "title": "Claim 4 - BCE KL decomposition",48 "file": "pages/claim-4-bce-kl-decomposition/page.md",49 "children": []50 },51 {52 "slug": "claim-5-sequential-logit-protocol",53 "title": "Claim 5 - Sequential logit protocol",54 "file": "pages/claim-5-sequential-logit-protocol/page.md",55 "children": []56 },57 {58 "slug": "conclusion",59 "title": "Conclusion",60 "file": "pages/conclusion/page.md",61 "children": []62 }63 ]64 },65 "agent_view_tokens": 4303,66 "revision": "1784206564802483543"67}