{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:FUHV3WKEAUW7X3DGBDX4UEUR6Z","short_pith_number":"pith:FUHV3WKE","canonical_record":{"source":{"id":"1803.09539","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-26T12:15:21Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"8fcdd37ff6241275449d1b58038d116c955592e80e6e138591f4a1e7893826fa","abstract_canon_sha256":"edd5a0ad88fbee67a09bbb2dea0245231bbbe3e769402abfe406ccfb39d8b72c"},"schema_version":"1.0"},"canonical_sha256":"2d0f5dd944052dfbec6608efca1291f65918258016d21587ef98b1facd99eb66","source":{"kind":"arxiv","id":"1803.09539","version":7},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09539","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09539v7","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09539","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"pith_short_12","alias_value":"FUHV3WKEAUW7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FUHV3WKEAUW7X3DG","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FUHV3WKE","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:FUHV3WKEAUW7X3DGBDX4UEUR6Z","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09539","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-26T12:15:21Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"8fcdd37ff6241275449d1b58038d116c955592e80e6e138591f4a1e7893826fa","abstract_canon_sha256":"edd5a0ad88fbee67a09bbb2dea0245231bbbe3e769402abfe406ccfb39d8b72c"},"schema_version":"1.0"},"canonical_sha256":"2d0f5dd944052dfbec6608efca1291f65918258016d21587ef98b1facd99eb66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:38.287010Z","signature_b64":"c/XO6aL/KRS6Scbi5UdlydiO8nPLBKUmHNwbRFQZIs9v+EZ1vHLPb63vHRm5ndkpXmqGkG+zSig4Za7mWTjbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d0f5dd944052dfbec6608efca1291f65918258016d21587ef98b1facd99eb66","last_reissued_at":"2026-05-17T23:44:38.286597Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:38.286597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09539","source_version":7,"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-17T23: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":"muuoIiHmsacB7/rvRDiCSnOZW+AHD7Gm4SyVxAl0lu1QEi2LeS047szX/61RkbjQgE61ohqMGX93qjigwhuwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:57:17.675180Z"},"content_sha256":"3706edb698e8157fb9b6fa6fc0a140b40809a41bbde31227387d03cd26daa013","schema_version":"1.0","event_id":"sha256:3706edb698e8157fb9b6fa6fc0a140b40809a41bbde31227387d03cd26daa013"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:FUHV3WKEAUW7X3DGBDX4UEUR6Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Matching Pursuit and Coordinate Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"stat.ML","authors_text":"Anant Raj, Bernhard Sch\\\"olkopf, Francesco Locatello, Gunnar R\\\"atsch, Martin Jaggi, Sai Praneeth Karimireddy, Sebastian U. Stich","submitted_at":"2018-03-26T12:15:21Z","abstract_excerpt":"Two popular examples of first-order optimization methods over linear spaces are coordinate descent and matching pursuit algorithms, with their randomized variants. While the former targets the optimization by moving along coordinates, the latter considers a generalized notion of directions. Exploiting the connection between the two algorithms, we present a unified analysis of both, providing affine invariant sublinear $\\mathcal{O}(1/t)$ rates on smooth objectives and linear convergence on strongly convex objectives. As a byproduct of our affine invariant analysis of matching pursuit, our rates"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09539","kind":"arxiv","version":7},"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-17T23: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":"hABlNzxmo0GzMjE5NRicPjvNYbPr/eZpLWoICIPD6SrLZ4uH/R3MUYADWBaUOPY9Or9QYbA7IQbrJbEJK/vxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T13:57:17.675824Z"},"content_sha256":"b37a9310af39dba59d5ff642c6a10a637e4ebce1f7c43159c73bd25c4c4791b3","schema_version":"1.0","event_id":"sha256:b37a9310af39dba59d5ff642c6a10a637e4ebce1f7c43159c73bd25c4c4791b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FUHV3WKEAUW7X3DGBDX4UEUR6Z/bundle.json","state_url":"https://pith.science/pith/FUHV3WKEAUW7X3DGBDX4UEUR6Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FUHV3WKEAUW7X3DGBDX4UEUR6Z/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-04T13:57:17Z","links":{"resolver":"https://pith.science/pith/FUHV3WKEAUW7X3DGBDX4UEUR6Z","bundle":"https://pith.science/pith/FUHV3WKEAUW7X3DGBDX4UEUR6Z/bundle.json","state":"https://pith.science/pith/FUHV3WKEAUW7X3DGBDX4UEUR6Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FUHV3WKEAUW7X3DGBDX4UEUR6Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:FUHV3WKEAUW7X3DGBDX4UEUR6Z","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":"edd5a0ad88fbee67a09bbb2dea0245231bbbe3e769402abfe406ccfb39d8b72c","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-26T12:15:21Z","title_canon_sha256":"8fcdd37ff6241275449d1b58038d116c955592e80e6e138591f4a1e7893826fa"},"schema_version":"1.0","source":{"id":"1803.09539","kind":"arxiv","version":7}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09539","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09539v7","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09539","created_at":"2026-05-17T23:44:38Z"},{"alias_kind":"pith_short_12","alias_value":"FUHV3WKEAUW7","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"FUHV3WKEAUW7X3DG","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"FUHV3WKE","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:b37a9310af39dba59d5ff642c6a10a637e4ebce1f7c43159c73bd25c4c4791b3","target":"graph","created_at":"2026-05-17T23: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"},"paper":{"abstract_excerpt":"Two popular examples of first-order optimization methods over linear spaces are coordinate descent and matching pursuit algorithms, with their randomized variants. While the former targets the optimization by moving along coordinates, the latter considers a generalized notion of directions. Exploiting the connection between the two algorithms, we present a unified analysis of both, providing affine invariant sublinear $\\mathcal{O}(1/t)$ rates on smooth objectives and linear convergence on strongly convex objectives. As a byproduct of our affine invariant analysis of matching pursuit, our rates","authors_text":"Anant Raj, Bernhard Sch\\\"olkopf, Francesco Locatello, Gunnar R\\\"atsch, Martin Jaggi, Sai Praneeth Karimireddy, Sebastian U. Stich","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-26T12:15:21Z","title":"On Matching Pursuit and Coordinate Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09539","kind":"arxiv","version":7},"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:3706edb698e8157fb9b6fa6fc0a140b40809a41bbde31227387d03cd26daa013","target":"record","created_at":"2026-05-17T23: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":"edd5a0ad88fbee67a09bbb2dea0245231bbbe3e769402abfe406ccfb39d8b72c","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-03-26T12:15:21Z","title_canon_sha256":"8fcdd37ff6241275449d1b58038d116c955592e80e6e138591f4a1e7893826fa"},"schema_version":"1.0","source":{"id":"1803.09539","kind":"arxiv","version":7}},"canonical_sha256":"2d0f5dd944052dfbec6608efca1291f65918258016d21587ef98b1facd99eb66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d0f5dd944052dfbec6608efca1291f65918258016d21587ef98b1facd99eb66","first_computed_at":"2026-05-17T23:44:38.286597Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:38.286597Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c/XO6aL/KRS6Scbi5UdlydiO8nPLBKUmHNwbRFQZIs9v+EZ1vHLPb63vHRm5ndkpXmqGkG+zSig4Za7mWTjbCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:38.287010Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09539","source_kind":"arxiv","source_version":7}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3706edb698e8157fb9b6fa6fc0a140b40809a41bbde31227387d03cd26daa013","sha256:b37a9310af39dba59d5ff642c6a10a637e4ebce1f7c43159c73bd25c4c4791b3"],"state_sha256":"a1a49ea96638ee4b44beb043d5dbcf0c81ac012efdf0e97f36f9913bab6959fc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+I7SGUxFWIcKVtwKZJbt6uvRHiEtH0dQYtrZA9LgeQIoACvenJck81J4qE8vTUSZDB0amJvvmWq5MXIYEtN8Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T13:57:17.678833Z","bundle_sha256":"776056d5396f35eb3aed8ab8cea1da863ff3e2b937d94f69e6de5b414b9647bd"}}