{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:MPPBLMVIASLLQPLCPB7FESA66R","short_pith_number":"pith:MPPBLMVI","canonical_record":{"source":{"id":"1311.1873","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.OC","submitted_at":"2013-11-08T03:32:49Z","cross_cats_sorted":[],"title_canon_sha256":"4e08a1d80f067330a2850dfb1950e805335760de8c22eb170a84af1e05211b52","abstract_canon_sha256":"3f84a78f3f0d8bba97da351336fc1254f75f8f11de4045549dc39146aee0fb1b"},"schema_version":"1.0"},"canonical_sha256":"63de15b2a80496b83d62787e52481ef4748d8e438c9dba84b4c70f8b4790bf88","source":{"kind":"arxiv","id":"1311.1873","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1873","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1873v3","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1873","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"pith_short_12","alias_value":"MPPBLMVIASLL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MPPBLMVIASLLQPLC","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MPPBLMVI","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:MPPBLMVIASLLQPLCPB7FESA66R","target":"record","payload":{"canonical_record":{"source":{"id":"1311.1873","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.OC","submitted_at":"2013-11-08T03:32:49Z","cross_cats_sorted":[],"title_canon_sha256":"4e08a1d80f067330a2850dfb1950e805335760de8c22eb170a84af1e05211b52","abstract_canon_sha256":"3f84a78f3f0d8bba97da351336fc1254f75f8f11de4045549dc39146aee0fb1b"},"schema_version":"1.0"},"canonical_sha256":"63de15b2a80496b83d62787e52481ef4748d8e438c9dba84b4c70f8b4790bf88","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:58.873460Z","signature_b64":"SrJHOx9ko1BCh/6ymxJm8DTIo2/LLoKLEjHxec4E0OPMf4yE92mJSOkpo9lHLIBNoqa4ZmMmatIumJkMvS7YDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63de15b2a80496b83d62787e52481ef4748d8e438c9dba84b4c70f8b4790bf88","last_reissued_at":"2026-05-18T02:37:58.873013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:58.873013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.1873","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-05-18T02:37:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8kEuYFEnYCrQ1wmqlh3N3AqszsweyJg7SsNh6gbEESyo7HWxQGzfWo6zVIKGacyJiyrmTnmgVORmWriYsR69Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:01:22.718828Z"},"content_sha256":"1687a3cd76e2df235c2b62f2cd976965b7cdcc288ae13fbcf61387cd48effaac","schema_version":"1.0","event_id":"sha256:1687a3cd76e2df235c2b62f2cd976965b7cdcc288ae13fbcf61387cd48effaac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:MPPBLMVIASLLQPLCPB7FESA66R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Asynchronous Parallel Stochastic Coordinate Descent Algorithm","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Christopher R\\'e, Ji Liu, Srikrishna Sridhar, Stephen J. Wright, Victor Bittorf","submitted_at":"2013-11-08T03:32:49Z","abstract_excerpt":"We describe an asynchronous parallel stochastic coordinate descent algorithm for minimizing smooth unconstrained or separably constrained functions. The method achieves a linear convergence rate on functions that satisfy an essential strong convexity property and a sublinear rate ($1/K$) on general convex functions. Near-linear speedup on a multicore system can be expected if the number of processors is $O(n^{1/2})$ in unconstrained optimization and $O(n^{1/4})$ in the separable-constrained case, where $n$ is the number of variables. We describe results from implementation on 40-core processor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1873","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":""},"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-18T02:37:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8/H+3EC/YmmlxlfQ0VIqsDQZvq3bwEqwHQE3l6ZBf+pTU2qdI5QDPYCHUSyJLgjhXJC9Z8FsPiyg5YeKwEDYBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:01:22.719512Z"},"content_sha256":"55e7e1d495a5a5da3398e07e3b1d1f7de11921b2696cd65a33294f814a3d24d7","schema_version":"1.0","event_id":"sha256:55e7e1d495a5a5da3398e07e3b1d1f7de11921b2696cd65a33294f814a3d24d7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MPPBLMVIASLLQPLCPB7FESA66R/bundle.json","state_url":"https://pith.science/pith/MPPBLMVIASLLQPLCPB7FESA66R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MPPBLMVIASLLQPLCPB7FESA66R/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-30T23:01:22Z","links":{"resolver":"https://pith.science/pith/MPPBLMVIASLLQPLCPB7FESA66R","bundle":"https://pith.science/pith/MPPBLMVIASLLQPLCPB7FESA66R/bundle.json","state":"https://pith.science/pith/MPPBLMVIASLLQPLCPB7FESA66R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MPPBLMVIASLLQPLCPB7FESA66R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MPPBLMVIASLLQPLCPB7FESA66R","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":"3f84a78f3f0d8bba97da351336fc1254f75f8f11de4045549dc39146aee0fb1b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.OC","submitted_at":"2013-11-08T03:32:49Z","title_canon_sha256":"4e08a1d80f067330a2850dfb1950e805335760de8c22eb170a84af1e05211b52"},"schema_version":"1.0","source":{"id":"1311.1873","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.1873","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"arxiv_version","alias_value":"1311.1873v3","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1873","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"pith_short_12","alias_value":"MPPBLMVIASLL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MPPBLMVIASLLQPLC","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MPPBLMVI","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:55e7e1d495a5a5da3398e07e3b1d1f7de11921b2696cd65a33294f814a3d24d7","target":"graph","created_at":"2026-05-18T02:37:58Z","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 describe an asynchronous parallel stochastic coordinate descent algorithm for minimizing smooth unconstrained or separably constrained functions. The method achieves a linear convergence rate on functions that satisfy an essential strong convexity property and a sublinear rate ($1/K$) on general convex functions. Near-linear speedup on a multicore system can be expected if the number of processors is $O(n^{1/2})$ in unconstrained optimization and $O(n^{1/4})$ in the separable-constrained case, where $n$ is the number of variables. We describe results from implementation on 40-core processor","authors_text":"Christopher R\\'e, Ji Liu, Srikrishna Sridhar, Stephen J. Wright, Victor Bittorf","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.OC","submitted_at":"2013-11-08T03:32:49Z","title":"An Asynchronous Parallel Stochastic Coordinate Descent Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.1873","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:1687a3cd76e2df235c2b62f2cd976965b7cdcc288ae13fbcf61387cd48effaac","target":"record","created_at":"2026-05-18T02:37:58Z","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":"3f84a78f3f0d8bba97da351336fc1254f75f8f11de4045549dc39146aee0fb1b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"math.OC","submitted_at":"2013-11-08T03:32:49Z","title_canon_sha256":"4e08a1d80f067330a2850dfb1950e805335760de8c22eb170a84af1e05211b52"},"schema_version":"1.0","source":{"id":"1311.1873","kind":"arxiv","version":3}},"canonical_sha256":"63de15b2a80496b83d62787e52481ef4748d8e438c9dba84b4c70f8b4790bf88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63de15b2a80496b83d62787e52481ef4748d8e438c9dba84b4c70f8b4790bf88","first_computed_at":"2026-05-18T02:37:58.873013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:58.873013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SrJHOx9ko1BCh/6ymxJm8DTIo2/LLoKLEjHxec4E0OPMf4yE92mJSOkpo9lHLIBNoqa4ZmMmatIumJkMvS7YDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:58.873460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.1873","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1687a3cd76e2df235c2b62f2cd976965b7cdcc288ae13fbcf61387cd48effaac","sha256:55e7e1d495a5a5da3398e07e3b1d1f7de11921b2696cd65a33294f814a3d24d7"],"state_sha256":"7ef9d3515bd77538769ffb9ace02e7f8f5ab38cfe958864abdc21641922f3498"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmnSsL3rTIb3MpDsOchO9SG6Q+TWrolB/ZagRzVZaDImxDVSWPse4WVvEQJmqZvVhCAEyJMi0OCUQvHFzqbGCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:01:22.722938Z","bundle_sha256":"bb1ccfc7181806cd9543cfca4dc50306f97aedf92fa917fbf0a0d86295405ac3"}}