{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:65BNWMA6BQQSH4EIKKPMUZ4T6S","short_pith_number":"pith:65BNWMA6","canonical_record":{"source":{"id":"1810.06999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-16T13:54:59Z","cross_cats_sorted":["cs.LG","stat.CO","stat.ML"],"title_canon_sha256":"55ca3a7ebae2195dbdc8da5b6aa917be1f8f620e7ef3548caded66c62e597a91","abstract_canon_sha256":"f72ef35dc1987a08d70423dcb129bdf9f4c90dc427c5e80da92658d018ae260f"},"schema_version":"1.0"},"canonical_sha256":"f742db301e0c2123f088529eca6793f484ea2f036f8002d6ea7cf0b95a90c32f","source":{"kind":"arxiv","id":"1810.06999","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06999","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06999v1","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06999","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"pith_short_12","alias_value":"65BNWMA6BQQS","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"65BNWMA6BQQSH4EI","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"65BNWMA6","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:65BNWMA6BQQSH4EIKKPMUZ4T6S","target":"record","payload":{"canonical_record":{"source":{"id":"1810.06999","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-16T13:54:59Z","cross_cats_sorted":["cs.LG","stat.CO","stat.ML"],"title_canon_sha256":"55ca3a7ebae2195dbdc8da5b6aa917be1f8f620e7ef3548caded66c62e597a91","abstract_canon_sha256":"f72ef35dc1987a08d70423dcb129bdf9f4c90dc427c5e80da92658d018ae260f"},"schema_version":"1.0"},"canonical_sha256":"f742db301e0c2123f088529eca6793f484ea2f036f8002d6ea7cf0b95a90c32f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:10.804599Z","signature_b64":"GM65yRw00n2yihfhznucZf6OpRytGy01NNog+VMthw18zl86sgcOuu/cuD19vPEHOdX5c1sLYAVNpljTGEawCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f742db301e0c2123f088529eca6793f484ea2f036f8002d6ea7cf0b95a90c32f","last_reissued_at":"2026-05-18T00:03:10.804086Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:10.804086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.06999","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:03:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xUBSVAgSbC3XC861ADy4Mo/AvnwbU+qBeJn1Q8yI4cEB1JvRS4/rTxs8IdWxIiDqeST8kI+2ijCkPQgPdVOhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:59:59.198484Z"},"content_sha256":"af01fdde57a7e39f7c30520bad7daf9be2162620e1cba5d29c28d82006ab6a29","schema_version":"1.0","event_id":"sha256:af01fdde57a7e39f7c30520bad7daf9be2162620e1cba5d29c28d82006ab6a29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:65BNWMA6BQQSH4EIKKPMUZ4T6S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Greedy Coordinate Descent for Composite Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO","stat.ML"],"primary_cat":"math.OC","authors_text":"Anastasia Koloskova, Martin Jaggi, Sai Praneeth Karimireddy, Sebastian U. Stich","submitted_at":"2018-10-16T13:54:59Z","abstract_excerpt":"Coordinate descent with random coordinate selection is the current state of the art for many large scale optimization problems. However, greedy selection of the steepest coordinate on smooth problems can yield convergence rates independent of the dimension $n$, and requiring upto $n$ times fewer iterations.\n  In this paper, we consider greedy updates that are based on subgradients for a class of non-smooth composite problems, which includes $L1$-regularized problems, SVMs and related applications. For these problems we provide (i) the first linear rates of convergence independent of $n$, and s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06999","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:03:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A5HOigARd7/4wzqa6CFpj3RqHBc6jU8q6Bgoq5XtlbMiPuQUAjYFUzAGXr+cf4UYigIn8DWpISzuo69E9WG0AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:59:59.199113Z"},"content_sha256":"0d475dae1c8ca291d9f6d7a60b467a439b6ea1f506894ec333019421196dc9e4","schema_version":"1.0","event_id":"sha256:0d475dae1c8ca291d9f6d7a60b467a439b6ea1f506894ec333019421196dc9e4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65BNWMA6BQQSH4EIKKPMUZ4T6S/bundle.json","state_url":"https://pith.science/pith/65BNWMA6BQQSH4EIKKPMUZ4T6S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65BNWMA6BQQSH4EIKKPMUZ4T6S/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-31T01:59:59Z","links":{"resolver":"https://pith.science/pith/65BNWMA6BQQSH4EIKKPMUZ4T6S","bundle":"https://pith.science/pith/65BNWMA6BQQSH4EIKKPMUZ4T6S/bundle.json","state":"https://pith.science/pith/65BNWMA6BQQSH4EIKKPMUZ4T6S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65BNWMA6BQQSH4EIKKPMUZ4T6S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:65BNWMA6BQQSH4EIKKPMUZ4T6S","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":"f72ef35dc1987a08d70423dcb129bdf9f4c90dc427c5e80da92658d018ae260f","cross_cats_sorted":["cs.LG","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-16T13:54:59Z","title_canon_sha256":"55ca3a7ebae2195dbdc8da5b6aa917be1f8f620e7ef3548caded66c62e597a91"},"schema_version":"1.0","source":{"id":"1810.06999","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.06999","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"arxiv_version","alias_value":"1810.06999v1","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.06999","created_at":"2026-05-18T00:03:10Z"},{"alias_kind":"pith_short_12","alias_value":"65BNWMA6BQQS","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"65BNWMA6BQQSH4EI","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"65BNWMA6","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:0d475dae1c8ca291d9f6d7a60b467a439b6ea1f506894ec333019421196dc9e4","target":"graph","created_at":"2026-05-18T00:03:10Z","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":"Coordinate descent with random coordinate selection is the current state of the art for many large scale optimization problems. However, greedy selection of the steepest coordinate on smooth problems can yield convergence rates independent of the dimension $n$, and requiring upto $n$ times fewer iterations.\n  In this paper, we consider greedy updates that are based on subgradients for a class of non-smooth composite problems, which includes $L1$-regularized problems, SVMs and related applications. For these problems we provide (i) the first linear rates of convergence independent of $n$, and s","authors_text":"Anastasia Koloskova, Martin Jaggi, Sai Praneeth Karimireddy, Sebastian U. Stich","cross_cats":["cs.LG","stat.CO","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-16T13:54:59Z","title":"Efficient Greedy Coordinate Descent for Composite Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.06999","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:af01fdde57a7e39f7c30520bad7daf9be2162620e1cba5d29c28d82006ab6a29","target":"record","created_at":"2026-05-18T00:03:10Z","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":"f72ef35dc1987a08d70423dcb129bdf9f4c90dc427c5e80da92658d018ae260f","cross_cats_sorted":["cs.LG","stat.CO","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-16T13:54:59Z","title_canon_sha256":"55ca3a7ebae2195dbdc8da5b6aa917be1f8f620e7ef3548caded66c62e597a91"},"schema_version":"1.0","source":{"id":"1810.06999","kind":"arxiv","version":1}},"canonical_sha256":"f742db301e0c2123f088529eca6793f484ea2f036f8002d6ea7cf0b95a90c32f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f742db301e0c2123f088529eca6793f484ea2f036f8002d6ea7cf0b95a90c32f","first_computed_at":"2026-05-18T00:03:10.804086Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:10.804086Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GM65yRw00n2yihfhznucZf6OpRytGy01NNog+VMthw18zl86sgcOuu/cuD19vPEHOdX5c1sLYAVNpljTGEawCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:10.804599Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.06999","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af01fdde57a7e39f7c30520bad7daf9be2162620e1cba5d29c28d82006ab6a29","sha256:0d475dae1c8ca291d9f6d7a60b467a439b6ea1f506894ec333019421196dc9e4"],"state_sha256":"119246bdcf0fc366d13f2b1dd320a1d98249d5d4824a3f1b9844a7de8baa78cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0hA+xbvEOS8dQDgK/UJKUg0Lg1EtAm3MZLTCHz4e+e3c9aol+NqawFzieX1A3CGHH8aTbr2bh3mE8l4xTS4hAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:59:59.202636Z","bundle_sha256":"034aedd0f51ebeab69bec6092394bc8b6da9d082eb293a7d4e4b9af24384a7ab"}}