{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ROVEFQE5DCLIGNHLOOZBZLYKUK","short_pith_number":"pith:ROVEFQE5","canonical_record":{"source":{"id":"1407.0898","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-03T12:51:58Z","cross_cats_sorted":["cs.DC","cs.NA","cs.SY"],"title_canon_sha256":"c4925eb7f1a70eb1caee94892c43ba6def0bd6bb394a653dda4f551969800a92","abstract_canon_sha256":"602e5b6fc4919dc9d71a7d32decbb253002a34af8fbf6bf7a9c41e522776473a"},"schema_version":"1.0"},"canonical_sha256":"8baa42c09d18968334eb73b21caf0aa2bb5400d8e02e25d2c440f903d146e653","source":{"kind":"arxiv","id":"1407.0898","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0898","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0898v3","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0898","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"ROVEFQE5DCLI","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"ROVEFQE5DCLIGNHL","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"ROVEFQE5","created_at":"2026-05-18T12:28:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ROVEFQE5DCLIGNHLOOZBZLYKUK","target":"record","payload":{"canonical_record":{"source":{"id":"1407.0898","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-03T12:51:58Z","cross_cats_sorted":["cs.DC","cs.NA","cs.SY"],"title_canon_sha256":"c4925eb7f1a70eb1caee94892c43ba6def0bd6bb394a653dda4f551969800a92","abstract_canon_sha256":"602e5b6fc4919dc9d71a7d32decbb253002a34af8fbf6bf7a9c41e522776473a"},"schema_version":"1.0"},"canonical_sha256":"8baa42c09d18968334eb73b21caf0aa2bb5400d8e02e25d2c440f903d146e653","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:31:30.205674Z","signature_b64":"oNWdA7v0oP/v+9ufo206tRoiQfrzWA4r8zn1vF9/F6R0oLMX3TV9aYRS4Pm1xx/hX39aonxxSjhLWzn6j6RRBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8baa42c09d18968334eb73b21caf0aa2bb5400d8e02e25d2c440f903d146e653","last_reissued_at":"2026-05-18T01:31:30.204945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:31:30.204945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.0898","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-05-18T01:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WuLGNfwOTc/YjiZNOORhW63f92ZVuJnVQ7PGxcY34CCbLAwUklSgGY5AFia3l8CapHgqlgIPTDKgEaYKyhC1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:39:51.809451Z"},"content_sha256":"1e6aabbcde845bc023ba803fcefb37dfb689f1eb1a4cd31247dd5bd4035d11d8","schema_version":"1.0","event_id":"sha256:1e6aabbcde845bc023ba803fcefb37dfb689f1eb1a4cd31247dd5bd4035d11d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ROVEFQE5DCLIGNHLOOZBZLYKUK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NA","cs.SY"],"primary_cat":"math.OC","authors_text":"Franck Iutzeler, Pascal Bianchi, Walid Hachem","submitted_at":"2014-07-03T12:51:58Z","abstract_excerpt":"Based on the idea of randomized coordinate descent of $\\alpha$-averaged operators, a randomized primal-dual optimization algorithm is introduced, where a random subset of coordinates is updated at each iteration. The algorithm builds upon a variant of a recent (deterministic) algorithm proposed by V\\~u and Condat that includes the well known ADMM as a particular case. The obtained algorithm is used to solve asynchronously a distributed optimization problem. A network of agents, each having a separate cost function containing a differentiable term, seek to find a consensus on the minimum of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0898","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":""},"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-18T01:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3dnKkRjEH+a51c9cOG5Q0un1x+IilDgHLwxhdI3vFiJsMpzwe0Tchf4w4ZSFl1QD//gU0zR3j/I6YYEHj/CoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:39:51.809810Z"},"content_sha256":"45fd4038ffc29727df01277548e899b533bcfc5d6c20cf6b9d33d20b039efc32","schema_version":"1.0","event_id":"sha256:45fd4038ffc29727df01277548e899b533bcfc5d6c20cf6b9d33d20b039efc32"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK/bundle.json","state_url":"https://pith.science/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK/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-06-02T22:39:51Z","links":{"resolver":"https://pith.science/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK","bundle":"https://pith.science/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK/bundle.json","state":"https://pith.science/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ROVEFQE5DCLIGNHLOOZBZLYKUK","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":"602e5b6fc4919dc9d71a7d32decbb253002a34af8fbf6bf7a9c41e522776473a","cross_cats_sorted":["cs.DC","cs.NA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-03T12:51:58Z","title_canon_sha256":"c4925eb7f1a70eb1caee94892c43ba6def0bd6bb394a653dda4f551969800a92"},"schema_version":"1.0","source":{"id":"1407.0898","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.0898","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1407.0898v3","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0898","created_at":"2026-05-18T01:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"ROVEFQE5DCLI","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_16","alias_value":"ROVEFQE5DCLIGNHL","created_at":"2026-05-18T12:28:46Z"},{"alias_kind":"pith_short_8","alias_value":"ROVEFQE5","created_at":"2026-05-18T12:28:46Z"}],"graph_snapshots":[{"event_id":"sha256:45fd4038ffc29727df01277548e899b533bcfc5d6c20cf6b9d33d20b039efc32","target":"graph","created_at":"2026-05-18T01:31:30Z","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":"Based on the idea of randomized coordinate descent of $\\alpha$-averaged operators, a randomized primal-dual optimization algorithm is introduced, where a random subset of coordinates is updated at each iteration. The algorithm builds upon a variant of a recent (deterministic) algorithm proposed by V\\~u and Condat that includes the well known ADMM as a particular case. The obtained algorithm is used to solve asynchronously a distributed optimization problem. A network of agents, each having a separate cost function containing a differentiable term, seek to find a consensus on the minimum of the","authors_text":"Franck Iutzeler, Pascal Bianchi, Walid Hachem","cross_cats":["cs.DC","cs.NA","cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-03T12:51:58Z","title":"A Coordinate Descent Primal-Dual Algorithm and Application to Distributed Asynchronous Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.0898","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:1e6aabbcde845bc023ba803fcefb37dfb689f1eb1a4cd31247dd5bd4035d11d8","target":"record","created_at":"2026-05-18T01:31:30Z","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":"602e5b6fc4919dc9d71a7d32decbb253002a34af8fbf6bf7a9c41e522776473a","cross_cats_sorted":["cs.DC","cs.NA","cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-03T12:51:58Z","title_canon_sha256":"c4925eb7f1a70eb1caee94892c43ba6def0bd6bb394a653dda4f551969800a92"},"schema_version":"1.0","source":{"id":"1407.0898","kind":"arxiv","version":3}},"canonical_sha256":"8baa42c09d18968334eb73b21caf0aa2bb5400d8e02e25d2c440f903d146e653","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8baa42c09d18968334eb73b21caf0aa2bb5400d8e02e25d2c440f903d146e653","first_computed_at":"2026-05-18T01:31:30.204945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:31:30.204945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oNWdA7v0oP/v+9ufo206tRoiQfrzWA4r8zn1vF9/F6R0oLMX3TV9aYRS4Pm1xx/hX39aonxxSjhLWzn6j6RRBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:31:30.205674Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.0898","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1e6aabbcde845bc023ba803fcefb37dfb689f1eb1a4cd31247dd5bd4035d11d8","sha256:45fd4038ffc29727df01277548e899b533bcfc5d6c20cf6b9d33d20b039efc32"],"state_sha256":"34db461e2fc262e64e17626911d61ebdac6a1c7042b3f47e03029e94ce060bd1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"knx7vYQxNG95VWVzimACXe8BPtR57HNwDlpja4r5Vc60IiBsP0Ab9jkbn9Rb16FROGx4vuL5oMBLJnK54YDYCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:39:51.811849Z","bundle_sha256":"cae464285c733f9bccb1426f6c7f78de524f0d3d4fc3e59813c1dd6fcd12b57f"}}