{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XTUNR544ZRRTAX24D7UVJLWXQ2","short_pith_number":"pith:XTUNR544","canonical_record":{"source":{"id":"2403.09570","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-14T17:00:01Z","cross_cats_sorted":["cs.IT","eess.SP","math.IT"],"title_canon_sha256":"348de14a351d3cada1ef3aba6756aa8a8f2322edc6454c4fb9cb44422e5e4106","abstract_canon_sha256":"f20b49a75a403a68af3c5a49a927a6953104b4110c3ca86233d4f8f2021a095a"},"schema_version":"1.0"},"canonical_sha256":"bce8d8f79ccc63305f5c1fe954aed7869ec4c5334a1a5d3839d14d5b2454f87c","source":{"kind":"arxiv","id":"2403.09570","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.09570","created_at":"2026-07-05T09:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"2403.09570v4","created_at":"2026-07-05T09:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.09570","created_at":"2026-07-05T09:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"XTUNR544ZRRT","created_at":"2026-07-05T09:58:19Z"},{"alias_kind":"pith_short_16","alias_value":"XTUNR544ZRRTAX24","created_at":"2026-07-05T09:58:19Z"},{"alias_kind":"pith_short_8","alias_value":"XTUNR544","created_at":"2026-07-05T09:58:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XTUNR544ZRRTAX24D7UVJLWXQ2","target":"record","payload":{"canonical_record":{"source":{"id":"2403.09570","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-14T17:00:01Z","cross_cats_sorted":["cs.IT","eess.SP","math.IT"],"title_canon_sha256":"348de14a351d3cada1ef3aba6756aa8a8f2322edc6454c4fb9cb44422e5e4106","abstract_canon_sha256":"f20b49a75a403a68af3c5a49a927a6953104b4110c3ca86233d4f8f2021a095a"},"schema_version":"1.0"},"canonical_sha256":"bce8d8f79ccc63305f5c1fe954aed7869ec4c5334a1a5d3839d14d5b2454f87c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:58:19.190302Z","signature_b64":"+eHSG7JeWR11hA0ZIVlNQF0BlZOIgchIfWkZ4mtPsESYi4cl7q3E7rhw/RfXnixgW27TsX7MY+LU86UFfQtdBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bce8d8f79ccc63305f5c1fe954aed7869ec4c5334a1a5d3839d14d5b2454f87c","last_reissued_at":"2026-07-05T09:58:19.189890Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:58:19.189890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.09570","source_version":4,"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-07-05T09:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05pLNw//DABx/BEMVNLgua0eG43VERWOlINABeqr7dv4tzo9pPcuT4yG6QcC1eDefMI2YW7s1s3WamwLNCTfDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:51:32.876107Z"},"content_sha256":"2075ce95561a09682a2e3a0051ff4184afb40d4a9e5dcbb0e1ccb6a81968f9fd","schema_version":"1.0","event_id":"sha256:2075ce95561a09682a2e3a0051ff4184afb40d4a9e5dcbb0e1ccb6a81968f9fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XTUNR544ZRRTAX24D7UVJLWXQ2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Fidelity Bayesian Optimization With Across-Task Transferable Max-Value Entropy Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","eess.SP","math.IT"],"primary_cat":"cs.LG","authors_text":"Osvaldo Simeone, Sangwoo Park, Yunchuan Zhang","submitted_at":"2024-03-14T17:00:01Z","abstract_excerpt":"In many applications, ranging from logistics to engineering, a designer is faced with a sequence of optimization tasks for which the objectives are in the form of black-box functions that are costly to evaluate. Furthermore, higher-fidelity evaluations of the optimization objectives often entail a larger cost. Existing multi-fidelity black-box optimization strategies select candidate solutions and fidelity levels with the goal of maximizing the information about the optimal value or the optimal solution for the current task. Assuming that successive optimization tasks are related, this paper i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.09570","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.09570/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:58:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3nCInLFvWVhVIJsko8vu2RmtQD2/UlGwg4ctPpkUNyihz5zOaZM0hgXIPw2InGdZdv3s4xYTg6mEvTpfADARBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T02:51:32.876993Z"},"content_sha256":"0d86f6e3985da77852995c7d23c9eb2603584cad46f381e3ad0e3d155622681c","schema_version":"1.0","event_id":"sha256:0d86f6e3985da77852995c7d23c9eb2603584cad46f381e3ad0e3d155622681c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XTUNR544ZRRTAX24D7UVJLWXQ2/bundle.json","state_url":"https://pith.science/pith/XTUNR544ZRRTAX24D7UVJLWXQ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XTUNR544ZRRTAX24D7UVJLWXQ2/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-08-13T02:51:32Z","links":{"resolver":"https://pith.science/pith/XTUNR544ZRRTAX24D7UVJLWXQ2","bundle":"https://pith.science/pith/XTUNR544ZRRTAX24D7UVJLWXQ2/bundle.json","state":"https://pith.science/pith/XTUNR544ZRRTAX24D7UVJLWXQ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XTUNR544ZRRTAX24D7UVJLWXQ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XTUNR544ZRRTAX24D7UVJLWXQ2","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":"f20b49a75a403a68af3c5a49a927a6953104b4110c3ca86233d4f8f2021a095a","cross_cats_sorted":["cs.IT","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-14T17:00:01Z","title_canon_sha256":"348de14a351d3cada1ef3aba6756aa8a8f2322edc6454c4fb9cb44422e5e4106"},"schema_version":"1.0","source":{"id":"2403.09570","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.09570","created_at":"2026-07-05T09:58:19Z"},{"alias_kind":"arxiv_version","alias_value":"2403.09570v4","created_at":"2026-07-05T09:58:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.09570","created_at":"2026-07-05T09:58:19Z"},{"alias_kind":"pith_short_12","alias_value":"XTUNR544ZRRT","created_at":"2026-07-05T09:58:19Z"},{"alias_kind":"pith_short_16","alias_value":"XTUNR544ZRRTAX24","created_at":"2026-07-05T09:58:19Z"},{"alias_kind":"pith_short_8","alias_value":"XTUNR544","created_at":"2026-07-05T09:58:19Z"}],"graph_snapshots":[{"event_id":"sha256:0d86f6e3985da77852995c7d23c9eb2603584cad46f381e3ad0e3d155622681c","target":"graph","created_at":"2026-07-05T09:58:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2403.09570/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In many applications, ranging from logistics to engineering, a designer is faced with a sequence of optimization tasks for which the objectives are in the form of black-box functions that are costly to evaluate. Furthermore, higher-fidelity evaluations of the optimization objectives often entail a larger cost. Existing multi-fidelity black-box optimization strategies select candidate solutions and fidelity levels with the goal of maximizing the information about the optimal value or the optimal solution for the current task. Assuming that successive optimization tasks are related, this paper i","authors_text":"Osvaldo Simeone, Sangwoo Park, Yunchuan Zhang","cross_cats":["cs.IT","eess.SP","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-14T17:00:01Z","title":"Multi-Fidelity Bayesian Optimization With Across-Task Transferable Max-Value Entropy Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.09570","kind":"arxiv","version":4},"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:2075ce95561a09682a2e3a0051ff4184afb40d4a9e5dcbb0e1ccb6a81968f9fd","target":"record","created_at":"2026-07-05T09:58:19Z","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":"f20b49a75a403a68af3c5a49a927a6953104b4110c3ca86233d4f8f2021a095a","cross_cats_sorted":["cs.IT","eess.SP","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-03-14T17:00:01Z","title_canon_sha256":"348de14a351d3cada1ef3aba6756aa8a8f2322edc6454c4fb9cb44422e5e4106"},"schema_version":"1.0","source":{"id":"2403.09570","kind":"arxiv","version":4}},"canonical_sha256":"bce8d8f79ccc63305f5c1fe954aed7869ec4c5334a1a5d3839d14d5b2454f87c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bce8d8f79ccc63305f5c1fe954aed7869ec4c5334a1a5d3839d14d5b2454f87c","first_computed_at":"2026-07-05T09:58:19.189890Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:58:19.189890Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+eHSG7JeWR11hA0ZIVlNQF0BlZOIgchIfWkZ4mtPsESYi4cl7q3E7rhw/RfXnixgW27TsX7MY+LU86UFfQtdBw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:58:19.190302Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.09570","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2075ce95561a09682a2e3a0051ff4184afb40d4a9e5dcbb0e1ccb6a81968f9fd","sha256:0d86f6e3985da77852995c7d23c9eb2603584cad46f381e3ad0e3d155622681c"],"state_sha256":"21f1406fe2088313f78b6f31185a995ae6bfc39339c26d77ad1c4266eb54ab89"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Wr9lLkdHlb/tiBTN5ePg7VCuEuVZjtX9aTlBuGnC0A/VRc91pDgWPj5eBb4Cxa3hMk/UKamBfUjRJhUW0LTCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T02:51:32.883559Z","bundle_sha256":"f93b70eaacd399ce302a7653824903fea5594d8f35c40d0e732d702e6a73b4d1"}}