{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CMG7JD3SGUT2TSBBLAFYY27KTP","short_pith_number":"pith:CMG7JD3S","canonical_record":{"source":{"id":"1704.05742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-19T14:17:25Z","cross_cats_sorted":[],"title_canon_sha256":"200a3ee0958361ff6d37203b78c2786d5b1c52da298e50228f7f3f86ca291281","abstract_canon_sha256":"ef332024a0794ae8257fc7f452ac5793d7d1f378b9ec055d47f5ddbe5b672362"},"schema_version":"1.0"},"canonical_sha256":"130df48f723527a9c821580b8c6bea9bfa22753b1591de93062cdb4313ebbf8c","source":{"kind":"arxiv","id":"1704.05742","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05742","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05742v1","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05742","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"pith_short_12","alias_value":"CMG7JD3SGUT2","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CMG7JD3SGUT2TSBB","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CMG7JD3S","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CMG7JD3SGUT2TSBBLAFYY27KTP","target":"record","payload":{"canonical_record":{"source":{"id":"1704.05742","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-19T14:17:25Z","cross_cats_sorted":[],"title_canon_sha256":"200a3ee0958361ff6d37203b78c2786d5b1c52da298e50228f7f3f86ca291281","abstract_canon_sha256":"ef332024a0794ae8257fc7f452ac5793d7d1f378b9ec055d47f5ddbe5b672362"},"schema_version":"1.0"},"canonical_sha256":"130df48f723527a9c821580b8c6bea9bfa22753b1591de93062cdb4313ebbf8c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:06.651515Z","signature_b64":"HTrSjDvm8gBYRx0bQ51Fmj55meoVX9fBaexMGwOTbkZ3GDpPXMxxCgVuvnhBiwqskDeipevf+dFSiOA1L3ipDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"130df48f723527a9c821580b8c6bea9bfa22753b1591de93062cdb4313ebbf8c","last_reissued_at":"2026-05-18T00:46:06.650669Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:06.650669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.05742","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:46:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PQtKRUAMfTZ7suk+0OZ9Wq7wyu6VblUqlTKs+ZL6uu1dDj/HOzzv1DlHjk4KArlvyeWvs4yLRukWlYOf9q+9Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:09:59.870875Z"},"content_sha256":"a3e616b89a8d3b3ee58c063ba6b893004c87f26a15981c175934456eaf094613","schema_version":"1.0","event_id":"sha256:a3e616b89a8d3b3ee58c063ba6b893004c87f26a15981c175934456eaf094613"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CMG7JD3SGUT2TSBBLAFYY27KTP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarial Multi-task Learning for Text Classification","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":"2017-04-19T14:17:25Z","abstract_excerpt":"Neural network models have shown their promising opportunities for multi-task learning, which focus on learning the shared layers to extract the common and task-invariant features. However, in most existing approaches, the extracted shared features are prone to be contaminated by task-specific features or the noise brought by other tasks. In this paper, we propose an adversarial multi-task learning framework, alleviating the shared and private latent feature spaces from interfering with each other. We conduct extensive experiments on 16 different text classification tasks, which demonstrates t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05742","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:46:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y52u4015g7rYD4e1aGnNteLJsH7CBkyhrizsPLul6R5oKOtehjw9Slaw6xZNYAacTewkB2GorkO6iT94zBIkCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T08:09:59.871432Z"},"content_sha256":"070594e93750bd0f85a9c2b36903b3b63d5d73a63f022d67ae413402c647e093","schema_version":"1.0","event_id":"sha256:070594e93750bd0f85a9c2b36903b3b63d5d73a63f022d67ae413402c647e093"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CMG7JD3SGUT2TSBBLAFYY27KTP/bundle.json","state_url":"https://pith.science/pith/CMG7JD3SGUT2TSBBLAFYY27KTP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CMG7JD3SGUT2TSBBLAFYY27KTP/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-23T08:09:59Z","links":{"resolver":"https://pith.science/pith/CMG7JD3SGUT2TSBBLAFYY27KTP","bundle":"https://pith.science/pith/CMG7JD3SGUT2TSBBLAFYY27KTP/bundle.json","state":"https://pith.science/pith/CMG7JD3SGUT2TSBBLAFYY27KTP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CMG7JD3SGUT2TSBBLAFYY27KTP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CMG7JD3SGUT2TSBBLAFYY27KTP","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":"ef332024a0794ae8257fc7f452ac5793d7d1f378b9ec055d47f5ddbe5b672362","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-19T14:17:25Z","title_canon_sha256":"200a3ee0958361ff6d37203b78c2786d5b1c52da298e50228f7f3f86ca291281"},"schema_version":"1.0","source":{"id":"1704.05742","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.05742","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"arxiv_version","alias_value":"1704.05742v1","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.05742","created_at":"2026-05-18T00:46:06Z"},{"alias_kind":"pith_short_12","alias_value":"CMG7JD3SGUT2","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CMG7JD3SGUT2TSBB","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CMG7JD3S","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:070594e93750bd0f85a9c2b36903b3b63d5d73a63f022d67ae413402c647e093","target":"graph","created_at":"2026-05-18T00:46:06Z","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":"Neural network models have shown their promising opportunities for multi-task learning, which focus on learning the shared layers to extract the common and task-invariant features. However, in most existing approaches, the extracted shared features are prone to be contaminated by task-specific features or the noise brought by other tasks. In this paper, we propose an adversarial multi-task learning framework, alleviating the shared and private latent feature spaces from interfering with each other. We conduct extensive experiments on 16 different text classification tasks, which demonstrates t","authors_text":"Pengfei Liu, Xipeng Qiu, Xuanjing Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-19T14:17:25Z","title":"Adversarial Multi-task Learning for Text Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.05742","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:a3e616b89a8d3b3ee58c063ba6b893004c87f26a15981c175934456eaf094613","target":"record","created_at":"2026-05-18T00:46:06Z","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":"ef332024a0794ae8257fc7f452ac5793d7d1f378b9ec055d47f5ddbe5b672362","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2017-04-19T14:17:25Z","title_canon_sha256":"200a3ee0958361ff6d37203b78c2786d5b1c52da298e50228f7f3f86ca291281"},"schema_version":"1.0","source":{"id":"1704.05742","kind":"arxiv","version":1}},"canonical_sha256":"130df48f723527a9c821580b8c6bea9bfa22753b1591de93062cdb4313ebbf8c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"130df48f723527a9c821580b8c6bea9bfa22753b1591de93062cdb4313ebbf8c","first_computed_at":"2026-05-18T00:46:06.650669Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:06.650669Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HTrSjDvm8gBYRx0bQ51Fmj55meoVX9fBaexMGwOTbkZ3GDpPXMxxCgVuvnhBiwqskDeipevf+dFSiOA1L3ipDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:06.651515Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.05742","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a3e616b89a8d3b3ee58c063ba6b893004c87f26a15981c175934456eaf094613","sha256:070594e93750bd0f85a9c2b36903b3b63d5d73a63f022d67ae413402c647e093"],"state_sha256":"acc00068f07ed08e93f47710c71d7836921c02da3f917dd86a55674a9d97de7f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q00JrVX5M16X+y/Ql0JPnbGTEuKONvScb0yTZUL1v3GE2T9e+n42EuNacRnY0y20W6+ob+ue2SGc6Cvck+GIDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T08:09:59.874656Z","bundle_sha256":"ee32ad7199947753a789b9ede98daf3a178ee38b9b38de5d6cb98f26996cd1df"}}