{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ESK7FNGGBCDTL4VECZJHFUTC2I","short_pith_number":"pith:ESK7FNGG","schema_version":"1.0","canonical_sha256":"2495f2b4c6088735f2a4165272d262d22b367aa2810e7a20d8117cc1a6569eff","source":{"kind":"arxiv","id":"1312.5799","version":2},"attestation_state":"computed","paper":{"title":"Accelerated, Parallel and Proximal Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Olivier Fercoq, Peter Richt\\'arik","submitted_at":"2013-12-20T03:00:15Z","abstract_excerpt":"We propose a new stochastic coordinate descent method for minimizing the sum of convex functions each of which depends on a small number of coordinates only. Our method (APPROX) is simultaneously Accelerated, Parallel and PROXimal; this is the first time such a method is proposed. In the special case when the number of processors is equal to the number of coordinates, the method converges at the rate $2\\bar{\\omega}\\bar{L} R^2/(k+1)^2 $, where $k$ is the iteration counter, $\\bar{\\omega}$ is an average degree of separability of the loss function, $\\bar{L}$ is the average of Lipschitz constants a"},"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":"1312.5799","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-12-20T03:00:15Z","cross_cats_sorted":["cs.DC","cs.NA","math.NA","stat.ML"],"title_canon_sha256":"eb405d01fdf2043c71dc888f1789b34555210b7ec2e6e2a76d2b0c7c38787f77","abstract_canon_sha256":"b6201f5312a35a48b2733ffe4dfcd34b4912c7e8c20e0fce1914de951ac2b33c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:26.209592Z","signature_b64":"qt34RDbHhS/uIsMRPrIanXzNphm7anPccUuzqKVr6IhRcYEj8nCiZhi6O+3Ri15tst2UCNCDG9/hHayNWc4cDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2495f2b4c6088735f2a4165272d262d22b367aa2810e7a20d8117cc1a6569eff","last_reissued_at":"2026-05-18T02:57:26.209039Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:26.209039Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Accelerated, Parallel and Proximal Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NA","math.NA","stat.ML"],"primary_cat":"math.OC","authors_text":"Olivier Fercoq, Peter Richt\\'arik","submitted_at":"2013-12-20T03:00:15Z","abstract_excerpt":"We propose a new stochastic coordinate descent method for minimizing the sum of convex functions each of which depends on a small number of coordinates only. Our method (APPROX) is simultaneously Accelerated, Parallel and PROXimal; this is the first time such a method is proposed. In the special case when the number of processors is equal to the number of coordinates, the method converges at the rate $2\\bar{\\omega}\\bar{L} R^2/(k+1)^2 $, where $k$ is the iteration counter, $\\bar{\\omega}$ is an average degree of separability of the loss function, $\\bar{L}$ is the average of Lipschitz constants a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5799","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":"1312.5799","created_at":"2026-05-18T02:57:26.209121+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.5799v2","created_at":"2026-05-18T02:57:26.209121+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5799","created_at":"2026-05-18T02:57:26.209121+00:00"},{"alias_kind":"pith_short_12","alias_value":"ESK7FNGGBCDT","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"ESK7FNGGBCDTL4VE","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"ESK7FNGG","created_at":"2026-05-18T12:27:43.054852+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/ESK7FNGGBCDTL4VECZJHFUTC2I","json":"https://pith.science/pith/ESK7FNGGBCDTL4VECZJHFUTC2I.json","graph_json":"https://pith.science/api/pith-number/ESK7FNGGBCDTL4VECZJHFUTC2I/graph.json","events_json":"https://pith.science/api/pith-number/ESK7FNGGBCDTL4VECZJHFUTC2I/events.json","paper":"https://pith.science/paper/ESK7FNGG"},"agent_actions":{"view_html":"https://pith.science/pith/ESK7FNGGBCDTL4VECZJHFUTC2I","download_json":"https://pith.science/pith/ESK7FNGGBCDTL4VECZJHFUTC2I.json","view_paper":"https://pith.science/paper/ESK7FNGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.5799&json=true","fetch_graph":"https://pith.science/api/pith-number/ESK7FNGGBCDTL4VECZJHFUTC2I/graph.json","fetch_events":"https://pith.science/api/pith-number/ESK7FNGGBCDTL4VECZJHFUTC2I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ESK7FNGGBCDTL4VECZJHFUTC2I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ESK7FNGGBCDTL4VECZJHFUTC2I/action/storage_attestation","attest_author":"https://pith.science/pith/ESK7FNGGBCDTL4VECZJHFUTC2I/action/author_attestation","sign_citation":"https://pith.science/pith/ESK7FNGGBCDTL4VECZJHFUTC2I/action/citation_signature","submit_replication":"https://pith.science/pith/ESK7FNGGBCDTL4VECZJHFUTC2I/action/replication_record"}},"created_at":"2026-05-18T02:57:26.209121+00:00","updated_at":"2026-05-18T02:57:26.209121+00:00"}