{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:HAUZJB2ZZWOKFMADKLOJQSBSZY","short_pith_number":"pith:HAUZJB2Z","schema_version":"1.0","canonical_sha256":"3829948759cd9ca2b00352dc984832ce172dc326cfb34b66abff1187015b8e5e","source":{"kind":"arxiv","id":"1607.03195","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1607.03195","created_at":"2026-05-18T01:11:09.596979+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03195v1","created_at":"2026-05-18T01:11:09.596979+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03195","created_at":"2026-05-18T01:11:09.596979+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAUZJB2ZZWOK","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAUZJB2ZZWOKFMAD","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAUZJB2Z","created_at":"2026-05-18T12:30:19.053100+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1807.02811","citing_title":"A Tutorial on Bayesian Optimization","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY","json":"https://pith.science/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY.json","graph_json":"https://pith.science/api/pith-number/HAUZJB2ZZWOKFMADKLOJQSBSZY/graph.json","events_json":"https://pith.science/api/pith-number/HAUZJB2ZZWOKFMADKLOJQSBSZY/events.json","paper":"https://pith.science/paper/HAUZJB2Z"},"agent_actions":{"view_html":"https://pith.science/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY","download_json":"https://pith.science/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY.json","view_paper":"https://pith.science/paper/HAUZJB2Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03195&json=true","fetch_graph":"https://pith.science/api/pith-number/HAUZJB2ZZWOKFMADKLOJQSBSZY/graph.json","fetch_events":"https://pith.science/api/pith-number/HAUZJB2ZZWOKFMADKLOJQSBSZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY/action/storage_attestation","attest_author":"https://pith.science/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY/action/author_attestation","sign_citation":"https://pith.science/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY/action/citation_signature","submit_replication":"https://pith.science/pith/HAUZJB2ZZWOKFMADKLOJQSBSZY/action/replication_record"}},"created_at":"2026-05-18T01:11:09.596979+00:00","updated_at":"2026-05-18T01:11:09.596979+00:00"}