{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:LS62N5LDJQDT2SK7QG46WAVDJT","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":"b3a4f394733ee8729e28fbd446836892cf35a6a3e4b2505d4c70d3e2419e8f9c","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-01-27T21:39:25Z","title_canon_sha256":"209191a20d954e8300677931af8e7476596239912d196360a4b7eb9ac7fc8965"},"schema_version":"1.0","source":{"id":"2501.16520","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.16520","created_at":"2026-07-05T10:37:06Z"},{"alias_kind":"arxiv_version","alias_value":"2501.16520v2","created_at":"2026-07-05T10:37:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.16520","created_at":"2026-07-05T10:37:06Z"},{"alias_kind":"pith_short_12","alias_value":"LS62N5LDJQDT","created_at":"2026-07-05T10:37:06Z"},{"alias_kind":"pith_short_16","alias_value":"LS62N5LDJQDT2SK7","created_at":"2026-07-05T10:37:06Z"},{"alias_kind":"pith_short_8","alias_value":"LS62N5LD","created_at":"2026-07-05T10:37:06Z"}],"graph_snapshots":[{"event_id":"sha256:1aea2dd74768f816363e5148c1c2a2db2537ad45cafb9052c3848094f23839e6","target":"graph","created_at":"2026-07-05T10:37:06Z","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/2501.16520/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Bilevel optimization is a key framework in hierarchical decision-making, where one problem is embedded within the constraints of another. In this work, we propose a control-theoretic approach to solving bilevel optimization problems. Our method consists of two components: a gradient flow mechanism to minimize the upper-level objective and a safety filter to enforce the constraints imposed by the lower-level problem. Together, these components form a safe gradient flow that solves the bilevel problem in a single loop. To improve scalability with respect to the lower-level problem's dimensions, ","authors_text":"Erfan Yazdandoost Hamedani, Mahyar Fazlyab, Nazanin Abolfazli, 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-01-27T21:39:25Z","title":"Safe Gradient Flow for Bilevel Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.16520","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:dd1281900efd2d5eb8f21e70f6efc7302e35fe5f83359fe6e274d07c2a6420d9","target":"record","created_at":"2026-07-05T10:37:06Z","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":"b3a4f394733ee8729e28fbd446836892cf35a6a3e4b2505d4c70d3e2419e8f9c","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-01-27T21:39:25Z","title_canon_sha256":"209191a20d954e8300677931af8e7476596239912d196360a4b7eb9ac7fc8965"},"schema_version":"1.0","source":{"id":"2501.16520","kind":"arxiv","version":2}},"canonical_sha256":"5cbda6f5634c073d495f81b9eb02a34ce5f5494487bc09b87fe6fedaa3fd4eb2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5cbda6f5634c073d495f81b9eb02a34ce5f5494487bc09b87fe6fedaa3fd4eb2","first_computed_at":"2026-07-05T10:37:06.945265Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:37:06.945265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y+tfrFg3Sb2HTtjIJuTucxtJBE3FNqeuyHHpmJLV7AWElNsFH7elJ0flfPT8eCTbL6UBNbk6BhiVNeX2uCmfBg==","signature_status":"signed_v1","signed_at":"2026-07-05T10:37:06.946229Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.16520","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd1281900efd2d5eb8f21e70f6efc7302e35fe5f83359fe6e274d07c2a6420d9","sha256:1aea2dd74768f816363e5148c1c2a2db2537ad45cafb9052c3848094f23839e6"],"state_sha256":"581688eb692803e5035f63e76715f96fadcaf48aedcbd127b2a95dbdeff5f5bf"}