{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NBCYAK3TD3G6VEF73SAPKTQ6I4","short_pith_number":"pith:NBCYAK3T","schema_version":"1.0","canonical_sha256":"6845802b731ecdea90bfdc80f54e1e4709be430c294198cb79cc259cb5ec756a","source":{"kind":"arxiv","id":"1604.00169","version":3},"attestation_state":"computed","paper":{"title":"A sequential Monte Carlo approach to Thompson sampling for Bayesian optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"stat.ML","authors_text":"Hildo Bijl, Jan-Willem van Wingerden, Michel Verhaegen, Thomas B. Sch\\\"on","submitted_at":"2016-04-01T09:07:26Z","abstract_excerpt":"Bayesian optimization through Gaussian process regression is an effective method of optimizing an unknown function for which every measurement is expensive. It approximates the objective function and then recommends a new measurement point to try out. This recommendation is usually selected by optimizing a given acquisition function. After a sufficient number of measurements, a recommendation about the maximum is made. However, a key realization is that the maximum of a Gaussian process is not a deterministic point, but a random variable with a distribution of its own. This distribution cannot"},"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":"1604.00169","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-04-01T09:07:26Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"ebddd13a9dc1e9e75185523e241ae54730606f93d6b165460502bf94feda4e02","abstract_canon_sha256":"ef5ccdf10b6a588f8119b13805648c5f41313cfa2f038a868a3746e3c17ac8bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:24.810521Z","signature_b64":"Y6zsI+uYcdsXQ1I1Ec3mz3mA1AWgHrimfcXRzD1u1ZRKe+9QcMzAle+5p6tMQStoKT7gffX62VnJdyFa7TwhCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6845802b731ecdea90bfdc80f54e1e4709be430c294198cb79cc259cb5ec756a","last_reissued_at":"2026-05-18T00:44:24.809975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:24.809975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sequential Monte Carlo approach to Thompson sampling for Bayesian optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"stat.ML","authors_text":"Hildo Bijl, Jan-Willem van Wingerden, Michel Verhaegen, Thomas B. Sch\\\"on","submitted_at":"2016-04-01T09:07:26Z","abstract_excerpt":"Bayesian optimization through Gaussian process regression is an effective method of optimizing an unknown function for which every measurement is expensive. It approximates the objective function and then recommends a new measurement point to try out. This recommendation is usually selected by optimizing a given acquisition function. After a sufficient number of measurements, a recommendation about the maximum is made. However, a key realization is that the maximum of a Gaussian process is not a deterministic point, but a random variable with a distribution of its own. This distribution cannot"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.00169","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.00169","created_at":"2026-05-18T00:44:24.810070+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.00169v3","created_at":"2026-05-18T00:44:24.810070+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.00169","created_at":"2026-05-18T00:44:24.810070+00:00"},{"alias_kind":"pith_short_12","alias_value":"NBCYAK3TD3G6","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NBCYAK3TD3G6VEF7","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NBCYAK3T","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.08208","citing_title":"Exploring Exploration in Bayesian Optimization","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NBCYAK3TD3G6VEF73SAPKTQ6I4","json":"https://pith.science/pith/NBCYAK3TD3G6VEF73SAPKTQ6I4.json","graph_json":"https://pith.science/api/pith-number/NBCYAK3TD3G6VEF73SAPKTQ6I4/graph.json","events_json":"https://pith.science/api/pith-number/NBCYAK3TD3G6VEF73SAPKTQ6I4/events.json","paper":"https://pith.science/paper/NBCYAK3T"},"agent_actions":{"view_html":"https://pith.science/pith/NBCYAK3TD3G6VEF73SAPKTQ6I4","download_json":"https://pith.science/pith/NBCYAK3TD3G6VEF73SAPKTQ6I4.json","view_paper":"https://pith.science/paper/NBCYAK3T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.00169&json=true","fetch_graph":"https://pith.science/api/pith-number/NBCYAK3TD3G6VEF73SAPKTQ6I4/graph.json","fetch_events":"https://pith.science/api/pith-number/NBCYAK3TD3G6VEF73SAPKTQ6I4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NBCYAK3TD3G6VEF73SAPKTQ6I4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NBCYAK3TD3G6VEF73SAPKTQ6I4/action/storage_attestation","attest_author":"https://pith.science/pith/NBCYAK3TD3G6VEF73SAPKTQ6I4/action/author_attestation","sign_citation":"https://pith.science/pith/NBCYAK3TD3G6VEF73SAPKTQ6I4/action/citation_signature","submit_replication":"https://pith.science/pith/NBCYAK3TD3G6VEF73SAPKTQ6I4/action/replication_record"}},"created_at":"2026-05-18T00:44:24.810070+00:00","updated_at":"2026-05-18T00:44:24.810070+00:00"}