{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:DUTLKA452ICOMOQCUGZBCRYWGE","short_pith_number":"pith:DUTLKA45","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"},"canonical_sha256":"1d26b5039dd204e63a02a1b21147163112481801cf164d6ebdb76be3666abb8b","source":{"kind":"arxiv","id":"1908.04040","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:DUTLKA452ICOMOQCUGZBCRYWGE","target":"record","payload":{"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"},"canonical_sha256":"1d26b5039dd204e63a02a1b21147163112481801cf164d6ebdb76be3666abb8b","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"},"source_kind":"arxiv","source_id":"1908.04040","source_version":11,"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-07-05T08:43:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Z0JBCh9eW3vtncR44k/M6qKyXgz/2oRhLg8TuywFXcJ998b2y4+/Z/r1ftk7I4amqMMilLHdLr0Y/g2Z1QcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:30:55.118252Z"},"content_sha256":"99547f0ce727b1a217b90b4b15b7241c58202079d385e4608264615baf997671","schema_version":"1.0","event_id":"sha256:99547f0ce727b1a217b90b4b15b7241c58202079d385e4608264615baf997671"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:DUTLKA452ICOMOQCUGZBCRYWGE","target":"graph","payload":{"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"},"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-07-05T08:43:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6FFgghGbw2+kb8M9eM8Wt4i4TyuXxSpovX+TJyuYUtHSsSmS89N0ALF7DgwIXh80tWdnH5ZzWFoJ0GPdlCo1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T15:30:55.193999Z"},"content_sha256":"73b11738bc45695cc844f4ffcd88cf65ba18b78f505d67d750edceb2a37d5a4b","schema_version":"1.0","event_id":"sha256:73b11738bc45695cc844f4ffcd88cf65ba18b78f505d67d750edceb2a37d5a4b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DUTLKA452ICOMOQCUGZBCRYWGE/bundle.json","state_url":"https://pith.science/pith/DUTLKA452ICOMOQCUGZBCRYWGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DUTLKA452ICOMOQCUGZBCRYWGE/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-08-16T15:30:55Z","links":{"resolver":"https://pith.science/pith/DUTLKA452ICOMOQCUGZBCRYWGE","bundle":"https://pith.science/pith/DUTLKA452ICOMOQCUGZBCRYWGE/bundle.json","state":"https://pith.science/pith/DUTLKA452ICOMOQCUGZBCRYWGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DUTLKA452ICOMOQCUGZBCRYWGE/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XcdAXUFGOrqYwNosX0OGpUnt6GNzu4dQLt8deM4ShezapR84/eTbowfmSo9MUk1v1s9E888jvC5PnKoF+4hYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T15:30:55.294634Z","bundle_sha256":"8e02d45d7ab87b5d5caa17e0d8eb68b548a552f2a06969f133ea5e19516ad790"}}