{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZNDHJWPSZJCX5VUGRGCONYI355","short_pith_number":"pith:ZNDHJWPS","schema_version":"1.0","canonical_sha256":"cb4674d9f2ca457ed6868984e6e11bef7ff348748a77ff267e1f8c86d43a9fc2","source":{"kind":"arxiv","id":"1906.10771","version":1},"attestation_state":"computed","paper":{"title":"Importance Estimation for Neural Network Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Arun Mallya, Iuri Frosio, Jan Kautz, Pavlo Molchanov, Stephen Tyree","submitted_at":"2019-06-25T22:20:16Z","abstract_excerpt":"Structural pruning of neural network parameters reduces computation, energy, and memory transfer costs during inference. We propose a novel method that estimates the contribution of a neuron (filter) to the final loss and iteratively removes those with smaller scores. We describe two variations of our method using the first and second-order Taylor expansions to approximate a filter's contribution. Both methods scale consistently across any network layer without requiring per-layer sensitivity analysis and can be applied to any kind of layer, including skip connections. For modern networks trai"},"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":"1906.10771","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-25T22:20:16Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"b855b640123dc0d4cb08143074e1c043f0273945fefefe9a56653b4577fcbd10","abstract_canon_sha256":"bf2b7b1ba9deaba099daea8c38f10b0f9f1d2aa7264aa7889e90d98c2c73b91f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:14.826386Z","signature_b64":"uv8QqdU+7wK/YTutEDUTpKanud++JXJT3LnLaK/HxB7goDKWmwhaJCpernk2L2iuIILIYc2U3UmyrnkNa1HlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb4674d9f2ca457ed6868984e6e11bef7ff348748a77ff267e1f8c86d43a9fc2","last_reissued_at":"2026-05-17T23:42:14.825509Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:14.825509Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Importance Estimation for Neural Network Pruning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Arun Mallya, Iuri Frosio, Jan Kautz, Pavlo Molchanov, Stephen Tyree","submitted_at":"2019-06-25T22:20:16Z","abstract_excerpt":"Structural pruning of neural network parameters reduces computation, energy, and memory transfer costs during inference. We propose a novel method that estimates the contribution of a neuron (filter) to the final loss and iteratively removes those with smaller scores. We describe two variations of our method using the first and second-order Taylor expansions to approximate a filter's contribution. Both methods scale consistently across any network layer without requiring per-layer sensitivity analysis and can be applied to any kind of layer, including skip connections. For modern networks trai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10771","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":"1906.10771","created_at":"2026-05-17T23:42:14.825627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1906.10771v1","created_at":"2026-05-17T23:42:14.825627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10771","created_at":"2026-05-17T23:42:14.825627+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZNDHJWPSZJCX","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZNDHJWPSZJCX5VUG","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZNDHJWPS","created_at":"2026-05-18T12:33:33.725879+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2604.09595","citing_title":"Why Smaller Is Slower? Dimensional Misalignment in Compressed LLMs","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZNDHJWPSZJCX5VUGRGCONYI355","json":"https://pith.science/pith/ZNDHJWPSZJCX5VUGRGCONYI355.json","graph_json":"https://pith.science/api/pith-number/ZNDHJWPSZJCX5VUGRGCONYI355/graph.json","events_json":"https://pith.science/api/pith-number/ZNDHJWPSZJCX5VUGRGCONYI355/events.json","paper":"https://pith.science/paper/ZNDHJWPS"},"agent_actions":{"view_html":"https://pith.science/pith/ZNDHJWPSZJCX5VUGRGCONYI355","download_json":"https://pith.science/pith/ZNDHJWPSZJCX5VUGRGCONYI355.json","view_paper":"https://pith.science/paper/ZNDHJWPS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1906.10771&json=true","fetch_graph":"https://pith.science/api/pith-number/ZNDHJWPSZJCX5VUGRGCONYI355/graph.json","fetch_events":"https://pith.science/api/pith-number/ZNDHJWPSZJCX5VUGRGCONYI355/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZNDHJWPSZJCX5VUGRGCONYI355/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZNDHJWPSZJCX5VUGRGCONYI355/action/storage_attestation","attest_author":"https://pith.science/pith/ZNDHJWPSZJCX5VUGRGCONYI355/action/author_attestation","sign_citation":"https://pith.science/pith/ZNDHJWPSZJCX5VUGRGCONYI355/action/citation_signature","submit_replication":"https://pith.science/pith/ZNDHJWPSZJCX5VUGRGCONYI355/action/replication_record"}},"created_at":"2026-05-17T23:42:14.825627+00:00","updated_at":"2026-05-17T23:42:14.825627+00:00"}