{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:SJXYYWYHA2IFFFDV7RFT473JR7","short_pith_number":"pith:SJXYYWYH","canonical_record":{"source":{"id":"1702.04783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-15T21:27:06Z","cross_cats_sorted":[],"title_canon_sha256":"cb2a7b67d29832d18276cef496aeae14e7686befc2b557ec1ec8f870da227e8e","abstract_canon_sha256":"47f1a6161cac8f9cd92ee9c22d885462ca34ed5291c19e1b61e511b0c93cdc6b"},"schema_version":"1.0"},"canonical_sha256":"926f8c5b070690529475fc4b3e7f698feb1f20a836aee79765ab47da2f448e12","source":{"kind":"arxiv","id":"1702.04783","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04783","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04783v2","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04783","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"SJXYYWYHA2IF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SJXYYWYHA2IFFFDV","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SJXYYWYH","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:SJXYYWYHA2IFFFDV7RFT473JR7","target":"record","payload":{"canonical_record":{"source":{"id":"1702.04783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-15T21:27:06Z","cross_cats_sorted":[],"title_canon_sha256":"cb2a7b67d29832d18276cef496aeae14e7686befc2b557ec1ec8f870da227e8e","abstract_canon_sha256":"47f1a6161cac8f9cd92ee9c22d885462ca34ed5291c19e1b61e511b0c93cdc6b"},"schema_version":"1.0"},"canonical_sha256":"926f8c5b070690529475fc4b3e7f698feb1f20a836aee79765ab47da2f448e12","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:50:34.915009Z","signature_b64":"4oBu+tqcVJ5y8hN4oIGOX5BU36VV+1sNO06ng8YYD7lTRQZxyGfegaRj/2/xPdbVNJJa68Fn58tXGGhN1SBgAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"926f8c5b070690529475fc4b3e7f698feb1f20a836aee79765ab47da2f448e12","last_reissued_at":"2026-05-18T00:50:34.914310Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:50:34.914310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.04783","source_version":2,"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-18T00:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eB3ci7k5llsfklaKKHvLeB9fMtWlmNNSklVorvR4bxJ7TEkPm19+CvKDSA0FGk24MEmQgr7Y5J1dqxwDzbjjBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T19:41:33.580844Z"},"content_sha256":"9fe7577f049df35a90de466b08391ee46a237753f3f2c4857e12905b36c76833","schema_version":"1.0","event_id":"sha256:9fe7577f049df35a90de466b08391ee46a237753f3f2c4857e12905b36c76833"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:SJXYYWYHA2IFFFDV7RFT473JR7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Convex Optimization with Time-Varying Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hao Yu, Michael J. Neely","submitted_at":"2017-02-15T21:27:06Z","abstract_excerpt":"This paper considers online convex optimization with time-varying constraint functions. Specifically, we have a sequence of convex objective functions $\\{f_t(x)\\}_{t=0}^{\\infty}$ and convex constraint functions $\\{g_{t,i}(x)\\}_{t=0}^{\\infty}$ for $i \\in \\{1, ..., k\\}$. The functions are gradually revealed over time. For a given $\\epsilon>0$, the goal is to choose points $x_t$ every step $t$, without knowing the $f_t$ and $g_{t,i}$ functions on that step, to achieve a time average at most $\\epsilon$ worse than the best fixed-decision that could be chosen with hindsight, subject to the time aver"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04783","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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-18T00:50:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Imh7dYJm4gqe6aTP/y54TcxKw6krUpRIcpNpLvZV2oihJoxK3Rrrt8QRXIzlB7WExutWmnDSe9DX8bGWH+VyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T19:41:33.581463Z"},"content_sha256":"e9e09df6279d1f90307b7cd226af2a7b247a7bccc34022923939c996c64cb0df","schema_version":"1.0","event_id":"sha256:e9e09df6279d1f90307b7cd226af2a7b247a7bccc34022923939c996c64cb0df"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SJXYYWYHA2IFFFDV7RFT473JR7/bundle.json","state_url":"https://pith.science/pith/SJXYYWYHA2IFFFDV7RFT473JR7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SJXYYWYHA2IFFFDV7RFT473JR7/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-21T19:41:33Z","links":{"resolver":"https://pith.science/pith/SJXYYWYHA2IFFFDV7RFT473JR7","bundle":"https://pith.science/pith/SJXYYWYHA2IFFFDV7RFT473JR7/bundle.json","state":"https://pith.science/pith/SJXYYWYHA2IFFFDV7RFT473JR7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SJXYYWYHA2IFFFDV7RFT473JR7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:SJXYYWYHA2IFFFDV7RFT473JR7","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":"47f1a6161cac8f9cd92ee9c22d885462ca34ed5291c19e1b61e511b0c93cdc6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-15T21:27:06Z","title_canon_sha256":"cb2a7b67d29832d18276cef496aeae14e7686befc2b557ec1ec8f870da227e8e"},"schema_version":"1.0","source":{"id":"1702.04783","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.04783","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"arxiv_version","alias_value":"1702.04783v2","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.04783","created_at":"2026-05-18T00:50:34Z"},{"alias_kind":"pith_short_12","alias_value":"SJXYYWYHA2IF","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"SJXYYWYHA2IFFFDV","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"SJXYYWYH","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:e9e09df6279d1f90307b7cd226af2a7b247a7bccc34022923939c996c64cb0df","target":"graph","created_at":"2026-05-18T00:50:34Z","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"},"paper":{"abstract_excerpt":"This paper considers online convex optimization with time-varying constraint functions. Specifically, we have a sequence of convex objective functions $\\{f_t(x)\\}_{t=0}^{\\infty}$ and convex constraint functions $\\{g_{t,i}(x)\\}_{t=0}^{\\infty}$ for $i \\in \\{1, ..., k\\}$. The functions are gradually revealed over time. For a given $\\epsilon>0$, the goal is to choose points $x_t$ every step $t$, without knowing the $f_t$ and $g_{t,i}$ functions on that step, to achieve a time average at most $\\epsilon$ worse than the best fixed-decision that could be chosen with hindsight, subject to the time aver","authors_text":"Hao Yu, Michael J. Neely","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-15T21:27:06Z","title":"Online Convex Optimization with Time-Varying Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.04783","kind":"arxiv","version":2},"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:9fe7577f049df35a90de466b08391ee46a237753f3f2c4857e12905b36c76833","target":"record","created_at":"2026-05-18T00:50:34Z","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":"47f1a6161cac8f9cd92ee9c22d885462ca34ed5291c19e1b61e511b0c93cdc6b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-15T21:27:06Z","title_canon_sha256":"cb2a7b67d29832d18276cef496aeae14e7686befc2b557ec1ec8f870da227e8e"},"schema_version":"1.0","source":{"id":"1702.04783","kind":"arxiv","version":2}},"canonical_sha256":"926f8c5b070690529475fc4b3e7f698feb1f20a836aee79765ab47da2f448e12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"926f8c5b070690529475fc4b3e7f698feb1f20a836aee79765ab47da2f448e12","first_computed_at":"2026-05-18T00:50:34.914310Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:50:34.914310Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4oBu+tqcVJ5y8hN4oIGOX5BU36VV+1sNO06ng8YYD7lTRQZxyGfegaRj/2/xPdbVNJJa68Fn58tXGGhN1SBgAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:50:34.915009Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.04783","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9fe7577f049df35a90de466b08391ee46a237753f3f2c4857e12905b36c76833","sha256:e9e09df6279d1f90307b7cd226af2a7b247a7bccc34022923939c996c64cb0df"],"state_sha256":"198c1823731b1b6e90c5f162ee853c8be96300a78f76f2c7c1ae777a0d0490a9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tzxAhkVkalQTRRMSXl0T8DyFKiFPf33OYLvAUpw3g1CymPdWJS32EcGatv4wrFbo53bQ+jGcJKuXR0bKVGsqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T19:41:33.584474Z","bundle_sha256":"4ccca1856d47fd11c10d1b1f671fcf04f5401dbdc3e51999a120cf0a55f0ba52"}}