{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:VWHAPZQEUJIFUGXY3J2ZRWPDL3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2bd5c554aaed882da16bc7c405b6f38fcf0fe19e6f5d38538647c457e94923a4","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T15:45:44Z","title_canon_sha256":"2512ee722e47d0a2da1d88542986a6fd89094c0a96bcc67bf7ebed7486cd980c"},"schema_version":"1.0","source":{"id":"2605.13692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13692","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13692v1","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13692","created_at":"2026-05-18T02:44:16Z"},{"alias_kind":"pith_short_12","alias_value":"VWHAPZQEUJIF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"VWHAPZQEUJIFUGXY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"VWHAPZQE","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:e8836417dd390128d1b8a0b7917bdb2f1dbeaffc80d5f4e4e04f2cff1319eed0","target":"graph","created_at":"2026-05-18T02:44:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Under full information feedback and fixed partition assumptions, Regret_T = Θ(√((1+RS_T) T log V_max)) where RS_T is the number of region switches and V_max the maximum vertices per region."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The fixed partition assumptions together with full information feedback that keep the polyhedral structure stable enough for the region-switch counting argument to apply."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Regret in polyhedral online convex optimization equals Θ(√((1+RS_T) T log V_max)) where RS_T counts active region switches."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Regret in online learning over combinatorial actions scales with the square root of the number of polyhedral region switches."}],"snapshot_sha256":"9f1c6338b69d758c5b6aaded767a145672f40bd0dafaa648f8d2a59f19b2aa29"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Many online decision problems over combinatorial actions are addressed via convex relaxations, leading to online convex optimization with piecewise linear objectives and induced polyhedral structure. We show that regret in such problems is governed by \\emph{polyhedral instability}: the number of changes of the active region. Under full information feedback and fixed partition assumptions, if $\\mathrm{RS}_T$ denotes the number of region switches and $V_{\\max}$ the maximum number of vertices per region, we prove $\\Regret_T= \\Theta(\\sqrt{(1+\\mathrm{RS}_T)\\,T\\,\\log V_{\\max}})$ interpolating betwee","authors_text":"Basel Alomair, Bhaskar Ramasubramanian, Fengqing Jiang, Kaiyuan Zheng, Linda Bushnell, Luyao Niu, Radha Poovendran, Yichen Feng, Yuetai Li","cross_cats":["cs.CC"],"headline":"Regret in online learning over combinatorial actions scales with the square root of the number of polyhedral region switches.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T15:45:44Z","title":"Polyhedral Instability Governs Regret in Online Learning"},"references":{"count":19,"internal_anchors":0,"resolved_work":19,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Bartlett, Alexander Rakhlin, and Ambuj Tewari","work_id":"51d4458e-3da8-4ac1-83e1-620589faa845","year":2008},{"cited_arxiv_id":"","doi":"10.1287/moor","is_internal_anchor":false,"ref_index":2,"title":"Regret in online combinatorial optimization.Mathematics of Operations Research, 39(1):31–45, 2014","work_id":"37f976a9-5a3f-40e1-99ef-c267a03e3d0c","year":2014},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Adaptively tracking the best bandit arm with an unknown number of distribution changes","work_id":"64269c26-e336-4022-9289-c6ffe1b3fc09","year":2019},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Learning with submodular functions: A convex optimization perspective","work_id":"51d8ad96-7c19-47e9-a098-b89d457d42ab","year":2013},{"cited_arxiv_id":"","doi":"10.1016/j.jcss.2012.01.001","is_internal_anchor":false,"ref_index":5,"title":"Combinatorial bandits.Journal of Computer and System Sciences, 78(5):1404–1422, 2012","work_id":"09fdb3a2-81da-45a5-9210-3e3318b27a1a","year":2012}],"snapshot_sha256":"1c36cb529e1f27f3d7253cf1a61b556531eb01af20952de7919247245f948a06"},"source":{"id":"2605.13692","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T20:17:34.702884Z","id":"f8a912e4-de47-4f03-934e-41f8f5916431","model_set":{"reader":"grok-4.3"},"one_line_summary":"Regret in polyhedral online convex optimization equals Θ(√((1+RS_T) T log V_max)) where RS_T counts active region switches.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Regret in online learning over combinatorial actions scales with the square root of the number of polyhedral region switches.","strongest_claim":"Under full information feedback and fixed partition assumptions, Regret_T = Θ(√((1+RS_T) T log V_max)) where RS_T is the number of region switches and V_max the maximum vertices per region.","weakest_assumption":"The fixed partition assumptions together with full information feedback that keep the polyhedral structure stable enough for the region-switch counting argument to apply."}},"verdict_id":"f8a912e4-de47-4f03-934e-41f8f5916431"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:82ede39ceddc3e9a022ebd6757f5b077e77c143756c020de326b3815b296ec4b","target":"record","created_at":"2026-05-18T02:44:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2bd5c554aaed882da16bc7c405b6f38fcf0fe19e6f5d38538647c457e94923a4","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-13T15:45:44Z","title_canon_sha256":"2512ee722e47d0a2da1d88542986a6fd89094c0a96bcc67bf7ebed7486cd980c"},"schema_version":"1.0","source":{"id":"2605.13692","kind":"arxiv","version":1}},"canonical_sha256":"ad8e07e604a2505a1af8da7598d9e35ee93b46a005f80a9820847bae41e2582a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad8e07e604a2505a1af8da7598d9e35ee93b46a005f80a9820847bae41e2582a","first_computed_at":"2026-05-18T02:44:16.937093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:16.937093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q96wd8Q6HrnOpjza1DOq8YSy+aLZFqli947unCHxMkg7DSsOeAIV+9EO5WkOD+QZ3lEkjQ317mEyspnsC2SqCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:16.937689Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82ede39ceddc3e9a022ebd6757f5b077e77c143756c020de326b3815b296ec4b","sha256:e8836417dd390128d1b8a0b7917bdb2f1dbeaffc80d5f4e4e04f2cff1319eed0"],"state_sha256":"4438b60e93d702010891cebc96f4e3a456028c17aea4f4550c1884094533f9b5"}