{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SSFOQ4J5NP662ZD7FL5CYDLEFN","short_pith_number":"pith:SSFOQ4J5","schema_version":"1.0","canonical_sha256":"948ae8713d6bfded647f2afa2c0d642b5c24030c6600117b0dc4ec1fc674c3d8","source":{"kind":"arxiv","id":"1705.08922","version":3},"attestation_state":"computed","paper":{"title":"Exploring the Regularity of Sparse Structure in Convolutional Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Huizi Mao, Jeff Pool, Song Han, Wenshuo Li, William J. Dally, Xingyu Liu, Yu Wang","submitted_at":"2017-05-24T18:35:41Z","abstract_excerpt":"Sparsity helps reduce the computational complexity of deep neural networks by skipping zeros. Taking advantage of sparsity is listed as a high priority in next generation DNN accelerators such as TPU. The structure of sparsity, i.e., the granularity of pruning, affects the efficiency of hardware accelerator design as well as the prediction accuracy. Coarse-grained pruning creates regular sparsity patterns, making it more amenable for hardware acceleration but more challenging to maintain the same accuracy. In this paper we quantitatively measure the trade-off between sparsity regularity and pr"},"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":"1705.08922","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2017-05-24T18:35:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b8a046a9546590631eaaed613aceef5662a5e0d06ca8b61e269b2d5113a62a31","abstract_canon_sha256":"d3313e8bc16700fe470cf066304d43f2dd439a0b5127017a97f20e8385bb0289"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:08.140471Z","signature_b64":"a1vX6rBXZ0vyBBur2n4XIf4gJp0AalpuLhc1Nnw5E0GsWInLGLsoKwXoBe7RbTdXNrDKxbyRX7hNW7YHyj6uCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"948ae8713d6bfded647f2afa2c0d642b5c24030c6600117b0dc4ec1fc674c3d8","last_reissued_at":"2026-05-18T00:43:08.139679Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:08.139679Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring the Regularity of Sparse Structure in Convolutional Neural Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Huizi Mao, Jeff Pool, Song Han, Wenshuo Li, William J. Dally, Xingyu Liu, Yu Wang","submitted_at":"2017-05-24T18:35:41Z","abstract_excerpt":"Sparsity helps reduce the computational complexity of deep neural networks by skipping zeros. Taking advantage of sparsity is listed as a high priority in next generation DNN accelerators such as TPU. The structure of sparsity, i.e., the granularity of pruning, affects the efficiency of hardware accelerator design as well as the prediction accuracy. Coarse-grained pruning creates regular sparsity patterns, making it more amenable for hardware acceleration but more challenging to maintain the same accuracy. In this paper we quantitatively measure the trade-off between sparsity regularity and pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08922","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":"1705.08922","created_at":"2026-05-18T00:43:08.139810+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08922v3","created_at":"2026-05-18T00:43:08.139810+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08922","created_at":"2026-05-18T00:43:08.139810+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSFOQ4J5NP66","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSFOQ4J5NP662ZD7","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSFOQ4J5","created_at":"2026-05-18T12:31:43.269735+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSFOQ4J5NP662ZD7FL5CYDLEFN","json":"https://pith.science/pith/SSFOQ4J5NP662ZD7FL5CYDLEFN.json","graph_json":"https://pith.science/api/pith-number/SSFOQ4J5NP662ZD7FL5CYDLEFN/graph.json","events_json":"https://pith.science/api/pith-number/SSFOQ4J5NP662ZD7FL5CYDLEFN/events.json","paper":"https://pith.science/paper/SSFOQ4J5"},"agent_actions":{"view_html":"https://pith.science/pith/SSFOQ4J5NP662ZD7FL5CYDLEFN","download_json":"https://pith.science/pith/SSFOQ4J5NP662ZD7FL5CYDLEFN.json","view_paper":"https://pith.science/paper/SSFOQ4J5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08922&json=true","fetch_graph":"https://pith.science/api/pith-number/SSFOQ4J5NP662ZD7FL5CYDLEFN/graph.json","fetch_events":"https://pith.science/api/pith-number/SSFOQ4J5NP662ZD7FL5CYDLEFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSFOQ4J5NP662ZD7FL5CYDLEFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSFOQ4J5NP662ZD7FL5CYDLEFN/action/storage_attestation","attest_author":"https://pith.science/pith/SSFOQ4J5NP662ZD7FL5CYDLEFN/action/author_attestation","sign_citation":"https://pith.science/pith/SSFOQ4J5NP662ZD7FL5CYDLEFN/action/citation_signature","submit_replication":"https://pith.science/pith/SSFOQ4J5NP662ZD7FL5CYDLEFN/action/replication_record"}},"created_at":"2026-05-18T00:43:08.139810+00:00","updated_at":"2026-05-18T00:43:08.139810+00:00"}