{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MMCZ2JWVPU2PYTTTYKTI4B2YZL","short_pith_number":"pith:MMCZ2JWV","schema_version":"1.0","canonical_sha256":"63059d26d57d34fc4e73c2a68e0758cac6f22434aaa14f810add31416c2e085f","source":{"kind":"arxiv","id":"2406.05455","version":1},"attestation_state":"computed","paper":{"title":"Gradient-based algorithms for multi-objective bi-level optimization","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, Xinmin Yang","submitted_at":"2024-06-08T12:25:09Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2406.05455","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2024-06-08T12:25:09Z","cross_cats_sorted":[],"title_canon_sha256":"1479fbd49da8412f894789b2e9b859dec476878c94a7fdaeef4f03a24f958993","abstract_canon_sha256":"2065c36651860308c70100aa31caaac2fe8e19d57197baa011d5442af2bf3b56"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:29:06.039451Z","signature_b64":"1b3mnmk42lDns2jPt5HsDD4Jzveu/LSSXA0EpxBB+HQGWXAfYXLH65aG0FAzPzX6C0gUNzr44EFDB7gOqmA/BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"63059d26d57d34fc4e73c2a68e0758cac6f22434aaa14f810add31416c2e085f","last_reissued_at":"2026-07-05T08:29:06.038987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:29:06.038987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient-based algorithms for multi-objective bi-level optimization","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, Xinmin Yang","submitted_at":"2024-06-08T12:25:09Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.05455","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.05455/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2406.05455","created_at":"2026-07-05T08:29:06.039046+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.05455v1","created_at":"2026-07-05T08:29:06.039046+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.05455","created_at":"2026-07-05T08:29:06.039046+00:00"},{"alias_kind":"pith_short_12","alias_value":"MMCZ2JWVPU2P","created_at":"2026-07-05T08:29:06.039046+00:00"},{"alias_kind":"pith_short_16","alias_value":"MMCZ2JWVPU2PYTTT","created_at":"2026-07-05T08:29:06.039046+00:00"},{"alias_kind":"pith_short_8","alias_value":"MMCZ2JWV","created_at":"2026-07-05T08:29:06.039046+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MMCZ2JWVPU2PYTTTYKTI4B2YZL","json":"https://pith.science/pith/MMCZ2JWVPU2PYTTTYKTI4B2YZL.json","graph_json":"https://pith.science/api/pith-number/MMCZ2JWVPU2PYTTTYKTI4B2YZL/graph.json","events_json":"https://pith.science/api/pith-number/MMCZ2JWVPU2PYTTTYKTI4B2YZL/events.json","paper":"https://pith.science/paper/MMCZ2JWV"},"agent_actions":{"view_html":"https://pith.science/pith/MMCZ2JWVPU2PYTTTYKTI4B2YZL","download_json":"https://pith.science/pith/MMCZ2JWVPU2PYTTTYKTI4B2YZL.json","view_paper":"https://pith.science/paper/MMCZ2JWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.05455&json=true","fetch_graph":"https://pith.science/api/pith-number/MMCZ2JWVPU2PYTTTYKTI4B2YZL/graph.json","fetch_events":"https://pith.science/api/pith-number/MMCZ2JWVPU2PYTTTYKTI4B2YZL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MMCZ2JWVPU2PYTTTYKTI4B2YZL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MMCZ2JWVPU2PYTTTYKTI4B2YZL/action/storage_attestation","attest_author":"https://pith.science/pith/MMCZ2JWVPU2PYTTTYKTI4B2YZL/action/author_attestation","sign_citation":"https://pith.science/pith/MMCZ2JWVPU2PYTTTYKTI4B2YZL/action/citation_signature","submit_replication":"https://pith.science/pith/MMCZ2JWVPU2PYTTTYKTI4B2YZL/action/replication_record"}},"created_at":"2026-07-05T08:29:06.039046+00:00","updated_at":"2026-07-05T08:29:06.039046+00:00"}