{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:DUTLKA452ICOMOQCUGZBCRYWGE","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":"782fd70eacd83508f454d6c576ec4da58867fb8575a0868e2936196167c6db48","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-12T07:56:43Z","title_canon_sha256":"bcf4b69549180ea4357bb977acfe729a9f56d9501dbe30eae16d9cbfcf74abad"},"schema_version":"1.0","source":{"id":"1908.04040","kind":"arxiv","version":11}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04040","created_at":"2026-07-05T08:43:04Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04040v11","created_at":"2026-07-05T08:43:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04040","created_at":"2026-07-05T08:43:04Z"},{"alias_kind":"pith_short_12","alias_value":"DUTLKA452ICO","created_at":"2026-07-05T08:43:04Z"},{"alias_kind":"pith_short_16","alias_value":"DUTLKA452ICOMOQC","created_at":"2026-07-05T08:43:04Z"},{"alias_kind":"pith_short_8","alias_value":"DUTLKA45","created_at":"2026-07-05T08:43:04Z"}],"graph_snapshots":[{"event_id":"sha256:73b11738bc45695cc844f4ffcd88cf65ba18b78f505d67d750edceb2a37d5a4b","target":"graph","created_at":"2026-07-05T08:43:04Z","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/1908.04040/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bilevel optimization problems embed the optimality of a subproblem as a constraint of another optimization problem. We introduce the concept of near-optimality robustness for bilevel optimization, protecting the upper-level solution feasibility from limited deviations from the optimal solution at the lower level. General properties and necessary conditions for the existence of solutions are derived for near-optimal robust versions of general bilevel optimization problems. A duality-based solution method is defined when the lower level is convex, leveraging the methodology from the robust and b","authors_text":"Luce Brotcorne, Mathieu Besan\\c{c}on, Miguel F. Anjos","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-12T07:56:43Z","title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04040","kind":"arxiv","version":11},"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:99547f0ce727b1a217b90b4b15b7241c58202079d385e4608264615baf997671","target":"record","created_at":"2026-07-05T08:43:04Z","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":"782fd70eacd83508f454d6c576ec4da58867fb8575a0868e2936196167c6db48","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-12T07:56:43Z","title_canon_sha256":"bcf4b69549180ea4357bb977acfe729a9f56d9501dbe30eae16d9cbfcf74abad"},"schema_version":"1.0","source":{"id":"1908.04040","kind":"arxiv","version":11}},"canonical_sha256":"1d26b5039dd204e63a02a1b21147163112481801cf164d6ebdb76be3666abb8b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1d26b5039dd204e63a02a1b21147163112481801cf164d6ebdb76be3666abb8b","first_computed_at":"2026-07-05T08:43:04.048775Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:43:04.048775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rwJ0YVNlAItf64p3nDaxCuomAJzG/aJkrv4XK6FkZrHdVPDUK4NHAE/cR+QX/+oZQl5l3XpkiAWE6JWKB7MXDw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:43:04.049257Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04040","source_kind":"arxiv","source_version":11}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:99547f0ce727b1a217b90b4b15b7241c58202079d385e4608264615baf997671","sha256:73b11738bc45695cc844f4ffcd88cf65ba18b78f505d67d750edceb2a37d5a4b"],"state_sha256":"ee65dc64383f15fbeb06336cb43af0c4c7d613219a10765be29570b72c7f9de5"}