{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EAOWYZ5DLTG3TRUB5DML5D77YS","short_pith_number":"pith:EAOWYZ5D","schema_version":"1.0","canonical_sha256":"201d6c67a35ccdb9c681e8d8be8fffc4a8926c6be2b00c4c165e13b4fa88085d","source":{"kind":"arxiv","id":"1901.02436","version":1},"attestation_state":"computed","paper":{"title":"Analysis of Distributed ADMM Algorithm for Consensus Optimization in Presence of Node Error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"eess.SP","authors_text":"Farshad Lahouti, Layla Majzoobi, Vahid Shah-Mansouri","submitted_at":"2019-01-08T18:32:17Z","abstract_excerpt":"Alternating Direction Method of Multipliers (ADMM) is a popular convex optimization algorithm, which can be employed for solving distributed consensus optimization problems. In this setting agents locally estimate the optimal solution of an optimization problem and exchange messages with their neighbors over a connected network. The distributed algorithms are typically exposed to different types of errors in practice, e.g., due to quantization or communication noise or loss. We here focus on analyzing the convergence of distributed ADMM for consensus optimization in presence of additive random"},"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":"1901.02436","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2019-01-08T18:32:17Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"57bcc8a34d12cbf886b4d5f93ca445c596c344e2ae3247e6c20006e6630313b4","abstract_canon_sha256":"e2cfbff3f0b2ea7b059e5a43f99eb0e9c1e8a3cb02682ea049b9e31efb877452"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:21.989060Z","signature_b64":"trKxRn7G5jutlYEkXG9IaTaj9D3a3BwyF6jwQVfEAOipy0DjiAWe60A29G1YIcjikGZtuyldGhrISYoJJuKGDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"201d6c67a35ccdb9c681e8d8be8fffc4a8926c6be2b00c4c165e13b4fa88085d","last_reissued_at":"2026-05-17T23:50:21.988541Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:21.988541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Analysis of Distributed ADMM Algorithm for Consensus Optimization in Presence of Node Error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"eess.SP","authors_text":"Farshad Lahouti, Layla Majzoobi, Vahid Shah-Mansouri","submitted_at":"2019-01-08T18:32:17Z","abstract_excerpt":"Alternating Direction Method of Multipliers (ADMM) is a popular convex optimization algorithm, which can be employed for solving distributed consensus optimization problems. In this setting agents locally estimate the optimal solution of an optimization problem and exchange messages with their neighbors over a connected network. The distributed algorithms are typically exposed to different types of errors in practice, e.g., due to quantization or communication noise or loss. We here focus on analyzing the convergence of distributed ADMM for consensus optimization in presence of additive random"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02436","kind":"arxiv","version":1},"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":"1901.02436","created_at":"2026-05-17T23:50:21.988627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.02436v1","created_at":"2026-05-17T23:50:21.988627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.02436","created_at":"2026-05-17T23:50:21.988627+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAOWYZ5DLTG3","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAOWYZ5DLTG3TRUB","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAOWYZ5D","created_at":"2026-05-18T12:33:15.570797+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/EAOWYZ5DLTG3TRUB5DML5D77YS","json":"https://pith.science/pith/EAOWYZ5DLTG3TRUB5DML5D77YS.json","graph_json":"https://pith.science/api/pith-number/EAOWYZ5DLTG3TRUB5DML5D77YS/graph.json","events_json":"https://pith.science/api/pith-number/EAOWYZ5DLTG3TRUB5DML5D77YS/events.json","paper":"https://pith.science/paper/EAOWYZ5D"},"agent_actions":{"view_html":"https://pith.science/pith/EAOWYZ5DLTG3TRUB5DML5D77YS","download_json":"https://pith.science/pith/EAOWYZ5DLTG3TRUB5DML5D77YS.json","view_paper":"https://pith.science/paper/EAOWYZ5D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.02436&json=true","fetch_graph":"https://pith.science/api/pith-number/EAOWYZ5DLTG3TRUB5DML5D77YS/graph.json","fetch_events":"https://pith.science/api/pith-number/EAOWYZ5DLTG3TRUB5DML5D77YS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAOWYZ5DLTG3TRUB5DML5D77YS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAOWYZ5DLTG3TRUB5DML5D77YS/action/storage_attestation","attest_author":"https://pith.science/pith/EAOWYZ5DLTG3TRUB5DML5D77YS/action/author_attestation","sign_citation":"https://pith.science/pith/EAOWYZ5DLTG3TRUB5DML5D77YS/action/citation_signature","submit_replication":"https://pith.science/pith/EAOWYZ5DLTG3TRUB5DML5D77YS/action/replication_record"}},"created_at":"2026-05-17T23:50:21.988627+00:00","updated_at":"2026-05-17T23:50:21.988627+00:00"}