{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QBIPDRS7TY3AXHRRWOAAYCMJJS","short_pith_number":"pith:QBIPDRS7","schema_version":"1.0","canonical_sha256":"8050f1c65f9e360b9e31b3800c09894c98c8024895d54bab4675d08c3df60b6f","source":{"kind":"arxiv","id":"1906.00399","version":2},"attestation_state":"computed","paper":{"title":"Multi-Objective Pruning for CNNs Using Genetic Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Boyu Diao, Chao Li, Chuanguang Yang, Yongjun Xu, Zhulin An","submitted_at":"2019-06-02T13:17:37Z","abstract_excerpt":"In this work, we propose a heuristic genetic algorithm (GA) for pruning convolutional neural networks (CNNs) according to the multi-objective trade-off among error, computation and sparsity. In our experiments, we apply our approach to prune pre-trained LeNet across the MNIST dataset, which reduces 95.42% parameter size and achieves 16$\\times$ speedups of convolutional layer computation with tiny accuracy loss by laying emphasis on sparsity and computation, respectively. Our empirical study suggests that GA is an alternative pruning approach for obtaining a competitive compression performance."},"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":"1906.00399","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2019-06-02T13:17:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9b34ad6fa09b2327e3ae03e71a2d20eb2fccb73194cf7f388be9b4d198bea364","abstract_canon_sha256":"8a97336aff6891f13e29b50684b46c0c7a38977cd50c95fc09d4b6fcf002ebb4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:30.266923Z","signature_b64":"6/y67rv1vNEpSzzpTxOljFIsLW9oi462wwphJ38+gJkwVMLXxLIVSsHy3FXDsSW5slLHQvAST9C33qX4RAqVBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8050f1c65f9e360b9e31b3800c09894c98c8024895d54bab4675d08c3df60b6f","last_reissued_at":"2026-05-17T23:41:30.266031Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:30.266031Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Objective Pruning for CNNs Using Genetic Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.NE","authors_text":"Boyu Diao, Chao Li, Chuanguang Yang, Yongjun Xu, Zhulin An","submitted_at":"2019-06-02T13:17:37Z","abstract_excerpt":"In this work, we propose a heuristic genetic algorithm (GA) for pruning convolutional neural networks (CNNs) according to the multi-objective trade-off among error, computation and sparsity. In our experiments, we apply our approach to prune pre-trained LeNet across the MNIST dataset, which reduces 95.42% parameter size and achieves 16$\\times$ speedups of convolutional layer computation with tiny accuracy loss by laying emphasis on sparsity and computation, respectively. Our empirical study suggests that GA is an alternative pruning approach for obtaining a competitive compression performance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.00399","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":"1906.00399","created_at":"2026-05-17T23:41:30.266165+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.00399v2","created_at":"2026-05-17T23:41:30.266165+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.00399","created_at":"2026-05-17T23:41:30.266165+00:00"},{"alias_kind":"pith_short_12","alias_value":"QBIPDRS7TY3A","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QBIPDRS7TY3AXHRR","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QBIPDRS7","created_at":"2026-05-18T12:33:27.125529+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/QBIPDRS7TY3AXHRRWOAAYCMJJS","json":"https://pith.science/pith/QBIPDRS7TY3AXHRRWOAAYCMJJS.json","graph_json":"https://pith.science/api/pith-number/QBIPDRS7TY3AXHRRWOAAYCMJJS/graph.json","events_json":"https://pith.science/api/pith-number/QBIPDRS7TY3AXHRRWOAAYCMJJS/events.json","paper":"https://pith.science/paper/QBIPDRS7"},"agent_actions":{"view_html":"https://pith.science/pith/QBIPDRS7TY3AXHRRWOAAYCMJJS","download_json":"https://pith.science/pith/QBIPDRS7TY3AXHRRWOAAYCMJJS.json","view_paper":"https://pith.science/paper/QBIPDRS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.00399&json=true","fetch_graph":"https://pith.science/api/pith-number/QBIPDRS7TY3AXHRRWOAAYCMJJS/graph.json","fetch_events":"https://pith.science/api/pith-number/QBIPDRS7TY3AXHRRWOAAYCMJJS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QBIPDRS7TY3AXHRRWOAAYCMJJS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QBIPDRS7TY3AXHRRWOAAYCMJJS/action/storage_attestation","attest_author":"https://pith.science/pith/QBIPDRS7TY3AXHRRWOAAYCMJJS/action/author_attestation","sign_citation":"https://pith.science/pith/QBIPDRS7TY3AXHRRWOAAYCMJJS/action/citation_signature","submit_replication":"https://pith.science/pith/QBIPDRS7TY3AXHRRWOAAYCMJJS/action/replication_record"}},"created_at":"2026-05-17T23:41:30.266165+00:00","updated_at":"2026-05-17T23:41:30.266165+00:00"}