{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:35DXAC3ZQX47ILB2R65WG5VGPH","short_pith_number":"pith:35DXAC3Z","schema_version":"1.0","canonical_sha256":"df47700b7985f9f42c3a8fbb6376a679cd24822609b9345bc0f8636d85c64292","source":{"kind":"arxiv","id":"1310.2059","version":1},"attestation_state":"computed","paper":{"title":"Distributed Coordinate Descent Method for Learning with Big Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Martin Tak\\'a\\v{c}, Peter Richt\\'arik","submitted_at":"2013-10-08T09:31:27Z","abstract_excerpt":"In this paper we develop and analyze Hydra: HYbriD cooRdinAte descent method for solving loss minimization problems with big data. We initially partition the coordinates (features) and assign each partition to a different node of a cluster. At every iteration, each node picks a random subset of the coordinates from those it owns, independently from the other computers, and in parallel computes and applies updates to the selected coordinates based on a simple closed-form formula. We give bounds on the number of iterations sufficient to approximately solve the problem with high probability, and "},"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":"1310.2059","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-10-08T09:31:27Z","cross_cats_sorted":["cs.DC","cs.LG","math.OC"],"title_canon_sha256":"7c656a636c0098092140c8f6a4d8fd0188d4a380528a13bc40871b98cddb03f9","abstract_canon_sha256":"734c703877eb6b73ba2bbce7c1757a8c87ac3ce2b0d5c8fbcf08a1d7f92c78d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:59.572775Z","signature_b64":"4oB82rxFv7YlBcSzJM1DCUsfgpWoecrY5f455R/JeY2BjthyQTaM0uJIeVHJ1GM4Yr52IWcTNppga3qFtbGYBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df47700b7985f9f42c3a8fbb6376a679cd24822609b9345bc0f8636d85c64292","last_reissued_at":"2026-05-18T03:10:59.571997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:59.571997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Coordinate Descent Method for Learning with Big Data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Martin Tak\\'a\\v{c}, Peter Richt\\'arik","submitted_at":"2013-10-08T09:31:27Z","abstract_excerpt":"In this paper we develop and analyze Hydra: HYbriD cooRdinAte descent method for solving loss minimization problems with big data. We initially partition the coordinates (features) and assign each partition to a different node of a cluster. At every iteration, each node picks a random subset of the coordinates from those it owns, independently from the other computers, and in parallel computes and applies updates to the selected coordinates based on a simple closed-form formula. We give bounds on the number of iterations sufficient to approximately solve the problem with high probability, and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2059","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1310.2059","created_at":"2026-05-18T03:10:59.572108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.2059v1","created_at":"2026-05-18T03:10:59.572108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2059","created_at":"2026-05-18T03:10:59.572108+00:00"},{"alias_kind":"pith_short_12","alias_value":"35DXAC3ZQX47","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"35DXAC3ZQX47ILB2","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"35DXAC3Z","created_at":"2026-05-18T12:27:32.513160+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/35DXAC3ZQX47ILB2R65WG5VGPH","json":"https://pith.science/pith/35DXAC3ZQX47ILB2R65WG5VGPH.json","graph_json":"https://pith.science/api/pith-number/35DXAC3ZQX47ILB2R65WG5VGPH/graph.json","events_json":"https://pith.science/api/pith-number/35DXAC3ZQX47ILB2R65WG5VGPH/events.json","paper":"https://pith.science/paper/35DXAC3Z"},"agent_actions":{"view_html":"https://pith.science/pith/35DXAC3ZQX47ILB2R65WG5VGPH","download_json":"https://pith.science/pith/35DXAC3ZQX47ILB2R65WG5VGPH.json","view_paper":"https://pith.science/paper/35DXAC3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.2059&json=true","fetch_graph":"https://pith.science/api/pith-number/35DXAC3ZQX47ILB2R65WG5VGPH/graph.json","fetch_events":"https://pith.science/api/pith-number/35DXAC3ZQX47ILB2R65WG5VGPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35DXAC3ZQX47ILB2R65WG5VGPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35DXAC3ZQX47ILB2R65WG5VGPH/action/storage_attestation","attest_author":"https://pith.science/pith/35DXAC3ZQX47ILB2R65WG5VGPH/action/author_attestation","sign_citation":"https://pith.science/pith/35DXAC3ZQX47ILB2R65WG5VGPH/action/citation_signature","submit_replication":"https://pith.science/pith/35DXAC3ZQX47ILB2R65WG5VGPH/action/replication_record"}},"created_at":"2026-05-18T03:10:59.572108+00:00","updated_at":"2026-05-18T03:10:59.572108+00:00"}