{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HAUZJB2ZZWOKFMADKLOJQSBSZY","short_pith_number":"pith:HAUZJB2Z","canonical_record":{"source":{"id":"1607.03195","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-11T23:09:52Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"948999a825192b457ebb3130c383a6026678aac01cd7ce8a7962bf05930eee9b","abstract_canon_sha256":"219a0f0f2024d99398a0a239061236f513e345cd5ab62b14abe750692dd73a8c"},"schema_version":"1.0"},"canonical_sha256":"3829948759cd9ca2b00352dc984832ce172dc326cfb34b66abff1187015b8e5e","source":{"kind":"arxiv","id":"1607.03195","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03195","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03195v1","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03195","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"HAUZJB2ZZWOK","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HAUZJB2ZZWOKFMAD","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HAUZJB2Z","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HAUZJB2ZZWOKFMADKLOJQSBSZY","target":"record","payload":{"canonical_record":{"source":{"id":"1607.03195","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-11T23:09:52Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"948999a825192b457ebb3130c383a6026678aac01cd7ce8a7962bf05930eee9b","abstract_canon_sha256":"219a0f0f2024d99398a0a239061236f513e345cd5ab62b14abe750692dd73a8c"},"schema_version":"1.0"},"canonical_sha256":"3829948759cd9ca2b00352dc984832ce172dc326cfb34b66abff1187015b8e5e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:09.597429Z","signature_b64":"Ra8x6ykREbiNyCGmW4OvDqV4EmdWec6/Wr8ay/9JlPbuv0Wb/CG1pSAJzBQUD/Uyt4j4I3dSNXxpvfIQPaE4Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3829948759cd9ca2b00352dc984832ce172dc326cfb34b66abff1187015b8e5e","last_reissued_at":"2026-05-18T01:11:09.596878Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:09.596878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.03195","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-18T01:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rq5QcNXrbyyujxbW3OTlGbpn42znTM6hf6nY9yRFkzaQ1WbyrFaZDz2p3FsqyPS5IBQ4vt296z0tmPjTT96JCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:23:47.528578Z"},"content_sha256":"5e4da627ed93d63b7a766a27547270be06bba60bb33abba76fa1fb4daf9b151b","schema_version":"1.0","event_id":"sha256:5e4da627ed93d63b7a766a27547270be06bba60bb33abba76fa1fb4daf9b151b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HAUZJB2ZZWOKFMADKLOJQSBSZY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Step Bayesian Optimization for One-Dimensional Feasibility Determination","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"math.OC","authors_text":"J. Massey Cashore, Lemuel Kumarga, Peter I. Frazier","submitted_at":"2016-07-11T23:09:52Z","abstract_excerpt":"Bayesian optimization methods allocate limited sampling budgets to maximize expensive-to-evaluate functions. One-step-lookahead policies are often used, but computing optimal multi-step-lookahead policies remains a challenge. We consider a specialized Bayesian optimization problem: finding the superlevel set of an expensive one-dimensional function, with a Markov process prior. We compute the Bayes-optimal sampling policy efficiently, and characterize the suboptimality of one-step lookahead. Our numerical experiments demonstrate that the one-step lookahead policy is close to optimal in this pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03195","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-18T01:11:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jn6rFkHTD7nPAThFh+6InpPLuQLNs1Qt1Shs+bhxZ9D+nQ3xJYtVm2hfj1XTWciQeUGPv9wvYidWglR+6qI5Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:23:47.529257Z"},"content_sha256":"2b0453128d6b249eefb855b6c0b24f67c5193a19d2559edfc72d4564748b5d65","schema_version":"1.0","event_id":"sha256:2b0453128d6b249eefb855b6c0b24f67c5193a19d2559edfc72d4564748b5d65"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY/bundle.json","state_url":"https://pith.science/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY/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-25T18:23:47Z","links":{"resolver":"https://pith.science/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY","bundle":"https://pith.science/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY/bundle.json","state":"https://pith.science/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HAUZJB2ZZWOKFMADKLOJQSBSZY","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":"219a0f0f2024d99398a0a239061236f513e345cd5ab62b14abe750692dd73a8c","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-11T23:09:52Z","title_canon_sha256":"948999a825192b457ebb3130c383a6026678aac01cd7ce8a7962bf05930eee9b"},"schema_version":"1.0","source":{"id":"1607.03195","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.03195","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"arxiv_version","alias_value":"1607.03195v1","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03195","created_at":"2026-05-18T01:11:09Z"},{"alias_kind":"pith_short_12","alias_value":"HAUZJB2ZZWOK","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HAUZJB2ZZWOKFMAD","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HAUZJB2Z","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:2b0453128d6b249eefb855b6c0b24f67c5193a19d2559edfc72d4564748b5d65","target":"graph","created_at":"2026-05-18T01:11:09Z","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":"Bayesian optimization methods allocate limited sampling budgets to maximize expensive-to-evaluate functions. One-step-lookahead policies are often used, but computing optimal multi-step-lookahead policies remains a challenge. We consider a specialized Bayesian optimization problem: finding the superlevel set of an expensive one-dimensional function, with a Markov process prior. We compute the Bayes-optimal sampling policy efficiently, and characterize the suboptimality of one-step lookahead. Our numerical experiments demonstrate that the one-step lookahead policy is close to optimal in this pr","authors_text":"J. Massey Cashore, Lemuel Kumarga, Peter I. Frazier","cross_cats":["cs.LG","stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-11T23:09:52Z","title":"Multi-Step Bayesian Optimization for One-Dimensional Feasibility Determination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03195","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:5e4da627ed93d63b7a766a27547270be06bba60bb33abba76fa1fb4daf9b151b","target":"record","created_at":"2026-05-18T01:11:09Z","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":"219a0f0f2024d99398a0a239061236f513e345cd5ab62b14abe750692dd73a8c","cross_cats_sorted":["cs.LG","stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-11T23:09:52Z","title_canon_sha256":"948999a825192b457ebb3130c383a6026678aac01cd7ce8a7962bf05930eee9b"},"schema_version":"1.0","source":{"id":"1607.03195","kind":"arxiv","version":1}},"canonical_sha256":"3829948759cd9ca2b00352dc984832ce172dc326cfb34b66abff1187015b8e5e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3829948759cd9ca2b00352dc984832ce172dc326cfb34b66abff1187015b8e5e","first_computed_at":"2026-05-18T01:11:09.596878Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:09.596878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ra8x6ykREbiNyCGmW4OvDqV4EmdWec6/Wr8ay/9JlPbuv0Wb/CG1pSAJzBQUD/Uyt4j4I3dSNXxpvfIQPaE4Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:09.597429Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.03195","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5e4da627ed93d63b7a766a27547270be06bba60bb33abba76fa1fb4daf9b151b","sha256:2b0453128d6b249eefb855b6c0b24f67c5193a19d2559edfc72d4564748b5d65"],"state_sha256":"5739bd298b98ea1a360e162eb06eb4d9be29131e8b847e5f62c467a49878ff67"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EmXfsYNpOhEYH4+pAy++uLMU4HyKfEv6HpOav9r3p5MkHWXiVSEl18DDTB2/dIhqPMCa1MPeJycS0e+MO7j6Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:23:47.532779Z","bundle_sha256":"e9d5f53dc0005a6e50d258fa6728a2bd5f798a729606dec5a11875b4691caeb9"}}