{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OM43RVZRQOPFLLM77XELUL2QYY","short_pith_number":"pith:OM43RVZR","schema_version":"1.0","canonical_sha256":"7339b8d731839e55ad9ffdc8ba2f50c61d3b6a352df9c6a676ac79bae4c7235e","source":{"kind":"arxiv","id":"1810.03522","version":2},"attestation_state":"computed","paper":{"title":"NSGA-Net: Neural Architecture Search using Multi-Objective Genetic Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Erik Goodman, Ian Whalen, Kalyanmoy Deb, Vishnu Boddeti, Wolfgang Banzhaf, Yashesh Dhebar, Zhichao Lu","submitted_at":"2018-10-08T15:14:33Z","abstract_excerpt":"This paper introduces NSGA-Net -- an evolutionary approach for neural architecture search (NAS). NSGA-Net is designed with three goals in mind: (1) a procedure considering multiple and conflicting objectives, (2) an efficient procedure balancing exploration and exploitation of the space of potential neural network architectures, and (3) a procedure finding a diverse set of trade-off network architectures achieved in a single run. NSGA-Net is a population-based search algorithm that explores a space of potential neural network architectures in three steps, namely, a population initialization st"},"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":"1810.03522","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-10-08T15:14:33Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"af49f671be945a887794cd0003abfce9434996ee5a197e7c91ea452b632725a1","abstract_canon_sha256":"06ec7740d7f253212c9fe17ca63993ccd89eda7f7163a7fb0a572276120865c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:11.393014Z","signature_b64":"Pvc2pxLCIF2fZS7GX1BWz3XWdVXSQooaWo26H0KrMwVCde0m3NERkwVr3NOBpe24z8wUnO++67AeIMwKtmpXAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7339b8d731839e55ad9ffdc8ba2f50c61d3b6a352df9c6a676ac79bae4c7235e","last_reissued_at":"2026-05-17T23:48:11.392422Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:11.392422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"NSGA-Net: Neural Architecture Search using Multi-Objective Genetic Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Erik Goodman, Ian Whalen, Kalyanmoy Deb, Vishnu Boddeti, Wolfgang Banzhaf, Yashesh Dhebar, Zhichao Lu","submitted_at":"2018-10-08T15:14:33Z","abstract_excerpt":"This paper introduces NSGA-Net -- an evolutionary approach for neural architecture search (NAS). NSGA-Net is designed with three goals in mind: (1) a procedure considering multiple and conflicting objectives, (2) an efficient procedure balancing exploration and exploitation of the space of potential neural network architectures, and (3) a procedure finding a diverse set of trade-off network architectures achieved in a single run. NSGA-Net is a population-based search algorithm that explores a space of potential neural network architectures in three steps, namely, a population initialization st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03522","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":""},"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":"1810.03522","created_at":"2026-05-17T23:48:11.392529+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.03522v2","created_at":"2026-05-17T23:48:11.392529+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03522","created_at":"2026-05-17T23:48:11.392529+00:00"},{"alias_kind":"pith_short_12","alias_value":"OM43RVZRQOPF","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OM43RVZRQOPFLLM7","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OM43RVZR","created_at":"2026-05-18T12:32:43.782077+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/OM43RVZRQOPFLLM77XELUL2QYY","json":"https://pith.science/pith/OM43RVZRQOPFLLM77XELUL2QYY.json","graph_json":"https://pith.science/api/pith-number/OM43RVZRQOPFLLM77XELUL2QYY/graph.json","events_json":"https://pith.science/api/pith-number/OM43RVZRQOPFLLM77XELUL2QYY/events.json","paper":"https://pith.science/paper/OM43RVZR"},"agent_actions":{"view_html":"https://pith.science/pith/OM43RVZRQOPFLLM77XELUL2QYY","download_json":"https://pith.science/pith/OM43RVZRQOPFLLM77XELUL2QYY.json","view_paper":"https://pith.science/paper/OM43RVZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.03522&json=true","fetch_graph":"https://pith.science/api/pith-number/OM43RVZRQOPFLLM77XELUL2QYY/graph.json","fetch_events":"https://pith.science/api/pith-number/OM43RVZRQOPFLLM77XELUL2QYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OM43RVZRQOPFLLM77XELUL2QYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OM43RVZRQOPFLLM77XELUL2QYY/action/storage_attestation","attest_author":"https://pith.science/pith/OM43RVZRQOPFLLM77XELUL2QYY/action/author_attestation","sign_citation":"https://pith.science/pith/OM43RVZRQOPFLLM77XELUL2QYY/action/citation_signature","submit_replication":"https://pith.science/pith/OM43RVZRQOPFLLM77XELUL2QYY/action/replication_record"}},"created_at":"2026-05-17T23:48:11.392529+00:00","updated_at":"2026-05-17T23:48:11.392529+00:00"}