{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JA3OK5YC5O6YNQURGQPPX6IXE4","short_pith_number":"pith:JA3OK5YC","schema_version":"1.0","canonical_sha256":"4836e57702ebbd86c291341efbf9172700c209ae59847f06ef74607311c15b19","source":{"kind":"arxiv","id":"1402.7005","version":1},"attestation_state":"computed","paper":{"title":"Bayesian Multi-Scale Optimistic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Babak Shakibi, Lin Jin, Nando de Freitas, Ziyu Wang","submitted_at":"2014-02-27T18:38:02Z","abstract_excerpt":"Bayesian optimization is a powerful global optimization technique for expensive black-box functions. One of its shortcomings is that it requires auxiliary optimization of an acquisition function at each iteration. This auxiliary optimization can be costly and very hard to carry out in practice. Moreover, it creates serious theoretical concerns, as most of the convergence results assume that the exact optimum of the acquisition function can be found. In this paper, we introduce a new technique for efficient global optimization that combines Gaussian process confidence bounds and treed simultane"},"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":"1402.7005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-02-27T18:38:02Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ad759030469649ea9081359a08193fe810ffecdf468ffaaf8b9579e751635c90","abstract_canon_sha256":"6f409cbf90bca102275eb9fce0f9215ae5dbd5162f6b4a952e36587b84a6be72"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:36.431434Z","signature_b64":"6+zJTNOWRcKrmnK6wwINMdJMsw4tn4jQi2Lt7QJ689Gx8C6888x0YnzzudIK5+WAkuDRQJdcZhSxt1X2x0CCAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4836e57702ebbd86c291341efbf9172700c209ae59847f06ef74607311c15b19","last_reissued_at":"2026-05-18T02:57:36.430771Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:36.430771Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bayesian Multi-Scale Optimistic Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Babak Shakibi, Lin Jin, Nando de Freitas, Ziyu Wang","submitted_at":"2014-02-27T18:38:02Z","abstract_excerpt":"Bayesian optimization is a powerful global optimization technique for expensive black-box functions. One of its shortcomings is that it requires auxiliary optimization of an acquisition function at each iteration. This auxiliary optimization can be costly and very hard to carry out in practice. Moreover, it creates serious theoretical concerns, as most of the convergence results assume that the exact optimum of the acquisition function can be found. In this paper, we introduce a new technique for efficient global optimization that combines Gaussian process confidence bounds and treed simultane"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.7005","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":"1402.7005","created_at":"2026-05-18T02:57:36.430870+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.7005v1","created_at":"2026-05-18T02:57:36.430870+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.7005","created_at":"2026-05-18T02:57:36.430870+00:00"},{"alias_kind":"pith_short_12","alias_value":"JA3OK5YC5O6Y","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JA3OK5YC5O6YNQUR","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JA3OK5YC","created_at":"2026-05-18T12:28:33.132498+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.19672","citing_title":"Budgeted Online Influence Maximization","ref_index":66,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JA3OK5YC5O6YNQURGQPPX6IXE4","json":"https://pith.science/pith/JA3OK5YC5O6YNQURGQPPX6IXE4.json","graph_json":"https://pith.science/api/pith-number/JA3OK5YC5O6YNQURGQPPX6IXE4/graph.json","events_json":"https://pith.science/api/pith-number/JA3OK5YC5O6YNQURGQPPX6IXE4/events.json","paper":"https://pith.science/paper/JA3OK5YC"},"agent_actions":{"view_html":"https://pith.science/pith/JA3OK5YC5O6YNQURGQPPX6IXE4","download_json":"https://pith.science/pith/JA3OK5YC5O6YNQURGQPPX6IXE4.json","view_paper":"https://pith.science/paper/JA3OK5YC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.7005&json=true","fetch_graph":"https://pith.science/api/pith-number/JA3OK5YC5O6YNQURGQPPX6IXE4/graph.json","fetch_events":"https://pith.science/api/pith-number/JA3OK5YC5O6YNQURGQPPX6IXE4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JA3OK5YC5O6YNQURGQPPX6IXE4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JA3OK5YC5O6YNQURGQPPX6IXE4/action/storage_attestation","attest_author":"https://pith.science/pith/JA3OK5YC5O6YNQURGQPPX6IXE4/action/author_attestation","sign_citation":"https://pith.science/pith/JA3OK5YC5O6YNQURGQPPX6IXE4/action/citation_signature","submit_replication":"https://pith.science/pith/JA3OK5YC5O6YNQURGQPPX6IXE4/action/replication_record"}},"created_at":"2026-05-18T02:57:36.430870+00:00","updated_at":"2026-05-18T02:57:36.430870+00:00"}