{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CELFT6G6QOSZU5JZFTZ3PKWBD4","short_pith_number":"pith:CELFT6G6","canonical_record":{"source":{"id":"1705.10033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-29T04:02:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"815efe3bc84a7c3ed4fa2174084dca270b027495c22676fdfe493b3fffdfa74a","abstract_canon_sha256":"f678fb2d0d299c6fcd2fbf82cf7df08083af566d0b992ca765d620a34a116e96"},"schema_version":"1.0"},"canonical_sha256":"111659f8de83a59a75392cf3b7aac11f010b60a0a61e3e4628378c29873d25cb","source":{"kind":"arxiv","id":"1705.10033","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10033","created_at":"2026-05-18T00:43:32Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10033v1","created_at":"2026-05-18T00:43:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10033","created_at":"2026-05-18T00:43:32Z"},{"alias_kind":"pith_short_12","alias_value":"CELFT6G6QOSZ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CELFT6G6QOSZU5JZ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CELFT6G6","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CELFT6G6QOSZU5JZFTZ3PKWBD4","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10033","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-29T04:02:27Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"815efe3bc84a7c3ed4fa2174084dca270b027495c22676fdfe493b3fffdfa74a","abstract_canon_sha256":"f678fb2d0d299c6fcd2fbf82cf7df08083af566d0b992ca765d620a34a116e96"},"schema_version":"1.0"},"canonical_sha256":"111659f8de83a59a75392cf3b7aac11f010b60a0a61e3e4628378c29873d25cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:32.134877Z","signature_b64":"WYVw0MQ47L/AvpBqFoqZOVGVIDAQvZSqEsjMsnotvKwAFa8AwFcPxi99N+lE9Ye3zgi445xTdsyjkgpRUtg/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"111659f8de83a59a75392cf3b7aac11f010b60a0a61e3e4628378c29873d25cb","last_reissued_at":"2026-05-18T00:43:32.133915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:32.133915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10033","source_version":1,"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-18T00:43:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8m7XVFCk2ko7i4WZooH1Ir2qIhY7zrI+RyFJ7zBhgZVtWmNAqTueIx7RcwNrR3xBIGg866FV/WFeh9Mz/CIwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:53:29.828341Z"},"content_sha256":"39fcf2f891ec66294574c5f6f819b87312c2806579bbdce7f057abd9352427bc","schema_version":"1.0","event_id":"sha256:39fcf2f891ec66294574c5f6f819b87312c2806579bbdce7f057abd9352427bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CELFT6G6QOSZU5JZFTZ3PKWBD4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improving the Expected Improvement Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chao Qin, Daniel Russo, Diego Klabjan","submitted_at":"2017-05-29T04:02:27Z","abstract_excerpt":"The expected improvement (EI) algorithm is a popular strategy for information collection in optimization under uncertainty. The algorithm is widely known to be too greedy, but nevertheless enjoys wide use due to its simplicity and ability to handle uncertainty and noise in a coherent decision theoretic framework. To provide rigorous insight into EI, we study its properties in a simple setting of Bayesian optimization where the domain consists of a finite grid of points. This is the so-called best-arm identification problem, where the goal is to allocate measurement effort wisely to confidently"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10033","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"},"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-18T00:43:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Cet3O4IfiQllPN6ZLNEzigoBY80SqHKy0OigwWFhWQ0vE3QR9d8xPNXcBV/g7/xUaoP6cGmqmrzC6j1Cm89XCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:53:29.828700Z"},"content_sha256":"d0607d30f0d661f9d13c04733a502517a49691a19556ccab84c5e1378bd72f60","schema_version":"1.0","event_id":"sha256:d0607d30f0d661f9d13c04733a502517a49691a19556ccab84c5e1378bd72f60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CELFT6G6QOSZU5JZFTZ3PKWBD4/bundle.json","state_url":"https://pith.science/pith/CELFT6G6QOSZU5JZFTZ3PKWBD4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CELFT6G6QOSZU5JZFTZ3PKWBD4/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-05-28T07:53:29Z","links":{"resolver":"https://pith.science/pith/CELFT6G6QOSZU5JZFTZ3PKWBD4","bundle":"https://pith.science/pith/CELFT6G6QOSZU5JZFTZ3PKWBD4/bundle.json","state":"https://pith.science/pith/CELFT6G6QOSZU5JZFTZ3PKWBD4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CELFT6G6QOSZU5JZFTZ3PKWBD4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CELFT6G6QOSZU5JZFTZ3PKWBD4","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":"f678fb2d0d299c6fcd2fbf82cf7df08083af566d0b992ca765d620a34a116e96","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-29T04:02:27Z","title_canon_sha256":"815efe3bc84a7c3ed4fa2174084dca270b027495c22676fdfe493b3fffdfa74a"},"schema_version":"1.0","source":{"id":"1705.10033","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10033","created_at":"2026-05-18T00:43:32Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10033v1","created_at":"2026-05-18T00:43:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10033","created_at":"2026-05-18T00:43:32Z"},{"alias_kind":"pith_short_12","alias_value":"CELFT6G6QOSZ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CELFT6G6QOSZU5JZ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CELFT6G6","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:d0607d30f0d661f9d13c04733a502517a49691a19556ccab84c5e1378bd72f60","target":"graph","created_at":"2026-05-18T00:43:32Z","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":"The expected improvement (EI) algorithm is a popular strategy for information collection in optimization under uncertainty. The algorithm is widely known to be too greedy, but nevertheless enjoys wide use due to its simplicity and ability to handle uncertainty and noise in a coherent decision theoretic framework. To provide rigorous insight into EI, we study its properties in a simple setting of Bayesian optimization where the domain consists of a finite grid of points. This is the so-called best-arm identification problem, where the goal is to allocate measurement effort wisely to confidently","authors_text":"Chao Qin, Daniel Russo, Diego Klabjan","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-29T04:02:27Z","title":"Improving the Expected Improvement Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10033","kind":"arxiv","version":1},"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:39fcf2f891ec66294574c5f6f819b87312c2806579bbdce7f057abd9352427bc","target":"record","created_at":"2026-05-18T00:43:32Z","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":"f678fb2d0d299c6fcd2fbf82cf7df08083af566d0b992ca765d620a34a116e96","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-29T04:02:27Z","title_canon_sha256":"815efe3bc84a7c3ed4fa2174084dca270b027495c22676fdfe493b3fffdfa74a"},"schema_version":"1.0","source":{"id":"1705.10033","kind":"arxiv","version":1}},"canonical_sha256":"111659f8de83a59a75392cf3b7aac11f010b60a0a61e3e4628378c29873d25cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"111659f8de83a59a75392cf3b7aac11f010b60a0a61e3e4628378c29873d25cb","first_computed_at":"2026-05-18T00:43:32.133915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:32.133915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WYVw0MQ47L/AvpBqFoqZOVGVIDAQvZSqEsjMsnotvKwAFa8AwFcPxi99N+lE9Ye3zgi445xTdsyjkgpRUtg/Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:32.134877Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10033","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39fcf2f891ec66294574c5f6f819b87312c2806579bbdce7f057abd9352427bc","sha256:d0607d30f0d661f9d13c04733a502517a49691a19556ccab84c5e1378bd72f60"],"state_sha256":"dbdc9c822179adf25581bfe0dfe80ddcfdacf6966ff7e8ccea404305b5494547"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r0suZrAG5kxKtgrdWI+a+tcLanhlpJgvKN7l+VnyZZ0IpPAsJLiHIlK93FLuP1+SCPPR5I3uqDukigNiHFzBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:53:29.830694Z","bundle_sha256":"8c289b439f2065777290e4c697d7bdf46ddb3bfee1d2eaa5de6124aeef9aa30a"}}