{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:RQPCDGL376TVAQFSVXKLJDO5D5","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":"85360725b5b0fd0c6ffbfb55ac4089bace988b183d5689febcc4837d25d6e1f9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-20T19:55:48Z","title_canon_sha256":"ec3ae5479695c2aed9650b395b42efb981f9c5498a68b84f021d6d48598ec3ba"},"schema_version":"1.0","source":{"id":"1605.06492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.06492","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"arxiv_version","alias_value":"1605.06492v1","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.06492","created_at":"2026-05-18T01:14:18Z"},{"alias_kind":"pith_short_12","alias_value":"RQPCDGL376TV","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"RQPCDGL376TVAQFS","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"RQPCDGL3","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:c4667d426742e1af685ba9161208ec415d77d6db800dda150c02ce311a8ea403","target":"graph","created_at":"2026-05-18T01:14:18Z","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":"Recently, several works have shown that natural modifications of the classical conditional gradient method (aka Frank-Wolfe algorithm) for constrained convex optimization, provably converge with a linear rate when: i) the feasible set is a polytope, and ii) the objective is smooth and strongly-convex. However, all of these results suffer from two significant shortcomings: large memory requirement due to the need to store an explicit convex decomposition of the current iterate, and as a consequence, large running-time overhead per iteration, and worst case convergence rate that depends unfavora","authors_text":"Dan Garber, Ofer Meshi","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-20T19:55:48Z","title":"Linear-memory and Decomposition-invariant Linearly Convergent Conditional Gradient Algorithm for Structured Polytopes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.06492","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:3942b907ad57f73b915ad825966abfaa20d804900913f19b4dc06f1f70988259","target":"record","created_at":"2026-05-18T01:14:18Z","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":"85360725b5b0fd0c6ffbfb55ac4089bace988b183d5689febcc4837d25d6e1f9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-05-20T19:55:48Z","title_canon_sha256":"ec3ae5479695c2aed9650b395b42efb981f9c5498a68b84f021d6d48598ec3ba"},"schema_version":"1.0","source":{"id":"1605.06492","kind":"arxiv","version":1}},"canonical_sha256":"8c1e21997bffa75040b2add4b48ddd1f653747a9556635ffc5b593fd1b2fedcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c1e21997bffa75040b2add4b48ddd1f653747a9556635ffc5b593fd1b2fedcb","first_computed_at":"2026-05-18T01:14:18.759664Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:14:18.759664Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EiGa5yWlv4Y0XQOVIZdgK+1kqhRC/QAA8aZh18O9+jcJ1+aNUQIcA9luJWnPPTDqwYsSbtcXr8YvHsnn9THuBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:14:18.760291Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.06492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3942b907ad57f73b915ad825966abfaa20d804900913f19b4dc06f1f70988259","sha256:c4667d426742e1af685ba9161208ec415d77d6db800dda150c02ce311a8ea403"],"state_sha256":"e917571645dea16e4da99deb7e21454cd990ba93bfba234cc4106e794c851681"}