{ "schema_version": 1, "title": "Repro - Learning-Augmented Online Covering Problems", "emoji": "🎯", "space_id": "agharsallah/vbty65z76c-logbook", "paper": { "arxiv_id": null, "openreview_id": "vbty65Z76C", "icml_id": "60886", "title": "Learning-Augmented Online Covering Problems", "forum": "https://openreview.net/forum?id=vbty65Z76C" }, "tags": [ "icml2026-repro", "paper-vbty65Z76C" ], "updated_at": "2026-07-22T19:28:19+00:00", "root": { "slug": "index", "title": "Repro - Learning-Augmented Online Covering Problems", "file": "pages/index.md", "children": [ { "slug": "overview-method", "title": "Overview & Method", "file": "pages/overview-method/page.md", "children": [] }, { "slug": "claim-1-theorem-1-shows-any-online-covering-algorith", "title": "Claim 1: Theorem 1 shows any online covering algorith", "file": "pages/claim-1-theorem-1-shows-any-online-covering-algorith/page.md", "children": [] }, { "slug": "claim-2-theorem-2-shows-that-given-a-polynomial-time", "title": "Claim 2: Theorem 2 shows that given a polynomial-time", "file": "pages/claim-2-theorem-2-shows-that-given-a-polynomial-time/page.md", "children": [] }, { "slug": "claim-3-for-set-cover-and-non-metric-facility-locati", "title": "Claim 3: For set cover and non-metric facility locati", "file": "pages/claim-3-for-set-cover-and-non-metric-facility-locati/page.md", "children": [] }, { "slug": "claim-4-for-metric-facility-location-theorem-10-ach", "title": "Claim 4: For metric facility location, Theorem 10 ach", "file": "pages/claim-4-for-metric-facility-location-theorem-10-ach/page.md", "children": [] }, { "slug": "claim-5-for-steiner-tree-theorem-12-achieves-compet", "title": "Claim 5: For Steiner tree, Theorem 12 achieves compet", "file": "pages/claim-5-for-steiner-tree-theorem-12-achieves-compet/page.md", "children": [] }, { "slug": "conclusion", "title": "Conclusion", "file": "pages/conclusion/page.md", "children": [] } ] }, "agent_view_tokens": 4669, "revision": "1784748499125993000" }