{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:I2ZWLH7ASPICPTUD2SXN3BG2NM","short_pith_number":"pith:I2ZWLH7A","canonical_record":{"source":{"id":"1711.02782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T00:57:54Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"01c81272ef89fe23e91f69abf59c78c4b21a7424b41366e1267b45b1af562328","abstract_canon_sha256":"7564c229f1f9ebb366e65d21b7a8cda8d57151c42370a31669ca4ec6706bc67a"},"schema_version":"1.0"},"canonical_sha256":"46b3659fe093d027ce83d4aedd84da6b3779181f1a0187f80d323a75f6bd6887","source":{"kind":"arxiv","id":"1711.02782","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02782","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02782v1","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02782","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"pith_short_12","alias_value":"I2ZWLH7ASPIC","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I2ZWLH7ASPICPTUD","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I2ZWLH7A","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:I2ZWLH7ASPICPTUD2SXN3BG2NM","target":"record","payload":{"canonical_record":{"source":{"id":"1711.02782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T00:57:54Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"01c81272ef89fe23e91f69abf59c78c4b21a7424b41366e1267b45b1af562328","abstract_canon_sha256":"7564c229f1f9ebb366e65d21b7a8cda8d57151c42370a31669ca4ec6706bc67a"},"schema_version":"1.0"},"canonical_sha256":"46b3659fe093d027ce83d4aedd84da6b3779181f1a0187f80d323a75f6bd6887","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:01.786379Z","signature_b64":"tseYYFczl3fifwHfcYw5/rctkKQFGke/+zQBZqHDif7LMAXSeu/N226nyoxv0ewE5rGIn8MzMM/Mfp6LuIfgCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"46b3659fe093d027ce83d4aedd84da6b3779181f1a0187f80d323a75f6bd6887","last_reissued_at":"2026-05-18T00:31:01.785622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:01.785622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.02782","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:31:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8FcmFZB91Zq9kDrQ9necKGcAMdVLc+g1HWmzgkaGjupzOclMzKw2ij6JRh9LhZJhwWM8IM3Tb31K1qeUR7VZDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:53:55.150875Z"},"content_sha256":"d3e56d0d6ed2407d0a018cef609ad1843bee58d577e1f66622231b671f289a7f","schema_version":"1.0","event_id":"sha256:d3e56d0d6ed2407d0a018cef609ad1843bee58d577e1f66622231b671f289a7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:I2ZWLH7ASPICPTUD2SXN3BG2NM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Block-Sparse Recurrent Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Eric Undersander, Gregory Diamos, Sharan Narang","submitted_at":"2017-11-08T00:57:54Z","abstract_excerpt":"Recurrent Neural Networks (RNNs) are used in state-of-the-art models in domains such as speech recognition, machine translation, and language modelling. Sparsity is a technique to reduce compute and memory requirements of deep learning models. Sparse RNNs are easier to deploy on devices and high-end server processors. Even though sparse operations need less compute and memory relative to their dense counterparts, the speed-up observed by using sparse operations is less than expected on different hardware platforms. In order to address this issue, we investigate two different approaches to indu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02782","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:31:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3ekrUSW9fLdNhayVQohNJSj5oAK5Kzh5cvzE4GsEPO7b5eF9tma5sl0/k8H5+iN6nHcC0ZgRbZPTnxOUW04kBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:53:55.151223Z"},"content_sha256":"828e798d05e8ba6ef129fec157cdc94e151abb4801b3e3f80f27fcead1da52fd","schema_version":"1.0","event_id":"sha256:828e798d05e8ba6ef129fec157cdc94e151abb4801b3e3f80f27fcead1da52fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM/bundle.json","state_url":"https://pith.science/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM/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-05-28T07:53:55Z","links":{"resolver":"https://pith.science/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM","bundle":"https://pith.science/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM/bundle.json","state":"https://pith.science/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:I2ZWLH7ASPICPTUD2SXN3BG2NM","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":"7564c229f1f9ebb366e65d21b7a8cda8d57151c42370a31669ca4ec6706bc67a","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T00:57:54Z","title_canon_sha256":"01c81272ef89fe23e91f69abf59c78c4b21a7424b41366e1267b45b1af562328"},"schema_version":"1.0","source":{"id":"1711.02782","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.02782","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"arxiv_version","alias_value":"1711.02782v1","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02782","created_at":"2026-05-18T00:31:01Z"},{"alias_kind":"pith_short_12","alias_value":"I2ZWLH7ASPIC","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"I2ZWLH7ASPICPTUD","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"I2ZWLH7A","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:828e798d05e8ba6ef129fec157cdc94e151abb4801b3e3f80f27fcead1da52fd","target":"graph","created_at":"2026-05-18T00:31:01Z","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":"Recurrent Neural Networks (RNNs) are used in state-of-the-art models in domains such as speech recognition, machine translation, and language modelling. Sparsity is a technique to reduce compute and memory requirements of deep learning models. Sparse RNNs are easier to deploy on devices and high-end server processors. Even though sparse operations need less compute and memory relative to their dense counterparts, the speed-up observed by using sparse operations is less than expected on different hardware platforms. In order to address this issue, we investigate two different approaches to indu","authors_text":"Eric Undersander, Gregory Diamos, Sharan Narang","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T00:57:54Z","title":"Block-Sparse Recurrent Neural Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02782","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:d3e56d0d6ed2407d0a018cef609ad1843bee58d577e1f66622231b671f289a7f","target":"record","created_at":"2026-05-18T00:31:01Z","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":"7564c229f1f9ebb366e65d21b7a8cda8d57151c42370a31669ca4ec6706bc67a","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T00:57:54Z","title_canon_sha256":"01c81272ef89fe23e91f69abf59c78c4b21a7424b41366e1267b45b1af562328"},"schema_version":"1.0","source":{"id":"1711.02782","kind":"arxiv","version":1}},"canonical_sha256":"46b3659fe093d027ce83d4aedd84da6b3779181f1a0187f80d323a75f6bd6887","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"46b3659fe093d027ce83d4aedd84da6b3779181f1a0187f80d323a75f6bd6887","first_computed_at":"2026-05-18T00:31:01.785622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:01.785622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tseYYFczl3fifwHfcYw5/rctkKQFGke/+zQBZqHDif7LMAXSeu/N226nyoxv0ewE5rGIn8MzMM/Mfp6LuIfgCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:01.786379Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.02782","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3e56d0d6ed2407d0a018cef609ad1843bee58d577e1f66622231b671f289a7f","sha256:828e798d05e8ba6ef129fec157cdc94e151abb4801b3e3f80f27fcead1da52fd"],"state_sha256":"792051d47e49159e6c86d84df6969b18d97e6960156b6329e5a45f4b762fa205"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bhqR/SZi+idtnO5+JOD2XuVCDVg9YpKN6lMmTqR68jxyTKtZeGypcFXgIKIeRssrVecvVUl8qtE1Vw2cR1rRAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:53:55.153208Z","bundle_sha256":"a83544b8b1e45dfde4e9fb63afe618b6dee816600442d2e1ba61e1a0d03335d2"}}