{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2T2NLWTBB3NSBKAWGLYSKJCNAC","short_pith_number":"pith:2T2NLWTB","schema_version":"1.0","canonical_sha256":"d4f4d5da610edb20a81632f125244d00a339edd41ea9f13709d00edb168bff7f","source":{"kind":"arxiv","id":"2302.02565","version":1},"attestation_state":"computed","paper":{"title":"Bi-level Multi-objective Evolutionary Learning: A Case Study on Multi-task Graph Neural Topology Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.NE","authors_text":"Chao Wang, Fang Liu, Jiaxuan Zhao, Licheng Jiao, Lingling Li, Shuyuan Yang, Xu Liu","submitted_at":"2023-02-06T04:59:51Z","abstract_excerpt":"The construction of machine learning models involves many bi-level multi-objective optimization problems (BL-MOPs), where upper level (UL) candidate solutions must be evaluated via training weights of a model in the lower level (LL). Due to the Pareto optimality of sub-problems and the complex dependency across UL solutions and LL weights, an UL solution is feasible if and only if the LL weight is Pareto optimal. It is computationally expensive to determine which LL Pareto weight in the LL Pareto weight set is the most appropriate for each UL solution. This paper proposes a bi-level multi-obje"},"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":"2302.02565","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2023-02-06T04:59:51Z","cross_cats_sorted":["cs.LG","math.OC"],"title_canon_sha256":"0e89d97e56eaa08a7bdb94226fa9080e7b4cda530458bd814ca9e1da407a12de","abstract_canon_sha256":"625c31bc37e839c439b96ccf490d68d4a8a3c4b5483e39ff2f83827f56142c01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:38:54.579180Z","signature_b64":"Ws+yw9fmbuGfbHtgp+cyJzvMWzpPr1yLMQNuh0VkWquJ/M/ZQZXWKPMWtpYED/NPyhNRWZ6eeYEOsT7dV9vtDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4f4d5da610edb20a81632f125244d00a339edd41ea9f13709d00edb168bff7f","last_reissued_at":"2026-07-05T05:38:54.578758Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:38:54.578758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bi-level Multi-objective Evolutionary Learning: A Case Study on Multi-task Graph Neural Topology Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","math.OC"],"primary_cat":"cs.NE","authors_text":"Chao Wang, Fang Liu, Jiaxuan Zhao, Licheng Jiao, Lingling Li, Shuyuan Yang, Xu Liu","submitted_at":"2023-02-06T04:59:51Z","abstract_excerpt":"The construction of machine learning models involves many bi-level multi-objective optimization problems (BL-MOPs), where upper level (UL) candidate solutions must be evaluated via training weights of a model in the lower level (LL). Due to the Pareto optimality of sub-problems and the complex dependency across UL solutions and LL weights, an UL solution is feasible if and only if the LL weight is Pareto optimal. It is computationally expensive to determine which LL Pareto weight in the LL Pareto weight set is the most appropriate for each UL solution. This paper proposes a bi-level multi-obje"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.02565","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/2302.02565/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":"2302.02565","created_at":"2026-07-05T05:38:54.578818+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.02565v1","created_at":"2026-07-05T05:38:54.578818+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.02565","created_at":"2026-07-05T05:38:54.578818+00:00"},{"alias_kind":"pith_short_12","alias_value":"2T2NLWTBB3NS","created_at":"2026-07-05T05:38:54.578818+00:00"},{"alias_kind":"pith_short_16","alias_value":"2T2NLWTBB3NSBKAW","created_at":"2026-07-05T05:38:54.578818+00:00"},{"alias_kind":"pith_short_8","alias_value":"2T2NLWTB","created_at":"2026-07-05T05:38:54.578818+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/2T2NLWTBB3NSBKAWGLYSKJCNAC","json":"https://pith.science/pith/2T2NLWTBB3NSBKAWGLYSKJCNAC.json","graph_json":"https://pith.science/api/pith-number/2T2NLWTBB3NSBKAWGLYSKJCNAC/graph.json","events_json":"https://pith.science/api/pith-number/2T2NLWTBB3NSBKAWGLYSKJCNAC/events.json","paper":"https://pith.science/paper/2T2NLWTB"},"agent_actions":{"view_html":"https://pith.science/pith/2T2NLWTBB3NSBKAWGLYSKJCNAC","download_json":"https://pith.science/pith/2T2NLWTBB3NSBKAWGLYSKJCNAC.json","view_paper":"https://pith.science/paper/2T2NLWTB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.02565&json=true","fetch_graph":"https://pith.science/api/pith-number/2T2NLWTBB3NSBKAWGLYSKJCNAC/graph.json","fetch_events":"https://pith.science/api/pith-number/2T2NLWTBB3NSBKAWGLYSKJCNAC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2T2NLWTBB3NSBKAWGLYSKJCNAC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2T2NLWTBB3NSBKAWGLYSKJCNAC/action/storage_attestation","attest_author":"https://pith.science/pith/2T2NLWTBB3NSBKAWGLYSKJCNAC/action/author_attestation","sign_citation":"https://pith.science/pith/2T2NLWTBB3NSBKAWGLYSKJCNAC/action/citation_signature","submit_replication":"https://pith.science/pith/2T2NLWTBB3NSBKAWGLYSKJCNAC/action/replication_record"}},"created_at":"2026-07-05T05:38:54.578818+00:00","updated_at":"2026-07-05T05:38:54.578818+00:00"}