{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FRHIZHWWTL2AYDPECVY4QY2BL3","short_pith_number":"pith:FRHIZHWW","canonical_record":{"source":{"id":"1806.02476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-07T00:56:17Z","cross_cats_sorted":[],"title_canon_sha256":"c561343341cf50ceec1eb447ad63aa5b7f16076c3c718031c4a9686b8bf7a9f0","abstract_canon_sha256":"57038ad25e8ba6d73cd5e0b7544ab4c0c38e0171080c5482b58eccf1f9a9d449"},"schema_version":"1.0"},"canonical_sha256":"2c4e8c9ed69af40c0de41571c863415ee976c35590369eae06a4a8152415b705","source":{"kind":"arxiv","id":"1806.02476","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02476","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02476v1","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02476","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"FRHIZHWWTL2A","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FRHIZHWWTL2AYDPE","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FRHIZHWW","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FRHIZHWWTL2AYDPECVY4QY2BL3","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-07T00:56:17Z","cross_cats_sorted":[],"title_canon_sha256":"c561343341cf50ceec1eb447ad63aa5b7f16076c3c718031c4a9686b8bf7a9f0","abstract_canon_sha256":"57038ad25e8ba6d73cd5e0b7544ab4c0c38e0171080c5482b58eccf1f9a9d449"},"schema_version":"1.0"},"canonical_sha256":"2c4e8c9ed69af40c0de41571c863415ee976c35590369eae06a4a8152415b705","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:56.718399Z","signature_b64":"Yu1ssdUaVA5IwA/jI4EmIsVn6TMU6lR27JkRBRLFw8pkfDVibVL2q2ofpS4pR4dOzaIZ3I9Rv9U3C6WLuemmBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c4e8c9ed69af40c0de41571c863415ee976c35590369eae06a4a8152415b705","last_reissued_at":"2026-05-18T00:13:56.717694Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:56.717694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02476","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-18T00:13:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XliBlMB4kvzPuV+VdWOyjes0y3/EwaRHVvqPjhypT4aNPFl5/HFs+8Y2C+x2Q21aOAIhelMT9Qe3L56C6CfLCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T12:05:40.717760Z"},"content_sha256":"17766805438834b585f537b5f4492c62de8588034095ae10d2923f48905795fa","schema_version":"1.0","event_id":"sha256:17766805438834b585f537b5f4492c62de8588034095ae10d2923f48905795fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FRHIZHWWTL2AYDPECVY4QY2BL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Accelerating Greedy Coordinate Descent Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haihao Lu, Robert M. Freund, Vahab Mirrokni","submitted_at":"2018-06-07T00:56:17Z","abstract_excerpt":"We study ways to accelerate greedy coordinate descent in theory and in practice, where \"accelerate\" refers either to $O(1/k^2)$ convergence in theory, in practice, or both. We introduce and study two algorithms: Accelerated Semi-Greedy Coordinate Descent (ASCD) and Accelerated Greedy Coordinate Descent (AGCD). While ASCD takes greedy steps in the $x$-updates and randomized steps in the $z$-updates, AGCD is a straightforward extension of standard greedy coordinate descent that only takes greedy steps. On the theory side, our main results are for ASCD: we show that ASCD achieves $O(1/k^2)$ conve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02476","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-18T00:13:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3gusnOJiiAwLbS9/vp7YKxMonOVJClTTZS8kIrdPQRP6KPyaH76pypVzDtfKw8ZPkeWvapgQM1TQu7XS1rzqDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T12:05:40.718176Z"},"content_sha256":"98be0b467ccb0bdaadbfbbe5aa64d0e8381cfde63918146c4a235fc420fd3ff7","schema_version":"1.0","event_id":"sha256:98be0b467ccb0bdaadbfbbe5aa64d0e8381cfde63918146c4a235fc420fd3ff7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FRHIZHWWTL2AYDPECVY4QY2BL3/bundle.json","state_url":"https://pith.science/pith/FRHIZHWWTL2AYDPECVY4QY2BL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FRHIZHWWTL2AYDPECVY4QY2BL3/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-20T12:05:40Z","links":{"resolver":"https://pith.science/pith/FRHIZHWWTL2AYDPECVY4QY2BL3","bundle":"https://pith.science/pith/FRHIZHWWTL2AYDPECVY4QY2BL3/bundle.json","state":"https://pith.science/pith/FRHIZHWWTL2AYDPECVY4QY2BL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FRHIZHWWTL2AYDPECVY4QY2BL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FRHIZHWWTL2AYDPECVY4QY2BL3","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":"57038ad25e8ba6d73cd5e0b7544ab4c0c38e0171080c5482b58eccf1f9a9d449","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-07T00:56:17Z","title_canon_sha256":"c561343341cf50ceec1eb447ad63aa5b7f16076c3c718031c4a9686b8bf7a9f0"},"schema_version":"1.0","source":{"id":"1806.02476","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02476","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02476v1","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02476","created_at":"2026-05-18T00:13:56Z"},{"alias_kind":"pith_short_12","alias_value":"FRHIZHWWTL2A","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FRHIZHWWTL2AYDPE","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FRHIZHWW","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:98be0b467ccb0bdaadbfbbe5aa64d0e8381cfde63918146c4a235fc420fd3ff7","target":"graph","created_at":"2026-05-18T00:13:56Z","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":"We study ways to accelerate greedy coordinate descent in theory and in practice, where \"accelerate\" refers either to $O(1/k^2)$ convergence in theory, in practice, or both. We introduce and study two algorithms: Accelerated Semi-Greedy Coordinate Descent (ASCD) and Accelerated Greedy Coordinate Descent (AGCD). While ASCD takes greedy steps in the $x$-updates and randomized steps in the $z$-updates, AGCD is a straightforward extension of standard greedy coordinate descent that only takes greedy steps. On the theory side, our main results are for ASCD: we show that ASCD achieves $O(1/k^2)$ conve","authors_text":"Haihao Lu, Robert M. Freund, Vahab Mirrokni","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-07T00:56:17Z","title":"Accelerating Greedy Coordinate Descent Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02476","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:17766805438834b585f537b5f4492c62de8588034095ae10d2923f48905795fa","target":"record","created_at":"2026-05-18T00:13:56Z","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":"57038ad25e8ba6d73cd5e0b7544ab4c0c38e0171080c5482b58eccf1f9a9d449","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-06-07T00:56:17Z","title_canon_sha256":"c561343341cf50ceec1eb447ad63aa5b7f16076c3c718031c4a9686b8bf7a9f0"},"schema_version":"1.0","source":{"id":"1806.02476","kind":"arxiv","version":1}},"canonical_sha256":"2c4e8c9ed69af40c0de41571c863415ee976c35590369eae06a4a8152415b705","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c4e8c9ed69af40c0de41571c863415ee976c35590369eae06a4a8152415b705","first_computed_at":"2026-05-18T00:13:56.717694Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:56.717694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yu1ssdUaVA5IwA/jI4EmIsVn6TMU6lR27JkRBRLFw8pkfDVibVL2q2ofpS4pR4dOzaIZ3I9Rv9U3C6WLuemmBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:56.718399Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02476","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17766805438834b585f537b5f4492c62de8588034095ae10d2923f48905795fa","sha256:98be0b467ccb0bdaadbfbbe5aa64d0e8381cfde63918146c4a235fc420fd3ff7"],"state_sha256":"941a5c2132965ca62acb7610058fd2b3fb4177b6e3b6831a2922b7ffcc561530"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kzbQN9NQzvnY0pNokIobQ92+TyVqrpci9IucqCYBBdv7HkwaOpZ8Z2zmRKKOQtWI28ns3nPbJaKEV4i2kBt5DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T12:05:40.720305Z","bundle_sha256":"ded65fc53408646a66157533c59c510003e822825b107ff98ed527f488b2fcf6"}}