{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2LDQXI7R4EFUEHPCDMRKZ7OWFA","short_pith_number":"pith:2LDQXI7R","canonical_record":{"source":{"id":"1502.00512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-02-02T15:27:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"29871a2b6e0ea875621d6096405e13be715a23a6e668f368a81a5bd5c248ee25","abstract_canon_sha256":"1c968041ba13c8a67460cfecd995103b9d26f6d947ce5f61dad8214702bbf583"},"schema_version":"1.0"},"canonical_sha256":"d2c70ba3f1e10b421de21b22acfdd6283884d6c4620b5702fd94fc8581624532","source":{"kind":"arxiv","id":"1502.00512","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00512","created_at":"2026-05-18T02:28:05Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00512v1","created_at":"2026-05-18T02:28:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00512","created_at":"2026-05-18T02:28:05Z"},{"alias_kind":"pith_short_12","alias_value":"2LDQXI7R4EFU","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2LDQXI7R4EFUEHPC","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2LDQXI7R","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2LDQXI7R4EFUEHPCDMRKZ7OWFA","target":"record","payload":{"canonical_record":{"source":{"id":"1502.00512","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-02-02T15:27:37Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"29871a2b6e0ea875621d6096405e13be715a23a6e668f368a81a5bd5c248ee25","abstract_canon_sha256":"1c968041ba13c8a67460cfecd995103b9d26f6d947ce5f61dad8214702bbf583"},"schema_version":"1.0"},"canonical_sha256":"d2c70ba3f1e10b421de21b22acfdd6283884d6c4620b5702fd94fc8581624532","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:05.859382Z","signature_b64":"28pw/k1FL7oOQkO3uPHA2KtqErPwPw1AyH5CzwKjWpkSwEwr8NGKtRsbjUWe/JhQjsYNXTFq82W/lrZ5Zx6RCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d2c70ba3f1e10b421de21b22acfdd6283884d6c4620b5702fd94fc8581624532","last_reissued_at":"2026-05-18T02:28:05.858975Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:05.858975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.00512","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-18T02:28:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zy461Kk2E28maiLRJqKTgDJhTx5HTNm3ROYWHtSg3WPPo76PA/IGaFoO6tI4NuvLct04E4n0ThBnaWpIG1KUBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:33:32.784056Z"},"content_sha256":"1a4943926fb9017384f1444a0fcf0154f4f22e9aca3814247a75b41a3b86c9e6","schema_version":"1.0","event_id":"sha256:1a4943926fb9017384f1444a0fcf0154f4f22e9aca3814247a75b41a3b86c9e6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2LDQXI7R4EFUEHPCDMRKZ7OWFA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Scaling Recurrent Neural Network Language Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CL","authors_text":"David Mrva, Niranjani Prasad, Tom Ash, Tony Robinson, Will Williams","submitted_at":"2015-02-02T15:27:37Z","abstract_excerpt":"This paper investigates the scaling properties of Recurrent Neural Network Language Models (RNNLMs). We discuss how to train very large RNNs on GPUs and address the questions of how RNNLMs scale with respect to model size, training-set size, computational costs and memory. Our analysis shows that despite being more costly to train, RNNLMs obtain much lower perplexities on standard benchmarks than n-gram models. We train the largest known RNNs and present relative word error rates gains of 18% on an ASR task. We also present the new lowest perplexities on the recently released billion word lang"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00512","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-18T02:28:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ENHJZyY0NCVgTAXdRVPgdmng5skU8gOalyx1d6W40JafWIfSKUGgU9igRjXgdag3JwmmY2b93EfJMq39WXLtBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:33:32.784758Z"},"content_sha256":"4cf5b46382602c2d94b83353396d478ce9b65a97eca10e53584a2a41bb2f0c24","schema_version":"1.0","event_id":"sha256:4cf5b46382602c2d94b83353396d478ce9b65a97eca10e53584a2a41bb2f0c24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2LDQXI7R4EFUEHPCDMRKZ7OWFA/bundle.json","state_url":"https://pith.science/pith/2LDQXI7R4EFUEHPCDMRKZ7OWFA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2LDQXI7R4EFUEHPCDMRKZ7OWFA/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-26T22:33:32Z","links":{"resolver":"https://pith.science/pith/2LDQXI7R4EFUEHPCDMRKZ7OWFA","bundle":"https://pith.science/pith/2LDQXI7R4EFUEHPCDMRKZ7OWFA/bundle.json","state":"https://pith.science/pith/2LDQXI7R4EFUEHPCDMRKZ7OWFA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2LDQXI7R4EFUEHPCDMRKZ7OWFA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2LDQXI7R4EFUEHPCDMRKZ7OWFA","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":"1c968041ba13c8a67460cfecd995103b9d26f6d947ce5f61dad8214702bbf583","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-02-02T15:27:37Z","title_canon_sha256":"29871a2b6e0ea875621d6096405e13be715a23a6e668f368a81a5bd5c248ee25"},"schema_version":"1.0","source":{"id":"1502.00512","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00512","created_at":"2026-05-18T02:28:05Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00512v1","created_at":"2026-05-18T02:28:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00512","created_at":"2026-05-18T02:28:05Z"},{"alias_kind":"pith_short_12","alias_value":"2LDQXI7R4EFU","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2LDQXI7R4EFUEHPC","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2LDQXI7R","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:4cf5b46382602c2d94b83353396d478ce9b65a97eca10e53584a2a41bb2f0c24","target":"graph","created_at":"2026-05-18T02:28:05Z","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":"This paper investigates the scaling properties of Recurrent Neural Network Language Models (RNNLMs). We discuss how to train very large RNNs on GPUs and address the questions of how RNNLMs scale with respect to model size, training-set size, computational costs and memory. Our analysis shows that despite being more costly to train, RNNLMs obtain much lower perplexities on standard benchmarks than n-gram models. We train the largest known RNNs and present relative word error rates gains of 18% on an ASR task. We also present the new lowest perplexities on the recently released billion word lang","authors_text":"David Mrva, Niranjani Prasad, Tom Ash, Tony Robinson, Will Williams","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-02-02T15:27:37Z","title":"Scaling Recurrent Neural Network Language Models"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00512","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:1a4943926fb9017384f1444a0fcf0154f4f22e9aca3814247a75b41a3b86c9e6","target":"record","created_at":"2026-05-18T02:28:05Z","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":"1c968041ba13c8a67460cfecd995103b9d26f6d947ce5f61dad8214702bbf583","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2015-02-02T15:27:37Z","title_canon_sha256":"29871a2b6e0ea875621d6096405e13be715a23a6e668f368a81a5bd5c248ee25"},"schema_version":"1.0","source":{"id":"1502.00512","kind":"arxiv","version":1}},"canonical_sha256":"d2c70ba3f1e10b421de21b22acfdd6283884d6c4620b5702fd94fc8581624532","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d2c70ba3f1e10b421de21b22acfdd6283884d6c4620b5702fd94fc8581624532","first_computed_at":"2026-05-18T02:28:05.858975Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:05.858975Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"28pw/k1FL7oOQkO3uPHA2KtqErPwPw1AyH5CzwKjWpkSwEwr8NGKtRsbjUWe/JhQjsYNXTFq82W/lrZ5Zx6RCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:05.859382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00512","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a4943926fb9017384f1444a0fcf0154f4f22e9aca3814247a75b41a3b86c9e6","sha256:4cf5b46382602c2d94b83353396d478ce9b65a97eca10e53584a2a41bb2f0c24"],"state_sha256":"fa618a415b0a19e6ccb64ba9102e987d3e350ebd2adacf6f8b8bde4cdeb65c0a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"29rosUUINpgF/9XDGGpCDVOfFBRixTSBZKniBdvH4s5oqz/J4bykqudM0ZzzP0+7bckkifu/0JID0N+I12MoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:33:32.788416Z","bundle_sha256":"2a04e381b8e0bc6b2f0a3209c74ba6e20b2ae8d5e85bed3df24ff35e5f0b9e2a"}}