{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:A6H2RNQDOW42BDLOWMQBNGOXVM","short_pith_number":"pith:A6H2RNQD","schema_version":"1.0","canonical_sha256":"078fa8b60375b9a08d6eb3201699d7ab05ea319355f3fc01465f220be7e30beb","source":{"kind":"arxiv","id":"1902.02380","version":1},"attestation_state":"computed","paper":{"title":"Compression of Recurrent Neural Networks for Efficient Language Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Andrey V. Savchenko, Artem M. Grachev, Dmitry I. Ignatov","submitted_at":"2019-02-06T19:49:22Z","abstract_excerpt":"Recurrent neural networks have proved to be an effective method for statistical language modeling. However, in practice their memory and run-time complexity are usually too large to be implemented in real-time offline mobile applications. In this paper we consider several compression techniques for recurrent neural networks including Long-Short Term Memory models. We make particular attention to the high-dimensional output problem caused by the very large vocabulary size. We focus on effective compression methods in the context of their exploitation on devices: pruning, quantization, and matri"},"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":"1902.02380","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-02-06T19:49:22Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9c8f00b919dfc3a80e86eab061e526bc1bc2ebd54c2729194e2e2b94c8a279dc","abstract_canon_sha256":"23f5dccccc36a64073090ed4b59b31dc70035c1830c1bbaadaf0a41828284116"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:08.864939Z","signature_b64":"Q6HWzpDjkbZfvBiUsKuq9o3ZTXU0Pmt6s8zXSEn/LDhDysM7P5A23RZuywVC6E3oVZCedtMj78MWLYJu8DcuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"078fa8b60375b9a08d6eb3201699d7ab05ea319355f3fc01465f220be7e30beb","last_reissued_at":"2026-05-17T23:49:08.864299Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:08.864299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compression of Recurrent Neural Networks for Efficient Language Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Andrey V. Savchenko, Artem M. Grachev, Dmitry I. Ignatov","submitted_at":"2019-02-06T19:49:22Z","abstract_excerpt":"Recurrent neural networks have proved to be an effective method for statistical language modeling. However, in practice their memory and run-time complexity are usually too large to be implemented in real-time offline mobile applications. In this paper we consider several compression techniques for recurrent neural networks including Long-Short Term Memory models. We make particular attention to the high-dimensional output problem caused by the very large vocabulary size. We focus on effective compression methods in the context of their exploitation on devices: pruning, quantization, and matri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.02380","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":"1902.02380","created_at":"2026-05-17T23:49:08.864406+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.02380v1","created_at":"2026-05-17T23:49:08.864406+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.02380","created_at":"2026-05-17T23:49:08.864406+00:00"},{"alias_kind":"pith_short_12","alias_value":"A6H2RNQDOW42","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"A6H2RNQDOW42BDLO","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"A6H2RNQD","created_at":"2026-05-18T12:33:12.712433+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/A6H2RNQDOW42BDLOWMQBNGOXVM","json":"https://pith.science/pith/A6H2RNQDOW42BDLOWMQBNGOXVM.json","graph_json":"https://pith.science/api/pith-number/A6H2RNQDOW42BDLOWMQBNGOXVM/graph.json","events_json":"https://pith.science/api/pith-number/A6H2RNQDOW42BDLOWMQBNGOXVM/events.json","paper":"https://pith.science/paper/A6H2RNQD"},"agent_actions":{"view_html":"https://pith.science/pith/A6H2RNQDOW42BDLOWMQBNGOXVM","download_json":"https://pith.science/pith/A6H2RNQDOW42BDLOWMQBNGOXVM.json","view_paper":"https://pith.science/paper/A6H2RNQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.02380&json=true","fetch_graph":"https://pith.science/api/pith-number/A6H2RNQDOW42BDLOWMQBNGOXVM/graph.json","fetch_events":"https://pith.science/api/pith-number/A6H2RNQDOW42BDLOWMQBNGOXVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A6H2RNQDOW42BDLOWMQBNGOXVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A6H2RNQDOW42BDLOWMQBNGOXVM/action/storage_attestation","attest_author":"https://pith.science/pith/A6H2RNQDOW42BDLOWMQBNGOXVM/action/author_attestation","sign_citation":"https://pith.science/pith/A6H2RNQDOW42BDLOWMQBNGOXVM/action/citation_signature","submit_replication":"https://pith.science/pith/A6H2RNQDOW42BDLOWMQBNGOXVM/action/replication_record"}},"created_at":"2026-05-17T23:49:08.864406+00:00","updated_at":"2026-05-17T23:49:08.864406+00:00"}