{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MPSWETQCXHA6YFN2GHIYKYSZGU","short_pith_number":"pith:MPSWETQC","canonical_record":{"source":{"id":"1708.05136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-17T05:01:25Z","cross_cats_sorted":["cs.DC","math.NA","stat.CO"],"title_canon_sha256":"f09bf746729b77d7c9218603f1d3cf0e02eef46d6f6e9767d19be02a111dfc42","abstract_canon_sha256":"8d33bc7bf2fce8461cd766560f5c784870302e166f411f6dff154a58b778c6fd"},"schema_version":"1.0"},"canonical_sha256":"63e5624e02b9c1ec15ba31d1856259352306ad7c8f9472817c910db6b90e1cb8","source":{"kind":"arxiv","id":"1708.05136","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05136","created_at":"2026-05-18T00:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05136v1","created_at":"2026-05-18T00:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05136","created_at":"2026-05-18T00:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"MPSWETQCXHA6","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MPSWETQCXHA6YFN2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MPSWETQC","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MPSWETQCXHA6YFN2GHIYKYSZGU","target":"record","payload":{"canonical_record":{"source":{"id":"1708.05136","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-17T05:01:25Z","cross_cats_sorted":["cs.DC","math.NA","stat.CO"],"title_canon_sha256":"f09bf746729b77d7c9218603f1d3cf0e02eef46d6f6e9767d19be02a111dfc42","abstract_canon_sha256":"8d33bc7bf2fce8461cd766560f5c784870302e166f411f6dff154a58b778c6fd"},"schema_version":"1.0"},"canonical_sha256":"63e5624e02b9c1ec15ba31d1856259352306ad7c8f9472817c910db6b90e1cb8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:42.894685Z","signature_b64":"l0INkPNo4iMdIrlbxePU3unDFGHL++v4J6ZKHdVu8G7HdzTZbxo26M9pZG1QAUEio0WZ8CSf4z3beXxKEjkhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63e5624e02b9c1ec15ba31d1856259352306ad7c8f9472817c910db6b90e1cb8","last_reissued_at":"2026-05-18T00:36:42.894091Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:42.894091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.05136","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:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cdtpwlDDPQvAt7DPGwk08+sIAN8w/sMETOl5S0wgkL/mPPfAkEBjSqJEuEBCypgLXBOwTUbf24C0Ml8MJfTQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:11:04.376068Z"},"content_sha256":"ca89274092159a87ff22eca66801c6b232628e9016721f96bdaf37d8963ed08c","schema_version":"1.0","event_id":"sha256:ca89274092159a87ff22eca66801c6b232628e9016721f96bdaf37d8963ed08c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MPSWETQCXHA6YFN2GHIYKYSZGU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"More Iterations per Second, Same Quality -- Why Asynchronous Algorithms may Drastically Outperform Traditional Ones","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.NA","stat.CO"],"primary_cat":"math.OC","authors_text":"Robert Hannah, Wotao Yin","submitted_at":"2017-08-17T05:01:25Z","abstract_excerpt":"In this paper, we consider the convergence of a very general asynchronous-parallel algorithm called ARock, that takes many well-known asynchronous algorithms as special cases (gradient descent, proximal gradient, Douglas Rachford, ADMM, etc.). In asynchronous-parallel algorithms, the computing nodes simply use the most recent information that they have access to, instead of waiting for a full update from all nodes in the system. This means that nodes do not have to waste time waiting for information, which can be a major bottleneck, especially in distributed systems. When the system has $p$ no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05136","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:36:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YMjz1L4bVTl2l2eQtNIHVVNKSyrHWgmxihVPWb+UUp0Z05mcl32WI32C61imt3Xv4TXjPLWn8KqtjhRYeZ45CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T04:11:04.376750Z"},"content_sha256":"bd3aa94e73241dea19dc2b2a94673c447eb8dea437fa3c7f7c8ec568672e6387","schema_version":"1.0","event_id":"sha256:bd3aa94e73241dea19dc2b2a94673c447eb8dea437fa3c7f7c8ec568672e6387"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MPSWETQCXHA6YFN2GHIYKYSZGU/bundle.json","state_url":"https://pith.science/pith/MPSWETQCXHA6YFN2GHIYKYSZGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MPSWETQCXHA6YFN2GHIYKYSZGU/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-30T04:11:04Z","links":{"resolver":"https://pith.science/pith/MPSWETQCXHA6YFN2GHIYKYSZGU","bundle":"https://pith.science/pith/MPSWETQCXHA6YFN2GHIYKYSZGU/bundle.json","state":"https://pith.science/pith/MPSWETQCXHA6YFN2GHIYKYSZGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MPSWETQCXHA6YFN2GHIYKYSZGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MPSWETQCXHA6YFN2GHIYKYSZGU","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":"8d33bc7bf2fce8461cd766560f5c784870302e166f411f6dff154a58b778c6fd","cross_cats_sorted":["cs.DC","math.NA","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-17T05:01:25Z","title_canon_sha256":"f09bf746729b77d7c9218603f1d3cf0e02eef46d6f6e9767d19be02a111dfc42"},"schema_version":"1.0","source":{"id":"1708.05136","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.05136","created_at":"2026-05-18T00:36:42Z"},{"alias_kind":"arxiv_version","alias_value":"1708.05136v1","created_at":"2026-05-18T00:36:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.05136","created_at":"2026-05-18T00:36:42Z"},{"alias_kind":"pith_short_12","alias_value":"MPSWETQCXHA6","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MPSWETQCXHA6YFN2","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MPSWETQC","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:bd3aa94e73241dea19dc2b2a94673c447eb8dea437fa3c7f7c8ec568672e6387","target":"graph","created_at":"2026-05-18T00:36:42Z","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":"In this paper, we consider the convergence of a very general asynchronous-parallel algorithm called ARock, that takes many well-known asynchronous algorithms as special cases (gradient descent, proximal gradient, Douglas Rachford, ADMM, etc.). In asynchronous-parallel algorithms, the computing nodes simply use the most recent information that they have access to, instead of waiting for a full update from all nodes in the system. This means that nodes do not have to waste time waiting for information, which can be a major bottleneck, especially in distributed systems. When the system has $p$ no","authors_text":"Robert Hannah, Wotao Yin","cross_cats":["cs.DC","math.NA","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-17T05:01:25Z","title":"More Iterations per Second, Same Quality -- Why Asynchronous Algorithms may Drastically Outperform Traditional Ones"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.05136","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:ca89274092159a87ff22eca66801c6b232628e9016721f96bdaf37d8963ed08c","target":"record","created_at":"2026-05-18T00:36:42Z","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":"8d33bc7bf2fce8461cd766560f5c784870302e166f411f6dff154a58b778c6fd","cross_cats_sorted":["cs.DC","math.NA","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-08-17T05:01:25Z","title_canon_sha256":"f09bf746729b77d7c9218603f1d3cf0e02eef46d6f6e9767d19be02a111dfc42"},"schema_version":"1.0","source":{"id":"1708.05136","kind":"arxiv","version":1}},"canonical_sha256":"63e5624e02b9c1ec15ba31d1856259352306ad7c8f9472817c910db6b90e1cb8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63e5624e02b9c1ec15ba31d1856259352306ad7c8f9472817c910db6b90e1cb8","first_computed_at":"2026-05-18T00:36:42.894091Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:42.894091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"l0INkPNo4iMdIrlbxePU3unDFGHL++v4J6ZKHdVu8G7HdzTZbxo26M9pZG1QAUEio0WZ8CSf4z3beXxKEjkhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:42.894685Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.05136","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ca89274092159a87ff22eca66801c6b232628e9016721f96bdaf37d8963ed08c","sha256:bd3aa94e73241dea19dc2b2a94673c447eb8dea437fa3c7f7c8ec568672e6387"],"state_sha256":"e7124e91fb45703136aba035a0798a7533a425831de049b36078ef08463570a7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zfX5NA+cne1gSiZaPxayDHJgPJ/suWJLiDNTfNErKKyg8z9DVFiC3h8jlTIWYdQSeo37yNiJg65ONqlfyZHCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T04:11:04.379763Z","bundle_sha256":"200b4ceb321207fa54f10d1921fa28f479df593a5a128ace940b288020de309e"}}