{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:GDTA7U6CRLKH6HWCGEE2VO4I52","short_pith_number":"pith:GDTA7U6C","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"},"canonical_sha256":"30e60fd3c28ad47f1ec23109aabb88eea3c2fdd63f39fedd61ea5ef23e856ca1","source":{"kind":"arxiv","id":"2605.30531","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30531","created_at":"2026-06-01T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30531v1","created_at":"2026-06-01T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30531","created_at":"2026-06-01T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"GDTA7U6CRLKH","created_at":"2026-06-01T01:02:59Z"},{"alias_kind":"pith_short_16","alias_value":"GDTA7U6CRLKH6HWC","created_at":"2026-06-01T01:02:59Z"},{"alias_kind":"pith_short_8","alias_value":"GDTA7U6C","created_at":"2026-06-01T01:02:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:GDTA7U6CRLKH6HWCGEE2VO4I52","target":"record","payload":{"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"},"canonical_sha256":"30e60fd3c28ad47f1ec23109aabb88eea3c2fdd63f39fedd61ea5ef23e856ca1","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"},"source_kind":"arxiv","source_id":"2605.30531","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-01T01:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3530LcsxuzVkV4FPI8tnxk4F1+utSDhtY7u/6pYP6julTbmqr0WdWie1qkAaH6/U8cL+BuVjzpvW1TuyZmKHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T16:30:41.823612Z"},"content_sha256":"8745ee07efbf918a6a0f445346aac189166688e4bbcbf0c2a39be7312d5f87b7","schema_version":"1.0","event_id":"sha256:8745ee07efbf918a6a0f445346aac189166688e4bbcbf0c2a39be7312d5f87b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:GDTA7U6CRLKH6HWCGEE2VO4I52","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-01T01:02:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E2G8dTLI1L9ZFtpeDJ+qcZpkAbfVCSWX8Rsgvbx5YUWGNL6DvZ0573TYXsVtGOyMUJ8cuORpvHHYVzA5WkEPAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T16:30:41.823985Z"},"content_sha256":"3d272d069ea8ac536a22084550ebffeb050f61f175de68c6da8bd1285a9c8753","schema_version":"1.0","event_id":"sha256:3d272d069ea8ac536a22084550ebffeb050f61f175de68c6da8bd1285a9c8753"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GDTA7U6CRLKH6HWCGEE2VO4I52/bundle.json","state_url":"https://pith.science/pith/GDTA7U6CRLKH6HWCGEE2VO4I52/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GDTA7U6CRLKH6HWCGEE2VO4I52/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-29T16:30:41Z","links":{"resolver":"https://pith.science/pith/GDTA7U6CRLKH6HWCGEE2VO4I52","bundle":"https://pith.science/pith/GDTA7U6CRLKH6HWCGEE2VO4I52/bundle.json","state":"https://pith.science/pith/GDTA7U6CRLKH6HWCGEE2VO4I52/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GDTA7U6CRLKH6HWCGEE2VO4I52/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:GDTA7U6CRLKH6HWCGEE2VO4I52","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":"c686a3fc057316bdbb6271121c32a07ebfda8877ea02cf70a468da463c37ec42","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-28T20:08:13Z","title_canon_sha256":"5f2de0a74401b0c04cff7880b6def48563f86c0b2a067a5ab04c5632c534dde3"},"schema_version":"1.0","source":{"id":"2605.30531","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.30531","created_at":"2026-06-01T01:02:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.30531v1","created_at":"2026-06-01T01:02:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.30531","created_at":"2026-06-01T01:02:59Z"},{"alias_kind":"pith_short_12","alias_value":"GDTA7U6CRLKH","created_at":"2026-06-01T01:02:59Z"},{"alias_kind":"pith_short_16","alias_value":"GDTA7U6CRLKH6HWC","created_at":"2026-06-01T01:02:59Z"},{"alias_kind":"pith_short_8","alias_value":"GDTA7U6C","created_at":"2026-06-01T01:02:59Z"}],"graph_snapshots":[{"event_id":"sha256:3d272d069ea8ac536a22084550ebffeb050f61f175de68c6da8bd1285a9c8753","target":"graph","created_at":"2026-06-01T01:02:59Z","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/2605.30531/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Charles Audet, Valentin Dijon, Youssef Diouane","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-28T20:08:13Z","title":"Benchmarking Bilevel Derivative-Free Optimization Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.30531","kind":"arxiv","version":1},"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:8745ee07efbf918a6a0f445346aac189166688e4bbcbf0c2a39be7312d5f87b7","target":"record","created_at":"2026-06-01T01:02:59Z","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":"c686a3fc057316bdbb6271121c32a07ebfda8877ea02cf70a468da463c37ec42","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-28T20:08:13Z","title_canon_sha256":"5f2de0a74401b0c04cff7880b6def48563f86c0b2a067a5ab04c5632c534dde3"},"schema_version":"1.0","source":{"id":"2605.30531","kind":"arxiv","version":1}},"canonical_sha256":"30e60fd3c28ad47f1ec23109aabb88eea3c2fdd63f39fedd61ea5ef23e856ca1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"30e60fd3c28ad47f1ec23109aabb88eea3c2fdd63f39fedd61ea5ef23e856ca1","first_computed_at":"2026-06-01T01:02:59.422378Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-01T01:02:59.422378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jBZmnGb/51RDMZskHOFrarJSlIPnXw193lDTDtfxnEsUFQkRQUdJjfRrq+9xce7Z5aM7j3vzXmweFKp2eqqeDQ==","signature_status":"signed_v1","signed_at":"2026-06-01T01:02:59.423337Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.30531","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8745ee07efbf918a6a0f445346aac189166688e4bbcbf0c2a39be7312d5f87b7","sha256:3d272d069ea8ac536a22084550ebffeb050f61f175de68c6da8bd1285a9c8753"],"state_sha256":"532c01a7ffa26ecd7e38f7fd1b6b839531536bf22eb7aa1b3b9072e08904a9b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YeOfsmohe1jP+zf9rr8lMoycllTqFZ917YlEzH6eRH+jTB0scm95oKTvIMsAtaO0X3ya0pmLucCReN53yR7MBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T16:30:41.826006Z","bundle_sha256":"5f3960aebee87b2bbfc8b9d5a27be5b628259688adbb8782ea90c0bd7fe80564"}}