{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EJZ6ZK2IVJBXZSDD5IL2TBWUGL","short_pith_number":"pith:EJZ6ZK2I","schema_version":"1.0","canonical_sha256":"2273ecab48aa437cc863ea17a986d432caae8076f27891264af4d2a5a4d9945d","source":{"kind":"arxiv","id":"1406.6404","version":3},"attestation_state":"computed","paper":{"title":"A Class of Randomized Primal-Dual Algorithms for Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Audrey Repetti, Jean-Christophe Pesquet","submitted_at":"2014-06-24T22:30:22Z","abstract_excerpt":"Based on a preconditioned version of the randomized block-coordinate forward-backward algorithm recently proposed in [Combettes,Pesquet,2014], several variants of block-coordinate primal-dual algorithms are designed in order to solve a wide array of monotone inclusion problems. These methods rely on a sweep of blocks of variables which are activated at each iteration according to a random rule, and they allow stochastic errors in the evaluation of the involved operators. Then, this framework is employed to derive block-coordinate primal-dual proximal algorithms for solving composite convex var"},"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":"1406.6404","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-24T22:30:22Z","cross_cats_sorted":[],"title_canon_sha256":"812c9f3209d3bc032389194e14aa3e602f01726641bae692370f38676d17b511","abstract_canon_sha256":"a5748b5eebd5a9a803bc02c1f8eb8f97285b3ef1732579316c5bbada4e1fc01b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:23.612419Z","signature_b64":"Y8fFRNbSNUojr7URcNDQPG3nHm8OBqE69MAp+t9wDmZuE7fOKFPU2zfVBWFrG8Wfx8BcMFNhyO3aP1Dwh7DKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2273ecab48aa437cc863ea17a986d432caae8076f27891264af4d2a5a4d9945d","last_reissued_at":"2026-05-18T02:39:23.612076Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:23.612076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Class of Randomized Primal-Dual Algorithms for Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Audrey Repetti, Jean-Christophe Pesquet","submitted_at":"2014-06-24T22:30:22Z","abstract_excerpt":"Based on a preconditioned version of the randomized block-coordinate forward-backward algorithm recently proposed in [Combettes,Pesquet,2014], several variants of block-coordinate primal-dual algorithms are designed in order to solve a wide array of monotone inclusion problems. These methods rely on a sweep of blocks of variables which are activated at each iteration according to a random rule, and they allow stochastic errors in the evaluation of the involved operators. Then, this framework is employed to derive block-coordinate primal-dual proximal algorithms for solving composite convex var"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.6404","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":"1406.6404","created_at":"2026-05-18T02:39:23.612128+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.6404v3","created_at":"2026-05-18T02:39:23.612128+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.6404","created_at":"2026-05-18T02:39:23.612128+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJZ6ZK2IVJBX","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJZ6ZK2IVJBXZSDD","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJZ6ZK2I","created_at":"2026-05-18T12:28:28.263976+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.17027","citing_title":"Clipped Stochastic Gradient Tracking For Locally Smooth Functions","ref_index":31,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EJZ6ZK2IVJBXZSDD5IL2TBWUGL","json":"https://pith.science/pith/EJZ6ZK2IVJBXZSDD5IL2TBWUGL.json","graph_json":"https://pith.science/api/pith-number/EJZ6ZK2IVJBXZSDD5IL2TBWUGL/graph.json","events_json":"https://pith.science/api/pith-number/EJZ6ZK2IVJBXZSDD5IL2TBWUGL/events.json","paper":"https://pith.science/paper/EJZ6ZK2I"},"agent_actions":{"view_html":"https://pith.science/pith/EJZ6ZK2IVJBXZSDD5IL2TBWUGL","download_json":"https://pith.science/pith/EJZ6ZK2IVJBXZSDD5IL2TBWUGL.json","view_paper":"https://pith.science/paper/EJZ6ZK2I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.6404&json=true","fetch_graph":"https://pith.science/api/pith-number/EJZ6ZK2IVJBXZSDD5IL2TBWUGL/graph.json","fetch_events":"https://pith.science/api/pith-number/EJZ6ZK2IVJBXZSDD5IL2TBWUGL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJZ6ZK2IVJBXZSDD5IL2TBWUGL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJZ6ZK2IVJBXZSDD5IL2TBWUGL/action/storage_attestation","attest_author":"https://pith.science/pith/EJZ6ZK2IVJBXZSDD5IL2TBWUGL/action/author_attestation","sign_citation":"https://pith.science/pith/EJZ6ZK2IVJBXZSDD5IL2TBWUGL/action/citation_signature","submit_replication":"https://pith.science/pith/EJZ6ZK2IVJBXZSDD5IL2TBWUGL/action/replication_record"}},"created_at":"2026-05-18T02:39:23.612128+00:00","updated_at":"2026-05-18T02:39:23.612128+00:00"}