{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:HNKQ6WMUADCHP6ZF5L4OI3QZ7Z","short_pith_number":"pith:HNKQ6WMU","canonical_record":{"source":{"id":"1602.01064","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-02T19:58:11Z","cross_cats_sorted":["cs.IT","cs.LG","cs.RO","math.IT"],"title_canon_sha256":"58d770c8e2ac58d331c1db3ad72adb658466d8e8bd611a6505cf32e4ad331122","abstract_canon_sha256":"1e256276fea31f60927306beec43ea0b209436ecfaeeceb2598cf623be087c39"},"schema_version":"1.0"},"canonical_sha256":"3b550f599400c477fb25eaf8e46e19fe7d753d8172ba9663f1d42f8da44309db","source":{"kind":"arxiv","id":"1602.01064","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01064","created_at":"2026-05-18T01:13:55Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01064v3","created_at":"2026-05-18T01:13:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01064","created_at":"2026-05-18T01:13:55Z"},{"alias_kind":"pith_short_12","alias_value":"HNKQ6WMUADCH","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HNKQ6WMUADCHP6ZF","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HNKQ6WMU","created_at":"2026-05-18T12:30:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:HNKQ6WMUADCHP6ZF5L4OI3QZ7Z","target":"record","payload":{"canonical_record":{"source":{"id":"1602.01064","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-02T19:58:11Z","cross_cats_sorted":["cs.IT","cs.LG","cs.RO","math.IT"],"title_canon_sha256":"58d770c8e2ac58d331c1db3ad72adb658466d8e8bd611a6505cf32e4ad331122","abstract_canon_sha256":"1e256276fea31f60927306beec43ea0b209436ecfaeeceb2598cf623be087c39"},"schema_version":"1.0"},"canonical_sha256":"3b550f599400c477fb25eaf8e46e19fe7d753d8172ba9663f1d42f8da44309db","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:55.842525Z","signature_b64":"FHVrskEynt0efrJ/QvvKEha/0VBtCv29//e8JNi//Ey4Jo6xGMb5gmPDruM56c5jy1R3Yc7vsAGLQ2M7BpRzCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b550f599400c477fb25eaf8e46e19fe7d753d8172ba9663f1d42f8da44309db","last_reissued_at":"2026-05-18T01:13:55.841848Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:55.841848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.01064","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-18T01:13:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uCvZGVZlwG3OW52+sQzxJGpZY1ce3MAAUg6luATdsniAzFS1zQqg/MKXvzXy80HrlswgBfw5UIGH7aY1keevBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:46:33.470816Z"},"content_sha256":"b53d2f3d7013b0e10c3017d48a98c67ecb27b4fdc144aced715c25d6c3c4d7bc","schema_version":"1.0","event_id":"sha256:b53d2f3d7013b0e10c3017d48a98c67ecb27b4fdc144aced715c25d6c3c4d7bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:HNKQ6WMUADCHP6ZF5L4OI3QZ7Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimum Regret Search for Single- and Multi-Task Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","cs.LG","cs.RO","math.IT"],"primary_cat":"stat.ML","authors_text":"Jan Hendrik Metzen","submitted_at":"2016-02-02T19:58:11Z","abstract_excerpt":"We propose minimum regret search (MRS), a novel acquisition function for Bayesian optimization. MRS bears similarities with information-theoretic approaches such as entropy search (ES). However, while ES aims in each query at maximizing the information gain with respect to the global maximum, MRS aims at minimizing the expected simple regret of its ultimate recommendation for the optimum. While empirically ES and MRS perform similar in most of the cases, MRS produces fewer outliers with high simple regret than ES. We provide empirical results both for a synthetic single-task optimization probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01064","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-18T01:13:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RQv2ET8eTa1EnAtjwlBjQgH4DPSSjTADbROuDXo4PaaVMQjAs+eeyTnqLRjcnw4BpzlwaWDGk/5CRuIMWZwNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:46:33.471543Z"},"content_sha256":"0e7a29511ab3a09caf2bef315f78cf195a87e569ea5db0b298123a34f5f76617","schema_version":"1.0","event_id":"sha256:0e7a29511ab3a09caf2bef315f78cf195a87e569ea5db0b298123a34f5f76617"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HNKQ6WMUADCHP6ZF5L4OI3QZ7Z/bundle.json","state_url":"https://pith.science/pith/HNKQ6WMUADCHP6ZF5L4OI3QZ7Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HNKQ6WMUADCHP6ZF5L4OI3QZ7Z/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-07T20:46:33Z","links":{"resolver":"https://pith.science/pith/HNKQ6WMUADCHP6ZF5L4OI3QZ7Z","bundle":"https://pith.science/pith/HNKQ6WMUADCHP6ZF5L4OI3QZ7Z/bundle.json","state":"https://pith.science/pith/HNKQ6WMUADCHP6ZF5L4OI3QZ7Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HNKQ6WMUADCHP6ZF5L4OI3QZ7Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:HNKQ6WMUADCHP6ZF5L4OI3QZ7Z","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":"1e256276fea31f60927306beec43ea0b209436ecfaeeceb2598cf623be087c39","cross_cats_sorted":["cs.IT","cs.LG","cs.RO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-02T19:58:11Z","title_canon_sha256":"58d770c8e2ac58d331c1db3ad72adb658466d8e8bd611a6505cf32e4ad331122"},"schema_version":"1.0","source":{"id":"1602.01064","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.01064","created_at":"2026-05-18T01:13:55Z"},{"alias_kind":"arxiv_version","alias_value":"1602.01064v3","created_at":"2026-05-18T01:13:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.01064","created_at":"2026-05-18T01:13:55Z"},{"alias_kind":"pith_short_12","alias_value":"HNKQ6WMUADCH","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"HNKQ6WMUADCHP6ZF","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"HNKQ6WMU","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:0e7a29511ab3a09caf2bef315f78cf195a87e569ea5db0b298123a34f5f76617","target":"graph","created_at":"2026-05-18T01:13:55Z","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":"We propose minimum regret search (MRS), a novel acquisition function for Bayesian optimization. MRS bears similarities with information-theoretic approaches such as entropy search (ES). However, while ES aims in each query at maximizing the information gain with respect to the global maximum, MRS aims at minimizing the expected simple regret of its ultimate recommendation for the optimum. While empirically ES and MRS perform similar in most of the cases, MRS produces fewer outliers with high simple regret than ES. We provide empirical results both for a synthetic single-task optimization probl","authors_text":"Jan Hendrik Metzen","cross_cats":["cs.IT","cs.LG","cs.RO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-02T19:58:11Z","title":"Minimum Regret Search for Single- and Multi-Task Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.01064","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:b53d2f3d7013b0e10c3017d48a98c67ecb27b4fdc144aced715c25d6c3c4d7bc","target":"record","created_at":"2026-05-18T01:13:55Z","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":"1e256276fea31f60927306beec43ea0b209436ecfaeeceb2598cf623be087c39","cross_cats_sorted":["cs.IT","cs.LG","cs.RO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-02-02T19:58:11Z","title_canon_sha256":"58d770c8e2ac58d331c1db3ad72adb658466d8e8bd611a6505cf32e4ad331122"},"schema_version":"1.0","source":{"id":"1602.01064","kind":"arxiv","version":3}},"canonical_sha256":"3b550f599400c477fb25eaf8e46e19fe7d753d8172ba9663f1d42f8da44309db","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3b550f599400c477fb25eaf8e46e19fe7d753d8172ba9663f1d42f8da44309db","first_computed_at":"2026-05-18T01:13:55.841848Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:13:55.841848Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FHVrskEynt0efrJ/QvvKEha/0VBtCv29//e8JNi//Ey4Jo6xGMb5gmPDruM56c5jy1R3Yc7vsAGLQ2M7BpRzCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:13:55.842525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.01064","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b53d2f3d7013b0e10c3017d48a98c67ecb27b4fdc144aced715c25d6c3c4d7bc","sha256:0e7a29511ab3a09caf2bef315f78cf195a87e569ea5db0b298123a34f5f76617"],"state_sha256":"59cafe4d28a36ed68459b4eef4a78f85e798c2288fb88d10fe43e10468dc41d4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CkZ89E5XNewKAINj4+lVdYIPUn0j8KkQGvhwbMh20WqYqD5R8huGIeV2BSa2t0osAioBun51Nt+EOsZkTj8GAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:46:33.476008Z","bundle_sha256":"650b45d6e2145c1c0812103cab1d23f831303bc4a2d12121ac9a12b01413c438"}}