{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PM6OIRGHHGDUPIQQLHSGZDQ6J3","short_pith_number":"pith:PM6OIRGH","schema_version":"1.0","canonical_sha256":"7b3ce444c7398747a21059e46c8e1e4ee3cdcc87c96dd1ea7bed6a179da1c988","source":{"kind":"arxiv","id":"2505.23913","version":1},"attestation_state":"computed","paper":{"title":"Simplifying Bayesian Optimization Via In-Context Direct Optimum Sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Agustinus Kristiadi, Gustavo Sutter Pessurno de Carvalho, Hao Wang, Lawrence Wan, Luis Ricardez-Sandoval, Marc St-Aubin, Mohammed Abdulrahman, Pascal Poupart, Sharon O'Sullivan, Sriram Ganapathi Subramanian","submitted_at":"2025-05-29T18:07:36Z","abstract_excerpt":"The optimization of expensive black-box functions is ubiquitous in science and engineering. A common solution to this problem is Bayesian optimization (BO), which is generally comprised of two components: (i) a surrogate model and (ii) an acquisition function, which generally require expensive re-training and optimization steps at each iteration, respectively. Although recent work enabled in-context surrogate models that do not require re-training, virtually all existing BO methods still require acquisition function maximization to select the next observation, which introduces many knobs to tu"},"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":"2505.23913","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-29T18:07:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8fe329f767148304c02dbc85236f947ecd2bc46a468b8d02aecd950e2e0ce53a","abstract_canon_sha256":"fbe00f7fea850d4c7ec57355494c6eeb7ef3574829d5a96d16c6129fc7d22a9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:12:37.666087Z","signature_b64":"7E9Hx8aB56McPjUFdqyKBGZevMPNJf0py/zZ/H4a+7blIc0DNhIYR3fcOkN9Uw6EmW69SWzWnD8hxbdogHbADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b3ce444c7398747a21059e46c8e1e4ee3cdcc87c96dd1ea7bed6a179da1c988","last_reissued_at":"2026-07-05T11:12:37.664876Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:12:37.664876Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Simplifying Bayesian Optimization Via In-Context Direct Optimum Sampling","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Agustinus Kristiadi, Gustavo Sutter Pessurno de Carvalho, Hao Wang, Lawrence Wan, Luis Ricardez-Sandoval, Marc St-Aubin, Mohammed Abdulrahman, Pascal Poupart, Sharon O'Sullivan, Sriram Ganapathi Subramanian","submitted_at":"2025-05-29T18:07:36Z","abstract_excerpt":"The optimization of expensive black-box functions is ubiquitous in science and engineering. A common solution to this problem is Bayesian optimization (BO), which is generally comprised of two components: (i) a surrogate model and (ii) an acquisition function, which generally require expensive re-training and optimization steps at each iteration, respectively. Although recent work enabled in-context surrogate models that do not require re-training, virtually all existing BO methods still require acquisition function maximization to select the next observation, which introduces many knobs to tu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.23913","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.23913/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.23913","created_at":"2026-07-05T11:12:37.665576+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.23913v1","created_at":"2026-07-05T11:12:37.665576+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.23913","created_at":"2026-07-05T11:12:37.665576+00:00"},{"alias_kind":"pith_short_12","alias_value":"PM6OIRGHHGDU","created_at":"2026-07-05T11:12:37.665576+00:00"},{"alias_kind":"pith_short_16","alias_value":"PM6OIRGHHGDUPIQQ","created_at":"2026-07-05T11:12:37.665576+00:00"},{"alias_kind":"pith_short_8","alias_value":"PM6OIRGH","created_at":"2026-07-05T11:12:37.665576+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07775","citing_title":"POETS: Uncertainty-Aware LLM Optimization via Compute-Efficient Policy Ensembles","ref_index":106,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PM6OIRGHHGDUPIQQLHSGZDQ6J3","json":"https://pith.science/pith/PM6OIRGHHGDUPIQQLHSGZDQ6J3.json","graph_json":"https://pith.science/api/pith-number/PM6OIRGHHGDUPIQQLHSGZDQ6J3/graph.json","events_json":"https://pith.science/api/pith-number/PM6OIRGHHGDUPIQQLHSGZDQ6J3/events.json","paper":"https://pith.science/paper/PM6OIRGH"},"agent_actions":{"view_html":"https://pith.science/pith/PM6OIRGHHGDUPIQQLHSGZDQ6J3","download_json":"https://pith.science/pith/PM6OIRGHHGDUPIQQLHSGZDQ6J3.json","view_paper":"https://pith.science/paper/PM6OIRGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.23913&json=true","fetch_graph":"https://pith.science/api/pith-number/PM6OIRGHHGDUPIQQLHSGZDQ6J3/graph.json","fetch_events":"https://pith.science/api/pith-number/PM6OIRGHHGDUPIQQLHSGZDQ6J3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PM6OIRGHHGDUPIQQLHSGZDQ6J3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PM6OIRGHHGDUPIQQLHSGZDQ6J3/action/storage_attestation","attest_author":"https://pith.science/pith/PM6OIRGHHGDUPIQQLHSGZDQ6J3/action/author_attestation","sign_citation":"https://pith.science/pith/PM6OIRGHHGDUPIQQLHSGZDQ6J3/action/citation_signature","submit_replication":"https://pith.science/pith/PM6OIRGHHGDUPIQQLHSGZDQ6J3/action/replication_record"}},"created_at":"2026-07-05T11:12:37.665576+00:00","updated_at":"2026-07-05T11:12:37.665576+00:00"}