{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CAG3K3HJ6BQNTNF3NDJPZCBTP6","short_pith_number":"pith:CAG3K3HJ","canonical_record":{"source":{"id":"1710.09447","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-25T20:26:33Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a2579cfabb486afad7012baa2f2832dcedc876eab14d5d33de39fe9d83a07c33","abstract_canon_sha256":"4d9ae554279b5c32c1467597a1f5e4a3b6c36dd3b92cf662555fb7e4b3fba43e"},"schema_version":"1.0"},"canonical_sha256":"100db56ce9f060d9b4bb68d2fc88337f87fc95df8975782307de31b6da4f5beb","source":{"kind":"arxiv","id":"1710.09447","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09447","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09447v2","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09447","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"pith_short_12","alias_value":"CAG3K3HJ6BQN","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CAG3K3HJ6BQNTNF3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CAG3K3HJ","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CAG3K3HJ6BQNTNF3NDJPZCBTP6","target":"record","payload":{"canonical_record":{"source":{"id":"1710.09447","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-25T20:26:33Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"a2579cfabb486afad7012baa2f2832dcedc876eab14d5d33de39fe9d83a07c33","abstract_canon_sha256":"4d9ae554279b5c32c1467597a1f5e4a3b6c36dd3b92cf662555fb7e4b3fba43e"},"schema_version":"1.0"},"canonical_sha256":"100db56ce9f060d9b4bb68d2fc88337f87fc95df8975782307de31b6da4f5beb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:35.496631Z","signature_b64":"frRvNZ0H+l/a/fvBZhe9vKBHmfp14YvOfsv8RpoeYjECenRhyaujGoDmqzAzRJ8ZawDoZJb3lpzHXc8KTLnHDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"100db56ce9f060d9b4bb68d2fc88337f87fc95df8975782307de31b6da4f5beb","last_reissued_at":"2026-05-18T00:31:35.495892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:35.495892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1710.09447","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:31:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jj1iGThNzUvcfGxVGjtrnnEmS2gX+14iXr9gOA1BlGxNnXkA40AavtjbhNcxlYKTLKYI0IEHZP/O51fcACxrAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:42:32.662382Z"},"content_sha256":"83333d79649d7cd2f98e7e045f0d804fd0bfcd462707b29c98a69c28bde5a0de","schema_version":"1.0","event_id":"sha256:83333d79649d7cd2f98e7e045f0d804fd0bfcd462707b29c98a69c28bde5a0de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CAG3K3HJ6BQNTNF3NDJPZCBTP6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Non-convex Optimization with Strong High Probability Second-order Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Mingrui Liu, Tianbao Yang","submitted_at":"2017-10-25T20:26:33Z","abstract_excerpt":"In this paper, we study stochastic non-convex optimization with non-convex random functions. Recent studies on non-convex optimization revolve around establishing second-order convergence, i.e., converging to a nearly second-order optimal stationary points. However, existing results on stochastic non-convex optimization are limited, especially with a high probability second-order convergence. We propose a novel updating step (named NCG-S) by leveraging a stochastic gradient and a noisy negative curvature of a stochastic Hessian, where the stochastic gradient and Hessian are based on a proper m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09447","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:31:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8WuZm/4PikbpRVZV6JNLfbOJ9Cm1ty55C5h2GC/V57CWkUohJIo8LNUBDatwTq9arGeG9alT48MV71wyQDD9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:42:32.662787Z"},"content_sha256":"8a0697f1b6639d1ffc51f29609915d2fb920ecaea29f6b63ec75149e6865c187","schema_version":"1.0","event_id":"sha256:8a0697f1b6639d1ffc51f29609915d2fb920ecaea29f6b63ec75149e6865c187"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CAG3K3HJ6BQNTNF3NDJPZCBTP6/bundle.json","state_url":"https://pith.science/pith/CAG3K3HJ6BQNTNF3NDJPZCBTP6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CAG3K3HJ6BQNTNF3NDJPZCBTP6/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-31T09:42:32Z","links":{"resolver":"https://pith.science/pith/CAG3K3HJ6BQNTNF3NDJPZCBTP6","bundle":"https://pith.science/pith/CAG3K3HJ6BQNTNF3NDJPZCBTP6/bundle.json","state":"https://pith.science/pith/CAG3K3HJ6BQNTNF3NDJPZCBTP6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CAG3K3HJ6BQNTNF3NDJPZCBTP6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CAG3K3HJ6BQNTNF3NDJPZCBTP6","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":"4d9ae554279b5c32c1467597a1f5e4a3b6c36dd3b92cf662555fb7e4b3fba43e","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-25T20:26:33Z","title_canon_sha256":"a2579cfabb486afad7012baa2f2832dcedc876eab14d5d33de39fe9d83a07c33"},"schema_version":"1.0","source":{"id":"1710.09447","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1710.09447","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"arxiv_version","alias_value":"1710.09447v2","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.09447","created_at":"2026-05-18T00:31:35Z"},{"alias_kind":"pith_short_12","alias_value":"CAG3K3HJ6BQN","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CAG3K3HJ6BQNTNF3","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CAG3K3HJ","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:8a0697f1b6639d1ffc51f29609915d2fb920ecaea29f6b63ec75149e6865c187","target":"graph","created_at":"2026-05-18T00:31: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":"In this paper, we study stochastic non-convex optimization with non-convex random functions. Recent studies on non-convex optimization revolve around establishing second-order convergence, i.e., converging to a nearly second-order optimal stationary points. However, existing results on stochastic non-convex optimization are limited, especially with a high probability second-order convergence. We propose a novel updating step (named NCG-S) by leveraging a stochastic gradient and a noisy negative curvature of a stochastic Hessian, where the stochastic gradient and Hessian are based on a proper m","authors_text":"Mingrui Liu, Tianbao Yang","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-25T20:26:33Z","title":"Stochastic Non-convex Optimization with Strong High Probability Second-order Convergence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.09447","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:83333d79649d7cd2f98e7e045f0d804fd0bfcd462707b29c98a69c28bde5a0de","target":"record","created_at":"2026-05-18T00:31: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":"4d9ae554279b5c32c1467597a1f5e4a3b6c36dd3b92cf662555fb7e4b3fba43e","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-10-25T20:26:33Z","title_canon_sha256":"a2579cfabb486afad7012baa2f2832dcedc876eab14d5d33de39fe9d83a07c33"},"schema_version":"1.0","source":{"id":"1710.09447","kind":"arxiv","version":2}},"canonical_sha256":"100db56ce9f060d9b4bb68d2fc88337f87fc95df8975782307de31b6da4f5beb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"100db56ce9f060d9b4bb68d2fc88337f87fc95df8975782307de31b6da4f5beb","first_computed_at":"2026-05-18T00:31:35.495892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:35.495892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"frRvNZ0H+l/a/fvBZhe9vKBHmfp14YvOfsv8RpoeYjECenRhyaujGoDmqzAzRJ8ZawDoZJb3lpzHXc8KTLnHDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:35.496631Z","signed_message":"canonical_sha256_bytes"},"source_id":"1710.09447","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83333d79649d7cd2f98e7e045f0d804fd0bfcd462707b29c98a69c28bde5a0de","sha256:8a0697f1b6639d1ffc51f29609915d2fb920ecaea29f6b63ec75149e6865c187"],"state_sha256":"0328ae7640cdafd9609de4a076ecf51e44a477432f5e00bcc00ae6920f263e78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1OWkwgbJraWbLzDG6MhWuHQGzQNnX9AhGmSPVSQXfz70LVInZtnW2P6KDxOC/ajnO5et+X37j5qn9cNEclBaCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:42:32.666414Z","bundle_sha256":"5a5669509d78c110ee3c6befdb963a28cba9037633b1a928323c8fcdbd01d763"}}