{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:LMPKMCL2UPNP7N2JL3LVAGDGNX","short_pith_number":"pith:LMPKMCL2","schema_version":"1.0","canonical_sha256":"5b1ea6097aa3daffb7495ed75018666dc5a40d28276faf9d044e8d423e3b4b7d","source":{"kind":"arxiv","id":"2310.06218","version":1},"attestation_state":"computed","paper":{"title":"SUBP: Soft Uniform Block Pruning for 1xN Sparse CNNs Multithreading Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Guang Dai, Jingyang Xiang, Jun Chen, Shipeng Bai, Siqi Li, Yong Liu, Yukai Ma","submitted_at":"2023-10-10T00:22:27Z","abstract_excerpt":"The study of sparsity in Convolutional Neural Networks (CNNs) has become widespread to compress and accelerate models in environments with limited resources. By constraining N consecutive weights along the output channel to be group-wise non-zero, the recent network with 1$\\times$N sparsity has received tremendous popularity for its three outstanding advantages: 1) A large amount of storage space saving by a \\emph{Block Sparse Row} matrix. 2) Excellent performance at a high sparsity. 3) Significant speedups on CPUs with Advanced Vector Extensions. Recent work requires selecting and fine-tuning"},"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":"2310.06218","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-10-10T00:22:27Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"d24c6de63fba10e9732d6d39095987f79ca833743a387479e06ec6762dc76d20","abstract_canon_sha256":"a0a4a8ecb4fd17366ceb83925c19ac7a3eab72e56f2598a2718f9417ac0f135b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:59:07.189332Z","signature_b64":"K0so2hWZ+A9U+j473YvHbZfwBEmDweJJxIS1my9t6o8gv7zTl23TLZ3fHCv4eZCplpVJhYbdnjAeqJbwhBxfCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5b1ea6097aa3daffb7495ed75018666dc5a40d28276faf9d044e8d423e3b4b7d","last_reissued_at":"2026-07-05T06:59:07.188758Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:59:07.188758Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"SUBP: Soft Uniform Block Pruning for 1xN Sparse CNNs Multithreading Acceleration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Guang Dai, Jingyang Xiang, Jun Chen, Shipeng Bai, Siqi Li, Yong Liu, Yukai Ma","submitted_at":"2023-10-10T00:22:27Z","abstract_excerpt":"The study of sparsity in Convolutional Neural Networks (CNNs) has become widespread to compress and accelerate models in environments with limited resources. By constraining N consecutive weights along the output channel to be group-wise non-zero, the recent network with 1$\\times$N sparsity has received tremendous popularity for its three outstanding advantages: 1) A large amount of storage space saving by a \\emph{Block Sparse Row} matrix. 2) Excellent performance at a high sparsity. 3) Significant speedups on CPUs with Advanced Vector Extensions. Recent work requires selecting and fine-tuning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.06218","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/2310.06218/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":"2310.06218","created_at":"2026-07-05T06:59:07.188822+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.06218v1","created_at":"2026-07-05T06:59:07.188822+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.06218","created_at":"2026-07-05T06:59:07.188822+00:00"},{"alias_kind":"pith_short_12","alias_value":"LMPKMCL2UPNP","created_at":"2026-07-05T06:59:07.188822+00:00"},{"alias_kind":"pith_short_16","alias_value":"LMPKMCL2UPNP7N2J","created_at":"2026-07-05T06:59:07.188822+00:00"},{"alias_kind":"pith_short_8","alias_value":"LMPKMCL2","created_at":"2026-07-05T06:59:07.188822+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/LMPKMCL2UPNP7N2JL3LVAGDGNX","json":"https://pith.science/pith/LMPKMCL2UPNP7N2JL3LVAGDGNX.json","graph_json":"https://pith.science/api/pith-number/LMPKMCL2UPNP7N2JL3LVAGDGNX/graph.json","events_json":"https://pith.science/api/pith-number/LMPKMCL2UPNP7N2JL3LVAGDGNX/events.json","paper":"https://pith.science/paper/LMPKMCL2"},"agent_actions":{"view_html":"https://pith.science/pith/LMPKMCL2UPNP7N2JL3LVAGDGNX","download_json":"https://pith.science/pith/LMPKMCL2UPNP7N2JL3LVAGDGNX.json","view_paper":"https://pith.science/paper/LMPKMCL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.06218&json=true","fetch_graph":"https://pith.science/api/pith-number/LMPKMCL2UPNP7N2JL3LVAGDGNX/graph.json","fetch_events":"https://pith.science/api/pith-number/LMPKMCL2UPNP7N2JL3LVAGDGNX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LMPKMCL2UPNP7N2JL3LVAGDGNX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LMPKMCL2UPNP7N2JL3LVAGDGNX/action/storage_attestation","attest_author":"https://pith.science/pith/LMPKMCL2UPNP7N2JL3LVAGDGNX/action/author_attestation","sign_citation":"https://pith.science/pith/LMPKMCL2UPNP7N2JL3LVAGDGNX/action/citation_signature","submit_replication":"https://pith.science/pith/LMPKMCL2UPNP7N2JL3LVAGDGNX/action/replication_record"}},"created_at":"2026-07-05T06:59:07.188822+00:00","updated_at":"2026-07-05T06:59:07.188822+00:00"}