{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:43DALGRRH4745VEQXPHPNXB4CZ","short_pith_number":"pith:43DALGRR","canonical_record":{"source":{"id":"2109.07582","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-09-14T13:28:07Z","cross_cats_sorted":[],"title_canon_sha256":"8f31297aa6a29aa7cf9c77c8b44ed047ab96a2c711251db21bb0f910ce361419","abstract_canon_sha256":"2c857af5a68c6d54bb739fc40d862a50b506e39308241ad8d5edbaa0175d3f7c"},"schema_version":"1.0"},"canonical_sha256":"e6c6059a313f3fced490bbcef6dc3c164e2b1b9ffca8328495ca4724a2fcd4cb","source":{"kind":"arxiv","id":"2109.07582","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.07582","created_at":"2026-07-05T07:53:57Z"},{"alias_kind":"arxiv_version","alias_value":"2109.07582v2","created_at":"2026-07-05T07:53:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.07582","created_at":"2026-07-05T07:53:57Z"},{"alias_kind":"pith_short_12","alias_value":"43DALGRRH474","created_at":"2026-07-05T07:53:57Z"},{"alias_kind":"pith_short_16","alias_value":"43DALGRRH4745VEQ","created_at":"2026-07-05T07:53:57Z"},{"alias_kind":"pith_short_8","alias_value":"43DALGRR","created_at":"2026-07-05T07:53:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:43DALGRRH4745VEQXPHPNXB4CZ","target":"record","payload":{"canonical_record":{"source":{"id":"2109.07582","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-09-14T13:28:07Z","cross_cats_sorted":[],"title_canon_sha256":"8f31297aa6a29aa7cf9c77c8b44ed047ab96a2c711251db21bb0f910ce361419","abstract_canon_sha256":"2c857af5a68c6d54bb739fc40d862a50b506e39308241ad8d5edbaa0175d3f7c"},"schema_version":"1.0"},"canonical_sha256":"e6c6059a313f3fced490bbcef6dc3c164e2b1b9ffca8328495ca4724a2fcd4cb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:53:57.358670Z","signature_b64":"Ula0LO7COcWCI6FLvH6TGnb6JpopAz49LPFjJnkgiIyt8Hl4aUtu9034xOyhGgB0VOoTJeDjWgQneXvD+/CqCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e6c6059a313f3fced490bbcef6dc3c164e2b1b9ffca8328495ca4724a2fcd4cb","last_reissued_at":"2026-07-05T07:53:57.358001Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:53:57.358001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2109.07582","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-05T07:53:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"47iEupHr+sT5fj5dv6U4goGH7Jm6ahMqcn2oZHm239q8MLnbdJPeQaBGdPwpGoc4Agxersxj8zAArhf3Hkx+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:08:37.855407Z"},"content_sha256":"2c39607b2b0e49403020d728b25ca40531dea85ac67bbea11c5e17f047161e96","schema_version":"1.0","event_id":"sha256:2c39607b2b0e49403020d728b25ca40531dea85ac67bbea11c5e17f047161e96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:43DALGRRH4745VEQXPHPNXB4CZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pareto-wise Ranking Classifier for Multi-objective Evolutionary Neural Architecture Search","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Guo Yu, Lianbo Ma, Min Huang, Nan Li, Xiaoyu Geng, Xingwei Wang","submitted_at":"2021-09-14T13:28:07Z","abstract_excerpt":"In the deployment of deep neural models, how to effectively and automatically find feasible deep models under diverse design objectives is fundamental. Most existing neural architecture search (NAS) methods utilize surrogates to predict the detailed performance (e.g., accuracy and model size) of a candidate architecture during the search, which however is complicated and inefficient. In contrast, we aim to learn an efficient Pareto classifier to simplify the search process of NAS by transforming the complex multi-objective NAS task into a simple Pareto-dominance classification task. To this en"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.07582","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/2109.07582/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-05T07:53:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8oaSX4TCEdUG7zka295q114AuiFbd2p4ruyN4NUdolN4f4C5srhEA5MOYI+v/NW0W0ruyh+ji9KaZst3FvMpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T07:08:37.855922Z"},"content_sha256":"4e5ad019437e3b5828d0dfe739a54c4131c03b79e04f6d8a66f1e050da0d8ef4","schema_version":"1.0","event_id":"sha256:4e5ad019437e3b5828d0dfe739a54c4131c03b79e04f6d8a66f1e050da0d8ef4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/43DALGRRH4745VEQXPHPNXB4CZ/bundle.json","state_url":"https://pith.science/pith/43DALGRRH4745VEQXPHPNXB4CZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/43DALGRRH4745VEQXPHPNXB4CZ/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-05T07:08:37Z","links":{"resolver":"https://pith.science/pith/43DALGRRH4745VEQXPHPNXB4CZ","bundle":"https://pith.science/pith/43DALGRRH4745VEQXPHPNXB4CZ/bundle.json","state":"https://pith.science/pith/43DALGRRH4745VEQXPHPNXB4CZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/43DALGRRH4745VEQXPHPNXB4CZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:43DALGRRH4745VEQXPHPNXB4CZ","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":"2c857af5a68c6d54bb739fc40d862a50b506e39308241ad8d5edbaa0175d3f7c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-09-14T13:28:07Z","title_canon_sha256":"8f31297aa6a29aa7cf9c77c8b44ed047ab96a2c711251db21bb0f910ce361419"},"schema_version":"1.0","source":{"id":"2109.07582","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.07582","created_at":"2026-07-05T07:53:57Z"},{"alias_kind":"arxiv_version","alias_value":"2109.07582v2","created_at":"2026-07-05T07:53:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.07582","created_at":"2026-07-05T07:53:57Z"},{"alias_kind":"pith_short_12","alias_value":"43DALGRRH474","created_at":"2026-07-05T07:53:57Z"},{"alias_kind":"pith_short_16","alias_value":"43DALGRRH4745VEQ","created_at":"2026-07-05T07:53:57Z"},{"alias_kind":"pith_short_8","alias_value":"43DALGRR","created_at":"2026-07-05T07:53:57Z"}],"graph_snapshots":[{"event_id":"sha256:4e5ad019437e3b5828d0dfe739a54c4131c03b79e04f6d8a66f1e050da0d8ef4","target":"graph","created_at":"2026-07-05T07:53:57Z","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/2109.07582/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In the deployment of deep neural models, how to effectively and automatically find feasible deep models under diverse design objectives is fundamental. Most existing neural architecture search (NAS) methods utilize surrogates to predict the detailed performance (e.g., accuracy and model size) of a candidate architecture during the search, which however is complicated and inefficient. In contrast, we aim to learn an efficient Pareto classifier to simplify the search process of NAS by transforming the complex multi-objective NAS task into a simple Pareto-dominance classification task. To this en","authors_text":"Guo Yu, Lianbo Ma, Min Huang, Nan Li, Xiaoyu Geng, Xingwei Wang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-09-14T13:28:07Z","title":"Pareto-wise Ranking Classifier for Multi-objective Evolutionary Neural Architecture Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.07582","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:2c39607b2b0e49403020d728b25ca40531dea85ac67bbea11c5e17f047161e96","target":"record","created_at":"2026-07-05T07:53:57Z","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":"2c857af5a68c6d54bb739fc40d862a50b506e39308241ad8d5edbaa0175d3f7c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2021-09-14T13:28:07Z","title_canon_sha256":"8f31297aa6a29aa7cf9c77c8b44ed047ab96a2c711251db21bb0f910ce361419"},"schema_version":"1.0","source":{"id":"2109.07582","kind":"arxiv","version":2}},"canonical_sha256":"e6c6059a313f3fced490bbcef6dc3c164e2b1b9ffca8328495ca4724a2fcd4cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e6c6059a313f3fced490bbcef6dc3c164e2b1b9ffca8328495ca4724a2fcd4cb","first_computed_at":"2026-07-05T07:53:57.358001Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:53:57.358001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ula0LO7COcWCI6FLvH6TGnb6JpopAz49LPFjJnkgiIyt8Hl4aUtu9034xOyhGgB0VOoTJeDjWgQneXvD+/CqCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T07:53:57.358670Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.07582","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2c39607b2b0e49403020d728b25ca40531dea85ac67bbea11c5e17f047161e96","sha256:4e5ad019437e3b5828d0dfe739a54c4131c03b79e04f6d8a66f1e050da0d8ef4"],"state_sha256":"e515d39055661d39b8a30046b32d379e02ba80ed9664bf6eb25d86abaf31a12f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZtDNyOXYt6i/lj+bVrfNjoAvV0AwkJ5nM+15JevVphZc9T/QZz8EEfX+AO6PQ0ZmbtyD9fcyXMe/2LZ75x7GBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T07:08:37.860676Z","bundle_sha256":"e7a416de09f11283ae624821089ab657dd95e5315e6b8ca16b61010aa565f662"}}