{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:O7TV6IEB7JF6AIPPYH2R474SKX","short_pith_number":"pith:O7TV6IEB","canonical_record":{"source":{"id":"1604.02218","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-08T03:37:52Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"dd1a7151a334bcfb7785a23207a24885abc9ec8c3c7060d900646d37e2fe9969","abstract_canon_sha256":"f1d73f5ef7ecb846f0442d57840c0d4cc9384ec736a9500fb71bf386d03bc02f"},"schema_version":"1.0"},"canonical_sha256":"77e75f2081fa4be021efc1f51e7f9255ea604c08cec85cde4176086f840247b1","source":{"kind":"arxiv","id":"1604.02218","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02218","created_at":"2026-07-05T01:03:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02218v3","created_at":"2026-07-05T01:03:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02218","created_at":"2026-07-05T01:03:16Z"},{"alias_kind":"pith_short_12","alias_value":"O7TV6IEB7JF6","created_at":"2026-07-05T01:03:16Z"},{"alias_kind":"pith_short_16","alias_value":"O7TV6IEB7JF6AIPP","created_at":"2026-07-05T01:03:16Z"},{"alias_kind":"pith_short_8","alias_value":"O7TV6IEB","created_at":"2026-07-05T01:03:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:O7TV6IEB7JF6AIPPYH2R474SKX","target":"record","payload":{"canonical_record":{"source":{"id":"1604.02218","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-08T03:37:52Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"dd1a7151a334bcfb7785a23207a24885abc9ec8c3c7060d900646d37e2fe9969","abstract_canon_sha256":"f1d73f5ef7ecb846f0442d57840c0d4cc9384ec736a9500fb71bf386d03bc02f"},"schema_version":"1.0"},"canonical_sha256":"77e75f2081fa4be021efc1f51e7f9255ea604c08cec85cde4176086f840247b1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:03:16.881022Z","signature_b64":"sAZLRs+4G3U/8q4dXrbg6HhhwNzEicUrFCJ1Plj1ozFnGfzTZiNZ9jspGIxH7hgxn+R/Z0qS5TY8f2foeCTEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"77e75f2081fa4be021efc1f51e7f9255ea604c08cec85cde4176086f840247b1","last_reissued_at":"2026-07-05T01:03:16.880531Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:03:16.880531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.02218","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-05T01:03:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hfa2nsT/ChRcGsSI6PsxaFdzzgW7gwNoA66bq9DNlwNls4GI09G8DzDwOWfVBbirButyCQICrJCuHspEJu4QAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T00:51:01.706444Z"},"content_sha256":"e13280b482fa5c36e57de7a9d699f42929217badd277e05671b3b1bee6da3843","schema_version":"1.0","event_id":"sha256:e13280b482fa5c36e57de7a9d699f42929217badd277e05671b3b1bee6da3843"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:O7TV6IEB7JF6AIPPYH2R474SKX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Low Complexity Algorithm with $O(\\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Hao Yu, Michael J. Neely","submitted_at":"2016-04-08T03:37:52Z","abstract_excerpt":"This paper considers online convex optimization over a complicated constraint set, which typically consists of multiple functional constraints and a set constraint. The conventional online projection algorithm (Zinkevich, 2003) can be difficult to implement due to the potentially high computation complexity of the projection operation. In this paper, we relax the functional constraints by allowing them to be violated at each round but still requiring them to be satisfied in the long term. This type of relaxed online convex optimization (with long term constraints) was first considered in Mahda"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02218","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/1604.02218/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-05T01:03:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9HpDc911Vk14bbSK3vaOIyBH4itAtIdX/CFlILpFEwlJim/Bo5R+0s6qLAteqoHYWuT9EWPeb0ooVmjn8gf3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T00:51:01.706943Z"},"content_sha256":"9d079cba206fcd51315277e2cb31f13fccdb8d2c4ce4b82c53b145cd15ddb4da","schema_version":"1.0","event_id":"sha256:9d079cba206fcd51315277e2cb31f13fccdb8d2c4ce4b82c53b145cd15ddb4da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O7TV6IEB7JF6AIPPYH2R474SKX/bundle.json","state_url":"https://pith.science/pith/O7TV6IEB7JF6AIPPYH2R474SKX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O7TV6IEB7JF6AIPPYH2R474SKX/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-11T00:51:01Z","links":{"resolver":"https://pith.science/pith/O7TV6IEB7JF6AIPPYH2R474SKX","bundle":"https://pith.science/pith/O7TV6IEB7JF6AIPPYH2R474SKX/bundle.json","state":"https://pith.science/pith/O7TV6IEB7JF6AIPPYH2R474SKX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O7TV6IEB7JF6AIPPYH2R474SKX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:O7TV6IEB7JF6AIPPYH2R474SKX","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":"f1d73f5ef7ecb846f0442d57840c0d4cc9384ec736a9500fb71bf386d03bc02f","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-08T03:37:52Z","title_canon_sha256":"dd1a7151a334bcfb7785a23207a24885abc9ec8c3c7060d900646d37e2fe9969"},"schema_version":"1.0","source":{"id":"1604.02218","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.02218","created_at":"2026-07-05T01:03:16Z"},{"alias_kind":"arxiv_version","alias_value":"1604.02218v3","created_at":"2026-07-05T01:03:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.02218","created_at":"2026-07-05T01:03:16Z"},{"alias_kind":"pith_short_12","alias_value":"O7TV6IEB7JF6","created_at":"2026-07-05T01:03:16Z"},{"alias_kind":"pith_short_16","alias_value":"O7TV6IEB7JF6AIPP","created_at":"2026-07-05T01:03:16Z"},{"alias_kind":"pith_short_8","alias_value":"O7TV6IEB","created_at":"2026-07-05T01:03:16Z"}],"graph_snapshots":[{"event_id":"sha256:9d079cba206fcd51315277e2cb31f13fccdb8d2c4ce4b82c53b145cd15ddb4da","target":"graph","created_at":"2026-07-05T01:03:16Z","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/1604.02218/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper considers online convex optimization over a complicated constraint set, which typically consists of multiple functional constraints and a set constraint. The conventional online projection algorithm (Zinkevich, 2003) can be difficult to implement due to the potentially high computation complexity of the projection operation. In this paper, we relax the functional constraints by allowing them to be violated at each round but still requiring them to be satisfied in the long term. This type of relaxed online convex optimization (with long term constraints) was first considered in Mahda","authors_text":"Hao Yu, Michael J. Neely","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-08T03:37:52Z","title":"A Low Complexity Algorithm with $O(\\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.02218","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:e13280b482fa5c36e57de7a9d699f42929217badd277e05671b3b1bee6da3843","target":"record","created_at":"2026-07-05T01:03:16Z","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":"f1d73f5ef7ecb846f0442d57840c0d4cc9384ec736a9500fb71bf386d03bc02f","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-08T03:37:52Z","title_canon_sha256":"dd1a7151a334bcfb7785a23207a24885abc9ec8c3c7060d900646d37e2fe9969"},"schema_version":"1.0","source":{"id":"1604.02218","kind":"arxiv","version":3}},"canonical_sha256":"77e75f2081fa4be021efc1f51e7f9255ea604c08cec85cde4176086f840247b1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77e75f2081fa4be021efc1f51e7f9255ea604c08cec85cde4176086f840247b1","first_computed_at":"2026-07-05T01:03:16.880531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:03:16.880531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sAZLRs+4G3U/8q4dXrbg6HhhwNzEicUrFCJ1Plj1ozFnGfzTZiNZ9jspGIxH7hgxn+R/Z0qS5TY8f2foeCTEAw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:03:16.881022Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.02218","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e13280b482fa5c36e57de7a9d699f42929217badd277e05671b3b1bee6da3843","sha256:9d079cba206fcd51315277e2cb31f13fccdb8d2c4ce4b82c53b145cd15ddb4da"],"state_sha256":"ca5f69b01859fa1e17a7966d9d074a2508f1ee2ed27c85fd215b4814f16bf502"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DXre7ENNZnSwSOMvfOMZoItP8Qsqer8+RsSbPDvgrU82e/MehfwM4mEgCpGIGtVa/bMMqLRBHDeeYt8mCv4cCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T00:51:01.711274Z","bundle_sha256":"94d347148fb6b691826b01c5543652280cbdbd5dcbea9bb349293964efda9676"}}