{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:VWDZC4Z2S4WRJFKJMPK2LXJVY5","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6e1ff45e9d49601a3ed2da3c8b9574159cbb45097574c288af754dc0eb589632","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-20T17:35:38Z","title_canon_sha256":"c9bc7fcd45189cdc72d29927d69b2aa7ce69d3bfa4c443df8040aa33187bf14c"},"schema_version":"1.0","source":{"id":"2505.14647","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.14647","created_at":"2026-07-05T11:53:27Z"},{"alias_kind":"arxiv_version","alias_value":"2505.14647v2","created_at":"2026-07-05T11:53:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.14647","created_at":"2026-07-05T11:53:27Z"},{"alias_kind":"pith_short_12","alias_value":"VWDZC4Z2S4WR","created_at":"2026-07-05T11:53:27Z"},{"alias_kind":"pith_short_16","alias_value":"VWDZC4Z2S4WRJFKJ","created_at":"2026-07-05T11:53:27Z"},{"alias_kind":"pith_short_8","alias_value":"VWDZC4Z2","created_at":"2026-07-05T11:53:27Z"}],"graph_snapshots":[{"event_id":"sha256:e96466c0e8a96135dd6e69ab380280704d561897467d9fbf53e3762ff28117d0","target":"graph","created_at":"2026-07-05T11:53:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2505.14647/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Erfan Yazdandoost Hamedani, Mahyar Fazlyab, Sina Sharifi","cross_cats":["cs.LG","cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-20T17:35:38Z","title":"Sequential QCQP for Bilevel Optimization with Line Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.14647","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d867c6a065a3af830a4f4f3d5e3f558cc2ae09e658545ce52fe953ea2d4dfdaf","target":"record","created_at":"2026-07-05T11:53:27Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6e1ff45e9d49601a3ed2da3c8b9574159cbb45097574c288af754dc0eb589632","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-05-20T17:35:38Z","title_canon_sha256":"c9bc7fcd45189cdc72d29927d69b2aa7ce69d3bfa4c443df8040aa33187bf14c"},"schema_version":"1.0","source":{"id":"2505.14647","kind":"arxiv","version":2}},"canonical_sha256":"ad8791733a972d14954963d5a5dd35c75300850950a41676c4ef75d7d0b961cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ad8791733a972d14954963d5a5dd35c75300850950a41676c4ef75d7d0b961cc","first_computed_at":"2026-07-05T11:53:27.711171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:53:27.711171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R8bNWBVx1wpryczwBEZ8jBmhAqg0jmMz0dBvWzZkfHnNl1iXZePSK9Jtmml7craJjXGNHtrK4yfXTi6rLoHzCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:53:27.711677Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.14647","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d867c6a065a3af830a4f4f3d5e3f558cc2ae09e658545ce52fe953ea2d4dfdaf","sha256:e96466c0e8a96135dd6e69ab380280704d561897467d9fbf53e3762ff28117d0"],"state_sha256":"3c68bb9c126be17d88942aa615166464a2b7953803850e6f303eb26cdd55411c"}