{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:YHFSS3EDRSYXA55PAF7J36TTQ4","short_pith_number":"pith:YHFSS3ED","canonical_record":{"source":{"id":"1608.04826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-17T01:19:42Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"3f7859e28c9870f6fc47f1b7e3ad5694ccc01bfdfe5d948eba187c6ff24d7e18","abstract_canon_sha256":"e5869c28f1dff65fe11180cda7f4ef68735628ad50f21c08cbd532c05287b438"},"schema_version":"1.0"},"canonical_sha256":"c1cb296c838cb17077af017e9dfa738702f895a0d52fa7e75b3a479e183d542f","source":{"kind":"arxiv","id":"1608.04826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04826","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04826v1","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04826","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"YHFSS3EDRSYX","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YHFSS3EDRSYXA55P","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YHFSS3ED","created_at":"2026-05-18T12:30:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:YHFSS3EDRSYXA55PAF7J36TTQ4","target":"record","payload":{"canonical_record":{"source":{"id":"1608.04826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-17T01:19:42Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"3f7859e28c9870f6fc47f1b7e3ad5694ccc01bfdfe5d948eba187c6ff24d7e18","abstract_canon_sha256":"e5869c28f1dff65fe11180cda7f4ef68735628ad50f21c08cbd532c05287b438"},"schema_version":"1.0"},"canonical_sha256":"c1cb296c838cb17077af017e9dfa738702f895a0d52fa7e75b3a479e183d542f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:33.442112Z","signature_b64":"VNZZmfYYq7IxoSSv8tfh+c0EfmmGguqJriV8aNnO9bKAu40LxnM8nq8sIwiu8fUw9m70e6fOrImGiAERtJdNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1cb296c838cb17077af017e9dfa738702f895a0d52fa7e75b3a479e183d542f","last_reissued_at":"2026-05-18T01:08:33.441562Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:33.441562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.04826","source_version":1,"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-18T01:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sVKRzg3aG32sSOCnyQaH/Ny9DTJYYfxSRi2xPmplG+9epndkH5sg4cu4QM/eqh5+zaV9HfTPIuy30hdWFfOQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:08:12.555854Z"},"content_sha256":"8625d1ef755aa6126eb22101ef950e5141a9cd5110c5b9d5f875a3b57d6cd6d4","schema_version":"1.0","event_id":"sha256:8625d1ef755aa6126eb22101ef950e5141a9cd5110c5b9d5f875a3b57d6cd6d4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:YHFSS3EDRSYXA55PAF7J36TTQ4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A better convergence analysis of the block coordinate descent method for large scale machine learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Rujie Liu, Ziqiang Shi","submitted_at":"2016-08-17T01:19:42Z","abstract_excerpt":"This paper considers the problems of unconstrained minimization of large scale smooth convex functions having block-coordinate-wise Lipschitz continuous gradients. The block coordinate descent (BCD) method are among the first optimization schemes suggested for solving such problems \\cite{nesterov2012efficiency}. We obtain a new lower (to our best knowledge the lowest currently) bound that is $16p^3$ times smaller than the best known on the information-based complexity of BCD method based on an effective technique called Performance Estimation Problem (PEP) proposed by Drori and Teboulle \\cite{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04826","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"},"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-18T01:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e1NALNG+r2637aCqod7EK5x1iGri0XG3XR9OooIk694KQXZjHWjssTbVfa/KFlCSHkZ3KvG3TivNLJFvnc1PAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T04:08:12.556213Z"},"content_sha256":"d61b89ad9504847746a44ed28d4c86c9a411b7dc57d555bc92a9cd81688c6607","schema_version":"1.0","event_id":"sha256:d61b89ad9504847746a44ed28d4c86c9a411b7dc57d555bc92a9cd81688c6607"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YHFSS3EDRSYXA55PAF7J36TTQ4/bundle.json","state_url":"https://pith.science/pith/YHFSS3EDRSYXA55PAF7J36TTQ4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YHFSS3EDRSYXA55PAF7J36TTQ4/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-06-27T04:08:12Z","links":{"resolver":"https://pith.science/pith/YHFSS3EDRSYXA55PAF7J36TTQ4","bundle":"https://pith.science/pith/YHFSS3EDRSYXA55PAF7J36TTQ4/bundle.json","state":"https://pith.science/pith/YHFSS3EDRSYXA55PAF7J36TTQ4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YHFSS3EDRSYXA55PAF7J36TTQ4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:YHFSS3EDRSYXA55PAF7J36TTQ4","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":"e5869c28f1dff65fe11180cda7f4ef68735628ad50f21c08cbd532c05287b438","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-17T01:19:42Z","title_canon_sha256":"3f7859e28c9870f6fc47f1b7e3ad5694ccc01bfdfe5d948eba187c6ff24d7e18"},"schema_version":"1.0","source":{"id":"1608.04826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.04826","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"1608.04826v1","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.04826","created_at":"2026-05-18T01:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"YHFSS3EDRSYX","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"YHFSS3EDRSYXA55P","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"YHFSS3ED","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:d61b89ad9504847746a44ed28d4c86c9a411b7dc57d555bc92a9cd81688c6607","target":"graph","created_at":"2026-05-18T01:08:33Z","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":"This paper considers the problems of unconstrained minimization of large scale smooth convex functions having block-coordinate-wise Lipschitz continuous gradients. The block coordinate descent (BCD) method are among the first optimization schemes suggested for solving such problems \\cite{nesterov2012efficiency}. We obtain a new lower (to our best knowledge the lowest currently) bound that is $16p^3$ times smaller than the best known on the information-based complexity of BCD method based on an effective technique called Performance Estimation Problem (PEP) proposed by Drori and Teboulle \\cite{","authors_text":"Rujie Liu, Ziqiang Shi","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-17T01:19:42Z","title":"A better convergence analysis of the block coordinate descent method for large scale machine learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.04826","kind":"arxiv","version":1},"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:8625d1ef755aa6126eb22101ef950e5141a9cd5110c5b9d5f875a3b57d6cd6d4","target":"record","created_at":"2026-05-18T01:08:33Z","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":"e5869c28f1dff65fe11180cda7f4ef68735628ad50f21c08cbd532c05287b438","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-08-17T01:19:42Z","title_canon_sha256":"3f7859e28c9870f6fc47f1b7e3ad5694ccc01bfdfe5d948eba187c6ff24d7e18"},"schema_version":"1.0","source":{"id":"1608.04826","kind":"arxiv","version":1}},"canonical_sha256":"c1cb296c838cb17077af017e9dfa738702f895a0d52fa7e75b3a479e183d542f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1cb296c838cb17077af017e9dfa738702f895a0d52fa7e75b3a479e183d542f","first_computed_at":"2026-05-18T01:08:33.441562Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:33.441562Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VNZZmfYYq7IxoSSv8tfh+c0EfmmGguqJriV8aNnO9bKAu40LxnM8nq8sIwiu8fUw9m70e6fOrImGiAERtJdNBw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:33.442112Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.04826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8625d1ef755aa6126eb22101ef950e5141a9cd5110c5b9d5f875a3b57d6cd6d4","sha256:d61b89ad9504847746a44ed28d4c86c9a411b7dc57d555bc92a9cd81688c6607"],"state_sha256":"c2ef5fdb9b2715b799eb35c930934b457720fec46840c4aa633d5a8239db8230"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ule0G6kJhthItgchQ86R6ZSkXhjfCeeC6N/tKzuCW3XgPxG46z+Fzw5oc5JaUT3bz0qWQ/ub20HQtKkdKr6pCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T04:08:12.558146Z","bundle_sha256":"dd73b130f72d792b12a303ab5124a645aa586d2b27755395c30c24774c59113c"}}