{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:4XDC7HSK6SOL5YVEHTYVSLWLGY","short_pith_number":"pith:4XDC7HSK","schema_version":"1.0","canonical_sha256":"e5c62f9e4af49cbee2a43cf1592ecb3625cc8dc8c34f436cb2f3be0b7946e5a9","source":{"kind":"arxiv","id":"2009.14410","version":3},"attestation_state":"computed","paper":{"title":"Pruning Filter in Filter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fanxu Meng, Guangming Lu, Hao Cheng, Huixiang Luo, Ke Li, Xiaowei Guo, Xing Sun","submitted_at":"2020-09-30T03:35:16Z","abstract_excerpt":"Pruning has become a very powerful and effective technique to compress and accelerate modern neural networks. Existing pruning methods can be grouped into two categories: filter pruning (FP) and weight pruning (WP). FP wins at hardware compatibility but loses at the compression ratio compared with WP. To converge the strength of both methods, we propose to prune the filter in the filter. Specifically, we treat a filter $F \\in \\mathbb{R}^{C\\times K\\times K}$ as $K \\times K$ stripes, i.e., $1\\times 1$ filters $\\in \\mathbb{R}^{C}$, then by pruning the stripes instead of the whole filter, we can a"},"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":"2009.14410","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-09-30T03:35:16Z","cross_cats_sorted":[],"title_canon_sha256":"56b88379be5d7c8f49afe3523857d07037e48b697e3f057e2ef56d83f46e6264","abstract_canon_sha256":"9fd3f90ecd7865ac124e4787b085754491ce73b5e5542eb0ad8d8b23add1857e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:58:11.880020Z","signature_b64":"Lhb/gK0oi1MgwDcIf/c2S8Oz8FjafrKfNS19hjrTQYF1KYTh1/3PR6/HzfCluX2UtkUks0oTzU2y9GPCrT/tAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5c62f9e4af49cbee2a43cf1592ecb3625cc8dc8c34f436cb2f3be0b7946e5a9","last_reissued_at":"2026-07-05T01:58:11.879631Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:58:11.879631Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pruning Filter in Filter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Fanxu Meng, Guangming Lu, Hao Cheng, Huixiang Luo, Ke Li, Xiaowei Guo, Xing Sun","submitted_at":"2020-09-30T03:35:16Z","abstract_excerpt":"Pruning has become a very powerful and effective technique to compress and accelerate modern neural networks. Existing pruning methods can be grouped into two categories: filter pruning (FP) and weight pruning (WP). FP wins at hardware compatibility but loses at the compression ratio compared with WP. To converge the strength of both methods, we propose to prune the filter in the filter. Specifically, we treat a filter $F \\in \\mathbb{R}^{C\\times K\\times K}$ as $K \\times K$ stripes, i.e., $1\\times 1$ filters $\\in \\mathbb{R}^{C}$, then by pruning the stripes instead of the whole filter, we can a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.14410","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.14410/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2009.14410","created_at":"2026-07-05T01:58:11.879691+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.14410v3","created_at":"2026-07-05T01:58:11.879691+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.14410","created_at":"2026-07-05T01:58:11.879691+00:00"},{"alias_kind":"pith_short_12","alias_value":"4XDC7HSK6SOL","created_at":"2026-07-05T01:58:11.879691+00:00"},{"alias_kind":"pith_short_16","alias_value":"4XDC7HSK6SOL5YVE","created_at":"2026-07-05T01:58:11.879691+00:00"},{"alias_kind":"pith_short_8","alias_value":"4XDC7HSK","created_at":"2026-07-05T01:58:11.879691+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/4XDC7HSK6SOL5YVEHTYVSLWLGY","json":"https://pith.science/pith/4XDC7HSK6SOL5YVEHTYVSLWLGY.json","graph_json":"https://pith.science/api/pith-number/4XDC7HSK6SOL5YVEHTYVSLWLGY/graph.json","events_json":"https://pith.science/api/pith-number/4XDC7HSK6SOL5YVEHTYVSLWLGY/events.json","paper":"https://pith.science/paper/4XDC7HSK"},"agent_actions":{"view_html":"https://pith.science/pith/4XDC7HSK6SOL5YVEHTYVSLWLGY","download_json":"https://pith.science/pith/4XDC7HSK6SOL5YVEHTYVSLWLGY.json","view_paper":"https://pith.science/paper/4XDC7HSK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.14410&json=true","fetch_graph":"https://pith.science/api/pith-number/4XDC7HSK6SOL5YVEHTYVSLWLGY/graph.json","fetch_events":"https://pith.science/api/pith-number/4XDC7HSK6SOL5YVEHTYVSLWLGY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4XDC7HSK6SOL5YVEHTYVSLWLGY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4XDC7HSK6SOL5YVEHTYVSLWLGY/action/storage_attestation","attest_author":"https://pith.science/pith/4XDC7HSK6SOL5YVEHTYVSLWLGY/action/author_attestation","sign_citation":"https://pith.science/pith/4XDC7HSK6SOL5YVEHTYVSLWLGY/action/citation_signature","submit_replication":"https://pith.science/pith/4XDC7HSK6SOL5YVEHTYVSLWLGY/action/replication_record"}},"created_at":"2026-07-05T01:58:11.879691+00:00","updated_at":"2026-07-05T01:58:11.879691+00:00"}