{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BQL4NURDZZ2TSW5GCR2ODJMFTN","short_pith_number":"pith:BQL4NURD","schema_version":"1.0","canonical_sha256":"0c17c6d223ce75395ba61474e1a5859b44068757d19bb55316d61792e1b0f7b0","source":{"kind":"arxiv","id":"2310.18955","version":3},"attestation_state":"computed","paper":{"title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Abhishek Sinha, Rahul Vaze","submitted_at":"2023-10-29T09:55:41Z","abstract_excerpt":"A well-studied generalization of the standard online convex optimization (OCO) framework is constrained online convex optimization (COCO). In COCO, on every round, a convex cost function and a convex constraint function are revealed to the learner after it chooses the action for that round. The objective is to design an online learning policy that simultaneously achieves a small regret while ensuring a small cumulative constraint violation (CCV) against an adaptive adversary interacting over a horizon of length $T$. A long-standing open question in COCO is whether an online policy can simultan"},"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":"2310.18955","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-29T09:55:41Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"d1634e855cba9f1ec16d14079c95d3a3404bcdd8b9ce5efc835186593d9e16b6","abstract_canon_sha256":"96dcc8eb9ab172783cf129c748d6268d6f251adae369ea87c85a93f614b87266"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:26:22.640810Z","signature_b64":"MU3eNc9rOfg0gcEj7HNObAB49SXH5aC2sD+z6rfyU74HfIn+UZzeUz9YDNXwk5cj36lhFao9Qni6rxEuOjJTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0c17c6d223ce75395ba61474e1a5859b44068757d19bb55316d61792e1b0f7b0","last_reissued_at":"2026-07-05T09:26:22.640353Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:26:22.640353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Abhishek Sinha, Rahul Vaze","submitted_at":"2023-10-29T09:55:41Z","abstract_excerpt":"A well-studied generalization of the standard online convex optimization (OCO) framework is constrained online convex optimization (COCO). In COCO, on every round, a convex cost function and a convex constraint function are revealed to the learner after it chooses the action for that round. The objective is to design an online learning policy that simultaneously achieves a small regret while ensuring a small cumulative constraint violation (CCV) against an adaptive adversary interacting over a horizon of length $T$. A long-standing open question in COCO is whether an online policy can simultan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.18955","kind":"arxiv","version":3},"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/2310.18955/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":"2310.18955","created_at":"2026-07-05T09:26:22.640432+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.18955v3","created_at":"2026-07-05T09:26:22.640432+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.18955","created_at":"2026-07-05T09:26:22.640432+00:00"},{"alias_kind":"pith_short_12","alias_value":"BQL4NURDZZ2T","created_at":"2026-07-05T09:26:22.640432+00:00"},{"alias_kind":"pith_short_16","alias_value":"BQL4NURDZZ2TSW5G","created_at":"2026-07-05T09:26:22.640432+00:00"},{"alias_kind":"pith_short_8","alias_value":"BQL4NURD","created_at":"2026-07-05T09:26:22.640432+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.21841","citing_title":"An Optimistic Algorithm for online CMDPS with Anytime Adversarial Constraints","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN","json":"https://pith.science/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN.json","graph_json":"https://pith.science/api/pith-number/BQL4NURDZZ2TSW5GCR2ODJMFTN/graph.json","events_json":"https://pith.science/api/pith-number/BQL4NURDZZ2TSW5GCR2ODJMFTN/events.json","paper":"https://pith.science/paper/BQL4NURD"},"agent_actions":{"view_html":"https://pith.science/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN","download_json":"https://pith.science/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN.json","view_paper":"https://pith.science/paper/BQL4NURD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.18955&json=true","fetch_graph":"https://pith.science/api/pith-number/BQL4NURDZZ2TSW5GCR2ODJMFTN/graph.json","fetch_events":"https://pith.science/api/pith-number/BQL4NURDZZ2TSW5GCR2ODJMFTN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN/action/storage_attestation","attest_author":"https://pith.science/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN/action/author_attestation","sign_citation":"https://pith.science/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN/action/citation_signature","submit_replication":"https://pith.science/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN/action/replication_record"}},"created_at":"2026-07-05T09:26:22.640432+00:00","updated_at":"2026-07-05T09:26:22.640432+00:00"}