{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:7BYW4KJKXIOT3UEBRPZBFYN2AK","short_pith_number":"pith:7BYW4KJK","canonical_record":{"source":{"id":"1612.00150","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-01T05:17:29Z","cross_cats_sorted":["cs.DC","cs.MA"],"title_canon_sha256":"5b572937cbb171c3e508e5118c109f89c7ddc4c6d68c0bcbaa606e51e28461e8","abstract_canon_sha256":"d33d9e6656a55231d69bb8213449f7be07b0a578b54a1cab8d52104f50a328c6"},"schema_version":"1.0"},"canonical_sha256":"f8716e292aba1d3dd0818bf212e1ba028ff31b5f6d23c41c7dd9e15d36910ffe","source":{"kind":"arxiv","id":"1612.00150","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00150","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00150v2","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00150","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"pith_short_12","alias_value":"7BYW4KJKXIOT","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7BYW4KJKXIOT3UEB","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7BYW4KJK","created_at":"2026-05-18T12:30:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:7BYW4KJKXIOT3UEBRPZBFYN2AK","target":"record","payload":{"canonical_record":{"source":{"id":"1612.00150","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-01T05:17:29Z","cross_cats_sorted":["cs.DC","cs.MA"],"title_canon_sha256":"5b572937cbb171c3e508e5118c109f89c7ddc4c6d68c0bcbaa606e51e28461e8","abstract_canon_sha256":"d33d9e6656a55231d69bb8213449f7be07b0a578b54a1cab8d52104f50a328c6"},"schema_version":"1.0"},"canonical_sha256":"f8716e292aba1d3dd0818bf212e1ba028ff31b5f6d23c41c7dd9e15d36910ffe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:37.746180Z","signature_b64":"5Y668vsY428gzm/hdSzusbPKNadVw5yQiCVyouq7V2BgCwrBqe6IESCcHaloG0Rb9lNbxSyKFHSUF+HSuHfpDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8716e292aba1d3dd0818bf212e1ba028ff31b5f6d23c41c7dd9e15d36910ffe","last_reissued_at":"2026-05-18T00:49:37.745459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:37.745459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.00150","source_version":2,"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:49:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GYjbZWXW8OH3yxZrm572oRpk7U7QpmIy7E9K/jNlbk8lRWvo4dtVVGSymuck/6LvTvSxpbc/nG8YeHjmrKFADw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:47:52.951018Z"},"content_sha256":"74ccbedc53b7554ddb1b6efe2f2d0d1808755d4ca07bbef0f311ae093d3ddfe8","schema_version":"1.0","event_id":"sha256:74ccbedc53b7554ddb1b6efe2f2d0d1808755d4ca07bbef0f311ae093d3ddfe8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:7BYW4KJKXIOT3UEBRPZBFYN2AK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decentralized Consensus Optimization with Asynchrony and Delays","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.MA"],"primary_cat":"math.OC","authors_text":"Ali H. Sayed, Kun Yuan, Qing Ling, Tianyu Wu, Wotao Yin","submitted_at":"2016-12-01T05:17:29Z","abstract_excerpt":"We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs over a network in which the agents communicate with their neighbors and perform local computation. In the proposed algorithm, each agent can compute and communicate independently at different times, for different durations, with the information it has even if the latest information from its neighbors is not yet available. Such an asynchronous algorithm reduces the time that agents would otherwise waste idle because of communication delays or because their neighbors are slower. It also eliminates "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00150","kind":"arxiv","version":2},"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:49:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5YToIYPF+PcXFVQdCbLYuXm3D5qavpUmsna5b30rpX/w+HLKO2V3kVu33orj8JcfX1HaMqDJLfuj0I7NNjOjBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T21:47:52.951430Z"},"content_sha256":"630090c596246cc98b8787a0aecb7de9cf4c8e99b78d71c96aacba772fb06414","schema_version":"1.0","event_id":"sha256:630090c596246cc98b8787a0aecb7de9cf4c8e99b78d71c96aacba772fb06414"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7BYW4KJKXIOT3UEBRPZBFYN2AK/bundle.json","state_url":"https://pith.science/pith/7BYW4KJKXIOT3UEBRPZBFYN2AK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7BYW4KJKXIOT3UEBRPZBFYN2AK/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-05-29T21:47:52Z","links":{"resolver":"https://pith.science/pith/7BYW4KJKXIOT3UEBRPZBFYN2AK","bundle":"https://pith.science/pith/7BYW4KJKXIOT3UEBRPZBFYN2AK/bundle.json","state":"https://pith.science/pith/7BYW4KJKXIOT3UEBRPZBFYN2AK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7BYW4KJKXIOT3UEBRPZBFYN2AK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:7BYW4KJKXIOT3UEBRPZBFYN2AK","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":"d33d9e6656a55231d69bb8213449f7be07b0a578b54a1cab8d52104f50a328c6","cross_cats_sorted":["cs.DC","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-01T05:17:29Z","title_canon_sha256":"5b572937cbb171c3e508e5118c109f89c7ddc4c6d68c0bcbaa606e51e28461e8"},"schema_version":"1.0","source":{"id":"1612.00150","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.00150","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"arxiv_version","alias_value":"1612.00150v2","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.00150","created_at":"2026-05-18T00:49:37Z"},{"alias_kind":"pith_short_12","alias_value":"7BYW4KJKXIOT","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_16","alias_value":"7BYW4KJKXIOT3UEB","created_at":"2026-05-18T12:30:04Z"},{"alias_kind":"pith_short_8","alias_value":"7BYW4KJK","created_at":"2026-05-18T12:30:04Z"}],"graph_snapshots":[{"event_id":"sha256:630090c596246cc98b8787a0aecb7de9cf4c8e99b78d71c96aacba772fb06414","target":"graph","created_at":"2026-05-18T00:49:37Z","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":"We propose an asynchronous, decentralized algorithm for consensus optimization. The algorithm runs over a network in which the agents communicate with their neighbors and perform local computation. In the proposed algorithm, each agent can compute and communicate independently at different times, for different durations, with the information it has even if the latest information from its neighbors is not yet available. Such an asynchronous algorithm reduces the time that agents would otherwise waste idle because of communication delays or because their neighbors are slower. It also eliminates ","authors_text":"Ali H. Sayed, Kun Yuan, Qing Ling, Tianyu Wu, Wotao Yin","cross_cats":["cs.DC","cs.MA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-01T05:17:29Z","title":"Decentralized Consensus Optimization with Asynchrony and Delays"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.00150","kind":"arxiv","version":2},"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:74ccbedc53b7554ddb1b6efe2f2d0d1808755d4ca07bbef0f311ae093d3ddfe8","target":"record","created_at":"2026-05-18T00:49:37Z","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":"d33d9e6656a55231d69bb8213449f7be07b0a578b54a1cab8d52104f50a328c6","cross_cats_sorted":["cs.DC","cs.MA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-01T05:17:29Z","title_canon_sha256":"5b572937cbb171c3e508e5118c109f89c7ddc4c6d68c0bcbaa606e51e28461e8"},"schema_version":"1.0","source":{"id":"1612.00150","kind":"arxiv","version":2}},"canonical_sha256":"f8716e292aba1d3dd0818bf212e1ba028ff31b5f6d23c41c7dd9e15d36910ffe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f8716e292aba1d3dd0818bf212e1ba028ff31b5f6d23c41c7dd9e15d36910ffe","first_computed_at":"2026-05-18T00:49:37.745459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:49:37.745459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5Y668vsY428gzm/hdSzusbPKNadVw5yQiCVyouq7V2BgCwrBqe6IESCcHaloG0Rb9lNbxSyKFHSUF+HSuHfpDA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:49:37.746180Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.00150","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:74ccbedc53b7554ddb1b6efe2f2d0d1808755d4ca07bbef0f311ae093d3ddfe8","sha256:630090c596246cc98b8787a0aecb7de9cf4c8e99b78d71c96aacba772fb06414"],"state_sha256":"93d74022741988e116995b58a5d0d6dbd995ea2579a5f3546758e7a356d8be83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OIreWD5glUetCd+7cwPfM4ZfuFulsEaUm6ekU7VWHc6neiHSOFdTpXuaw1gnJvuVfgv2M54K4Je9DlxbtZPtBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T21:47:52.954953Z","bundle_sha256":"058de48167de376ea85947cfc5efd881dfe70ae4be2b20c27caaa761912b8d45"}}