{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KE3ZW2V5CTVDFOIEMV3WH7QI3P","short_pith_number":"pith:KE3ZW2V5","schema_version":"1.0","canonical_sha256":"51379b6abd14ea32b904657763fe08dbe80dde543b22206466b0b14608e52227","source":{"kind":"arxiv","id":"1805.09185","version":2},"attestation_state":"computed","paper":{"title":"Alternating Randomized Block Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jelena Diakonikolas, Lorenzo Orecchia","submitted_at":"2018-05-23T14:08:01Z","abstract_excerpt":"Block-coordinate descent algorithms and alternating minimization methods are fundamental optimization algorithms and an important primitive in large-scale optimization and machine learning. While various block-coordinate-descent-type methods have been studied extensively, only alternating minimization -- which applies to the setting of only two blocks -- is known to have convergence time that scales independently of the least smooth block. A natural question is then: is the setting of two blocks special?\n  We show that the answer is \"no\" as long as the least smooth block can be optimized exact"},"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":"1805.09185","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-23T14:08:01Z","cross_cats_sorted":[],"title_canon_sha256":"3b0b8c0704fe4e8c86bd67fe45453dc575d3307928f61fadd7ce991a723de1ca","abstract_canon_sha256":"baaafffd2e3e5c0c0db534f55b0a4257d491b4dd638eb7fad89a8e03e5c6a982"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:56.245111Z","signature_b64":"u2MjBu0xq78Nqk/mRVDsIzY8HaGN7eeoCYdoGPelxYB90va/e0OySRQD1IQw0bH6UQA3q6mfe4fP5h2sxCslBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51379b6abd14ea32b904657763fe08dbe80dde543b22206466b0b14608e52227","last_reissued_at":"2026-05-17T23:41:56.244474Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:56.244474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Alternating Randomized Block Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jelena Diakonikolas, Lorenzo Orecchia","submitted_at":"2018-05-23T14:08:01Z","abstract_excerpt":"Block-coordinate descent algorithms and alternating minimization methods are fundamental optimization algorithms and an important primitive in large-scale optimization and machine learning. While various block-coordinate-descent-type methods have been studied extensively, only alternating minimization -- which applies to the setting of only two blocks -- is known to have convergence time that scales independently of the least smooth block. A natural question is then: is the setting of two blocks special?\n  We show that the answer is \"no\" as long as the least smooth block can be optimized exact"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.09185","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":"1805.09185","created_at":"2026-05-17T23:41:56.244556+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.09185v2","created_at":"2026-05-17T23:41:56.244556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.09185","created_at":"2026-05-17T23:41:56.244556+00:00"},{"alias_kind":"pith_short_12","alias_value":"KE3ZW2V5CTVD","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KE3ZW2V5CTVDFOIE","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KE3ZW2V5","created_at":"2026-05-18T12:32:33.847187+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/KE3ZW2V5CTVDFOIEMV3WH7QI3P","json":"https://pith.science/pith/KE3ZW2V5CTVDFOIEMV3WH7QI3P.json","graph_json":"https://pith.science/api/pith-number/KE3ZW2V5CTVDFOIEMV3WH7QI3P/graph.json","events_json":"https://pith.science/api/pith-number/KE3ZW2V5CTVDFOIEMV3WH7QI3P/events.json","paper":"https://pith.science/paper/KE3ZW2V5"},"agent_actions":{"view_html":"https://pith.science/pith/KE3ZW2V5CTVDFOIEMV3WH7QI3P","download_json":"https://pith.science/pith/KE3ZW2V5CTVDFOIEMV3WH7QI3P.json","view_paper":"https://pith.science/paper/KE3ZW2V5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.09185&json=true","fetch_graph":"https://pith.science/api/pith-number/KE3ZW2V5CTVDFOIEMV3WH7QI3P/graph.json","fetch_events":"https://pith.science/api/pith-number/KE3ZW2V5CTVDFOIEMV3WH7QI3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KE3ZW2V5CTVDFOIEMV3WH7QI3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KE3ZW2V5CTVDFOIEMV3WH7QI3P/action/storage_attestation","attest_author":"https://pith.science/pith/KE3ZW2V5CTVDFOIEMV3WH7QI3P/action/author_attestation","sign_citation":"https://pith.science/pith/KE3ZW2V5CTVDFOIEMV3WH7QI3P/action/citation_signature","submit_replication":"https://pith.science/pith/KE3ZW2V5CTVDFOIEMV3WH7QI3P/action/replication_record"}},"created_at":"2026-05-17T23:41:56.244556+00:00","updated_at":"2026-05-17T23:41:56.244556+00:00"}