{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:DUTLKA452ICOMOQCUGZBCRYWGE","short_pith_number":"pith:DUTLKA45","schema_version":"1.0","canonical_sha256":"1d26b5039dd204e63a02a1b21147163112481801cf164d6ebdb76be3666abb8b","source":{"kind":"arxiv","id":"1908.04040","version":11},"attestation_state":"computed","paper":{"title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"Luce Brotcorne, Mathieu Besan\\c{c}on, Miguel F. Anjos","submitted_at":"2019-08-12T07:56:43Z","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"},"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":"1908.04040","kind":"arxiv","version":11},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-08-12T07:56:43Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"bcf4b69549180ea4357bb977acfe729a9f56d9501dbe30eae16d9cbfcf74abad","abstract_canon_sha256":"782fd70eacd83508f454d6c576ec4da58867fb8575a0868e2936196167c6db48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:43:04.049257Z","signature_b64":"rwJ0YVNlAItf64p3nDaxCuomAJzG/aJkrv4XK6FkZrHdVPDUK4NHAE/cR+QX/+oZQl5l3XpkiAWE6JWKB7MXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d26b5039dd204e63a02a1b21147163112481801cf164d6ebdb76be3666abb8b","last_reissued_at":"2026-07-05T08:43:04.048775Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:43:04.048775Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Robust Bilevel Optimization for Near-Optimal Lower-Level Solutions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"math.OC","authors_text":"Luce Brotcorne, Mathieu Besan\\c{c}on, Miguel F. Anjos","submitted_at":"2019-08-12T07:56:43Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04040","kind":"arxiv","version":11},"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/1908.04040/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":"1908.04040","created_at":"2026-07-05T08:43:04.048835+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04040v11","created_at":"2026-07-05T08:43:04.048835+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04040","created_at":"2026-07-05T08:43:04.048835+00:00"},{"alias_kind":"pith_short_12","alias_value":"DUTLKA452ICO","created_at":"2026-07-05T08:43:04.048835+00:00"},{"alias_kind":"pith_short_16","alias_value":"DUTLKA452ICOMOQC","created_at":"2026-07-05T08:43:04.048835+00:00"},{"alias_kind":"pith_short_8","alias_value":"DUTLKA45","created_at":"2026-07-05T08:43:04.048835+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/DUTLKA452ICOMOQCUGZBCRYWGE","json":"https://pith.science/pith/DUTLKA452ICOMOQCUGZBCRYWGE.json","graph_json":"https://pith.science/api/pith-number/DUTLKA452ICOMOQCUGZBCRYWGE/graph.json","events_json":"https://pith.science/api/pith-number/DUTLKA452ICOMOQCUGZBCRYWGE/events.json","paper":"https://pith.science/paper/DUTLKA45"},"agent_actions":{"view_html":"https://pith.science/pith/DUTLKA452ICOMOQCUGZBCRYWGE","download_json":"https://pith.science/pith/DUTLKA452ICOMOQCUGZBCRYWGE.json","view_paper":"https://pith.science/paper/DUTLKA45","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04040&json=true","fetch_graph":"https://pith.science/api/pith-number/DUTLKA452ICOMOQCUGZBCRYWGE/graph.json","fetch_events":"https://pith.science/api/pith-number/DUTLKA452ICOMOQCUGZBCRYWGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DUTLKA452ICOMOQCUGZBCRYWGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DUTLKA452ICOMOQCUGZBCRYWGE/action/storage_attestation","attest_author":"https://pith.science/pith/DUTLKA452ICOMOQCUGZBCRYWGE/action/author_attestation","sign_citation":"https://pith.science/pith/DUTLKA452ICOMOQCUGZBCRYWGE/action/citation_signature","submit_replication":"https://pith.science/pith/DUTLKA452ICOMOQCUGZBCRYWGE/action/replication_record"}},"created_at":"2026-07-05T08:43:04.048835+00:00","updated_at":"2026-07-05T08:43:04.048835+00:00"}