{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:PDNMXF3FQYPFPEEE4GNWGGBBRN","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":"1ee63114293d4bc4f650bb04edbdf6c71e0c57cee1e62dcdb663467262246f9c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-17T11:24:56Z","title_canon_sha256":"75d30dc4be5e02066d8ded524a31d5e943983b292f6909f26c8a802d34866f8d"},"schema_version":"1.0","source":{"id":"2604.15959","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.15959","created_at":"2026-06-01T01:03:53Z"},{"alias_kind":"arxiv_version","alias_value":"2604.15959v2","created_at":"2026-06-01T01:03:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.15959","created_at":"2026-06-01T01:03:53Z"},{"alias_kind":"pith_short_12","alias_value":"PDNMXF3FQYPF","created_at":"2026-06-01T01:03:53Z"},{"alias_kind":"pith_short_16","alias_value":"PDNMXF3FQYPFPEEE","created_at":"2026-06-01T01:03:53Z"},{"alias_kind":"pith_short_8","alias_value":"PDNMXF3F","created_at":"2026-06-01T01:03:53Z"}],"graph_snapshots":[{"event_id":"sha256:f775c49585179a38c8bc07c1cd9405e21ffc1ea33398ecbf15ccb01e7162d482","target":"graph","created_at":"2026-06-01T01:03:53Z","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":3,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"Our approach provides a uniform Pareto coverage without hypervolume computation and naturally applies to constrained and preference-based settings."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That identifying the largest geometric gaps in the current approximate Pareto front and converting them into inequality constraints will reliably produce uniform coverage when solved sequentially with constrained expected improvement."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"STAGE-BO improves multi-objective Bayesian optimization by sequentially targeting the largest geometric gaps in the approximate Pareto front via epsilon-constraint decomposition solved with constrained expected improvement."}],"snapshot_sha256":"a71424c8cbfcd595b53f86536c476149e6eda0d34d5a61216677c34c20e50218"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2604.15959/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-objective Bayesian optimization (MOBO) provides a principled framework for optimizing multiple expensive black-box functions. However, existing MOBO methods often struggle with coverage, scalability, and handling constraints and preferences. In this work we propose STAGE-BO, Sequential Targeting Adaptive Gap-Filling $\\varepsilon$-Constraint Bayesian Optimization: by analyzing the coverage of the surrogate Pareto front, our method identifies the Pareto front point with the largest uncovered gap, and uses its coordinates to define adaptive constraints in $\\varepsilon$-constraint method, wh","authors_text":"Sammie Katt, Samuel Kaski, Yaohong Yang","cross_cats":[],"headline":"STAGE-BO improves multi-objective Bayesian optimization by sequentially targeting the largest geometric gaps in the approximate Pareto front via epsilon-constraint decomposition solved with constrained expected improvement.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-17T11:24:56Z","title":"Multi-Objective Bayesian Optimization via Adaptive \\varepsilon-Constraints Decomposition"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.15959","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-10T08:36:36.695464Z","id":"c6790d99-9386-4327-95e5-e83128dba24b","model_set":{"reader":"grok-4.3"},"one_line_summary":"STAGE-BO improves multi-objective Bayesian optimization by sequentially targeting the largest geometric gaps in the approximate Pareto front via epsilon-constraint decomposition solved with constrained expected improvement.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"","strongest_claim":"Our approach provides a uniform Pareto coverage without hypervolume computation and naturally applies to constrained and preference-based settings.","weakest_assumption":"That identifying the largest geometric gaps in the current approximate Pareto front and converting them into inequality constraints will reliably produce uniform coverage when solved sequentially with constrained expected improvement."}},"verdict_id":"c6790d99-9386-4327-95e5-e83128dba24b"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e28054131fbe1eadca94bff85f7c3845c75e1cff3a233deafc2afe7ef1a220eb","target":"record","created_at":"2026-06-01T01:03:53Z","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":"1ee63114293d4bc4f650bb04edbdf6c71e0c57cee1e62dcdb663467262246f9c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-04-17T11:24:56Z","title_canon_sha256":"75d30dc4be5e02066d8ded524a31d5e943983b292f6909f26c8a802d34866f8d"},"schema_version":"1.0","source":{"id":"2604.15959","kind":"arxiv","version":2}},"canonical_sha256":"78dacb9765861e579084e19b6318218b657e7f805ec0d23fe3539ae20344e6bb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78dacb9765861e579084e19b6318218b657e7f805ec0d23fe3539ae20344e6bb","first_computed_at":"2026-06-01T01:03:53.255209Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:03:53.255209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QeZ4UUCpUVtXmvBcjF39qdDFVF/6cd41C/Zdl52M9X8ixyQGB3uH77r4PHTRcyol0/QHQ2U0iEk2UV9WhOkFCQ==","signature_status":"signed_v1","signed_at":"2026-06-01T01:03:53.256305Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.15959","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e28054131fbe1eadca94bff85f7c3845c75e1cff3a233deafc2afe7ef1a220eb","sha256:f775c49585179a38c8bc07c1cd9405e21ffc1ea33398ecbf15ccb01e7162d482"],"state_sha256":"e373233d3dee0f701ac0fe213f7e267658fb76ac29766a7fc5dea94574b198c2"}