{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:2MZBQLTH6XZ65XLCVU4XXM4KLB","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":"6e6e2d06f8e92d69c03b71966aea1e493801bff764fc9b6b78f7cc72d0a4e518","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T14:48:23Z","title_canon_sha256":"a846840c9e755d1a4d846d0b9d2bc27cf7c8ac2e2d5b3f7b699ed49200cad649"},"schema_version":"1.0","source":{"id":"1802.05581","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05581","created_at":"2026-07-05T00:19:34Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05581v3","created_at":"2026-07-05T00:19:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05581","created_at":"2026-07-05T00:19:34Z"},{"alias_kind":"pith_short_12","alias_value":"2MZBQLTH6XZ6","created_at":"2026-07-05T00:19:34Z"},{"alias_kind":"pith_short_16","alias_value":"2MZBQLTH6XZ65XLC","created_at":"2026-07-05T00:19:34Z"},{"alias_kind":"pith_short_8","alias_value":"2MZBQLTH","created_at":"2026-07-05T00:19:34Z"}],"graph_snapshots":[{"event_id":"sha256:2fb0e39cff647fbba8507b3085cf26adae86390c1d912c8cbda65f909f88f38f","target":"graph","created_at":"2026-07-05T00:19:34Z","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/1802.05581/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Motivated by robust matrix recovery problems such as Robust Principal Component Analysis, we consider a general optimization problem of minimizing a smooth and strongly convex loss function applied to the sum of two blocks of variables, where each block of variables is constrained or regularized individually. We study a Conditional Gradient-Type method which is able to leverage the special structure of the problem to obtain faster convergence rates than those attainable via standard methods, under a variety of assumptions. In particular, our method is appealing for matrix problems in which one","authors_text":"Atara Kaplan, Dan Garber, Shoham Sabach","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T14:48:23Z","title":"Improved Complexities of Conditional Gradient-Type Methods with Applications to Robust Matrix Recovery Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05581","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:752d7bab485522e171d313d0cf91b7ae49cc6d43aa4d570b7ee9d703ad6955af","target":"record","created_at":"2026-07-05T00:19:34Z","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":"6e6e2d06f8e92d69c03b71966aea1e493801bff764fc9b6b78f7cc72d0a4e518","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-15T14:48:23Z","title_canon_sha256":"a846840c9e755d1a4d846d0b9d2bc27cf7c8ac2e2d5b3f7b699ed49200cad649"},"schema_version":"1.0","source":{"id":"1802.05581","kind":"arxiv","version":3}},"canonical_sha256":"d332182e67f5f3eedd62ad397bb38a5861510bb42b1398431c95e42498a289d7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d332182e67f5f3eedd62ad397bb38a5861510bb42b1398431c95e42498a289d7","first_computed_at":"2026-07-05T00:19:34.005243Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:19:34.005243Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Punufnm9g7afjygWUMRmM7a+sO0we+7SuSYtjXlddycbp0VOqb0yFxw/N1/ssDAqqNzlkXOxHEaSTvV7KBJPDg==","signature_status":"signed_v1","signed_at":"2026-07-05T00:19:34.005665Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05581","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:752d7bab485522e171d313d0cf91b7ae49cc6d43aa4d570b7ee9d703ad6955af","sha256:2fb0e39cff647fbba8507b3085cf26adae86390c1d912c8cbda65f909f88f38f"],"state_sha256":"5d57b6093e598de2704c49848f4c133abfde274e5667de16f75698382e46315d"}