{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:65C46JBBARHIITFRB4M6QRC7L2","short_pith_number":"pith:65C46JBB","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"},"canonical_sha256":"f745cf2421044e844cb10f19e8445f5ebb9588d303757f0c51e33114effc14cf","source":{"kind":"arxiv","id":"1808.07658","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07658","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07658v1","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07658","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"pith_short_12","alias_value":"65C46JBBARHI","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"65C46JBBARHIITFR","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"65C46JBB","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:65C46JBBARHIITFRB4M6QRC7L2","target":"record","payload":{"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"},"canonical_sha256":"f745cf2421044e844cb10f19e8445f5ebb9588d303757f0c51e33114effc14cf","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"},"source_kind":"arxiv","source_id":"1808.07658","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QFm5YPfRSSKr2ObOxJrU/kqIWc2nnOsuyUR0GgThm047ieIOOzz9xh1ad2Y9ZmNmFuJ/0XDR6GeQXkO0H0dqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T07:14:55.262990Z"},"content_sha256":"4b9fd3dd6ace880a1fd8605eb97701e794362ccec660728199b471498dbc1b0f","schema_version":"1.0","event_id":"sha256:4b9fd3dd6ace880a1fd8605eb97701e794362ccec660728199b471498dbc1b0f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:65C46JBBARHIITFRB4M6QRC7L2","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:07:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eqli22nDblxsAtTD9rYU8JwDgyklmXX5WIf0FkyKmuNljQbWnzLBVIQQHHYl9Um9TEYBBbz0QDHika1E3+QwCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T07:14:55.263478Z"},"content_sha256":"e09b5d6487b725f88dd0eea5a7c6d1a0a2565ada27ca61ec0518f0b8250262af","schema_version":"1.0","event_id":"sha256:e09b5d6487b725f88dd0eea5a7c6d1a0a2565ada27ca61ec0518f0b8250262af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65C46JBBARHIITFRB4M6QRC7L2/bundle.json","state_url":"https://pith.science/pith/65C46JBBARHIITFRB4M6QRC7L2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65C46JBBARHIITFRB4M6QRC7L2/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T07:14:55Z","links":{"resolver":"https://pith.science/pith/65C46JBBARHIITFRB4M6QRC7L2","bundle":"https://pith.science/pith/65C46JBBARHIITFRB4M6QRC7L2/bundle.json","state":"https://pith.science/pith/65C46JBBARHIITFRB4M6QRC7L2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65C46JBBARHIITFRB4M6QRC7L2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:65C46JBBARHIITFRB4M6QRC7L2","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"07a70ea9c0933adc25d4aa142fc1eb8999d0231dc29cbbe16cf1788f00ed2001","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-23T08:07:44Z","title_canon_sha256":"d67095720342dcc4c80105d4f5ffd8760d6f76abd6c4f10d873381b5678f24ee"},"schema_version":"1.0","source":{"id":"1808.07658","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1808.07658","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"arxiv_version","alias_value":"1808.07658v1","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.07658","created_at":"2026-05-18T00:07:24Z"},{"alias_kind":"pith_short_12","alias_value":"65C46JBBARHI","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"65C46JBBARHIITFR","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"65C46JBB","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:e09b5d6487b725f88dd0eea5a7c6d1a0a2565ada27ca61ec0518f0b8250262af","target":"graph","created_at":"2026-05-18T00:07:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Junkun Chen, Kaiyu Chen, Xinchi Chen, Xipeng Qiu, Xuanjing Huang","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-23T08:07:44Z","title":"Exploring Shared Structures and Hierarchies for Multiple NLP Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.07658","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4b9fd3dd6ace880a1fd8605eb97701e794362ccec660728199b471498dbc1b0f","target":"record","created_at":"2026-05-18T00:07:24Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"07a70ea9c0933adc25d4aa142fc1eb8999d0231dc29cbbe16cf1788f00ed2001","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-08-23T08:07:44Z","title_canon_sha256":"d67095720342dcc4c80105d4f5ffd8760d6f76abd6c4f10d873381b5678f24ee"},"schema_version":"1.0","source":{"id":"1808.07658","kind":"arxiv","version":1}},"canonical_sha256":"f745cf2421044e844cb10f19e8445f5ebb9588d303757f0c51e33114effc14cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f745cf2421044e844cb10f19e8445f5ebb9588d303757f0c51e33114effc14cf","first_computed_at":"2026-05-18T00:07:24.567046Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:24.567046Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OV5v533w0WyhtBfVTsTEIFFtnv52k4k2d/ChuZCu7GMKpCBqBi73i6lPua5yzqtyawy5Vs6YPWRCBu1HeksADQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:24.567475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1808.07658","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b9fd3dd6ace880a1fd8605eb97701e794362ccec660728199b471498dbc1b0f","sha256:e09b5d6487b725f88dd0eea5a7c6d1a0a2565ada27ca61ec0518f0b8250262af"],"state_sha256":"ed978e621faa4e962978d0953eb83877f5f24fc9b32504260f30e2fa70a99e64"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cBVoxz6+gHIm1uJe8jX1lyU0Lw+kq++NHqi7vAh2pqJ59zc8QVvMruzyZCYwoqQrQuL54mDGm9bkimllRBPbCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T07:14:55.267079Z","bundle_sha256":"341d8fb24f7d24e73e7ea5a1c9c0ac863c930b5b8dd555c2fe85aaf534ddf8c9"}}