{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:VWDZC4Z2S4WRJFKJMPK2LXJVY5","short_pith_number":"pith:VWDZC4Z2","schema_version":"1.0","canonical_sha256":"ad8791733a972d14954963d5a5dd35c75300850950a41676c4ef75d7d0b961cc","source":{"kind":"arxiv","id":"2505.14647","version":2},"attestation_state":"computed","paper":{"title":"Sequential QCQP for Bilevel Optimization with Line Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Erfan Yazdandoost Hamedani, Mahyar Fazlyab, Sina Sharifi","submitted_at":"2025-05-20T17:35:38Z","abstract_excerpt":"Bilevel optimization involves a hierarchical structure where one problem is nested within another, leading to complex interdependencies between levels. We propose a single-loop, tuning-free algorithm that guarantees anytime feasibility, i.e., approximate satisfaction of the lower-level optimality condition, while ensuring descent of the upper-level objective. At each iteration, a convex quadratically-constrained quadratic program (QCQP) with a closed-form solution yields the search direction, followed by a backtracking line search inspired by control barrier functions to ensure safe, uniformly"},"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":"2505.14647","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-20T17:35:38Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"c9bc7fcd45189cdc72d29927d69b2aa7ce69d3bfa4c443df8040aa33187bf14c","abstract_canon_sha256":"6e1ff45e9d49601a3ed2da3c8b9574159cbb45097574c288af754dc0eb589632"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:27.711677Z","signature_b64":"R8bNWBVx1wpryczwBEZ8jBmhAqg0jmMz0dBvWzZkfHnNl1iXZePSK9Jtmml7craJjXGNHtrK4yfXTi6rLoHzCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad8791733a972d14954963d5a5dd35c75300850950a41676c4ef75d7d0b961cc","last_reissued_at":"2026-07-05T11:53:27.711171Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:27.711171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential QCQP for Bilevel Optimization with Line Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.SY","eess.SY"],"primary_cat":"math.OC","authors_text":"Erfan Yazdandoost Hamedani, Mahyar Fazlyab, Sina Sharifi","submitted_at":"2025-05-20T17:35:38Z","abstract_excerpt":"Bilevel optimization involves a hierarchical structure where one problem is nested within another, leading to complex interdependencies between levels. We propose a single-loop, tuning-free algorithm that guarantees anytime feasibility, i.e., approximate satisfaction of the lower-level optimality condition, while ensuring descent of the upper-level objective. At each iteration, a convex quadratically-constrained quadratic program (QCQP) with a closed-form solution yields the search direction, followed by a backtracking line search inspired by control barrier functions to ensure safe, uniformly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14647","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/2505.14647/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":"2505.14647","created_at":"2026-07-05T11:53:27.711234+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.14647v2","created_at":"2026-07-05T11:53:27.711234+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14647","created_at":"2026-07-05T11:53:27.711234+00:00"},{"alias_kind":"pith_short_12","alias_value":"VWDZC4Z2S4WR","created_at":"2026-07-05T11:53:27.711234+00:00"},{"alias_kind":"pith_short_16","alias_value":"VWDZC4Z2S4WRJFKJ","created_at":"2026-07-05T11:53:27.711234+00:00"},{"alias_kind":"pith_short_8","alias_value":"VWDZC4Z2","created_at":"2026-07-05T11:53:27.711234+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/VWDZC4Z2S4WRJFKJMPK2LXJVY5","json":"https://pith.science/pith/VWDZC4Z2S4WRJFKJMPK2LXJVY5.json","graph_json":"https://pith.science/api/pith-number/VWDZC4Z2S4WRJFKJMPK2LXJVY5/graph.json","events_json":"https://pith.science/api/pith-number/VWDZC4Z2S4WRJFKJMPK2LXJVY5/events.json","paper":"https://pith.science/paper/VWDZC4Z2"},"agent_actions":{"view_html":"https://pith.science/pith/VWDZC4Z2S4WRJFKJMPK2LXJVY5","download_json":"https://pith.science/pith/VWDZC4Z2S4WRJFKJMPK2LXJVY5.json","view_paper":"https://pith.science/paper/VWDZC4Z2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.14647&json=true","fetch_graph":"https://pith.science/api/pith-number/VWDZC4Z2S4WRJFKJMPK2LXJVY5/graph.json","fetch_events":"https://pith.science/api/pith-number/VWDZC4Z2S4WRJFKJMPK2LXJVY5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VWDZC4Z2S4WRJFKJMPK2LXJVY5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VWDZC4Z2S4WRJFKJMPK2LXJVY5/action/storage_attestation","attest_author":"https://pith.science/pith/VWDZC4Z2S4WRJFKJMPK2LXJVY5/action/author_attestation","sign_citation":"https://pith.science/pith/VWDZC4Z2S4WRJFKJMPK2LXJVY5/action/citation_signature","submit_replication":"https://pith.science/pith/VWDZC4Z2S4WRJFKJMPK2LXJVY5/action/replication_record"}},"created_at":"2026-07-05T11:53:27.711234+00:00","updated_at":"2026-07-05T11:53:27.711234+00:00"}