{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DWGZEHYT6AS7CI4OQJHACTOGQ6","short_pith_number":"pith:DWGZEHYT","schema_version":"1.0","canonical_sha256":"1d8d921f13f025f1238e824e014dc68785f752295beb2d1335392be69ad83012","source":{"kind":"arxiv","id":"1708.06519","version":1},"attestation_state":"computed","paper":{"title":"Learning Efficient Convolutional Networks through Network Slimming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Changshui Zhang, Gao Huang, Jianguo Li, Shoumeng Yan, Zhiqiang Shen, Zhuang Liu","submitted_at":"2017-08-22T07:35:26Z","abstract_excerpt":"The deployment of deep convolutional neural networks (CNNs) in many real world applications is largely hindered by their high computational cost. In this paper, we propose a novel learning scheme for CNNs to simultaneously 1) reduce the model size; 2) decrease the run-time memory footprint; and 3) lower the number of computing operations, without compromising accuracy. This is achieved by enforcing channel-level sparsity in the network in a simple but effective way. Different from many existing approaches, the proposed method directly applies to modern CNN architectures, introduces minimum ove"},"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":"1708.06519","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-08-22T07:35:26Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"7c60099170ce14dcac90d9401d27a3585cbd9f638b8b0b8b7b134f6cb067b692","abstract_canon_sha256":"8760ad3375d93e179a38c6b711921470ca833fe9bed2e863e23677512c49c0e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:39.246451Z","signature_b64":"zmYyafGNEvIYdkKYFWPNUKDjWPa+v+Ijo/zZWvlxxvAmh7r5E2K4ACLfpQchGYopDXfN5PfekDH4VRCXqF4gAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d8d921f13f025f1238e824e014dc68785f752295beb2d1335392be69ad83012","last_reissued_at":"2026-05-18T00:37:39.245856Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:39.245856Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Efficient Convolutional Networks through Network Slimming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Changshui Zhang, Gao Huang, Jianguo Li, Shoumeng Yan, Zhiqiang Shen, Zhuang Liu","submitted_at":"2017-08-22T07:35:26Z","abstract_excerpt":"The deployment of deep convolutional neural networks (CNNs) in many real world applications is largely hindered by their high computational cost. In this paper, we propose a novel learning scheme for CNNs to simultaneously 1) reduce the model size; 2) decrease the run-time memory footprint; and 3) lower the number of computing operations, without compromising accuracy. This is achieved by enforcing channel-level sparsity in the network in a simple but effective way. Different from many existing approaches, the proposed method directly applies to modern CNN architectures, introduces minimum ove"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.06519","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":"1708.06519","created_at":"2026-05-18T00:37:39.245935+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.06519v1","created_at":"2026-05-18T00:37:39.245935+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.06519","created_at":"2026-05-18T00:37:39.245935+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWGZEHYT6AS7","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWGZEHYT6AS7CI4O","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWGZEHYT","created_at":"2026-05-18T12:31:12.930513+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/DWGZEHYT6AS7CI4OQJHACTOGQ6","json":"https://pith.science/pith/DWGZEHYT6AS7CI4OQJHACTOGQ6.json","graph_json":"https://pith.science/api/pith-number/DWGZEHYT6AS7CI4OQJHACTOGQ6/graph.json","events_json":"https://pith.science/api/pith-number/DWGZEHYT6AS7CI4OQJHACTOGQ6/events.json","paper":"https://pith.science/paper/DWGZEHYT"},"agent_actions":{"view_html":"https://pith.science/pith/DWGZEHYT6AS7CI4OQJHACTOGQ6","download_json":"https://pith.science/pith/DWGZEHYT6AS7CI4OQJHACTOGQ6.json","view_paper":"https://pith.science/paper/DWGZEHYT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.06519&json=true","fetch_graph":"https://pith.science/api/pith-number/DWGZEHYT6AS7CI4OQJHACTOGQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/DWGZEHYT6AS7CI4OQJHACTOGQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWGZEHYT6AS7CI4OQJHACTOGQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWGZEHYT6AS7CI4OQJHACTOGQ6/action/storage_attestation","attest_author":"https://pith.science/pith/DWGZEHYT6AS7CI4OQJHACTOGQ6/action/author_attestation","sign_citation":"https://pith.science/pith/DWGZEHYT6AS7CI4OQJHACTOGQ6/action/citation_signature","submit_replication":"https://pith.science/pith/DWGZEHYT6AS7CI4OQJHACTOGQ6/action/replication_record"}},"created_at":"2026-05-18T00:37:39.245935+00:00","updated_at":"2026-05-18T00:37:39.245935+00:00"}