{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:C5ZGEC7NYTZQB32KDXDUPVOBZM","short_pith_number":"pith:C5ZGEC7N","schema_version":"1.0","canonical_sha256":"1772620bedc4f300ef4a1dc747d5c1cb252f3f7ca290c5f9f6cf885c835e8070","source":{"kind":"arxiv","id":"1212.0873","version":2},"attestation_state":"computed","paper":{"title":"Parallel Coordinate Descent Methods for Big Data Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"math.OC","authors_text":"Martin Tak\\'a\\v{c}, Peter Richt\\'arik","submitted_at":"2012-12-04T21:10:37Z","abstract_excerpt":"In this work we show that randomized (block) coordinate descent methods can be accelerated by parallelization when applied to the problem of minimizing the sum of a partially separable smooth convex function and a simple separable convex function. The theoretical speedup, as compared to the serial method, and referring to the number of iterations needed to approximately solve the problem with high probability, is a simple expression depending on the number of parallel processors and a natural and easily computable measure of separability of the smooth component of the objective function. In th"},"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":"1212.0873","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-04T21:10:37Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"d03d16c970118982fa938c5d48852a123ceeeabc8f04e1f83b6e8c20617c4200","abstract_canon_sha256":"97f3889c846ea5619c5afb5bacd6813a011523a5acec527c9d896e9f394e6c2b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:13.624759Z","signature_b64":"GCPcYWq5nfzWL3SO0Qk5WSmLI2sDwMMRbGw1OhmAgRJaITbc1AfsxFRLqwh0J2nwpqUyuoKpafoZ1/qj7R5UAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1772620bedc4f300ef4a1dc747d5c1cb252f3f7ca290c5f9f6cf885c835e8070","last_reissued_at":"2026-05-18T03:06:13.624391Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:13.624391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel Coordinate Descent Methods for Big Data Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"math.OC","authors_text":"Martin Tak\\'a\\v{c}, Peter Richt\\'arik","submitted_at":"2012-12-04T21:10:37Z","abstract_excerpt":"In this work we show that randomized (block) coordinate descent methods can be accelerated by parallelization when applied to the problem of minimizing the sum of a partially separable smooth convex function and a simple separable convex function. The theoretical speedup, as compared to the serial method, and referring to the number of iterations needed to approximately solve the problem with high probability, is a simple expression depending on the number of parallel processors and a natural and easily computable measure of separability of the smooth component of the objective function. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0873","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1212.0873","created_at":"2026-05-18T03:06:13.624448+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.0873v2","created_at":"2026-05-18T03:06:13.624448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0873","created_at":"2026-05-18T03:06:13.624448+00:00"},{"alias_kind":"pith_short_12","alias_value":"C5ZGEC7NYTZQ","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"C5ZGEC7NYTZQB32K","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"C5ZGEC7N","created_at":"2026-05-18T12:27:01.376967+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/C5ZGEC7NYTZQB32KDXDUPVOBZM","json":"https://pith.science/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM.json","graph_json":"https://pith.science/api/pith-number/C5ZGEC7NYTZQB32KDXDUPVOBZM/graph.json","events_json":"https://pith.science/api/pith-number/C5ZGEC7NYTZQB32KDXDUPVOBZM/events.json","paper":"https://pith.science/paper/C5ZGEC7N"},"agent_actions":{"view_html":"https://pith.science/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM","download_json":"https://pith.science/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM.json","view_paper":"https://pith.science/paper/C5ZGEC7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.0873&json=true","fetch_graph":"https://pith.science/api/pith-number/C5ZGEC7NYTZQB32KDXDUPVOBZM/graph.json","fetch_events":"https://pith.science/api/pith-number/C5ZGEC7NYTZQB32KDXDUPVOBZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM/action/storage_attestation","attest_author":"https://pith.science/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM/action/author_attestation","sign_citation":"https://pith.science/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM/action/citation_signature","submit_replication":"https://pith.science/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM/action/replication_record"}},"created_at":"2026-05-18T03:06:13.624448+00:00","updated_at":"2026-05-18T03:06:13.624448+00:00"}