{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4OMZGFQURVAZI62D2E6LT4VPVY","short_pith_number":"pith:4OMZGFQU","schema_version":"1.0","canonical_sha256":"e3999316148d41947b43d13cb9f2afae3e3c35bbc4ef43262e70582fbe32e7e9","source":{"kind":"arxiv","id":"1202.5597","version":3},"attestation_state":"computed","paper":{"title":"Hybrid Batch Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Ali Jalali, Javad Azimi, Xiaoli Fern","submitted_at":"2012-02-25T02:00:51Z","abstract_excerpt":"Bayesian Optimization aims at optimizing an unknown non-convex/concave function that is costly to evaluate. We are interested in application scenarios where concurrent function evaluations are possible. Under such a setting, BO could choose to either sequentially evaluate the function, one input at a time and wait for the output of the function before making the next selection, or evaluate the function at a batch of multiple inputs at once. These two different settings are commonly referred to as the sequential and batch settings of Bayesian Optimization. In general, the sequential setting lea"},"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":"1202.5597","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-02-25T02:00:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"87ffdf304d4608159178fe9d0f70c240a190a144af6a3b133b39cd0a633e0e45","abstract_canon_sha256":"55d2721e49161875a8e63113b1a8fcfc4abb371f6ee172d9af5aba703313dd74"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:36.127968Z","signature_b64":"6sWshPEH9LGmC6QMHh2gRjgNhDACeEkepRTqrYMP57A7ojKBBXsGyw8PzBPrxBhQOnxMBOzSwbzyDKaJqzufBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3999316148d41947b43d13cb9f2afae3e3c35bbc4ef43262e70582fbe32e7e9","last_reissued_at":"2026-05-18T03:56:36.127475Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:36.127475Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hybrid Batch Bayesian Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.AI","authors_text":"Ali Jalali, Javad Azimi, Xiaoli Fern","submitted_at":"2012-02-25T02:00:51Z","abstract_excerpt":"Bayesian Optimization aims at optimizing an unknown non-convex/concave function that is costly to evaluate. We are interested in application scenarios where concurrent function evaluations are possible. Under such a setting, BO could choose to either sequentially evaluate the function, one input at a time and wait for the output of the function before making the next selection, or evaluate the function at a batch of multiple inputs at once. These two different settings are commonly referred to as the sequential and batch settings of Bayesian Optimization. In general, the sequential setting lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.5597","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":"1202.5597","created_at":"2026-05-18T03:56:36.127540+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.5597v3","created_at":"2026-05-18T03:56:36.127540+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.5597","created_at":"2026-05-18T03:56:36.127540+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OMZGFQURVAZ","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OMZGFQURVAZI62D","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OMZGFQU","created_at":"2026-05-18T12:26:53.410803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.07775","citing_title":"POETS: Uncertainty-Aware LLM Optimization via Compute-Efficient Policy Ensembles","ref_index":108,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07863","citing_title":"ADKO: Agentic Decentralized Knowledge Optimization","ref_index":21,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4OMZGFQURVAZI62D2E6LT4VPVY","json":"https://pith.science/pith/4OMZGFQURVAZI62D2E6LT4VPVY.json","graph_json":"https://pith.science/api/pith-number/4OMZGFQURVAZI62D2E6LT4VPVY/graph.json","events_json":"https://pith.science/api/pith-number/4OMZGFQURVAZI62D2E6LT4VPVY/events.json","paper":"https://pith.science/paper/4OMZGFQU"},"agent_actions":{"view_html":"https://pith.science/pith/4OMZGFQURVAZI62D2E6LT4VPVY","download_json":"https://pith.science/pith/4OMZGFQURVAZI62D2E6LT4VPVY.json","view_paper":"https://pith.science/paper/4OMZGFQU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.5597&json=true","fetch_graph":"https://pith.science/api/pith-number/4OMZGFQURVAZI62D2E6LT4VPVY/graph.json","fetch_events":"https://pith.science/api/pith-number/4OMZGFQURVAZI62D2E6LT4VPVY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OMZGFQURVAZI62D2E6LT4VPVY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OMZGFQURVAZI62D2E6LT4VPVY/action/storage_attestation","attest_author":"https://pith.science/pith/4OMZGFQURVAZI62D2E6LT4VPVY/action/author_attestation","sign_citation":"https://pith.science/pith/4OMZGFQURVAZI62D2E6LT4VPVY/action/citation_signature","submit_replication":"https://pith.science/pith/4OMZGFQURVAZI62D2E6LT4VPVY/action/replication_record"}},"created_at":"2026-05-18T03:56:36.127540+00:00","updated_at":"2026-05-18T03:56:36.127540+00:00"}