{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:PNPMTPCN7V3VJUQXD4DY7HROK4","short_pith_number":"pith:PNPMTPCN","canonical_record":{"source":{"id":"1310.6957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-25T15:30:04Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"60a1b3742ee1d6dba9d1341caa475ab1581ba6368db5c213ea54c00825f70d6f","abstract_canon_sha256":"a5c8a78f684ebabd3966e514b0dfb2be18152637d52c47b27933f67d9828b7c1"},"schema_version":"1.0"},"canonical_sha256":"7b5ec9bc4dfd7754d2171f078f9e2e57285d35021e6d2426c7abd8f8f761f239","source":{"kind":"arxiv","id":"1310.6957","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6957","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6957v2","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6957","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"PNPMTPCN7V3V","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PNPMTPCN7V3VJUQX","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PNPMTPCN","created_at":"2026-05-18T12:27:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:PNPMTPCN7V3VJUQXD4DY7HROK4","target":"record","payload":{"canonical_record":{"source":{"id":"1310.6957","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-25T15:30:04Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"60a1b3742ee1d6dba9d1341caa475ab1581ba6368db5c213ea54c00825f70d6f","abstract_canon_sha256":"a5c8a78f684ebabd3966e514b0dfb2be18152637d52c47b27933f67d9828b7c1"},"schema_version":"1.0"},"canonical_sha256":"7b5ec9bc4dfd7754d2171f078f9e2e57285d35021e6d2426c7abd8f8f761f239","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:17:43.231833Z","signature_b64":"SfndMV/sW+3+8CobEbgimbJI1sQWMcliLFjOJktk0lpBHiECQfKfRpL9mFZZQabtPFeKvK/7Y+/p8MaMRzYsBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b5ec9bc4dfd7754d2171f078f9e2e57285d35021e6d2426c7abd8f8f761f239","last_reissued_at":"2026-05-18T02:17:43.231156Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:17:43.231156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.6957","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zH4+RaID/+BrBw7l2yJg4kABXuTPZV4otwcEAcfuqEczoOBtNZz02DNi6XjX8S92z+vzNwi3PpIO0f2/cDAEBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:51:34.233590Z"},"content_sha256":"f353dca640e9ae4a1df0a1e8ddf58e52a0c55e018386ac5ed63edbaabaa81497","schema_version":"1.0","event_id":"sha256:f353dca640e9ae4a1df0a1e8ddf58e52a0c55e018386ac5ed63edbaabaa81497"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:PNPMTPCN7V3VJUQXD4DY7HROK4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Iteration Complexity Analysis of Block Coordinate Descent Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"math.OC","authors_text":"Meisam Razaviyayn, Mingyi Hong, Xiangfeng Wang, Zhi-Quan Luo","submitted_at":"2013-10-25T15:30:04Z","abstract_excerpt":"In this paper, we provide a unified iteration complexity analysis for a family of general block coordinate descent (BCD) methods, covering popular methods such as the block coordinate gradient descent (BCGD) and the block coordinate proximal gradient (BCPG), under various different coordinate update rules. We unify these algorithms under the so-called Block Successive Upper-bound Minimization (BSUM) framework, and show that for a broad class of multi-block nonsmooth convex problems, all algorithms covered by the BSUM framework achieve a global sublinear iteration complexity of $O(1/r)$, where "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6957","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:17:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PFMyRih/HhC8BEvLmBvb2mGuyKXKxNUQbWP4dKkxBZYA0YnNAfcOGxbchIebdZbywII0eFP6CN/JeIBXfhLUAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T17:51:34.234007Z"},"content_sha256":"80be488f0c9247814db7090ed454d96f6c5f6698224f896322be6938fdd5d3e8","schema_version":"1.0","event_id":"sha256:80be488f0c9247814db7090ed454d96f6c5f6698224f896322be6938fdd5d3e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PNPMTPCN7V3VJUQXD4DY7HROK4/bundle.json","state_url":"https://pith.science/pith/PNPMTPCN7V3VJUQXD4DY7HROK4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PNPMTPCN7V3VJUQXD4DY7HROK4/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T17:51:34Z","links":{"resolver":"https://pith.science/pith/PNPMTPCN7V3VJUQXD4DY7HROK4","bundle":"https://pith.science/pith/PNPMTPCN7V3VJUQXD4DY7HROK4/bundle.json","state":"https://pith.science/pith/PNPMTPCN7V3VJUQXD4DY7HROK4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PNPMTPCN7V3VJUQXD4DY7HROK4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:PNPMTPCN7V3VJUQXD4DY7HROK4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a5c8a78f684ebabd3966e514b0dfb2be18152637d52c47b27933f67d9828b7c1","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-25T15:30:04Z","title_canon_sha256":"60a1b3742ee1d6dba9d1341caa475ab1581ba6368db5c213ea54c00825f70d6f"},"schema_version":"1.0","source":{"id":"1310.6957","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.6957","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"arxiv_version","alias_value":"1310.6957v2","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6957","created_at":"2026-05-18T02:17:43Z"},{"alias_kind":"pith_short_12","alias_value":"PNPMTPCN7V3V","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_16","alias_value":"PNPMTPCN7V3VJUQX","created_at":"2026-05-18T12:27:54Z"},{"alias_kind":"pith_short_8","alias_value":"PNPMTPCN","created_at":"2026-05-18T12:27:54Z"}],"graph_snapshots":[{"event_id":"sha256:80be488f0c9247814db7090ed454d96f6c5f6698224f896322be6938fdd5d3e8","target":"graph","created_at":"2026-05-18T02:17:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we provide a unified iteration complexity analysis for a family of general block coordinate descent (BCD) methods, covering popular methods such as the block coordinate gradient descent (BCGD) and the block coordinate proximal gradient (BCPG), under various different coordinate update rules. We unify these algorithms under the so-called Block Successive Upper-bound Minimization (BSUM) framework, and show that for a broad class of multi-block nonsmooth convex problems, all algorithms covered by the BSUM framework achieve a global sublinear iteration complexity of $O(1/r)$, where ","authors_text":"Meisam Razaviyayn, Mingyi Hong, Xiangfeng Wang, Zhi-Quan Luo","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-25T15:30:04Z","title":"Iteration Complexity Analysis of Block Coordinate Descent Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6957","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f353dca640e9ae4a1df0a1e8ddf58e52a0c55e018386ac5ed63edbaabaa81497","target":"record","created_at":"2026-05-18T02:17:43Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a5c8a78f684ebabd3966e514b0dfb2be18152637d52c47b27933f67d9828b7c1","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-10-25T15:30:04Z","title_canon_sha256":"60a1b3742ee1d6dba9d1341caa475ab1581ba6368db5c213ea54c00825f70d6f"},"schema_version":"1.0","source":{"id":"1310.6957","kind":"arxiv","version":2}},"canonical_sha256":"7b5ec9bc4dfd7754d2171f078f9e2e57285d35021e6d2426c7abd8f8f761f239","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7b5ec9bc4dfd7754d2171f078f9e2e57285d35021e6d2426c7abd8f8f761f239","first_computed_at":"2026-05-18T02:17:43.231156Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:17:43.231156Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SfndMV/sW+3+8CobEbgimbJI1sQWMcliLFjOJktk0lpBHiECQfKfRpL9mFZZQabtPFeKvK/7Y+/p8MaMRzYsBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:17:43.231833Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.6957","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f353dca640e9ae4a1df0a1e8ddf58e52a0c55e018386ac5ed63edbaabaa81497","sha256:80be488f0c9247814db7090ed454d96f6c5f6698224f896322be6938fdd5d3e8"],"state_sha256":"2a11137667e017352af9b0f074d12472112c097dd2230082a8d510585225a40f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vo8S8SRA4ZK5iOrgwIDZaT7NvnHqt5afRKg65xGijDNQ9qViLKLGfwfOOJ3MclarvfO3+MdvybdOFsSM5XUNCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T17:51:34.237366Z","bundle_sha256":"fa348ced50b1eed157b131cff132255d712548d2369cbaace2e0e18ef5b88d31"}}