{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:LS62N5LDJQDT2SK7QG46WAVDJT","short_pith_number":"pith:LS62N5LD","canonical_record":{"source":{"id":"2501.16520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-27T21:39:25Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"209191a20d954e8300677931af8e7476596239912d196360a4b7eb9ac7fc8965","abstract_canon_sha256":"b3a4f394733ee8729e28fbd446836892cf35a6a3e4b2505d4c70d3e2419e8f9c"},"schema_version":"1.0"},"canonical_sha256":"5cbda6f5634c073d495f81b9eb02a34ce5f5494487bc09b87fe6fedaa3fd4eb2","source":{"kind":"arxiv","id":"2501.16520","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:LS62N5LDJQDT2SK7QG46WAVDJT","target":"record","payload":{"canonical_record":{"source":{"id":"2501.16520","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2025-01-27T21:39:25Z","cross_cats_sorted":["cs.LG","cs.SY","eess.SY"],"title_canon_sha256":"209191a20d954e8300677931af8e7476596239912d196360a4b7eb9ac7fc8965","abstract_canon_sha256":"b3a4f394733ee8729e28fbd446836892cf35a6a3e4b2505d4c70d3e2419e8f9c"},"schema_version":"1.0"},"canonical_sha256":"5cbda6f5634c073d495f81b9eb02a34ce5f5494487bc09b87fe6fedaa3fd4eb2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:37:06.946229Z","signature_b64":"Y+tfrFg3Sb2HTtjIJuTucxtJBE3FNqeuyHHpmJLV7AWElNsFH7elJ0flfPT8eCTbL6UBNbk6BhiVNeX2uCmfBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5cbda6f5634c073d495f81b9eb02a34ce5f5494487bc09b87fe6fedaa3fd4eb2","last_reissued_at":"2026-07-05T10:37:06.945265Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:37:06.945265Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.16520","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:37:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ATVesjIBSN1KTlEP8jvULCBGF4eDx4VPrPW+pjzqybNEC3mWbEA1amJp3dFTl6TVKFPOY0cKDTv3AcI4wt/0Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:32:10.844261Z"},"content_sha256":"dd1281900efd2d5eb8f21e70f6efc7302e35fe5f83359fe6e274d07c2a6420d9","schema_version":"1.0","event_id":"sha256:dd1281900efd2d5eb8f21e70f6efc7302e35fe5f83359fe6e274d07c2a6420d9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:LS62N5LDJQDT2SK7QG46WAVDJT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Safe Gradient Flow for Bilevel Optimization","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, Nazanin Abolfazli, Sina Sharifi","submitted_at":"2025-01-27T21:39:25Z","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, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.16520","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/2501.16520/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:37:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zqtnXWNN592pVJtJj2emtHGN+mjqLe2D/IPGktn4CjXE1avMCGmbfiPROvkw7Cws20fQo2UNwKSb1NYRRK5ODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T09:32:10.845248Z"},"content_sha256":"1aea2dd74768f816363e5148c1c2a2db2537ad45cafb9052c3848094f23839e6","schema_version":"1.0","event_id":"sha256:1aea2dd74768f816363e5148c1c2a2db2537ad45cafb9052c3848094f23839e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LS62N5LDJQDT2SK7QG46WAVDJT/bundle.json","state_url":"https://pith.science/pith/LS62N5LDJQDT2SK7QG46WAVDJT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LS62N5LDJQDT2SK7QG46WAVDJT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-10T09:32:10Z","links":{"resolver":"https://pith.science/pith/LS62N5LDJQDT2SK7QG46WAVDJT","bundle":"https://pith.science/pith/LS62N5LDJQDT2SK7QG46WAVDJT/bundle.json","state":"https://pith.science/pith/LS62N5LDJQDT2SK7QG46WAVDJT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LS62N5LDJQDT2SK7QG46WAVDJT/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CylyPxwo2tA+j8D+ChqTlNjZ/BQ140PnecWpLl+IPKbXsIbCKgQslHgX5JOBQWGltosSPspw+mDtvBF8QtspAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T09:32:10.851768Z","bundle_sha256":"326fbf384ad43cb9178c4a443ef89bb7145be77df77086d4aad0662559a9893a"}}