{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:C4YBYFDQ2MQBGR5RC64OVUVTRI","short_pith_number":"pith:C4YBYFDQ","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"},"canonical_sha256":"17301c1470d3201347b117b8ead2b38a1269844e4fcb8dc605bca3e9d2ee6acf","source":{"kind":"arxiv","id":"2607.10808","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.10808","created_at":"2026-07-14T01:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"2607.10808v1","created_at":"2026-07-14T01:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10808","created_at":"2026-07-14T01:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"C4YBYFDQ2MQB","created_at":"2026-07-14T01:21:41Z"},{"alias_kind":"pith_short_16","alias_value":"C4YBYFDQ2MQBGR5R","created_at":"2026-07-14T01:21:41Z"},{"alias_kind":"pith_short_8","alias_value":"C4YBYFDQ","created_at":"2026-07-14T01:21:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:C4YBYFDQ2MQBGR5RC64OVUVTRI","target":"record","payload":{"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"},"canonical_sha256":"17301c1470d3201347b117b8ead2b38a1269844e4fcb8dc605bca3e9d2ee6acf","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"},"source_kind":"arxiv","source_id":"2607.10808","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-14T01:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jFRdiTUNjGDPDf5bhrfg2Yg0rNlVb+SVfUDkyDdTvvtz1uI0ZZoqt+UT2qiTAS3TaZCi+3JHLRPIaENGu+B3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T20:17:50.358887Z"},"content_sha256":"525f6268ff0bfc4b80755e9a17787c7881b51890d723bc81a707e8680d85f453","schema_version":"1.0","event_id":"sha256:525f6268ff0bfc4b80755e9a17787c7881b51890d723bc81a707e8680d85f453"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:C4YBYFDQ2MQBGR5RC64OVUVTRI","target":"graph","payload":{"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"},"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-14T01:21:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BAXGVqJ50pikl2KGOgNAsxdY6nuVSDOvYLQvfyxSN7EyT/z4+WRYJIHC6UaGQYD5c7NGbZ54tPl1jpEP9gQ+DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-01T20:17:50.359388Z"},"content_sha256":"d9fdf3396469ece1df61fff9d311f7bb69f3250b56ed7df21373b0c4e2b5335d","schema_version":"1.0","event_id":"sha256:d9fdf3396469ece1df61fff9d311f7bb69f3250b56ed7df21373b0c4e2b5335d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI/bundle.json","state_url":"https://pith.science/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI/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-01T20:17:50Z","links":{"resolver":"https://pith.science/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI","bundle":"https://pith.science/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI/bundle.json","state":"https://pith.science/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C4YBYFDQ2MQBGR5RC64OVUVTRI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:C4YBYFDQ2MQBGR5RC64OVUVTRI","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":"6d4d0e639045f8bb0804ccaf444803c38df101d1cedf3b1d2921ded253755527","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-12T15:36:04Z","title_canon_sha256":"a00482aedbd2ad98d4427348ea30cf0dbc0fd4398eade6f7d2ca3e6466cefb07"},"schema_version":"1.0","source":{"id":"2607.10808","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.10808","created_at":"2026-07-14T01:21:41Z"},{"alias_kind":"arxiv_version","alias_value":"2607.10808v1","created_at":"2026-07-14T01:21:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.10808","created_at":"2026-07-14T01:21:41Z"},{"alias_kind":"pith_short_12","alias_value":"C4YBYFDQ2MQB","created_at":"2026-07-14T01:21:41Z"},{"alias_kind":"pith_short_16","alias_value":"C4YBYFDQ2MQBGR5R","created_at":"2026-07-14T01:21:41Z"},{"alias_kind":"pith_short_8","alias_value":"C4YBYFDQ","created_at":"2026-07-14T01:21:41Z"}],"graph_snapshots":[{"event_id":"sha256:d9fdf3396469ece1df61fff9d311f7bb69f3250b56ed7df21373b0c4e2b5335d","target":"graph","created_at":"2026-07-14T01:21:41Z","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.10808/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Haricharan Balasundaram, Karthick Krishna Mahendran, Rahul Vaze","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-12T15:36:04Z","title":"Lower Bound on the Cumulative Constrained Violation for the OGD+Projection algorithm for Constrained Online Convex Optimization (COCO)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.10808","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:525f6268ff0bfc4b80755e9a17787c7881b51890d723bc81a707e8680d85f453","target":"record","created_at":"2026-07-14T01:21:41Z","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":"6d4d0e639045f8bb0804ccaf444803c38df101d1cedf3b1d2921ded253755527","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-12T15:36:04Z","title_canon_sha256":"a00482aedbd2ad98d4427348ea30cf0dbc0fd4398eade6f7d2ca3e6466cefb07"},"schema_version":"1.0","source":{"id":"2607.10808","kind":"arxiv","version":1}},"canonical_sha256":"17301c1470d3201347b117b8ead2b38a1269844e4fcb8dc605bca3e9d2ee6acf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17301c1470d3201347b117b8ead2b38a1269844e4fcb8dc605bca3e9d2ee6acf","first_computed_at":"2026-07-14T01:21:41.319519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T01:21:41.319519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Z0v7gXQQ8coxzBoHTEBa6qCq/zmnr2KW2LOBMXDqf9izlSGZdQnDqhxjN7zrOFz7ymw9OIP9KIlJhJzndVjSCw==","signature_status":"signed_v1","signed_at":"2026-07-14T01:21:41.320391Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.10808","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:525f6268ff0bfc4b80755e9a17787c7881b51890d723bc81a707e8680d85f453","sha256:d9fdf3396469ece1df61fff9d311f7bb69f3250b56ed7df21373b0c4e2b5335d"],"state_sha256":"df8c2bb548f04439f636f8ed6ca15f264e726db0c691520dcde9f6374403b8a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"++TTeNfLJOrP48yAbeaDg8OEj9Dcrtps04kGNSXppZ5rteXitp1pBkBA0EOq23gr+g6iRtjC50uSWmLkaC3dBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-01T20:17:50.363116Z","bundle_sha256":"feacbdc7efd78b513f7af7270f88267c9152436c401c028d51ced36276c5902b"}}