{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:C4YBYFDQ2MQBGR5RC64OVUVTRI","short_pith_number":"pith:C4YBYFDQ","schema_version":"1.0","canonical_sha256":"17301c1470d3201347b117b8ead2b38a1269844e4fcb8dc605bca3e9d2ee6acf","source":{"kind":"arxiv","id":"2607.10808","version":1},"attestation_state":"computed","paper":{"title":"Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haricharan Balasundaram, Karthick Krishna Mahendran, Rahul Vaze","submitted_at":"2026-07-12T15:36:04Z","abstract_excerpt":"The problem of constrained online convex optimization is considered, where at each round, once a learner commits to an action $x_t \\in \\mathcal{X} \\subset \\mathbb{R}^d$, a convex loss function $f_t$ and a convex constraint function $g_t$ that drives the constraint $g_t(x)\\le 0$ are revealed. The objective is to simultaneously minimize the static regret and cumulative constraint violation (CCV) compared to the benchmark that knows the loss functions and constraint functions $f_t$ and $g_t$ for all $t$ ahead of time, and chooses a static optimal action that is feasible with respect to all $g_t(x"},"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.10808","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-12T15:36:04Z","cross_cats_sorted":[],"title_canon_sha256":"a00482aedbd2ad98d4427348ea30cf0dbc0fd4398eade6f7d2ca3e6466cefb07","abstract_canon_sha256":"6d4d0e639045f8bb0804ccaf444803c38df101d1cedf3b1d2921ded253755527"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:21:41.320391Z","signature_b64":"Z0v7gXQQ8coxzBoHTEBa6qCq/zmnr2KW2LOBMXDqf9izlSGZdQnDqhxjN7zrOFz7ymw9OIP9KIlJhJzndVjSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17301c1470d3201347b117b8ead2b38a1269844e4fcb8dc605bca3e9d2ee6acf","last_reissued_at":"2026-07-14T01:21:41.319519Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:21:41.319519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO)","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haricharan Balasundaram, Karthick Krishna Mahendran, Rahul Vaze","submitted_at":"2026-07-12T15:36:04Z","abstract_excerpt":"The problem of constrained online convex optimization is considered, where at each round, once a learner commits to an action $x_t \\in \\mathcal{X} \\subset \\mathbb{R}^d$, a convex loss function $f_t$ and a convex constraint function $g_t$ that drives the constraint $g_t(x)\\le 0$ are revealed. The objective is to simultaneously minimize the static regret and cumulative constraint violation (CCV) compared to the benchmark that knows the loss functions and constraint functions $f_t$ and $g_t$ for all $t$ ahead of time, and chooses a static optimal action that is feasible with respect to all $g_t(x"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10808","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.10808/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.10808","created_at":"2026-07-14T01:21:41.319977+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.10808v1","created_at":"2026-07-14T01:21:41.319977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10808","created_at":"2026-07-14T01:21:41.319977+00:00"},{"alias_kind":"pith_short_12","alias_value":"C4YBYFDQ2MQB","created_at":"2026-07-14T01:21:41.319977+00:00"},{"alias_kind":"pith_short_16","alias_value":"C4YBYFDQ2MQBGR5R","created_at":"2026-07-14T01:21:41.319977+00:00"},{"alias_kind":"pith_short_8","alias_value":"C4YBYFDQ","created_at":"2026-07-14T01:21:41.319977+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/C4YBYFDQ2MQBGR5RC64OVUVTRI","json":"https://pith.science/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI.json","graph_json":"https://pith.science/api/pith-number/C4YBYFDQ2MQBGR5RC64OVUVTRI/graph.json","events_json":"https://pith.science/api/pith-number/C4YBYFDQ2MQBGR5RC64OVUVTRI/events.json","paper":"https://pith.science/paper/C4YBYFDQ"},"agent_actions":{"view_html":"https://pith.science/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI","download_json":"https://pith.science/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI.json","view_paper":"https://pith.science/paper/C4YBYFDQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.10808&json=true","fetch_graph":"https://pith.science/api/pith-number/C4YBYFDQ2MQBGR5RC64OVUVTRI/graph.json","fetch_events":"https://pith.science/api/pith-number/C4YBYFDQ2MQBGR5RC64OVUVTRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI/action/storage_attestation","attest_author":"https://pith.science/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI/action/author_attestation","sign_citation":"https://pith.science/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI/action/citation_signature","submit_replication":"https://pith.science/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI/action/replication_record"}},"created_at":"2026-07-14T01:21:41.319977+00:00","updated_at":"2026-07-14T01:21:41.319977+00:00"}