{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6FOHPYF2ZB7HCLHGFEK5XD3FCS","short_pith_number":"pith:6FOHPYF2","schema_version":"1.0","canonical_sha256":"f15c77e0bac87e712ce62915db8f6514aedec65eb82eddb78fc3cb497f2a2781","source":{"kind":"arxiv","id":"1909.05073","version":4},"attestation_state":"computed","paper":{"title":"PCONV: The Missing but Desirable Sparsity in DNN Weight Pruning for Real-time Execution on Mobile Devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DC","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bin Ren, Fu-Ming Guo, Jian Tang, Kaisheng Ma, Wei Niu, Xiaolong Ma, Xue Lin, Yanzhi Wang","submitted_at":"2019-09-06T03:58:29Z","abstract_excerpt":"Model compression techniques on Deep Neural Network (DNN) have been widely acknowledged as an effective way to achieve acceleration on a variety of platforms, and DNN weight pruning is a straightforward and effective method. There are currently two mainstreams of pruning methods representing two extremes of pruning regularity: non-structured, fine-grained pruning can achieve high sparsity and accuracy, but is not hardware friendly; structured, coarse-grained pruning exploits hardware-efficient structures in pruning, but suffers from accuracy drop when the pruning rate is high. In this paper, w"},"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":"1909.05073","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-06T03:58:29Z","cross_cats_sorted":["cs.CV","cs.DC","cs.NE","stat.ML"],"title_canon_sha256":"3c13c35a048a2455d7c919c208c20716718fb4ea8c2ab0433c603a44f0363bb0","abstract_canon_sha256":"c68f7897cf90f212827536f0c28ca6002c21e049f3b02c1b9908aaaf8d410c3a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:45:52.260915Z","signature_b64":"i2sE0EkkTBIFfBowKSuBbbXTGDylGou72asPgSmzqOk5/IIhqvvituTp58tJX6SgxdqsHUyYZrAXOZy6rintAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f15c77e0bac87e712ce62915db8f6514aedec65eb82eddb78fc3cb497f2a2781","last_reissued_at":"2026-07-05T00:45:52.260438Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:45:52.260438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PCONV: The Missing but Desirable Sparsity in DNN Weight Pruning for Real-time Execution on Mobile Devices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.DC","cs.NE","stat.ML"],"primary_cat":"cs.LG","authors_text":"Bin Ren, Fu-Ming Guo, Jian Tang, Kaisheng Ma, Wei Niu, Xiaolong Ma, Xue Lin, Yanzhi Wang","submitted_at":"2019-09-06T03:58:29Z","abstract_excerpt":"Model compression techniques on Deep Neural Network (DNN) have been widely acknowledged as an effective way to achieve acceleration on a variety of platforms, and DNN weight pruning is a straightforward and effective method. There are currently two mainstreams of pruning methods representing two extremes of pruning regularity: non-structured, fine-grained pruning can achieve high sparsity and accuracy, but is not hardware friendly; structured, coarse-grained pruning exploits hardware-efficient structures in pruning, but suffers from accuracy drop when the pruning rate is high. In this paper, w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.05073","kind":"arxiv","version":4},"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/1909.05073/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":"1909.05073","created_at":"2026-07-05T00:45:52.260497+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.05073v4","created_at":"2026-07-05T00:45:52.260497+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.05073","created_at":"2026-07-05T00:45:52.260497+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FOHPYF2ZB7H","created_at":"2026-07-05T00:45:52.260497+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FOHPYF2ZB7HCLHG","created_at":"2026-07-05T00:45:52.260497+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FOHPYF2","created_at":"2026-07-05T00:45:52.260497+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"1910.09876","citing_title":"Neural Network Training with Approximate Logarithmic Computations","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6FOHPYF2ZB7HCLHGFEK5XD3FCS","json":"https://pith.science/pith/6FOHPYF2ZB7HCLHGFEK5XD3FCS.json","graph_json":"https://pith.science/api/pith-number/6FOHPYF2ZB7HCLHGFEK5XD3FCS/graph.json","events_json":"https://pith.science/api/pith-number/6FOHPYF2ZB7HCLHGFEK5XD3FCS/events.json","paper":"https://pith.science/paper/6FOHPYF2"},"agent_actions":{"view_html":"https://pith.science/pith/6FOHPYF2ZB7HCLHGFEK5XD3FCS","download_json":"https://pith.science/pith/6FOHPYF2ZB7HCLHGFEK5XD3FCS.json","view_paper":"https://pith.science/paper/6FOHPYF2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.05073&json=true","fetch_graph":"https://pith.science/api/pith-number/6FOHPYF2ZB7HCLHGFEK5XD3FCS/graph.json","fetch_events":"https://pith.science/api/pith-number/6FOHPYF2ZB7HCLHGFEK5XD3FCS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FOHPYF2ZB7HCLHGFEK5XD3FCS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FOHPYF2ZB7HCLHGFEK5XD3FCS/action/storage_attestation","attest_author":"https://pith.science/pith/6FOHPYF2ZB7HCLHGFEK5XD3FCS/action/author_attestation","sign_citation":"https://pith.science/pith/6FOHPYF2ZB7HCLHGFEK5XD3FCS/action/citation_signature","submit_replication":"https://pith.science/pith/6FOHPYF2ZB7HCLHGFEK5XD3FCS/action/replication_record"}},"created_at":"2026-07-05T00:45:52.260497+00:00","updated_at":"2026-07-05T00:45:52.260497+00:00"}