Spaces:
Running
Running
| { | |
| "schema_version": 1, | |
| "title": "Repro - Mixtures Closest To A Given Measure: A Semidefinite Programming Approach", | |
| "emoji": "\ud83d\udd2c", | |
| "space_id": "bertfil/0JDzkrKzaA", | |
| "paper": { | |
| "arxiv_id": "2509.22879", | |
| "openreview_id": "0JDzkrKzaA", | |
| "title": "Mixtures Closest To A Given Measure: A Semidefinite Programming Approach", | |
| "url": "https://arxiv.org/abs/2509.22879" | |
| }, | |
| "tags": [ | |
| "icml2026-repro", | |
| "paper-0JDzkrKzaA" | |
| ], | |
| "updated_at": "2026-07-20T03:52:36+00:00", | |
| "root": { | |
| "slug": "index", | |
| "title": "Repro - Mixtures Closest To A Given Measure: A Semidefinite Programming Approach", | |
| "file": "pages/index.md", | |
| "children": [ | |
| { | |
| "slug": "00-scored-evidence-summary", | |
| "title": "00 - Scored evidence summary", | |
| "file": "pages/00-scored-evidence-summary/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "claim-1-theorem-3-2-gives-the-analogous-flat-extension-ran", | |
| "title": "Claim 1 - Theorem 3.2 gives the analogous flat-extension rank conditio\u2026", | |
| "file": "pages/claim-1-theorem-3-2-gives-the-analogous-flat-extension-ran/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "claim-2-on-mnist-digit-subsets-0-1-and-0-1-2-reduced-to-2", | |
| "title": "Claim 2 - On MNIST digit subsets {0,1} and {0,1,2} reduced to 2 princi\u2026", | |
| "file": "pages/claim-2-on-mnist-digit-subsets-0-1-and-0-1-2-reduced-to-2/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "claim-3-for-randomly-generated-gaussian-mixtures-in-r-2-wi", | |
| "title": "Claim 3 - For randomly generated Gaussian mixtures in R^2 with K=5 com\u2026", | |
| "file": "pages/claim-3-for-randomly-generated-gaussian-mixtures-in-r-2-wi/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "claim-4-assembling-and-solving-the-sdp-relaxation-at-order", | |
| "title": "Claim 4 - Assembling and solving the SDP relaxation at order d=4 takes\u2026", | |
| "file": "pages/claim-4-assembling-and-solving-the-sdp-relaxation-at-order/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "reproduction-protocol-and-provenance", | |
| "title": "Reproduction protocol and provenance", | |
| "file": "pages/reproduction-protocol-and-provenance/page.md", | |
| "children": [] | |
| }, | |
| { | |
| "slug": "conclusion", | |
| "title": "Conclusion", | |
| "file": "pages/conclusion/page.md", | |
| "children": [] | |
| } | |
| ] | |
| }, | |
| "agent_view_tokens": 7937, | |
| "revision": "1784519556437288400" | |
| } |