{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:K6SP4KZXJIOQFDLZTMZ3NDBV46","short_pith_number":"pith:K6SP4KZX","schema_version":"1.0","canonical_sha256":"57a4fe2b374a1d028d799b33b68c35e78fff154cdc9a1731e145ff5b27f91399","source":{"kind":"arxiv","id":"1503.03033","version":1},"attestation_state":"computed","paper":{"title":"On the Complexity of Parallel Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Martin Tak\\'a\\v{c}, Peter Richt\\'arik, Rachael Tappenden","submitted_at":"2015-03-10T18:41:27Z","abstract_excerpt":"In this work we study the parallel coordinate descent method (PCDM) proposed by Richt\\'arik and Tak\\'a\\v{c} [26] for minimizing a regularized convex function. We adopt elements from the work of Xiao and Lu [39], and combine them with several new insights, to obtain sharper iteration complexity results for PCDM than those presented in [26]. Moreover, we show that PCDM is monotonic in expectation, which was not confirmed in [26], and we also derive the first high probability iteration complexity result where the initial levelset is unbounded."},"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":"1503.03033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-03-10T18:41:27Z","cross_cats_sorted":[],"title_canon_sha256":"ef5198c60bb78aa00e5ab2c9f32e81a76258ac151980d03e05bdd424d4de276e","abstract_canon_sha256":"dba7dcf882949415819259b881897a76ee2dbe561d4591edccbbd754c4d86f8c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:12.521331Z","signature_b64":"FBaRcFvaa1TsJmJH7Bz8T0LsI05+CWvVloE9nxZwi5qrMYFLUY1sUEN/rUb7u4QWz+WTUJaHEFe4MjQsgSQzAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57a4fe2b374a1d028d799b33b68c35e78fff154cdc9a1731e145ff5b27f91399","last_reissued_at":"2026-05-18T02:25:12.520827Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:12.520827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Complexity of Parallel Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Martin Tak\\'a\\v{c}, Peter Richt\\'arik, Rachael Tappenden","submitted_at":"2015-03-10T18:41:27Z","abstract_excerpt":"In this work we study the parallel coordinate descent method (PCDM) proposed by Richt\\'arik and Tak\\'a\\v{c} [26] for minimizing a regularized convex function. We adopt elements from the work of Xiao and Lu [39], and combine them with several new insights, to obtain sharper iteration complexity results for PCDM than those presented in [26]. Moreover, we show that PCDM is monotonic in expectation, which was not confirmed in [26], and we also derive the first high probability iteration complexity result where the initial levelset is unbounded."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03033","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":"1503.03033","created_at":"2026-05-18T02:25:12.520901+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.03033v1","created_at":"2026-05-18T02:25:12.520901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03033","created_at":"2026-05-18T02:25:12.520901+00:00"},{"alias_kind":"pith_short_12","alias_value":"K6SP4KZXJIOQ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"K6SP4KZXJIOQFDLZ","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"K6SP4KZX","created_at":"2026-05-18T12:29:27.538025+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/K6SP4KZXJIOQFDLZTMZ3NDBV46","json":"https://pith.science/pith/K6SP4KZXJIOQFDLZTMZ3NDBV46.json","graph_json":"https://pith.science/api/pith-number/K6SP4KZXJIOQFDLZTMZ3NDBV46/graph.json","events_json":"https://pith.science/api/pith-number/K6SP4KZXJIOQFDLZTMZ3NDBV46/events.json","paper":"https://pith.science/paper/K6SP4KZX"},"agent_actions":{"view_html":"https://pith.science/pith/K6SP4KZXJIOQFDLZTMZ3NDBV46","download_json":"https://pith.science/pith/K6SP4KZXJIOQFDLZTMZ3NDBV46.json","view_paper":"https://pith.science/paper/K6SP4KZX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.03033&json=true","fetch_graph":"https://pith.science/api/pith-number/K6SP4KZXJIOQFDLZTMZ3NDBV46/graph.json","fetch_events":"https://pith.science/api/pith-number/K6SP4KZXJIOQFDLZTMZ3NDBV46/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K6SP4KZXJIOQFDLZTMZ3NDBV46/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K6SP4KZXJIOQFDLZTMZ3NDBV46/action/storage_attestation","attest_author":"https://pith.science/pith/K6SP4KZXJIOQFDLZTMZ3NDBV46/action/author_attestation","sign_citation":"https://pith.science/pith/K6SP4KZXJIOQFDLZTMZ3NDBV46/action/citation_signature","submit_replication":"https://pith.science/pith/K6SP4KZXJIOQFDLZTMZ3NDBV46/action/replication_record"}},"created_at":"2026-05-18T02:25:12.520901+00:00","updated_at":"2026-05-18T02:25:12.520901+00:00"}