{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RZFGOIPT46Y2HT3JFQFU5PMLZ6","short_pith_number":"pith:RZFGOIPT","schema_version":"1.0","canonical_sha256":"8e4a6721f3e7b1a3cf692c0b4ebd8bcf9d6a3ce0ed585b611aecd336066aea0a","source":{"kind":"arxiv","id":"1802.06367","version":1},"attestation_state":"computed","paper":{"title":"Efficient Sparse-Winograd Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Jeff Pool, Song Han, William J. Dally, Xingyu Liu","submitted_at":"2018-02-18T12:29:05Z","abstract_excerpt":"Convolutional Neural Networks (CNNs) are computationally intensive, which limits their application on mobile devices. Their energy is dominated by the number of multiplies needed to perform the convolutions. Winograd's minimal filtering algorithm (Lavin, 2015) and network pruning (Han et al., 2015) can reduce the operation count, but these two methods cannot be directly combined $-$ applying the Winograd transform fills in the sparsity in both the weights and the activations. We propose two modifications to Winograd-based CNNs to enable these methods to exploit sparsity. First, we move the ReL"},"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":"1802.06367","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-18T12:29:05Z","cross_cats_sorted":["cs.LG","cs.NE"],"title_canon_sha256":"c8d2cccbb6a15b09d76b93e2f91976b65877ce4f6efb71253aa611b3c8fd9fdf","abstract_canon_sha256":"d22133b01a485b5a4633e5970bcc3949a9529d2a4b3b2910033fcc5aa2be98c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.467118Z","signature_b64":"WWedJLQ9bBo01GnZyqX8iiyi4QLqAdSaUy2G0VC4ji8rB496/RqCY9aQHpZXN1JQcFOOILnHwRanIl/3zgqPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e4a6721f3e7b1a3cf692c0b4ebd8bcf9d6a3ce0ed585b611aecd336066aea0a","last_reissued_at":"2026-05-18T00:23:03.466600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.466600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Sparse-Winograd Convolutional Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NE"],"primary_cat":"cs.CV","authors_text":"Jeff Pool, Song Han, William J. Dally, Xingyu Liu","submitted_at":"2018-02-18T12:29:05Z","abstract_excerpt":"Convolutional Neural Networks (CNNs) are computationally intensive, which limits their application on mobile devices. Their energy is dominated by the number of multiplies needed to perform the convolutions. Winograd's minimal filtering algorithm (Lavin, 2015) and network pruning (Han et al., 2015) can reduce the operation count, but these two methods cannot be directly combined $-$ applying the Winograd transform fills in the sparsity in both the weights and the activations. We propose two modifications to Winograd-based CNNs to enable these methods to exploit sparsity. First, we move the ReL"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06367","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":""},"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":"1802.06367","created_at":"2026-05-18T00:23:03.466682+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06367v1","created_at":"2026-05-18T00:23:03.466682+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06367","created_at":"2026-05-18T00:23:03.466682+00:00"},{"alias_kind":"pith_short_12","alias_value":"RZFGOIPT46Y2","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RZFGOIPT46Y2HT3J","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RZFGOIPT","created_at":"2026-05-18T12:32:50.500415+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/RZFGOIPT46Y2HT3JFQFU5PMLZ6","json":"https://pith.science/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6.json","graph_json":"https://pith.science/api/pith-number/RZFGOIPT46Y2HT3JFQFU5PMLZ6/graph.json","events_json":"https://pith.science/api/pith-number/RZFGOIPT46Y2HT3JFQFU5PMLZ6/events.json","paper":"https://pith.science/paper/RZFGOIPT"},"agent_actions":{"view_html":"https://pith.science/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6","download_json":"https://pith.science/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6.json","view_paper":"https://pith.science/paper/RZFGOIPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06367&json=true","fetch_graph":"https://pith.science/api/pith-number/RZFGOIPT46Y2HT3JFQFU5PMLZ6/graph.json","fetch_events":"https://pith.science/api/pith-number/RZFGOIPT46Y2HT3JFQFU5PMLZ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6/action/storage_attestation","attest_author":"https://pith.science/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6/action/author_attestation","sign_citation":"https://pith.science/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6/action/citation_signature","submit_replication":"https://pith.science/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6/action/replication_record"}},"created_at":"2026-05-18T00:23:03.466682+00:00","updated_at":"2026-05-18T00:23:03.466682+00:00"}