{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:F7TLSLOT7CIWMYYXOO6WC3TR3L","short_pith_number":"pith:F7TLSLOT","canonical_record":{"source":{"id":"1304.5350","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-19T09:11:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"101a242a06ab50b7ed3801ef49bff43851310217b9598774bbd9aeb46d74fd93","abstract_canon_sha256":"ccec8c068299bf9868c14cf895eb7fff14d4b95022ca88649e5aed04ad51d114"},"schema_version":"1.0"},"canonical_sha256":"2fe6b92dd3f89166631773bd616e71dacfe57aa23dc5c922b4fb6b63aca965f1","source":{"kind":"arxiv","id":"1304.5350","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5350","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5350v3","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5350","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"F7TLSLOT7CIW","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"F7TLSLOT7CIWMYYX","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"F7TLSLOT","created_at":"2026-05-18T12:27:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:F7TLSLOT7CIWMYYXOO6WC3TR3L","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5350","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-19T09:11:34Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"101a242a06ab50b7ed3801ef49bff43851310217b9598774bbd9aeb46d74fd93","abstract_canon_sha256":"ccec8c068299bf9868c14cf895eb7fff14d4b95022ca88649e5aed04ad51d114"},"schema_version":"1.0"},"canonical_sha256":"2fe6b92dd3f89166631773bd616e71dacfe57aa23dc5c922b4fb6b63aca965f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:27.905452Z","signature_b64":"UvCaHY4at0UvJVpp9pU/VDr1Y5JpXVnh0qGtQgqDlk4LH1gQ+THfkRABTutYAByvV6hkUUipU6yfaisO37F9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fe6b92dd3f89166631773bd616e71dacfe57aa23dc5c922b4fb6b63aca965f1","last_reissued_at":"2026-05-18T03:14:27.904949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:27.904949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5350","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yz5WYnK9gyX1tOM8cXMbFVNptVFL31eYjLd+cY+4XxEy41nikdSqw9hBZid2rloDqdFMGigpracSAuTyoQCACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:23:33.951446Z"},"content_sha256":"1ff6bbf5b71ee58d285eb87e3774dbb173466463b7b5c132d607bb713219cd24","schema_version":"1.0","event_id":"sha256:1ff6bbf5b71ee58d285eb87e3774dbb173466463b7b5c132d607bb713219cd24"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:F7TLSLOT7CIWMYYXOO6WC3TR3L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Parallel Gaussian Process Optimization with Upper Confidence Bound and Pure Exploration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexandre Robicquet, David Buffoni, Emile Contal, Nicolas Vayatis","submitted_at":"2013-04-19T09:11:34Z","abstract_excerpt":"In this paper, we consider the challenge of maximizing an unknown function f for which evaluations are noisy and are acquired with high cost. An iterative procedure uses the previous measures to actively select the next estimation of f which is predicted to be the most useful. We focus on the case where the function can be evaluated in parallel with batches of fixed size and analyze the benefit compared to the purely sequential procedure in terms of cumulative regret. We introduce the Gaussian Process Upper Confidence Bound and Pure Exploration algorithm (GP-UCB-PE) which combines the UCB stra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5350","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:14:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UgdMxqC4BbqCQQj0cdZjmqyMIK50+yWJlGCicM1J0f6PxGmEZxpqTReToYsh/XK1lSLHf5mYa4fplkNnHPIlAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:23:33.951824Z"},"content_sha256":"58e6bbb2f39ad16557a2da7c66273b1c3a3da3e7de7881aa4f09cccd18d0ea1a","schema_version":"1.0","event_id":"sha256:58e6bbb2f39ad16557a2da7c66273b1c3a3da3e7de7881aa4f09cccd18d0ea1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F7TLSLOT7CIWMYYXOO6WC3TR3L/bundle.json","state_url":"https://pith.science/pith/F7TLSLOT7CIWMYYXOO6WC3TR3L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F7TLSLOT7CIWMYYXOO6WC3TR3L/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T23:23:33Z","links":{"resolver":"https://pith.science/pith/F7TLSLOT7CIWMYYXOO6WC3TR3L","bundle":"https://pith.science/pith/F7TLSLOT7CIWMYYXOO6WC3TR3L/bundle.json","state":"https://pith.science/pith/F7TLSLOT7CIWMYYXOO6WC3TR3L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F7TLSLOT7CIWMYYXOO6WC3TR3L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:F7TLSLOT7CIWMYYXOO6WC3TR3L","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ccec8c068299bf9868c14cf895eb7fff14d4b95022ca88649e5aed04ad51d114","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-19T09:11:34Z","title_canon_sha256":"101a242a06ab50b7ed3801ef49bff43851310217b9598774bbd9aeb46d74fd93"},"schema_version":"1.0","source":{"id":"1304.5350","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5350","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5350v3","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5350","created_at":"2026-05-18T03:14:27Z"},{"alias_kind":"pith_short_12","alias_value":"F7TLSLOT7CIW","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_16","alias_value":"F7TLSLOT7CIWMYYX","created_at":"2026-05-18T12:27:45Z"},{"alias_kind":"pith_short_8","alias_value":"F7TLSLOT","created_at":"2026-05-18T12:27:45Z"}],"graph_snapshots":[{"event_id":"sha256:58e6bbb2f39ad16557a2da7c66273b1c3a3da3e7de7881aa4f09cccd18d0ea1a","target":"graph","created_at":"2026-05-18T03:14:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we consider the challenge of maximizing an unknown function f for which evaluations are noisy and are acquired with high cost. An iterative procedure uses the previous measures to actively select the next estimation of f which is predicted to be the most useful. We focus on the case where the function can be evaluated in parallel with batches of fixed size and analyze the benefit compared to the purely sequential procedure in terms of cumulative regret. We introduce the Gaussian Process Upper Confidence Bound and Pure Exploration algorithm (GP-UCB-PE) which combines the UCB stra","authors_text":"Alexandre Robicquet, David Buffoni, Emile Contal, Nicolas Vayatis","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-19T09:11:34Z","title":"Parallel Gaussian Process Optimization with Upper Confidence Bound and Pure Exploration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5350","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1ff6bbf5b71ee58d285eb87e3774dbb173466463b7b5c132d607bb713219cd24","target":"record","created_at":"2026-05-18T03:14:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ccec8c068299bf9868c14cf895eb7fff14d4b95022ca88649e5aed04ad51d114","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-04-19T09:11:34Z","title_canon_sha256":"101a242a06ab50b7ed3801ef49bff43851310217b9598774bbd9aeb46d74fd93"},"schema_version":"1.0","source":{"id":"1304.5350","kind":"arxiv","version":3}},"canonical_sha256":"2fe6b92dd3f89166631773bd616e71dacfe57aa23dc5c922b4fb6b63aca965f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fe6b92dd3f89166631773bd616e71dacfe57aa23dc5c922b4fb6b63aca965f1","first_computed_at":"2026-05-18T03:14:27.904949Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:27.904949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UvCaHY4at0UvJVpp9pU/VDr1Y5JpXVnh0qGtQgqDlk4LH1gQ+THfkRABTutYAByvV6hkUUipU6yfaisO37F9Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:27.905452Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5350","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1ff6bbf5b71ee58d285eb87e3774dbb173466463b7b5c132d607bb713219cd24","sha256:58e6bbb2f39ad16557a2da7c66273b1c3a3da3e7de7881aa4f09cccd18d0ea1a"],"state_sha256":"c55bca6030629398a6f96157d04ed7efdb863c173f560a25ea14cdde11d42863"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AT7xmSstcFJ+z661R/oN30rWLIHR5yN6YIxSpFQHQuo4Ea2zU9ZlmieDnr9h0EXlh+ZwzBTTcy7y0w69Er1WCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:23:33.955250Z","bundle_sha256":"dedd48b8485f1659ee4737fff44f852a06e73bbb23bfacad81285119635be1df"}}