{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LHIAYG6EZZFWOOJ2GV5VMERBRI","short_pith_number":"pith:LHIAYG6E","schema_version":"1.0","canonical_sha256":"59d00c1bc4ce4b67393a357b5612218a36d34d93a1b95178d1a0a65949becb34","source":{"kind":"arxiv","id":"1610.03098","version":3},"attestation_state":"computed","paper":{"title":"Neural Paraphrase Generation with Stacked Residual LSTM Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Aaditya Prakash, Ashequl Qadir, Joey Liu, Kathy Lee, Oladimeji Farri, Sadid A. Hasan, Vivek Datla","submitted_at":"2016-10-10T21:01:00Z","abstract_excerpt":"In this paper, we propose a novel neural approach for paraphrase generation. Conventional para- phrase generation methods either leverage hand-written rules and thesauri-based alignments, or use statistical machine learning principles. To the best of our knowledge, this work is the first to explore deep learning models for paraphrase generation. Our primary contribution is a stacked residual LSTM network, where we add residual connections between LSTM layers. This allows for efficient training of deep LSTMs. We evaluate our model and other state-of-the-art deep learning models on three differe"},"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":"1610.03098","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-10-10T21:01:00Z","cross_cats_sorted":[],"title_canon_sha256":"1e0dc77bb7ce51a75b228c607e4fd5a5ba4976a29e7eabe9d579a8cafb48b472","abstract_canon_sha256":"26a5687909513c9cb3adc5f0c8dea4f470b3d34fe99cb4c99ae81789d37aeb7e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:23.261448Z","signature_b64":"Jgh68tzM+5wtk6L656Uqx0LprwQ9qsxCM2KEAt0BzWjO2sge/WnTSoa3gtHdBMJJexyAr8gdo3wIIvHDJBr6CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59d00c1bc4ce4b67393a357b5612218a36d34d93a1b95178d1a0a65949becb34","last_reissued_at":"2026-05-18T01:02:23.260777Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:23.260777Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Neural Paraphrase Generation with Stacked Residual LSTM Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Aaditya Prakash, Ashequl Qadir, Joey Liu, Kathy Lee, Oladimeji Farri, Sadid A. Hasan, Vivek Datla","submitted_at":"2016-10-10T21:01:00Z","abstract_excerpt":"In this paper, we propose a novel neural approach for paraphrase generation. Conventional para- phrase generation methods either leverage hand-written rules and thesauri-based alignments, or use statistical machine learning principles. To the best of our knowledge, this work is the first to explore deep learning models for paraphrase generation. Our primary contribution is a stacked residual LSTM network, where we add residual connections between LSTM layers. This allows for efficient training of deep LSTMs. We evaluate our model and other state-of-the-art deep learning models on three differe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03098","kind":"arxiv","version":3},"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":"1610.03098","created_at":"2026-05-18T01:02:23.260873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.03098v3","created_at":"2026-05-18T01:02:23.260873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03098","created_at":"2026-05-18T01:02:23.260873+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHIAYG6EZZFW","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHIAYG6EZZFWOOJ2","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHIAYG6E","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09741","citing_title":"Decomposable Neural Paraphrase Generation","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LHIAYG6EZZFWOOJ2GV5VMERBRI","json":"https://pith.science/pith/LHIAYG6EZZFWOOJ2GV5VMERBRI.json","graph_json":"https://pith.science/api/pith-number/LHIAYG6EZZFWOOJ2GV5VMERBRI/graph.json","events_json":"https://pith.science/api/pith-number/LHIAYG6EZZFWOOJ2GV5VMERBRI/events.json","paper":"https://pith.science/paper/LHIAYG6E"},"agent_actions":{"view_html":"https://pith.science/pith/LHIAYG6EZZFWOOJ2GV5VMERBRI","download_json":"https://pith.science/pith/LHIAYG6EZZFWOOJ2GV5VMERBRI.json","view_paper":"https://pith.science/paper/LHIAYG6E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.03098&json=true","fetch_graph":"https://pith.science/api/pith-number/LHIAYG6EZZFWOOJ2GV5VMERBRI/graph.json","fetch_events":"https://pith.science/api/pith-number/LHIAYG6EZZFWOOJ2GV5VMERBRI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHIAYG6EZZFWOOJ2GV5VMERBRI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHIAYG6EZZFWOOJ2GV5VMERBRI/action/storage_attestation","attest_author":"https://pith.science/pith/LHIAYG6EZZFWOOJ2GV5VMERBRI/action/author_attestation","sign_citation":"https://pith.science/pith/LHIAYG6EZZFWOOJ2GV5VMERBRI/action/citation_signature","submit_replication":"https://pith.science/pith/LHIAYG6EZZFWOOJ2GV5VMERBRI/action/replication_record"}},"created_at":"2026-05-18T01:02:23.260873+00:00","updated_at":"2026-05-18T01:02:23.260873+00:00"}