{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OSM6H7KHHMVCKRDXCQSNBXHV5X","short_pith_number":"pith:OSM6H7KH","schema_version":"1.0","canonical_sha256":"7499e3fd473b2a2544771424d0dcf5edc6fbd1ed53c43773da6d989f298005f4","source":{"kind":"arxiv","id":"2410.10670","version":5},"attestation_state":"computed","paper":{"title":"A Barrier Function Approach for Bilevel Optimization with Coupled Lower-Level Constraints: Formulation, Approximation and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiaxiang Li, Mingyi Hong, Shuzhong Zhang, Xiaotian Jiang","submitted_at":"2024-10-14T16:14:32Z","abstract_excerpt":"In this paper, we consider bilevel optimization problem where the lower-level has coupled constraints, i.e. the constraints depend both on the upper- and lower-level variables. In particular, we consider two settings for the lower-level problem. The first is when the objective is strongly convex and the constraints are convex with respect to the lower-level variable; The second is when the lower-level is a linear program. We propose to utilize a barrier function reformulation to translate the problem into an unconstrained problem. By developing a series of new techniques, we proved that both t"},"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":"2410.10670","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-10-14T16:14:32Z","cross_cats_sorted":[],"title_canon_sha256":"977ddc9a590f43b3f3034da35145be8863ac611cd7aac243f350d6163772aa7a","abstract_canon_sha256":"f325e5e5ba246f2dd781a5d3a8a78b7f1dc98310a20ae00e2acdfb95a213e03e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:30:24.730564Z","signature_b64":"LutjGfTg5H1DsUpvjWiUg2TlNOJVV3ddEt2hRIovG4Dwaq7zdD57t/hW3Uw0KIL7Gd9UhIWq0fezEkkHRsIMDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7499e3fd473b2a2544771424d0dcf5edc6fbd1ed53c43773da6d989f298005f4","last_reissued_at":"2026-07-05T10:30:24.729671Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:30:24.729671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Barrier Function Approach for Bilevel Optimization with Coupled Lower-Level Constraints: Formulation, Approximation and Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jiaxiang Li, Mingyi Hong, Shuzhong Zhang, Xiaotian Jiang","submitted_at":"2024-10-14T16:14:32Z","abstract_excerpt":"In this paper, we consider bilevel optimization problem where the lower-level has coupled constraints, i.e. the constraints depend both on the upper- and lower-level variables. In particular, we consider two settings for the lower-level problem. The first is when the objective is strongly convex and the constraints are convex with respect to the lower-level variable; The second is when the lower-level is a linear program. We propose to utilize a barrier function reformulation to translate the problem into an unconstrained problem. By developing a series of new techniques, we proved that both t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.10670","kind":"arxiv","version":5},"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/2410.10670/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":"2410.10670","created_at":"2026-07-05T10:30:24.729762+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.10670v5","created_at":"2026-07-05T10:30:24.729762+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.10670","created_at":"2026-07-05T10:30:24.729762+00:00"},{"alias_kind":"pith_short_12","alias_value":"OSM6H7KHHMVC","created_at":"2026-07-05T10:30:24.729762+00:00"},{"alias_kind":"pith_short_16","alias_value":"OSM6H7KHHMVCKRDX","created_at":"2026-07-05T10:30:24.729762+00:00"},{"alias_kind":"pith_short_8","alias_value":"OSM6H7KH","created_at":"2026-07-05T10:30:24.729762+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.14409","citing_title":"On the Nature of Regularity Assumptions in Bilevel Optimization with Constrained Lower-level Problem","ref_index":66,"is_internal_anchor":false},{"citing_arxiv_id":"2605.11476","citing_title":"A Barrier-Metric First-Order Method for Linearly Constrained Bilevel Optimization","ref_index":48,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X","json":"https://pith.science/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X.json","graph_json":"https://pith.science/api/pith-number/OSM6H7KHHMVCKRDXCQSNBXHV5X/graph.json","events_json":"https://pith.science/api/pith-number/OSM6H7KHHMVCKRDXCQSNBXHV5X/events.json","paper":"https://pith.science/paper/OSM6H7KH"},"agent_actions":{"view_html":"https://pith.science/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X","download_json":"https://pith.science/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X.json","view_paper":"https://pith.science/paper/OSM6H7KH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.10670&json=true","fetch_graph":"https://pith.science/api/pith-number/OSM6H7KHHMVCKRDXCQSNBXHV5X/graph.json","fetch_events":"https://pith.science/api/pith-number/OSM6H7KHHMVCKRDXCQSNBXHV5X/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X/action/storage_attestation","attest_author":"https://pith.science/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X/action/author_attestation","sign_citation":"https://pith.science/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X/action/citation_signature","submit_replication":"https://pith.science/pith/OSM6H7KHHMVCKRDXCQSNBXHV5X/action/replication_record"}},"created_at":"2026-07-05T10:30:24.729762+00:00","updated_at":"2026-07-05T10:30:24.729762+00:00"}