{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:BKSZXQG4LBZIS6UUKN2T3O2SHG","short_pith_number":"pith:BKSZXQG4","schema_version":"1.0","canonical_sha256":"0aa59bc0dc5872897a9453753dbb5239b82bee42553e03ac7a5319742bf53199","source":{"kind":"arxiv","id":"1707.06342","version":1},"attestation_state":"computed","paper":{"title":"ThiNet: A Filter Level Pruning Method for Deep Neural Network Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jian-Hao Luo, Jianxin Wu, Weiyao Lin","submitted_at":"2017-07-20T02:16:16Z","abstract_excerpt":"We propose an efficient and unified framework, namely ThiNet, to simultaneously accelerate and compress CNN models in both training and inference stages. We focus on the filter level pruning, i.e., the whole filter would be discarded if it is less important. Our method does not change the original network structure, thus it can be perfectly supported by any off-the-shelf deep learning libraries. We formally establish filter pruning as an optimization problem, and reveal that we need to prune filters based on statistics information computed from its next layer, not the current layer, which diff"},"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":"1707.06342","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2017-07-20T02:16:16Z","cross_cats_sorted":[],"title_canon_sha256":"d49c813dcc80f6f5e424e8c7d8aecd25a97e82497f890f48587232d4357def0e","abstract_canon_sha256":"da3ad1a982c85310d22dd4518931ed6d0f6683788719a976331d7b9cc4f4e0c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:54.095889Z","signature_b64":"hM/pPB/PDGgt+OTo9tu0Ucv1Z2A2SoaKo8wQj8M9DKSo1YAcpi0ovSAHan03DaCDlHMuR2elefQd8IWDD/FwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0aa59bc0dc5872897a9453753dbb5239b82bee42553e03ac7a5319742bf53199","last_reissued_at":"2026-05-18T00:39:54.095220Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:54.095220Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ThiNet: A Filter Level Pruning Method for Deep Neural Network Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jian-Hao Luo, Jianxin Wu, Weiyao Lin","submitted_at":"2017-07-20T02:16:16Z","abstract_excerpt":"We propose an efficient and unified framework, namely ThiNet, to simultaneously accelerate and compress CNN models in both training and inference stages. We focus on the filter level pruning, i.e., the whole filter would be discarded if it is less important. Our method does not change the original network structure, thus it can be perfectly supported by any off-the-shelf deep learning libraries. We formally establish filter pruning as an optimization problem, and reveal that we need to prune filters based on statistics information computed from its next layer, not the current layer, which diff"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.06342","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":"1707.06342","created_at":"2026-05-18T00:39:54.095312+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.06342v1","created_at":"2026-05-18T00:39:54.095312+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.06342","created_at":"2026-05-18T00:39:54.095312+00:00"},{"alias_kind":"pith_short_12","alias_value":"BKSZXQG4LBZI","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"BKSZXQG4LBZIS6UU","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"BKSZXQG4","created_at":"2026-05-18T12:31:08.081275+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2510.09696","citing_title":"Vanishing Contributions: A Unified Framework for Smooth and Iterative Model Compression","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BKSZXQG4LBZIS6UUKN2T3O2SHG","json":"https://pith.science/pith/BKSZXQG4LBZIS6UUKN2T3O2SHG.json","graph_json":"https://pith.science/api/pith-number/BKSZXQG4LBZIS6UUKN2T3O2SHG/graph.json","events_json":"https://pith.science/api/pith-number/BKSZXQG4LBZIS6UUKN2T3O2SHG/events.json","paper":"https://pith.science/paper/BKSZXQG4"},"agent_actions":{"view_html":"https://pith.science/pith/BKSZXQG4LBZIS6UUKN2T3O2SHG","download_json":"https://pith.science/pith/BKSZXQG4LBZIS6UUKN2T3O2SHG.json","view_paper":"https://pith.science/paper/BKSZXQG4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.06342&json=true","fetch_graph":"https://pith.science/api/pith-number/BKSZXQG4LBZIS6UUKN2T3O2SHG/graph.json","fetch_events":"https://pith.science/api/pith-number/BKSZXQG4LBZIS6UUKN2T3O2SHG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BKSZXQG4LBZIS6UUKN2T3O2SHG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BKSZXQG4LBZIS6UUKN2T3O2SHG/action/storage_attestation","attest_author":"https://pith.science/pith/BKSZXQG4LBZIS6UUKN2T3O2SHG/action/author_attestation","sign_citation":"https://pith.science/pith/BKSZXQG4LBZIS6UUKN2T3O2SHG/action/citation_signature","submit_replication":"https://pith.science/pith/BKSZXQG4LBZIS6UUKN2T3O2SHG/action/replication_record"}},"created_at":"2026-05-18T00:39:54.095312+00:00","updated_at":"2026-05-18T00:39:54.095312+00:00"}