{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MNDO2ZKYUUAS2JI4G3VIORFCKS","short_pith_number":"pith:MNDO2ZKY","schema_version":"1.0","canonical_sha256":"6346ed6558a5012d251c36ea8744a254913cb12b55eb533dd50b77127f9cc29f","source":{"kind":"arxiv","id":"1406.0238","version":2},"attestation_state":"computed","paper":{"title":"Distributed Block Coordinate Descent for Minimizing Partially Separable Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jakub Marecek, Martin Takac, Peter Richtarik","submitted_at":"2014-06-02T03:00:32Z","abstract_excerpt":"In this work we propose a distributed randomized block coordinate descent method for minimizing a convex function with a huge number of variables/coordinates. We analyze its complexity under the assumption that the smooth part of the objective function is partially block separable, and show that the degree of separability directly influences the complexity. This extends the results in [Richtarik, Takac: Parallel coordinate descent methods for big data optimization] to a distributed environment. We first show that partially block separable functions admit an expected separable overapproximation"},"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":"1406.0238","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-06-02T03:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"b8d6039fcf29540ffe84d335774754f832410187bb4e8453ffe2ffdc6037b939","abstract_canon_sha256":"30dd46568e8a6303f16a266441ae7fa5cee7a2bb2b281a6e1f29df6901238bfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:38.820346Z","signature_b64":"E3gCrXKg7PIJ3n8gk57vNGEpSRWacgFqM4OsMliQoR3n43MO5dYqxcA+Vb0/qWZkVkHJzwO5+EpHYr/LI2gdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6346ed6558a5012d251c36ea8744a254913cb12b55eb533dd50b77127f9cc29f","last_reissued_at":"2026-05-18T01:36:38.819786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:38.819786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Block Coordinate Descent for Minimizing Partially Separable Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jakub Marecek, Martin Takac, Peter Richtarik","submitted_at":"2014-06-02T03:00:32Z","abstract_excerpt":"In this work we propose a distributed randomized block coordinate descent method for minimizing a convex function with a huge number of variables/coordinates. We analyze its complexity under the assumption that the smooth part of the objective function is partially block separable, and show that the degree of separability directly influences the complexity. This extends the results in [Richtarik, Takac: Parallel coordinate descent methods for big data optimization] to a distributed environment. We first show that partially block separable functions admit an expected separable overapproximation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.0238","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":"1406.0238","created_at":"2026-05-18T01:36:38.819876+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.0238v2","created_at":"2026-05-18T01:36:38.819876+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.0238","created_at":"2026-05-18T01:36:38.819876+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNDO2ZKYUUAS","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNDO2ZKYUUAS2JI4","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNDO2ZKY","created_at":"2026-05-18T12:28:38.356838+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/MNDO2ZKYUUAS2JI4G3VIORFCKS","json":"https://pith.science/pith/MNDO2ZKYUUAS2JI4G3VIORFCKS.json","graph_json":"https://pith.science/api/pith-number/MNDO2ZKYUUAS2JI4G3VIORFCKS/graph.json","events_json":"https://pith.science/api/pith-number/MNDO2ZKYUUAS2JI4G3VIORFCKS/events.json","paper":"https://pith.science/paper/MNDO2ZKY"},"agent_actions":{"view_html":"https://pith.science/pith/MNDO2ZKYUUAS2JI4G3VIORFCKS","download_json":"https://pith.science/pith/MNDO2ZKYUUAS2JI4G3VIORFCKS.json","view_paper":"https://pith.science/paper/MNDO2ZKY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.0238&json=true","fetch_graph":"https://pith.science/api/pith-number/MNDO2ZKYUUAS2JI4G3VIORFCKS/graph.json","fetch_events":"https://pith.science/api/pith-number/MNDO2ZKYUUAS2JI4G3VIORFCKS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNDO2ZKYUUAS2JI4G3VIORFCKS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNDO2ZKYUUAS2JI4G3VIORFCKS/action/storage_attestation","attest_author":"https://pith.science/pith/MNDO2ZKYUUAS2JI4G3VIORFCKS/action/author_attestation","sign_citation":"https://pith.science/pith/MNDO2ZKYUUAS2JI4G3VIORFCKS/action/citation_signature","submit_replication":"https://pith.science/pith/MNDO2ZKYUUAS2JI4G3VIORFCKS/action/replication_record"}},"created_at":"2026-05-18T01:36:38.819876+00:00","updated_at":"2026-05-18T01:36:38.819876+00:00"}