{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:RZFGOIPT46Y2HT3JFQFU5PMLZ6","short_pith_number":"pith:RZFGOIPT","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"},"canonical_sha256":"8e4a6721f3e7b1a3cf692c0b4ebd8bcf9d6a3ce0ed585b611aecd336066aea0a","source":{"kind":"arxiv","id":"1802.06367","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06367","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06367v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06367","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"RZFGOIPT46Y2","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RZFGOIPT46Y2HT3J","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RZFGOIPT","created_at":"2026-05-18T12:32:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:RZFGOIPT46Y2HT3JFQFU5PMLZ6","target":"record","payload":{"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"},"canonical_sha256":"8e4a6721f3e7b1a3cf692c0b4ebd8bcf9d6a3ce0ed585b611aecd336066aea0a","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"},"source_kind":"arxiv","source_id":"1802.06367","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YQXOt9vpyJPXE6bC9XFFoQG/I4KF879GbM7IfEUQb+0KxiOAh8U8KHhdK5hoqpIwQut38x+gsnxVbZ5O4x6sDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:20:57.926556Z"},"content_sha256":"58b537f4c2c4912ab9a405312b0d1112a0ed6acccb49584da3e53875ae523ac4","schema_version":"1.0","event_id":"sha256:58b537f4c2c4912ab9a405312b0d1112a0ed6acccb49584da3e53875ae523ac4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:RZFGOIPT46Y2HT3JFQFU5PMLZ6","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rblh0ywdACH/DvA3DU3q9GMHmqqSy4He/7WIwrUp5Jjp5bV0StdezXm0fNNLvE1YhFcoKFv2rk4D4sed+dVlBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T10:20:57.926911Z"},"content_sha256":"506765be4423e0cb4f0c432d29d123724088e4b548773c7eab9a7521b002c807","schema_version":"1.0","event_id":"sha256:506765be4423e0cb4f0c432d29d123724088e4b548773c7eab9a7521b002c807"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6/bundle.json","state_url":"https://pith.science/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T10:20:57Z","links":{"resolver":"https://pith.science/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6","bundle":"https://pith.science/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6/bundle.json","state":"https://pith.science/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZFGOIPT46Y2HT3JFQFU5PMLZ6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:RZFGOIPT46Y2HT3JFQFU5PMLZ6","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d22133b01a485b5a4633e5970bcc3949a9529d2a4b3b2910033fcc5aa2be98c1","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-18T12:29:05Z","title_canon_sha256":"c8d2cccbb6a15b09d76b93e2f91976b65877ce4f6efb71253aa611b3c8fd9fdf"},"schema_version":"1.0","source":{"id":"1802.06367","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06367","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06367v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06367","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"RZFGOIPT46Y2","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_16","alias_value":"RZFGOIPT46Y2HT3J","created_at":"2026-05-18T12:32:50Z"},{"alias_kind":"pith_short_8","alias_value":"RZFGOIPT","created_at":"2026-05-18T12:32:50Z"}],"graph_snapshots":[{"event_id":"sha256:506765be4423e0cb4f0c432d29d123724088e4b548773c7eab9a7521b002c807","target":"graph","created_at":"2026-05-18T00:23:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jeff Pool, Song Han, William J. Dally, Xingyu Liu","cross_cats":["cs.LG","cs.NE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-18T12:29:05Z","title":"Efficient Sparse-Winograd Convolutional Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06367","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:58b537f4c2c4912ab9a405312b0d1112a0ed6acccb49584da3e53875ae523ac4","target":"record","created_at":"2026-05-18T00:23:03Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d22133b01a485b5a4633e5970bcc3949a9529d2a4b3b2910033fcc5aa2be98c1","cross_cats_sorted":["cs.LG","cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2018-02-18T12:29:05Z","title_canon_sha256":"c8d2cccbb6a15b09d76b93e2f91976b65877ce4f6efb71253aa611b3c8fd9fdf"},"schema_version":"1.0","source":{"id":"1802.06367","kind":"arxiv","version":1}},"canonical_sha256":"8e4a6721f3e7b1a3cf692c0b4ebd8bcf9d6a3ce0ed585b611aecd336066aea0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e4a6721f3e7b1a3cf692c0b4ebd8bcf9d6a3ce0ed585b611aecd336066aea0a","first_computed_at":"2026-05-18T00:23:03.466600Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:03.466600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WWedJLQ9bBo01GnZyqX8iiyi4QLqAdSaUy2G0VC4ji8rB496/RqCY9aQHpZXN1JQcFOOILnHwRanIl/3zgqPCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:03.467118Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06367","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58b537f4c2c4912ab9a405312b0d1112a0ed6acccb49584da3e53875ae523ac4","sha256:506765be4423e0cb4f0c432d29d123724088e4b548773c7eab9a7521b002c807"],"state_sha256":"f79eb1664df772fc4db38083b273ed991b2f1e12856e8af37acf5f8d5d06b758"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"W0rxkleZ/KJ46/0R6proo/pzCl2mKbei6PQQRgZTky3MmG36nLauUZoCagZZumujhKzhU+MCA5O98iorAkXyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T10:20:57.928892Z","bundle_sha256":"4784f905c812ff9673cc9253d134f13a39df4810b9360004604c8c71d7949347"}}