{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:MPPBLMVIASLLQPLCPB7FESA66R","short_pith_number":"pith:MPPBLMVI","schema_version":"1.0","canonical_sha256":"63de15b2a80496b83d62787e52481ef4748d8e438c9dba84b4c70f8b4790bf88","source":{"kind":"arxiv","id":"1311.1873","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1311.1873","created_at":"2026-05-18T02:37:58.873075+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.1873v3","created_at":"2026-05-18T02:37:58.873075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.1873","created_at":"2026-05-18T02:37:58.873075+00:00"},{"alias_kind":"pith_short_12","alias_value":"MPPBLMVIASLL","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"MPPBLMVIASLLQPLC","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"MPPBLMVI","created_at":"2026-05-18T12:27:52.871228+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MPPBLMVIASLLQPLCPB7FESA66R","json":"https://pith.science/pith/MPPBLMVIASLLQPLCPB7FESA66R.json","graph_json":"https://pith.science/api/pith-number/MPPBLMVIASLLQPLCPB7FESA66R/graph.json","events_json":"https://pith.science/api/pith-number/MPPBLMVIASLLQPLCPB7FESA66R/events.json","paper":"https://pith.science/paper/MPPBLMVI"},"agent_actions":{"view_html":"https://pith.science/pith/MPPBLMVIASLLQPLCPB7FESA66R","download_json":"https://pith.science/pith/MPPBLMVIASLLQPLCPB7FESA66R.json","view_paper":"https://pith.science/paper/MPPBLMVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.1873&json=true","fetch_graph":"https://pith.science/api/pith-number/MPPBLMVIASLLQPLCPB7FESA66R/graph.json","fetch_events":"https://pith.science/api/pith-number/MPPBLMVIASLLQPLCPB7FESA66R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MPPBLMVIASLLQPLCPB7FESA66R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MPPBLMVIASLLQPLCPB7FESA66R/action/storage_attestation","attest_author":"https://pith.science/pith/MPPBLMVIASLLQPLCPB7FESA66R/action/author_attestation","sign_citation":"https://pith.science/pith/MPPBLMVIASLLQPLCPB7FESA66R/action/citation_signature","submit_replication":"https://pith.science/pith/MPPBLMVIASLLQPLCPB7FESA66R/action/replication_record"}},"created_at":"2026-05-18T02:37:58.873075+00:00","updated_at":"2026-05-18T02:37:58.873075+00:00"}