{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:I2ZWLH7ASPICPTUD2SXN3BG2NM","short_pith_number":"pith:I2ZWLH7A","schema_version":"1.0","canonical_sha256":"46b3659fe093d027ce83d4aedd84da6b3779181f1a0187f80d323a75f6bd6887","source":{"kind":"arxiv","id":"1711.02782","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1711.02782","created_at":"2026-05-18T00:31:01.785774+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02782v1","created_at":"2026-05-18T00:31:01.785774+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02782","created_at":"2026-05-18T00:31:01.785774+00:00"},{"alias_kind":"pith_short_12","alias_value":"I2ZWLH7ASPIC","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"I2ZWLH7ASPICPTUD","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"I2ZWLH7A","created_at":"2026-05-18T12:31:21.493067+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1906.11786","citing_title":"Fast Training of Sparse Graph Neural Networks on Dense Hardware","ref_index":5,"is_internal_anchor":true},{"citing_arxiv_id":"2501.01005","citing_title":"FlashInfer: Efficient and Customizable Attention Engine for LLM Inference Serving","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM","json":"https://pith.science/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM.json","graph_json":"https://pith.science/api/pith-number/I2ZWLH7ASPICPTUD2SXN3BG2NM/graph.json","events_json":"https://pith.science/api/pith-number/I2ZWLH7ASPICPTUD2SXN3BG2NM/events.json","paper":"https://pith.science/paper/I2ZWLH7A"},"agent_actions":{"view_html":"https://pith.science/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM","download_json":"https://pith.science/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM.json","view_paper":"https://pith.science/paper/I2ZWLH7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02782&json=true","fetch_graph":"https://pith.science/api/pith-number/I2ZWLH7ASPICPTUD2SXN3BG2NM/graph.json","fetch_events":"https://pith.science/api/pith-number/I2ZWLH7ASPICPTUD2SXN3BG2NM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM/action/storage_attestation","attest_author":"https://pith.science/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM/action/author_attestation","sign_citation":"https://pith.science/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM/action/citation_signature","submit_replication":"https://pith.science/pith/I2ZWLH7ASPICPTUD2SXN3BG2NM/action/replication_record"}},"created_at":"2026-05-18T00:31:01.785774+00:00","updated_at":"2026-05-18T00:31:01.785774+00:00"}