{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:W54U7ZKP3CFU72QJBMKOVM53OK","short_pith_number":"pith:W54U7ZKP","canonical_record":{"source":{"id":"2110.13755","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-26T15:06:21Z","cross_cats_sorted":[],"title_canon_sha256":"1f592e26a55044bb03119348009ad2ba49a9a3ff2183d62a111ccb5dd1f43db9","abstract_canon_sha256":"a820e24ad4632b1995009753ec526b453def40deadb658c89bd03c96bba39cd0"},"schema_version":"1.0"},"canonical_sha256":"b7794fe54fd88b4fea090b14eab3bb72bdee43d82c750fd18b3660b00b94f971","source":{"kind":"arxiv","id":"2110.13755","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.13755","created_at":"2026-07-05T08:53:59Z"},{"alias_kind":"arxiv_version","alias_value":"2110.13755v2","created_at":"2026-07-05T08:53:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.13755","created_at":"2026-07-05T08:53:59Z"},{"alias_kind":"pith_short_12","alias_value":"W54U7ZKP3CFU","created_at":"2026-07-05T08:53:59Z"},{"alias_kind":"pith_short_16","alias_value":"W54U7ZKP3CFU72QJ","created_at":"2026-07-05T08:53:59Z"},{"alias_kind":"pith_short_8","alias_value":"W54U7ZKP","created_at":"2026-07-05T08:53:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:W54U7ZKP3CFU72QJBMKOVM53OK","target":"record","payload":{"canonical_record":{"source":{"id":"2110.13755","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-26T15:06:21Z","cross_cats_sorted":[],"title_canon_sha256":"1f592e26a55044bb03119348009ad2ba49a9a3ff2183d62a111ccb5dd1f43db9","abstract_canon_sha256":"a820e24ad4632b1995009753ec526b453def40deadb658c89bd03c96bba39cd0"},"schema_version":"1.0"},"canonical_sha256":"b7794fe54fd88b4fea090b14eab3bb72bdee43d82c750fd18b3660b00b94f971","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:59.861959Z","signature_b64":"9PMQBuamd55H7hVOixx3AlVs6MSHuzHgzv3QM/34me9bqtEKBlTaDMH/TpnAqCtNpicHSYhYKfadBRsZ1w/hBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7794fe54fd88b4fea090b14eab3bb72bdee43d82c750fd18b3660b00b94f971","last_reissued_at":"2026-07-05T08:53:59.861565Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:59.861565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.13755","source_version":2,"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:53:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6D8Hg9ki6ws7S8r3a3DhA2/8zT2gOgUMT+YgwnMdolr3TNuqy20a717FtS7+3OaqtygOsvoBuw/fnj3KAg4iBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:34:56.349481Z"},"content_sha256":"37c08d6fd651344e77250540f8c07a67c34869fab247fa95349f6b4a5c6675fd","schema_version":"1.0","event_id":"sha256:37c08d6fd651344e77250540f8c07a67c34869fab247fa95349f6b4a5c6675fd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:W54U7ZKP3CFU72QJBMKOVM53OK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scholtes relaxation method for pessimistic bilevel optimization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alain Zemkoho, Imane Benchouk, Khadra Nachi","submitted_at":"2021-10-26T15:06:21Z","abstract_excerpt":"When the lower-level optimal solution set-valued mapping of a bilevel optimization problem is not single-valued, we are faced with an ill-posed problem, which gives rise to the optimistic and pessimistic bilevel optimization problems, as tractable algorithmic frameworks. However, solving the pessimistic bilevel optimization problem is far more challenging than the optimistic one; hence, the literature has mostly been dedicated to the latter class of the problem. The Scholtes relaxation has appeared to be one of the simplest and most efficient ways to solve the optimistic bilevel optimization p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.13755","kind":"arxiv","version":2},"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/2110.13755/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:53:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fvUWRIfvi3vw+SaYR/rZvBszhoGI8cfr+k824DeoztHrEY7wzjtAG+/h1RjADivvwa5u473t+k7Aq0v3fTE2Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T21:34:56.350022Z"},"content_sha256":"391b245014353b513afed5313320370fc6f233ff5bb59403e2038e6579a4e55c","schema_version":"1.0","event_id":"sha256:391b245014353b513afed5313320370fc6f233ff5bb59403e2038e6579a4e55c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W54U7ZKP3CFU72QJBMKOVM53OK/bundle.json","state_url":"https://pith.science/pith/W54U7ZKP3CFU72QJBMKOVM53OK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W54U7ZKP3CFU72QJBMKOVM53OK/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-06T21:34:56Z","links":{"resolver":"https://pith.science/pith/W54U7ZKP3CFU72QJBMKOVM53OK","bundle":"https://pith.science/pith/W54U7ZKP3CFU72QJBMKOVM53OK/bundle.json","state":"https://pith.science/pith/W54U7ZKP3CFU72QJBMKOVM53OK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W54U7ZKP3CFU72QJBMKOVM53OK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:W54U7ZKP3CFU72QJBMKOVM53OK","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":"a820e24ad4632b1995009753ec526b453def40deadb658c89bd03c96bba39cd0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-26T15:06:21Z","title_canon_sha256":"1f592e26a55044bb03119348009ad2ba49a9a3ff2183d62a111ccb5dd1f43db9"},"schema_version":"1.0","source":{"id":"2110.13755","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.13755","created_at":"2026-07-05T08:53:59Z"},{"alias_kind":"arxiv_version","alias_value":"2110.13755v2","created_at":"2026-07-05T08:53:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.13755","created_at":"2026-07-05T08:53:59Z"},{"alias_kind":"pith_short_12","alias_value":"W54U7ZKP3CFU","created_at":"2026-07-05T08:53:59Z"},{"alias_kind":"pith_short_16","alias_value":"W54U7ZKP3CFU72QJ","created_at":"2026-07-05T08:53:59Z"},{"alias_kind":"pith_short_8","alias_value":"W54U7ZKP","created_at":"2026-07-05T08:53:59Z"}],"graph_snapshots":[{"event_id":"sha256:391b245014353b513afed5313320370fc6f233ff5bb59403e2038e6579a4e55c","target":"graph","created_at":"2026-07-05T08:53: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/2110.13755/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"When the lower-level optimal solution set-valued mapping of a bilevel optimization problem is not single-valued, we are faced with an ill-posed problem, which gives rise to the optimistic and pessimistic bilevel optimization problems, as tractable algorithmic frameworks. However, solving the pessimistic bilevel optimization problem is far more challenging than the optimistic one; hence, the literature has mostly been dedicated to the latter class of the problem. The Scholtes relaxation has appeared to be one of the simplest and most efficient ways to solve the optimistic bilevel optimization p","authors_text":"Alain Zemkoho, Imane Benchouk, Khadra Nachi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-26T15:06:21Z","title":"Scholtes relaxation method for pessimistic bilevel optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.13755","kind":"arxiv","version":2},"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:37c08d6fd651344e77250540f8c07a67c34869fab247fa95349f6b4a5c6675fd","target":"record","created_at":"2026-07-05T08:53: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":"a820e24ad4632b1995009753ec526b453def40deadb658c89bd03c96bba39cd0","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2021-10-26T15:06:21Z","title_canon_sha256":"1f592e26a55044bb03119348009ad2ba49a9a3ff2183d62a111ccb5dd1f43db9"},"schema_version":"1.0","source":{"id":"2110.13755","kind":"arxiv","version":2}},"canonical_sha256":"b7794fe54fd88b4fea090b14eab3bb72bdee43d82c750fd18b3660b00b94f971","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7794fe54fd88b4fea090b14eab3bb72bdee43d82c750fd18b3660b00b94f971","first_computed_at":"2026-07-05T08:53:59.861565Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:53:59.861565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9PMQBuamd55H7hVOixx3AlVs6MSHuzHgzv3QM/34me9bqtEKBlTaDMH/TpnAqCtNpicHSYhYKfadBRsZ1w/hBA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:53:59.861959Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.13755","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37c08d6fd651344e77250540f8c07a67c34869fab247fa95349f6b4a5c6675fd","sha256:391b245014353b513afed5313320370fc6f233ff5bb59403e2038e6579a4e55c"],"state_sha256":"fc992d09d689b37e2ce538140249702d4d3668a265fe3e1a3c2614d45a21c4af"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AmO2DlPaYRQYBi/kRgFSqz2wAbvEeE3T45aojmN3W5/DmGIC3dJZtwu9aDAVOIcB0rqKPHTNQm8VJ/UIch47Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T21:34:56.355430Z","bundle_sha256":"e05a0906c6a6ea8ec0ba196fcce90fc294598f051a102150ebae2e132478c3cf"}}