{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KFMFPL27XUAEFEJUDIUZFSW2AS","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":"c861a6df8cefbc75e27ec3f990e09e4590ca5dedfc6ece6282c628d7ec431f21","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-25T15:27:23Z","title_canon_sha256":"9cdc1d564399fe0300de9c453c307fa5d670f813e7cb0b1a25d49ce0ed2d102c"},"schema_version":"1.0","source":{"id":"1810.10927","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.10927","created_at":"2026-05-17T23:58:30Z"},{"alias_kind":"arxiv_version","alias_value":"1810.10927v2","created_at":"2026-05-17T23:58:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.10927","created_at":"2026-05-17T23:58:30Z"},{"alias_kind":"pith_short_12","alias_value":"KFMFPL27XUAE","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KFMFPL27XUAEFEJU","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KFMFPL27","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:7575eac81ba31de3635903598a213418c524a71707f3bc6d7edb97b33c9936ee","target":"graph","created_at":"2026-05-17T23:58:30Z","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":"In natural language processing, a lot of the tasks are successfully solved with recurrent neural networks, but such models have a huge number of parameters. The majority of these parameters are often concentrated in the embedding layer, which size grows proportionally to the vocabulary length. We propose a Bayesian sparsification technique for RNNs which allows compressing the RNN dozens or hundreds of times without time-consuming hyperparameters tuning. We also generalize the model for vocabulary sparsification to filter out unnecessary words and compress the RNN even further. We show that th","authors_text":"Dmitry Vetrov, Ekaterina Lobacheva, Nadezhda Chirkova","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-25T15:27:23Z","title":"Bayesian Compression for Natural Language Processing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.10927","kind":"arxiv","version":2},"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:5b8127c52f6958c0efa82ef99882801144513041597ffa1d02c7e0fb4d2d41ac","target":"record","created_at":"2026-05-17T23:58:30Z","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":"c861a6df8cefbc75e27ec3f990e09e4590ca5dedfc6ece6282c628d7ec431f21","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-10-25T15:27:23Z","title_canon_sha256":"9cdc1d564399fe0300de9c453c307fa5d670f813e7cb0b1a25d49ce0ed2d102c"},"schema_version":"1.0","source":{"id":"1810.10927","kind":"arxiv","version":2}},"canonical_sha256":"515857af5fbd004291341a2992cada048169b5f588fa8a1c54cbe057e31e12af","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"515857af5fbd004291341a2992cada048169b5f588fa8a1c54cbe057e31e12af","first_computed_at":"2026-05-17T23:58:30.286900Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:30.286900Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"taxC6RxjhiuYklVagZ1m70gXXfa6Vr31R6beYskY+TJN3k8EsIq1x07S0M40BdUCupt9mQh35thBAnDj5VbODA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:30.287558Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.10927","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b8127c52f6958c0efa82ef99882801144513041597ffa1d02c7e0fb4d2d41ac","sha256:7575eac81ba31de3635903598a213418c524a71707f3bc6d7edb97b33c9936ee"],"state_sha256":"ef6f80869d018a62062edf358484afabf85846121ba736865c2b47d33b9a7ec2"}