{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ZSJV5UANMAKXJAFBYO34UBWAHB","short_pith_number":"pith:ZSJV5UAN","canonical_record":{"source":{"id":"1805.07541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-19T08:07:30Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"4dc398dad4c80872292baab2f6c731e0248ff5262049dbcf3edded98cc0d6161","abstract_canon_sha256":"55faef7cfc6192f45049bbd2055cb575eda4e2af5b3d86469ba25620dc6dce60"},"schema_version":"1.0"},"canonical_sha256":"cc935ed00d60157480a1c3b7ca06c0386106d23d01a1e23b39a42b173f1fd661","source":{"kind":"arxiv","id":"1805.07541","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07541","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07541v1","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07541","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZSJV5UANMAKX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZSJV5UANMAKXJAFB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZSJV5UAN","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ZSJV5UANMAKXJAFBYO34UBWAHB","target":"record","payload":{"canonical_record":{"source":{"id":"1805.07541","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-19T08:07:30Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"4dc398dad4c80872292baab2f6c731e0248ff5262049dbcf3edded98cc0d6161","abstract_canon_sha256":"55faef7cfc6192f45049bbd2055cb575eda4e2af5b3d86469ba25620dc6dce60"},"schema_version":"1.0"},"canonical_sha256":"cc935ed00d60157480a1c3b7ca06c0386106d23d01a1e23b39a42b173f1fd661","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:33.339153Z","signature_b64":"h7liL0XgSAZ2XVYsmFnM9lAbCkz9uLKHqkxNVdcUOG2o43Uf9npkSFnHk5mjYNY/QfShz1o+rr6+CXnss+fFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cc935ed00d60157480a1c3b7ca06c0386106d23d01a1e23b39a42b173f1fd661","last_reissued_at":"2026-05-18T00:15:33.338657Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:33.338657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.07541","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:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CvSJO5rBbjUUklBpHPnrr1kR0kgbp+DBpYHMO1j1KceedPtn23wRhTwIHt4KoVzF+fIw1FmfbjzuBoI4jQzgBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:08:27.539339Z"},"content_sha256":"24a78cd35c908f521b7f31f70ffe586c625e5d5fdcfa6acf28d913a15817c20a","schema_version":"1.0","event_id":"sha256:24a78cd35c908f521b7f31f70ffe586c625e5d5fdcfa6acf28d913a15817c20a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ZSJV5UANMAKXJAFBYO34UBWAHB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning to Multitask","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Qiang Yang, Ying Wei, Yu Zhang","submitted_at":"2018-05-19T08:07:30Z","abstract_excerpt":"Multitask learning has shown promising performance in many applications and many multitask models have been proposed. In order to identify an effective multitask model for a given multitask problem, we propose a learning framework called learning to multitask (L2MT). To achieve the goal, L2MT exploits historical multitask experience which is organized as a training set consists of several tuples, each of which contains a multitask problem with multiple tasks, a multitask model, and the relative test error. Based on such training set, L2MT first uses a proposed layerwise graph neural network to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07541","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:15:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CfC62jxD+p02fVvhSXsjMJ3Is0QsG6KvodykSc7QeXVBb1E9W061K6giZAG1Ur8/6jr6MtTud1FTIJALWHALDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T16:08:27.539964Z"},"content_sha256":"f818966427e67bb95e38943575ba54965b6d92d3a21deb64a42e4c29a283e786","schema_version":"1.0","event_id":"sha256:f818966427e67bb95e38943575ba54965b6d92d3a21deb64a42e4c29a283e786"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZSJV5UANMAKXJAFBYO34UBWAHB/bundle.json","state_url":"https://pith.science/pith/ZSJV5UANMAKXJAFBYO34UBWAHB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZSJV5UANMAKXJAFBYO34UBWAHB/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-06-03T16:08:27Z","links":{"resolver":"https://pith.science/pith/ZSJV5UANMAKXJAFBYO34UBWAHB","bundle":"https://pith.science/pith/ZSJV5UANMAKXJAFBYO34UBWAHB/bundle.json","state":"https://pith.science/pith/ZSJV5UANMAKXJAFBYO34UBWAHB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZSJV5UANMAKXJAFBYO34UBWAHB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ZSJV5UANMAKXJAFBYO34UBWAHB","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":"55faef7cfc6192f45049bbd2055cb575eda4e2af5b3d86469ba25620dc6dce60","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-19T08:07:30Z","title_canon_sha256":"4dc398dad4c80872292baab2f6c731e0248ff5262049dbcf3edded98cc0d6161"},"schema_version":"1.0","source":{"id":"1805.07541","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07541","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07541v1","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07541","created_at":"2026-05-18T00:15:33Z"},{"alias_kind":"pith_short_12","alias_value":"ZSJV5UANMAKX","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"ZSJV5UANMAKXJAFB","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"ZSJV5UAN","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:f818966427e67bb95e38943575ba54965b6d92d3a21deb64a42e4c29a283e786","target":"graph","created_at":"2026-05-18T00:15:33Z","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":"Multitask learning has shown promising performance in many applications and many multitask models have been proposed. In order to identify an effective multitask model for a given multitask problem, we propose a learning framework called learning to multitask (L2MT). To achieve the goal, L2MT exploits historical multitask experience which is organized as a training set consists of several tuples, each of which contains a multitask problem with multiple tasks, a multitask model, and the relative test error. Based on such training set, L2MT first uses a proposed layerwise graph neural network to","authors_text":"Qiang Yang, Ying Wei, Yu Zhang","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-19T08:07:30Z","title":"Learning to Multitask"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07541","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:24a78cd35c908f521b7f31f70ffe586c625e5d5fdcfa6acf28d913a15817c20a","target":"record","created_at":"2026-05-18T00:15:33Z","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":"55faef7cfc6192f45049bbd2055cb575eda4e2af5b3d86469ba25620dc6dce60","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-05-19T08:07:30Z","title_canon_sha256":"4dc398dad4c80872292baab2f6c731e0248ff5262049dbcf3edded98cc0d6161"},"schema_version":"1.0","source":{"id":"1805.07541","kind":"arxiv","version":1}},"canonical_sha256":"cc935ed00d60157480a1c3b7ca06c0386106d23d01a1e23b39a42b173f1fd661","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cc935ed00d60157480a1c3b7ca06c0386106d23d01a1e23b39a42b173f1fd661","first_computed_at":"2026-05-18T00:15:33.338657Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:33.338657Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h7liL0XgSAZ2XVYsmFnM9lAbCkz9uLKHqkxNVdcUOG2o43Uf9npkSFnHk5mjYNY/QfShz1o+rr6+CXnss+fFCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:33.339153Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07541","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:24a78cd35c908f521b7f31f70ffe586c625e5d5fdcfa6acf28d913a15817c20a","sha256:f818966427e67bb95e38943575ba54965b6d92d3a21deb64a42e4c29a283e786"],"state_sha256":"75d4722f7c149691ddb5f0d84f6dada5c35c816e1ae3eafc6d5e734cfa6a0a11"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3QHOOmzCd88Y7dNDH2WXPBl/Vwf1s+yMP/CpB05ETccCKLlbA2jOy341RLlnvxNufoF2OwXjk58cUZD2T4/BBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T16:08:27.542872Z","bundle_sha256":"bd469052dcfa52f4d997d0d376dd6c63ce7feea8b26156ab075872a0fc5dbd83"}}