{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:KCEDUUXMKMQOLRDN2XAIIVFNB4","short_pith_number":"pith:KCEDUUXM","canonical_record":{"source":{"id":"1904.09265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-19T16:59:46Z","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"title_canon_sha256":"6d6677c621829d7cf7a4e6bcbd35f7282f651164d4fc207359da40a1c5d02dad","abstract_canon_sha256":"4554f222bb25cec7b246ce36b38db31840ee78ce679f9db5fb657175668a6cb8"},"schema_version":"1.0"},"canonical_sha256":"50883a52ec5320e5c46dd5c08454ad0f18e39e268313e63e2c661a452d5e34b0","source":{"kind":"arxiv","id":"1904.09265","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09265","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09265v2","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09265","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"pith_short_12","alias_value":"KCEDUUXMKMQO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KCEDUUXMKMQOLRDN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KCEDUUXM","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:KCEDUUXMKMQOLRDN2XAIIVFNB4","target":"record","payload":{"canonical_record":{"source":{"id":"1904.09265","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-19T16:59:46Z","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"title_canon_sha256":"6d6677c621829d7cf7a4e6bcbd35f7282f651164d4fc207359da40a1c5d02dad","abstract_canon_sha256":"4554f222bb25cec7b246ce36b38db31840ee78ce679f9db5fb657175668a6cb8"},"schema_version":"1.0"},"canonical_sha256":"50883a52ec5320e5c46dd5c08454ad0f18e39e268313e63e2c661a452d5e34b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:48.182964Z","signature_b64":"wUQltnsoqoK3rQThT6Jwke8kMhPY8B11LEv6zmkE7l7NzgSj6GmHxfupAs39cFgjC5P/L7ZigL3ayh65auL8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"50883a52ec5320e5c46dd5c08454ad0f18e39e268313e63e2c661a452d5e34b0","last_reissued_at":"2026-05-17T23:42:48.182236Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:48.182236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.09265","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-17T23:42:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sw1BoTTf5IkO5X0SIpbt4SBYGCNg3W8IA9evEQoJiyc2WCGZMyep09QNuWXEtxx6YmuaQwoVF1MEGDpY2F9DBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:30:44.356117Z"},"content_sha256":"55e7df4a2700f9959a2db95c0d7e810b39f5bea76dd277c8a655ae2701d60593","schema_version":"1.0","event_id":"sha256:55e7df4a2700f9959a2db95c0d7e810b39f5bea76dd277c8a655ae2701d60593"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:KCEDUUXMKMQOLRDN2XAIIVFNB4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SSRGD: Simple Stochastic Recursive Gradient Descent for Escaping Saddle Points","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Zhize Li","submitted_at":"2019-04-19T16:59:46Z","abstract_excerpt":"We analyze stochastic gradient algorithms for optimizing nonconvex problems. In particular, our goal is to find local minima (second-order stationary points) instead of just finding first-order stationary points which may be some bad unstable saddle points. We show that a simple perturbed version of stochastic recursive gradient descent algorithm (called SSRGD) can find an $(\\epsilon,\\delta)$-second-order stationary point with $\\widetilde{O}(\\sqrt{n}/\\epsilon^2 + \\sqrt{n}/\\delta^4 + n/\\delta^3)$ stochastic gradient complexity for nonconvex finite-sum problems. As a by-product, SSRGD finds an $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09265","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-17T23:42:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iwP5BodD0iPvE3brBM3XfDrtQb036OeKN7nDFpnjWUu14L4dKrGxFousCm9dLrmTpUPgeQl1S7hRXgax5VFHDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T20:30:44.356794Z"},"content_sha256":"eafe9f03f15a0f5e791adc3554f44ff525799ecca79a9e2dd3f07a619bd32b81","schema_version":"1.0","event_id":"sha256:eafe9f03f15a0f5e791adc3554f44ff525799ecca79a9e2dd3f07a619bd32b81"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4/bundle.json","state_url":"https://pith.science/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4/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-29T20:30:44Z","links":{"resolver":"https://pith.science/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4","bundle":"https://pith.science/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4/bundle.json","state":"https://pith.science/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KCEDUUXMKMQOLRDN2XAIIVFNB4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:KCEDUUXMKMQOLRDN2XAIIVFNB4","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":"4554f222bb25cec7b246ce36b38db31840ee78ce679f9db5fb657175668a6cb8","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-19T16:59:46Z","title_canon_sha256":"6d6677c621829d7cf7a4e6bcbd35f7282f651164d4fc207359da40a1c5d02dad"},"schema_version":"1.0","source":{"id":"1904.09265","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.09265","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"arxiv_version","alias_value":"1904.09265v2","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.09265","created_at":"2026-05-17T23:42:48Z"},{"alias_kind":"pith_short_12","alias_value":"KCEDUUXMKMQO","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"KCEDUUXMKMQOLRDN","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"KCEDUUXM","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:eafe9f03f15a0f5e791adc3554f44ff525799ecca79a9e2dd3f07a619bd32b81","target":"graph","created_at":"2026-05-17T23:42:48Z","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 analyze stochastic gradient algorithms for optimizing nonconvex problems. In particular, our goal is to find local minima (second-order stationary points) instead of just finding first-order stationary points which may be some bad unstable saddle points. We show that a simple perturbed version of stochastic recursive gradient descent algorithm (called SSRGD) can find an $(\\epsilon,\\delta)$-second-order stationary point with $\\widetilde{O}(\\sqrt{n}/\\epsilon^2 + \\sqrt{n}/\\delta^4 + n/\\delta^3)$ stochastic gradient complexity for nonconvex finite-sum problems. As a by-product, SSRGD finds an $","authors_text":"Zhize Li","cross_cats":["cs.DS","math.OC","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-19T16:59:46Z","title":"SSRGD: Simple Stochastic Recursive Gradient Descent for Escaping Saddle Points"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.09265","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:55e7df4a2700f9959a2db95c0d7e810b39f5bea76dd277c8a655ae2701d60593","target":"record","created_at":"2026-05-17T23:42:48Z","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":"4554f222bb25cec7b246ce36b38db31840ee78ce679f9db5fb657175668a6cb8","cross_cats_sorted":["cs.DS","math.OC","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-19T16:59:46Z","title_canon_sha256":"6d6677c621829d7cf7a4e6bcbd35f7282f651164d4fc207359da40a1c5d02dad"},"schema_version":"1.0","source":{"id":"1904.09265","kind":"arxiv","version":2}},"canonical_sha256":"50883a52ec5320e5c46dd5c08454ad0f18e39e268313e63e2c661a452d5e34b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"50883a52ec5320e5c46dd5c08454ad0f18e39e268313e63e2c661a452d5e34b0","first_computed_at":"2026-05-17T23:42:48.182236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:48.182236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wUQltnsoqoK3rQThT6Jwke8kMhPY8B11LEv6zmkE7l7NzgSj6GmHxfupAs39cFgjC5P/L7ZigL3ayh65auL8Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:48.182964Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.09265","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55e7df4a2700f9959a2db95c0d7e810b39f5bea76dd277c8a655ae2701d60593","sha256:eafe9f03f15a0f5e791adc3554f44ff525799ecca79a9e2dd3f07a619bd32b81"],"state_sha256":"091e60abf7184711660cd93f025d8b1aa375c63ec6a187e28cca0b35f9a70334"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IYy0YXSbNXvekIqNiyTMH1QNvEGHUG7BoWDUZwsQ510tXoPD7jtvJbnCd4gkfDUsnSYVLMJ3zqA446EPWsYCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T20:30:44.360259Z","bundle_sha256":"48027b32bde6d9f56b36dbea551101551fd6be73e5313d034f68629ab40bcac1"}}