{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:APCY5ZPESIXO6E4MQDTOXAWAN3","short_pith_number":"pith:APCY5ZPE","canonical_record":{"source":{"id":"1711.02838","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T05:39:46Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"146dba2fa8de8eac67b02bc486c54de5ca47725f14bf90f411032695114ebd3f","abstract_canon_sha256":"2ab3d0896bb8d573d1245438edb6677628a3a37217d7d32a47b466bfece5994a"},"schema_version":"1.0"},"canonical_sha256":"03c58ee5e4922eef138c80e6eb82c06ec6144ebd78f0aaa5c3fe73aadf582a25","source":{"kind":"arxiv","id":"1711.02838","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02838","created_at":"2026-05-18T00:28:40Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02838v2","created_at":"2026-05-18T00:28:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02838","created_at":"2026-05-18T00:28:40Z"},{"alias_kind":"pith_short_12","alias_value":"APCY5ZPESIXO","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"APCY5ZPESIXO6E4M","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"APCY5ZPE","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:APCY5ZPESIXO6E4MQDTOXAWAN3","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02838","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T05:39:46Z","cross_cats_sorted":["math.OC","stat.ML"],"title_canon_sha256":"146dba2fa8de8eac67b02bc486c54de5ca47725f14bf90f411032695114ebd3f","abstract_canon_sha256":"2ab3d0896bb8d573d1245438edb6677628a3a37217d7d32a47b466bfece5994a"},"schema_version":"1.0"},"canonical_sha256":"03c58ee5e4922eef138c80e6eb82c06ec6144ebd78f0aaa5c3fe73aadf582a25","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:40.182915Z","signature_b64":"76TnU50nbwOPbhv4fpIKyg04C8nSS6vVdZqxiiEVkLL9HtQlJcDpsTJTtmGSpg6fwVmvgyyvcpWLHJvwX4ooCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03c58ee5e4922eef138c80e6eb82c06ec6144ebd78f0aaa5c3fe73aadf582a25","last_reissued_at":"2026-05-18T00:28:40.182262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:40.182262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02838","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-18T00:28:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V7osEVNcKXioPQWk8+iU8pgtOAlHrQ6P26Gg18sJgaeTsMGZWFxZ8Yzxrcb2/gEFZ/SQSMaQTdmFoVTQfk8bAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:29:56.739956Z"},"content_sha256":"350b0afdc8b39b3951d22fa1f715d7432dc937e6dc1995a8c18cb5d4927f9e8d","schema_version":"1.0","event_id":"sha256:350b0afdc8b39b3951d22fa1f715d7432dc937e6dc1995a8c18cb5d4927f9e8d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:APCY5ZPESIXO6E4MQDTOXAWAN3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Cubic Regularization for Fast Nonconvex Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chi Jin, Jeffrey Regier, Michael I. Jordan, Mitchell Stern, Nilesh Tripuraneni","submitted_at":"2017-11-08T05:39:46Z","abstract_excerpt":"This paper proposes a stochastic variant of a classic algorithm---the cubic-regularized Newton method [Nesterov and Polyak 2006]. The proposed algorithm efficiently escapes saddle points and finds approximate local minima for general smooth, nonconvex functions in only $\\mathcal{\\tilde{O}}(\\epsilon^{-3.5})$ stochastic gradient and stochastic Hessian-vector product evaluations. The latter can be computed as efficiently as stochastic gradients. This improves upon the $\\mathcal{\\tilde{O}}(\\epsilon^{-4})$ rate of stochastic gradient descent. Our rate matches the best-known result for finding local"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02838","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-18T00:28:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i3inhdhK30crjHOBzvbQASwuL6CW3nnXQawDmWiM0viD2yr3yA3ArmJwYenP4YHf4CtCwxOGrIQkBJtOMscxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T09:29:56.740616Z"},"content_sha256":"01bb577e83d350a936ebd60fd602a6b4ee15d9d2d88942a03a81fc1bcb46144b","schema_version":"1.0","event_id":"sha256:01bb577e83d350a936ebd60fd602a6b4ee15d9d2d88942a03a81fc1bcb46144b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/APCY5ZPESIXO6E4MQDTOXAWAN3/bundle.json","state_url":"https://pith.science/pith/APCY5ZPESIXO6E4MQDTOXAWAN3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/APCY5ZPESIXO6E4MQDTOXAWAN3/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-05-30T09:29:56Z","links":{"resolver":"https://pith.science/pith/APCY5ZPESIXO6E4MQDTOXAWAN3","bundle":"https://pith.science/pith/APCY5ZPESIXO6E4MQDTOXAWAN3/bundle.json","state":"https://pith.science/pith/APCY5ZPESIXO6E4MQDTOXAWAN3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/APCY5ZPESIXO6E4MQDTOXAWAN3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:APCY5ZPESIXO6E4MQDTOXAWAN3","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":"2ab3d0896bb8d573d1245438edb6677628a3a37217d7d32a47b466bfece5994a","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T05:39:46Z","title_canon_sha256":"146dba2fa8de8eac67b02bc486c54de5ca47725f14bf90f411032695114ebd3f"},"schema_version":"1.0","source":{"id":"1711.02838","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02838","created_at":"2026-05-18T00:28:40Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02838v2","created_at":"2026-05-18T00:28:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02838","created_at":"2026-05-18T00:28:40Z"},{"alias_kind":"pith_short_12","alias_value":"APCY5ZPESIXO","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"APCY5ZPESIXO6E4M","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"APCY5ZPE","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:01bb577e83d350a936ebd60fd602a6b4ee15d9d2d88942a03a81fc1bcb46144b","target":"graph","created_at":"2026-05-18T00:28:40Z","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":"This paper proposes a stochastic variant of a classic algorithm---the cubic-regularized Newton method [Nesterov and Polyak 2006]. The proposed algorithm efficiently escapes saddle points and finds approximate local minima for general smooth, nonconvex functions in only $\\mathcal{\\tilde{O}}(\\epsilon^{-3.5})$ stochastic gradient and stochastic Hessian-vector product evaluations. The latter can be computed as efficiently as stochastic gradients. This improves upon the $\\mathcal{\\tilde{O}}(\\epsilon^{-4})$ rate of stochastic gradient descent. Our rate matches the best-known result for finding local","authors_text":"Chi Jin, Jeffrey Regier, Michael I. Jordan, Mitchell Stern, Nilesh Tripuraneni","cross_cats":["math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T05:39:46Z","title":"Stochastic Cubic Regularization for Fast Nonconvex Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02838","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:350b0afdc8b39b3951d22fa1f715d7432dc937e6dc1995a8c18cb5d4927f9e8d","target":"record","created_at":"2026-05-18T00:28:40Z","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":"2ab3d0896bb8d573d1245438edb6677628a3a37217d7d32a47b466bfece5994a","cross_cats_sorted":["math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T05:39:46Z","title_canon_sha256":"146dba2fa8de8eac67b02bc486c54de5ca47725f14bf90f411032695114ebd3f"},"schema_version":"1.0","source":{"id":"1711.02838","kind":"arxiv","version":2}},"canonical_sha256":"03c58ee5e4922eef138c80e6eb82c06ec6144ebd78f0aaa5c3fe73aadf582a25","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03c58ee5e4922eef138c80e6eb82c06ec6144ebd78f0aaa5c3fe73aadf582a25","first_computed_at":"2026-05-18T00:28:40.182262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:28:40.182262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"76TnU50nbwOPbhv4fpIKyg04C8nSS6vVdZqxiiEVkLL9HtQlJcDpsTJTtmGSpg6fwVmvgyyvcpWLHJvwX4ooCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:28:40.182915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02838","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:350b0afdc8b39b3951d22fa1f715d7432dc937e6dc1995a8c18cb5d4927f9e8d","sha256:01bb577e83d350a936ebd60fd602a6b4ee15d9d2d88942a03a81fc1bcb46144b"],"state_sha256":"f0f1eeab4b447b02069b81176ee1d7ba374d1b9003e835bb20fd2781f84419b8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oQKqqdkwLOwcCi4bulC++sJe+ip99QFnrrfPnw6cYOfZp1PwfTzBbl8YsydBI06ynec0l4gNbQTsaJzt3wPDBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T09:29:56.743797Z","bundle_sha256":"e4ebbc34fff13fd108f0e711f6b434abef0eee57879db873f02baa0c665488ec"}}