{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:65C46JBBARHIITFRB4M6QRC7L2","short_pith_number":"pith:65C46JBB","schema_version":"1.0","canonical_sha256":"f745cf2421044e844cb10f19e8445f5ebb9588d303757f0c51e33114effc14cf","source":{"kind":"arxiv","id":"1808.07658","version":1},"attestation_state":"computed","paper":{"title":"Exploring Shared Structures and Hierarchies for Multiple NLP Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Junkun Chen, Kaiyu Chen, Xinchi Chen, Xipeng Qiu, Xuanjing Huang","submitted_at":"2018-08-23T08:07:44Z","abstract_excerpt":"Designing shared neural architecture plays an important role in multi-task learning. The challenge is that finding an optimal sharing scheme heavily relies on the expert knowledge and is not scalable to a large number of diverse tasks. Inspired by the promising work of neural architecture search (NAS), we apply reinforcement learning to automatically find possible shared architecture for multi-task learning. Specifically, we use a controller to select from a set of shareable modules and assemble a task-specific architecture, and repeat the same procedure for other tasks. The controller is trai"},"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":"1808.07658","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-23T08:07:44Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"d67095720342dcc4c80105d4f5ffd8760d6f76abd6c4f10d873381b5678f24ee","abstract_canon_sha256":"07a70ea9c0933adc25d4aa142fc1eb8999d0231dc29cbbe16cf1788f00ed2001"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:24.567475Z","signature_b64":"OV5v533w0WyhtBfVTsTEIFFtnv52k4k2d/ChuZCu7GMKpCBqBi73i6lPua5yzqtyawy5Vs6YPWRCBu1HeksADQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f745cf2421044e844cb10f19e8445f5ebb9588d303757f0c51e33114effc14cf","last_reissued_at":"2026-05-18T00:07:24.567046Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:24.567046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Shared Structures and Hierarchies for Multiple NLP Tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.AI","authors_text":"Junkun Chen, Kaiyu Chen, Xinchi Chen, Xipeng Qiu, Xuanjing Huang","submitted_at":"2018-08-23T08:07:44Z","abstract_excerpt":"Designing shared neural architecture plays an important role in multi-task learning. The challenge is that finding an optimal sharing scheme heavily relies on the expert knowledge and is not scalable to a large number of diverse tasks. Inspired by the promising work of neural architecture search (NAS), we apply reinforcement learning to automatically find possible shared architecture for multi-task learning. Specifically, we use a controller to select from a set of shareable modules and assemble a task-specific architecture, and repeat the same procedure for other tasks. The controller is trai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07658","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":"1808.07658","created_at":"2026-05-18T00:07:24.567110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.07658v1","created_at":"2026-05-18T00:07:24.567110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07658","created_at":"2026-05-18T00:07:24.567110+00:00"},{"alias_kind":"pith_short_12","alias_value":"65C46JBBARHI","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"65C46JBBARHIITFR","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"65C46JBB","created_at":"2026-05-18T12:32:08.215937+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/65C46JBBARHIITFRB4M6QRC7L2","json":"https://pith.science/pith/65C46JBBARHIITFRB4M6QRC7L2.json","graph_json":"https://pith.science/api/pith-number/65C46JBBARHIITFRB4M6QRC7L2/graph.json","events_json":"https://pith.science/api/pith-number/65C46JBBARHIITFRB4M6QRC7L2/events.json","paper":"https://pith.science/paper/65C46JBB"},"agent_actions":{"view_html":"https://pith.science/pith/65C46JBBARHIITFRB4M6QRC7L2","download_json":"https://pith.science/pith/65C46JBBARHIITFRB4M6QRC7L2.json","view_paper":"https://pith.science/paper/65C46JBB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.07658&json=true","fetch_graph":"https://pith.science/api/pith-number/65C46JBBARHIITFRB4M6QRC7L2/graph.json","fetch_events":"https://pith.science/api/pith-number/65C46JBBARHIITFRB4M6QRC7L2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65C46JBBARHIITFRB4M6QRC7L2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65C46JBBARHIITFRB4M6QRC7L2/action/storage_attestation","attest_author":"https://pith.science/pith/65C46JBBARHIITFRB4M6QRC7L2/action/author_attestation","sign_citation":"https://pith.science/pith/65C46JBBARHIITFRB4M6QRC7L2/action/citation_signature","submit_replication":"https://pith.science/pith/65C46JBBARHIITFRB4M6QRC7L2/action/replication_record"}},"created_at":"2026-05-18T00:07:24.567110+00:00","updated_at":"2026-05-18T00:07:24.567110+00:00"}