{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ROVEFQE5DCLIGNHLOOZBZLYKUK","short_pith_number":"pith:ROVEFQE5","schema_version":"1.0","canonical_sha256":"8baa42c09d18968334eb73b21caf0aa2bb5400d8e02e25d2c440f903d146e653","source":{"kind":"arxiv","id":"1407.0898","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.0898","created_at":"2026-05-18T01:31:30.205034+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.0898v3","created_at":"2026-05-18T01:31:30.205034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.0898","created_at":"2026-05-18T01:31:30.205034+00:00"},{"alias_kind":"pith_short_12","alias_value":"ROVEFQE5DCLI","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"ROVEFQE5DCLIGNHL","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"ROVEFQE5","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK","json":"https://pith.science/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK.json","graph_json":"https://pith.science/api/pith-number/ROVEFQE5DCLIGNHLOOZBZLYKUK/graph.json","events_json":"https://pith.science/api/pith-number/ROVEFQE5DCLIGNHLOOZBZLYKUK/events.json","paper":"https://pith.science/paper/ROVEFQE5"},"agent_actions":{"view_html":"https://pith.science/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK","download_json":"https://pith.science/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK.json","view_paper":"https://pith.science/paper/ROVEFQE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.0898&json=true","fetch_graph":"https://pith.science/api/pith-number/ROVEFQE5DCLIGNHLOOZBZLYKUK/graph.json","fetch_events":"https://pith.science/api/pith-number/ROVEFQE5DCLIGNHLOOZBZLYKUK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK/action/storage_attestation","attest_author":"https://pith.science/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK/action/author_attestation","sign_citation":"https://pith.science/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK/action/citation_signature","submit_replication":"https://pith.science/pith/ROVEFQE5DCLIGNHLOOZBZLYKUK/action/replication_record"}},"created_at":"2026-05-18T01:31:30.205034+00:00","updated_at":"2026-05-18T01:31:30.205034+00:00"}