{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:MCATZGAZ2MAUFRW7LPG7EAYUTS","short_pith_number":"pith:MCATZGAZ","schema_version":"1.0","canonical_sha256":"60813c9819d30142c6df5bcdf203149ca06dd83d48c291f21ac39e7b847a7530","source":{"kind":"arxiv","id":"1802.00124","version":2},"attestation_state":"computed","paper":{"title":"Rethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"James Z. Wang, Jianbo Ye, Xin Lu, Zhe Lin","submitted_at":"2018-02-01T01:58:22Z","abstract_excerpt":"Model pruning has become a useful technique that improves the computational efficiency of deep learning, making it possible to deploy solutions in resource-limited scenarios. A widely-used practice in relevant work assumes that a smaller-norm parameter or feature plays a less informative role at the inference time. In this paper, we propose a channel pruning technique for accelerating the computations of deep convolutional neural networks (CNNs) that does not critically rely on this assumption. Instead, it focuses on direct simplification of the channel-to-channel computation graph of a CNN wi"},"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":"1802.00124","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-01T01:58:22Z","cross_cats_sorted":[],"title_canon_sha256":"39b4d16f8691d8f3245c7a8fa926499569915831ca312e76efef72b466fe20a6","abstract_canon_sha256":"8a6b52683a8423c566502c588d2b0071529754e7231be2d386c1364022032572"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:28.229490Z","signature_b64":"pzwTyd5Zi+gf9ONULMrImNHajDKA6ba6FtDSlxlbZLw5FPgzUM38g0pFURS/RUnhZ+YNiNPwRiaAqfSu50NPCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60813c9819d30142c6df5bcdf203149ca06dd83d48c291f21ac39e7b847a7530","last_reissued_at":"2026-05-18T00:24:28.228821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:28.228821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rethinking the Smaller-Norm-Less-Informative Assumption in Channel Pruning of Convolution Layers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"James Z. Wang, Jianbo Ye, Xin Lu, Zhe Lin","submitted_at":"2018-02-01T01:58:22Z","abstract_excerpt":"Model pruning has become a useful technique that improves the computational efficiency of deep learning, making it possible to deploy solutions in resource-limited scenarios. A widely-used practice in relevant work assumes that a smaller-norm parameter or feature plays a less informative role at the inference time. In this paper, we propose a channel pruning technique for accelerating the computations of deep convolutional neural networks (CNNs) that does not critically rely on this assumption. Instead, it focuses on direct simplification of the channel-to-channel computation graph of a CNN wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00124","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":"1802.00124","created_at":"2026-05-18T00:24:28.228921+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.00124v2","created_at":"2026-05-18T00:24:28.228921+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00124","created_at":"2026-05-18T00:24:28.228921+00:00"},{"alias_kind":"pith_short_12","alias_value":"MCATZGAZ2MAU","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"MCATZGAZ2MAUFRW7","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"MCATZGAZ","created_at":"2026-05-18T12:32:37.024351+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/MCATZGAZ2MAUFRW7LPG7EAYUTS","json":"https://pith.science/pith/MCATZGAZ2MAUFRW7LPG7EAYUTS.json","graph_json":"https://pith.science/api/pith-number/MCATZGAZ2MAUFRW7LPG7EAYUTS/graph.json","events_json":"https://pith.science/api/pith-number/MCATZGAZ2MAUFRW7LPG7EAYUTS/events.json","paper":"https://pith.science/paper/MCATZGAZ"},"agent_actions":{"view_html":"https://pith.science/pith/MCATZGAZ2MAUFRW7LPG7EAYUTS","download_json":"https://pith.science/pith/MCATZGAZ2MAUFRW7LPG7EAYUTS.json","view_paper":"https://pith.science/paper/MCATZGAZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.00124&json=true","fetch_graph":"https://pith.science/api/pith-number/MCATZGAZ2MAUFRW7LPG7EAYUTS/graph.json","fetch_events":"https://pith.science/api/pith-number/MCATZGAZ2MAUFRW7LPG7EAYUTS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MCATZGAZ2MAUFRW7LPG7EAYUTS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MCATZGAZ2MAUFRW7LPG7EAYUTS/action/storage_attestation","attest_author":"https://pith.science/pith/MCATZGAZ2MAUFRW7LPG7EAYUTS/action/author_attestation","sign_citation":"https://pith.science/pith/MCATZGAZ2MAUFRW7LPG7EAYUTS/action/citation_signature","submit_replication":"https://pith.science/pith/MCATZGAZ2MAUFRW7LPG7EAYUTS/action/replication_record"}},"created_at":"2026-05-18T00:24:28.228921+00:00","updated_at":"2026-05-18T00:24:28.228921+00:00"}