{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:VWSS6VV3TMNZDBQ5WBV6SP3Q3A","short_pith_number":"pith:VWSS6VV3","schema_version":"1.0","canonical_sha256":"ada52f56bb9b1b91861db06be93f70d80a9923a6ba5485bca1294bccf241c173","source":{"kind":"arxiv","id":"1009.5419","version":2},"attestation_state":"computed","paper":{"title":"Portfolio Allocation for Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eric Brochu, Matthew W. Hoffman, Nando de Freitas","submitted_at":"2010-09-28T00:41:45Z","abstract_excerpt":"Bayesian optimization with Gaussian processes has become an increasingly popular tool in the machine learning community. It is efficient and can be used when very little is known about the objective function, making it popular in expensive black-box optimization scenarios. It uses Bayesian methods to sample the objective efficiently using an acquisition function which incorporates the model's estimate of the objective and the uncertainty at any given point. However, there are several different parameterized acquisition functions in the literature, and it is often unclear which one to use. Inst"},"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":"1009.5419","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2010-09-28T00:41:45Z","cross_cats_sorted":[],"title_canon_sha256":"2ef783065e21c3588596aa0474096c864eac0c849f36f9b693e000828034e3da","abstract_canon_sha256":"7680eed45cbee803181adbad756eb6f3e8d2ee362b99023bfd54dc020c691d2c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:27:17.794210Z","signature_b64":"a90lic0xjIJGsHxgc9/ZRw94U2YwDo2hHzQA9I36AUF36KhNU6Y4kV/ZXGZw6cFuwTiBwAnMR84h+/j1BlmRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ada52f56bb9b1b91861db06be93f70d80a9923a6ba5485bca1294bccf241c173","last_reissued_at":"2026-05-18T04:27:17.793491Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:27:17.793491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Portfolio Allocation for Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eric Brochu, Matthew W. Hoffman, Nando de Freitas","submitted_at":"2010-09-28T00:41:45Z","abstract_excerpt":"Bayesian optimization with Gaussian processes has become an increasingly popular tool in the machine learning community. It is efficient and can be used when very little is known about the objective function, making it popular in expensive black-box optimization scenarios. It uses Bayesian methods to sample the objective efficiently using an acquisition function which incorporates the model's estimate of the objective and the uncertainty at any given point. However, there are several different parameterized acquisition functions in the literature, and it is often unclear which one to use. Inst"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.5419","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1009.5419","created_at":"2026-05-18T04:27:17.793606+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.5419v2","created_at":"2026-05-18T04:27:17.793606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.5419","created_at":"2026-05-18T04:27:17.793606+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWSS6VV3TMNZ","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWSS6VV3TMNZDBQ5","created_at":"2026-05-18T12:26:15.391820+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWSS6VV3","created_at":"2026-05-18T12:26:15.391820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.10856","citing_title":"Improving search efficiency via adaptive acquisition function selection in discrete black-box optimization","ref_index":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/VWSS6VV3TMNZDBQ5WBV6SP3Q3A","json":"https://pith.science/pith/VWSS6VV3TMNZDBQ5WBV6SP3Q3A.json","graph_json":"https://pith.science/api/pith-number/VWSS6VV3TMNZDBQ5WBV6SP3Q3A/graph.json","events_json":"https://pith.science/api/pith-number/VWSS6VV3TMNZDBQ5WBV6SP3Q3A/events.json","paper":"https://pith.science/paper/VWSS6VV3"},"agent_actions":{"view_html":"https://pith.science/pith/VWSS6VV3TMNZDBQ5WBV6SP3Q3A","download_json":"https://pith.science/pith/VWSS6VV3TMNZDBQ5WBV6SP3Q3A.json","view_paper":"https://pith.science/paper/VWSS6VV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.5419&json=true","fetch_graph":"https://pith.science/api/pith-number/VWSS6VV3TMNZDBQ5WBV6SP3Q3A/graph.json","fetch_events":"https://pith.science/api/pith-number/VWSS6VV3TMNZDBQ5WBV6SP3Q3A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWSS6VV3TMNZDBQ5WBV6SP3Q3A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWSS6VV3TMNZDBQ5WBV6SP3Q3A/action/storage_attestation","attest_author":"https://pith.science/pith/VWSS6VV3TMNZDBQ5WBV6SP3Q3A/action/author_attestation","sign_citation":"https://pith.science/pith/VWSS6VV3TMNZDBQ5WBV6SP3Q3A/action/citation_signature","submit_replication":"https://pith.science/pith/VWSS6VV3TMNZDBQ5WBV6SP3Q3A/action/replication_record"}},"created_at":"2026-05-18T04:27:17.793606+00:00","updated_at":"2026-05-18T04:27:17.793606+00:00"}