{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JDPTUEAWOXD23ZEBSIRJRLGXKO","short_pith_number":"pith:JDPTUEAW","schema_version":"1.0","canonical_sha256":"48df3a101675c7ade481922298acd753a5259368e6687d7d69fea4920d41e31d","source":{"kind":"arxiv","id":"1605.05101","version":1},"attestation_state":"computed","paper":{"title":"Recurrent Neural Network for Text Classification with Multi-Task Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Pengfei Liu, Xipeng Qiu, Xuanjing Huang","submitted_at":"2016-05-17T10:43:38Z","abstract_excerpt":"Neural network based methods have obtained great progress on a variety of natural language processing tasks. However, in most previous works, the models are learned based on single-task supervised objectives, which often suffer from insufficient training data. In this paper, we use the multi-task learning framework to jointly learn across multiple related tasks. Based on recurrent neural network, we propose three different mechanisms of sharing information to model text with task-specific and shared layers. The entire network is trained jointly on all these tasks. Experiments on four benchmark"},"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":"1605.05101","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2016-05-17T10:43:38Z","cross_cats_sorted":[],"title_canon_sha256":"06746b385541fe85a1380d8b85523b7e027faa67c001e14401cb0de77081bb4b","abstract_canon_sha256":"a8c7e45e0cb03afb20aebc5f2ff01e7e742b34cab38a8c28b7f186702a544ac2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:37.367914Z","signature_b64":"zxMyAL5c59sRWx4xwvjRguaCP8WVa5WDH8YJ0KunduYxQzFhKgfbGO4cKHA81/88UcLF7zl1DsJyLvIiZfDUAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48df3a101675c7ade481922298acd753a5259368e6687d7d69fea4920d41e31d","last_reissued_at":"2026-05-18T01:14:37.367346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:37.367346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recurrent Neural Network for Text Classification with Multi-Task Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Pengfei Liu, Xipeng Qiu, Xuanjing Huang","submitted_at":"2016-05-17T10:43:38Z","abstract_excerpt":"Neural network based methods have obtained great progress on a variety of natural language processing tasks. However, in most previous works, the models are learned based on single-task supervised objectives, which often suffer from insufficient training data. In this paper, we use the multi-task learning framework to jointly learn across multiple related tasks. Based on recurrent neural network, we propose three different mechanisms of sharing information to model text with task-specific and shared layers. The entire network is trained jointly on all these tasks. Experiments on four benchmark"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.05101","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1605.05101","created_at":"2026-05-18T01:14:37.367435+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.05101v1","created_at":"2026-05-18T01:14:37.367435+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.05101","created_at":"2026-05-18T01:14:37.367435+00:00"},{"alias_kind":"pith_short_12","alias_value":"JDPTUEAWOXD2","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JDPTUEAWOXD23ZEB","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JDPTUEAW","created_at":"2026-05-18T12:30:25.849896+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.06477","citing_title":"GeoStack: A Framework for Quasi-Abelian Knowledge Composition in VLMs","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JDPTUEAWOXD23ZEBSIRJRLGXKO","json":"https://pith.science/pith/JDPTUEAWOXD23ZEBSIRJRLGXKO.json","graph_json":"https://pith.science/api/pith-number/JDPTUEAWOXD23ZEBSIRJRLGXKO/graph.json","events_json":"https://pith.science/api/pith-number/JDPTUEAWOXD23ZEBSIRJRLGXKO/events.json","paper":"https://pith.science/paper/JDPTUEAW"},"agent_actions":{"view_html":"https://pith.science/pith/JDPTUEAWOXD23ZEBSIRJRLGXKO","download_json":"https://pith.science/pith/JDPTUEAWOXD23ZEBSIRJRLGXKO.json","view_paper":"https://pith.science/paper/JDPTUEAW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.05101&json=true","fetch_graph":"https://pith.science/api/pith-number/JDPTUEAWOXD23ZEBSIRJRLGXKO/graph.json","fetch_events":"https://pith.science/api/pith-number/JDPTUEAWOXD23ZEBSIRJRLGXKO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JDPTUEAWOXD23ZEBSIRJRLGXKO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JDPTUEAWOXD23ZEBSIRJRLGXKO/action/storage_attestation","attest_author":"https://pith.science/pith/JDPTUEAWOXD23ZEBSIRJRLGXKO/action/author_attestation","sign_citation":"https://pith.science/pith/JDPTUEAWOXD23ZEBSIRJRLGXKO/action/citation_signature","submit_replication":"https://pith.science/pith/JDPTUEAWOXD23ZEBSIRJRLGXKO/action/replication_record"}},"created_at":"2026-05-18T01:14:37.367435+00:00","updated_at":"2026-05-18T01:14:37.367435+00:00"}