{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:2O6JIZGGZK2CKNPZ7POBZTJOFK","short_pith_number":"pith:2O6JIZGG","schema_version":"1.0","canonical_sha256":"d3bc9464c6cab42535f9fbdc1ccd2e2a81468bf47bd2d50ea0b6d2307fc6acb0","source":{"kind":"arxiv","id":"2308.06767","version":2},"attestation_state":"computed","paper":{"title":"A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Hongrong Cheng, Javen Qinfeng Shi, Miao Zhang","submitted_at":"2023-08-13T13:34:04Z","abstract_excerpt":"Modern deep neural networks, particularly recent large language models, come with massive model sizes that require significant computational and storage resources. To enable the deployment of modern models on resource-constrained environments and accelerate inference time, researchers have increasingly explored pruning techniques as a popular research direction in neural network compression. However, there is a dearth of up-to-date comprehensive review papers on pruning. To address this issue, in this survey, we provide a comprehensive review of existing research works on deep neural network p"},"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":"2308.06767","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-08-13T13:34:04Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"b6c1032fcd3c0b29fb1810db59c7442fb64b841c02b83858e60a755c196b98b5","abstract_canon_sha256":"297e8a26c9fed9c2b7be4c5d748df1e0217fe4d5beb60a3d74ec2ac38cd229c9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:53:37.461277Z","signature_b64":"VBgO5dg7t1Ys6prkCo5gnA21u5sWIus1i7ReVXf+YVcyBsnxUnPMGIvW/et0FZA9N5r/4EQkJrDeZn4ewRcoCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d3bc9464c6cab42535f9fbdc1ccd2e2a81468bf47bd2d50ea0b6d2307fc6acb0","last_reissued_at":"2026-07-05T08:53:37.460779Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:53:37.460779Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Hongrong Cheng, Javen Qinfeng Shi, Miao Zhang","submitted_at":"2023-08-13T13:34:04Z","abstract_excerpt":"Modern deep neural networks, particularly recent large language models, come with massive model sizes that require significant computational and storage resources. To enable the deployment of modern models on resource-constrained environments and accelerate inference time, researchers have increasingly explored pruning techniques as a popular research direction in neural network compression. However, there is a dearth of up-to-date comprehensive review papers on pruning. To address this issue, in this survey, we provide a comprehensive review of existing research works on deep neural network p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.06767","kind":"arxiv","version":2},"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/2308.06767/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":"2308.06767","created_at":"2026-07-05T08:53:37.460840+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.06767v2","created_at":"2026-07-05T08:53:37.460840+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.06767","created_at":"2026-07-05T08:53:37.460840+00:00"},{"alias_kind":"pith_short_12","alias_value":"2O6JIZGGZK2C","created_at":"2026-07-05T08:53:37.460840+00:00"},{"alias_kind":"pith_short_16","alias_value":"2O6JIZGGZK2CKNPZ","created_at":"2026-07-05T08:53:37.460840+00:00"},{"alias_kind":"pith_short_8","alias_value":"2O6JIZGG","created_at":"2026-07-05T08:53:37.460840+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"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":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2O6JIZGGZK2CKNPZ7POBZTJOFK","json":"https://pith.science/pith/2O6JIZGGZK2CKNPZ7POBZTJOFK.json","graph_json":"https://pith.science/api/pith-number/2O6JIZGGZK2CKNPZ7POBZTJOFK/graph.json","events_json":"https://pith.science/api/pith-number/2O6JIZGGZK2CKNPZ7POBZTJOFK/events.json","paper":"https://pith.science/paper/2O6JIZGG"},"agent_actions":{"view_html":"https://pith.science/pith/2O6JIZGGZK2CKNPZ7POBZTJOFK","download_json":"https://pith.science/pith/2O6JIZGGZK2CKNPZ7POBZTJOFK.json","view_paper":"https://pith.science/paper/2O6JIZGG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.06767&json=true","fetch_graph":"https://pith.science/api/pith-number/2O6JIZGGZK2CKNPZ7POBZTJOFK/graph.json","fetch_events":"https://pith.science/api/pith-number/2O6JIZGGZK2CKNPZ7POBZTJOFK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2O6JIZGGZK2CKNPZ7POBZTJOFK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2O6JIZGGZK2CKNPZ7POBZTJOFK/action/storage_attestation","attest_author":"https://pith.science/pith/2O6JIZGGZK2CKNPZ7POBZTJOFK/action/author_attestation","sign_citation":"https://pith.science/pith/2O6JIZGGZK2CKNPZ7POBZTJOFK/action/citation_signature","submit_replication":"https://pith.science/pith/2O6JIZGGZK2CKNPZ7POBZTJOFK/action/replication_record"}},"created_at":"2026-07-05T08:53:37.460840+00:00","updated_at":"2026-07-05T08:53:37.460840+00:00"}