{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7REY652LKDBNLN5NCGZKRE5UIX","short_pith_number":"pith:7REY652L","schema_version":"1.0","canonical_sha256":"fc498f774b50c2d5b7ad11b2a893b445ea6c13870c2ceb2a8b9ca9c1a5a8bde5","source":{"kind":"arxiv","id":"1811.10211","version":1},"attestation_state":"computed","paper":{"title":"Multi-task Learning over Graph Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jackie Chi Kit Cheung, Jie Fu, Pengfei Liu, Xipeng Qiu, Yue Dong","submitted_at":"2018-11-26T06:54:51Z","abstract_excerpt":"We present two architectures for multi-task learning with neural sequence models. Our approach allows the relationships between different tasks to be learned dynamically, rather than using an ad-hoc pre-defined structure as in previous work. We adopt the idea from message-passing graph neural networks and propose a general \\textbf{graph multi-task learning} framework in which different tasks can communicate with each other in an effective and interpretable way. We conduct extensive experiments in text classification and sequence labeling to evaluate our approach on multi-task learning and tran"},"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":"1811.10211","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CL","submitted_at":"2018-11-26T06:54:51Z","cross_cats_sorted":[],"title_canon_sha256":"7cc0c53eeba6beec2ebf4e79eb49ed95b9066a1680c48233e120b79146165853","abstract_canon_sha256":"07e6e68cc51107a68373e8bdc7351eeff234491c6a232cb1d3e450adac9fc511"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:57.112700Z","signature_b64":"4TKxqYOO1+5mG3vp2MoDKiZEjL/GvqiEYOws/1RyV3V9sepDNoA7oGxSnv3Eof6yqrfqemN1ZxqzkdWESlWZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc498f774b50c2d5b7ad11b2a893b445ea6c13870c2ceb2a8b9ca9c1a5a8bde5","last_reissued_at":"2026-05-17T23:59:57.112283Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:57.112283Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-task Learning over Graph Structures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CL","authors_text":"Jackie Chi Kit Cheung, Jie Fu, Pengfei Liu, Xipeng Qiu, Yue Dong","submitted_at":"2018-11-26T06:54:51Z","abstract_excerpt":"We present two architectures for multi-task learning with neural sequence models. Our approach allows the relationships between different tasks to be learned dynamically, rather than using an ad-hoc pre-defined structure as in previous work. We adopt the idea from message-passing graph neural networks and propose a general \\textbf{graph multi-task learning} framework in which different tasks can communicate with each other in an effective and interpretable way. We conduct extensive experiments in text classification and sequence labeling to evaluate our approach on multi-task learning and tran"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10211","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":"1811.10211","created_at":"2026-05-17T23:59:57.112345+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.10211v1","created_at":"2026-05-17T23:59:57.112345+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10211","created_at":"2026-05-17T23:59:57.112345+00:00"},{"alias_kind":"pith_short_12","alias_value":"7REY652LKDBN","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7REY652LKDBNLN5N","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7REY652L","created_at":"2026-05-18T12:32:11.075285+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/7REY652LKDBNLN5NCGZKRE5UIX","json":"https://pith.science/pith/7REY652LKDBNLN5NCGZKRE5UIX.json","graph_json":"https://pith.science/api/pith-number/7REY652LKDBNLN5NCGZKRE5UIX/graph.json","events_json":"https://pith.science/api/pith-number/7REY652LKDBNLN5NCGZKRE5UIX/events.json","paper":"https://pith.science/paper/7REY652L"},"agent_actions":{"view_html":"https://pith.science/pith/7REY652LKDBNLN5NCGZKRE5UIX","download_json":"https://pith.science/pith/7REY652LKDBNLN5NCGZKRE5UIX.json","view_paper":"https://pith.science/paper/7REY652L","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.10211&json=true","fetch_graph":"https://pith.science/api/pith-number/7REY652LKDBNLN5NCGZKRE5UIX/graph.json","fetch_events":"https://pith.science/api/pith-number/7REY652LKDBNLN5NCGZKRE5UIX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7REY652LKDBNLN5NCGZKRE5UIX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7REY652LKDBNLN5NCGZKRE5UIX/action/storage_attestation","attest_author":"https://pith.science/pith/7REY652LKDBNLN5NCGZKRE5UIX/action/author_attestation","sign_citation":"https://pith.science/pith/7REY652LKDBNLN5NCGZKRE5UIX/action/citation_signature","submit_replication":"https://pith.science/pith/7REY652LKDBNLN5NCGZKRE5UIX/action/replication_record"}},"created_at":"2026-05-17T23:59:57.112345+00:00","updated_at":"2026-05-17T23:59:57.112345+00:00"}