{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LE3U32C47RIPZCBY4GWO7HEZRW","short_pith_number":"pith:LE3U32C4","canonical_record":{"source":{"id":"1609.07428","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T16:55:01Z","cross_cats_sorted":[],"title_canon_sha256":"db43c9682979184839827d15825d6febe7b84de0f927c0da88dd2d17f0225d52","abstract_canon_sha256":"880af3f43b3522704c6db91f125ad1b015d4c8715e2232d786f45229c2765ff0"},"schema_version":"1.0"},"canonical_sha256":"59374de85cfc50fc8838e1acef9c998da5c8b2d0d91ab87ad34588fdb37a324b","source":{"kind":"arxiv","id":"1609.07428","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07428","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07428v3","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07428","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"LE3U32C47RIP","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LE3U32C47RIPZCBY","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LE3U32C4","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LE3U32C47RIPZCBY4GWO7HEZRW","target":"record","payload":{"canonical_record":{"source":{"id":"1609.07428","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T16:55:01Z","cross_cats_sorted":[],"title_canon_sha256":"db43c9682979184839827d15825d6febe7b84de0f927c0da88dd2d17f0225d52","abstract_canon_sha256":"880af3f43b3522704c6db91f125ad1b015d4c8715e2232d786f45229c2765ff0"},"schema_version":"1.0"},"canonical_sha256":"59374de85cfc50fc8838e1acef9c998da5c8b2d0d91ab87ad34588fdb37a324b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:45.936101Z","signature_b64":"YsHKx9i4aiZB13R/XC6o38ncXIV5wvtcZItxHt8f/MFkmODMICQe4CuSi7CrOImzGbL8EPTLpWUeSHL5xckDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59374de85cfc50fc8838e1acef9c998da5c8b2d0d91ab87ad34588fdb37a324b","last_reissued_at":"2026-05-18T00:02:45.935669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:45.935669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.07428","source_version":3,"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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UsBHo0+OEt9jmcKC45nQKRdh60ALyzgejDJpJxBP8c99O9ZoQGKPQCropKY3YDpEWp4ygAp09RJdDpVKyq/lAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:39:26.710258Z"},"content_sha256":"61857a029833806c4345459b727a6a6df7d637896cc0ab7b69da56538d30b335","schema_version":"1.0","event_id":"sha256:61857a029833806c4345459b727a6a6df7d637896cc0ab7b69da56538d30b335"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LE3U32C47RIPZCBY4GWO7HEZRW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convergence Rate Analysis of a Stochastic Trust Region Method via Submartingales","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Coralia Cartis, Jose Blanchet, Katya Scheinberg, Matt Menickelly","submitted_at":"2016-09-23T16:55:01Z","abstract_excerpt":"We propose a novel framework for analyzing convergence rates of stochastic optimization algorithms with adaptive step sizes. This framework is based on analyzing properties of an underlying generic stochastic process, in particular by deriving a bound on the expected stopping time of this process. We utilize this framework to analyze the bounds on expected global convergence rates of a stochastic variant of a traditional trust region method, introduced in \\cite{ChenMenickellyScheinberg2014}. While traditional trust region methods rely on exact computations of the gradient, Hessian and values o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07428","kind":"arxiv","version":3},"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:02:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LAJo6Nx4yMiKrUGi1sc6KZkze/9hPrR1JLefGibIfVk5PrDsP68xysgGjfpaPxD7sF0VPmL7I0w6P1Z1oERABQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T21:39:26.710627Z"},"content_sha256":"e7684c7a02bdf9a50dd7ae3ac47707fc266b7f1cfedbe017bb820393bc213e0f","schema_version":"1.0","event_id":"sha256:e7684c7a02bdf9a50dd7ae3ac47707fc266b7f1cfedbe017bb820393bc213e0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LE3U32C47RIPZCBY4GWO7HEZRW/bundle.json","state_url":"https://pith.science/pith/LE3U32C47RIPZCBY4GWO7HEZRW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LE3U32C47RIPZCBY4GWO7HEZRW/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-04T21:39:26Z","links":{"resolver":"https://pith.science/pith/LE3U32C47RIPZCBY4GWO7HEZRW","bundle":"https://pith.science/pith/LE3U32C47RIPZCBY4GWO7HEZRW/bundle.json","state":"https://pith.science/pith/LE3U32C47RIPZCBY4GWO7HEZRW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LE3U32C47RIPZCBY4GWO7HEZRW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LE3U32C47RIPZCBY4GWO7HEZRW","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":"880af3f43b3522704c6db91f125ad1b015d4c8715e2232d786f45229c2765ff0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T16:55:01Z","title_canon_sha256":"db43c9682979184839827d15825d6febe7b84de0f927c0da88dd2d17f0225d52"},"schema_version":"1.0","source":{"id":"1609.07428","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.07428","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"arxiv_version","alias_value":"1609.07428v3","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.07428","created_at":"2026-05-18T00:02:45Z"},{"alias_kind":"pith_short_12","alias_value":"LE3U32C47RIP","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LE3U32C47RIPZCBY","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LE3U32C4","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:e7684c7a02bdf9a50dd7ae3ac47707fc266b7f1cfedbe017bb820393bc213e0f","target":"graph","created_at":"2026-05-18T00:02:45Z","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 novel framework for analyzing convergence rates of stochastic optimization algorithms with adaptive step sizes. This framework is based on analyzing properties of an underlying generic stochastic process, in particular by deriving a bound on the expected stopping time of this process. We utilize this framework to analyze the bounds on expected global convergence rates of a stochastic variant of a traditional trust region method, introduced in \\cite{ChenMenickellyScheinberg2014}. While traditional trust region methods rely on exact computations of the gradient, Hessian and values o","authors_text":"Coralia Cartis, Jose Blanchet, Katya Scheinberg, Matt Menickelly","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T16:55:01Z","title":"Convergence Rate Analysis of a Stochastic Trust Region Method via Submartingales"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.07428","kind":"arxiv","version":3},"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:61857a029833806c4345459b727a6a6df7d637896cc0ab7b69da56538d30b335","target":"record","created_at":"2026-05-18T00:02:45Z","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":"880af3f43b3522704c6db91f125ad1b015d4c8715e2232d786f45229c2765ff0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-09-23T16:55:01Z","title_canon_sha256":"db43c9682979184839827d15825d6febe7b84de0f927c0da88dd2d17f0225d52"},"schema_version":"1.0","source":{"id":"1609.07428","kind":"arxiv","version":3}},"canonical_sha256":"59374de85cfc50fc8838e1acef9c998da5c8b2d0d91ab87ad34588fdb37a324b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59374de85cfc50fc8838e1acef9c998da5c8b2d0d91ab87ad34588fdb37a324b","first_computed_at":"2026-05-18T00:02:45.935669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:02:45.935669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YsHKx9i4aiZB13R/XC6o38ncXIV5wvtcZItxHt8f/MFkmODMICQe4CuSi7CrOImzGbL8EPTLpWUeSHL5xckDAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:02:45.936101Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.07428","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61857a029833806c4345459b727a6a6df7d637896cc0ab7b69da56538d30b335","sha256:e7684c7a02bdf9a50dd7ae3ac47707fc266b7f1cfedbe017bb820393bc213e0f"],"state_sha256":"cd95127174ee36590448a40c03ef64f0cb76ba5602b590565d242bc5f3337000"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NkrzOEZ+plYLLQ/93RQsitLUQ403ESdBPkDo52UPPuApzrN2ZEJSRCSEHkZ4kLgSiNIpjkEuCNbh6XkCHoMJBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T21:39:26.712684Z","bundle_sha256":"1199f6a35cc9c285099606ac14d6e7b0650dc8f359c5934057cadba4158084ee"}}