{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XCAA6CVJG5Q7X5N3ETZMPWKVWW","short_pith_number":"pith:XCAA6CVJ","schema_version":"1.0","canonical_sha256":"b8800f0aa93761fbf5bb24f2c7d955b5b6a58bd6b28af563a1b4da0411f1da75","source":{"kind":"arxiv","id":"2502.02121","version":2},"attestation_state":"computed","paper":{"title":"BILBO: BILevel Bayesian Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bryan Kian Hsiang Low, Quoc Phong Nguyen, Ruth Wan Theng Chew","submitted_at":"2025-02-04T08:57:47Z","abstract_excerpt":"Bilevel optimization is characterized by a two-level optimization structure, where the upper-level problem is constrained by optimal lower-level solutions, and such structures are prevalent in real-world problems. The constraint by optimal lower-level solutions poses significant challenges, especially in noisy, constrained, and derivative-free settings, as repeating lower-level optimizations is sample inefficient and predicted lower-level solutions may be suboptimal. We present BILevel Bayesian Optimization (BILBO), a novel Bayesian optimization algorithm for general bilevel problems with blac"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2502.02121","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-02-04T08:57:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3a1ac65cde07b14df9a07e56d02cc2dd6027397fb79ff7e6ed89e99daee7966a","abstract_canon_sha256":"f6255925872fc27b783f11470b28d4fd6e4e3f2da377b25e4ac428b24cf21235"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:11:21.561789Z","signature_b64":"NZYYsLDMKNv2usdrcbdDcealnvUGb5FnLiHsbKm7Q3WIuRxJ3IOwF6ceyprT9SimR8tgyYKPw3/Ls3AajgMhBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8800f0aa93761fbf5bb24f2c7d955b5b6a58bd6b28af563a1b4da0411f1da75","last_reissued_at":"2026-07-05T11:11:21.561263Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:11:21.561263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"BILBO: BILevel Bayesian Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Bryan Kian Hsiang Low, Quoc Phong Nguyen, Ruth Wan Theng Chew","submitted_at":"2025-02-04T08:57:47Z","abstract_excerpt":"Bilevel optimization is characterized by a two-level optimization structure, where the upper-level problem is constrained by optimal lower-level solutions, and such structures are prevalent in real-world problems. The constraint by optimal lower-level solutions poses significant challenges, especially in noisy, constrained, and derivative-free settings, as repeating lower-level optimizations is sample inefficient and predicted lower-level solutions may be suboptimal. We present BILevel Bayesian Optimization (BILBO), a novel Bayesian optimization algorithm for general bilevel problems with blac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.02121","kind":"arxiv","version":2},"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/2502.02121/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2502.02121","created_at":"2026-07-05T11:11:21.561324+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.02121v2","created_at":"2026-07-05T11:11:21.561324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.02121","created_at":"2026-07-05T11:11:21.561324+00:00"},{"alias_kind":"pith_short_12","alias_value":"XCAA6CVJG5Q7","created_at":"2026-07-05T11:11:21.561324+00:00"},{"alias_kind":"pith_short_16","alias_value":"XCAA6CVJG5Q7X5N3","created_at":"2026-07-05T11:11:21.561324+00:00"},{"alias_kind":"pith_short_8","alias_value":"XCAA6CVJ","created_at":"2026-07-05T11:11:21.561324+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.30531","citing_title":"Benchmarking Bilevel Derivative-Free Optimization Algorithms","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.20962","citing_title":"No-regret optimization of time-varying bilevel problems","ref_index":180,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XCAA6CVJG5Q7X5N3ETZMPWKVWW","json":"https://pith.science/pith/XCAA6CVJG5Q7X5N3ETZMPWKVWW.json","graph_json":"https://pith.science/api/pith-number/XCAA6CVJG5Q7X5N3ETZMPWKVWW/graph.json","events_json":"https://pith.science/api/pith-number/XCAA6CVJG5Q7X5N3ETZMPWKVWW/events.json","paper":"https://pith.science/paper/XCAA6CVJ"},"agent_actions":{"view_html":"https://pith.science/pith/XCAA6CVJG5Q7X5N3ETZMPWKVWW","download_json":"https://pith.science/pith/XCAA6CVJG5Q7X5N3ETZMPWKVWW.json","view_paper":"https://pith.science/paper/XCAA6CVJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.02121&json=true","fetch_graph":"https://pith.science/api/pith-number/XCAA6CVJG5Q7X5N3ETZMPWKVWW/graph.json","fetch_events":"https://pith.science/api/pith-number/XCAA6CVJG5Q7X5N3ETZMPWKVWW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XCAA6CVJG5Q7X5N3ETZMPWKVWW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XCAA6CVJG5Q7X5N3ETZMPWKVWW/action/storage_attestation","attest_author":"https://pith.science/pith/XCAA6CVJG5Q7X5N3ETZMPWKVWW/action/author_attestation","sign_citation":"https://pith.science/pith/XCAA6CVJG5Q7X5N3ETZMPWKVWW/action/citation_signature","submit_replication":"https://pith.science/pith/XCAA6CVJG5Q7X5N3ETZMPWKVWW/action/replication_record"}},"created_at":"2026-07-05T11:11:21.561324+00:00","updated_at":"2026-07-05T11:11:21.561324+00:00"}