{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:DQ3EXBHKL3MMVXLQIXOY34O2OB","short_pith_number":"pith:DQ3EXBHK","schema_version":"1.0","canonical_sha256":"1c364b84ea5ed8cadd7045dd8df1da70498c9d7373935af4d8fc9ebd7c0fba0c","source":{"kind":"arxiv","id":"2105.14092","version":6},"attestation_state":"computed","paper":{"title":"Least Redundant Gated Recurrent Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"{\\L}ukasz Lepak, {\\L}ukasz Neumann, Pawe{\\l} Wawrzy\\'nski","submitted_at":"2021-05-28T20:24:00Z","abstract_excerpt":"Recurrent neural networks are important tools for sequential data processing. However, they are notorious for problems regarding their training. Challenges include capturing complex relations between consecutive states and stability and efficiency of training. In this paper, we introduce a recurrent neural architecture called Deep Memory Update (DMU). It is based on updating the previous memory state with a deep transformation of the lagged state and the network input. The architecture is able to learn to transform its internal state using any nonlinear function. Its training is stable and fas"},"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":"2105.14092","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2021-05-28T20:24:00Z","cross_cats_sorted":[],"title_canon_sha256":"d2eef5eb0f6314539254f22edbe75f473eb47ca2ae2776df6cd8d5c54fda5d1b","abstract_canon_sha256":"6612a1bf3e4b87b704e6e8f3701e5724a469afb103d32842ad31fc3b762790ea"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:01:33.233589Z","signature_b64":"LVmC310Ut9wsSKlfH8UrOX8Lrpjib2uuzkOorT6GHnumCFWYmuinPb7zqrfmT2fEIoQSjlEUogJ1ehPG0WJVAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c364b84ea5ed8cadd7045dd8df1da70498c9d7373935af4d8fc9ebd7c0fba0c","last_reissued_at":"2026-07-05T06:01:33.233012Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:01:33.233012Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Least Redundant Gated Recurrent Neural Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.NE","authors_text":"{\\L}ukasz Lepak, {\\L}ukasz Neumann, Pawe{\\l} Wawrzy\\'nski","submitted_at":"2021-05-28T20:24:00Z","abstract_excerpt":"Recurrent neural networks are important tools for sequential data processing. However, they are notorious for problems regarding their training. Challenges include capturing complex relations between consecutive states and stability and efficiency of training. In this paper, we introduce a recurrent neural architecture called Deep Memory Update (DMU). It is based on updating the previous memory state with a deep transformation of the lagged state and the network input. The architecture is able to learn to transform its internal state using any nonlinear function. Its training is stable and fas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.14092","kind":"arxiv","version":6},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.14092/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.14092","created_at":"2026-07-05T06:01:33.233075+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.14092v6","created_at":"2026-07-05T06:01:33.233075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.14092","created_at":"2026-07-05T06:01:33.233075+00:00"},{"alias_kind":"pith_short_12","alias_value":"DQ3EXBHKL3MM","created_at":"2026-07-05T06:01:33.233075+00:00"},{"alias_kind":"pith_short_16","alias_value":"DQ3EXBHKL3MMVXLQ","created_at":"2026-07-05T06:01:33.233075+00:00"},{"alias_kind":"pith_short_8","alias_value":"DQ3EXBHK","created_at":"2026-07-05T06:01:33.233075+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/DQ3EXBHKL3MMVXLQIXOY34O2OB","json":"https://pith.science/pith/DQ3EXBHKL3MMVXLQIXOY34O2OB.json","graph_json":"https://pith.science/api/pith-number/DQ3EXBHKL3MMVXLQIXOY34O2OB/graph.json","events_json":"https://pith.science/api/pith-number/DQ3EXBHKL3MMVXLQIXOY34O2OB/events.json","paper":"https://pith.science/paper/DQ3EXBHK"},"agent_actions":{"view_html":"https://pith.science/pith/DQ3EXBHKL3MMVXLQIXOY34O2OB","download_json":"https://pith.science/pith/DQ3EXBHKL3MMVXLQIXOY34O2OB.json","view_paper":"https://pith.science/paper/DQ3EXBHK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.14092&json=true","fetch_graph":"https://pith.science/api/pith-number/DQ3EXBHKL3MMVXLQIXOY34O2OB/graph.json","fetch_events":"https://pith.science/api/pith-number/DQ3EXBHKL3MMVXLQIXOY34O2OB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DQ3EXBHKL3MMVXLQIXOY34O2OB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DQ3EXBHKL3MMVXLQIXOY34O2OB/action/storage_attestation","attest_author":"https://pith.science/pith/DQ3EXBHKL3MMVXLQIXOY34O2OB/action/author_attestation","sign_citation":"https://pith.science/pith/DQ3EXBHKL3MMVXLQIXOY34O2OB/action/citation_signature","submit_replication":"https://pith.science/pith/DQ3EXBHKL3MMVXLQIXOY34O2OB/action/replication_record"}},"created_at":"2026-07-05T06:01:33.233075+00:00","updated_at":"2026-07-05T06:01:33.233075+00:00"}