{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3PRAAASYSJ3AW4WQLSVOJJOLTD","short_pith_number":"pith:3PRAAASY","schema_version":"1.0","canonical_sha256":"dbe200025892760b72d05caae4a5cb98cf1ac01e3e17eb7c560f419fe9614320","source":{"kind":"arxiv","id":"2411.13394","version":2},"attestation_state":"computed","paper":{"title":"CB$^2$O: Consensus-Based Bi-Level Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Konstantin Riedl, Nicol\\'as Garc\\'ia Trillos, Sixu Li, Yuhua Zhu","submitted_at":"2024-11-20T15:29:53Z","abstract_excerpt":"Bi-level optimization problems, where one wishes to find the global minimizer of an upper-level objective function over the globally optimal solution set of a lower-level objective, arise in a variety of scenarios throughout science and engineering, machine learning, and artificial intelligence. In this paper, we propose and investigate, analytically and experimentally, consensus-based bi-level optimization (CB$^2$O), a multi-particle metaheuristic derivative-free optimization method designed to solve bi-level optimization problems when both objectives may be nonconvex. Our method leverages wi"},"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":"2411.13394","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-11-20T15:29:53Z","cross_cats_sorted":["math.AP"],"title_canon_sha256":"967b2e965c8a789f6e29783b744fe8d1c5e8a382f015cf291af0be35a98421d5","abstract_canon_sha256":"c866d6c77544886f28440475bc9fc2e7073774e059d911b18ff026dc71d2fc93"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:01:02.507089Z","signature_b64":"xPpSkOUGcSZrhHY/geSQjjWHMAsvwlHhgMXWQMjWPJ6j25zfWNPKwxo1gc00dBO69ao+oxD0QCqeoz1PV260Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbe200025892760b72d05caae4a5cb98cf1ac01e3e17eb7c560f419fe9614320","last_reissued_at":"2026-07-05T11:01:02.506586Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:01:02.506586Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CB$^2$O: Consensus-Based Bi-Level Optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.AP"],"primary_cat":"math.OC","authors_text":"Konstantin Riedl, Nicol\\'as Garc\\'ia Trillos, Sixu Li, Yuhua Zhu","submitted_at":"2024-11-20T15:29:53Z","abstract_excerpt":"Bi-level optimization problems, where one wishes to find the global minimizer of an upper-level objective function over the globally optimal solution set of a lower-level objective, arise in a variety of scenarios throughout science and engineering, machine learning, and artificial intelligence. In this paper, we propose and investigate, analytically and experimentally, consensus-based bi-level optimization (CB$^2$O), a multi-particle metaheuristic derivative-free optimization method designed to solve bi-level optimization problems when both objectives may be nonconvex. Our method leverages wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.13394","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/2411.13394/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":"2411.13394","created_at":"2026-07-05T11:01:02.506643+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.13394v2","created_at":"2026-07-05T11:01:02.506643+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.13394","created_at":"2026-07-05T11:01:02.506643+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PRAAASYSJ3A","created_at":"2026-07-05T11:01:02.506643+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PRAAASYSJ3AW4WQ","created_at":"2026-07-05T11:01:02.506643+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PRAAASY","created_at":"2026-07-05T11:01:02.506643+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.19667","citing_title":"Convergence of Consensus-Based Particle Methods for Nonconvex Bi-Level Optimization","ref_index":182,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3PRAAASYSJ3AW4WQLSVOJJOLTD","json":"https://pith.science/pith/3PRAAASYSJ3AW4WQLSVOJJOLTD.json","graph_json":"https://pith.science/api/pith-number/3PRAAASYSJ3AW4WQLSVOJJOLTD/graph.json","events_json":"https://pith.science/api/pith-number/3PRAAASYSJ3AW4WQLSVOJJOLTD/events.json","paper":"https://pith.science/paper/3PRAAASY"},"agent_actions":{"view_html":"https://pith.science/pith/3PRAAASYSJ3AW4WQLSVOJJOLTD","download_json":"https://pith.science/pith/3PRAAASYSJ3AW4WQLSVOJJOLTD.json","view_paper":"https://pith.science/paper/3PRAAASY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.13394&json=true","fetch_graph":"https://pith.science/api/pith-number/3PRAAASYSJ3AW4WQLSVOJJOLTD/graph.json","fetch_events":"https://pith.science/api/pith-number/3PRAAASYSJ3AW4WQLSVOJJOLTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PRAAASYSJ3AW4WQLSVOJJOLTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PRAAASYSJ3AW4WQLSVOJJOLTD/action/storage_attestation","attest_author":"https://pith.science/pith/3PRAAASYSJ3AW4WQLSVOJJOLTD/action/author_attestation","sign_citation":"https://pith.science/pith/3PRAAASYSJ3AW4WQLSVOJJOLTD/action/citation_signature","submit_replication":"https://pith.science/pith/3PRAAASYSJ3AW4WQLSVOJJOLTD/action/replication_record"}},"created_at":"2026-07-05T11:01:02.506643+00:00","updated_at":"2026-07-05T11:01:02.506643+00:00"}