{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:7V2QSEA6NWZNQ66NGDAJ6CPUG2","short_pith_number":"pith:7V2QSEA6","canonical_record":{"source":{"id":"1301.4666","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-20T15:54:22Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"5f91f2b07560e9d5a4416ffca4a7500f767570b95d5e47888a4efa2b1285ef5b","abstract_canon_sha256":"9eef44cee142a47d46acac032b8324cb1343589b8028631891d8ee879441bdea"},"schema_version":"1.0"},"canonical_sha256":"fd7509101e6db2d87bcd30c09f09f436b7f0594a2db26df5566598f6867bcc41","source":{"kind":"arxiv","id":"1301.4666","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:7V2QSEA6NWZNQ66NGDAJ6CPUG2","target":"record","payload":{"canonical_record":{"source":{"id":"1301.4666","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-20T15:54:22Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"5f91f2b07560e9d5a4416ffca4a7500f767570b95d5e47888a4efa2b1285ef5b","abstract_canon_sha256":"9eef44cee142a47d46acac032b8324cb1343589b8028631891d8ee879441bdea"},"schema_version":"1.0"},"canonical_sha256":"fd7509101e6db2d87bcd30c09f09f436b7f0594a2db26df5566598f6867bcc41","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:20.927041Z","signature_b64":"zncPLVOLJmD3f/3w1Jd53TurhWykJthEVq/a6QVRjh4fujWjlTc3b/R/Q8s6KgQtKLMcXAixK5dFsWIXOhtQDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fd7509101e6db2d87bcd30c09f09f436b7f0594a2db26df5566598f6867bcc41","last_reissued_at":"2026-05-18T01:35:20.926381Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:20.926381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.4666","source_version":6,"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-18T01:35:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L+ff7Fxrsn/xM0pa/tQUzSN3h81dTtREuzE/j1WHyU6M9iP6nnhatvGg+UnHvJNw7bdsac0g/wQfAvEGJU1PBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:15:57.102284Z"},"content_sha256":"f991a63ae6b22c821bcdae7ab6f19140f6bb427c2a1c4f77288ee21a065119ee","schema_version":"1.0","event_id":"sha256:f991a63ae6b22c821bcdae7ab6f19140f6bb427c2a1c4f77288ee21a065119ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:7V2QSEA6NWZNQ66NGDAJ6CPUG2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Linearly Convergent Conditional Gradient Algorithm with Applications to Online and Stochastic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dan Garber, Elad Hazan","submitted_at":"2013-01-20T15:54:22Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.4666","kind":"arxiv","version":6},"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-18T01:35:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WGvylUtf4HX607P8yCruXo1uFn5g3mdXDbxCLcex/V98iVZVcmEJu7rwytrgs35ChxPoeT+qUpLYhjzA0/s2CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T17:15:57.102640Z"},"content_sha256":"1d06619ec437cca2ebb3c78f4c3cd702846ce01d17563e497449d09640e3939b","schema_version":"1.0","event_id":"sha256:1d06619ec437cca2ebb3c78f4c3cd702846ce01d17563e497449d09640e3939b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7V2QSEA6NWZNQ66NGDAJ6CPUG2/bundle.json","state_url":"https://pith.science/pith/7V2QSEA6NWZNQ66NGDAJ6CPUG2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7V2QSEA6NWZNQ66NGDAJ6CPUG2/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-24T17:15:57Z","links":{"resolver":"https://pith.science/pith/7V2QSEA6NWZNQ66NGDAJ6CPUG2","bundle":"https://pith.science/pith/7V2QSEA6NWZNQ66NGDAJ6CPUG2/bundle.json","state":"https://pith.science/pith/7V2QSEA6NWZNQ66NGDAJ6CPUG2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7V2QSEA6NWZNQ66NGDAJ6CPUG2/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJaR3NFlgbRln7zJ4MY5ryRb91dS6TUm+hFLQJajg0M8KgoJOVSWMoKJAi3EGWoydUx6DpGlKpFKdtoyCVDFBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T17:15:57.104991Z","bundle_sha256":"ef162d3070fc92f5e4f76dc2ea953ea5a5e7742611b8ea3f960856e5aa5d513e"}}