{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OM43RVZRQOPFLLM77XELUL2QYY","short_pith_number":"pith:OM43RVZR","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"},"canonical_sha256":"7339b8d731839e55ad9ffdc8ba2f50c61d3b6a352df9c6a676ac79bae4c7235e","source":{"kind":"arxiv","id":"1810.03522","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03522","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03522v2","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03522","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"OM43RVZRQOPF","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OM43RVZRQOPFLLM7","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OM43RVZR","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OM43RVZRQOPFLLM77XELUL2QYY","target":"record","payload":{"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"},"canonical_sha256":"7339b8d731839e55ad9ffdc8ba2f50c61d3b6a352df9c6a676ac79bae4c7235e","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"},"source_kind":"arxiv","source_id":"1810.03522","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-05-17T23:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wgNEpQoIHAIqgyB2s48jj/NeTARqoP2cA2/wTnMxRb+SWALUEmK+0RW0XPeEk/rD1Gj/oPfGrwLiSOlC3GrMBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:40:29.500642Z"},"content_sha256":"ea02407c443fe0d17e2d44bb0dbf76c7da756e4de0d101066c7f42a7caa4f84e","schema_version":"1.0","event_id":"sha256:ea02407c443fe0d17e2d44bb0dbf76c7da756e4de0d101066c7f42a7caa4f84e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OM43RVZRQOPFLLM77XELUL2QYY","target":"graph","payload":{"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"},"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-05-17T23:48:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/BRcpzv1vWo6mraTaGIKG26bzrEjuBRpqGpHppEXJ7S5yeud3QKaNBIHDKSUWqNrpSGPoiGNIrqIqLG39b0XCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T03:40:29.500982Z"},"content_sha256":"06ae9a5d039824878d49a0c19739eedc9dbe40d158858f5c8cf2759d287b6a0b","schema_version":"1.0","event_id":"sha256:06ae9a5d039824878d49a0c19739eedc9dbe40d158858f5c8cf2759d287b6a0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OM43RVZRQOPFLLM77XELUL2QYY/bundle.json","state_url":"https://pith.science/pith/OM43RVZRQOPFLLM77XELUL2QYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OM43RVZRQOPFLLM77XELUL2QYY/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-06-29T03:40:29Z","links":{"resolver":"https://pith.science/pith/OM43RVZRQOPFLLM77XELUL2QYY","bundle":"https://pith.science/pith/OM43RVZRQOPFLLM77XELUL2QYY/bundle.json","state":"https://pith.science/pith/OM43RVZRQOPFLLM77XELUL2QYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OM43RVZRQOPFLLM77XELUL2QYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OM43RVZRQOPFLLM77XELUL2QYY","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":"06ec7740d7f253212c9fe17ca63993ccd89eda7f7163a7fb0a572276120865c7","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-10-08T15:14:33Z","title_canon_sha256":"af49f671be945a887794cd0003abfce9434996ee5a197e7c91ea452b632725a1"},"schema_version":"1.0","source":{"id":"1810.03522","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03522","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03522v2","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03522","created_at":"2026-05-17T23:48:11Z"},{"alias_kind":"pith_short_12","alias_value":"OM43RVZRQOPF","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OM43RVZRQOPFLLM7","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OM43RVZR","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:06ae9a5d039824878d49a0c19739eedc9dbe40d158858f5c8cf2759d287b6a0b","target":"graph","created_at":"2026-05-17T23:48:11Z","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"},"paper":{"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","authors_text":"Erik Goodman, Ian Whalen, Kalyanmoy Deb, Vishnu Boddeti, Wolfgang Banzhaf, Yashesh Dhebar, Zhichao Lu","cross_cats":["cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-10-08T15:14:33Z","title":"NSGA-Net: Neural Architecture Search using Multi-Objective Genetic Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03522","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:ea02407c443fe0d17e2d44bb0dbf76c7da756e4de0d101066c7f42a7caa4f84e","target":"record","created_at":"2026-05-17T23:48:11Z","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":"06ec7740d7f253212c9fe17ca63993ccd89eda7f7163a7fb0a572276120865c7","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-10-08T15:14:33Z","title_canon_sha256":"af49f671be945a887794cd0003abfce9434996ee5a197e7c91ea452b632725a1"},"schema_version":"1.0","source":{"id":"1810.03522","kind":"arxiv","version":2}},"canonical_sha256":"7339b8d731839e55ad9ffdc8ba2f50c61d3b6a352df9c6a676ac79bae4c7235e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7339b8d731839e55ad9ffdc8ba2f50c61d3b6a352df9c6a676ac79bae4c7235e","first_computed_at":"2026-05-17T23:48:11.392422Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:11.392422Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Pvc2pxLCIF2fZS7GX1BWz3XWdVXSQooaWo26H0KrMwVCde0m3NERkwVr3NOBpe24z8wUnO++67AeIMwKtmpXAA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:11.393014Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.03522","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea02407c443fe0d17e2d44bb0dbf76c7da756e4de0d101066c7f42a7caa4f84e","sha256:06ae9a5d039824878d49a0c19739eedc9dbe40d158858f5c8cf2759d287b6a0b"],"state_sha256":"449d9a3dc463849c2679d926199b7905b63e12c16688c0a08419dc10fa1acdd4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HLae5CpL/+VfCNRfEcLAAbD3cjb//B8Osw9IF+EIJlPxyLe9Jwq+mNd/42HGOD4fRnlHaowcofTFrne1hhZLDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T03:40:29.502996Z","bundle_sha256":"023fb6955b74394b67b4ad29cd69d1a51d1d0988b1e0a92f72b799bd9b8c25f8"}}