{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:2RTRNKAF6QUUFFXRWOJY62WOHQ","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":"7f3b02ca9550728ad01c4248622e233ddb6745b926fa8ad36507d1adb0c0a67d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T05:52:04Z","title_canon_sha256":"cf0b67444fa1a650d168747a0c69442117b2d60fe1b7c9ba4d52df23de85d748"},"schema_version":"1.0","source":{"id":"2605.14409","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14409","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14409v1","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14409","created_at":"2026-05-17T23:39:07Z"},{"alias_kind":"pith_short_12","alias_value":"2RTRNKAF6QUU","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"2RTRNKAF6QUUFFXR","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"2RTRNKAF","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:a721b3110d41a40f7bafad20d7da66435cf3df4213b2daf7adc3a55f621de977","target":"graph","created_at":"2026-05-17T23:39:07Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"the requirement that these conditions hold at every upper-level variable x is strong, in the sense that it is non-prevalent: there exist problems for which no sufficiently small perturbation of the lower-level objective and constraints can make the conditions hold at every x."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The rigidity theorems assume that the lower-level problem is defined by smooth functions and that the structural invariants (e.g., active-set signatures) are well-defined and constant when the regularity conditions hold; this may fail for non-smooth or degenerate lower-level problems not covered by the counterexamples."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Requiring LICQ/SCS/SOSC everywhere in bilevel optimization is non-prevalent and rigid, while holding almost everywhere is prevalent, but the distinction introduces fundamental difficulties."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Requiring lower-level regularity conditions at every upper-level point in bilevel optimization is non-prevalent, as structural invariants cannot be made consistent by small perturbations."}],"snapshot_sha256":"a8059078787759f6c82b079900a9fba6702e4ae168bda8d71230854671bff82d"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ef2e5069e4eb46a187d33be02d881e28af88e30ef06e183cf6dbcf904ba21753"},"paper":{"abstract_excerpt":"In this paper, we study the regularity assumptions commonly adopted in bilevel optimization with constrained lower-level problems, including the linear independence constraint qualification, the strict complementary slackness condition, and the second-order sufficient condition. These conditions are typically required to hold for the lower-level problem at every upper-level variable $x$. We first show that the requirement that these conditions hold at every upper-level variable $x$ is strong, in the sense that it is non-prevalent: there exist problems for which no sufficiently small perturbati","authors_text":"Chang He, Mingyi Hong, Shuzhong Zhang, Xiaotian Jiang","cross_cats":[],"headline":"Requiring lower-level regularity conditions at every upper-level point in bilevel optimization is non-prevalent, as structural invariants cannot be made consistent by small perturbations.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T05:52:04Z","title":"On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem"},"references":{"count":91,"internal_anchors":0,"resolved_work":91,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Stackelberg network pricing games , author=. Algorithmica , volume=. 2012 , publisher=","work_id":"1a6349fb-8306-4e3a-a0d5-202a9c9c2be9","year":2012},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Ba. A. Journal of optimization theory and applications , volume=. 2002 , publisher=","work_id":"107a316f-c451-4506-9d14-a74f62db9510","year":2002},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Advances in Neural Information Processing Systems , volume=","work_id":"2d54371b-4dda-4473-8db5-0daae3750905","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Advances in Neural Information Processing Systems , volume=","work_id":"a72f5916-e7fb-42d7-b747-17e5b9de24da","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Journal of the Operations Research Society of Japan , volume=","work_id":"e8cabd04-bcde-4005-be9f-5b3d5ec978c1","year":2015}],"snapshot_sha256":"fb270ad7ac510df078811c31ebb2bd761bd178bbfd16691e77c46660f3753c11"},"source":{"id":"2605.14409","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:53:42.973453Z","id":"0c936ba0-86a1-4188-839a-4b6b7f441f8a","model_set":{"reader":"grok-4.3"},"one_line_summary":"Requiring LICQ/SCS/SOSC everywhere in bilevel optimization is non-prevalent and rigid, while holding almost everywhere is prevalent, but the distinction introduces fundamental difficulties.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Requiring lower-level regularity conditions at every upper-level point in bilevel optimization is non-prevalent, as structural invariants cannot be made consistent by small perturbations.","strongest_claim":"the requirement that these conditions hold at every upper-level variable x is strong, in the sense that it is non-prevalent: there exist problems for which no sufficiently small perturbation of the lower-level objective and constraints can make the conditions hold at every x.","weakest_assumption":"The rigidity theorems assume that the lower-level problem is defined by smooth functions and that the structural invariants (e.g., active-set signatures) are well-defined and constant when the regularity conditions hold; this may fail for non-smooth or degenerate lower-level problems not covered by the counterexamples."}},"verdict_id":"0c936ba0-86a1-4188-839a-4b6b7f441f8a"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:f3c428b9fc0ada705efbcba9445ecf359b53de9261d2bdd858f5e6a530f8ea23","target":"record","created_at":"2026-05-17T23:39:07Z","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":"7f3b02ca9550728ad01c4248622e233ddb6745b926fa8ad36507d1adb0c0a67d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T05:52:04Z","title_canon_sha256":"cf0b67444fa1a650d168747a0c69442117b2d60fe1b7c9ba4d52df23de85d748"},"schema_version":"1.0","source":{"id":"2605.14409","kind":"arxiv","version":1}},"canonical_sha256":"d46716a805f4294296f1b3938f6ace3c1ba73750084587e3f456ae329102c025","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d46716a805f4294296f1b3938f6ace3c1ba73750084587e3f456ae329102c025","first_computed_at":"2026-05-17T23:39:07.387165Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:07.387165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vvK3ZCCFp4JH5UdAG8FGnXRt8ptq5uSAliQk/IL2jxINaiSPGky9ETOmLNAdXOBDz7F7HJsOLs9J9EACp1ctDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:07.387784Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14409","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f3c428b9fc0ada705efbcba9445ecf359b53de9261d2bdd858f5e6a530f8ea23","sha256:a721b3110d41a40f7bafad20d7da66435cf3df4213b2daf7adc3a55f621de977"],"state_sha256":"2a9f2a33bd3c54c7eb13f29280cdcfdfd2e9bf6484c7c61972662566cb25da55"}