{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:RCSE3YGJJUT2ZQWLXSCF4MBTFD","short_pith_number":"pith:RCSE3YGJ","schema_version":"1.0","canonical_sha256":"88a44de0c94d27acc2cbbc845e303328de45912f067b5023af9993371e14b7a8","source":{"kind":"arxiv","id":"1912.10178","version":1},"attestation_state":"computed","paper":{"title":"DBP: Discrimination Based Block-Level Pruning for Deep Model Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Deng Cai, Haifeng Liu, Jinming Hu, Minghao Chen, Shuai Zhao, Wenxiao Wang","submitted_at":"2019-12-21T02:11:47Z","abstract_excerpt":"Neural network pruning is one of the most popular methods of accelerating the inference of deep convolutional neural networks (CNNs). The dominant pruning methods, filter-level pruning methods, evaluate their performance through the reduction ratio of computations and deem that a higher reduction ratio of computations is equivalent to a higher acceleration ratio in terms of inference time. However, we argue that they are not equivalent if parallel computing is considered. Given that filter-level pruning only prunes filters in layers and computations in a layer usually run in parallel, most com"},"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":"1912.10178","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-12-21T02:11:47Z","cross_cats_sorted":[],"title_canon_sha256":"aa6adf0491bca40d12324e58488a07ee2f54f3c84d2347016e07ecccaf3e211b","abstract_canon_sha256":"6035abbeefa706edafde63f4470908e7237364436fbc85e8b47e442b6c1dd82d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:27:47.793483Z","signature_b64":"YDxLT/C0dSrL0B93j3jiVMKEnwsoF/kDccoVqRImX+YRVeLJE15sD90sjuyrI+hh04S1VdJr4+g8X7noc/NbCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88a44de0c94d27acc2cbbc845e303328de45912f067b5023af9993371e14b7a8","last_reissued_at":"2026-07-05T00:27:47.793061Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:27:47.793061Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"DBP: Discrimination Based Block-Level Pruning for Deep Model Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Deng Cai, Haifeng Liu, Jinming Hu, Minghao Chen, Shuai Zhao, Wenxiao Wang","submitted_at":"2019-12-21T02:11:47Z","abstract_excerpt":"Neural network pruning is one of the most popular methods of accelerating the inference of deep convolutional neural networks (CNNs). The dominant pruning methods, filter-level pruning methods, evaluate their performance through the reduction ratio of computations and deem that a higher reduction ratio of computations is equivalent to a higher acceleration ratio in terms of inference time. However, we argue that they are not equivalent if parallel computing is considered. Given that filter-level pruning only prunes filters in layers and computations in a layer usually run in parallel, most com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.10178","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/1912.10178/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":"1912.10178","created_at":"2026-07-05T00:27:47.793117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.10178v1","created_at":"2026-07-05T00:27:47.793117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.10178","created_at":"2026-07-05T00:27:47.793117+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCSE3YGJJUT2","created_at":"2026-07-05T00:27:47.793117+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCSE3YGJJUT2ZQWL","created_at":"2026-07-05T00:27:47.793117+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCSE3YGJ","created_at":"2026-07-05T00:27:47.793117+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.06982","citing_title":"EdgeCompress: Coupling Multidimensional Model Compression and Dynamic Inference for EdgeAI","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RCSE3YGJJUT2ZQWLXSCF4MBTFD","json":"https://pith.science/pith/RCSE3YGJJUT2ZQWLXSCF4MBTFD.json","graph_json":"https://pith.science/api/pith-number/RCSE3YGJJUT2ZQWLXSCF4MBTFD/graph.json","events_json":"https://pith.science/api/pith-number/RCSE3YGJJUT2ZQWLXSCF4MBTFD/events.json","paper":"https://pith.science/paper/RCSE3YGJ"},"agent_actions":{"view_html":"https://pith.science/pith/RCSE3YGJJUT2ZQWLXSCF4MBTFD","download_json":"https://pith.science/pith/RCSE3YGJJUT2ZQWLXSCF4MBTFD.json","view_paper":"https://pith.science/paper/RCSE3YGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.10178&json=true","fetch_graph":"https://pith.science/api/pith-number/RCSE3YGJJUT2ZQWLXSCF4MBTFD/graph.json","fetch_events":"https://pith.science/api/pith-number/RCSE3YGJJUT2ZQWLXSCF4MBTFD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCSE3YGJJUT2ZQWLXSCF4MBTFD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCSE3YGJJUT2ZQWLXSCF4MBTFD/action/storage_attestation","attest_author":"https://pith.science/pith/RCSE3YGJJUT2ZQWLXSCF4MBTFD/action/author_attestation","sign_citation":"https://pith.science/pith/RCSE3YGJJUT2ZQWLXSCF4MBTFD/action/citation_signature","submit_replication":"https://pith.science/pith/RCSE3YGJJUT2ZQWLXSCF4MBTFD/action/replication_record"}},"created_at":"2026-07-05T00:27:47.793117+00:00","updated_at":"2026-07-05T00:27:47.793117+00:00"}