{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7V2QSEA6NWZNQ66NGDAJ6CPUG2","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":"9eef44cee142a47d46acac032b8324cb1343589b8028631891d8ee879441bdea","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-20T15:54:22Z","title_canon_sha256":"5f91f2b07560e9d5a4416ffca4a7500f767570b95d5e47888a4efa2b1285ef5b"},"schema_version":"1.0","source":{"id":"1301.4666","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.4666","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"arxiv_version","alias_value":"1301.4666v6","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.4666","created_at":"2026-05-18T01:35:20Z"},{"alias_kind":"pith_short_12","alias_value":"7V2QSEA6NWZN","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"7V2QSEA6NWZNQ66N","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"7V2QSEA6","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:1d06619ec437cca2ebb3c78f4c3cd702846ce01d17563e497449d09640e3939b","target":"graph","created_at":"2026-05-18T01:35:20Z","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":"Linear optimization is many times algorithmically simpler than non-linear convex optimization. Linear optimization over matroid polytopes, matching polytopes and path polytopes are example of problems for which we have simple and efficient combinatorial algorithms, but whose non-linear convex counterpart is harder and admits significantly less efficient algorithms. This motivates the computational model of convex optimization, including the offline, online and stochastic settings, using a linear optimization oracle. In this computational model we give several new results that improve over the ","authors_text":"Dan Garber, Elad Hazan","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-20T15:54:22Z","title":"A Linearly Convergent Conditional Gradient Algorithm with Applications to Online and Stochastic Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4666","kind":"arxiv","version":6},"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:f991a63ae6b22c821bcdae7ab6f19140f6bb427c2a1c4f77288ee21a065119ee","target":"record","created_at":"2026-05-18T01:35:20Z","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":"9eef44cee142a47d46acac032b8324cb1343589b8028631891d8ee879441bdea","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-20T15:54:22Z","title_canon_sha256":"5f91f2b07560e9d5a4416ffca4a7500f767570b95d5e47888a4efa2b1285ef5b"},"schema_version":"1.0","source":{"id":"1301.4666","kind":"arxiv","version":6}},"canonical_sha256":"fd7509101e6db2d87bcd30c09f09f436b7f0594a2db26df5566598f6867bcc41","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fd7509101e6db2d87bcd30c09f09f436b7f0594a2db26df5566598f6867bcc41","first_computed_at":"2026-05-18T01:35:20.926381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:20.926381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zncPLVOLJmD3f/3w1Jd53TurhWykJthEVq/a6QVRjh4fujWjlTc3b/R/Q8s6KgQtKLMcXAixK5dFsWIXOhtQDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:20.927041Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.4666","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f991a63ae6b22c821bcdae7ab6f19140f6bb427c2a1c4f77288ee21a065119ee","sha256:1d06619ec437cca2ebb3c78f4c3cd702846ce01d17563e497449d09640e3939b"],"state_sha256":"81b3c843ba4b60250dd45166b52ac8ccce6aa15f7b9c718c1dbcfc52f1dfb92b"}