{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:C5ZGEC7NYTZQB32KDXDUPVOBZM","short_pith_number":"pith:C5ZGEC7N","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"},"canonical_sha256":"1772620bedc4f300ef4a1dc747d5c1cb252f3f7ca290c5f9f6cf885c835e8070","source":{"kind":"arxiv","id":"1212.0873","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0873","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0873v2","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0873","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"pith_short_12","alias_value":"C5ZGEC7NYTZQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C5ZGEC7NYTZQB32K","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C5ZGEC7N","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:C5ZGEC7NYTZQB32KDXDUPVOBZM","target":"record","payload":{"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"},"canonical_sha256":"1772620bedc4f300ef4a1dc747d5c1cb252f3f7ca290c5f9f6cf885c835e8070","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"},"source_kind":"arxiv","source_id":"1212.0873","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-18T03:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YmJmk9koEriqYEW7HuQ1NQ06uHBBjQjamVEYJqYXjqhXfkP0VG4x9K/nkfQ92ZYPSfdcGLx8j968aok1Qw+pDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:52:22.379920Z"},"content_sha256":"7b34005c8c8fbc38cd0cfb4e107376d5149aaefa3b2cb473ed2be77e16912d5f","schema_version":"1.0","event_id":"sha256:7b34005c8c8fbc38cd0cfb4e107376d5149aaefa3b2cb473ed2be77e16912d5f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:C5ZGEC7NYTZQB32KDXDUPVOBZM","target":"graph","payload":{"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"},"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-18T03:06:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"umYUcsDSLb9zLTeHjTNL+Flx/1t0s3jTD40e3bzGIX7GHYm1ofRyRylYGwd3X5s/kGAlxt9XhR68x0vp5yIiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T23:52:22.380623Z"},"content_sha256":"6c06490662104313633f2a6e3d2aa4985c0d29e3c83c6a7e1bdc8a2fee7e12d0","schema_version":"1.0","event_id":"sha256:6c06490662104313633f2a6e3d2aa4985c0d29e3c83c6a7e1bdc8a2fee7e12d0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM/bundle.json","state_url":"https://pith.science/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM/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-23T23:52:22Z","links":{"resolver":"https://pith.science/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM","bundle":"https://pith.science/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM/bundle.json","state":"https://pith.science/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5ZGEC7NYTZQB32KDXDUPVOBZM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:C5ZGEC7NYTZQB32KDXDUPVOBZM","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":"97f3889c846ea5619c5afb5bacd6813a011523a5acec527c9d896e9f394e6c2b","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-04T21:10:37Z","title_canon_sha256":"d03d16c970118982fa938c5d48852a123ceeeabc8f04e1f83b6e8c20617c4200"},"schema_version":"1.0","source":{"id":"1212.0873","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0873","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0873v2","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0873","created_at":"2026-05-18T03:06:13Z"},{"alias_kind":"pith_short_12","alias_value":"C5ZGEC7NYTZQ","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C5ZGEC7NYTZQB32K","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C5ZGEC7N","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:6c06490662104313633f2a6e3d2aa4985c0d29e3c83c6a7e1bdc8a2fee7e12d0","target":"graph","created_at":"2026-05-18T03:06:13Z","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 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","authors_text":"Martin Tak\\'a\\v{c}, Peter Richt\\'arik","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-04T21:10:37Z","title":"Parallel Coordinate Descent Methods for Big Data Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0873","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:7b34005c8c8fbc38cd0cfb4e107376d5149aaefa3b2cb473ed2be77e16912d5f","target":"record","created_at":"2026-05-18T03:06:13Z","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":"97f3889c846ea5619c5afb5bacd6813a011523a5acec527c9d896e9f394e6c2b","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-04T21:10:37Z","title_canon_sha256":"d03d16c970118982fa938c5d48852a123ceeeabc8f04e1f83b6e8c20617c4200"},"schema_version":"1.0","source":{"id":"1212.0873","kind":"arxiv","version":2}},"canonical_sha256":"1772620bedc4f300ef4a1dc747d5c1cb252f3f7ca290c5f9f6cf885c835e8070","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1772620bedc4f300ef4a1dc747d5c1cb252f3f7ca290c5f9f6cf885c835e8070","first_computed_at":"2026-05-18T03:06:13.624391Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:13.624391Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GCPcYWq5nfzWL3SO0Qk5WSmLI2sDwMMRbGw1OhmAgRJaITbc1AfsxFRLqwh0J2nwpqUyuoKpafoZ1/qj7R5UAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:13.624759Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0873","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7b34005c8c8fbc38cd0cfb4e107376d5149aaefa3b2cb473ed2be77e16912d5f","sha256:6c06490662104313633f2a6e3d2aa4985c0d29e3c83c6a7e1bdc8a2fee7e12d0"],"state_sha256":"29d73c8eb0c7c4d40b20d1e8d23174532be0a5085b6346e77e22303ac2216ac7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N03S7r/YBYY9WEs6TZYImUHN/nSBn41ZEQD3RLG5wOwUzPEyRaLVPygYWWTdbonU5mj3H9CNIYCGMULvkKNRAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T23:52:22.384589Z","bundle_sha256":"e903faced2e39a54989f87a31babb4916696819ef9fc65e733cd543a99621dac"}}