{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:J2CJ2N26F32WB2SEQCGQYWOYEZ","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":"7c7bb6122798a1445a2515ab849b0fadc80864443d58bc98b2be7dc3d4064b8d","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-11-03T17:55:08Z","title_canon_sha256":"a1a14ea3ef82c464948adadcac53698980f37be012fd7dc1e93174bd5e59a46f"},"schema_version":"1.0","source":{"id":"2311.02146","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2311.02146","created_at":"2026-07-05T08:31:44Z"},{"alias_kind":"arxiv_version","alias_value":"2311.02146v2","created_at":"2026-07-05T08:31:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.02146","created_at":"2026-07-05T08:31:44Z"},{"alias_kind":"pith_short_12","alias_value":"J2CJ2N26F32W","created_at":"2026-07-05T08:31:44Z"},{"alias_kind":"pith_short_16","alias_value":"J2CJ2N26F32WB2SE","created_at":"2026-07-05T08:31:44Z"},{"alias_kind":"pith_short_8","alias_value":"J2CJ2N26","created_at":"2026-07-05T08:31:44Z"}],"graph_snapshots":[{"event_id":"sha256:a7b2447cc9e3e83283f8d0a53f067d1a070b638f0eefe20a13874ded7a3f629e","target":"graph","created_at":"2026-07-05T08:31:44Z","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/2311.02146/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bayesian optimization is a powerful framework for optimizing functions that are expensive or time-consuming to evaluate. Recent work has considered Bayesian optimization of function networks (BOFN), where the objective function is given by a network of functions, each taking as input the output of previous nodes in the network as well as additional parameters. Leveraging this network structure has been shown to yield significant performance improvements. Existing BOFN algorithms for general-purpose networks evaluate the full network at each iteration. However, many real-world applications allo","authors_text":"Jiayue Wan, Maximilian Balandat, Peter I. Frazier, Poompol Buathong, Raul Astudillo, Samuel Daulton","cross_cats":["cs.LG","math.OC"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-11-03T17:55:08Z","title":"Bayesian Optimization of Function Networks with Partial Evaluations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.02146","kind":"arxiv","version":2},"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:417e8ea4aebc2256620301a809e200ff3c3ab39d40eb881b048b33840613a5e7","target":"record","created_at":"2026-07-05T08:31:44Z","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":"7c7bb6122798a1445a2515ab849b0fadc80864443d58bc98b2be7dc3d4064b8d","cross_cats_sorted":["cs.LG","math.OC"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ML","submitted_at":"2023-11-03T17:55:08Z","title_canon_sha256":"a1a14ea3ef82c464948adadcac53698980f37be012fd7dc1e93174bd5e59a46f"},"schema_version":"1.0","source":{"id":"2311.02146","kind":"arxiv","version":2}},"canonical_sha256":"4e849d375e2ef560ea44808d0c59d826533fb3004b30a555b78607056bc25267","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4e849d375e2ef560ea44808d0c59d826533fb3004b30a555b78607056bc25267","first_computed_at":"2026-07-05T08:31:44.053699Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:31:44.053699Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"z+1cPi0njxgi6rZPjeAluijKcmjEJdRNsN2GYu64MoQMVMBX3C323+1Lll1ckSI3xVnmldG3goizWWGDIRjHDg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:31:44.054190Z","signed_message":"canonical_sha256_bytes"},"source_id":"2311.02146","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:417e8ea4aebc2256620301a809e200ff3c3ab39d40eb881b048b33840613a5e7","sha256:a7b2447cc9e3e83283f8d0a53f067d1a070b638f0eefe20a13874ded7a3f629e"],"state_sha256":"589de0546a70fdc6719d5feca9a900649135b583e0a988d1fb4a50e778b1186f"}