{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:PE2P2HCWPJ2I62C6ASVXM3MGWW","short_pith_number":"pith:PE2P2HCW","canonical_record":{"source":{"id":"1811.00755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-02T06:36:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"903708ee72bd00892506a5afd9f9222d99f36d170bee1bb4356d81bc9a708963","abstract_canon_sha256":"ddf9caabf7f17ec8917b53564fe0f45db9a9a44fbe38b9410534b6dd6ebaa84f"},"schema_version":"1.0"},"canonical_sha256":"7934fd1c567a748f685e04ab766d86b5b06216f472764c9e7526b7f63aa706a2","source":{"kind":"arxiv","id":"1811.00755","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00755","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00755v1","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00755","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"PE2P2HCWPJ2I","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PE2P2HCWPJ2I62C6","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PE2P2HCW","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:PE2P2HCWPJ2I62C6ASVXM3MGWW","target":"record","payload":{"canonical_record":{"source":{"id":"1811.00755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-02T06:36:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"903708ee72bd00892506a5afd9f9222d99f36d170bee1bb4356d81bc9a708963","abstract_canon_sha256":"ddf9caabf7f17ec8917b53564fe0f45db9a9a44fbe38b9410534b6dd6ebaa84f"},"schema_version":"1.0"},"canonical_sha256":"7934fd1c567a748f685e04ab766d86b5b06216f472764c9e7526b7f63aa706a2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:42.275069Z","signature_b64":"xywlzDxefUKZyD2vAnq7e9WFpWTUbOB2doxL3GVKgzTmiw1dkVHvEsK7oqAdybo/maS6DgQbNeqcEsrdg9c3Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7934fd1c567a748f685e04ab766d86b5b06216f472764c9e7526b7f63aa706a2","last_reissued_at":"2026-05-18T00:01:42.274519Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:42.274519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.00755","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:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Br3TtGWIx8zXYplA26fY8jCkyjywygt0VOxM/0R2YSbk7nd/YpowslgsBt4a0Q1XCp+Qz8vywis5vDfilMpLAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:35:35.396092Z"},"content_sha256":"771d7d05b72a7eaab2055d5d75316ee4111c36d9f444985833178761c70d064b","schema_version":"1.0","event_id":"sha256:771d7d05b72a7eaab2055d5d75316ee4111c36d9f444985833178761c70d064b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:PE2P2HCWPJ2I62C6ASVXM3MGWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A General Framework for Multi-fidelity Bayesian Optimization with Gaussian Processes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Jialin Song, Yisong Yue, Yuxin Chen","submitted_at":"2018-11-02T06:36:13Z","abstract_excerpt":"How can we efficiently gather information to optimize an unknown function, when presented with multiple, mutually dependent information sources with different costs? For example, when optimizing a robotic system, intelligently trading off computer simulations and real robot testings can lead to significant savings. Existing methods, such as multi-fidelity GP-UCB or Entropy Search-based approaches, either make simplistic assumptions on the interaction among different fidelities or use simple heuristics that lack theoretical guarantees. In this paper, we study multi-fidelity Bayesian optimizatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00755","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:01:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tOEmXX5lz2R+6gvzEDzzSRr8Pal2/UfgSE7S3MhxbPSvKfMWXeReMTbtmnSeOg5Hlnfkay2PcG0K4bNoNmZoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:35:35.396467Z"},"content_sha256":"66bcadae550d6c14674af6777cbd7a45bdf28469d986ac746eec695c965c6c9a","schema_version":"1.0","event_id":"sha256:66bcadae550d6c14674af6777cbd7a45bdf28469d986ac746eec695c965c6c9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PE2P2HCWPJ2I62C6ASVXM3MGWW/bundle.json","state_url":"https://pith.science/pith/PE2P2HCWPJ2I62C6ASVXM3MGWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PE2P2HCWPJ2I62C6ASVXM3MGWW/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-11T13:35:35Z","links":{"resolver":"https://pith.science/pith/PE2P2HCWPJ2I62C6ASVXM3MGWW","bundle":"https://pith.science/pith/PE2P2HCWPJ2I62C6ASVXM3MGWW/bundle.json","state":"https://pith.science/pith/PE2P2HCWPJ2I62C6ASVXM3MGWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PE2P2HCWPJ2I62C6ASVXM3MGWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:PE2P2HCWPJ2I62C6ASVXM3MGWW","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":"ddf9caabf7f17ec8917b53564fe0f45db9a9a44fbe38b9410534b6dd6ebaa84f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-02T06:36:13Z","title_canon_sha256":"903708ee72bd00892506a5afd9f9222d99f36d170bee1bb4356d81bc9a708963"},"schema_version":"1.0","source":{"id":"1811.00755","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.00755","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"arxiv_version","alias_value":"1811.00755v1","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.00755","created_at":"2026-05-18T00:01:42Z"},{"alias_kind":"pith_short_12","alias_value":"PE2P2HCWPJ2I","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"PE2P2HCWPJ2I62C6","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"PE2P2HCW","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:66bcadae550d6c14674af6777cbd7a45bdf28469d986ac746eec695c965c6c9a","target":"graph","created_at":"2026-05-18T00:01:42Z","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":"How can we efficiently gather information to optimize an unknown function, when presented with multiple, mutually dependent information sources with different costs? For example, when optimizing a robotic system, intelligently trading off computer simulations and real robot testings can lead to significant savings. Existing methods, such as multi-fidelity GP-UCB or Entropy Search-based approaches, either make simplistic assumptions on the interaction among different fidelities or use simple heuristics that lack theoretical guarantees. In this paper, we study multi-fidelity Bayesian optimizatio","authors_text":"Jialin Song, Yisong Yue, Yuxin Chen","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-02T06:36:13Z","title":"A General Framework for Multi-fidelity Bayesian Optimization with Gaussian Processes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.00755","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:771d7d05b72a7eaab2055d5d75316ee4111c36d9f444985833178761c70d064b","target":"record","created_at":"2026-05-18T00:01:42Z","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":"ddf9caabf7f17ec8917b53564fe0f45db9a9a44fbe38b9410534b6dd6ebaa84f","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-02T06:36:13Z","title_canon_sha256":"903708ee72bd00892506a5afd9f9222d99f36d170bee1bb4356d81bc9a708963"},"schema_version":"1.0","source":{"id":"1811.00755","kind":"arxiv","version":1}},"canonical_sha256":"7934fd1c567a748f685e04ab766d86b5b06216f472764c9e7526b7f63aa706a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7934fd1c567a748f685e04ab766d86b5b06216f472764c9e7526b7f63aa706a2","first_computed_at":"2026-05-18T00:01:42.274519Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:42.274519Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xywlzDxefUKZyD2vAnq7e9WFpWTUbOB2doxL3GVKgzTmiw1dkVHvEsK7oqAdybo/maS6DgQbNeqcEsrdg9c3Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:42.275069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.00755","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:771d7d05b72a7eaab2055d5d75316ee4111c36d9f444985833178761c70d064b","sha256:66bcadae550d6c14674af6777cbd7a45bdf28469d986ac746eec695c965c6c9a"],"state_sha256":"592bbb6f29a3b92d4c449112778a4f1830d7aa5537781a6df188c2c1aa16d110"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O4UMBYKaI6SSyJJ7vdhGUqW8uc5IYsTZTE/BVJE2pHFboHtEgpCt/4D4Cn9h2/oFvJTUL9/6VaJqB0ceiRMdDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:35:35.398400Z","bundle_sha256":"5380b7a25d3f5ee52c33b7e92778f9c7860570c6a02d12758c9a4316ef95e785"}}