{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NO5AJ4VMQSKW24CZOQRD2ZGIK5","short_pith_number":"pith:NO5AJ4VM","canonical_record":{"source":{"id":"1703.08068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-23T13:48:45Z","cross_cats_sorted":[],"title_canon_sha256":"029832e1075a7703af933ec7f9386ebb3c31ddfed1f6946e8505c077e7e36937","abstract_canon_sha256":"c5cceafc7fd5ebaf0e7b4664019df6935b857c4b49fd3766ce5afdc89107c1b0"},"schema_version":"1.0"},"canonical_sha256":"6bba04f2ac84956d705974223d64c8577f1bf3fb4aee5bd0086bde783c991dea","source":{"kind":"arxiv","id":"1703.08068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08068","created_at":"2026-05-18T00:48:03Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08068v1","created_at":"2026-05-18T00:48:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08068","created_at":"2026-05-18T00:48:03Z"},{"alias_kind":"pith_short_12","alias_value":"NO5AJ4VMQSKW","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NO5AJ4VMQSKW24CZ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NO5AJ4VM","created_at":"2026-05-18T12:31:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NO5AJ4VMQSKW24CZOQRD2ZGIK5","target":"record","payload":{"canonical_record":{"source":{"id":"1703.08068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-23T13:48:45Z","cross_cats_sorted":[],"title_canon_sha256":"029832e1075a7703af933ec7f9386ebb3c31ddfed1f6946e8505c077e7e36937","abstract_canon_sha256":"c5cceafc7fd5ebaf0e7b4664019df6935b857c4b49fd3766ce5afdc89107c1b0"},"schema_version":"1.0"},"canonical_sha256":"6bba04f2ac84956d705974223d64c8577f1bf3fb4aee5bd0086bde783c991dea","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:03.978433Z","signature_b64":"JeLig9dox0uQPJVAw4EhjvDZGPauIPB1284iafkYNxlOnVcIPLnQovDUakdK8Un03DwMxL5Ls6WXFfd+HsPKCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bba04f2ac84956d705974223d64c8577f1bf3fb4aee5bd0086bde783c991dea","last_reissued_at":"2026-05-18T00:48:03.977743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:03.977743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.08068","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-18T00:48:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1pyYTOVk4eMFOtnopc2n6fnKDVD3D3x0Tl+08KU0mTMuY82U3e6Lvg3SWa8LtquII2je3LX2PRkqEvoQEF3FCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:57:08.419966Z"},"content_sha256":"17c6d2ca4299686009208955e3cb315f21ec28f887774ef4b2d940975469256b","schema_version":"1.0","event_id":"sha256:17c6d2ca4299686009208955e3cb315f21ec28f887774ef4b2d940975469256b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NO5AJ4VMQSKW24CZOQRD2ZGIK5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sequential Recurrent Neural Networks for Language Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Clayton Greenberg, Dietrich Klakow, Mittul Singh, Youssef Oualil","submitted_at":"2017-03-23T13:48:45Z","abstract_excerpt":"Feedforward Neural Network (FNN)-based language models estimate the probability of the next word based on the history of the last N words, whereas Recurrent Neural Networks (RNN) perform the same task based only on the last word and some context information that cycles in the network. This paper presents a novel approach, which bridges the gap between these two categories of networks. In particular, we propose an architecture which takes advantage of the explicit, sequential enumeration of the word history in FNN structure while enhancing each word representation at the projection layer throug"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08068","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-18T00:48:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0eP4jM5wh4nHtatVFtFq1ocsYtLmnDTsTDQZzivA7kcw3tMqHi7bMjGACq36+kNHJnD0odindmXQdqj9DLxICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T07:57:08.420322Z"},"content_sha256":"f79dcff43ce43aad08a70340f45907ae22a647a126ba6d92635a649d38f5e219","schema_version":"1.0","event_id":"sha256:f79dcff43ce43aad08a70340f45907ae22a647a126ba6d92635a649d38f5e219"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NO5AJ4VMQSKW24CZOQRD2ZGIK5/bundle.json","state_url":"https://pith.science/pith/NO5AJ4VMQSKW24CZOQRD2ZGIK5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NO5AJ4VMQSKW24CZOQRD2ZGIK5/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-08-20T07:57:08Z","links":{"resolver":"https://pith.science/pith/NO5AJ4VMQSKW24CZOQRD2ZGIK5","bundle":"https://pith.science/pith/NO5AJ4VMQSKW24CZOQRD2ZGIK5/bundle.json","state":"https://pith.science/pith/NO5AJ4VMQSKW24CZOQRD2ZGIK5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NO5AJ4VMQSKW24CZOQRD2ZGIK5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NO5AJ4VMQSKW24CZOQRD2ZGIK5","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":"c5cceafc7fd5ebaf0e7b4664019df6935b857c4b49fd3766ce5afdc89107c1b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-23T13:48:45Z","title_canon_sha256":"029832e1075a7703af933ec7f9386ebb3c31ddfed1f6946e8505c077e7e36937"},"schema_version":"1.0","source":{"id":"1703.08068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.08068","created_at":"2026-05-18T00:48:03Z"},{"alias_kind":"arxiv_version","alias_value":"1703.08068v1","created_at":"2026-05-18T00:48:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.08068","created_at":"2026-05-18T00:48:03Z"},{"alias_kind":"pith_short_12","alias_value":"NO5AJ4VMQSKW","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"NO5AJ4VMQSKW24CZ","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"NO5AJ4VM","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:f79dcff43ce43aad08a70340f45907ae22a647a126ba6d92635a649d38f5e219","target":"graph","created_at":"2026-05-18T00:48:03Z","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":"Feedforward Neural Network (FNN)-based language models estimate the probability of the next word based on the history of the last N words, whereas Recurrent Neural Networks (RNN) perform the same task based only on the last word and some context information that cycles in the network. This paper presents a novel approach, which bridges the gap between these two categories of networks. In particular, we propose an architecture which takes advantage of the explicit, sequential enumeration of the word history in FNN structure while enhancing each word representation at the projection layer throug","authors_text":"Clayton Greenberg, Dietrich Klakow, Mittul Singh, Youssef Oualil","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-23T13:48:45Z","title":"Sequential Recurrent Neural Networks for Language Modeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.08068","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:17c6d2ca4299686009208955e3cb315f21ec28f887774ef4b2d940975469256b","target":"record","created_at":"2026-05-18T00:48:03Z","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":"c5cceafc7fd5ebaf0e7b4664019df6935b857c4b49fd3766ce5afdc89107c1b0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-03-23T13:48:45Z","title_canon_sha256":"029832e1075a7703af933ec7f9386ebb3c31ddfed1f6946e8505c077e7e36937"},"schema_version":"1.0","source":{"id":"1703.08068","kind":"arxiv","version":1}},"canonical_sha256":"6bba04f2ac84956d705974223d64c8577f1bf3fb4aee5bd0086bde783c991dea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bba04f2ac84956d705974223d64c8577f1bf3fb4aee5bd0086bde783c991dea","first_computed_at":"2026-05-18T00:48:03.977743Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:03.977743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JeLig9dox0uQPJVAw4EhjvDZGPauIPB1284iafkYNxlOnVcIPLnQovDUakdK8Un03DwMxL5Ls6WXFfd+HsPKCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:03.978433Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.08068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17c6d2ca4299686009208955e3cb315f21ec28f887774ef4b2d940975469256b","sha256:f79dcff43ce43aad08a70340f45907ae22a647a126ba6d92635a649d38f5e219"],"state_sha256":"a0c2ba20dd9359f274de62f52802133b7725fcc70c8036bd55d9b1ce38423107"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/hBspeFD+3zSy5DaIkUqI5WKKXWGnugNMAE0aZXFzAnrqD2ZuY2aBxYnOkQXoS6/iyiqh7fMHNbDDYoRpRKNAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T07:57:08.422695Z","bundle_sha256":"74ac5b46736b731f02d9ae87c77ad07e96abbcfe71e822a53f59ed03b01e16db"}}