{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:MMCZ2JWVPU2PYTTTYKTI4B2YZL","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":"2065c36651860308c70100aa31caaac2fe8e19d57197baa011d5442af2bf3b56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-08T12:25:09Z","title_canon_sha256":"1479fbd49da8412f894789b2e9b859dec476878c94a7fdaeef4f03a24f958993"},"schema_version":"1.0","source":{"id":"2406.05455","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.05455","created_at":"2026-07-05T08:29:06Z"},{"alias_kind":"arxiv_version","alias_value":"2406.05455v1","created_at":"2026-07-05T08:29:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05455","created_at":"2026-07-05T08:29:06Z"},{"alias_kind":"pith_short_12","alias_value":"MMCZ2JWVPU2P","created_at":"2026-07-05T08:29:06Z"},{"alias_kind":"pith_short_16","alias_value":"MMCZ2JWVPU2PYTTT","created_at":"2026-07-05T08:29:06Z"},{"alias_kind":"pith_short_8","alias_value":"MMCZ2JWV","created_at":"2026-07-05T08:29:06Z"}],"graph_snapshots":[{"event_id":"sha256:e8080cc2a3839f30b2b2fd2e67994f03273260b1a93905deb162e5e4a43e83e0","target":"graph","created_at":"2026-07-05T08:29: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/2406.05455/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-Objective Bi-Level Optimization (MOBLO) addresses nested multi-objective optimization problems common in a range of applications. However, its multi-objective and hierarchical bilevel nature makes it notably complex. Gradient-based MOBLO algorithms have recently grown in popularity, as they effectively solve crucial machine learning problems like meta-learning, neural architecture search, and reinforcement learning. Unfortunately, these algorithms depend on solving a sequence of approximation subproblems with high accuracy, resulting in adverse time and memory complexity that lowers thei","authors_text":"Haian Yin, Jin Zhang, Shangzhi Zeng, Wei Yao, Xinmin Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-08T12:25:09Z","title":"Gradient-based algorithms for multi-objective bi-level optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05455","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:abc94188d784e3ae7358be3a88d5fc409dd1b7232413e762bd83042927dc555c","target":"record","created_at":"2026-07-05T08:29: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":"2065c36651860308c70100aa31caaac2fe8e19d57197baa011d5442af2bf3b56","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-08T12:25:09Z","title_canon_sha256":"1479fbd49da8412f894789b2e9b859dec476878c94a7fdaeef4f03a24f958993"},"schema_version":"1.0","source":{"id":"2406.05455","kind":"arxiv","version":1}},"canonical_sha256":"63059d26d57d34fc4e73c2a68e0758cac6f22434aaa14f810add31416c2e085f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"63059d26d57d34fc4e73c2a68e0758cac6f22434aaa14f810add31416c2e085f","first_computed_at":"2026-07-05T08:29:06.038987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:29:06.038987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1b3mnmk42lDns2jPt5HsDD4Jzveu/LSSXA0EpxBB+HQGWXAfYXLH65aG0FAzPzX6C0gUNzr44EFDB7gOqmA/BA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:29:06.039451Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.05455","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abc94188d784e3ae7358be3a88d5fc409dd1b7232413e762bd83042927dc555c","sha256:e8080cc2a3839f30b2b2fd2e67994f03273260b1a93905deb162e5e4a43e83e0"],"state_sha256":"f6a4bc8ff1c5269fb5c27bd10af738b89ea7851ad0fe675d98de141ff10fedf2"}