{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VYXQYFCJSJQ2CG4RFWSLEJNQPY","short_pith_number":"pith:VYXQYFCJ","schema_version":"1.0","canonical_sha256":"ae2f0c14499261a11b912da4b225b07e135fa3c3f7c725e68c1e378cfd22ba70","source":{"kind":"arxiv","id":"1610.03950","version":1},"attestation_state":"computed","paper":{"title":"Compressing Neural Language Models by Sparse Word Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Ge Li, Lili Mou, Yan Xu, Yunchuan Chen, Zhi Jin","submitted_at":"2016-10-13T06:55:54Z","abstract_excerpt":"Neural networks are among the state-of-the-art techniques for language modeling. Existing neural language models typically map discrete words to distributed, dense vector representations. After information processing of the preceding context words by hidden layers, an output layer estimates the probability of the next word. Such approaches are time- and memory-intensive because of the large numbers of parameters for word embeddings and the output layer. In this paper, we propose to compress neural language models by sparse word representations. In the experiments, the number of parameters in o"},"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":"1610.03950","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-10-13T06:55:54Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2170672344b465ff731650b682db1238f8f5d77af54d3f57ca8b685a069298c9","abstract_canon_sha256":"2e136dfd6d9b00fd84cf00bb44a99f93db2a3d472ffde10fe68acaeb4f79137d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:22.936631Z","signature_b64":"B13LAAykchU29ODyJRtEIK+SOS3bf91+jzWnV8I86ZRMl3PJSeMTY8PDz7DyXPOUghVF7nmxkoGY9eTOajmLCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ae2f0c14499261a11b912da4b225b07e135fa3c3f7c725e68c1e378cfd22ba70","last_reissued_at":"2026-05-18T01:02:22.935925Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:22.935925Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressing Neural Language Models by Sparse Word Representations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"Ge Li, Lili Mou, Yan Xu, Yunchuan Chen, Zhi Jin","submitted_at":"2016-10-13T06:55:54Z","abstract_excerpt":"Neural networks are among the state-of-the-art techniques for language modeling. Existing neural language models typically map discrete words to distributed, dense vector representations. After information processing of the preceding context words by hidden layers, an output layer estimates the probability of the next word. Such approaches are time- and memory-intensive because of the large numbers of parameters for word embeddings and the output layer. In this paper, we propose to compress neural language models by sparse word representations. In the experiments, the number of parameters in o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03950","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":"1610.03950","created_at":"2026-05-18T01:02:22.936037+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.03950v1","created_at":"2026-05-18T01:02:22.936037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03950","created_at":"2026-05-18T01:02:22.936037+00:00"},{"alias_kind":"pith_short_12","alias_value":"VYXQYFCJSJQ2","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VYXQYFCJSJQ2CG4R","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VYXQYFCJ","created_at":"2026-05-18T12:30:48.956258+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/VYXQYFCJSJQ2CG4RFWSLEJNQPY","json":"https://pith.science/pith/VYXQYFCJSJQ2CG4RFWSLEJNQPY.json","graph_json":"https://pith.science/api/pith-number/VYXQYFCJSJQ2CG4RFWSLEJNQPY/graph.json","events_json":"https://pith.science/api/pith-number/VYXQYFCJSJQ2CG4RFWSLEJNQPY/events.json","paper":"https://pith.science/paper/VYXQYFCJ"},"agent_actions":{"view_html":"https://pith.science/pith/VYXQYFCJSJQ2CG4RFWSLEJNQPY","download_json":"https://pith.science/pith/VYXQYFCJSJQ2CG4RFWSLEJNQPY.json","view_paper":"https://pith.science/paper/VYXQYFCJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.03950&json=true","fetch_graph":"https://pith.science/api/pith-number/VYXQYFCJSJQ2CG4RFWSLEJNQPY/graph.json","fetch_events":"https://pith.science/api/pith-number/VYXQYFCJSJQ2CG4RFWSLEJNQPY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VYXQYFCJSJQ2CG4RFWSLEJNQPY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VYXQYFCJSJQ2CG4RFWSLEJNQPY/action/storage_attestation","attest_author":"https://pith.science/pith/VYXQYFCJSJQ2CG4RFWSLEJNQPY/action/author_attestation","sign_citation":"https://pith.science/pith/VYXQYFCJSJQ2CG4RFWSLEJNQPY/action/citation_signature","submit_replication":"https://pith.science/pith/VYXQYFCJSJQ2CG4RFWSLEJNQPY/action/replication_record"}},"created_at":"2026-05-18T01:02:22.936037+00:00","updated_at":"2026-05-18T01:02:22.936037+00:00"}