{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:S4BTFGTEOVBI3V5ZF23XPH6B3Y","short_pith_number":"pith:S4BTFGTE","canonical_record":{"source":{"id":"1705.09396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T23:24:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"23cb7d79b9f690bfa1eb1e4f0509acd186a782dd914d6f95fdc3d73a08487f12","abstract_canon_sha256":"4df19fe8a79902b5f70d01346c3baf114996cf43cbe1bcb8422962542990bf96"},"schema_version":"1.0"},"canonical_sha256":"9703329a6475428dd7b92eb7779fc1de132f6df87c70180f3e5537c585896d26","source":{"kind":"arxiv","id":"1705.09396","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09396","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09396v1","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09396","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"pith_short_12","alias_value":"S4BTFGTEOVBI","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S4BTFGTEOVBI3V5Z","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S4BTFGTE","created_at":"2026-05-18T12:31:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:S4BTFGTEOVBI3V5ZF23XPH6B3Y","target":"record","payload":{"canonical_record":{"source":{"id":"1705.09396","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T23:24:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"23cb7d79b9f690bfa1eb1e4f0509acd186a782dd914d6f95fdc3d73a08487f12","abstract_canon_sha256":"4df19fe8a79902b5f70d01346c3baf114996cf43cbe1bcb8422962542990bf96"},"schema_version":"1.0"},"canonical_sha256":"9703329a6475428dd7b92eb7779fc1de132f6df87c70180f3e5537c585896d26","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:35.537209Z","signature_b64":"SCK5bI/OXcNxDXAJt2rgFs+Gsd9pfkuSn3xAtCHKT8OczhYibN9bCY0OLtgYWx2OvSAOs1XWsCcEiVAeWWskCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9703329a6475428dd7b92eb7779fc1de132f6df87c70180f3e5537c585896d26","last_reissued_at":"2026-05-18T00:00:35.536587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:35.536587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.09396","source_version":1,"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-18T00:00:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yEefNGIC00inXS4QlHc+QAg8C4vK+e7kGobVlNDq3khn1dszyL2Qwvz4yQnyPkGTIdyIRVYn7RxQSRxdO+NoAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:16:12.686668Z"},"content_sha256":"f2f6f3ee889730c33539e04cc54fd9882d2a522bd2a2d732ecf28f7ac4d8e7e0","schema_version":"1.0","event_id":"sha256:f2f6f3ee889730c33539e04cc54fd9882d2a522bd2a2d732ecf28f7ac4d8e7e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:S4BTFGTEOVBI3V5ZF23XPH6B3Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximate and Stochastic Greedy Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"math.OC","authors_text":"Nan Ye, Peter Bartlett","submitted_at":"2017-05-25T23:24:21Z","abstract_excerpt":"We consider two greedy algorithms for minimizing a convex function in a bounded convex set: an algorithm by Jones [1992] and the Frank-Wolfe (FW) algorithm. We first consider approximate versions of these algorithms. For smooth convex functions, we give sufficient conditions for convergence, a unified analysis for the well-known convergence rate of O(1/k) together with a result showing that this rate is the best obtainable from the proof technique, and an equivalence result for the two algorithms. We also consider approximate stochastic greedy algorithms for minimizing expectations. We show th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09396","kind":"arxiv","version":1},"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-18T00:00:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9R9d72icQsMW2N6hI7LUVMOuxs1pNaqFvfF25sjlC4kUe/Vrn81MQHSZK0xxnQl6HY838kWGXFWkWjb6+rCbBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:16:12.687010Z"},"content_sha256":"6a4d9787582ec8c500b1c25fd538cc62a9ade513745b7ee17305f1afdfe24659","schema_version":"1.0","event_id":"sha256:6a4d9787582ec8c500b1c25fd538cc62a9ade513745b7ee17305f1afdfe24659"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S4BTFGTEOVBI3V5ZF23XPH6B3Y/bundle.json","state_url":"https://pith.science/pith/S4BTFGTEOVBI3V5ZF23XPH6B3Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S4BTFGTEOVBI3V5ZF23XPH6B3Y/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-01T15:16:12Z","links":{"resolver":"https://pith.science/pith/S4BTFGTEOVBI3V5ZF23XPH6B3Y","bundle":"https://pith.science/pith/S4BTFGTEOVBI3V5ZF23XPH6B3Y/bundle.json","state":"https://pith.science/pith/S4BTFGTEOVBI3V5ZF23XPH6B3Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S4BTFGTEOVBI3V5ZF23XPH6B3Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:S4BTFGTEOVBI3V5ZF23XPH6B3Y","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":"4df19fe8a79902b5f70d01346c3baf114996cf43cbe1bcb8422962542990bf96","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T23:24:21Z","title_canon_sha256":"23cb7d79b9f690bfa1eb1e4f0509acd186a782dd914d6f95fdc3d73a08487f12"},"schema_version":"1.0","source":{"id":"1705.09396","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.09396","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"arxiv_version","alias_value":"1705.09396v1","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09396","created_at":"2026-05-18T00:00:35Z"},{"alias_kind":"pith_short_12","alias_value":"S4BTFGTEOVBI","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_16","alias_value":"S4BTFGTEOVBI3V5Z","created_at":"2026-05-18T12:31:43Z"},{"alias_kind":"pith_short_8","alias_value":"S4BTFGTE","created_at":"2026-05-18T12:31:43Z"}],"graph_snapshots":[{"event_id":"sha256:6a4d9787582ec8c500b1c25fd538cc62a9ade513745b7ee17305f1afdfe24659","target":"graph","created_at":"2026-05-18T00:00:35Z","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":"We consider two greedy algorithms for minimizing a convex function in a bounded convex set: an algorithm by Jones [1992] and the Frank-Wolfe (FW) algorithm. We first consider approximate versions of these algorithms. For smooth convex functions, we give sufficient conditions for convergence, a unified analysis for the well-known convergence rate of O(1/k) together with a result showing that this rate is the best obtainable from the proof technique, and an equivalence result for the two algorithms. We also consider approximate stochastic greedy algorithms for minimizing expectations. We show th","authors_text":"Nan Ye, Peter Bartlett","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T23:24:21Z","title":"Approximate and Stochastic Greedy Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09396","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:f2f6f3ee889730c33539e04cc54fd9882d2a522bd2a2d732ecf28f7ac4d8e7e0","target":"record","created_at":"2026-05-18T00:00:35Z","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":"4df19fe8a79902b5f70d01346c3baf114996cf43cbe1bcb8422962542990bf96","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-05-25T23:24:21Z","title_canon_sha256":"23cb7d79b9f690bfa1eb1e4f0509acd186a782dd914d6f95fdc3d73a08487f12"},"schema_version":"1.0","source":{"id":"1705.09396","kind":"arxiv","version":1}},"canonical_sha256":"9703329a6475428dd7b92eb7779fc1de132f6df87c70180f3e5537c585896d26","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9703329a6475428dd7b92eb7779fc1de132f6df87c70180f3e5537c585896d26","first_computed_at":"2026-05-18T00:00:35.536587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:35.536587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SCK5bI/OXcNxDXAJt2rgFs+Gsd9pfkuSn3xAtCHKT8OczhYibN9bCY0OLtgYWx2OvSAOs1XWsCcEiVAeWWskCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:35.537209Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.09396","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2f6f3ee889730c33539e04cc54fd9882d2a522bd2a2d732ecf28f7ac4d8e7e0","sha256:6a4d9787582ec8c500b1c25fd538cc62a9ade513745b7ee17305f1afdfe24659"],"state_sha256":"e57e5d4a82ec08715d990c56061a764c1a422a90a9c216f7ec127408d53bc817"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6+XhvEyJmcABzJlrLWEL52ZnNduteXyLmQxFW/YkhpsT/3TUuP2f/jh7GUB5yJQwSjm0UMe0ccxazKadi+14Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:16:12.689219Z","bundle_sha256":"039559831fd2afa9273d7c985eb752a7c6d6cbc31368ac367adf6d96857d0ec0"}}