{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CDWBTEI2XEX2OVK22RJVE3I5C3","short_pith_number":"pith:CDWBTEI2","schema_version":"1.0","canonical_sha256":"10ec19911ab92fa7555ad453526d1d16d96c427cc065888a6c623999ee7cbb2c","source":{"kind":"arxiv","id":"1608.08710","version":3},"attestation_state":"computed","paper":{"title":"Pruning Filters for Efficient ConvNets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Asim Kadav, Hanan Samet, Hans Peter Graf, Hao Li, Igor Durdanovic","submitted_at":"2016-08-31T02:29:59Z","abstract_excerpt":"The success of CNNs in various applications is accompanied by a significant increase in the computation and parameter storage costs. Recent efforts toward reducing these overheads involve pruning and compressing the weights of various layers without hurting original accuracy. However, magnitude-based pruning of weights reduces a significant number of parameters from the fully connected layers and may not adequately reduce the computation costs in the convolutional layers due to irregular sparsity in the pruned networks. We present an acceleration method for CNNs, where we prune filters from CN"},"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":"1608.08710","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-31T02:29:59Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"24bd38f50bba5e2393015ca664cb79efde68ee7677436d11fcf2a378c1d32e08","abstract_canon_sha256":"fc5cb7eb36180c4a54eee057952d573bb323ae301c50d804af5d826b336bcc6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:59.914803Z","signature_b64":"zCPiAqAOZf8EdN0M6qNuRUCF6SoXFvSybvFILog57ZIh1jc0HD3U4hGkJhQwSxAtd4x7xgNmH/jv51o81NZJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10ec19911ab92fa7555ad453526d1d16d96c427cc065888a6c623999ee7cbb2c","last_reissued_at":"2026-05-18T00:48:59.914052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:59.914052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pruning Filters for Efficient ConvNets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Asim Kadav, Hanan Samet, Hans Peter Graf, Hao Li, Igor Durdanovic","submitted_at":"2016-08-31T02:29:59Z","abstract_excerpt":"The success of CNNs in various applications is accompanied by a significant increase in the computation and parameter storage costs. Recent efforts toward reducing these overheads involve pruning and compressing the weights of various layers without hurting original accuracy. However, magnitude-based pruning of weights reduces a significant number of parameters from the fully connected layers and may not adequately reduce the computation costs in the convolutional layers due to irregular sparsity in the pruned networks. We present an acceleration method for CNNs, where we prune filters from CN"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.08710","kind":"arxiv","version":3},"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":"1608.08710","created_at":"2026-05-18T00:48:59.914172+00:00"},{"alias_kind":"arxiv_version","alias_value":"1608.08710v3","created_at":"2026-05-18T00:48:59.914172+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.08710","created_at":"2026-05-18T00:48:59.914172+00:00"},{"alias_kind":"pith_short_12","alias_value":"CDWBTEI2XEX2","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CDWBTEI2XEX2OVK2","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CDWBTEI2","created_at":"2026-05-18T12:30:09.641336+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":15,"internal_anchor_count":11,"sample":[{"citing_arxiv_id":"1906.10337","citing_title":"COP: Customized Deep Model Compression via Regularized Correlation-Based Filter-Level Pruning","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"1907.00274","citing_title":"NetTailor: Tuning the Architecture, Not Just the Weights","ref_index":31,"is_internal_anchor":true},{"citing_arxiv_id":"1907.02519","citing_title":"Neuron ranking -- an informed way to condense convolutional neural networks architecture","ref_index":10,"is_internal_anchor":true},{"citing_arxiv_id":"1907.05271","citing_title":"A Targeted Acceleration and Compression Framework for Low bit Neural Networks","ref_index":11,"is_internal_anchor":true},{"citing_arxiv_id":"1907.11804","citing_title":"Memory- and Communication-Aware Model Compression for Distributed Deep Learning Inference on IoT","ref_index":13,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14738","citing_title":"TAPIOCA: Why Task- Aware Pruning Improves OOD model Capability","ref_index":65,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18540","citing_title":"Discovering Data Encoding Strategies for Quantum-Classical Neural Networks Using Monte Carlo Tree Search","ref_index":41,"is_internal_anchor":true},{"citing_arxiv_id":"2505.17469","citing_title":"Efficient compression of neural networks and datasets","ref_index":39,"is_internal_anchor":true},{"citing_arxiv_id":"2510.09696","citing_title":"Vanishing Contributions: A Unified Framework for Smooth and Iterative Model Compression","ref_index":24,"is_internal_anchor":true},{"citing_arxiv_id":"2511.18772","citing_title":"Re-Key-Free, Risky-Free: Adaptable Model Usage Control","ref_index":19,"is_internal_anchor":true},{"citing_arxiv_id":"2605.14075","citing_title":"Rethinking Layer Relevance in Large Language Models Beyond Cosine Similarity","ref_index":32,"is_internal_anchor":true},{"citing_arxiv_id":"2605.06402","citing_title":"SparseForge: Efficient Semi-Structured LLM Sparsification via Annealing of Hessian-Guided Soft-Mask","ref_index":21,"is_internal_anchor":false},{"citing_arxiv_id":"2604.09988","citing_title":"Engineering Resource-constrained Software Systems with DNN Components: a Concept-based Pruning Approach","ref_index":60,"is_internal_anchor":false},{"citing_arxiv_id":"2604.08971","citing_title":"Modality-Aware Zero-Shot Pruning and Sparse Attention for Efficient Multimodal Edge Inference","ref_index":13,"is_internal_anchor":false},{"citing_arxiv_id":"2604.05856","citing_title":"Neural Network Pruning via QUBO Optimization","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CDWBTEI2XEX2OVK22RJVE3I5C3","json":"https://pith.science/pith/CDWBTEI2XEX2OVK22RJVE3I5C3.json","graph_json":"https://pith.science/api/pith-number/CDWBTEI2XEX2OVK22RJVE3I5C3/graph.json","events_json":"https://pith.science/api/pith-number/CDWBTEI2XEX2OVK22RJVE3I5C3/events.json","paper":"https://pith.science/paper/CDWBTEI2"},"agent_actions":{"view_html":"https://pith.science/pith/CDWBTEI2XEX2OVK22RJVE3I5C3","download_json":"https://pith.science/pith/CDWBTEI2XEX2OVK22RJVE3I5C3.json","view_paper":"https://pith.science/paper/CDWBTEI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1608.08710&json=true","fetch_graph":"https://pith.science/api/pith-number/CDWBTEI2XEX2OVK22RJVE3I5C3/graph.json","fetch_events":"https://pith.science/api/pith-number/CDWBTEI2XEX2OVK22RJVE3I5C3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CDWBTEI2XEX2OVK22RJVE3I5C3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CDWBTEI2XEX2OVK22RJVE3I5C3/action/storage_attestation","attest_author":"https://pith.science/pith/CDWBTEI2XEX2OVK22RJVE3I5C3/action/author_attestation","sign_citation":"https://pith.science/pith/CDWBTEI2XEX2OVK22RJVE3I5C3/action/citation_signature","submit_replication":"https://pith.science/pith/CDWBTEI2XEX2OVK22RJVE3I5C3/action/replication_record"}},"created_at":"2026-05-18T00:48:59.914172+00:00","updated_at":"2026-05-18T00:48:59.914172+00:00"}