{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:OUKPYOTF44XMK2BS42OJL6UZO7","short_pith_number":"pith:OUKPYOTF","canonical_record":{"source":{"id":"1504.04231","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-16T13:52:20Z","cross_cats_sorted":[],"title_canon_sha256":"b017452b01aa451416648267b00aee5210ef828c13e23052b14fc7737ec57879","abstract_canon_sha256":"26e51bded259507ab735db7c499f016d529e87d5151a5980c23fe75a7d36bb36"},"schema_version":"1.0"},"canonical_sha256":"7514fc3a65e72ec56832e69c95fa9977d4959451ca5a3d89bfc5c4074c05b6dd","source":{"kind":"arxiv","id":"1504.04231","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04231","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04231v2","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04231","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"OUKPYOTF44XM","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OUKPYOTF44XMK2BS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OUKPYOTF","created_at":"2026-05-18T12:29:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:OUKPYOTF44XMK2BS42OJL6UZO7","target":"record","payload":{"canonical_record":{"source":{"id":"1504.04231","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-16T13:52:20Z","cross_cats_sorted":[],"title_canon_sha256":"b017452b01aa451416648267b00aee5210ef828c13e23052b14fc7737ec57879","abstract_canon_sha256":"26e51bded259507ab735db7c499f016d529e87d5151a5980c23fe75a7d36bb36"},"schema_version":"1.0"},"canonical_sha256":"7514fc3a65e72ec56832e69c95fa9977d4959451ca5a3d89bfc5c4074c05b6dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:04:01.347893Z","signature_b64":"XjeMucN/95WJ/Rc9mTZxmh5abZNkNuW2+QPWjihb6wsFeNjTzOH9RKyYvTviyuVD/4Ly0EMCYs8mIO2fWasaCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7514fc3a65e72ec56832e69c95fa9977d4959451ca5a3d89bfc5c4074c05b6dd","last_reissued_at":"2026-05-18T01:04:01.347329Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:04:01.347329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.04231","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-18T01:04:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BByMAERjBYiDDOPMCdJl881PrdAB+waYP+5Zr+jR+34P9uHpFANeoUZmAGD651zgzWQHUSnkR2YHkGlAW25qCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:30:31.722357Z"},"content_sha256":"c333ed4681e1953923cf487ea110a6f2036df7ac004535854ec6dfbb7249e28c","schema_version":"1.0","event_id":"sha256:c333ed4681e1953923cf487ea110a6f2036df7ac004535854ec6dfbb7249e28c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:OUKPYOTF44XMK2BS42OJL6UZO7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Optimization Using a Trust-Region Method and Random Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Katya Scheinberg, Matt Menickelly, Ruobing Chen","submitted_at":"2015-04-16T13:52:20Z","abstract_excerpt":"In this paper, we propose and analyze a trust-region model-based algorithm for solving unconstrained stochastic optimization problems. Our framework utilizes random models of an objective function $f(x)$, obtained from stochastic observations of the function or its gradient. Our method also utilizes estimates of function values to gauge progress that is being made. The convergence analysis relies on requirements that these models and these estimates are sufficiently accurate with sufficiently high, but fixed, probability. Beyond these conditions, no assumptions are made on how these models and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04231","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-18T01:04:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9MWd8WQhpq6It228nBIlg0XQloLaODXO0E+Zbi6nrmPvAINlX9ehIBgwH50ATTQ0GShZr5NhFkcRcv/YXC9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T22:30:31.723024Z"},"content_sha256":"fe6ef34edb0a415c3564e32b70b55c522b8a4f6e9e5b667d1c5c132e4cae585a","schema_version":"1.0","event_id":"sha256:fe6ef34edb0a415c3564e32b70b55c522b8a4f6e9e5b667d1c5c132e4cae585a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUKPYOTF44XMK2BS42OJL6UZO7/bundle.json","state_url":"https://pith.science/pith/OUKPYOTF44XMK2BS42OJL6UZO7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUKPYOTF44XMK2BS42OJL6UZO7/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-25T22:30:31Z","links":{"resolver":"https://pith.science/pith/OUKPYOTF44XMK2BS42OJL6UZO7","bundle":"https://pith.science/pith/OUKPYOTF44XMK2BS42OJL6UZO7/bundle.json","state":"https://pith.science/pith/OUKPYOTF44XMK2BS42OJL6UZO7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUKPYOTF44XMK2BS42OJL6UZO7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:OUKPYOTF44XMK2BS42OJL6UZO7","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":"26e51bded259507ab735db7c499f016d529e87d5151a5980c23fe75a7d36bb36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-16T13:52:20Z","title_canon_sha256":"b017452b01aa451416648267b00aee5210ef828c13e23052b14fc7737ec57879"},"schema_version":"1.0","source":{"id":"1504.04231","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04231","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04231v2","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04231","created_at":"2026-05-18T01:04:01Z"},{"alias_kind":"pith_short_12","alias_value":"OUKPYOTF44XM","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_16","alias_value":"OUKPYOTF44XMK2BS","created_at":"2026-05-18T12:29:34Z"},{"alias_kind":"pith_short_8","alias_value":"OUKPYOTF","created_at":"2026-05-18T12:29:34Z"}],"graph_snapshots":[{"event_id":"sha256:fe6ef34edb0a415c3564e32b70b55c522b8a4f6e9e5b667d1c5c132e4cae585a","target":"graph","created_at":"2026-05-18T01:04:01Z","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 propose and analyze a trust-region model-based algorithm for solving unconstrained stochastic optimization problems. Our framework utilizes random models of an objective function $f(x)$, obtained from stochastic observations of the function or its gradient. Our method also utilizes estimates of function values to gauge progress that is being made. The convergence analysis relies on requirements that these models and these estimates are sufficiently accurate with sufficiently high, but fixed, probability. Beyond these conditions, no assumptions are made on how these models and","authors_text":"Katya Scheinberg, Matt Menickelly, Ruobing Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-16T13:52:20Z","title":"Stochastic Optimization Using a Trust-Region Method and Random Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04231","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:c333ed4681e1953923cf487ea110a6f2036df7ac004535854ec6dfbb7249e28c","target":"record","created_at":"2026-05-18T01:04:01Z","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":"26e51bded259507ab735db7c499f016d529e87d5151a5980c23fe75a7d36bb36","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-04-16T13:52:20Z","title_canon_sha256":"b017452b01aa451416648267b00aee5210ef828c13e23052b14fc7737ec57879"},"schema_version":"1.0","source":{"id":"1504.04231","kind":"arxiv","version":2}},"canonical_sha256":"7514fc3a65e72ec56832e69c95fa9977d4959451ca5a3d89bfc5c4074c05b6dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7514fc3a65e72ec56832e69c95fa9977d4959451ca5a3d89bfc5c4074c05b6dd","first_computed_at":"2026-05-18T01:04:01.347329Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:04:01.347329Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XjeMucN/95WJ/Rc9mTZxmh5abZNkNuW2+QPWjihb6wsFeNjTzOH9RKyYvTviyuVD/4Ly0EMCYs8mIO2fWasaCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:04:01.347893Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04231","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c333ed4681e1953923cf487ea110a6f2036df7ac004535854ec6dfbb7249e28c","sha256:fe6ef34edb0a415c3564e32b70b55c522b8a4f6e9e5b667d1c5c132e4cae585a"],"state_sha256":"9fc3bc5f3f0e2e8e4dda643b0f8c1f21ebe007bd219569d0e2df32363b76e74f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JYYafXH9/lftFV17AO/+5fZMEsZ8cFZUCXdk1uWwDwVNcodwvLKDhgMof/KbKbMS4RwTq0+c0S1vJ1JLhO7+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T22:30:31.726590Z","bundle_sha256":"14feaf37b32d072a8322737c8a8823b92b1cc56eefac47c3df6199013e511030"}}