{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:LEHAOCAPFFJID5YSHWWD2AHDIW","short_pith_number":"pith:LEHAOCAP","canonical_record":{"source":{"id":"1503.03712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-12T13:39:28Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"aeaa7d142e6cf04a71b1dd27152d86bbc74d133e69f8d4cc9ad8d24d8230b0e1","abstract_canon_sha256":"dad28531d51a17a7f42ba9782af2144d86c18032f22f4bb72412eec8cd91e247"},"schema_version":"1.0"},"canonical_sha256":"590e07080f295281f7123dac3d00e34594cd6fa6e6917e6b29926335e67aa546","source":{"kind":"arxiv","id":"1503.03712","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03712","created_at":"2026-05-18T01:36:18Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03712v2","created_at":"2026-05-18T01:36:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03712","created_at":"2026-05-18T01:36:18Z"},{"alias_kind":"pith_short_12","alias_value":"LEHAOCAPFFJI","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LEHAOCAPFFJID5YS","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LEHAOCAP","created_at":"2026-05-18T12:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:LEHAOCAPFFJID5YSHWWD2AHDIW","target":"record","payload":{"canonical_record":{"source":{"id":"1503.03712","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-12T13:39:28Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"aeaa7d142e6cf04a71b1dd27152d86bbc74d133e69f8d4cc9ad8d24d8230b0e1","abstract_canon_sha256":"dad28531d51a17a7f42ba9782af2144d86c18032f22f4bb72412eec8cd91e247"},"schema_version":"1.0"},"canonical_sha256":"590e07080f295281f7123dac3d00e34594cd6fa6e6917e6b29926335e67aa546","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:18.234873Z","signature_b64":"gfB+wTIwmOUv8FNWNMQ2W5bUWesDK2aFACjetPGK47Re/UuXpgR+hC/1jqeAt9P0sd4PsIFVLIay8hw0aTe6CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"590e07080f295281f7123dac3d00e34594cd6fa6e6917e6b29926335e67aa546","last_reissued_at":"2026-05-18T01:36:18.234178Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:18.234178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.03712","source_version":2,"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:36:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1JqnV7uEJjh6ON48q1hfoujOFtDR0rdktCe7kjd+0VEvcC/WQyZZaM/ZMOxZJGbt7/jpffpUho33BLxSW9M7BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T23:46:20.238446Z"},"content_sha256":"0651ae2bfefef6297a93024f16e6bd02f4bebbdbf1c20d4e4c5948c7235394b2","schema_version":"1.0","event_id":"sha256:0651ae2bfefef6297a93024f16e6bd02f4bebbdbf1c20d4e4c5948c7235394b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:LEHAOCAPFFJID5YSHWWD2AHDIW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Graduated Optimization for Stochastic Non-Convex Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Elad Hazan, Kfir Y. Levy, Shai Shalev-Shwartz","submitted_at":"2015-03-12T13:39:28Z","abstract_excerpt":"The graduated optimization approach, also known as the continuation method, is a popular heuristic to solving non-convex problems that has received renewed interest over the last decade. Despite its popularity, very little is known in terms of theoretical convergence analysis. In this paper we describe a new first-order algorithm based on graduated optimiza- tion and analyze its performance. We characterize a parameterized family of non- convex functions for which this algorithm provably converges to a global optimum. In particular, we prove that the algorithm converges to an {\\epsilon}-approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03712","kind":"arxiv","version":2},"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:36:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UaBrn/2CqYyFFqkowkxzj9WVNUBHmE5FwYWR6sPk8CK4w23gQYuGrAf/FjZ+beQWVtDMU+cjg4DGi3cK973LBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T23:46:20.239038Z"},"content_sha256":"0f54ed3fe013899b36132be6f542ac877b475a3dbded9e7dfa26aee0814e3f3a","schema_version":"1.0","event_id":"sha256:0f54ed3fe013899b36132be6f542ac877b475a3dbded9e7dfa26aee0814e3f3a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LEHAOCAPFFJID5YSHWWD2AHDIW/bundle.json","state_url":"https://pith.science/pith/LEHAOCAPFFJID5YSHWWD2AHDIW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LEHAOCAPFFJID5YSHWWD2AHDIW/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-08-07T23:46:20Z","links":{"resolver":"https://pith.science/pith/LEHAOCAPFFJID5YSHWWD2AHDIW","bundle":"https://pith.science/pith/LEHAOCAPFFJID5YSHWWD2AHDIW/bundle.json","state":"https://pith.science/pith/LEHAOCAPFFJID5YSHWWD2AHDIW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LEHAOCAPFFJID5YSHWWD2AHDIW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:LEHAOCAPFFJID5YSHWWD2AHDIW","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":"dad28531d51a17a7f42ba9782af2144d86c18032f22f4bb72412eec8cd91e247","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-12T13:39:28Z","title_canon_sha256":"aeaa7d142e6cf04a71b1dd27152d86bbc74d133e69f8d4cc9ad8d24d8230b0e1"},"schema_version":"1.0","source":{"id":"1503.03712","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.03712","created_at":"2026-05-18T01:36:18Z"},{"alias_kind":"arxiv_version","alias_value":"1503.03712v2","created_at":"2026-05-18T01:36:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.03712","created_at":"2026-05-18T01:36:18Z"},{"alias_kind":"pith_short_12","alias_value":"LEHAOCAPFFJI","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"LEHAOCAPFFJID5YS","created_at":"2026-05-18T12:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"LEHAOCAP","created_at":"2026-05-18T12:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:0f54ed3fe013899b36132be6f542ac877b475a3dbded9e7dfa26aee0814e3f3a","target":"graph","created_at":"2026-05-18T01:36: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":"The graduated optimization approach, also known as the continuation method, is a popular heuristic to solving non-convex problems that has received renewed interest over the last decade. Despite its popularity, very little is known in terms of theoretical convergence analysis. In this paper we describe a new first-order algorithm based on graduated optimiza- tion and analyze its performance. We characterize a parameterized family of non- convex functions for which this algorithm provably converges to a global optimum. In particular, we prove that the algorithm converges to an {\\epsilon}-approx","authors_text":"Elad Hazan, Kfir Y. Levy, Shai Shalev-Shwartz","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-12T13:39:28Z","title":"On Graduated Optimization for Stochastic Non-Convex Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.03712","kind":"arxiv","version":2},"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:0651ae2bfefef6297a93024f16e6bd02f4bebbdbf1c20d4e4c5948c7235394b2","target":"record","created_at":"2026-05-18T01:36: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":"dad28531d51a17a7f42ba9782af2144d86c18032f22f4bb72412eec8cd91e247","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-03-12T13:39:28Z","title_canon_sha256":"aeaa7d142e6cf04a71b1dd27152d86bbc74d133e69f8d4cc9ad8d24d8230b0e1"},"schema_version":"1.0","source":{"id":"1503.03712","kind":"arxiv","version":2}},"canonical_sha256":"590e07080f295281f7123dac3d00e34594cd6fa6e6917e6b29926335e67aa546","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"590e07080f295281f7123dac3d00e34594cd6fa6e6917e6b29926335e67aa546","first_computed_at":"2026-05-18T01:36:18.234178Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:18.234178Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gfB+wTIwmOUv8FNWNMQ2W5bUWesDK2aFACjetPGK47Re/UuXpgR+hC/1jqeAt9P0sd4PsIFVLIay8hw0aTe6CA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:18.234873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.03712","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0651ae2bfefef6297a93024f16e6bd02f4bebbdbf1c20d4e4c5948c7235394b2","sha256:0f54ed3fe013899b36132be6f542ac877b475a3dbded9e7dfa26aee0814e3f3a"],"state_sha256":"5b7e1757ab14004c72affbb3dcc5ad48fac0257bf09bb37ed7bbd03fdf52122c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oP4djt9oP5UzRfgOOQx7IRE6QIkkH9DSWKbNSmGlBhn8r9iJUcUziZixlG9pOkwEmNi8yrCw8o1r6KxXqoqUCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T23:46:20.243147Z","bundle_sha256":"fb9f6052c0b2437ed5eba71f1929efe0487168def2fa2fa8cc00568f43a4d4fc"}}