{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RZPSNLQ7V23UGAE3MP3C5W7V24","short_pith_number":"pith:RZPSNLQ7","schema_version":"1.0","canonical_sha256":"8e5f26ae1faeb743009b63f62edbf5d719e8f043cdf073986b5a34347563c7ec","source":{"kind":"arxiv","id":"1806.00851","version":1},"attestation_state":"computed","paper":{"title":"An Aggressive Genetic Programming Approach for Searching Neural Network Structure Under Computational Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ning Zhang, Tianbao Yang, Xiaoyu Wang, Xuehan Xiong, Zhe Li, Zhou Ren","submitted_at":"2018-06-03T19:16:31Z","abstract_excerpt":"Recently, there emerged revived interests of designing automatic programs (e.g., using genetic/evolutionary algorithms) to optimize the structure of Convolutional Neural Networks (CNNs) for a specific task. The challenge in designing such programs lies in how to balance between large search space of the network structures and high computational costs. Existing works either impose strong restrictions on the search space or use enormous computing resources. In this paper, we study how to design a genetic programming approach for optimizing the structure of a CNN for a given task under limited co"},"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":"1806.00851","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2018-06-03T19:16:31Z","cross_cats_sorted":[],"title_canon_sha256":"fb655f5950ece9e0fe2a7e7bba7dd6204cf13ffe677e979afccbad907e59b3e2","abstract_canon_sha256":"7031f6c741eaa7e2350fda04de5324cdeeb5e82f86bb2739e02b37be148db180"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:18.223427Z","signature_b64":"MXyip9eillKElAPPSNRkRGMewPbUBKiSrGtDUxBl5SpDNaiRD/mIv2hKFHJc2tM84LFl3x2RzVQKhXLmaETFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e5f26ae1faeb743009b63f62edbf5d719e8f043cdf073986b5a34347563c7ec","last_reissued_at":"2026-05-18T00:14:18.222944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:18.222944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Aggressive Genetic Programming Approach for Searching Neural Network Structure Under Computational Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"Ning Zhang, Tianbao Yang, Xiaoyu Wang, Xuehan Xiong, Zhe Li, Zhou Ren","submitted_at":"2018-06-03T19:16:31Z","abstract_excerpt":"Recently, there emerged revived interests of designing automatic programs (e.g., using genetic/evolutionary algorithms) to optimize the structure of Convolutional Neural Networks (CNNs) for a specific task. The challenge in designing such programs lies in how to balance between large search space of the network structures and high computational costs. Existing works either impose strong restrictions on the search space or use enormous computing resources. In this paper, we study how to design a genetic programming approach for optimizing the structure of a CNN for a given task under limited co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00851","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.00851","created_at":"2026-05-18T00:14:18.223020+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.00851v1","created_at":"2026-05-18T00:14:18.223020+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00851","created_at":"2026-05-18T00:14:18.223020+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZPSNLQ7V23U","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZPSNLQ7V23UGAE3","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZPSNLQ7","created_at":"2026-05-18T12:32:50.500415+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/RZPSNLQ7V23UGAE3MP3C5W7V24","json":"https://pith.science/pith/RZPSNLQ7V23UGAE3MP3C5W7V24.json","graph_json":"https://pith.science/api/pith-number/RZPSNLQ7V23UGAE3MP3C5W7V24/graph.json","events_json":"https://pith.science/api/pith-number/RZPSNLQ7V23UGAE3MP3C5W7V24/events.json","paper":"https://pith.science/paper/RZPSNLQ7"},"agent_actions":{"view_html":"https://pith.science/pith/RZPSNLQ7V23UGAE3MP3C5W7V24","download_json":"https://pith.science/pith/RZPSNLQ7V23UGAE3MP3C5W7V24.json","view_paper":"https://pith.science/paper/RZPSNLQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.00851&json=true","fetch_graph":"https://pith.science/api/pith-number/RZPSNLQ7V23UGAE3MP3C5W7V24/graph.json","fetch_events":"https://pith.science/api/pith-number/RZPSNLQ7V23UGAE3MP3C5W7V24/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZPSNLQ7V23UGAE3MP3C5W7V24/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZPSNLQ7V23UGAE3MP3C5W7V24/action/storage_attestation","attest_author":"https://pith.science/pith/RZPSNLQ7V23UGAE3MP3C5W7V24/action/author_attestation","sign_citation":"https://pith.science/pith/RZPSNLQ7V23UGAE3MP3C5W7V24/action/citation_signature","submit_replication":"https://pith.science/pith/RZPSNLQ7V23UGAE3MP3C5W7V24/action/replication_record"}},"created_at":"2026-05-18T00:14:18.223020+00:00","updated_at":"2026-05-18T00:14:18.223020+00:00"}