{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:2RTRNKAF6QUUFFXRWOJY62WOHQ","short_pith_number":"pith:2RTRNKAF","schema_version":"1.0","canonical_sha256":"d46716a805f4294296f1b3938f6ace3c1ba73750084587e3f456ae329102c025","source":{"kind":"arxiv","id":"2605.14409","version":1},"attestation_state":"computed","paper":{"title":"On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","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.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chang He, Mingyi Hong, Shuzhong Zhang, Xiaotian Jiang","submitted_at":"2026-05-14T05:52:04Z","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"},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.14409","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T05:52:04Z","cross_cats_sorted":[],"title_canon_sha256":"cf0b67444fa1a650d168747a0c69442117b2d60fe1b7c9ba4d52df23de85d748","abstract_canon_sha256":"7f3b02ca9550728ad01c4248622e233ddb6745b926fa8ad36507d1adb0c0a67d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:07.387784Z","signature_b64":"vvK3ZCCFp4JH5UdAG8FGnXRt8ptq5uSAliQk/IL2jxINaiSPGky9ETOmLNAdXOBDz7F7HJsOLs9J9EACp1ctDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d46716a805f4294296f1b3938f6ace3c1ba73750084587e3f456ae329102c025","last_reissued_at":"2026-05-17T23:39:07.387165Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:07.387165Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","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.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Chang He, Mingyi Hong, Shuzhong Zhang, Xiaotian Jiang","submitted_at":"2026-05-14T05:52:04Z","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"},"claims":{"count":4,"items":[{"kind":"strongest_claim","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.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","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.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","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.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","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.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"a8059078787759f6c82b079900a9fba6702e4ae168bda8d71230854671bff82d"},"source":{"id":"2605.14409","kind":"arxiv","version":1},"verdict":{"id":"0c936ba0-86a1-4188-839a-4b6b7f441f8a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:53:42.973453Z","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.","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","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.","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."},"references":{"count":91,"sample":[{"doi":"","year":2012,"title":"Stackelberg network pricing games , author=. Algorithmica , volume=. 2012 , publisher=","work_id":"1a6349fb-8306-4e3a-a0d5-202a9c9c2be9","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2002,"title":"Ba. A. Journal of optimization theory and applications , volume=. 2002 , publisher=","work_id":"107a316f-c451-4506-9d14-a74f62db9510","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Advances in Neural Information Processing Systems , volume=","work_id":"2d54371b-4dda-4473-8db5-0daae3750905","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Advances in Neural Information Processing Systems , volume=","work_id":"a72f5916-e7fb-42d7-b747-17e5b9de24da","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"Journal of the Operations Research Society of Japan , volume=","work_id":"e8cabd04-bcde-4005-be9f-5b3d5ec978c1","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":91,"snapshot_sha256":"fb270ad7ac510df078811c31ebb2bd761bd178bbfd16691e77c46660f3753c11","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ef2e5069e4eb46a187d33be02d881e28af88e30ef06e183cf6dbcf904ba21753"},"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":"2605.14409","created_at":"2026-05-17T23:39:07.387279+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14409v1","created_at":"2026-05-17T23:39:07.387279+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14409","created_at":"2026-05-17T23:39:07.387279+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RTRNKAF6QUU","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RTRNKAF6QUUFFXR","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RTRNKAF","created_at":"2026-05-18T12:33:37.589309+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2RTRNKAF6QUUFFXRWOJY62WOHQ","json":"https://pith.science/pith/2RTRNKAF6QUUFFXRWOJY62WOHQ.json","graph_json":"https://pith.science/api/pith-number/2RTRNKAF6QUUFFXRWOJY62WOHQ/graph.json","events_json":"https://pith.science/api/pith-number/2RTRNKAF6QUUFFXRWOJY62WOHQ/events.json","paper":"https://pith.science/paper/2RTRNKAF"},"agent_actions":{"view_html":"https://pith.science/pith/2RTRNKAF6QUUFFXRWOJY62WOHQ","download_json":"https://pith.science/pith/2RTRNKAF6QUUFFXRWOJY62WOHQ.json","view_paper":"https://pith.science/paper/2RTRNKAF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14409&json=true","fetch_graph":"https://pith.science/api/pith-number/2RTRNKAF6QUUFFXRWOJY62WOHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/2RTRNKAF6QUUFFXRWOJY62WOHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RTRNKAF6QUUFFXRWOJY62WOHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RTRNKAF6QUUFFXRWOJY62WOHQ/action/storage_attestation","attest_author":"https://pith.science/pith/2RTRNKAF6QUUFFXRWOJY62WOHQ/action/author_attestation","sign_citation":"https://pith.science/pith/2RTRNKAF6QUUFFXRWOJY62WOHQ/action/citation_signature","submit_replication":"https://pith.science/pith/2RTRNKAF6QUUFFXRWOJY62WOHQ/action/replication_record"}},"created_at":"2026-05-17T23:39:07.387279+00:00","updated_at":"2026-05-17T23:39:07.387279+00:00"}