{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:GDTA7U6CRLKH6HWCGEE2VO4I52","short_pith_number":"pith:GDTA7U6C","schema_version":"1.0","canonical_sha256":"30e60fd3c28ad47f1ec23109aabb88eea3c2fdd63f39fedd61ea5ef23e856ca1","source":{"kind":"arxiv","id":"2605.30531","version":1},"attestation_state":"computed","paper":{"title":"Benchmarking Bilevel Derivative-Free Optimization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Charles Audet, Valentin Dijon, Youssef Diouane","submitted_at":"2026-05-28T20:08:13Z","abstract_excerpt":"Bilevel optimization involves an upper-level and a lower-level decision maker. The lower-level optimization problem is nested within the constraints of the upper-level one. A point is said to be admissible for the bilevel problem if it satisfies all constraints and is optimal for the lower-level decision-maker. Bilevel derivative-free optimization (BL-DFO) algorithms address bilevel optimization problems in which either the upper-level or the lower-level problem is solved using a derivative-free optimization method. In this context, existing BL-DFO benchmarking techniques often do not rigorous"},"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":"2605.30531","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-28T20:08:13Z","cross_cats_sorted":[],"title_canon_sha256":"5f2de0a74401b0c04cff7880b6def48563f86c0b2a067a5ab04c5632c534dde3","abstract_canon_sha256":"c686a3fc057316bdbb6271121c32a07ebfda8877ea02cf70a468da463c37ec42"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-01T01:02:59.423337Z","signature_b64":"jBZmnGb/51RDMZskHOFrarJSlIPnXw193lDTDtfxnEsUFQkRQUdJjfRrq+9xce7Z5aM7j3vzXmweFKp2eqqeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30e60fd3c28ad47f1ec23109aabb88eea3c2fdd63f39fedd61ea5ef23e856ca1","last_reissued_at":"2026-06-01T01:02:59.422378Z","signature_status":"signed_v1","first_computed_at":"2026-06-01T01:02:59.422378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Benchmarking Bilevel Derivative-Free Optimization Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Charles Audet, Valentin Dijon, Youssef Diouane","submitted_at":"2026-05-28T20:08:13Z","abstract_excerpt":"Bilevel optimization involves an upper-level and a lower-level decision maker. The lower-level optimization problem is nested within the constraints of the upper-level one. A point is said to be admissible for the bilevel problem if it satisfies all constraints and is optimal for the lower-level decision-maker. Bilevel derivative-free optimization (BL-DFO) algorithms address bilevel optimization problems in which either the upper-level or the lower-level problem is solved using a derivative-free optimization method. In this context, existing BL-DFO benchmarking techniques often do not rigorous"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30531","kind":"arxiv","version":1},"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/2605.30531/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":"2605.30531","created_at":"2026-06-01T01:02:59.422517+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.30531v1","created_at":"2026-06-01T01:02:59.422517+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30531","created_at":"2026-06-01T01:02:59.422517+00:00"},{"alias_kind":"pith_short_12","alias_value":"GDTA7U6CRLKH","created_at":"2026-06-01T01:02:59.422517+00:00"},{"alias_kind":"pith_short_16","alias_value":"GDTA7U6CRLKH6HWC","created_at":"2026-06-01T01:02:59.422517+00:00"},{"alias_kind":"pith_short_8","alias_value":"GDTA7U6C","created_at":"2026-06-01T01:02:59.422517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GDTA7U6CRLKH6HWCGEE2VO4I52","json":"https://pith.science/pith/GDTA7U6CRLKH6HWCGEE2VO4I52.json","graph_json":"https://pith.science/api/pith-number/GDTA7U6CRLKH6HWCGEE2VO4I52/graph.json","events_json":"https://pith.science/api/pith-number/GDTA7U6CRLKH6HWCGEE2VO4I52/events.json","paper":"https://pith.science/paper/GDTA7U6C"},"agent_actions":{"view_html":"https://pith.science/pith/GDTA7U6CRLKH6HWCGEE2VO4I52","download_json":"https://pith.science/pith/GDTA7U6CRLKH6HWCGEE2VO4I52.json","view_paper":"https://pith.science/paper/GDTA7U6C","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.30531&json=true","fetch_graph":"https://pith.science/api/pith-number/GDTA7U6CRLKH6HWCGEE2VO4I52/graph.json","fetch_events":"https://pith.science/api/pith-number/GDTA7U6CRLKH6HWCGEE2VO4I52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GDTA7U6CRLKH6HWCGEE2VO4I52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GDTA7U6CRLKH6HWCGEE2VO4I52/action/storage_attestation","attest_author":"https://pith.science/pith/GDTA7U6CRLKH6HWCGEE2VO4I52/action/author_attestation","sign_citation":"https://pith.science/pith/GDTA7U6CRLKH6HWCGEE2VO4I52/action/citation_signature","submit_replication":"https://pith.science/pith/GDTA7U6CRLKH6HWCGEE2VO4I52/action/replication_record"}},"created_at":"2026-06-01T01:02:59.422517+00:00","updated_at":"2026-06-01T01:02:59.422517+00:00"}