{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CHA5EVPD2347NVPVKCJQ5LWVY2","short_pith_number":"pith:CHA5EVPD","canonical_record":{"source":{"id":"1302.3092","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T13:55:32Z","cross_cats_sorted":[],"title_canon_sha256":"40f3b7786e747452bc866232e9dad4f2fc61b94e6ebbc8cdd97dfdf1c0fb49c0","abstract_canon_sha256":"9fcdd5186558915a140edb1297295c98d576d102fd3bd13c306508562bd498f0"},"schema_version":"1.0"},"canonical_sha256":"11c1d255e3d6f9f6d5f550930eaed5c6833fefe95ee353577fe85f5389276448","source":{"kind":"arxiv","id":"1302.3092","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3092","created_at":"2026-05-18T02:34:52Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3092v2","created_at":"2026-05-18T02:34:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3092","created_at":"2026-05-18T02:34:52Z"},{"alias_kind":"pith_short_12","alias_value":"CHA5EVPD2347","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CHA5EVPD2347NVPV","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CHA5EVPD","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CHA5EVPD2347NVPVKCJQ5LWVY2","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3092","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T13:55:32Z","cross_cats_sorted":[],"title_canon_sha256":"40f3b7786e747452bc866232e9dad4f2fc61b94e6ebbc8cdd97dfdf1c0fb49c0","abstract_canon_sha256":"9fcdd5186558915a140edb1297295c98d576d102fd3bd13c306508562bd498f0"},"schema_version":"1.0"},"canonical_sha256":"11c1d255e3d6f9f6d5f550930eaed5c6833fefe95ee353577fe85f5389276448","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:34:52.784020Z","signature_b64":"Eun1+kpsAu++oNSkCPQOSn1GOhIXp1hu9HPify1U33cyz6iCsm8bz2xdYypoNiAtp/mWvEDzuAeeXeJDZDVECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11c1d255e3d6f9f6d5f550930eaed5c6833fefe95ee353577fe85f5389276448","last_reissued_at":"2026-05-18T02:34:52.783523Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:34:52.783523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3092","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-18T02:34:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pdzyF35u4mJizGM77PJDIL1qcZfYEhEiXpcze5Zh3W+6/NLlfK/KszmuALxdRMGScnZDdxTwW2EETMfjlrTaCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:03:41.951589Z"},"content_sha256":"8d729053f953c7284548d673766edc263b1693f66b4b45c1c94a2a754c2d9503","schema_version":"1.0","event_id":"sha256:8d729053f953c7284548d673766edc263b1693f66b4b45c1c94a2a754c2d9503"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CHA5EVPD2347NVPVKCJQ5LWVY2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Dragos Clipici, Ion Necoara","submitted_at":"2013-02-13T13:55:32Z","abstract_excerpt":"In this paper we propose a parallel coordinate descent algorithm for solving smooth convex optimization problems with separable constraints that may arise e.g. in distributed model predictive control (MPC) for linear network systems. Our algorithm is based on block coordinate descent updates in parallel and has a very simple iteration. We prove (sub)linear rate of convergence for the new algorithm under standard assumptions for smooth convex optimization. Further, our algorithm uses local information and thus is suitable for distributed implementations. Moreover, it has low iteration complexit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3092","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-18T02:34:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5u/qTUon3JSsbbmfFBX486dK+kj4woOv5YZMOashoY0W7fs8bVUWSKfERYJ0uhLF4ZjzLpvnNOVvyTkY0bxvCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:03:41.952219Z"},"content_sha256":"9dd97532b1fccb6c61da640dfbdbb5485bc6ed41fbad6daa096451f1da58c39f","schema_version":"1.0","event_id":"sha256:9dd97532b1fccb6c61da640dfbdbb5485bc6ed41fbad6daa096451f1da58c39f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CHA5EVPD2347NVPVKCJQ5LWVY2/bundle.json","state_url":"https://pith.science/pith/CHA5EVPD2347NVPVKCJQ5LWVY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CHA5EVPD2347NVPVKCJQ5LWVY2/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-26T05:03:41Z","links":{"resolver":"https://pith.science/pith/CHA5EVPD2347NVPVKCJQ5LWVY2","bundle":"https://pith.science/pith/CHA5EVPD2347NVPVKCJQ5LWVY2/bundle.json","state":"https://pith.science/pith/CHA5EVPD2347NVPVKCJQ5LWVY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CHA5EVPD2347NVPVKCJQ5LWVY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CHA5EVPD2347NVPVKCJQ5LWVY2","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":"9fcdd5186558915a140edb1297295c98d576d102fd3bd13c306508562bd498f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T13:55:32Z","title_canon_sha256":"40f3b7786e747452bc866232e9dad4f2fc61b94e6ebbc8cdd97dfdf1c0fb49c0"},"schema_version":"1.0","source":{"id":"1302.3092","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3092","created_at":"2026-05-18T02:34:52Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3092v2","created_at":"2026-05-18T02:34:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3092","created_at":"2026-05-18T02:34:52Z"},{"alias_kind":"pith_short_12","alias_value":"CHA5EVPD2347","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CHA5EVPD2347NVPV","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CHA5EVPD","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:9dd97532b1fccb6c61da640dfbdbb5485bc6ed41fbad6daa096451f1da58c39f","target":"graph","created_at":"2026-05-18T02:34:52Z","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":"In this paper we propose a parallel coordinate descent algorithm for solving smooth convex optimization problems with separable constraints that may arise e.g. in distributed model predictive control (MPC) for linear network systems. Our algorithm is based on block coordinate descent updates in parallel and has a very simple iteration. We prove (sub)linear rate of convergence for the new algorithm under standard assumptions for smooth convex optimization. Further, our algorithm uses local information and thus is suitable for distributed implementations. Moreover, it has low iteration complexit","authors_text":"Dragos Clipici, Ion Necoara","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T13:55:32Z","title":"Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3092","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:8d729053f953c7284548d673766edc263b1693f66b4b45c1c94a2a754c2d9503","target":"record","created_at":"2026-05-18T02:34:52Z","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":"9fcdd5186558915a140edb1297295c98d576d102fd3bd13c306508562bd498f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-02-13T13:55:32Z","title_canon_sha256":"40f3b7786e747452bc866232e9dad4f2fc61b94e6ebbc8cdd97dfdf1c0fb49c0"},"schema_version":"1.0","source":{"id":"1302.3092","kind":"arxiv","version":2}},"canonical_sha256":"11c1d255e3d6f9f6d5f550930eaed5c6833fefe95ee353577fe85f5389276448","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"11c1d255e3d6f9f6d5f550930eaed5c6833fefe95ee353577fe85f5389276448","first_computed_at":"2026-05-18T02:34:52.783523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:34:52.783523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Eun1+kpsAu++oNSkCPQOSn1GOhIXp1hu9HPify1U33cyz6iCsm8bz2xdYypoNiAtp/mWvEDzuAeeXeJDZDVECg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:34:52.784020Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3092","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8d729053f953c7284548d673766edc263b1693f66b4b45c1c94a2a754c2d9503","sha256:9dd97532b1fccb6c61da640dfbdbb5485bc6ed41fbad6daa096451f1da58c39f"],"state_sha256":"2b2a5faa0061812331a8fdc95767ad5719194576bae9892ae249254555b3bbfe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DmPID4jzmXtmPvRfVB49T0noxVJfwGE8olVewXD5G1vkfHlNB3ikuWHEjiOEvql37SgTtE2fn1EgyFgwpk0SDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:03:41.955135Z","bundle_sha256":"72afa1be707bc69d4a7c3c11876237771dab21cbf25464cfd6e7cb40add9cd33"}}