{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CAICKEV4PDHB335VMT2R3OA6FE","short_pith_number":"pith:CAICKEV4","canonical_record":{"source":{"id":"1107.2848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-14T15:25:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"51cf9c7eefe17ccd3e678362bc33908cf808e8952236b52376c2aa3bc33b6ea9","abstract_canon_sha256":"12dce6a53c5c75adc7f7b808b130cc09b89dd46adcebe56ea28cf69437d7f1ac"},"schema_version":"1.0"},"canonical_sha256":"10102512bc78ce1defb564f51db81e2932389227239da52b086b84fd7aba8f94","source":{"kind":"arxiv","id":"1107.2848","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2848","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2848v1","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2848","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"CAICKEV4PDHB","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CAICKEV4PDHB335V","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CAICKEV4","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CAICKEV4PDHB335VMT2R3OA6FE","target":"record","payload":{"canonical_record":{"source":{"id":"1107.2848","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-14T15:25:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"51cf9c7eefe17ccd3e678362bc33908cf808e8952236b52376c2aa3bc33b6ea9","abstract_canon_sha256":"12dce6a53c5c75adc7f7b808b130cc09b89dd46adcebe56ea28cf69437d7f1ac"},"schema_version":"1.0"},"canonical_sha256":"10102512bc78ce1defb564f51db81e2932389227239da52b086b84fd7aba8f94","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:18:15.613548Z","signature_b64":"qJ1FZOkd/ydnvYMLZiKS5cZw/EEH5k75cDYO9IQNS8MIQg944nxXwtXI4YC0PKIu+dJTbLUjOcdvce6EadU6Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10102512bc78ce1defb564f51db81e2932389227239da52b086b84fd7aba8f94","last_reissued_at":"2026-05-18T04:18:15.613156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:18:15.613156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1107.2848","source_version":1,"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-18T04:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ueJxthwtUZcaJmDFvVJj5SFSMD3ub0vANquTGHQ1HTG5U5TxMyRmGkrhB7roq1y4tWIPbO1GF+zUFnfPemnYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:44:39.622294Z"},"content_sha256":"7813e71ade59554c11d0d8b6972652ec103c45e9d9722a2382d4f21d2eb071f3","schema_version":"1.0","event_id":"sha256:7813e71ade59554c11d0d8b6972652ec103c45e9d9722a2382d4f21d2eb071f3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CAICKEV4PDHB335VMT2R3OA6FE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Martin Tak\\'a\\v{c}, Peter Richt\\'arik","submitted_at":"2011-07-14T15:25:31Z","abstract_excerpt":"In this paper we develop a randomized block-coordinate descent method for minimizing the sum of a smooth and a simple nonsmooth block-separable convex function and prove that it obtains an $\\epsilon$-accurate solution with probability at least $1-\\rho$ in at most $O(\\tfrac{n}{\\epsilon} \\log \\tfrac{1}{\\rho})$ iterations, where $n$ is the number of blocks. For strongly convex functions the method converges linearly. This extends recent results of Nesterov [Efficiency of coordinate descent methods on huge-scale optimization problems, CORE Discussion Paper #2010/2], which cover the smooth case, to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2848","kind":"arxiv","version":1},"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-18T04:18:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yPyrQKxro2P+wLHyCZetDMjlfbLf7Y6MmLhOeuBKPR+37b1sHHLRbSYHY/Ym9BuzCbOrT43de9jPbjUXPhFZCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T02:44:39.623040Z"},"content_sha256":"937d96191464093dfcc78ac3f241eadc78cab21743aa404cbaac3aa1146a68bf","schema_version":"1.0","event_id":"sha256:937d96191464093dfcc78ac3f241eadc78cab21743aa404cbaac3aa1146a68bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CAICKEV4PDHB335VMT2R3OA6FE/bundle.json","state_url":"https://pith.science/pith/CAICKEV4PDHB335VMT2R3OA6FE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CAICKEV4PDHB335VMT2R3OA6FE/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-24T02:44:39Z","links":{"resolver":"https://pith.science/pith/CAICKEV4PDHB335VMT2R3OA6FE","bundle":"https://pith.science/pith/CAICKEV4PDHB335VMT2R3OA6FE/bundle.json","state":"https://pith.science/pith/CAICKEV4PDHB335VMT2R3OA6FE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CAICKEV4PDHB335VMT2R3OA6FE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CAICKEV4PDHB335VMT2R3OA6FE","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":"12dce6a53c5c75adc7f7b808b130cc09b89dd46adcebe56ea28cf69437d7f1ac","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-14T15:25:31Z","title_canon_sha256":"51cf9c7eefe17ccd3e678362bc33908cf808e8952236b52376c2aa3bc33b6ea9"},"schema_version":"1.0","source":{"id":"1107.2848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1107.2848","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"arxiv_version","alias_value":"1107.2848v1","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.2848","created_at":"2026-05-18T04:18:15Z"},{"alias_kind":"pith_short_12","alias_value":"CAICKEV4PDHB","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CAICKEV4PDHB335V","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CAICKEV4","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:937d96191464093dfcc78ac3f241eadc78cab21743aa404cbaac3aa1146a68bf","target":"graph","created_at":"2026-05-18T04:18:15Z","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 develop a randomized block-coordinate descent method for minimizing the sum of a smooth and a simple nonsmooth block-separable convex function and prove that it obtains an $\\epsilon$-accurate solution with probability at least $1-\\rho$ in at most $O(\\tfrac{n}{\\epsilon} \\log \\tfrac{1}{\\rho})$ iterations, where $n$ is the number of blocks. For strongly convex functions the method converges linearly. This extends recent results of Nesterov [Efficiency of coordinate descent methods on huge-scale optimization problems, CORE Discussion Paper #2010/2], which cover the smooth case, to","authors_text":"Martin Tak\\'a\\v{c}, Peter Richt\\'arik","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-14T15:25:31Z","title":"Iteration Complexity of Randomized Block-Coordinate Descent Methods for Minimizing a Composite Function"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.2848","kind":"arxiv","version":1},"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:7813e71ade59554c11d0d8b6972652ec103c45e9d9722a2382d4f21d2eb071f3","target":"record","created_at":"2026-05-18T04:18:15Z","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":"12dce6a53c5c75adc7f7b808b130cc09b89dd46adcebe56ea28cf69437d7f1ac","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-07-14T15:25:31Z","title_canon_sha256":"51cf9c7eefe17ccd3e678362bc33908cf808e8952236b52376c2aa3bc33b6ea9"},"schema_version":"1.0","source":{"id":"1107.2848","kind":"arxiv","version":1}},"canonical_sha256":"10102512bc78ce1defb564f51db81e2932389227239da52b086b84fd7aba8f94","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10102512bc78ce1defb564f51db81e2932389227239da52b086b84fd7aba8f94","first_computed_at":"2026-05-18T04:18:15.613156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:18:15.613156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qJ1FZOkd/ydnvYMLZiKS5cZw/EEH5k75cDYO9IQNS8MIQg944nxXwtXI4YC0PKIu+dJTbLUjOcdvce6EadU6Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:18:15.613548Z","signed_message":"canonical_sha256_bytes"},"source_id":"1107.2848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7813e71ade59554c11d0d8b6972652ec103c45e9d9722a2382d4f21d2eb071f3","sha256:937d96191464093dfcc78ac3f241eadc78cab21743aa404cbaac3aa1146a68bf"],"state_sha256":"e3e72cad161ecac815952040d241b728a50e5559a79e59dde831834613dc3992"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sJonGaFR0ALToTxYJ1VMqaTJoQY+Zt1CQW5RVzeTHa4RZW1+aQUeqiLoLPLmw1+mARFhbxjMPxwketgk04hwBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T02:44:39.627234Z","bundle_sha256":"3389608f86412798a03827e70ac18c7405934302fd12f18b1bb7e96c264fcf5d"}}