{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:W7S2HLALKLXM5M2FAHO7W2GLPZ","short_pith_number":"pith:W7S2HLAL","canonical_record":{"source":{"id":"1812.07611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-26T17:44:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dce9c98dc4429596887c931fc5df938f890914971102a687ead646386a419949","abstract_canon_sha256":"f6fbb5cd3b54b411b162cf845cd8eae5aa5635dc10b1a7c796b89f0e175bb333"},"schema_version":"1.0"},"canonical_sha256":"b7e5a3ac0b52eeceb34501ddfb68cb7e7a9a8b5f87231d459c04fbe1f0a05cd2","source":{"kind":"arxiv","id":"1812.07611","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.07611","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1812.07611v1","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07611","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"W7S2HLALKLXM","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W7S2HLALKLXM5M2F","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W7S2HLAL","created_at":"2026-05-18T12:32:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:W7S2HLALKLXM5M2FAHO7W2GLPZ","target":"record","payload":{"canonical_record":{"source":{"id":"1812.07611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-26T17:44:15Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"dce9c98dc4429596887c931fc5df938f890914971102a687ead646386a419949","abstract_canon_sha256":"f6fbb5cd3b54b411b162cf845cd8eae5aa5635dc10b1a7c796b89f0e175bb333"},"schema_version":"1.0"},"canonical_sha256":"b7e5a3ac0b52eeceb34501ddfb68cb7e7a9a8b5f87231d459c04fbe1f0a05cd2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:56.570140Z","signature_b64":"WVqAhOlSa2IIMPOQrGNMxIlrJDlmJrpB6HJZUX4RFwKgmgJn5UDCeFPG5hl/9s88D266X+k1MVvhiJSkDqAPBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7e5a3ac0b52eeceb34501ddfb68cb7e7a9a8b5f87231d459c04fbe1f0a05cd2","last_reissued_at":"2026-05-17T23:57:56.569434Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:56.569434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.07611","source_version":1,"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:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R2I4hfqkBBh6B+KHmAmaj1ZeI5sQ94kuJyCEASIWaMQ3CplJKnvZZqoOMTqWmkoRm6z+h6dk/K5r8x/ogLSZDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:50:27.129044Z"},"content_sha256":"b910f7a8e26dbe056c70b65d840d3a9b2008be9431f68d7c0260b44a615c6dba","schema_version":"1.0","event_id":"sha256:b910f7a8e26dbe056c70b65d840d3a9b2008be9431f68d7c0260b44a615c6dba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:W7S2HLALKLXM5M2FAHO7W2GLPZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"GP-CNAS: Convolutional Neural Network Architecture Search with Genetic Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.NE","authors_text":"Guozheng Li, Haoyuan Hu, Yichen Yao, Yiheng Zhu, Yinghui Xu, Yujie Chen, Zili Wu","submitted_at":"2018-11-26T17:44:15Z","abstract_excerpt":"Convolutional neural networks (CNNs) are effective at solving difficult problems like visual recognition, speech recognition and natural language processing. However, performance gain comes at the cost of laborious trial-and-error in designing deeper CNN architectures. In this paper, a genetic programming (GP) framework for convolutional neural network architecture search, abbreviated as GP-CNAS, is proposed to automatically search for optimal CNN architectures. GP-CNAS encodes CNNs as trees where leaf nodes (GP terminals) are selected residual blocks and non-leaf nodes (GP functions) specify "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.07611","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":""},"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:57:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EQoqME9VXyqQtI0oaDlw7+MwUNcyp6Sif0faPrSAGHUEUBwUQVoegKfbUm5gKD+sg4YTMSVJ6P5UHirv/q52Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:50:27.129764Z"},"content_sha256":"0a2fe2e94742ddd5cd698371d33b9275fbb832c07c0861835370cb60b5624570","schema_version":"1.0","event_id":"sha256:0a2fe2e94742ddd5cd698371d33b9275fbb832c07c0861835370cb60b5624570"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W7S2HLALKLXM5M2FAHO7W2GLPZ/bundle.json","state_url":"https://pith.science/pith/W7S2HLALKLXM5M2FAHO7W2GLPZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W7S2HLALKLXM5M2FAHO7W2GLPZ/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-05-27T16:50:27Z","links":{"resolver":"https://pith.science/pith/W7S2HLALKLXM5M2FAHO7W2GLPZ","bundle":"https://pith.science/pith/W7S2HLALKLXM5M2FAHO7W2GLPZ/bundle.json","state":"https://pith.science/pith/W7S2HLALKLXM5M2FAHO7W2GLPZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W7S2HLALKLXM5M2FAHO7W2GLPZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:W7S2HLALKLXM5M2FAHO7W2GLPZ","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":"f6fbb5cd3b54b411b162cf845cd8eae5aa5635dc10b1a7c796b89f0e175bb333","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-26T17:44:15Z","title_canon_sha256":"dce9c98dc4429596887c931fc5df938f890914971102a687ead646386a419949"},"schema_version":"1.0","source":{"id":"1812.07611","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.07611","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"arxiv_version","alias_value":"1812.07611v1","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.07611","created_at":"2026-05-17T23:57:56Z"},{"alias_kind":"pith_short_12","alias_value":"W7S2HLALKLXM","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_16","alias_value":"W7S2HLALKLXM5M2F","created_at":"2026-05-18T12:32:59Z"},{"alias_kind":"pith_short_8","alias_value":"W7S2HLAL","created_at":"2026-05-18T12:32:59Z"}],"graph_snapshots":[{"event_id":"sha256:0a2fe2e94742ddd5cd698371d33b9275fbb832c07c0861835370cb60b5624570","target":"graph","created_at":"2026-05-17T23:57:56Z","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":"Convolutional neural networks (CNNs) are effective at solving difficult problems like visual recognition, speech recognition and natural language processing. However, performance gain comes at the cost of laborious trial-and-error in designing deeper CNN architectures. In this paper, a genetic programming (GP) framework for convolutional neural network architecture search, abbreviated as GP-CNAS, is proposed to automatically search for optimal CNN architectures. GP-CNAS encodes CNNs as trees where leaf nodes (GP terminals) are selected residual blocks and non-leaf nodes (GP functions) specify ","authors_text":"Guozheng Li, Haoyuan Hu, Yichen Yao, Yiheng Zhu, Yinghui Xu, Yujie Chen, Zili Wu","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-26T17:44:15Z","title":"GP-CNAS: Convolutional Neural Network Architecture Search with Genetic Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.07611","kind":"arxiv","version":1},"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:b910f7a8e26dbe056c70b65d840d3a9b2008be9431f68d7c0260b44a615c6dba","target":"record","created_at":"2026-05-17T23:57:56Z","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":"f6fbb5cd3b54b411b162cf845cd8eae5aa5635dc10b1a7c796b89f0e175bb333","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-11-26T17:44:15Z","title_canon_sha256":"dce9c98dc4429596887c931fc5df938f890914971102a687ead646386a419949"},"schema_version":"1.0","source":{"id":"1812.07611","kind":"arxiv","version":1}},"canonical_sha256":"b7e5a3ac0b52eeceb34501ddfb68cb7e7a9a8b5f87231d459c04fbe1f0a05cd2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7e5a3ac0b52eeceb34501ddfb68cb7e7a9a8b5f87231d459c04fbe1f0a05cd2","first_computed_at":"2026-05-17T23:57:56.569434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:56.569434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WVqAhOlSa2IIMPOQrGNMxIlrJDlmJrpB6HJZUX4RFwKgmgJn5UDCeFPG5hl/9s88D266X+k1MVvhiJSkDqAPBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:56.570140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.07611","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b910f7a8e26dbe056c70b65d840d3a9b2008be9431f68d7c0260b44a615c6dba","sha256:0a2fe2e94742ddd5cd698371d33b9275fbb832c07c0861835370cb60b5624570"],"state_sha256":"ea0019fe7419fdb602461a7d091d1f133e95c54da023e66021eccdeb07dc99e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+ILQO3HCYzdOHFzW7t5CT9mZ3XHznNHXD79jjTVnHN2+iIaZdw7Nl3QZovri2Z07JvxNeHsh/FdAB8eoDZLHDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:50:27.133498Z","bundle_sha256":"c0fad2c1e8b57a91803a40dbad5b0d203999b8b0d4827410a2ea38e2124723c8"}}