{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:CQQRNELFQD5F7CVFEIZ5H6DPMY","short_pith_number":"pith:CQQRNELF","canonical_record":{"source":{"id":"2502.12529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-18T04:32:52Z","cross_cats_sorted":[],"title_canon_sha256":"3174171d3e46d70e35cb184448a61203b5936ae5671a7a5d0728b0d4f21ccdcc","abstract_canon_sha256":"a6c5934b3a2e1bd4d488b1566d4ee8a8258962b9a032badd5dec759076b4157c"},"schema_version":"1.0"},"canonical_sha256":"142116916580fa5f8aa52233d3f86f6639c21daa391e5c558802e692eea29ad2","source":{"kind":"arxiv","id":"2502.12529","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.12529","created_at":"2026-07-05T11:23:23Z"},{"alias_kind":"arxiv_version","alias_value":"2502.12529v2","created_at":"2026-07-05T11:23:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12529","created_at":"2026-07-05T11:23:23Z"},{"alias_kind":"pith_short_12","alias_value":"CQQRNELFQD5F","created_at":"2026-07-05T11:23:23Z"},{"alias_kind":"pith_short_16","alias_value":"CQQRNELFQD5F7CVF","created_at":"2026-07-05T11:23:23Z"},{"alias_kind":"pith_short_8","alias_value":"CQQRNELF","created_at":"2026-07-05T11:23:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:CQQRNELFQD5F7CVFEIZ5H6DPMY","target":"record","payload":{"canonical_record":{"source":{"id":"2502.12529","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-18T04:32:52Z","cross_cats_sorted":[],"title_canon_sha256":"3174171d3e46d70e35cb184448a61203b5936ae5671a7a5d0728b0d4f21ccdcc","abstract_canon_sha256":"a6c5934b3a2e1bd4d488b1566d4ee8a8258962b9a032badd5dec759076b4157c"},"schema_version":"1.0"},"canonical_sha256":"142116916580fa5f8aa52233d3f86f6639c21daa391e5c558802e692eea29ad2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:23.458639Z","signature_b64":"5fQhFU3I1uhhDvjTbOce6X34s+woBfctj/9ux0/QqZiyt4d0Ym8zeNFZKY1hkX0nlzCy6/xkCMRgLMoYcvd6Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"142116916580fa5f8aa52233d3f86f6639c21daa391e5c558802e692eea29ad2","last_reissued_at":"2026-07-05T11:23:23.458126Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:23.458126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2502.12529","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:23:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"okZHG/a9Ak4gdYeCtkE9M/n1kTnRgLcdxCyezyMStYMhblSuQqnPVICN9GWvdX6a5TuFiITmJg7PMZvjEASeDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:26:02.291710Z"},"content_sha256":"4af6a24265c78f305fb7191e3146158cff046056f5341a2662440a224064746b","schema_version":"1.0","event_id":"sha256:4af6a24265c78f305fb7191e3146158cff046056f5341a2662440a224064746b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:CQQRNELFQD5F7CVFEIZ5H6DPMY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Alternating Regret for Online Convex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haipeng Luo, Mengxiao Zhang, Ping Li, Soumita Hait","submitted_at":"2025-02-18T04:32:52Z","abstract_excerpt":"Motivated by alternating learning dynamics in two-player games, a recent work by Cevher et al.(2024) shows that $o(\\sqrt{T})$ alternating regret is possible for any $T$-round adversarial Online Linear Optimization (OLO) problem, and left as an open question whether the same is true for general Online Convex Optimization (OCO). We answer this question in the affirmative by showing that the continuous Hedge algorithm achieves $\\tilde{\\mathcal{O}}(d^{\\frac{2}{3}}T^{\\frac{1}{3}})$ alternating regret for any adversarial $d$-dimensional OCO problems. We show that this implies an alternating learning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12529","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2502.12529/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:23:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f8q8hVOLcl1QnR/ugbEh1VXomVbx+V15tg3OVbgkMF0nMTz9aoDrUwRnfGMSpUPrO98nvBm+D+jVefP+0PBhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:26:02.292631Z"},"content_sha256":"44a73d0ce5dfc29369f13f42c3ce1d51efec96dd224b1c5755400d45c22cead2","schema_version":"1.0","event_id":"sha256:44a73d0ce5dfc29369f13f42c3ce1d51efec96dd224b1c5755400d45c22cead2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY/bundle.json","state_url":"https://pith.science/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T09:26:02Z","links":{"resolver":"https://pith.science/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY","bundle":"https://pith.science/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY/bundle.json","state":"https://pith.science/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQQRNELFQD5F7CVFEIZ5H6DPMY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:CQQRNELFQD5F7CVFEIZ5H6DPMY","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":"a6c5934b3a2e1bd4d488b1566d4ee8a8258962b9a032badd5dec759076b4157c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-18T04:32:52Z","title_canon_sha256":"3174171d3e46d70e35cb184448a61203b5936ae5671a7a5d0728b0d4f21ccdcc"},"schema_version":"1.0","source":{"id":"2502.12529","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.12529","created_at":"2026-07-05T11:23:23Z"},{"alias_kind":"arxiv_version","alias_value":"2502.12529v2","created_at":"2026-07-05T11:23:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.12529","created_at":"2026-07-05T11:23:23Z"},{"alias_kind":"pith_short_12","alias_value":"CQQRNELFQD5F","created_at":"2026-07-05T11:23:23Z"},{"alias_kind":"pith_short_16","alias_value":"CQQRNELFQD5F7CVF","created_at":"2026-07-05T11:23:23Z"},{"alias_kind":"pith_short_8","alias_value":"CQQRNELF","created_at":"2026-07-05T11:23:23Z"}],"graph_snapshots":[{"event_id":"sha256:44a73d0ce5dfc29369f13f42c3ce1d51efec96dd224b1c5755400d45c22cead2","target":"graph","created_at":"2026-07-05T11:23:23Z","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":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.12529/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by alternating learning dynamics in two-player games, a recent work by Cevher et al.(2024) shows that $o(\\sqrt{T})$ alternating regret is possible for any $T$-round adversarial Online Linear Optimization (OLO) problem, and left as an open question whether the same is true for general Online Convex Optimization (OCO). We answer this question in the affirmative by showing that the continuous Hedge algorithm achieves $\\tilde{\\mathcal{O}}(d^{\\frac{2}{3}}T^{\\frac{1}{3}})$ alternating regret for any adversarial $d$-dimensional OCO problems. We show that this implies an alternating learning","authors_text":"Haipeng Luo, Mengxiao Zhang, Ping Li, Soumita Hait","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-18T04:32:52Z","title":"Alternating Regret for Online Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.12529","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4af6a24265c78f305fb7191e3146158cff046056f5341a2662440a224064746b","target":"record","created_at":"2026-07-05T11:23:23Z","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":"a6c5934b3a2e1bd4d488b1566d4ee8a8258962b9a032badd5dec759076b4157c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-18T04:32:52Z","title_canon_sha256":"3174171d3e46d70e35cb184448a61203b5936ae5671a7a5d0728b0d4f21ccdcc"},"schema_version":"1.0","source":{"id":"2502.12529","kind":"arxiv","version":2}},"canonical_sha256":"142116916580fa5f8aa52233d3f86f6639c21daa391e5c558802e692eea29ad2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"142116916580fa5f8aa52233d3f86f6639c21daa391e5c558802e692eea29ad2","first_computed_at":"2026-07-05T11:23:23.458126Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:23:23.458126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5fQhFU3I1uhhDvjTbOce6X34s+woBfctj/9ux0/QqZiyt4d0Ym8zeNFZKY1hkX0nlzCy6/xkCMRgLMoYcvd6Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:23:23.458639Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.12529","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4af6a24265c78f305fb7191e3146158cff046056f5341a2662440a224064746b","sha256:44a73d0ce5dfc29369f13f42c3ce1d51efec96dd224b1c5755400d45c22cead2"],"state_sha256":"6dfb76785bef7a5d62c94a19faa5cfccc0b4fa680adcd0b8c2c25b02c2e97f8e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6T3gwzS5RneIHthb4V42KgxOKYiAAdDc79WxAPKtsxFLQl69nSx7KoBRNGIItIg1oE/u4rrpyGJbLhC6X6pBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T09:26:02.299305Z","bundle_sha256":"860c8397f30ea62acfa4d4b4f8cd7c5db2484cb132fe7abfdd6afe45201f9fad"}}