{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:W4T443G54IETNW65NNYPB46F5H","short_pith_number":"pith:W4T443G5","canonical_record":{"source":{"id":"1803.05578","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T03:19:13Z","cross_cats_sorted":[],"title_canon_sha256":"ca2e4e40086bcae057a733c960b1f977fd2bde1f924456d6aa48f23dabfa420d","abstract_canon_sha256":"067e33c43310de6373f751e4a90fbc814f6b4f104e85073c4198f20f4a4923a5"},"schema_version":"1.0"},"canonical_sha256":"b727ce6cdde20936dbdd6b70f0f3c5e9ef16f25ffcd54c92627bd071644e3616","source":{"kind":"arxiv","id":"1803.05578","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05578","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05578v2","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05578","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"W4T443G54IET","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W4T443G54IETNW65","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W4T443G5","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:W4T443G54IETNW65NNYPB46F5H","target":"record","payload":{"canonical_record":{"source":{"id":"1803.05578","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T03:19:13Z","cross_cats_sorted":[],"title_canon_sha256":"ca2e4e40086bcae057a733c960b1f977fd2bde1f924456d6aa48f23dabfa420d","abstract_canon_sha256":"067e33c43310de6373f751e4a90fbc814f6b4f104e85073c4198f20f4a4923a5"},"schema_version":"1.0"},"canonical_sha256":"b727ce6cdde20936dbdd6b70f0f3c5e9ef16f25ffcd54c92627bd071644e3616","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:36.428766Z","signature_b64":"kmVOwfkpGfFd8yg1h0wF3QKPZZIvkaT4xHibchR6pUPryjQbzMn6GELRTJuMXJTX5URU95UMLH2+E/53RfPYAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b727ce6cdde20936dbdd6b70f0f3c5e9ef16f25ffcd54c92627bd071644e3616","last_reissued_at":"2026-05-18T00:15:36.428071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:36.428071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.05578","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:15:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pq7GZrbk4aDbj6XOOOmvBLci5nu9p5e2OcydwsKvL/mPE30phI125LRfQuwXhsh2KUtWCR/g0jMNDhy1IMbDCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:29:19.728055Z"},"content_sha256":"c56406927eac3a6420397001929d60314eb68cc96b84f0d0dea40dd0839b8c8a","schema_version":"1.0","event_id":"sha256:c56406927eac3a6420397001929d60314eb68cc96b84f0d0dea40dd0839b8c8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:W4T443G54IETNW65NNYPB46F5H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A2BCD: An Asynchronous Accelerated Block Coordinate Descent Algorithm With Optimal Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Fei Feng, Robert Hannah, Wotao Yin","submitted_at":"2018-03-15T03:19:13Z","abstract_excerpt":"In this paper, we propose the Asynchronous Accelerated Nonuniform Randomized Block Coordinate Descent algorithm (A2BCD), the first asynchronous Nesterov-accelerated algorithm that achieves optimal complexity. This parallel algorithm solves the unconstrained convex minimization problem, using p computing nodes which compute updates to shared solution vectors, in an asynchronous fashion with no central coordination. Nodes in asynchronous algorithms do not wait for updates from other nodes before starting a new iteration, but simply compute updates using the most recent solution information avail"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05578","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:15:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4x8v1rwEi4hKwtTzJSqvL7s+UOrsrri/r4lcHuXwaYwWJfxlZa/872vX+tzvoIOA3jY6sZ61Umz7BIuFXM1pBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:29:19.728788Z"},"content_sha256":"c3336d32b55bb0cadb410b89c7d35ca8694b4c69030c2da61acd40b184a45602","schema_version":"1.0","event_id":"sha256:c3336d32b55bb0cadb410b89c7d35ca8694b4c69030c2da61acd40b184a45602"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W4T443G54IETNW65NNYPB46F5H/bundle.json","state_url":"https://pith.science/pith/W4T443G54IETNW65NNYPB46F5H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W4T443G54IETNW65NNYPB46F5H/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-28T18:29:19Z","links":{"resolver":"https://pith.science/pith/W4T443G54IETNW65NNYPB46F5H","bundle":"https://pith.science/pith/W4T443G54IETNW65NNYPB46F5H/bundle.json","state":"https://pith.science/pith/W4T443G54IETNW65NNYPB46F5H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W4T443G54IETNW65NNYPB46F5H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:W4T443G54IETNW65NNYPB46F5H","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":"067e33c43310de6373f751e4a90fbc814f6b4f104e85073c4198f20f4a4923a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T03:19:13Z","title_canon_sha256":"ca2e4e40086bcae057a733c960b1f977fd2bde1f924456d6aa48f23dabfa420d"},"schema_version":"1.0","source":{"id":"1803.05578","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05578","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05578v2","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05578","created_at":"2026-05-18T00:15:36Z"},{"alias_kind":"pith_short_12","alias_value":"W4T443G54IET","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W4T443G54IETNW65","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W4T443G5","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:c3336d32b55bb0cadb410b89c7d35ca8694b4c69030c2da61acd40b184a45602","target":"graph","created_at":"2026-05-18T00:15:36Z","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 propose the Asynchronous Accelerated Nonuniform Randomized Block Coordinate Descent algorithm (A2BCD), the first asynchronous Nesterov-accelerated algorithm that achieves optimal complexity. This parallel algorithm solves the unconstrained convex minimization problem, using p computing nodes which compute updates to shared solution vectors, in an asynchronous fashion with no central coordination. Nodes in asynchronous algorithms do not wait for updates from other nodes before starting a new iteration, but simply compute updates using the most recent solution information avail","authors_text":"Fei Feng, Robert Hannah, Wotao Yin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T03:19:13Z","title":"A2BCD: An Asynchronous Accelerated Block Coordinate Descent Algorithm With Optimal Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05578","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:c56406927eac3a6420397001929d60314eb68cc96b84f0d0dea40dd0839b8c8a","target":"record","created_at":"2026-05-18T00:15:36Z","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":"067e33c43310de6373f751e4a90fbc814f6b4f104e85073c4198f20f4a4923a5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-03-15T03:19:13Z","title_canon_sha256":"ca2e4e40086bcae057a733c960b1f977fd2bde1f924456d6aa48f23dabfa420d"},"schema_version":"1.0","source":{"id":"1803.05578","kind":"arxiv","version":2}},"canonical_sha256":"b727ce6cdde20936dbdd6b70f0f3c5e9ef16f25ffcd54c92627bd071644e3616","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b727ce6cdde20936dbdd6b70f0f3c5e9ef16f25ffcd54c92627bd071644e3616","first_computed_at":"2026-05-18T00:15:36.428071Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:36.428071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kmVOwfkpGfFd8yg1h0wF3QKPZZIvkaT4xHibchR6pUPryjQbzMn6GELRTJuMXJTX5URU95UMLH2+E/53RfPYAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:36.428766Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05578","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c56406927eac3a6420397001929d60314eb68cc96b84f0d0dea40dd0839b8c8a","sha256:c3336d32b55bb0cadb410b89c7d35ca8694b4c69030c2da61acd40b184a45602"],"state_sha256":"6d4a9115786a2179e1da7600b252cdacbdef599f866753d67227d90f79cb824e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NhW2PKv5eUibr8P2vgMHtzjdt9Mn4g81tns7jxlMK1pbfaSCeSXGM9IJB2KfTc5Z/owfQWvHL4hhbR4DmwfABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:29:19.732933Z","bundle_sha256":"36bf179c22e35f590cfa386824dd88829dc5fb02853c20556b8ac3159aa4bbb3"}}