{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:74D53DNEPU7TGAM2C2U3P73C52","short_pith_number":"pith:74D53DNE","canonical_record":{"source":{"id":"1901.08215","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-24T03:31:45Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a9456e1a2aeb460e6ae57e1c1a1163023c23815bc3edc1146a5ff981d78bc122","abstract_canon_sha256":"1ea534edcef5fe8b610484ea197b81cad40b7974c27a3f21eb894c65760ff490"},"schema_version":"1.0"},"canonical_sha256":"ff07dd8da47d3f33019a16a9b7ff62eeb7d025cb6968557e30f53cf11e2094df","source":{"kind":"arxiv","id":"1901.08215","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08215","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08215v3","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08215","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"74D53DNEPU7T","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"pith_short_16","alias_value":"74D53DNEPU7TGAM2","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"pith_short_8","alias_value":"74D53DNE","created_at":"2026-07-05T02:04:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:74D53DNEPU7TGAM2C2U3P73C52","target":"record","payload":{"canonical_record":{"source":{"id":"1901.08215","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-24T03:31:45Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"a9456e1a2aeb460e6ae57e1c1a1163023c23815bc3edc1146a5ff981d78bc122","abstract_canon_sha256":"1ea534edcef5fe8b610484ea197b81cad40b7974c27a3f21eb894c65760ff490"},"schema_version":"1.0"},"canonical_sha256":"ff07dd8da47d3f33019a16a9b7ff62eeb7d025cb6968557e30f53cf11e2094df","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:04:02.788269Z","signature_b64":"1lXEpA2pCG/3gcVVbLybPE/GzweD70nQguUfSFQNEc7Y5vtC+XEAFPbTjaELU/lQvQ8L9LRKiQyG/2yxRyhRBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ff07dd8da47d3f33019a16a9b7ff62eeb7d025cb6968557e30f53cf11e2094df","last_reissued_at":"2026-07-05T02:04:02.787802Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:04:02.787802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.08215","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-05T02:04:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"24z5/p6gjzt08Mu4k8V8fZikKm9jxvlWhWh+YwNFhjbgL7NnoHFFwgfovcEygqcr7/6Wwg+ULWYm4m4V/6wgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T22:03:36.669332Z"},"content_sha256":"613b527499c9d4872fc3c69f7a32ee94739b20c7f015fff993c859899a0048cd","schema_version":"1.0","event_id":"sha256:613b527499c9d4872fc3c69f7a32ee94739b20c7f015fff993c859899a0048cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:74D53DNEPU7TGAM2C2U3P73C52","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fully Asynchronous Distributed Optimization with Linear Convergence in Directed Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DC","authors_text":"Jiaqi Zhang, Keyou You","submitted_at":"2019-01-24T03:31:45Z","abstract_excerpt":"We consider the distributed optimization problem, the goal of which is to minimize the sum of local objective functions over a directed network. Though it has been widely studied recently, most of the existing algorithms are designed for synchronized or randomly activated implementation, which may create deadlocks in practice. In sharp contrast, we propose a \\emph{fully} asynchronous push-pull gradient algorithm (APPG) where each node updates without waiting for any other node by using (possibly stale) information from neighbors. Thus, it is both deadlock-free and robust to any bounded communi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08215","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/1901.08215/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-05T02:04:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zDMvMaagpQd1YrIAl4l3LtRvIWTRQm23z0X4T1mKE9dEdkXdbpWl0fGQoy+1thJ/VUPsGxns1RiKUe1Cr8cCCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T22:03:36.669843Z"},"content_sha256":"8bb5197475e6964c7b5a6effc08750a85b97e8eaedab00cb5fa290c7884b13dc","schema_version":"1.0","event_id":"sha256:8bb5197475e6964c7b5a6effc08750a85b97e8eaedab00cb5fa290c7884b13dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/74D53DNEPU7TGAM2C2U3P73C52/bundle.json","state_url":"https://pith.science/pith/74D53DNEPU7TGAM2C2U3P73C52/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/74D53DNEPU7TGAM2C2U3P73C52/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-17T22:03:36Z","links":{"resolver":"https://pith.science/pith/74D53DNEPU7TGAM2C2U3P73C52","bundle":"https://pith.science/pith/74D53DNEPU7TGAM2C2U3P73C52/bundle.json","state":"https://pith.science/pith/74D53DNEPU7TGAM2C2U3P73C52/state.json","well_known_bundle":"https://pith.science/.well-known/pith/74D53DNEPU7TGAM2C2U3P73C52/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:74D53DNEPU7TGAM2C2U3P73C52","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":"1ea534edcef5fe8b610484ea197b81cad40b7974c27a3f21eb894c65760ff490","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-24T03:31:45Z","title_canon_sha256":"a9456e1a2aeb460e6ae57e1c1a1163023c23815bc3edc1146a5ff981d78bc122"},"schema_version":"1.0","source":{"id":"1901.08215","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.08215","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"arxiv_version","alias_value":"1901.08215v3","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.08215","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"pith_short_12","alias_value":"74D53DNEPU7T","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"pith_short_16","alias_value":"74D53DNEPU7TGAM2","created_at":"2026-07-05T02:04:02Z"},{"alias_kind":"pith_short_8","alias_value":"74D53DNE","created_at":"2026-07-05T02:04:02Z"}],"graph_snapshots":[{"event_id":"sha256:8bb5197475e6964c7b5a6effc08750a85b97e8eaedab00cb5fa290c7884b13dc","target":"graph","created_at":"2026-07-05T02:04:02Z","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/1901.08215/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the distributed optimization problem, the goal of which is to minimize the sum of local objective functions over a directed network. Though it has been widely studied recently, most of the existing algorithms are designed for synchronized or randomly activated implementation, which may create deadlocks in practice. In sharp contrast, we propose a \\emph{fully} asynchronous push-pull gradient algorithm (APPG) where each node updates without waiting for any other node by using (possibly stale) information from neighbors. Thus, it is both deadlock-free and robust to any bounded communi","authors_text":"Jiaqi Zhang, Keyou You","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-24T03:31:45Z","title":"Fully Asynchronous Distributed Optimization with Linear Convergence in Directed Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.08215","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:613b527499c9d4872fc3c69f7a32ee94739b20c7f015fff993c859899a0048cd","target":"record","created_at":"2026-07-05T02:04:02Z","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":"1ea534edcef5fe8b610484ea197b81cad40b7974c27a3f21eb894c65760ff490","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-01-24T03:31:45Z","title_canon_sha256":"a9456e1a2aeb460e6ae57e1c1a1163023c23815bc3edc1146a5ff981d78bc122"},"schema_version":"1.0","source":{"id":"1901.08215","kind":"arxiv","version":3}},"canonical_sha256":"ff07dd8da47d3f33019a16a9b7ff62eeb7d025cb6968557e30f53cf11e2094df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ff07dd8da47d3f33019a16a9b7ff62eeb7d025cb6968557e30f53cf11e2094df","first_computed_at":"2026-07-05T02:04:02.787802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:04:02.787802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1lXEpA2pCG/3gcVVbLybPE/GzweD70nQguUfSFQNEc7Y5vtC+XEAFPbTjaELU/lQvQ8L9LRKiQyG/2yxRyhRBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T02:04:02.788269Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.08215","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:613b527499c9d4872fc3c69f7a32ee94739b20c7f015fff993c859899a0048cd","sha256:8bb5197475e6964c7b5a6effc08750a85b97e8eaedab00cb5fa290c7884b13dc"],"state_sha256":"6e91e104df7adee9d91b6f6663db742162f81523819a91f4551b9759cf4a5364"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dUrUDlOvP4NhGjcXzjvQJ4sG3LSYN2k+cjXuVXXBUmyBO3dLMwrPfDpCnIa/TGdP8uwypEgbVS13kQQ5y/GWDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T22:03:36.674946Z","bundle_sha256":"e20fc46a22ebbdf9916e1b7eec5be823326ca04779819945a7feee9022e60c5d"}}