{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:POG4YIUV7ZUBHEYLQ2GYDP7G63","short_pith_number":"pith:POG4YIUV","schema_version":"1.0","canonical_sha256":"7b8dcc2295fe6813930b868d81bfe6f6d81c086e9734952a1340e25626f1bb81","source":{"kind":"arxiv","id":"2606.01055","version":1},"attestation_state":"computed","paper":{"title":"Exact-Penalty Prox-Linear Methods for Bilevel Optimization with $\\ell_1$ Lower-Level Gradient Penalty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiani Li, Qingna Li, Yutong Zheng","submitted_at":"2026-05-31T06:51:14Z","abstract_excerpt":"Bilevel optimization is a fundamental framework for hierarchical decision-making, but its solution is challenging due to the implicit and typically set-valued nature of the lower-level optimality condition. In this paper,\n  we study bilevel optimization problems through an exact-penalty reformulation based on the $\\ell_1$-norm of the lower-level gradient. Under suitable regularity assumptions,\n  we show that this penalty defines a distance-bound function and yields an exact penalty property for sufficiently large penalty parameters.\n  To solve the resulting nonsmooth penalized problem, we prop"},"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":"2606.01055","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-31T06:51:14Z","cross_cats_sorted":[],"title_canon_sha256":"81c767469eafb224b73eff3d12eca7b018f003bdc4a8e4737a5e9a39e7e9aa71","abstract_canon_sha256":"d1b3fe764b785e27acf3540d535350ebbceef4f0d9888fa71abaabbdb9e03aef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T01:04:19.903920Z","signature_b64":"ZpsBs1KWsp0R/qK1DWTzOXZTZx2V838kBdntQw/IS/vPr3hBBb4ub1qMoPj+ETtxjFcCh42gXM2CmXbckvbmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7b8dcc2295fe6813930b868d81bfe6f6d81c086e9734952a1340e25626f1bb81","last_reissued_at":"2026-06-02T01:04:19.903483Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T01:04:19.903483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact-Penalty Prox-Linear Methods for Bilevel Optimization with $\\ell_1$ Lower-Level Gradient Penalty","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiani Li, Qingna Li, Yutong Zheng","submitted_at":"2026-05-31T06:51:14Z","abstract_excerpt":"Bilevel optimization is a fundamental framework for hierarchical decision-making, but its solution is challenging due to the implicit and typically set-valued nature of the lower-level optimality condition. In this paper,\n  we study bilevel optimization problems through an exact-penalty reformulation based on the $\\ell_1$-norm of the lower-level gradient. Under suitable regularity assumptions,\n  we show that this penalty defines a distance-bound function and yields an exact penalty property for sufficiently large penalty parameters.\n  To solve the resulting nonsmooth penalized problem, we prop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.01055","kind":"arxiv","version":1},"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/2606.01055/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":"2606.01055","created_at":"2026-06-02T01:04:19.903539+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.01055v1","created_at":"2026-06-02T01:04:19.903539+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.01055","created_at":"2026-06-02T01:04:19.903539+00:00"},{"alias_kind":"pith_short_12","alias_value":"POG4YIUV7ZUB","created_at":"2026-06-02T01:04:19.903539+00:00"},{"alias_kind":"pith_short_16","alias_value":"POG4YIUV7ZUBHEYL","created_at":"2026-06-02T01:04:19.903539+00:00"},{"alias_kind":"pith_short_8","alias_value":"POG4YIUV","created_at":"2026-06-02T01:04:19.903539+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/POG4YIUV7ZUBHEYLQ2GYDP7G63","json":"https://pith.science/pith/POG4YIUV7ZUBHEYLQ2GYDP7G63.json","graph_json":"https://pith.science/api/pith-number/POG4YIUV7ZUBHEYLQ2GYDP7G63/graph.json","events_json":"https://pith.science/api/pith-number/POG4YIUV7ZUBHEYLQ2GYDP7G63/events.json","paper":"https://pith.science/paper/POG4YIUV"},"agent_actions":{"view_html":"https://pith.science/pith/POG4YIUV7ZUBHEYLQ2GYDP7G63","download_json":"https://pith.science/pith/POG4YIUV7ZUBHEYLQ2GYDP7G63.json","view_paper":"https://pith.science/paper/POG4YIUV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.01055&json=true","fetch_graph":"https://pith.science/api/pith-number/POG4YIUV7ZUBHEYLQ2GYDP7G63/graph.json","fetch_events":"https://pith.science/api/pith-number/POG4YIUV7ZUBHEYLQ2GYDP7G63/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/POG4YIUV7ZUBHEYLQ2GYDP7G63/action/timestamp_anchor","attest_storage":"https://pith.science/pith/POG4YIUV7ZUBHEYLQ2GYDP7G63/action/storage_attestation","attest_author":"https://pith.science/pith/POG4YIUV7ZUBHEYLQ2GYDP7G63/action/author_attestation","sign_citation":"https://pith.science/pith/POG4YIUV7ZUBHEYLQ2GYDP7G63/action/citation_signature","submit_replication":"https://pith.science/pith/POG4YIUV7ZUBHEYLQ2GYDP7G63/action/replication_record"}},"created_at":"2026-06-02T01:04:19.903539+00:00","updated_at":"2026-06-02T01:04:19.903539+00:00"}