{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:TMOQE6XVRFZGPYSPYAUI6TSMFL","short_pith_number":"pith:TMOQE6XV","canonical_record":{"source":{"id":"1904.01747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-03T03:14:20Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"0b7e20ca922f0cef92ada1bcfaad3e8f3e585a89fd824c2ccf7736d65f10afe7","abstract_canon_sha256":"b252cc464f1710244a92955800ec5405e1d247e5b9f116e505fb7a5847d88be7"},"schema_version":"1.0"},"canonical_sha256":"9b1d027af5897267e24fc0288f4e4c2ad8f3d0c076e3ae564e2dd4aceb16246c","source":{"kind":"arxiv","id":"1904.01747","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01747","created_at":"2026-05-17T23:49:29Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01747v1","created_at":"2026-05-17T23:49:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01747","created_at":"2026-05-17T23:49:29Z"},{"alias_kind":"pith_short_12","alias_value":"TMOQE6XVRFZG","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TMOQE6XVRFZGPYSP","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TMOQE6XV","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:TMOQE6XVRFZGPYSPYAUI6TSMFL","target":"record","payload":{"canonical_record":{"source":{"id":"1904.01747","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-03T03:14:20Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"0b7e20ca922f0cef92ada1bcfaad3e8f3e585a89fd824c2ccf7736d65f10afe7","abstract_canon_sha256":"b252cc464f1710244a92955800ec5405e1d247e5b9f116e505fb7a5847d88be7"},"schema_version":"1.0"},"canonical_sha256":"9b1d027af5897267e24fc0288f4e4c2ad8f3d0c076e3ae564e2dd4aceb16246c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:29.815623Z","signature_b64":"j+SZR3Xwp2AajhoALGndsTX8CAvMwb+u2k+SJePdSnpPeLUJKTA4Zr8zon5CsaXuCLQEJ3lFkQegqyE2imVCCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b1d027af5897267e24fc0288f4e4c2ad8f3d0c076e3ae564e2dd4aceb16246c","last_reissued_at":"2026-05-17T23:49:29.814894Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:29.814894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.01747","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-17T23:49:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UCXVkzuFXc5uNJTLES0vA8QrTgH3Sn6SjjmxktpDO7NUmcjkRjSBVrskFlb06Iy7n1+9LH4D/wSkGmZPGaPRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:21:20.878061Z"},"content_sha256":"cd340225e8527cde7fc476b528947994d717076fdae5cc078df79e3125d4b169","schema_version":"1.0","event_id":"sha256:cd340225e8527cde7fc476b528947994d717076fdae5cc078df79e3125d4b169"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:TMOQE6XVRFZGPYSPYAUI6TSMFL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Better Exploring and Exploiting Task Relationships in Multi-Task Learning: Joint Model and Feature Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dacheng Tao, Tongliang Liu, Xinmei Tian, Ya Li","submitted_at":"2019-04-03T03:14:20Z","abstract_excerpt":"Multitask learning (MTL) aims to learn multiple tasks simultaneously through the interdependence between different tasks. The way to measure the relatedness between tasks is always a popular issue. There are mainly two ways to measure relatedness between tasks: common parameters sharing and common features sharing across different tasks. However, these two types of relatedness are mainly learned independently, leading to a loss of information. In this paper, we propose a new strategy to measure the relatedness that jointly learns shared parameters and shared feature representations. The object"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01747","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-17T23:49:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xpi+CKeGF+54WFBGMngdHgz18VAI2oDVT41Z0y+ju6zdFaPSLMP5e6OHFkzCB9A8ac59M1n99lka+Jk4BlmSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T21:21:20.878804Z"},"content_sha256":"b7a0deeee5c72cf50539f58f738f0293a2bb9d77d4f36f22d103bdfee72d119b","schema_version":"1.0","event_id":"sha256:b7a0deeee5c72cf50539f58f738f0293a2bb9d77d4f36f22d103bdfee72d119b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMOQE6XVRFZGPYSPYAUI6TSMFL/bundle.json","state_url":"https://pith.science/pith/TMOQE6XVRFZGPYSPYAUI6TSMFL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMOQE6XVRFZGPYSPYAUI6TSMFL/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-31T21:21:20Z","links":{"resolver":"https://pith.science/pith/TMOQE6XVRFZGPYSPYAUI6TSMFL","bundle":"https://pith.science/pith/TMOQE6XVRFZGPYSPYAUI6TSMFL/bundle.json","state":"https://pith.science/pith/TMOQE6XVRFZGPYSPYAUI6TSMFL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMOQE6XVRFZGPYSPYAUI6TSMFL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:TMOQE6XVRFZGPYSPYAUI6TSMFL","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":"b252cc464f1710244a92955800ec5405e1d247e5b9f116e505fb7a5847d88be7","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-03T03:14:20Z","title_canon_sha256":"0b7e20ca922f0cef92ada1bcfaad3e8f3e585a89fd824c2ccf7736d65f10afe7"},"schema_version":"1.0","source":{"id":"1904.01747","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.01747","created_at":"2026-05-17T23:49:29Z"},{"alias_kind":"arxiv_version","alias_value":"1904.01747v1","created_at":"2026-05-17T23:49:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01747","created_at":"2026-05-17T23:49:29Z"},{"alias_kind":"pith_short_12","alias_value":"TMOQE6XVRFZG","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"TMOQE6XVRFZGPYSP","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"TMOQE6XV","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:b7a0deeee5c72cf50539f58f738f0293a2bb9d77d4f36f22d103bdfee72d119b","target":"graph","created_at":"2026-05-17T23:49:29Z","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 (MTL) aims to learn multiple tasks simultaneously through the interdependence between different tasks. The way to measure the relatedness between tasks is always a popular issue. There are mainly two ways to measure relatedness between tasks: common parameters sharing and common features sharing across different tasks. However, these two types of relatedness are mainly learned independently, leading to a loss of information. In this paper, we propose a new strategy to measure the relatedness that jointly learns shared parameters and shared feature representations. The object","authors_text":"Dacheng Tao, Tongliang Liu, Xinmei Tian, Ya Li","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-03T03:14:20Z","title":"On Better Exploring and Exploiting Task Relationships in Multi-Task Learning: Joint Model and Feature Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01747","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:cd340225e8527cde7fc476b528947994d717076fdae5cc078df79e3125d4b169","target":"record","created_at":"2026-05-17T23:49:29Z","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":"b252cc464f1710244a92955800ec5405e1d247e5b9f116e505fb7a5847d88be7","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-04-03T03:14:20Z","title_canon_sha256":"0b7e20ca922f0cef92ada1bcfaad3e8f3e585a89fd824c2ccf7736d65f10afe7"},"schema_version":"1.0","source":{"id":"1904.01747","kind":"arxiv","version":1}},"canonical_sha256":"9b1d027af5897267e24fc0288f4e4c2ad8f3d0c076e3ae564e2dd4aceb16246c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b1d027af5897267e24fc0288f4e4c2ad8f3d0c076e3ae564e2dd4aceb16246c","first_computed_at":"2026-05-17T23:49:29.814894Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:29.814894Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"j+SZR3Xwp2AajhoALGndsTX8CAvMwb+u2k+SJePdSnpPeLUJKTA4Zr8zon5CsaXuCLQEJ3lFkQegqyE2imVCCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:29.815623Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.01747","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd340225e8527cde7fc476b528947994d717076fdae5cc078df79e3125d4b169","sha256:b7a0deeee5c72cf50539f58f738f0293a2bb9d77d4f36f22d103bdfee72d119b"],"state_sha256":"cf92c3d491a93d5dae323497912c9b553684a553c0c0c383822ba472ffdb9457"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eCI61A6emZWoJ4rxPFtIjsNAg4HmaN9aDZvwbRZQ/oK0uERC4Ai7L/HSFvnPdtbrEaifT8XawIG++841enZRDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T21:21:20.883221Z","bundle_sha256":"d9ff02098d92be82a2ab00682b692418cd80d3e573d5db65c289579cfb1336f6"}}