{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:2ZDSV2G52IYRDTG7AV5HMCK7SU","short_pith_number":"pith:2ZDSV2G5","schema_version":"1.0","canonical_sha256":"d6472ae8ddd23111ccdf057a76095f950ba5d8fd91fa9ea927568ce5ec7dafad","source":{"kind":"arxiv","id":"1805.08941","version":3},"attestation_state":"computed","paper":{"title":"AutoPruner: An End-to-End Trainable Filter Pruning Method for Efficient Deep Model Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jian-Hao Luo, Jianxin Wu","submitted_at":"2018-05-23T03:05:48Z","abstract_excerpt":"Channel pruning is an important family of methods to speed up deep model's inference. Previous filter pruning algorithms regard channel pruning and model fine-tuning as two independent steps. This paper argues that combining them into a single end-to-end trainable system will lead to better results. We propose an efficient channel selection layer, namely AutoPruner, to find less important filters automatically in a joint training manner. Our AutoPruner takes previous activation responses as an input and generates a true binary index code for pruning. Hence, all the filters corresponding to zer"},"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":"1805.08941","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-05-23T03:05:48Z","cross_cats_sorted":[],"title_canon_sha256":"6f58ae497413f4fc9068079c5abddcdd666ed6d8d972f9e7cab1e700c59ddfcd","abstract_canon_sha256":"24df164446bac2eee0b80220954a8e443fb3b81cb03fbcd6429a07277db26db8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:10.027192Z","signature_b64":"AzZP1nvxDrZEuA78mhqSP088aP07qX6rZE2yWE1pAxpcsn1Ddb7BNSlNUl2m6JXfAvKx6GUvkft9Zaba7CsFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d6472ae8ddd23111ccdf057a76095f950ba5d8fd91fa9ea927568ce5ec7dafad","last_reissued_at":"2026-05-17T23:56:10.026527Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:10.026527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AutoPruner: An End-to-End Trainable Filter Pruning Method for Efficient Deep Model Inference","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Jian-Hao Luo, Jianxin Wu","submitted_at":"2018-05-23T03:05:48Z","abstract_excerpt":"Channel pruning is an important family of methods to speed up deep model's inference. Previous filter pruning algorithms regard channel pruning and model fine-tuning as two independent steps. This paper argues that combining them into a single end-to-end trainable system will lead to better results. We propose an efficient channel selection layer, namely AutoPruner, to find less important filters automatically in a joint training manner. Our AutoPruner takes previous activation responses as an input and generates a true binary index code for pruning. Hence, all the filters corresponding to zer"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.08941","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":"1805.08941","created_at":"2026-05-17T23:56:10.026621+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.08941v3","created_at":"2026-05-17T23:56:10.026621+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.08941","created_at":"2026-05-17T23:56:10.026621+00:00"},{"alias_kind":"pith_short_12","alias_value":"2ZDSV2G52IYR","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_16","alias_value":"2ZDSV2G52IYRDTG7","created_at":"2026-05-18T12:32:02.567920+00:00"},{"alias_kind":"pith_short_8","alias_value":"2ZDSV2G5","created_at":"2026-05-18T12:32:02.567920+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.07189","citing_title":"Exploring Vision Neural Network Pruning via Screening Methodology","ref_index":35,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2ZDSV2G52IYRDTG7AV5HMCK7SU","json":"https://pith.science/pith/2ZDSV2G52IYRDTG7AV5HMCK7SU.json","graph_json":"https://pith.science/api/pith-number/2ZDSV2G52IYRDTG7AV5HMCK7SU/graph.json","events_json":"https://pith.science/api/pith-number/2ZDSV2G52IYRDTG7AV5HMCK7SU/events.json","paper":"https://pith.science/paper/2ZDSV2G5"},"agent_actions":{"view_html":"https://pith.science/pith/2ZDSV2G52IYRDTG7AV5HMCK7SU","download_json":"https://pith.science/pith/2ZDSV2G52IYRDTG7AV5HMCK7SU.json","view_paper":"https://pith.science/paper/2ZDSV2G5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.08941&json=true","fetch_graph":"https://pith.science/api/pith-number/2ZDSV2G52IYRDTG7AV5HMCK7SU/graph.json","fetch_events":"https://pith.science/api/pith-number/2ZDSV2G52IYRDTG7AV5HMCK7SU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2ZDSV2G52IYRDTG7AV5HMCK7SU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2ZDSV2G52IYRDTG7AV5HMCK7SU/action/storage_attestation","attest_author":"https://pith.science/pith/2ZDSV2G52IYRDTG7AV5HMCK7SU/action/author_attestation","sign_citation":"https://pith.science/pith/2ZDSV2G52IYRDTG7AV5HMCK7SU/action/citation_signature","submit_replication":"https://pith.science/pith/2ZDSV2G52IYRDTG7AV5HMCK7SU/action/replication_record"}},"created_at":"2026-05-17T23:56:10.026621+00:00","updated_at":"2026-05-17T23:56:10.026621+00:00"}