{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HT3EWQFTIP4THNTKTWASECBZ3D","short_pith_number":"pith:HT3EWQFT","canonical_record":{"source":{"id":"1607.02793","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-10T23:15:18Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"6162598cb06e4cc5ada20014c12da9c0c9c3c4a84e97ce22354c130e33fdffcb","abstract_canon_sha256":"46a23a85fd1412a2498e9ced7049d635c58f8e8a730ee9307c0e81f9ac7b5a62"},"schema_version":"1.0"},"canonical_sha256":"3cf64b40b343f933b66a9d81220839d8c17b8909cc345b8d1a5c7e676f81ffa8","source":{"kind":"arxiv","id":"1607.02793","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02793","created_at":"2026-05-18T00:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02793v3","created_at":"2026-05-18T00:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02793","created_at":"2026-05-18T00:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"HT3EWQFTIP4T","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HT3EWQFTIP4THNTK","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HT3EWQFT","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HT3EWQFTIP4THNTKTWASECBZ3D","target":"record","payload":{"canonical_record":{"source":{"id":"1607.02793","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-10T23:15:18Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"6162598cb06e4cc5ada20014c12da9c0c9c3c4a84e97ce22354c130e33fdffcb","abstract_canon_sha256":"46a23a85fd1412a2498e9ced7049d635c58f8e8a730ee9307c0e81f9ac7b5a62"},"schema_version":"1.0"},"canonical_sha256":"3cf64b40b343f933b66a9d81220839d8c17b8909cc345b8d1a5c7e676f81ffa8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:52.177613Z","signature_b64":"GDwhpONpTeMkWnLu3ZLfTiK+2W5qdC59XRRxeD14xMFPnbmFB0jV9AzDwVwtnIwXyj0h4rIJuafArRllk7AJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cf64b40b343f933b66a9d81220839d8c17b8909cc345b8d1a5c7e676f81ffa8","last_reissued_at":"2026-05-18T00:29:52.177007Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:52.177007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.02793","source_version":3,"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-18T00:29:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TfzZN88+Mz7B3lrKks0TlO4Mx0o5bnFV/er+M8q4/uz3dhO1pyMETLszZONVukijgSLUBYBpgJp3xVY+u+QuAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:59:05.752822Z"},"content_sha256":"0c94c9ef101f1a8356ee37e73c6a76c99723b25180fcdc699d07be02f1e1d620","schema_version":"1.0","event_id":"sha256:0c94c9ef101f1a8356ee37e73c6a76c99723b25180fcdc699d07be02f1e1d620"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HT3EWQFTIP4THNTKTWASECBZ3D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Han Liu, Mingyi Hong, Raman Arora, Tuo Zhao, Xingguo Li","submitted_at":"2016-07-10T23:15:18Z","abstract_excerpt":"The cyclic block coordinate descent-type (CBCD-type) methods, which performs iterative updates for a few coordinates (a block) simultaneously throughout the procedure, have shown remarkable computational performance for solving strongly convex minimization problems. Typical applications include many popular statistical machine learning methods such as elastic-net regression, ridge penalized logistic regression, and sparse additive regression. Existing optimization literature has shown that for strongly convex minimization, the CBCD-type methods attain iteration complexity of $\\mathcal{O}(p\\log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02793","kind":"arxiv","version":3},"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-18T00:29:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0oVpe2BX1mBl0FMYNRyR/qkYvbqch7/bAtgdVWopE34v8LCHzJgn2aOhixUCJ5DP7AW7AU4r2nWTPoqby1hCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T15:59:05.753648Z"},"content_sha256":"c872724708035835f6e62cf8a3318eaa5e4ad46ecd6c822292935986b9dd37bc","schema_version":"1.0","event_id":"sha256:c872724708035835f6e62cf8a3318eaa5e4ad46ecd6c822292935986b9dd37bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HT3EWQFTIP4THNTKTWASECBZ3D/bundle.json","state_url":"https://pith.science/pith/HT3EWQFTIP4THNTKTWASECBZ3D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HT3EWQFTIP4THNTKTWASECBZ3D/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-26T15:59:05Z","links":{"resolver":"https://pith.science/pith/HT3EWQFTIP4THNTKTWASECBZ3D","bundle":"https://pith.science/pith/HT3EWQFTIP4THNTKTWASECBZ3D/bundle.json","state":"https://pith.science/pith/HT3EWQFTIP4THNTKTWASECBZ3D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HT3EWQFTIP4THNTKTWASECBZ3D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HT3EWQFTIP4THNTKTWASECBZ3D","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":"46a23a85fd1412a2498e9ced7049d635c58f8e8a730ee9307c0e81f9ac7b5a62","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-10T23:15:18Z","title_canon_sha256":"6162598cb06e4cc5ada20014c12da9c0c9c3c4a84e97ce22354c130e33fdffcb"},"schema_version":"1.0","source":{"id":"1607.02793","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.02793","created_at":"2026-05-18T00:29:52Z"},{"alias_kind":"arxiv_version","alias_value":"1607.02793v3","created_at":"2026-05-18T00:29:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.02793","created_at":"2026-05-18T00:29:52Z"},{"alias_kind":"pith_short_12","alias_value":"HT3EWQFTIP4T","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"HT3EWQFTIP4THNTK","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"HT3EWQFT","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:c872724708035835f6e62cf8a3318eaa5e4ad46ecd6c822292935986b9dd37bc","target":"graph","created_at":"2026-05-18T00:29:52Z","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":"The cyclic block coordinate descent-type (CBCD-type) methods, which performs iterative updates for a few coordinates (a block) simultaneously throughout the procedure, have shown remarkable computational performance for solving strongly convex minimization problems. Typical applications include many popular statistical machine learning methods such as elastic-net regression, ridge penalized logistic regression, and sparse additive regression. Existing optimization literature has shown that for strongly convex minimization, the CBCD-type methods attain iteration complexity of $\\mathcal{O}(p\\log","authors_text":"Han Liu, Mingyi Hong, Raman Arora, Tuo Zhao, Xingguo Li","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-10T23:15:18Z","title":"On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.02793","kind":"arxiv","version":3},"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:0c94c9ef101f1a8356ee37e73c6a76c99723b25180fcdc699d07be02f1e1d620","target":"record","created_at":"2026-05-18T00:29:52Z","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":"46a23a85fd1412a2498e9ced7049d635c58f8e8a730ee9307c0e81f9ac7b5a62","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-10T23:15:18Z","title_canon_sha256":"6162598cb06e4cc5ada20014c12da9c0c9c3c4a84e97ce22354c130e33fdffcb"},"schema_version":"1.0","source":{"id":"1607.02793","kind":"arxiv","version":3}},"canonical_sha256":"3cf64b40b343f933b66a9d81220839d8c17b8909cc345b8d1a5c7e676f81ffa8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3cf64b40b343f933b66a9d81220839d8c17b8909cc345b8d1a5c7e676f81ffa8","first_computed_at":"2026-05-18T00:29:52.177007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:52.177007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GDwhpONpTeMkWnLu3ZLfTiK+2W5qdC59XRRxeD14xMFPnbmFB0jV9AzDwVwtnIwXyj0h4rIJuafArRllk7AJCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:52.177613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.02793","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0c94c9ef101f1a8356ee37e73c6a76c99723b25180fcdc699d07be02f1e1d620","sha256:c872724708035835f6e62cf8a3318eaa5e4ad46ecd6c822292935986b9dd37bc"],"state_sha256":"4cb6d99353b17810566bdb4e3e952d77515d7062766ffc587370c057f27bad26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jAM5bGIjPsj5dilVM95IdVEM071RgSpTbMs0YiSIBF6SF/6PX1R8eJLsdAIWOlCHAoT6yDIuO7dv2YV0+m45Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T15:59:05.757164Z","bundle_sha256":"9a894b20304c999bccdcc2822a5100197d111e3dae5bd3406d886b4c4199902b"}}