{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6D356UQJJTLHOHMAWDLUUNDNEX","short_pith_number":"pith:6D356UQJ","canonical_record":{"source":{"id":"2607.25480","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-28T09:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"4925d5f759443fb0e6f0140362e9482285b1978fb26ad0953a5fcdc6dbb8900a","abstract_canon_sha256":"a747763b621a977307e9e40b91e9a12dc0ea945bab38e0ed718cf249807e7e16"},"schema_version":"1.0"},"canonical_sha256":"f0f7df52094cd6771d80b0d74a346d25ca235213b465dfb37284b744c057c0f0","source":{"kind":"arxiv","id":"2607.25480","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.25480","created_at":"2026-07-29T01:25:17Z"},{"alias_kind":"arxiv_version","alias_value":"2607.25480v1","created_at":"2026-07-29T01:25:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25480","created_at":"2026-07-29T01:25:17Z"},{"alias_kind":"pith_short_12","alias_value":"6D356UQJJTLH","created_at":"2026-07-29T01:25:17Z"},{"alias_kind":"pith_short_16","alias_value":"6D356UQJJTLHOHMA","created_at":"2026-07-29T01:25:17Z"},{"alias_kind":"pith_short_8","alias_value":"6D356UQJ","created_at":"2026-07-29T01:25:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6D356UQJJTLHOHMAWDLUUNDNEX","target":"record","payload":{"canonical_record":{"source":{"id":"2607.25480","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-28T09:13:00Z","cross_cats_sorted":[],"title_canon_sha256":"4925d5f759443fb0e6f0140362e9482285b1978fb26ad0953a5fcdc6dbb8900a","abstract_canon_sha256":"a747763b621a977307e9e40b91e9a12dc0ea945bab38e0ed718cf249807e7e16"},"schema_version":"1.0"},"canonical_sha256":"f0f7df52094cd6771d80b0d74a346d25ca235213b465dfb37284b744c057c0f0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-29T01:25:17.320451Z","signature_b64":"Tr6fLmznm3n3fSBjkvpdflORRz45Kd8yzuOAz55QHsql8foU03a1puM5idYtDUCkDH2c6K8rGgPgCNmHNu5gCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f0f7df52094cd6771d80b0d74a346d25ca235213b465dfb37284b744c057c0f0","last_reissued_at":"2026-07-29T01:25:17.319624Z","signature_status":"signed_v1","first_computed_at":"2026-07-29T01:25:17.319624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.25480","source_version":1,"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-29T01:25:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"68HPi+CqZvE++KT/yFCNdjuJ9l6yUUBHbYfyg0NTvSi/Fe343W7ROenYiWXN4qOEKdU7jOKh82agtlOqXnh9Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T21:39:26.808821Z"},"content_sha256":"06fd5497da9a84abfda033eab233b0df87dba7a0673e925cfb4aef8442cb88c1","schema_version":"1.0","event_id":"sha256:06fd5497da9a84abfda033eab233b0df87dba7a0673e925cfb4aef8442cb88c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6D356UQJJTLHOHMAWDLUUNDNEX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Wentao Zhang","submitted_at":"2026-07-28T09:13:00Z","abstract_excerpt":"Constrained online convex optimization requires minimizing regret against adversarial convex costs while satisfying a convex constraint at every round, as needed in safety-critical applications. A computationally efficient method combines online gradient descent with a Polyak feasibility step, using one constraint evaluation and one subgradient per round. Although this method achieves O(sqrt(T)) regret with per-round feasibility, we derive a tighter, data-dependent analysis by retaining two quantities omitted by the standard worst-case argument. First, we replace the gradient envelope G_f^2 T "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25480","kind":"arxiv","version":1},"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/2607.25480/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-29T01:25:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5AWNu4r4Q02aAoT5EGoy+16tyvw+SZOjjwWOMCoskzv9RGisr5FSYL4r0IXm8ia+znweaoayteE2nBzzGHgUDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T21:39:26.809118Z"},"content_sha256":"bbc7f2612c343b74f1ed5348d77966fc499b10ec3f3e7d06bbd0b87db95a27c1","schema_version":"1.0","event_id":"sha256:bbc7f2612c343b74f1ed5348d77966fc499b10ec3f3e7d06bbd0b87db95a27c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6D356UQJJTLHOHMAWDLUUNDNEX/bundle.json","state_url":"https://pith.science/pith/6D356UQJJTLHOHMAWDLUUNDNEX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6D356UQJJTLHOHMAWDLUUNDNEX/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-01T21:39:26Z","links":{"resolver":"https://pith.science/pith/6D356UQJJTLHOHMAWDLUUNDNEX","bundle":"https://pith.science/pith/6D356UQJJTLHOHMAWDLUUNDNEX/bundle.json","state":"https://pith.science/pith/6D356UQJJTLHOHMAWDLUUNDNEX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6D356UQJJTLHOHMAWDLUUNDNEX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6D356UQJJTLHOHMAWDLUUNDNEX","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":"a747763b621a977307e9e40b91e9a12dc0ea945bab38e0ed718cf249807e7e16","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-28T09:13:00Z","title_canon_sha256":"4925d5f759443fb0e6f0140362e9482285b1978fb26ad0953a5fcdc6dbb8900a"},"schema_version":"1.0","source":{"id":"2607.25480","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.25480","created_at":"2026-07-29T01:25:17Z"},{"alias_kind":"arxiv_version","alias_value":"2607.25480v1","created_at":"2026-07-29T01:25:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25480","created_at":"2026-07-29T01:25:17Z"},{"alias_kind":"pith_short_12","alias_value":"6D356UQJJTLH","created_at":"2026-07-29T01:25:17Z"},{"alias_kind":"pith_short_16","alias_value":"6D356UQJJTLHOHMA","created_at":"2026-07-29T01:25:17Z"},{"alias_kind":"pith_short_8","alias_value":"6D356UQJ","created_at":"2026-07-29T01:25:17Z"}],"graph_snapshots":[{"event_id":"sha256:bbc7f2612c343b74f1ed5348d77966fc499b10ec3f3e7d06bbd0b87db95a27c1","target":"graph","created_at":"2026-07-29T01:25:17Z","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/2607.25480/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Constrained online convex optimization requires minimizing regret against adversarial convex costs while satisfying a convex constraint at every round, as needed in safety-critical applications. A computationally efficient method combines online gradient descent with a Polyak feasibility step, using one constraint evaluation and one subgradient per round. Although this method achieves O(sqrt(T)) regret with per-round feasibility, we derive a tighter, data-dependent analysis by retaining two quantities omitted by the standard worst-case argument. First, we replace the gradient envelope G_f^2 T ","authors_text":"Wentao Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-28T09:13:00Z","title":"Data-Dependent Regret and Polyak Corrections for Constrained Online Convex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.25480","kind":"arxiv","version":1},"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:06fd5497da9a84abfda033eab233b0df87dba7a0673e925cfb4aef8442cb88c1","target":"record","created_at":"2026-07-29T01:25:17Z","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":"a747763b621a977307e9e40b91e9a12dc0ea945bab38e0ed718cf249807e7e16","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-28T09:13:00Z","title_canon_sha256":"4925d5f759443fb0e6f0140362e9482285b1978fb26ad0953a5fcdc6dbb8900a"},"schema_version":"1.0","source":{"id":"2607.25480","kind":"arxiv","version":1}},"canonical_sha256":"f0f7df52094cd6771d80b0d74a346d25ca235213b465dfb37284b744c057c0f0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f0f7df52094cd6771d80b0d74a346d25ca235213b465dfb37284b744c057c0f0","first_computed_at":"2026-07-29T01:25:17.319624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-29T01:25:17.319624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tr6fLmznm3n3fSBjkvpdflORRz45Kd8yzuOAz55QHsql8foU03a1puM5idYtDUCkDH2c6K8rGgPgCNmHNu5gCw==","signature_status":"signed_v1","signed_at":"2026-07-29T01:25:17.320451Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.25480","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06fd5497da9a84abfda033eab233b0df87dba7a0673e925cfb4aef8442cb88c1","sha256:bbc7f2612c343b74f1ed5348d77966fc499b10ec3f3e7d06bbd0b87db95a27c1"],"state_sha256":"a23ee0256e75228fd2db22c771477bf0aad802eb5103565da6aa28603e9d24e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EAaO7FFEv2yqALSVayAjjslKC9vRKxCZ2MTyzPFeII9k5maCYDfrJyt9cAmUhzN0NFkyXK1zHo72MAo7v+BkCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T21:39:26.811702Z","bundle_sha256":"e60cb84b324ab8959fd6a4f75fa3dea9a99d3d5d459a9f5d4fa4bec2ff239e79"}}