{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:VCBQVTMMXVEBB55ZTDBJJNZFKQ","short_pith_number":"pith:VCBQVTMM","canonical_record":{"source":{"id":"1810.05067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-11T15:05:27Z","cross_cats_sorted":[],"title_canon_sha256":"41f448f55c77cf2281d92ba8d3ac5372b002828188968ecdf627bb1494ad0324","abstract_canon_sha256":"3824a29a94c08f23cce95f20fd82557b26032f80eb556a1b27dcb4b69fc94b74"},"schema_version":"1.0"},"canonical_sha256":"a8830acd8cbd4810f7b998c294b7255407d66bcc23162d3d1b32512dc22ca158","source":{"kind":"arxiv","id":"1810.05067","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05067","created_at":"2026-07-05T04:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05067v3","created_at":"2026-07-05T04:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05067","created_at":"2026-07-05T04:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"VCBQVTMMXVEB","created_at":"2026-07-05T04:10:20Z"},{"alias_kind":"pith_short_16","alias_value":"VCBQVTMMXVEBB55Z","created_at":"2026-07-05T04:10:20Z"},{"alias_kind":"pith_short_8","alias_value":"VCBQVTMM","created_at":"2026-07-05T04:10:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:VCBQVTMMXVEBB55ZTDBJJNZFKQ","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05067","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-11T15:05:27Z","cross_cats_sorted":[],"title_canon_sha256":"41f448f55c77cf2281d92ba8d3ac5372b002828188968ecdf627bb1494ad0324","abstract_canon_sha256":"3824a29a94c08f23cce95f20fd82557b26032f80eb556a1b27dcb4b69fc94b74"},"schema_version":"1.0"},"canonical_sha256":"a8830acd8cbd4810f7b998c294b7255407d66bcc23162d3d1b32512dc22ca158","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:10:20.305533Z","signature_b64":"ZRfIsxukmdWMPg+wkTtNbzlsEIrtxOdodpqPa4ikXSfuKhVyVFpvrZsW5tGIsQuPSb6IhyJw8NSAK18t02vkBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8830acd8cbd4810f7b998c294b7255407d66bcc23162d3d1b32512dc22ca158","last_reissued_at":"2026-07-05T04:10:20.304915Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:10:20.304915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05067","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-07-05T04:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDGj7CxnY2j9obiaMVXzzNy/jCxW9lLfi7nwncTu/aty1RE4IYP+Pk4BtG/DvDyY/9Z3quU+DGbOmpubgTxrDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:00:23.822334Z"},"content_sha256":"0c405a2f516243cf4b4f36c81476d8af49b9fa0a163f581650cd8077f8c51efb","schema_version":"1.0","event_id":"sha256:0c405a2f516243cf4b4f36c81476d8af49b9fa0a163f581650cd8077f8c51efb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:VCBQVTMMXVEBB55ZTDBJJNZFKQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linearly Convergent Asynchronous Distributed ADMM via Markov Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Konstantin E. Avrachenkov, Suhail M. Shah","submitted_at":"2018-10-11T15:05:27Z","abstract_excerpt":"We consider the consensual distributed optimization problem and propose an asynchronous version of the Alternating Direction Method of Multipliers (ADMM) algorithm to solve it. The `asynchronous' part here refers to the fact that only one node/processor is updated (i.e. performs a minimization step) at each iteration of the algorithm. The selection of the node to be updated is decided by simulating a Markov chain. The proposed algorithm is shown to have a linear convergence property in expectation for the class of functions which are strongly convex and continuously differentiable."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05067","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.05067/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gag3sg1ykXamP73Qv0qz/jOZ0RW6+VkFh9DsNfM5mNKhPGTljXeHKr023l7GTnIGYvF/mvxhyiYuk2En2txgAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:00:23.823251Z"},"content_sha256":"5c813c9d6ec6fbbbfde0e334e3ac4c6c2308cc55b490490575c86ee735998885","schema_version":"1.0","event_id":"sha256:5c813c9d6ec6fbbbfde0e334e3ac4c6c2308cc55b490490575c86ee735998885"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VCBQVTMMXVEBB55ZTDBJJNZFKQ/bundle.json","state_url":"https://pith.science/pith/VCBQVTMMXVEBB55ZTDBJJNZFKQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VCBQVTMMXVEBB55ZTDBJJNZFKQ/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-08-06T01:00:23Z","links":{"resolver":"https://pith.science/pith/VCBQVTMMXVEBB55ZTDBJJNZFKQ","bundle":"https://pith.science/pith/VCBQVTMMXVEBB55ZTDBJJNZFKQ/bundle.json","state":"https://pith.science/pith/VCBQVTMMXVEBB55ZTDBJJNZFKQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VCBQVTMMXVEBB55ZTDBJJNZFKQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:VCBQVTMMXVEBB55ZTDBJJNZFKQ","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":"3824a29a94c08f23cce95f20fd82557b26032f80eb556a1b27dcb4b69fc94b74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-11T15:05:27Z","title_canon_sha256":"41f448f55c77cf2281d92ba8d3ac5372b002828188968ecdf627bb1494ad0324"},"schema_version":"1.0","source":{"id":"1810.05067","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05067","created_at":"2026-07-05T04:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05067v3","created_at":"2026-07-05T04:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05067","created_at":"2026-07-05T04:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"VCBQVTMMXVEB","created_at":"2026-07-05T04:10:20Z"},{"alias_kind":"pith_short_16","alias_value":"VCBQVTMMXVEBB55Z","created_at":"2026-07-05T04:10:20Z"},{"alias_kind":"pith_short_8","alias_value":"VCBQVTMM","created_at":"2026-07-05T04:10:20Z"}],"graph_snapshots":[{"event_id":"sha256:5c813c9d6ec6fbbbfde0e334e3ac4c6c2308cc55b490490575c86ee735998885","target":"graph","created_at":"2026-07-05T04:10:20Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1810.05067/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the consensual distributed optimization problem and propose an asynchronous version of the Alternating Direction Method of Multipliers (ADMM) algorithm to solve it. The `asynchronous' part here refers to the fact that only one node/processor is updated (i.e. performs a minimization step) at each iteration of the algorithm. The selection of the node to be updated is decided by simulating a Markov chain. The proposed algorithm is shown to have a linear convergence property in expectation for the class of functions which are strongly convex and continuously differentiable.","authors_text":"Konstantin E. Avrachenkov, Suhail M. Shah","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-11T15:05:27Z","title":"Linearly Convergent Asynchronous Distributed ADMM via Markov Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05067","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:0c405a2f516243cf4b4f36c81476d8af49b9fa0a163f581650cd8077f8c51efb","target":"record","created_at":"2026-07-05T04:10:20Z","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":"3824a29a94c08f23cce95f20fd82557b26032f80eb556a1b27dcb4b69fc94b74","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-11T15:05:27Z","title_canon_sha256":"41f448f55c77cf2281d92ba8d3ac5372b002828188968ecdf627bb1494ad0324"},"schema_version":"1.0","source":{"id":"1810.05067","kind":"arxiv","version":3}},"canonical_sha256":"a8830acd8cbd4810f7b998c294b7255407d66bcc23162d3d1b32512dc22ca158","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8830acd8cbd4810f7b998c294b7255407d66bcc23162d3d1b32512dc22ca158","first_computed_at":"2026-07-05T04:10:20.304915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:10:20.304915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZRfIsxukmdWMPg+wkTtNbzlsEIrtxOdodpqPa4ikXSfuKhVyVFpvrZsW5tGIsQuPSb6IhyJw8NSAK18t02vkBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T04:10:20.305533Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05067","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c405a2f516243cf4b4f36c81476d8af49b9fa0a163f581650cd8077f8c51efb","sha256:5c813c9d6ec6fbbbfde0e334e3ac4c6c2308cc55b490490575c86ee735998885"],"state_sha256":"56edfa4245965cd8799f84029dee253e641b16309f1d292ebfb63bb78a2b0988"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GN/0jqDen+5O1kZOL1v9T8aWqYC0mtgbKbutzCkdjLPM5fkwAjUza+rdZjCJWw0LtDHzMzsJuaiDO9pGLncbDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T01:00:23.830343Z","bundle_sha256":"78cf32adbb24432bc2edbbe5dfc8ac9cb2fd8134dfc731c4ad2dd5e537f9b844"}}