{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:6FLDFJDIPKFKPEQXKZJXUJ6A5A","short_pith_number":"pith:6FLDFJDI","schema_version":"1.0","canonical_sha256":"f15632a4687a8aa7921756537a27c0e8278c3f0a25855fa31b535b7a2edcf0b2","source":{"kind":"arxiv","id":"2406.10148","version":2},"attestation_state":"computed","paper":{"title":"A Primal-Dual-Assisted Penalty Approach to Bilevel Optimization with Coupled Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Antonio G. Marques, Fernando Real-Rojas, Liuyuan Jiang, Quan Xiao, Tianyi Chen, Victor M. Tenorio","submitted_at":"2024-06-14T15:59:36Z","abstract_excerpt":"Interest in bilevel optimization has grown in recent years, partially due to its applications to tackle challenging machine-learning problems. Several exciting recent works have been centered around developing efficient gradient-based algorithms that can solve bilevel optimization problems with provable guarantees. However, the existing literature mainly focuses on bilevel problems either without constraints, or featuring only simple constraints that do not couple variables across the upper and lower levels, excluding a range of complex applications. Our paper studies this challenging but less"},"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":"2406.10148","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-06-14T15:59:36Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"386d9e84fdf70594ac1b8ef616915d5dd4ca1c04b4bacfd4ac58fe170241e873","abstract_canon_sha256":"9f78aeb4a2956688a70cc9d38e878528e1979a6cacc97329aaee6673ca31caae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:59:10.164923Z","signature_b64":"GdchdU2m+ott3cJgHzXAdmbhKrFLvvjsCEUjn46kfRZSBdyDEMREESu4r/foNoA6JvGODlSIgJ/FL9AX/402Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f15632a4687a8aa7921756537a27c0e8278c3f0a25855fa31b535b7a2edcf0b2","last_reissued_at":"2026-07-05T08:59:10.164439Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:59:10.164439Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Primal-Dual-Assisted Penalty Approach to Bilevel Optimization with Coupled Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"math.OC","authors_text":"Antonio G. Marques, Fernando Real-Rojas, Liuyuan Jiang, Quan Xiao, Tianyi Chen, Victor M. Tenorio","submitted_at":"2024-06-14T15:59:36Z","abstract_excerpt":"Interest in bilevel optimization has grown in recent years, partially due to its applications to tackle challenging machine-learning problems. Several exciting recent works have been centered around developing efficient gradient-based algorithms that can solve bilevel optimization problems with provable guarantees. However, the existing literature mainly focuses on bilevel problems either without constraints, or featuring only simple constraints that do not couple variables across the upper and lower levels, excluding a range of complex applications. Our paper studies this challenging but less"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.10148","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/2406.10148/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":"2406.10148","created_at":"2026-07-05T08:59:10.164497+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.10148v2","created_at":"2026-07-05T08:59:10.164497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.10148","created_at":"2026-07-05T08:59:10.164497+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FLDFJDIPKFK","created_at":"2026-07-05T08:59:10.164497+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FLDFJDIPKFKPEQX","created_at":"2026-07-05T08:59:10.164497+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FLDFJDI","created_at":"2026-07-05T08:59:10.164497+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"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":10,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6FLDFJDIPKFKPEQXKZJXUJ6A5A","json":"https://pith.science/pith/6FLDFJDIPKFKPEQXKZJXUJ6A5A.json","graph_json":"https://pith.science/api/pith-number/6FLDFJDIPKFKPEQXKZJXUJ6A5A/graph.json","events_json":"https://pith.science/api/pith-number/6FLDFJDIPKFKPEQXKZJXUJ6A5A/events.json","paper":"https://pith.science/paper/6FLDFJDI"},"agent_actions":{"view_html":"https://pith.science/pith/6FLDFJDIPKFKPEQXKZJXUJ6A5A","download_json":"https://pith.science/pith/6FLDFJDIPKFKPEQXKZJXUJ6A5A.json","view_paper":"https://pith.science/paper/6FLDFJDI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.10148&json=true","fetch_graph":"https://pith.science/api/pith-number/6FLDFJDIPKFKPEQXKZJXUJ6A5A/graph.json","fetch_events":"https://pith.science/api/pith-number/6FLDFJDIPKFKPEQXKZJXUJ6A5A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FLDFJDIPKFKPEQXKZJXUJ6A5A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FLDFJDIPKFKPEQXKZJXUJ6A5A/action/storage_attestation","attest_author":"https://pith.science/pith/6FLDFJDIPKFKPEQXKZJXUJ6A5A/action/author_attestation","sign_citation":"https://pith.science/pith/6FLDFJDIPKFKPEQXKZJXUJ6A5A/action/citation_signature","submit_replication":"https://pith.science/pith/6FLDFJDIPKFKPEQXKZJXUJ6A5A/action/replication_record"}},"created_at":"2026-07-05T08:59:10.164497+00:00","updated_at":"2026-07-05T08:59:10.164497+00:00"}