{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:JZZRLW3GCLLMZBYLQ3OQPOFHLN","short_pith_number":"pith:JZZRLW3G","schema_version":"1.0","canonical_sha256":"4e7315db6612d6cc870b86dd07b8a75b47915913c99d281073447d4883ac4c47","source":{"kind":"arxiv","id":"2108.00708","version":1},"attestation_state":"computed","paper":{"title":"Group Fisher Pruning for Practical Network Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Aojun Zhou, Jing-Hao Xue, Liyang Liu, Qingmin Liao, Shilong Zhang, Wayne Zhang, Wenming Yang, Xinjiang Wang, Yimin Chen, Zhanghui Kuang","submitted_at":"2021-08-02T08:21:44Z","abstract_excerpt":"Network compression has been widely studied since it is able to reduce the memory and computation cost during inference. However, previous methods seldom deal with complicated structures like residual connections, group/depth-wise convolution and feature pyramid network, where channels of multiple layers are coupled and need to be pruned simultaneously. In this paper, we present a general channel pruning approach that can be applied to various complicated structures. Particularly, we propose a layer grouping algorithm to find coupled channels automatically. Then we derive a unified metric base"},"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":"2108.00708","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-08-02T08:21:44Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3e55294278b89b30838630f2e7c81b7ea299003cfa32fba863418caab301dbf4","abstract_canon_sha256":"5d8fef4b093891c27fec14b286609d8382f87bee06963aa6626b4fcd66e5f5eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:02:26.148686Z","signature_b64":"eSDIqjFyY/Ur8VyA8O9Tys1aotDHB4yrSP76PziM4kOHpqVJnOIypf0z7ozU7HJv/1UvhaXEcAIt5yMOK8YWBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4e7315db6612d6cc870b86dd07b8a75b47915913c99d281073447d4883ac4c47","last_reissued_at":"2026-07-05T03:02:26.147944Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:02:26.147944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group Fisher Pruning for Practical Network Compression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Aojun Zhou, Jing-Hao Xue, Liyang Liu, Qingmin Liao, Shilong Zhang, Wayne Zhang, Wenming Yang, Xinjiang Wang, Yimin Chen, Zhanghui Kuang","submitted_at":"2021-08-02T08:21:44Z","abstract_excerpt":"Network compression has been widely studied since it is able to reduce the memory and computation cost during inference. However, previous methods seldom deal with complicated structures like residual connections, group/depth-wise convolution and feature pyramid network, where channels of multiple layers are coupled and need to be pruned simultaneously. In this paper, we present a general channel pruning approach that can be applied to various complicated structures. Particularly, we propose a layer grouping algorithm to find coupled channels automatically. Then we derive a unified metric base"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.00708","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.00708/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":"2108.00708","created_at":"2026-07-05T03:02:26.148002+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.00708v1","created_at":"2026-07-05T03:02:26.148002+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.00708","created_at":"2026-07-05T03:02:26.148002+00:00"},{"alias_kind":"pith_short_12","alias_value":"JZZRLW3GCLLM","created_at":"2026-07-05T03:02:26.148002+00:00"},{"alias_kind":"pith_short_16","alias_value":"JZZRLW3GCLLMZBYL","created_at":"2026-07-05T03:02:26.148002+00:00"},{"alias_kind":"pith_short_8","alias_value":"JZZRLW3G","created_at":"2026-07-05T03:02:26.148002+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2510.09696","citing_title":"Vanishing Contributions: A Unified Framework for Smooth and Iterative Model Compression","ref_index":26,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24380","citing_title":"Structural Pruning of Large Vision Language Models: A Comprehensive Study on Pruning Dynamics, Recovery, and Data Efficiency","ref_index":25,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JZZRLW3GCLLMZBYLQ3OQPOFHLN","json":"https://pith.science/pith/JZZRLW3GCLLMZBYLQ3OQPOFHLN.json","graph_json":"https://pith.science/api/pith-number/JZZRLW3GCLLMZBYLQ3OQPOFHLN/graph.json","events_json":"https://pith.science/api/pith-number/JZZRLW3GCLLMZBYLQ3OQPOFHLN/events.json","paper":"https://pith.science/paper/JZZRLW3G"},"agent_actions":{"view_html":"https://pith.science/pith/JZZRLW3GCLLMZBYLQ3OQPOFHLN","download_json":"https://pith.science/pith/JZZRLW3GCLLMZBYLQ3OQPOFHLN.json","view_paper":"https://pith.science/paper/JZZRLW3G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.00708&json=true","fetch_graph":"https://pith.science/api/pith-number/JZZRLW3GCLLMZBYLQ3OQPOFHLN/graph.json","fetch_events":"https://pith.science/api/pith-number/JZZRLW3GCLLMZBYLQ3OQPOFHLN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JZZRLW3GCLLMZBYLQ3OQPOFHLN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JZZRLW3GCLLMZBYLQ3OQPOFHLN/action/storage_attestation","attest_author":"https://pith.science/pith/JZZRLW3GCLLMZBYLQ3OQPOFHLN/action/author_attestation","sign_citation":"https://pith.science/pith/JZZRLW3GCLLMZBYLQ3OQPOFHLN/action/citation_signature","submit_replication":"https://pith.science/pith/JZZRLW3GCLLMZBYLQ3OQPOFHLN/action/replication_record"}},"created_at":"2026-07-05T03:02:26.148002+00:00","updated_at":"2026-07-05T03:02:26.148002+00:00"}