{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:2GGJN3HNFDWZQZRLHDBDR6WP2N","short_pith_number":"pith:2GGJN3HN","canonical_record":{"source":{"id":"2605.21107","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-20T12:40:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"56dc28778656671dba0dcc07f4a1a57098102a0572d9c7fd3fcfb8a0fac924dc","abstract_canon_sha256":"3888fb79d021d1b9c8d13332e8b7692de63df506a7ef0b94c3aaa3e78c93af47"},"schema_version":"1.0"},"canonical_sha256":"d18c96eced28ed98662b38c238facfd358f67236e9a21521b48d120ee7fae19e","source":{"kind":"arxiv","id":"2605.21107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21107","created_at":"2026-05-21T01:05:37Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21107v1","created_at":"2026-05-21T01:05:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21107","created_at":"2026-05-21T01:05:37Z"},{"alias_kind":"pith_short_12","alias_value":"2GGJN3HNFDWZ","created_at":"2026-05-21T01:05:37Z"},{"alias_kind":"pith_short_16","alias_value":"2GGJN3HNFDWZQZRL","created_at":"2026-05-21T01:05:37Z"},{"alias_kind":"pith_short_8","alias_value":"2GGJN3HN","created_at":"2026-05-21T01:05:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:2GGJN3HNFDWZQZRLHDBDR6WP2N","target":"record","payload":{"canonical_record":{"source":{"id":"2605.21107","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-20T12:40:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"56dc28778656671dba0dcc07f4a1a57098102a0572d9c7fd3fcfb8a0fac924dc","abstract_canon_sha256":"3888fb79d021d1b9c8d13332e8b7692de63df506a7ef0b94c3aaa3e78c93af47"},"schema_version":"1.0"},"canonical_sha256":"d18c96eced28ed98662b38c238facfd358f67236e9a21521b48d120ee7fae19e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-21T01:05:37.731339Z","signature_b64":"x0xf3EpV66LwoYlMAbhLs9+6xujTcbZBJNcqGLDjGGimiAGx7rxbncaJF1/+epkK/DggIw9bjS+R/CCTrXrPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d18c96eced28ed98662b38c238facfd358f67236e9a21521b48d120ee7fae19e","last_reissued_at":"2026-05-21T01:05:37.729790Z","signature_status":"signed_v1","first_computed_at":"2026-05-21T01:05:37.729790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.21107","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-05-21T01:05:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kbtJGzuAhmVX1mjGOwyl+7egFwCongXR7rIsOp0Q35iBUXULklxFYAPiz1jopZOW016bvMA2TSj8GnqOpoytCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:54:44.174540Z"},"content_sha256":"1e39a2e661b0773d53d8aed96ead353ef98c8df72d5f24c059d7bc27f5a3e4e6","schema_version":"1.0","event_id":"sha256:1e39a2e661b0773d53d8aed96ead353ef98c8df72d5f24c059d7bc27f5a3e4e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:2GGJN3HNFDWZQZRLHDBDR6WP2N","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Guarantees for Constrained Online Convex Optimization via Self-Contraction","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Abhishek Sinha, Dhruv Sarkar","submitted_at":"2026-05-20T12:40:27Z","abstract_excerpt":"We consider Constrained Online Convex Optimization (COCO) with adversarially chosen constraints. At each round, the learner chooses an action before observing the loss and constraint function for that round. The goal is to achieve small static regret against the best point satisfying all constraints while also controlling cumulative constraint violation ($\\mathsf{CCV}$). For strongly convex losses, state-of-the-art algorithms achieve $O(\\log T)$ regret and $O(\\sqrt{T \\log T})$ $\\mathsf{CCV}.$ The corresponding best-known bounds for convex losses is $O(\\sqrt{T})$ regret and $O(\\sqrt{T} \\log T)$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21107","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/2605.21107/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-05-21T01:05:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"omwGIaFytohBVqIPse+Z7fgpKjCLUO0luiLmi6NUn0w0pvKQxEFstVlQfcE8FFCN6X88qAGgijZU0+/Zl12vDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T15:54:44.174923Z"},"content_sha256":"8e2575f1898b8861ff1d4e9f62080b4dae99428aecd33dfb95b3eca087dacd20","schema_version":"1.0","event_id":"sha256:8e2575f1898b8861ff1d4e9f62080b4dae99428aecd33dfb95b3eca087dacd20"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2GGJN3HNFDWZQZRLHDBDR6WP2N/bundle.json","state_url":"https://pith.science/pith/2GGJN3HNFDWZQZRLHDBDR6WP2N/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2GGJN3HNFDWZQZRLHDBDR6WP2N/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-05-21T15:54:44Z","links":{"resolver":"https://pith.science/pith/2GGJN3HNFDWZQZRLHDBDR6WP2N","bundle":"https://pith.science/pith/2GGJN3HNFDWZQZRLHDBDR6WP2N/bundle.json","state":"https://pith.science/pith/2GGJN3HNFDWZQZRLHDBDR6WP2N/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2GGJN3HNFDWZQZRLHDBDR6WP2N/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2GGJN3HNFDWZQZRLHDBDR6WP2N","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":"3888fb79d021d1b9c8d13332e8b7692de63df506a7ef0b94c3aaa3e78c93af47","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-20T12:40:27Z","title_canon_sha256":"56dc28778656671dba0dcc07f4a1a57098102a0572d9c7fd3fcfb8a0fac924dc"},"schema_version":"1.0","source":{"id":"2605.21107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.21107","created_at":"2026-05-21T01:05:37Z"},{"alias_kind":"arxiv_version","alias_value":"2605.21107v1","created_at":"2026-05-21T01:05:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.21107","created_at":"2026-05-21T01:05:37Z"},{"alias_kind":"pith_short_12","alias_value":"2GGJN3HNFDWZ","created_at":"2026-05-21T01:05:37Z"},{"alias_kind":"pith_short_16","alias_value":"2GGJN3HNFDWZQZRL","created_at":"2026-05-21T01:05:37Z"},{"alias_kind":"pith_short_8","alias_value":"2GGJN3HN","created_at":"2026-05-21T01:05:37Z"}],"graph_snapshots":[{"event_id":"sha256:8e2575f1898b8861ff1d4e9f62080b4dae99428aecd33dfb95b3eca087dacd20","target":"graph","created_at":"2026-05-21T01:05:37Z","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/2605.21107/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider Constrained Online Convex Optimization (COCO) with adversarially chosen constraints. At each round, the learner chooses an action before observing the loss and constraint function for that round. The goal is to achieve small static regret against the best point satisfying all constraints while also controlling cumulative constraint violation ($\\mathsf{CCV}$). For strongly convex losses, state-of-the-art algorithms achieve $O(\\log T)$ regret and $O(\\sqrt{T \\log T})$ $\\mathsf{CCV}.$ The corresponding best-known bounds for convex losses is $O(\\sqrt{T})$ regret and $O(\\sqrt{T} \\log T)$","authors_text":"Abhishek Sinha, Dhruv Sarkar","cross_cats":["stat.ML"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-20T12:40:27Z","title":"Improved Guarantees for Constrained Online Convex Optimization via Self-Contraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.21107","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:1e39a2e661b0773d53d8aed96ead353ef98c8df72d5f24c059d7bc27f5a3e4e6","target":"record","created_at":"2026-05-21T01:05:37Z","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":"3888fb79d021d1b9c8d13332e8b7692de63df506a7ef0b94c3aaa3e78c93af47","cross_cats_sorted":["stat.ML"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.LG","submitted_at":"2026-05-20T12:40:27Z","title_canon_sha256":"56dc28778656671dba0dcc07f4a1a57098102a0572d9c7fd3fcfb8a0fac924dc"},"schema_version":"1.0","source":{"id":"2605.21107","kind":"arxiv","version":1}},"canonical_sha256":"d18c96eced28ed98662b38c238facfd358f67236e9a21521b48d120ee7fae19e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d18c96eced28ed98662b38c238facfd358f67236e9a21521b48d120ee7fae19e","first_computed_at":"2026-05-21T01:05:37.729790Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-21T01:05:37.729790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x0xf3EpV66LwoYlMAbhLs9+6xujTcbZBJNcqGLDjGGimiAGx7rxbncaJF1/+epkK/DggIw9bjS+R/CCTrXrPCA==","signature_status":"signed_v1","signed_at":"2026-05-21T01:05:37.731339Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.21107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e39a2e661b0773d53d8aed96ead353ef98c8df72d5f24c059d7bc27f5a3e4e6","sha256:8e2575f1898b8861ff1d4e9f62080b4dae99428aecd33dfb95b3eca087dacd20"],"state_sha256":"8cfb790e7b986229be16873f6c539e91540a0509e73ebc6102157da9f7f5f254"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7jFKXRxXsNE4s6AsLc7rj9uuxgx8YV7dNpvQnjZu/sdc1tr8kz2UhShajESYnmgSNTmcC5v5ZeO8/0TYmjWUCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T15:54:44.177108Z","bundle_sha256":"7965b3dd4213618b5c262165c2cd9a58ecf5e5b46f0f466ca0fed3ac4bdcfee1"}}