{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:WIT4DFNRIZ63M7OE3GN7KQVPYW","short_pith_number":"pith:WIT4DFNR","canonical_record":{"source":{"id":"1905.13324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-30T21:40:46Z","cross_cats_sorted":[],"title_canon_sha256":"4360df92df8d1f797cb0e94c960c9fd0f882475a69798f76f9939f9e0de1bec1","abstract_canon_sha256":"d7f7582c86eb10b8c2ea7cd93517cb252796f04231a004925bae848ab56a0b16"},"schema_version":"1.0"},"canonical_sha256":"b227c195b1467db67dc4d99bf542afc59e2db6ec6c06e5ed5f731d0158473f91","source":{"kind":"arxiv","id":"1905.13324","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13324","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13324v1","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13324","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"WIT4DFNRIZ63","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WIT4DFNRIZ63M7OE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WIT4DFNR","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:WIT4DFNRIZ63M7OE3GN7KQVPYW","target":"record","payload":{"canonical_record":{"source":{"id":"1905.13324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-30T21:40:46Z","cross_cats_sorted":[],"title_canon_sha256":"4360df92df8d1f797cb0e94c960c9fd0f882475a69798f76f9939f9e0de1bec1","abstract_canon_sha256":"d7f7582c86eb10b8c2ea7cd93517cb252796f04231a004925bae848ab56a0b16"},"schema_version":"1.0"},"canonical_sha256":"b227c195b1467db67dc4d99bf542afc59e2db6ec6c06e5ed5f731d0158473f91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:35.297245Z","signature_b64":"fybicd9oX+LQH88K7O6aShA5CvLTmIS30qBKxGLdUBtpbDw/euyEwoNqjqtOi/YUNLV+ESETesMEcn60opcnCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b227c195b1467db67dc4d99bf542afc59e2db6ec6c06e5ed5f731d0158473f91","last_reissued_at":"2026-05-17T23:44:35.296750Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:35.296750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.13324","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-17T23:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N6QNhuurwrB2lyxBt77WqleAhW54eesXna9Xw4B8Kv8ZXPRJV2crdcRzlO3Bzl5FH4iIyLar4HtWaNbLACdKDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:59:55.092424Z"},"content_sha256":"8f1d65edaa9f8cc50dd0183d4834bb9950b4b7e61a48d44c4f510064c32e3dc5","schema_version":"1.0","event_id":"sha256:8f1d65edaa9f8cc50dd0183d4834bb9950b4b7e61a48d44c4f510064c32e3dc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:WIT4DFNRIZ63M7OE3GN7KQVPYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lightweight Recurrent Network for Sequence Modeling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Biao Zhang, Rico Sennrich","submitted_at":"2019-05-30T21:40:46Z","abstract_excerpt":"Recurrent networks have achieved great success on various sequential tasks with the assistance of complex recurrent units, but suffer from severe computational inefficiency due to weak parallelization. One direction to alleviate this issue is to shift heavy computations outside the recurrence. In this paper, we propose a lightweight recurrent network, or LRN. LRN uses input and forget gates to handle long-range dependencies as well as gradient vanishing and explosion, with all parameter related calculations factored outside the recurrence. The recurrence in LRN only manipulates the weight assi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13324","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-17T23:44:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JLpD7WjMNWHtaI5BY3yOi/KbNZlSCftqOEJ9VAEUnrT68SXqrQ1nYb+uVgh9/DuhOW4Oh+7gcH4GxifiyVvvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:59:55.093118Z"},"content_sha256":"6d74d6211b9f9547a5c0f643feb4984f08db80cfb7a2038c8fa420f52645c1bd","schema_version":"1.0","event_id":"sha256:6d74d6211b9f9547a5c0f643feb4984f08db80cfb7a2038c8fa420f52645c1bd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIT4DFNRIZ63M7OE3GN7KQVPYW/bundle.json","state_url":"https://pith.science/pith/WIT4DFNRIZ63M7OE3GN7KQVPYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIT4DFNRIZ63M7OE3GN7KQVPYW/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-25T04:59:55Z","links":{"resolver":"https://pith.science/pith/WIT4DFNRIZ63M7OE3GN7KQVPYW","bundle":"https://pith.science/pith/WIT4DFNRIZ63M7OE3GN7KQVPYW/bundle.json","state":"https://pith.science/pith/WIT4DFNRIZ63M7OE3GN7KQVPYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIT4DFNRIZ63M7OE3GN7KQVPYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:WIT4DFNRIZ63M7OE3GN7KQVPYW","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":"d7f7582c86eb10b8c2ea7cd93517cb252796f04231a004925bae848ab56a0b16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-30T21:40:46Z","title_canon_sha256":"4360df92df8d1f797cb0e94c960c9fd0f882475a69798f76f9939f9e0de1bec1"},"schema_version":"1.0","source":{"id":"1905.13324","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.13324","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"arxiv_version","alias_value":"1905.13324v1","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.13324","created_at":"2026-05-17T23:44:35Z"},{"alias_kind":"pith_short_12","alias_value":"WIT4DFNRIZ63","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"WIT4DFNRIZ63M7OE","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"WIT4DFNR","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:6d74d6211b9f9547a5c0f643feb4984f08db80cfb7a2038c8fa420f52645c1bd","target":"graph","created_at":"2026-05-17T23:44:35Z","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":"Recurrent networks have achieved great success on various sequential tasks with the assistance of complex recurrent units, but suffer from severe computational inefficiency due to weak parallelization. One direction to alleviate this issue is to shift heavy computations outside the recurrence. In this paper, we propose a lightweight recurrent network, or LRN. LRN uses input and forget gates to handle long-range dependencies as well as gradient vanishing and explosion, with all parameter related calculations factored outside the recurrence. The recurrence in LRN only manipulates the weight assi","authors_text":"Biao Zhang, Rico Sennrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-30T21:40:46Z","title":"A Lightweight Recurrent Network for Sequence Modeling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.13324","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:8f1d65edaa9f8cc50dd0183d4834bb9950b4b7e61a48d44c4f510064c32e3dc5","target":"record","created_at":"2026-05-17T23:44:35Z","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":"d7f7582c86eb10b8c2ea7cd93517cb252796f04231a004925bae848ab56a0b16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2019-05-30T21:40:46Z","title_canon_sha256":"4360df92df8d1f797cb0e94c960c9fd0f882475a69798f76f9939f9e0de1bec1"},"schema_version":"1.0","source":{"id":"1905.13324","kind":"arxiv","version":1}},"canonical_sha256":"b227c195b1467db67dc4d99bf542afc59e2db6ec6c06e5ed5f731d0158473f91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b227c195b1467db67dc4d99bf542afc59e2db6ec6c06e5ed5f731d0158473f91","first_computed_at":"2026-05-17T23:44:35.296750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:35.296750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fybicd9oX+LQH88K7O6aShA5CvLTmIS30qBKxGLdUBtpbDw/euyEwoNqjqtOi/YUNLV+ESETesMEcn60opcnCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:35.297245Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.13324","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f1d65edaa9f8cc50dd0183d4834bb9950b4b7e61a48d44c4f510064c32e3dc5","sha256:6d74d6211b9f9547a5c0f643feb4984f08db80cfb7a2038c8fa420f52645c1bd"],"state_sha256":"80986a970e74358d748f1d91ea99cf9a7fda76a547298b8061687c4ff82f7cd5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q69uwDi8BlEez7Z/aBqapiV5dI0JSTa2id4XaIYdoo0VLjRrF+slBOO+MxFdKMNVx1LyBn5ZCf1lujuSThn7BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:59:55.096873Z","bundle_sha256":"58e7334dbe45ba2e7375c073f2f0c660f123ad45de6b8a71a5931c1a4e1bb9ad"}}