{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:6WZPAX3CANG7CYDUXM4VDEKV3S","short_pith_number":"pith:6WZPAX3C","canonical_record":{"source":{"id":"1712.08859","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-23T23:25:59Z","cross_cats_sorted":[],"title_canon_sha256":"209fdfe19c31f49a88de384dd87cdb609150e22648f1dbf07747fcc7ac618f84","abstract_canon_sha256":"5661a2d6e1e381c5a0fff8782b4dfb2581e0b9bb9c1c4f5189f607fea76a351b"},"schema_version":"1.0"},"canonical_sha256":"f5b2f05f62034df16074bb39519155dcbc23350eb4d916751cdb77d78cd13528","source":{"kind":"arxiv","id":"1712.08859","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08859","created_at":"2026-07-05T04:44:38Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08859v3","created_at":"2026-07-05T04:44:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08859","created_at":"2026-07-05T04:44:38Z"},{"alias_kind":"pith_short_12","alias_value":"6WZPAX3CANG7","created_at":"2026-07-05T04:44:38Z"},{"alias_kind":"pith_short_16","alias_value":"6WZPAX3CANG7CYDU","created_at":"2026-07-05T04:44:38Z"},{"alias_kind":"pith_short_8","alias_value":"6WZPAX3C","created_at":"2026-07-05T04:44:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:6WZPAX3CANG7CYDUXM4VDEKV3S","target":"record","payload":{"canonical_record":{"source":{"id":"1712.08859","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-23T23:25:59Z","cross_cats_sorted":[],"title_canon_sha256":"209fdfe19c31f49a88de384dd87cdb609150e22648f1dbf07747fcc7ac618f84","abstract_canon_sha256":"5661a2d6e1e381c5a0fff8782b4dfb2581e0b9bb9c1c4f5189f607fea76a351b"},"schema_version":"1.0"},"canonical_sha256":"f5b2f05f62034df16074bb39519155dcbc23350eb4d916751cdb77d78cd13528","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:44:38.274764Z","signature_b64":"mExYcyi2QAftSKsvNk4nBm9ZFRgyvoXcdrPgnOeNQ3xErzfzbuiVRbp7b+mAwEIIeg8+9pkbB9BjchiD7JvDBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5b2f05f62034df16074bb39519155dcbc23350eb4d916751cdb77d78cd13528","last_reissued_at":"2026-07-05T04:44:38.274384Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:44:38.274384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1712.08859","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-07-05T04:44:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7XsWEGfk1xmdz88kKNzBZhv/0UPaXhsl+Ww07317ZMQlMg8ITYUbtFVea4VJpNmGTUajCWOn2BM3AXFy8NraBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:19:54.786303Z"},"content_sha256":"aa29a2d0128413299c297cdd693c088618ccbd1f4b373b772c05a5a320684341","schema_version":"1.0","event_id":"sha256:aa29a2d0128413299c297cdd693c088618ccbd1f4b373b772c05a5a320684341"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:6WZPAX3CANG7CYDUXM4VDEKV3S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Let's Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Issam Laradji, Julie Nutini, Mark Schmidt","submitted_at":"2017-12-23T23:25:59Z","abstract_excerpt":"Block coordinate descent (BCD) methods are widely used for large-scale numerical optimization because of their cheap iteration costs, low memory requirements, amenability to parallelization, and ability to exploit problem structure. Three main algorithmic choices influence the performance of BCD methods: the block partitioning strategy, the block selection rule, and the block update rule. In this paper we explore all three of these building blocks and propose variations for each that can significantly improve the progress made by each BCD iteration. We (i) propose new greedy block-selection st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08859","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1712.08859/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T04:44:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nillkrSiBz0ZD8CD1ylAeBB1CZ0LBk/h0GR4juMteklrx6RBhc11u3did6s0pl8qVOzoVFXEInwdclacmzcZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T17:19:54.786838Z"},"content_sha256":"e1b5b8273b4df9f0e0f1badc603a2ef24197185c32b3ee21ad7d545c84c0d54e","schema_version":"1.0","event_id":"sha256:e1b5b8273b4df9f0e0f1badc603a2ef24197185c32b3ee21ad7d545c84c0d54e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6WZPAX3CANG7CYDUXM4VDEKV3S/bundle.json","state_url":"https://pith.science/pith/6WZPAX3CANG7CYDUXM4VDEKV3S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6WZPAX3CANG7CYDUXM4VDEKV3S/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-08-21T17:19:54Z","links":{"resolver":"https://pith.science/pith/6WZPAX3CANG7CYDUXM4VDEKV3S","bundle":"https://pith.science/pith/6WZPAX3CANG7CYDUXM4VDEKV3S/bundle.json","state":"https://pith.science/pith/6WZPAX3CANG7CYDUXM4VDEKV3S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6WZPAX3CANG7CYDUXM4VDEKV3S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:6WZPAX3CANG7CYDUXM4VDEKV3S","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":"5661a2d6e1e381c5a0fff8782b4dfb2581e0b9bb9c1c4f5189f607fea76a351b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-23T23:25:59Z","title_canon_sha256":"209fdfe19c31f49a88de384dd87cdb609150e22648f1dbf07747fcc7ac618f84"},"schema_version":"1.0","source":{"id":"1712.08859","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.08859","created_at":"2026-07-05T04:44:38Z"},{"alias_kind":"arxiv_version","alias_value":"1712.08859v3","created_at":"2026-07-05T04:44:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.08859","created_at":"2026-07-05T04:44:38Z"},{"alias_kind":"pith_short_12","alias_value":"6WZPAX3CANG7","created_at":"2026-07-05T04:44:38Z"},{"alias_kind":"pith_short_16","alias_value":"6WZPAX3CANG7CYDU","created_at":"2026-07-05T04:44:38Z"},{"alias_kind":"pith_short_8","alias_value":"6WZPAX3C","created_at":"2026-07-05T04:44:38Z"}],"graph_snapshots":[{"event_id":"sha256:e1b5b8273b4df9f0e0f1badc603a2ef24197185c32b3ee21ad7d545c84c0d54e","target":"graph","created_at":"2026-07-05T04:44:38Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1712.08859/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Block coordinate descent (BCD) methods are widely used for large-scale numerical optimization because of their cheap iteration costs, low memory requirements, amenability to parallelization, and ability to exploit problem structure. Three main algorithmic choices influence the performance of BCD methods: the block partitioning strategy, the block selection rule, and the block update rule. In this paper we explore all three of these building blocks and propose variations for each that can significantly improve the progress made by each BCD iteration. We (i) propose new greedy block-selection st","authors_text":"Issam Laradji, Julie Nutini, Mark Schmidt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-23T23:25:59Z","title":"Let's Make Block Coordinate Descent Converge Faster: Faster Greedy Rules, Message-Passing, Active-Set Complexity, and Superlinear Convergence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.08859","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:aa29a2d0128413299c297cdd693c088618ccbd1f4b373b772c05a5a320684341","target":"record","created_at":"2026-07-05T04:44:38Z","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":"5661a2d6e1e381c5a0fff8782b4dfb2581e0b9bb9c1c4f5189f607fea76a351b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-12-23T23:25:59Z","title_canon_sha256":"209fdfe19c31f49a88de384dd87cdb609150e22648f1dbf07747fcc7ac618f84"},"schema_version":"1.0","source":{"id":"1712.08859","kind":"arxiv","version":3}},"canonical_sha256":"f5b2f05f62034df16074bb39519155dcbc23350eb4d916751cdb77d78cd13528","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f5b2f05f62034df16074bb39519155dcbc23350eb4d916751cdb77d78cd13528","first_computed_at":"2026-07-05T04:44:38.274384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:44:38.274384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mExYcyi2QAftSKsvNk4nBm9ZFRgyvoXcdrPgnOeNQ3xErzfzbuiVRbp7b+mAwEIIeg8+9pkbB9BjchiD7JvDBA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:44:38.274764Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.08859","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa29a2d0128413299c297cdd693c088618ccbd1f4b373b772c05a5a320684341","sha256:e1b5b8273b4df9f0e0f1badc603a2ef24197185c32b3ee21ad7d545c84c0d54e"],"state_sha256":"65f190891da99bd124676dcede4781c27727d11d2edb5d6449bc7c3c36269832"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GFJqzH1lx+C6a7Xfjtg41zEhJv773Un1pFgw9zM+UdLHeBulE/MEzq4q9h6ODUP0SWxUH5hGlVz/D4hbSqNiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T17:19:54.790932Z","bundle_sha256":"0a1d812fd3d7d9f2e4b8fa7b79774201d197188b418b29a2a448120efd1148b2"}}