{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QADEAY5VDT7W7GGFHXZ35WKHVG","short_pith_number":"pith:QADEAY5V","canonical_record":{"source":{"id":"1903.04277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-06T20:29:00Z","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"title_canon_sha256":"1d3cdae2ed296aab57d78cfd0b64e4434ac2eff2f3cd0160ca2ddddd6575a602","abstract_canon_sha256":"aa18a937ca93beac58d4841493044e4601ced3881eb4ef7faea9da99f13d46db"},"schema_version":"1.0"},"canonical_sha256":"80064063b51cff6f98c53df3bed947a9bb2212e8b29246389cda0c4eaaea12d0","source":{"kind":"arxiv","id":"1903.04277","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04277","created_at":"2026-05-17T23:44:07Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04277v2","created_at":"2026-05-17T23:44:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04277","created_at":"2026-05-17T23:44:07Z"},{"alias_kind":"pith_short_12","alias_value":"QADEAY5VDT7W","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QADEAY5VDT7W7GGF","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QADEAY5V","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QADEAY5VDT7W7GGFHXZ35WKHVG","target":"record","payload":{"canonical_record":{"source":{"id":"1903.04277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-06T20:29:00Z","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"title_canon_sha256":"1d3cdae2ed296aab57d78cfd0b64e4434ac2eff2f3cd0160ca2ddddd6575a602","abstract_canon_sha256":"aa18a937ca93beac58d4841493044e4601ced3881eb4ef7faea9da99f13d46db"},"schema_version":"1.0"},"canonical_sha256":"80064063b51cff6f98c53df3bed947a9bb2212e8b29246389cda0c4eaaea12d0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:07.046523Z","signature_b64":"+eF4t237C0iSJPuvMOtxT0PsYXVNjtR++mjTWWpb80qw7qquNYiA6iAgjs7K9+Stn+/xxr9A0U/3OhMgV+HEAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80064063b51cff6f98c53df3bed947a9bb2212e8b29246389cda0c4eaaea12d0","last_reissued_at":"2026-05-17T23:44:07.045970Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:07.045970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.04277","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-17T23:44:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w8tQvsvYD359Eq7K/otNJBMy2DJbgusnyd1hSAYf/pJBMIl0/+6DuUlndTh6bNKZf167VVACALzge0sUqGCPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:14:21.297836Z"},"content_sha256":"7ff6b8f849fb76d0b2542b6cd2f2ee6533f7300fa0e86d8a272fe5123e30e84c","schema_version":"1.0","event_id":"sha256:7ff6b8f849fb76d0b2542b6cd2f2ee6533f7300fa0e86d8a272fe5123e30e84c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QADEAY5VDT7W7GGFHXZ35WKHVG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Online Convex Optimization with Time-Varying Coupled Inequality Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Karl H. Johansson, Lihua Xie, Xinlei Yi, Xiuxian Li","submitted_at":"2019-03-06T20:29:00Z","abstract_excerpt":"This paper considers distributed online optimization with time-varying coupled inequality constraints. The global objective function is composed of local convex cost and regularization functions and the coupled constraint function is the sum of local convex functions. A distributed online primal-dual dynamic mirror descent algorithm is proposed to solve this problem, where the local cost, regularization, and constraint functions are held privately and revealed only after each time slot. Without assuming Slater's condition, we first derive regret and constraint violation bounds for the algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04277","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-17T23:44:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5EeDYZeOe0oT4C0a5Rm2DikP3dLHCh3midB8PIccc862nBf/aZgcWD2NeWGSohilUxTGpxpXuH4quvBBwzC1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:14:21.298587Z"},"content_sha256":"44580a7405e89e53a6a7a6e82bc8f7e4066aded8478bad1dc78809e614db5fd5","schema_version":"1.0","event_id":"sha256:44580a7405e89e53a6a7a6e82bc8f7e4066aded8478bad1dc78809e614db5fd5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QADEAY5VDT7W7GGFHXZ35WKHVG/bundle.json","state_url":"https://pith.science/pith/QADEAY5VDT7W7GGFHXZ35WKHVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QADEAY5VDT7W7GGFHXZ35WKHVG/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-25T19:14:21Z","links":{"resolver":"https://pith.science/pith/QADEAY5VDT7W7GGFHXZ35WKHVG","bundle":"https://pith.science/pith/QADEAY5VDT7W7GGFHXZ35WKHVG/bundle.json","state":"https://pith.science/pith/QADEAY5VDT7W7GGFHXZ35WKHVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QADEAY5VDT7W7GGFHXZ35WKHVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QADEAY5VDT7W7GGFHXZ35WKHVG","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":"aa18a937ca93beac58d4841493044e4601ced3881eb4ef7faea9da99f13d46db","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-06T20:29:00Z","title_canon_sha256":"1d3cdae2ed296aab57d78cfd0b64e4434ac2eff2f3cd0160ca2ddddd6575a602"},"schema_version":"1.0","source":{"id":"1903.04277","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.04277","created_at":"2026-05-17T23:44:07Z"},{"alias_kind":"arxiv_version","alias_value":"1903.04277v2","created_at":"2026-05-17T23:44:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04277","created_at":"2026-05-17T23:44:07Z"},{"alias_kind":"pith_short_12","alias_value":"QADEAY5VDT7W","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QADEAY5VDT7W7GGF","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QADEAY5V","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:44580a7405e89e53a6a7a6e82bc8f7e4066aded8478bad1dc78809e614db5fd5","target":"graph","created_at":"2026-05-17T23:44:07Z","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 distributed online optimization with time-varying coupled inequality constraints. The global objective function is composed of local convex cost and regularization functions and the coupled constraint function is the sum of local convex functions. A distributed online primal-dual dynamic mirror descent algorithm is proposed to solve this problem, where the local cost, regularization, and constraint functions are held privately and revealed only after each time slot. Without assuming Slater's condition, we first derive regret and constraint violation bounds for the algorith","authors_text":"Karl H. Johansson, Lihua Xie, Xinlei Yi, Xiuxian Li","cross_cats":["cs.DC","cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-06T20:29:00Z","title":"Distributed Online Convex Optimization with Time-Varying Coupled Inequality Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04277","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:7ff6b8f849fb76d0b2542b6cd2f2ee6533f7300fa0e86d8a272fe5123e30e84c","target":"record","created_at":"2026-05-17T23:44:07Z","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":"aa18a937ca93beac58d4841493044e4601ced3881eb4ef7faea9da99f13d46db","cross_cats_sorted":["cs.DC","cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-06T20:29:00Z","title_canon_sha256":"1d3cdae2ed296aab57d78cfd0b64e4434ac2eff2f3cd0160ca2ddddd6575a602"},"schema_version":"1.0","source":{"id":"1903.04277","kind":"arxiv","version":2}},"canonical_sha256":"80064063b51cff6f98c53df3bed947a9bb2212e8b29246389cda0c4eaaea12d0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"80064063b51cff6f98c53df3bed947a9bb2212e8b29246389cda0c4eaaea12d0","first_computed_at":"2026-05-17T23:44:07.045970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:07.045970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+eF4t237C0iSJPuvMOtxT0PsYXVNjtR++mjTWWpb80qw7qquNYiA6iAgjs7K9+Stn+/xxr9A0U/3OhMgV+HEAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:07.046523Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.04277","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ff6b8f849fb76d0b2542b6cd2f2ee6533f7300fa0e86d8a272fe5123e30e84c","sha256:44580a7405e89e53a6a7a6e82bc8f7e4066aded8478bad1dc78809e614db5fd5"],"state_sha256":"8fd1af478ad9449387ab81fc7a75b6ecc6fd47b19c85628089a4bbdd6b43c0eb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"++YVhSrqodcGRu3GGEXzkTgoX0Sx9ALc0gRnJSW18FnkRjM29fLOX4rEsk84vA+01r4lvgdOFUB7+yRDaJrrAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:14:21.301745Z","bundle_sha256":"c392992da827efc7ac484f4b5cf2fc7277d50b66acbf8c37c8a9b12e9c2284a4"}}