{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NLHNXJWXDDPQ25D74UYW2YK7KE","short_pith_number":"pith:NLHNXJWX","schema_version":"1.0","canonical_sha256":"6acedba6d718df0d747fe5316d615f510293cfcc4d33573e4a19100cbd7d9916","source":{"kind":"arxiv","id":"1603.05118","version":2},"attestation_state":"computed","paper":{"title":"Recurrent Dropout without Memory Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Aliaksei Severyn, Erhardt Barth, Stanislau Semeniuta","submitted_at":"2016-03-16T14:33:47Z","abstract_excerpt":"This paper presents a novel approach to recurrent neural network (RNN) regularization. Differently from the widely adopted dropout method, which is applied to \\textit{forward} connections of feed-forward architectures or RNNs, we propose to drop neurons directly in \\textit{recurrent} connections in a way that does not cause loss of long-term memory. Our approach is as easy to implement and apply as the regular feed-forward dropout and we demonstrate its effectiveness for Long Short-Term Memory network, the most popular type of RNN cells. Our experiments on NLP benchmarks show consistent improv"},"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":"1603.05118","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-03-16T14:33:47Z","cross_cats_sorted":[],"title_canon_sha256":"a0bed0c0b9006a6f7feb8c3841042aca8d9702a1620ee1b97e7800bf48a93716","abstract_canon_sha256":"84ea21b36e48270a286ad97d3eea8e5e835498e111f8e906093a45f0e4990b33"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:45.479994Z","signature_b64":"ltw+uU34dqJIGcG935QtOkOH/9NzJAGy7uzm2Lav+iW2J8GRf32TdbCiM3+pmAlcHWpma0bvihRmQtpkiYdWCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6acedba6d718df0d747fe5316d615f510293cfcc4d33573e4a19100cbd7d9916","last_reissued_at":"2026-05-18T01:09:45.479334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:45.479334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recurrent Dropout without Memory Loss","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Aliaksei Severyn, Erhardt Barth, Stanislau Semeniuta","submitted_at":"2016-03-16T14:33:47Z","abstract_excerpt":"This paper presents a novel approach to recurrent neural network (RNN) regularization. Differently from the widely adopted dropout method, which is applied to \\textit{forward} connections of feed-forward architectures or RNNs, we propose to drop neurons directly in \\textit{recurrent} connections in a way that does not cause loss of long-term memory. Our approach is as easy to implement and apply as the regular feed-forward dropout and we demonstrate its effectiveness for Long Short-Term Memory network, the most popular type of RNN cells. Our experiments on NLP benchmarks show consistent improv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.05118","kind":"arxiv","version":2},"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":"1603.05118","created_at":"2026-05-18T01:09:45.479443+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.05118v2","created_at":"2026-05-18T01:09:45.479443+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.05118","created_at":"2026-05-18T01:09:45.479443+00:00"},{"alias_kind":"pith_short_12","alias_value":"NLHNXJWXDDPQ","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"NLHNXJWXDDPQ25D7","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"NLHNXJWX","created_at":"2026-05-18T12:30:32.724797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.11065","citing_title":"DropAttention: A Regularization Method for Fully-Connected Self-Attention Networks","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NLHNXJWXDDPQ25D74UYW2YK7KE","json":"https://pith.science/pith/NLHNXJWXDDPQ25D74UYW2YK7KE.json","graph_json":"https://pith.science/api/pith-number/NLHNXJWXDDPQ25D74UYW2YK7KE/graph.json","events_json":"https://pith.science/api/pith-number/NLHNXJWXDDPQ25D74UYW2YK7KE/events.json","paper":"https://pith.science/paper/NLHNXJWX"},"agent_actions":{"view_html":"https://pith.science/pith/NLHNXJWXDDPQ25D74UYW2YK7KE","download_json":"https://pith.science/pith/NLHNXJWXDDPQ25D74UYW2YK7KE.json","view_paper":"https://pith.science/paper/NLHNXJWX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.05118&json=true","fetch_graph":"https://pith.science/api/pith-number/NLHNXJWXDDPQ25D74UYW2YK7KE/graph.json","fetch_events":"https://pith.science/api/pith-number/NLHNXJWXDDPQ25D74UYW2YK7KE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NLHNXJWXDDPQ25D74UYW2YK7KE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NLHNXJWXDDPQ25D74UYW2YK7KE/action/storage_attestation","attest_author":"https://pith.science/pith/NLHNXJWXDDPQ25D74UYW2YK7KE/action/author_attestation","sign_citation":"https://pith.science/pith/NLHNXJWXDDPQ25D74UYW2YK7KE/action/citation_signature","submit_replication":"https://pith.science/pith/NLHNXJWXDDPQ25D74UYW2YK7KE/action/replication_record"}},"created_at":"2026-05-18T01:09:45.479443+00:00","updated_at":"2026-05-18T01:09:45.479443+00:00"}