{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:EWLA2XUKDRRO7GG7DWNLRI6MB7","short_pith_number":"pith:EWLA2XUK","canonical_record":{"source":{"id":"2406.01992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T06:22:04Z","cross_cats_sorted":[],"title_canon_sha256":"51c949a82d0eb68b6695d4a917348d74495e5aadc1041f932a9a62ec5109710d","abstract_canon_sha256":"7efca830e2b46b2938d0df92d18d27682e0f5f58ab22a9debf00a5f5f85ae195"},"schema_version":"1.0"},"canonical_sha256":"25960d5e8a1c62ef98df1d9ab8a3cc0fc5e36ef85be3f76cc62e61c91400aba3","source":{"kind":"arxiv","id":"2406.01992","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.01992","created_at":"2026-07-05T08:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"2406.01992v1","created_at":"2026-07-05T08:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.01992","created_at":"2026-07-05T08:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"EWLA2XUKDRRO","created_at":"2026-07-05T08:27:13Z"},{"alias_kind":"pith_short_16","alias_value":"EWLA2XUKDRRO7GG7","created_at":"2026-07-05T08:27:13Z"},{"alias_kind":"pith_short_8","alias_value":"EWLA2XUK","created_at":"2026-07-05T08:27:13Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:EWLA2XUKDRRO7GG7DWNLRI6MB7","target":"record","payload":{"canonical_record":{"source":{"id":"2406.01992","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T06:22:04Z","cross_cats_sorted":[],"title_canon_sha256":"51c949a82d0eb68b6695d4a917348d74495e5aadc1041f932a9a62ec5109710d","abstract_canon_sha256":"7efca830e2b46b2938d0df92d18d27682e0f5f58ab22a9debf00a5f5f85ae195"},"schema_version":"1.0"},"canonical_sha256":"25960d5e8a1c62ef98df1d9ab8a3cc0fc5e36ef85be3f76cc62e61c91400aba3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:27:13.004885Z","signature_b64":"bXVQMyfQ28UTZGaqSiSK6aAo4YO+D2SR6RHY5plZMYjkW1L2jMXYSFEnnZm7t7nyfvgXAtdHo8fq+7TVCpmsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25960d5e8a1c62ef98df1d9ab8a3cc0fc5e36ef85be3f76cc62e61c91400aba3","last_reissued_at":"2026-07-05T08:27:13.004468Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:27:13.004468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2406.01992","source_version":1,"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-05T08:27:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gOqoJLKTQGOFXQD7kLRSO9fAAYq2UrYW/cUHZnlYMzPUZhXbjzAWok200oX6WjDKcHmpxnZhVmP6Ci/JTrm7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:30:21.315314Z"},"content_sha256":"17288ea5126843ec1cd4bfd81f3109afb6b2eb6b7eabbc4548e30d17b22cf959","schema_version":"1.0","event_id":"sha256:17288ea5126843ec1cd4bfd81f3109afb6b2eb6b7eabbc4548e30d17b22cf959"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:EWLA2XUKDRRO7GG7DWNLRI6MB7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Overcoming Lower-Level Constraints in Bilevel Optimization: A Novel Approach with Regularized Gap Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Haian Yin, Jin Zhang, Shangzhi Zeng, Wei Yao","submitted_at":"2024-06-04T06:22:04Z","abstract_excerpt":"Constrained bilevel optimization tackles nested structures present in constrained learning tasks like constrained meta-learning, adversarial learning, and distributed bilevel optimization. However, existing bilevel optimization methods mostly are typically restricted to specific constraint settings, such as linear lower-level constraints. In this work, we overcome this limitation and develop a new single-loop, Hessian-free constrained bilevel algorithm capable of handling more general lower-level constraints. We achieve this by employing a doubly regularized gap function tailored to the constr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.01992","kind":"arxiv","version":1},"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.01992/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-05T08:27:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6CCzfFt9ejnsxIKwbhfwiFDbnugOVcrm0quX/h6zwkmu2eF0FICPXqCsuggmUdylIPaHIZnbTJfo3BMOh649Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T11:30:21.315820Z"},"content_sha256":"c50e29ef86f9e9c6f1a60d0da9e7b1ec375335a570d36bc723245a17958a28c1","schema_version":"1.0","event_id":"sha256:c50e29ef86f9e9c6f1a60d0da9e7b1ec375335a570d36bc723245a17958a28c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWLA2XUKDRRO7GG7DWNLRI6MB7/bundle.json","state_url":"https://pith.science/pith/EWLA2XUKDRRO7GG7DWNLRI6MB7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWLA2XUKDRRO7GG7DWNLRI6MB7/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-05T11:30:21Z","links":{"resolver":"https://pith.science/pith/EWLA2XUKDRRO7GG7DWNLRI6MB7","bundle":"https://pith.science/pith/EWLA2XUKDRRO7GG7DWNLRI6MB7/bundle.json","state":"https://pith.science/pith/EWLA2XUKDRRO7GG7DWNLRI6MB7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWLA2XUKDRRO7GG7DWNLRI6MB7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:EWLA2XUKDRRO7GG7DWNLRI6MB7","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":"7efca830e2b46b2938d0df92d18d27682e0f5f58ab22a9debf00a5f5f85ae195","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T06:22:04Z","title_canon_sha256":"51c949a82d0eb68b6695d4a917348d74495e5aadc1041f932a9a62ec5109710d"},"schema_version":"1.0","source":{"id":"2406.01992","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.01992","created_at":"2026-07-05T08:27:13Z"},{"alias_kind":"arxiv_version","alias_value":"2406.01992v1","created_at":"2026-07-05T08:27:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.01992","created_at":"2026-07-05T08:27:13Z"},{"alias_kind":"pith_short_12","alias_value":"EWLA2XUKDRRO","created_at":"2026-07-05T08:27:13Z"},{"alias_kind":"pith_short_16","alias_value":"EWLA2XUKDRRO7GG7","created_at":"2026-07-05T08:27:13Z"},{"alias_kind":"pith_short_8","alias_value":"EWLA2XUK","created_at":"2026-07-05T08:27:13Z"}],"graph_snapshots":[{"event_id":"sha256:c50e29ef86f9e9c6f1a60d0da9e7b1ec375335a570d36bc723245a17958a28c1","target":"graph","created_at":"2026-07-05T08:27:13Z","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/2406.01992/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Constrained bilevel optimization tackles nested structures present in constrained learning tasks like constrained meta-learning, adversarial learning, and distributed bilevel optimization. However, existing bilevel optimization methods mostly are typically restricted to specific constraint settings, such as linear lower-level constraints. In this work, we overcome this limitation and develop a new single-loop, Hessian-free constrained bilevel algorithm capable of handling more general lower-level constraints. We achieve this by employing a doubly regularized gap function tailored to the constr","authors_text":"Haian Yin, Jin Zhang, Shangzhi Zeng, Wei Yao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T06:22:04Z","title":"Overcoming Lower-Level Constraints in Bilevel Optimization: A Novel Approach with Regularized Gap Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.01992","kind":"arxiv","version":1},"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:17288ea5126843ec1cd4bfd81f3109afb6b2eb6b7eabbc4548e30d17b22cf959","target":"record","created_at":"2026-07-05T08:27:13Z","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":"7efca830e2b46b2938d0df92d18d27682e0f5f58ab22a9debf00a5f5f85ae195","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-04T06:22:04Z","title_canon_sha256":"51c949a82d0eb68b6695d4a917348d74495e5aadc1041f932a9a62ec5109710d"},"schema_version":"1.0","source":{"id":"2406.01992","kind":"arxiv","version":1}},"canonical_sha256":"25960d5e8a1c62ef98df1d9ab8a3cc0fc5e36ef85be3f76cc62e61c91400aba3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"25960d5e8a1c62ef98df1d9ab8a3cc0fc5e36ef85be3f76cc62e61c91400aba3","first_computed_at":"2026-07-05T08:27:13.004468Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:27:13.004468Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bXVQMyfQ28UTZGaqSiSK6aAo4YO+D2SR6RHY5plZMYjkW1L2jMXYSFEnnZm7t7nyfvgXAtdHo8fq+7TVCpmsBg==","signature_status":"signed_v1","signed_at":"2026-07-05T08:27:13.004885Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.01992","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17288ea5126843ec1cd4bfd81f3109afb6b2eb6b7eabbc4548e30d17b22cf959","sha256:c50e29ef86f9e9c6f1a60d0da9e7b1ec375335a570d36bc723245a17958a28c1"],"state_sha256":"2e025969c8477f722131cf32630523002f9c1487e4de7647ba833013c83b4001"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZHve95KHwQmMgbjPUA5tDJqUOBUgkt6D3xSIEK8p3QM46ldL0sVKGY7TPO25gV96lMAu0xeskn6s165ZA4YeCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T11:30:21.322438Z","bundle_sha256":"4ee22ff17551423cbabdb1f3f52388b6db254104c3b05be1033120190fd50da9"}}