{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:UGJJQVVGLM2KAPUN6GKGF42U6E","short_pith_number":"pith:UGJJQVVG","schema_version":"1.0","canonical_sha256":"a1929856a65b34a03e8df19462f354f136bea2dd65975a514a2522385d85de05","source":{"kind":"arxiv","id":"2502.08208","version":1},"attestation_state":"computed","paper":{"title":"Exploring Exploration in Bayesian Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Leonard Papenmeier, Luigi Nardi, Nuojin Cheng, Stephen Becker","submitted_at":"2025-02-12T08:38:37Z","abstract_excerpt":"A well-balanced exploration-exploitation trade-off is crucial for successful acquisition functions in Bayesian optimization. However, there is a lack of quantitative measures for exploration, making it difficult to analyze and compare different acquisition functions. This work introduces two novel approaches - observation traveling salesman distance and observation entropy - to quantify the exploration characteristics of acquisition functions based on their selected observations. Using these measures, we examine the explorative nature of several well-known acquisition functions across a divers"},"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":"2502.08208","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-12T08:38:37Z","cross_cats_sorted":[],"title_canon_sha256":"9d04efa3a105f637caf0283103c0304482f88a6dfad15224e548450e947c3047","abstract_canon_sha256":"610df38ba8c0a687d79299a8ff48fbf3747ebd4c1592ef17fab545ac16bc8e0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:01.517812Z","signature_b64":"vZYeIhDPrmgo3R1tz3scsFwxKvXyCPGM24SlKfv1RFDi9JVeiqOdur+tt+8P4Cf3sCh+XxybvLqio5zZcHzJBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1929856a65b34a03e8df19462f354f136bea2dd65975a514a2522385d85de05","last_reissued_at":"2026-05-17T23:39:01.517096Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:01.517096Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Exploration in Bayesian Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Leonard Papenmeier, Luigi Nardi, Nuojin Cheng, Stephen Becker","submitted_at":"2025-02-12T08:38:37Z","abstract_excerpt":"A well-balanced exploration-exploitation trade-off is crucial for successful acquisition functions in Bayesian optimization. However, there is a lack of quantitative measures for exploration, making it difficult to analyze and compare different acquisition functions. This work introduces two novel approaches - observation traveling salesman distance and observation entropy - to quantify the exploration characteristics of acquisition functions based on their selected observations. Using these measures, we examine the explorative nature of several well-known acquisition functions across a divers"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.08208","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":"2502.08208","created_at":"2026-05-17T23:39:01.517250+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.08208v1","created_at":"2026-05-17T23:39:01.517250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.08208","created_at":"2026-05-17T23:39:01.517250+00:00"},{"alias_kind":"pith_short_12","alias_value":"UGJJQVVGLM2K","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"UGJJQVVGLM2KAPUN","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"UGJJQVVG","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09198","citing_title":"Understanding High-Dimensional Bayesian Optimization","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UGJJQVVGLM2KAPUN6GKGF42U6E","json":"https://pith.science/pith/UGJJQVVGLM2KAPUN6GKGF42U6E.json","graph_json":"https://pith.science/api/pith-number/UGJJQVVGLM2KAPUN6GKGF42U6E/graph.json","events_json":"https://pith.science/api/pith-number/UGJJQVVGLM2KAPUN6GKGF42U6E/events.json","paper":"https://pith.science/paper/UGJJQVVG"},"agent_actions":{"view_html":"https://pith.science/pith/UGJJQVVGLM2KAPUN6GKGF42U6E","download_json":"https://pith.science/pith/UGJJQVVGLM2KAPUN6GKGF42U6E.json","view_paper":"https://pith.science/paper/UGJJQVVG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.08208&json=true","fetch_graph":"https://pith.science/api/pith-number/UGJJQVVGLM2KAPUN6GKGF42U6E/graph.json","fetch_events":"https://pith.science/api/pith-number/UGJJQVVGLM2KAPUN6GKGF42U6E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UGJJQVVGLM2KAPUN6GKGF42U6E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UGJJQVVGLM2KAPUN6GKGF42U6E/action/storage_attestation","attest_author":"https://pith.science/pith/UGJJQVVGLM2KAPUN6GKGF42U6E/action/author_attestation","sign_citation":"https://pith.science/pith/UGJJQVVGLM2KAPUN6GKGF42U6E/action/citation_signature","submit_replication":"https://pith.science/pith/UGJJQVVGLM2KAPUN6GKGF42U6E/action/replication_record"}},"created_at":"2026-05-17T23:39:01.517250+00:00","updated_at":"2026-05-17T23:39:01.517250+00:00"}