{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4MH74DMXXSC24GJPBL7B5QMHLD","short_pith_number":"pith:4MH74DMX","canonical_record":{"source":{"id":"1811.11989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-29T07:10:44Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"0fdd596869a1c27e4959dcac1c7c6571c7a66b32deb0e20a0c8444b9d4590207","abstract_canon_sha256":"aa215cc731c61c6e93d9306d7f61a519becd2ce501bef1af03c71487c34408fc"},"schema_version":"1.0"},"canonical_sha256":"e30ffe0d97bc85ae192f0afe1ec18758d993e81a58aba99bd45e3853e3b86e03","source":{"kind":"arxiv","id":"1811.11989","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11989","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11989v1","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11989","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"4MH74DMXXSC2","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4MH74DMXXSC24GJP","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4MH74DMX","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4MH74DMXXSC24GJPBL7B5QMHLD","target":"record","payload":{"canonical_record":{"source":{"id":"1811.11989","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-29T07:10:44Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"0fdd596869a1c27e4959dcac1c7c6571c7a66b32deb0e20a0c8444b9d4590207","abstract_canon_sha256":"aa215cc731c61c6e93d9306d7f61a519becd2ce501bef1af03c71487c34408fc"},"schema_version":"1.0"},"canonical_sha256":"e30ffe0d97bc85ae192f0afe1ec18758d993e81a58aba99bd45e3853e3b86e03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:34.808102Z","signature_b64":"1XlTeTE9R2j2is2BwUn8jCFR9zWAF5AiWtyR8/XA5lVyaHh2LpsrzQtd7eHxJVLOVe9hHlvI8Eiid6g+8O1gCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e30ffe0d97bc85ae192f0afe1ec18758d993e81a58aba99bd45e3853e3b86e03","last_reissued_at":"2026-05-17T23:59:34.807457Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:34.807457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.11989","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-17T23:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lLovVMMwlLQPOAmZInTacHMMP/XT2+rwYLIPSUV/qoWVVJkrjkXMttA1c/xWsKF27ClBg6mDf1iMUxDx+pssDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T19:05:29.625467Z"},"content_sha256":"65bce7fbaf3606428d1593af99a88788feaaef656bc8d8e5711a2f9850c97e45","schema_version":"1.0","event_id":"sha256:65bce7fbaf3606428d1593af99a88788feaaef656bc8d8e5711a2f9850c97e45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4MH74DMXXSC24GJPBL7B5QMHLD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sample Efficient Stochastic Variance-Reduced Cubic Regularization Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Dongruo Zhou, Pan Xu, Quanquan Gu","submitted_at":"2018-11-29T07:10:44Z","abstract_excerpt":"We propose a sample efficient stochastic variance-reduced cubic regularization (Lite-SVRC) algorithm for finding the local minimum efficiently in nonconvex optimization. The proposed algorithm achieves a lower sample complexity of Hessian matrix computation than existing cubic regularization based methods. At the heart of our analysis is the choice of a constant batch size of Hessian matrix computation at each iteration and the stochastic variance reduction techniques. In detail, for a nonconvex function with $n$ component functions, Lite-SVRC converges to the local minimum within $\\tilde{O}(n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11989","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-17T23:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EQUqAHVspLNdKHLKz0V4qwKeSeDWZH7NME11+L6Y8zWLRN4d+hHTpqDpQOiqWm46ejGn3vbz3YTUa9GBYljBDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T19:05:29.625816Z"},"content_sha256":"510a90213d7f6ace151325cab1be0a2e9b86c757daf2604f985cbc50a9c1cdd7","schema_version":"1.0","event_id":"sha256:510a90213d7f6ace151325cab1be0a2e9b86c757daf2604f985cbc50a9c1cdd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4MH74DMXXSC24GJPBL7B5QMHLD/bundle.json","state_url":"https://pith.science/pith/4MH74DMXXSC24GJPBL7B5QMHLD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4MH74DMXXSC24GJPBL7B5QMHLD/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-20T19:05:29Z","links":{"resolver":"https://pith.science/pith/4MH74DMXXSC24GJPBL7B5QMHLD","bundle":"https://pith.science/pith/4MH74DMXXSC24GJPBL7B5QMHLD/bundle.json","state":"https://pith.science/pith/4MH74DMXXSC24GJPBL7B5QMHLD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4MH74DMXXSC24GJPBL7B5QMHLD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4MH74DMXXSC24GJPBL7B5QMHLD","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":"aa215cc731c61c6e93d9306d7f61a519becd2ce501bef1af03c71487c34408fc","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-29T07:10:44Z","title_canon_sha256":"0fdd596869a1c27e4959dcac1c7c6571c7a66b32deb0e20a0c8444b9d4590207"},"schema_version":"1.0","source":{"id":"1811.11989","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.11989","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.11989v1","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.11989","created_at":"2026-05-17T23:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"4MH74DMXXSC2","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4MH74DMXXSC24GJP","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4MH74DMX","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:510a90213d7f6ace151325cab1be0a2e9b86c757daf2604f985cbc50a9c1cdd7","target":"graph","created_at":"2026-05-17T23:59:34Z","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 propose a sample efficient stochastic variance-reduced cubic regularization (Lite-SVRC) algorithm for finding the local minimum efficiently in nonconvex optimization. The proposed algorithm achieves a lower sample complexity of Hessian matrix computation than existing cubic regularization based methods. At the heart of our analysis is the choice of a constant batch size of Hessian matrix computation at each iteration and the stochastic variance reduction techniques. In detail, for a nonconvex function with $n$ component functions, Lite-SVRC converges to the local minimum within $\\tilde{O}(n","authors_text":"Dongruo Zhou, Pan Xu, Quanquan Gu","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-29T07:10:44Z","title":"Sample Efficient Stochastic Variance-Reduced Cubic Regularization Method"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.11989","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:65bce7fbaf3606428d1593af99a88788feaaef656bc8d8e5711a2f9850c97e45","target":"record","created_at":"2026-05-17T23:59:34Z","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":"aa215cc731c61c6e93d9306d7f61a519becd2ce501bef1af03c71487c34408fc","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-11-29T07:10:44Z","title_canon_sha256":"0fdd596869a1c27e4959dcac1c7c6571c7a66b32deb0e20a0c8444b9d4590207"},"schema_version":"1.0","source":{"id":"1811.11989","kind":"arxiv","version":1}},"canonical_sha256":"e30ffe0d97bc85ae192f0afe1ec18758d993e81a58aba99bd45e3853e3b86e03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e30ffe0d97bc85ae192f0afe1ec18758d993e81a58aba99bd45e3853e3b86e03","first_computed_at":"2026-05-17T23:59:34.807457Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:34.807457Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1XlTeTE9R2j2is2BwUn8jCFR9zWAF5AiWtyR8/XA5lVyaHh2LpsrzQtd7eHxJVLOVe9hHlvI8Eiid6g+8O1gCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:34.808102Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.11989","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65bce7fbaf3606428d1593af99a88788feaaef656bc8d8e5711a2f9850c97e45","sha256:510a90213d7f6ace151325cab1be0a2e9b86c757daf2604f985cbc50a9c1cdd7"],"state_sha256":"b0c8c8a61cbbd68ba5bfa883f0d998636493cc03eade1db77f9d3937f12e7b2a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H73J4CVotJbLCo0g+eDYrzFivgnV9U7fiXNjs38tCKjSs1j77eC2bpsRMJ/WXkML/scLT+eSuAwg/Fvt2xcCCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T19:05:29.627776Z","bundle_sha256":"cbda2a8c715f571e548d1b93c7a937b99193d3f74b7f3c166c26796171f119f3"}}