{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:7CCSFAAWT7PKDEL4OJWK53Y7PG","short_pith_number":"pith:7CCSFAAW","schema_version":"1.0","canonical_sha256":"f8852280169fdea1917c726caeef1f7981fbb646c8121e3ad046c82d959c66a5","source":{"kind":"arxiv","id":"2102.04010","version":2},"attestation_state":"computed","paper":{"title":"Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.CV","authors_text":"Aojun Zhou, Hongsheng Li, Jianbo Liu, Junnan Zhu, Kun Yuan, Wenxiu Sun, Yukun Ma, Zhijie Zhang","submitted_at":"2021-02-08T05:55:47Z","abstract_excerpt":"Sparsity in Deep Neural Networks (DNNs) has been widely studied to compress and accelerate the models on resource-constrained environments. It can be generally categorized into unstructured fine-grained sparsity that zeroes out multiple individual weights distributed across the neural network, and structured coarse-grained sparsity which prunes blocks of sub-networks of a neural network. Fine-grained sparsity can achieve a high compression ratio but is not hardware friendly and hence receives limited speed gains. On the other hand, coarse-grained sparsity cannot concurrently achieve both appar"},"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":"2102.04010","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2021-02-08T05:55:47Z","cross_cats_sorted":["cs.AR"],"title_canon_sha256":"94fbe5f3b783fa0b9901f905f7a7aa34e9b7e9cc2ccabaacb8919208fd6b3b41","abstract_canon_sha256":"aabab0f2dc529949c800cbf5c73b08bce49ba9ee08c3651abc9fc5814b954aa1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:32:48.563011Z","signature_b64":"nZ4iHWmK92kmGH13LBq+P9AxriEFTVF9CizCV5ccCjWzV3pplQdGYxgWzi4YSnvav8sbpdI2z1Y2CT2emlCoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f8852280169fdea1917c726caeef1f7981fbb646c8121e3ad046c82d959c66a5","last_reissued_at":"2026-07-05T02:32:48.562293Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:32:48.562293Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning N:M Fine-grained Structured Sparse Neural Networks From Scratch","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AR"],"primary_cat":"cs.CV","authors_text":"Aojun Zhou, Hongsheng Li, Jianbo Liu, Junnan Zhu, Kun Yuan, Wenxiu Sun, Yukun Ma, Zhijie Zhang","submitted_at":"2021-02-08T05:55:47Z","abstract_excerpt":"Sparsity in Deep Neural Networks (DNNs) has been widely studied to compress and accelerate the models on resource-constrained environments. It can be generally categorized into unstructured fine-grained sparsity that zeroes out multiple individual weights distributed across the neural network, and structured coarse-grained sparsity which prunes blocks of sub-networks of a neural network. Fine-grained sparsity can achieve a high compression ratio but is not hardware friendly and hence receives limited speed gains. On the other hand, coarse-grained sparsity cannot concurrently achieve both appar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2102.04010","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/2102.04010/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":"2102.04010","created_at":"2026-07-05T02:32:48.562362+00:00"},{"alias_kind":"arxiv_version","alias_value":"2102.04010v2","created_at":"2026-07-05T02:32:48.562362+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2102.04010","created_at":"2026-07-05T02:32:48.562362+00:00"},{"alias_kind":"pith_short_12","alias_value":"7CCSFAAWT7PK","created_at":"2026-07-05T02:32:48.562362+00:00"},{"alias_kind":"pith_short_16","alias_value":"7CCSFAAWT7PKDEL4","created_at":"2026-07-05T02:32:48.562362+00:00"},{"alias_kind":"pith_short_8","alias_value":"7CCSFAAW","created_at":"2026-07-05T02:32:48.562362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2310.02277","citing_title":"Junk DNA Hypothesis: Pruning Small Pre-Trained Weights Irreversibly and Monotonically Impairs \"Difficult\" Downstream Tasks in LLMs","ref_index":61,"is_internal_anchor":false},{"citing_arxiv_id":"2506.12876","citing_title":"MaskPro: Linear-Space Probabilistic Learning for Strict (N:M)-Sparsity on LLMs","ref_index":30,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03667","citing_title":"ELAS: Efficient Pre-Training of Low-Rank Large Language Models via 2:4 Activation Sparsity","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7CCSFAAWT7PKDEL4OJWK53Y7PG","json":"https://pith.science/pith/7CCSFAAWT7PKDEL4OJWK53Y7PG.json","graph_json":"https://pith.science/api/pith-number/7CCSFAAWT7PKDEL4OJWK53Y7PG/graph.json","events_json":"https://pith.science/api/pith-number/7CCSFAAWT7PKDEL4OJWK53Y7PG/events.json","paper":"https://pith.science/paper/7CCSFAAW"},"agent_actions":{"view_html":"https://pith.science/pith/7CCSFAAWT7PKDEL4OJWK53Y7PG","download_json":"https://pith.science/pith/7CCSFAAWT7PKDEL4OJWK53Y7PG.json","view_paper":"https://pith.science/paper/7CCSFAAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2102.04010&json=true","fetch_graph":"https://pith.science/api/pith-number/7CCSFAAWT7PKDEL4OJWK53Y7PG/graph.json","fetch_events":"https://pith.science/api/pith-number/7CCSFAAWT7PKDEL4OJWK53Y7PG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7CCSFAAWT7PKDEL4OJWK53Y7PG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7CCSFAAWT7PKDEL4OJWK53Y7PG/action/storage_attestation","attest_author":"https://pith.science/pith/7CCSFAAWT7PKDEL4OJWK53Y7PG/action/author_attestation","sign_citation":"https://pith.science/pith/7CCSFAAWT7PKDEL4OJWK53Y7PG/action/citation_signature","submit_replication":"https://pith.science/pith/7CCSFAAWT7PKDEL4OJWK53Y7PG/action/replication_record"}},"created_at":"2026-07-05T02:32:48.562362+00:00","updated_at":"2026-07-05T02:32:48.562362+00:00"}