{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:HEETI7U3NQJLGYBMFRVAANIDZ4","short_pith_number":"pith:HEETI7U3","canonical_record":{"source":{"id":"1701.03893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-14T08:46:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f4d9d45f724125654d624349b68a6debb8e8b52bb4f49a84b03fe86a575531e7","abstract_canon_sha256":"6f0f0ddb3167e20f350d0856e714ad1abba05679f0f71322fcfe27378a43214d"},"schema_version":"1.0"},"canonical_sha256":"3909347e9b6c12b3602c2c6a003503cf3ce4608a6f24f0fef846f173d5d8cf0a","source":{"kind":"arxiv","id":"1701.03893","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03893","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03893v1","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03893","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"HEETI7U3NQJL","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HEETI7U3NQJLGYBM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HEETI7U3","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:HEETI7U3NQJLGYBMFRVAANIDZ4","target":"record","payload":{"canonical_record":{"source":{"id":"1701.03893","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-14T08:46:01Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f4d9d45f724125654d624349b68a6debb8e8b52bb4f49a84b03fe86a575531e7","abstract_canon_sha256":"6f0f0ddb3167e20f350d0856e714ad1abba05679f0f71322fcfe27378a43214d"},"schema_version":"1.0"},"canonical_sha256":"3909347e9b6c12b3602c2c6a003503cf3ce4608a6f24f0fef846f173d5d8cf0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:52:48.586424Z","signature_b64":"uXEZ+tzznHBcWFo5qH6RHmsg2xKXJZetMfTQ0RWbZAlUWYvIsVO3FZv1t2XiRZorcDbt6oaol7u66XKLI/dPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3909347e9b6c12b3602c2c6a003503cf3ce4608a6f24f0fef846f173d5d8cf0a","last_reissued_at":"2026-05-18T00:52:48.585834Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:52:48.585834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.03893","source_version":1,"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-18T00:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AxfKTER0R48kAgzgFAsdQypJaRLhlaZvEdR3c1vfQKpyImGm8P3vdaM+HHfb7FdPXWnEpvoCc1tb2T2Etj+bAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:15:44.420326Z"},"content_sha256":"bb409d36fc339d67dfdb98145e016d65af2541df01061c0cf1563edc8b59dc5a","schema_version":"1.0","event_id":"sha256:bb409d36fc339d67dfdb98145e016d65af2541df01061c0cf1563edc8b59dc5a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:HEETI7U3NQJLGYBMFRVAANIDZ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Analysis of Distributed ADMM Algorithm for Consensus Optimization in Presence of Error","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Farshad Lahouti, Layla Majzoobi","submitted_at":"2017-01-14T08:46:01Z","abstract_excerpt":"ADMM is a popular algorithm for solving convex optimization problems. Applying this algorithm to distributed consensus optimization problem results in a fully distributed iterative solution which relies on processing at the nodes and communication between neighbors. Local computations usually suffer from different types of errors, due to e.g., observation or quantization noise, which can degrade the performance of the algorithm. In this work, we focus on analyzing the convergence behavior of distributed ADMM for consensus optimization in presence of additive node error. We specifically show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03893","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"},"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-18T00:52:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D8xqHK2nlSdc9NU25ugs0zykyAkKoOdQj9jnBulUyMTemuVJSo358w71E4HHOCh3JIspBZiZy1+jzK4r6RPeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:15:44.420681Z"},"content_sha256":"7dbe627c34fe96a25cfdf77394f76df6a57ff799145e216f53ad8f0f27373536","schema_version":"1.0","event_id":"sha256:7dbe627c34fe96a25cfdf77394f76df6a57ff799145e216f53ad8f0f27373536"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEETI7U3NQJLGYBMFRVAANIDZ4/bundle.json","state_url":"https://pith.science/pith/HEETI7U3NQJLGYBMFRVAANIDZ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEETI7U3NQJLGYBMFRVAANIDZ4/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-05T12:15:44Z","links":{"resolver":"https://pith.science/pith/HEETI7U3NQJLGYBMFRVAANIDZ4","bundle":"https://pith.science/pith/HEETI7U3NQJLGYBMFRVAANIDZ4/bundle.json","state":"https://pith.science/pith/HEETI7U3NQJLGYBMFRVAANIDZ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEETI7U3NQJLGYBMFRVAANIDZ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:HEETI7U3NQJLGYBMFRVAANIDZ4","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":"6f0f0ddb3167e20f350d0856e714ad1abba05679f0f71322fcfe27378a43214d","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-14T08:46:01Z","title_canon_sha256":"f4d9d45f724125654d624349b68a6debb8e8b52bb4f49a84b03fe86a575531e7"},"schema_version":"1.0","source":{"id":"1701.03893","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.03893","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"arxiv_version","alias_value":"1701.03893v1","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.03893","created_at":"2026-05-18T00:52:48Z"},{"alias_kind":"pith_short_12","alias_value":"HEETI7U3NQJL","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"HEETI7U3NQJLGYBM","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"HEETI7U3","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:7dbe627c34fe96a25cfdf77394f76df6a57ff799145e216f53ad8f0f27373536","target":"graph","created_at":"2026-05-18T00:52:48Z","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":"ADMM is a popular algorithm for solving convex optimization problems. Applying this algorithm to distributed consensus optimization problem results in a fully distributed iterative solution which relies on processing at the nodes and communication between neighbors. Local computations usually suffer from different types of errors, due to e.g., observation or quantization noise, which can degrade the performance of the algorithm. In this work, we focus on analyzing the convergence behavior of distributed ADMM for consensus optimization in presence of additive node error. We specifically show th","authors_text":"Farshad Lahouti, Layla Majzoobi","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-14T08:46:01Z","title":"Analysis of Distributed ADMM Algorithm for Consensus Optimization in Presence of Error"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.03893","kind":"arxiv","version":1},"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:bb409d36fc339d67dfdb98145e016d65af2541df01061c0cf1563edc8b59dc5a","target":"record","created_at":"2026-05-18T00:52:48Z","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":"6f0f0ddb3167e20f350d0856e714ad1abba05679f0f71322fcfe27378a43214d","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-01-14T08:46:01Z","title_canon_sha256":"f4d9d45f724125654d624349b68a6debb8e8b52bb4f49a84b03fe86a575531e7"},"schema_version":"1.0","source":{"id":"1701.03893","kind":"arxiv","version":1}},"canonical_sha256":"3909347e9b6c12b3602c2c6a003503cf3ce4608a6f24f0fef846f173d5d8cf0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3909347e9b6c12b3602c2c6a003503cf3ce4608a6f24f0fef846f173d5d8cf0a","first_computed_at":"2026-05-18T00:52:48.585834Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:52:48.585834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uXEZ+tzznHBcWFo5qH6RHmsg2xKXJZetMfTQ0RWbZAlUWYvIsVO3FZv1t2XiRZorcDbt6oaol7u66XKLI/dPBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:52:48.586424Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.03893","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb409d36fc339d67dfdb98145e016d65af2541df01061c0cf1563edc8b59dc5a","sha256:7dbe627c34fe96a25cfdf77394f76df6a57ff799145e216f53ad8f0f27373536"],"state_sha256":"185edf2ad7b49e520a1b7a3a6e751467bf269f333dbabc87b37e8f8ce6c8742f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0MtSn+QW9MyKO+y0Wzzew9udZ8yzH47K7lK2galZadk9G7qN5EcnPaWp7/dN3Xx3xKUgRXW7SmQPeYGRDTCwDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:15:44.422627Z","bundle_sha256":"c7516863ca18241c2d82d75145ff86ac69077a2f6b162d599396baa794cf07fc"}}