{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LUYXU3EQ5KWQWQP7VWMZ53N3UX","short_pith_number":"pith:LUYXU3EQ","canonical_record":{"source":{"id":"1903.01540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-04T21:12:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eadc54a8433b8bc2469ff5eed98b8fd8059c619d9d2a55ce5ab8bac49d352469","abstract_canon_sha256":"0587203a2565ba919ec98a7ea1c39e0d90e7382b13ce65d85724343bd74439c5"},"schema_version":"1.0"},"canonical_sha256":"5d317a6c90eaad0b41ffad999eedbba5c3979a9265020960b014e142758623fd","source":{"kind":"arxiv","id":"1903.01540","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01540","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01540v1","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01540","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"pith_short_12","alias_value":"LUYXU3EQ5KWQ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LUYXU3EQ5KWQWQP7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LUYXU3EQ","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LUYXU3EQ5KWQWQP7VWMZ53N3UX","target":"record","payload":{"canonical_record":{"source":{"id":"1903.01540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-04T21:12:30Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"eadc54a8433b8bc2469ff5eed98b8fd8059c619d9d2a55ce5ab8bac49d352469","abstract_canon_sha256":"0587203a2565ba919ec98a7ea1c39e0d90e7382b13ce65d85724343bd74439c5"},"schema_version":"1.0"},"canonical_sha256":"5d317a6c90eaad0b41ffad999eedbba5c3979a9265020960b014e142758623fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:00.366474Z","signature_b64":"7h56UnXJjEnP3sL4p7MsFjGWZoFtFsdf/0f6q3eLIBdEH4F1ADogu3h69fN+LqGrW3zNMqZTilcOhmEQ8vsfCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d317a6c90eaad0b41ffad999eedbba5c3979a9265020960b014e142758623fd","last_reissued_at":"2026-05-17T23:52:00.365987Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:00.365987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.01540","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:52:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q0GnBBJ+bhUAWsEAmvSDlbINZmOeFiloIvtHDmg0pJEMVc1TYWEF1KFgV01EzU912tvcTJ0QVMtu2SCBVvoPCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:18:52.084355Z"},"content_sha256":"acfb5935d65954a4b879da43ba97d3edd86fc3f6874dd495bd03801154c8b839","schema_version":"1.0","event_id":"sha256:acfb5935d65954a4b879da43ba97d3edd86fc3f6874dd495bd03801154c8b839"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LUYXU3EQ5KWQWQP7VWMZ53N3UX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Stochastic Trust Region Method for Non-convex Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"math.OC","authors_text":"Alejandro Ribeiro, Cong Fang, Pan Zhou, Zebang Shen","submitted_at":"2019-03-04T21:12:30Z","abstract_excerpt":"We target the problem of finding a local minimum in non-convex finite-sum minimization. Towards this goal, we first prove that the trust region method with inexact gradient and Hessian estimation can achieve a convergence rate of order $\\mathcal{O}(1/{k^{2/3}})$ as long as those differential estimations are sufficiently accurate. Combining such result with a novel Hessian estimator, we propose the sample-efficient stochastic trust region (STR) algorithm which finds an $(\\epsilon, \\sqrt{\\epsilon})$-approximate local minimum within $\\mathcal{O}({\\sqrt{n}}/{\\epsilon^{1.5}})$ stochastic Hessian or"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01540","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:52:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LYzzz9Q0WoCkPLCyGq7e/cVN/O6Y/Yxtix5Lcypz1pws5CVhrFbyl8v26X61hLxZii0k7MDOZvLNJTreqUlSBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:18:52.084931Z"},"content_sha256":"b0b449695d181f322c1d37b0afa1b1301c9deb5c11d5b95af84f31d454592256","schema_version":"1.0","event_id":"sha256:b0b449695d181f322c1d37b0afa1b1301c9deb5c11d5b95af84f31d454592256"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX/bundle.json","state_url":"https://pith.science/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX/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-06-03T20:18:52Z","links":{"resolver":"https://pith.science/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX","bundle":"https://pith.science/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX/bundle.json","state":"https://pith.science/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LUYXU3EQ5KWQWQP7VWMZ53N3UX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LUYXU3EQ5KWQWQP7VWMZ53N3UX","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":"0587203a2565ba919ec98a7ea1c39e0d90e7382b13ce65d85724343bd74439c5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-04T21:12:30Z","title_canon_sha256":"eadc54a8433b8bc2469ff5eed98b8fd8059c619d9d2a55ce5ab8bac49d352469"},"schema_version":"1.0","source":{"id":"1903.01540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.01540","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"arxiv_version","alias_value":"1903.01540v1","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.01540","created_at":"2026-05-17T23:52:00Z"},{"alias_kind":"pith_short_12","alias_value":"LUYXU3EQ5KWQ","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LUYXU3EQ5KWQWQP7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LUYXU3EQ","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:b0b449695d181f322c1d37b0afa1b1301c9deb5c11d5b95af84f31d454592256","target":"graph","created_at":"2026-05-17T23:52:00Z","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 target the problem of finding a local minimum in non-convex finite-sum minimization. Towards this goal, we first prove that the trust region method with inexact gradient and Hessian estimation can achieve a convergence rate of order $\\mathcal{O}(1/{k^{2/3}})$ as long as those differential estimations are sufficiently accurate. Combining such result with a novel Hessian estimator, we propose the sample-efficient stochastic trust region (STR) algorithm which finds an $(\\epsilon, \\sqrt{\\epsilon})$-approximate local minimum within $\\mathcal{O}({\\sqrt{n}}/{\\epsilon^{1.5}})$ stochastic Hessian or","authors_text":"Alejandro Ribeiro, Cong Fang, Pan Zhou, Zebang Shen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-04T21:12:30Z","title":"A Stochastic Trust Region Method for Non-convex Minimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.01540","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:acfb5935d65954a4b879da43ba97d3edd86fc3f6874dd495bd03801154c8b839","target":"record","created_at":"2026-05-17T23:52:00Z","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":"0587203a2565ba919ec98a7ea1c39e0d90e7382b13ce65d85724343bd74439c5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-03-04T21:12:30Z","title_canon_sha256":"eadc54a8433b8bc2469ff5eed98b8fd8059c619d9d2a55ce5ab8bac49d352469"},"schema_version":"1.0","source":{"id":"1903.01540","kind":"arxiv","version":1}},"canonical_sha256":"5d317a6c90eaad0b41ffad999eedbba5c3979a9265020960b014e142758623fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d317a6c90eaad0b41ffad999eedbba5c3979a9265020960b014e142758623fd","first_computed_at":"2026-05-17T23:52:00.365987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:52:00.365987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7h56UnXJjEnP3sL4p7MsFjGWZoFtFsdf/0f6q3eLIBdEH4F1ADogu3h69fN+LqGrW3zNMqZTilcOhmEQ8vsfCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:52:00.366474Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.01540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:acfb5935d65954a4b879da43ba97d3edd86fc3f6874dd495bd03801154c8b839","sha256:b0b449695d181f322c1d37b0afa1b1301c9deb5c11d5b95af84f31d454592256"],"state_sha256":"c4c58c48011dac3d13e07617eb1e8e74df810cc036f512372db94e6570a501a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cKf43CGQvAnk+v6PKS8gMHQ6d9cYyeasaYHJ9ntlcfokeMxnPcFX4TPaXrbycsl3DvA/d2M9xSaEAtL3LSYsAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:18:52.087688Z","bundle_sha256":"855c0f40dc08ef6c4fbd81ae56932b802c92408643859a73b3b5ad81607b2784"}}