{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:6D356UQJJTLHOHMAWDLUUNDNEX","short_pith_number":"pith:6D356UQJ","schema_version":"1.0","canonical_sha256":"f0f7df52094cd6771d80b0d74a346d25ca235213b465dfb37284b744c057c0f0","source":{"kind":"arxiv","id":"2607.25480","version":1},"attestation_state":"computed","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.25480","created_at":"2026-07-29T01:25:17.320048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.25480v1","created_at":"2026-07-29T01:25:17.320048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.25480","created_at":"2026-07-29T01:25:17.320048+00:00"},{"alias_kind":"pith_short_12","alias_value":"6D356UQJJTLH","created_at":"2026-07-29T01:25:17.320048+00:00"},{"alias_kind":"pith_short_16","alias_value":"6D356UQJJTLHOHMA","created_at":"2026-07-29T01:25:17.320048+00:00"},{"alias_kind":"pith_short_8","alias_value":"6D356UQJ","created_at":"2026-07-29T01:25:17.320048+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6D356UQJJTLHOHMAWDLUUNDNEX","json":"https://pith.science/pith/6D356UQJJTLHOHMAWDLUUNDNEX.json","graph_json":"https://pith.science/api/pith-number/6D356UQJJTLHOHMAWDLUUNDNEX/graph.json","events_json":"https://pith.science/api/pith-number/6D356UQJJTLHOHMAWDLUUNDNEX/events.json","paper":"https://pith.science/paper/6D356UQJ"},"agent_actions":{"view_html":"https://pith.science/pith/6D356UQJJTLHOHMAWDLUUNDNEX","download_json":"https://pith.science/pith/6D356UQJJTLHOHMAWDLUUNDNEX.json","view_paper":"https://pith.science/paper/6D356UQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.25480&json=true","fetch_graph":"https://pith.science/api/pith-number/6D356UQJJTLHOHMAWDLUUNDNEX/graph.json","fetch_events":"https://pith.science/api/pith-number/6D356UQJJTLHOHMAWDLUUNDNEX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6D356UQJJTLHOHMAWDLUUNDNEX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6D356UQJJTLHOHMAWDLUUNDNEX/action/storage_attestation","attest_author":"https://pith.science/pith/6D356UQJJTLHOHMAWDLUUNDNEX/action/author_attestation","sign_citation":"https://pith.science/pith/6D356UQJJTLHOHMAWDLUUNDNEX/action/citation_signature","submit_replication":"https://pith.science/pith/6D356UQJJTLHOHMAWDLUUNDNEX/action/replication_record"}},"created_at":"2026-07-29T01:25:17.320048+00:00","updated_at":"2026-07-29T01:25:17.320048+00:00"}