{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:HEEAPQVLKLHJTDIJNKW6TYUAWK","short_pith_number":"pith:HEEAPQVL","canonical_record":{"source":{"id":"1505.06070","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-22T13:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"2f430bfba5212c4c3d7d38ae72f573ac8418d045b429288cf3a504311f802bd5","abstract_canon_sha256":"99a0145b6fd7c4130c13575f02c716ef23cf8ba813511a73e661afac390831cf"},"schema_version":"1.0"},"canonical_sha256":"390807c2ab52ce998d096aade9e280b29eb1e63b7d182701d0f77f71d07caf18","source":{"kind":"arxiv","id":"1505.06070","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06070","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06070v2","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06070","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"HEEAPQVLKLHJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HEEAPQVLKLHJTDIJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HEEAPQVL","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:HEEAPQVLKLHJTDIJNKW6TYUAWK","target":"record","payload":{"canonical_record":{"source":{"id":"1505.06070","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-22T13:36:11Z","cross_cats_sorted":[],"title_canon_sha256":"2f430bfba5212c4c3d7d38ae72f573ac8418d045b429288cf3a504311f802bd5","abstract_canon_sha256":"99a0145b6fd7c4130c13575f02c716ef23cf8ba813511a73e661afac390831cf"},"schema_version":"1.0"},"canonical_sha256":"390807c2ab52ce998d096aade9e280b29eb1e63b7d182701d0f77f71d07caf18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:21.142025Z","signature_b64":"QlCiWyo6czueSJZnymbQnWA6WeAA53f8gXDYFNGm9cEabwJF9l3pq/Y/+49i0dTcuQGvbaFYatFkKf+BJSNzDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"390807c2ab52ce998d096aade9e280b29eb1e63b7d182701d0f77f71d07caf18","last_reissued_at":"2026-05-18T00:53:21.141559Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:21.141559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.06070","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:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HA9P46YgV6TKV2/5I+nQS22apFX4UHt/mleD6UVuBZwNZd/dRg4C14Cet9zlQXKBNkI2NB7pvAnzsgdp5A3WAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:00:48.150767Z"},"content_sha256":"f5dc4c845b4e2135a0338e6f9e95d2ffaac485f2c4117906e2f52eb3123ca1d2","schema_version":"1.0","event_id":"sha256:f5dc4c845b4e2135a0338e6f9e95d2ffaac485f2c4117906e2f52eb3123ca1d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:HEEAPQVLKLHJTDIJNKW6TYUAWK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Global convergence rate analysis of unconstrained optimization methods based on probabilistic models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Coralia Cartis, Katya Scheinberg","submitted_at":"2015-05-22T13:36:11Z","abstract_excerpt":"We present global convergence rates for a line-search method which is based on random first-order models and directions whose quality is ensured only with certain probability. We show that in terms of the order of the accuracy, the evaluation complexity of such a method is the same as its counterparts that use deterministic accurate models; the use of probabilistic models only increases the complexity by a constant, which depends on the probability of the models being good. We particularize and improve these results in the convex and strongly convex case.\n  We also analyze a probabilistic cubi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06070","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:53:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z64aAGg36vWOMSWw4mYEGO1JVKscO3JoTYlZ5gNC9QJEe0r+56oi9S8y9MkOHfH+NFAbv6URfLGZSTqf1ohEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T18:00:48.151139Z"},"content_sha256":"1b6a0ede5d4879aee6dc6985d59ea452cdaf838e7595d9618152dab65d49e566","schema_version":"1.0","event_id":"sha256:1b6a0ede5d4879aee6dc6985d59ea452cdaf838e7595d9618152dab65d49e566"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HEEAPQVLKLHJTDIJNKW6TYUAWK/bundle.json","state_url":"https://pith.science/pith/HEEAPQVLKLHJTDIJNKW6TYUAWK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HEEAPQVLKLHJTDIJNKW6TYUAWK/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-04T18:00:48Z","links":{"resolver":"https://pith.science/pith/HEEAPQVLKLHJTDIJNKW6TYUAWK","bundle":"https://pith.science/pith/HEEAPQVLKLHJTDIJNKW6TYUAWK/bundle.json","state":"https://pith.science/pith/HEEAPQVLKLHJTDIJNKW6TYUAWK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HEEAPQVLKLHJTDIJNKW6TYUAWK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:HEEAPQVLKLHJTDIJNKW6TYUAWK","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":"99a0145b6fd7c4130c13575f02c716ef23cf8ba813511a73e661afac390831cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-22T13:36:11Z","title_canon_sha256":"2f430bfba5212c4c3d7d38ae72f573ac8418d045b429288cf3a504311f802bd5"},"schema_version":"1.0","source":{"id":"1505.06070","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06070","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06070v2","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06070","created_at":"2026-05-18T00:53:21Z"},{"alias_kind":"pith_short_12","alias_value":"HEEAPQVLKLHJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"HEEAPQVLKLHJTDIJ","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"HEEAPQVL","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:1b6a0ede5d4879aee6dc6985d59ea452cdaf838e7595d9618152dab65d49e566","target":"graph","created_at":"2026-05-18T00:53:21Z","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 present global convergence rates for a line-search method which is based on random first-order models and directions whose quality is ensured only with certain probability. We show that in terms of the order of the accuracy, the evaluation complexity of such a method is the same as its counterparts that use deterministic accurate models; the use of probabilistic models only increases the complexity by a constant, which depends on the probability of the models being good. We particularize and improve these results in the convex and strongly convex case.\n  We also analyze a probabilistic cubi","authors_text":"Coralia Cartis, Katya Scheinberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-22T13:36:11Z","title":"Global convergence rate analysis of unconstrained optimization methods based on probabilistic models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06070","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:f5dc4c845b4e2135a0338e6f9e95d2ffaac485f2c4117906e2f52eb3123ca1d2","target":"record","created_at":"2026-05-18T00:53:21Z","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":"99a0145b6fd7c4130c13575f02c716ef23cf8ba813511a73e661afac390831cf","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-05-22T13:36:11Z","title_canon_sha256":"2f430bfba5212c4c3d7d38ae72f573ac8418d045b429288cf3a504311f802bd5"},"schema_version":"1.0","source":{"id":"1505.06070","kind":"arxiv","version":2}},"canonical_sha256":"390807c2ab52ce998d096aade9e280b29eb1e63b7d182701d0f77f71d07caf18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"390807c2ab52ce998d096aade9e280b29eb1e63b7d182701d0f77f71d07caf18","first_computed_at":"2026-05-18T00:53:21.141559Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:21.141559Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QlCiWyo6czueSJZnymbQnWA6WeAA53f8gXDYFNGm9cEabwJF9l3pq/Y/+49i0dTcuQGvbaFYatFkKf+BJSNzDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:21.142025Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06070","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f5dc4c845b4e2135a0338e6f9e95d2ffaac485f2c4117906e2f52eb3123ca1d2","sha256:1b6a0ede5d4879aee6dc6985d59ea452cdaf838e7595d9618152dab65d49e566"],"state_sha256":"4228dbf4eb92c60217068a88fd6136086b1f46695a8191af250eacf7544502a2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X0ChlGOSwQdsmnrcFB+MsW6rBn4iOtK+Y7vb1LbstiwcXDK4Y/iFTI/zr1HWo2yRCu9v1hKwYKv7vUyUHQpUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T18:00:48.153181Z","bundle_sha256":"9903dfe7eeccf949631d93c0d42539c7094ab52b170643fbdcc98ee90e1350bf"}}