{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ZY2DZT5GX3TW7HUV6I42GIRAR2","short_pith_number":"pith:ZY2DZT5G","schema_version":"1.0","canonical_sha256":"ce343ccfa6bee76f9e95f239a322208e8fc17328a464bbe8f399d5dd839a619f","source":{"kind":"arxiv","id":"1405.5300","version":2},"attestation_state":"computed","paper":{"title":"Fast Distributed Coordinate Descent for Non-Strongly Convex Losses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Martin Tak\\'a\\v{c}, Olivier Fercoq, Peter Richt\\'arik, Zheng Qu","submitted_at":"2014-05-21T05:12:55Z","abstract_excerpt":"We propose an efficient distributed randomized coordinate descent method for minimizing regularized non-strongly convex loss functions. The method attains the optimal $O(1/k^2)$ convergence rate, where $k$ is the iteration counter. The core of the work is the theoretical study of stepsize parameters. We have implemented the method on Archer - the largest supercomputer in the UK - and show that the method is capable of solving a (synthetic) LASSO optimization problem with 50 billion variables."},"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":"1405.5300","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-05-21T05:12:55Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"5ea1cd41fa54294cfbbad9003753c535c6682757e410ab5cac723e07dd5a3499","abstract_canon_sha256":"894e0985617854acd1a65e1e9d624e04f4160fc9d5c7839406dce463d2495d8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:24.237471Z","signature_b64":"wAtK06DmfU6jJz+xihJWPtUm7YVbADd+G0G9AhnqLp6NdXM9HzEVKWyj3ZSG5h+ZXPPW68U3DzZ4Ys1z4VQnDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce343ccfa6bee76f9e95f239a322208e8fc17328a464bbe8f399d5dd839a619f","last_reissued_at":"2026-05-18T02:46:24.236917Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:24.236917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast Distributed Coordinate Descent for Non-Strongly Convex Losses","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Martin Tak\\'a\\v{c}, Olivier Fercoq, Peter Richt\\'arik, Zheng Qu","submitted_at":"2014-05-21T05:12:55Z","abstract_excerpt":"We propose an efficient distributed randomized coordinate descent method for minimizing regularized non-strongly convex loss functions. The method attains the optimal $O(1/k^2)$ convergence rate, where $k$ is the iteration counter. The core of the work is the theoretical study of stepsize parameters. We have implemented the method on Archer - the largest supercomputer in the UK - and show that the method is capable of solving a (synthetic) LASSO optimization problem with 50 billion variables."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5300","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":"1405.5300","created_at":"2026-05-18T02:46:24.236987+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5300v2","created_at":"2026-05-18T02:46:24.236987+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5300","created_at":"2026-05-18T02:46:24.236987+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZY2DZT5GX3TW","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZY2DZT5GX3TW7HUV","created_at":"2026-05-18T12:28:59.999130+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZY2DZT5G","created_at":"2026-05-18T12:28:59.999130+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/ZY2DZT5GX3TW7HUV6I42GIRAR2","json":"https://pith.science/pith/ZY2DZT5GX3TW7HUV6I42GIRAR2.json","graph_json":"https://pith.science/api/pith-number/ZY2DZT5GX3TW7HUV6I42GIRAR2/graph.json","events_json":"https://pith.science/api/pith-number/ZY2DZT5GX3TW7HUV6I42GIRAR2/events.json","paper":"https://pith.science/paper/ZY2DZT5G"},"agent_actions":{"view_html":"https://pith.science/pith/ZY2DZT5GX3TW7HUV6I42GIRAR2","download_json":"https://pith.science/pith/ZY2DZT5GX3TW7HUV6I42GIRAR2.json","view_paper":"https://pith.science/paper/ZY2DZT5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5300&json=true","fetch_graph":"https://pith.science/api/pith-number/ZY2DZT5GX3TW7HUV6I42GIRAR2/graph.json","fetch_events":"https://pith.science/api/pith-number/ZY2DZT5GX3TW7HUV6I42GIRAR2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZY2DZT5GX3TW7HUV6I42GIRAR2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZY2DZT5GX3TW7HUV6I42GIRAR2/action/storage_attestation","attest_author":"https://pith.science/pith/ZY2DZT5GX3TW7HUV6I42GIRAR2/action/author_attestation","sign_citation":"https://pith.science/pith/ZY2DZT5GX3TW7HUV6I42GIRAR2/action/citation_signature","submit_replication":"https://pith.science/pith/ZY2DZT5GX3TW7HUV6I42GIRAR2/action/replication_record"}},"created_at":"2026-05-18T02:46:24.236987+00:00","updated_at":"2026-05-18T02:46:24.236987+00:00"}