{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BQL4NURDZZ2TSW5GCR2ODJMFTN","short_pith_number":"pith:BQL4NURD","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"},"canonical_sha256":"0c17c6d223ce75395ba61474e1a5859b44068757d19bb55316d61792e1b0f7b0","source":{"kind":"arxiv","id":"2310.18955","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.18955","created_at":"2026-07-05T09:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"2310.18955v3","created_at":"2026-07-05T09:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.18955","created_at":"2026-07-05T09:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"BQL4NURDZZ2T","created_at":"2026-07-05T09:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"BQL4NURDZZ2TSW5G","created_at":"2026-07-05T09:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"BQL4NURD","created_at":"2026-07-05T09:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BQL4NURDZZ2TSW5GCR2ODJMFTN","target":"record","payload":{"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"},"canonical_sha256":"0c17c6d223ce75395ba61474e1a5859b44068757d19bb55316d61792e1b0f7b0","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"},"source_kind":"arxiv","source_id":"2310.18955","source_version":3,"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-05T09:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z0fPVvjIS7iqkZlfLOWCaZTtf57SKPK2TCS378nB0YRXIcYaqCi7/R6n3BiLmjFYu6LLcrq/XHABue6s6SFtAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:03:44.139857Z"},"content_sha256":"323d2ef293396a84f594eeda844d197c3e25f2568984cf2d5f57184ed285a213","schema_version":"1.0","event_id":"sha256:323d2ef293396a84f594eeda844d197c3e25f2568984cf2d5f57184ed285a213"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BQL4NURDZZ2TSW5GCR2ODJMFTN","target":"graph","payload":{"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"},"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-05T09:26:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"POZiqD7LozaSHhc761b+sJ073K6V4clwfCRItHLQayD+GTuwyxgfj0QwuyCwm+ed6jNW8AwrAiUBlBJ2sq7XCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T07:03:44.140610Z"},"content_sha256":"dfcbd01b08a9667d2c13857d6ebf600f8adae05dc7d6b9323f60ea8cadc9848c","schema_version":"1.0","event_id":"sha256:dfcbd01b08a9667d2c13857d6ebf600f8adae05dc7d6b9323f60ea8cadc9848c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN/bundle.json","state_url":"https://pith.science/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN/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-08T07:03:44Z","links":{"resolver":"https://pith.science/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN","bundle":"https://pith.science/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN/bundle.json","state":"https://pith.science/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BQL4NURDZZ2TSW5GCR2ODJMFTN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BQL4NURDZZ2TSW5GCR2ODJMFTN","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":"96dcc8eb9ab172783cf129c748d6268d6f251adae369ea87c85a93f614b87266","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-29T09:55:41Z","title_canon_sha256":"d1634e855cba9f1ec16d14079c95d3a3404bcdd8b9ce5efc835186593d9e16b6"},"schema_version":"1.0","source":{"id":"2310.18955","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.18955","created_at":"2026-07-05T09:26:22Z"},{"alias_kind":"arxiv_version","alias_value":"2310.18955v3","created_at":"2026-07-05T09:26:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.18955","created_at":"2026-07-05T09:26:22Z"},{"alias_kind":"pith_short_12","alias_value":"BQL4NURDZZ2T","created_at":"2026-07-05T09:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"BQL4NURDZZ2TSW5G","created_at":"2026-07-05T09:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"BQL4NURD","created_at":"2026-07-05T09:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:dfcbd01b08a9667d2c13857d6ebf600f8adae05dc7d6b9323f60ea8cadc9848c","target":"graph","created_at":"2026-07-05T09:26:22Z","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/2310.18955/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Abhishek Sinha, Rahul Vaze","cross_cats":["math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-29T09:55:41Z","title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.18955","kind":"arxiv","version":3},"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:323d2ef293396a84f594eeda844d197c3e25f2568984cf2d5f57184ed285a213","target":"record","created_at":"2026-07-05T09:26:22Z","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":"96dcc8eb9ab172783cf129c748d6268d6f251adae369ea87c85a93f614b87266","cross_cats_sorted":["math.OC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2023-10-29T09:55:41Z","title_canon_sha256":"d1634e855cba9f1ec16d14079c95d3a3404bcdd8b9ce5efc835186593d9e16b6"},"schema_version":"1.0","source":{"id":"2310.18955","kind":"arxiv","version":3}},"canonical_sha256":"0c17c6d223ce75395ba61474e1a5859b44068757d19bb55316d61792e1b0f7b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0c17c6d223ce75395ba61474e1a5859b44068757d19bb55316d61792e1b0f7b0","first_computed_at":"2026-07-05T09:26:22.640353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:26:22.640353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MU3eNc9rOfg0gcEj7HNObAB49SXH5aC2sD+z6rfyU74HfIn+UZzeUz9YDNXwk5cj36lhFao9Qni6rxEuOjJTAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:26:22.640810Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.18955","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:323d2ef293396a84f594eeda844d197c3e25f2568984cf2d5f57184ed285a213","sha256:dfcbd01b08a9667d2c13857d6ebf600f8adae05dc7d6b9323f60ea8cadc9848c"],"state_sha256":"886c581c4d266a4f2e8c704b67ecf3dd66cc32f204a9c5ed864ee4350018f2b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UEPBvBTu24M6Lrtk32Z+qqYgZzXMIMmuA+8UeU5Aq+vfnRw/o9eFzn1PxHlnJ3B0SRiu4ac8wFPoaPIihZQ1Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T07:03:44.147543Z","bundle_sha256":"ed18070003aa338feffc2b61f070078ce5273c472038fd4ad030b1fd7e1a9698"}}