{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:PYHPQ5FNEYGPSJNS6UHIKAB5KS","short_pith_number":"pith:PYHPQ5FN","canonical_record":{"source":{"id":"2303.07666","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-14T07:15:41Z","cross_cats_sorted":[],"title_canon_sha256":"87b180db0821b1cf54ce2cc6cfbff085fcca94679c662e5c532e9ea1984fcaa1","abstract_canon_sha256":"aced65d7c84ca23954e01369cf1fe754c46e0bbdae3b90d201769b4dfd2b709a"},"schema_version":"1.0"},"canonical_sha256":"7e0ef874ad260cf925b2f50e85003d54b9e9fac1c40b28e6e45db1f0879d4372","source":{"kind":"arxiv","id":"2303.07666","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.07666","created_at":"2026-07-05T05:51:09Z"},{"alias_kind":"arxiv_version","alias_value":"2303.07666v1","created_at":"2026-07-05T05:51:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.07666","created_at":"2026-07-05T05:51:09Z"},{"alias_kind":"pith_short_12","alias_value":"PYHPQ5FNEYGP","created_at":"2026-07-05T05:51:09Z"},{"alias_kind":"pith_short_16","alias_value":"PYHPQ5FNEYGPSJNS","created_at":"2026-07-05T05:51:09Z"},{"alias_kind":"pith_short_8","alias_value":"PYHPQ5FN","created_at":"2026-07-05T05:51:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:PYHPQ5FNEYGPSJNS6UHIKAB5KS","target":"record","payload":{"canonical_record":{"source":{"id":"2303.07666","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-14T07:15:41Z","cross_cats_sorted":[],"title_canon_sha256":"87b180db0821b1cf54ce2cc6cfbff085fcca94679c662e5c532e9ea1984fcaa1","abstract_canon_sha256":"aced65d7c84ca23954e01369cf1fe754c46e0bbdae3b90d201769b4dfd2b709a"},"schema_version":"1.0"},"canonical_sha256":"7e0ef874ad260cf925b2f50e85003d54b9e9fac1c40b28e6e45db1f0879d4372","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:51:09.613858Z","signature_b64":"TsoaUhwoj6S4NPR1Sqm5JiGCQQ9LEcMDWWM1EfmWzjWhfAS7i+ZCtEpFHV5OmrU4fwqRhzOBqEKAXvztSpfXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e0ef874ad260cf925b2f50e85003d54b9e9fac1c40b28e6e45db1f0879d4372","last_reissued_at":"2026-07-05T05:51:09.613497Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:51:09.613497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2303.07666","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-07-05T05:51:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p/xGa5FlNQIPLr4/2FROeRl0fI+GAv1JX+Lzy9hvcWHC5jjYmrDLCQ75lZ3s5PfwIK5Gg4F/qRuR4IOjZnEyCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:28:35.475050Z"},"content_sha256":"722360e2de16e7688d8e1a988906fa4c9f50c23e20221a7eb4963d1de69442de","schema_version":"1.0","event_id":"sha256:722360e2de16e7688d8e1a988906fa4c9f50c23e20221a7eb4963d1de69442de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:PYHPQ5FNEYGPSJNS6UHIKAB5KS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relational Multi-Task Learning: Modeling Relations between Data and Tasks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jiaxuan You, Jure Leskovec, Kaidi Cao","submitted_at":"2023-03-14T07:15:41Z","abstract_excerpt":"A key assumption in multi-task learning is that at the inference time the multi-task model only has access to a given data point but not to the data point's labels from other tasks. This presents an opportunity to extend multi-task learning to utilize data point's labels from other auxiliary tasks, and this way improves performance on the new task. Here we introduce a novel relational multi-task learning setting where we leverage data point labels from auxiliary tasks to make more accurate predictions on the new task. We develop MetaLink, where our key innovation is to build a knowledge graph "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.07666","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2303.07666/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T05:51:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZxgRDJRwR8ou/xBqcOvS16I4ZLZeWxfgcgXCqS5lVjq9mHDAZozjuNdQSkGmFhd8fQ2zUfkXdz1AipPpkKa1AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T12:28:35.475441Z"},"content_sha256":"177f25ab663d2d8b73bb0c5461173d1d4181066437ce13e7d80b76419aeb099c","schema_version":"1.0","event_id":"sha256:177f25ab663d2d8b73bb0c5461173d1d4181066437ce13e7d80b76419aeb099c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PYHPQ5FNEYGPSJNS6UHIKAB5KS/bundle.json","state_url":"https://pith.science/pith/PYHPQ5FNEYGPSJNS6UHIKAB5KS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PYHPQ5FNEYGPSJNS6UHIKAB5KS/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-07-07T12:28:35Z","links":{"resolver":"https://pith.science/pith/PYHPQ5FNEYGPSJNS6UHIKAB5KS","bundle":"https://pith.science/pith/PYHPQ5FNEYGPSJNS6UHIKAB5KS/bundle.json","state":"https://pith.science/pith/PYHPQ5FNEYGPSJNS6UHIKAB5KS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PYHPQ5FNEYGPSJNS6UHIKAB5KS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:PYHPQ5FNEYGPSJNS6UHIKAB5KS","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":"aced65d7c84ca23954e01369cf1fe754c46e0bbdae3b90d201769b4dfd2b709a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-14T07:15:41Z","title_canon_sha256":"87b180db0821b1cf54ce2cc6cfbff085fcca94679c662e5c532e9ea1984fcaa1"},"schema_version":"1.0","source":{"id":"2303.07666","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2303.07666","created_at":"2026-07-05T05:51:09Z"},{"alias_kind":"arxiv_version","alias_value":"2303.07666v1","created_at":"2026-07-05T05:51:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2303.07666","created_at":"2026-07-05T05:51:09Z"},{"alias_kind":"pith_short_12","alias_value":"PYHPQ5FNEYGP","created_at":"2026-07-05T05:51:09Z"},{"alias_kind":"pith_short_16","alias_value":"PYHPQ5FNEYGPSJNS","created_at":"2026-07-05T05:51:09Z"},{"alias_kind":"pith_short_8","alias_value":"PYHPQ5FN","created_at":"2026-07-05T05:51:09Z"}],"graph_snapshots":[{"event_id":"sha256:177f25ab663d2d8b73bb0c5461173d1d4181066437ce13e7d80b76419aeb099c","target":"graph","created_at":"2026-07-05T05:51:09Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2303.07666/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A key assumption in multi-task learning is that at the inference time the multi-task model only has access to a given data point but not to the data point's labels from other tasks. This presents an opportunity to extend multi-task learning to utilize data point's labels from other auxiliary tasks, and this way improves performance on the new task. Here we introduce a novel relational multi-task learning setting where we leverage data point labels from auxiliary tasks to make more accurate predictions on the new task. We develop MetaLink, where our key innovation is to build a knowledge graph ","authors_text":"Jiaxuan You, Jure Leskovec, Kaidi Cao","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-14T07:15:41Z","title":"Relational Multi-Task Learning: Modeling Relations between Data and Tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2303.07666","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:722360e2de16e7688d8e1a988906fa4c9f50c23e20221a7eb4963d1de69442de","target":"record","created_at":"2026-07-05T05:51:09Z","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":"aced65d7c84ca23954e01369cf1fe754c46e0bbdae3b90d201769b4dfd2b709a","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-03-14T07:15:41Z","title_canon_sha256":"87b180db0821b1cf54ce2cc6cfbff085fcca94679c662e5c532e9ea1984fcaa1"},"schema_version":"1.0","source":{"id":"2303.07666","kind":"arxiv","version":1}},"canonical_sha256":"7e0ef874ad260cf925b2f50e85003d54b9e9fac1c40b28e6e45db1f0879d4372","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7e0ef874ad260cf925b2f50e85003d54b9e9fac1c40b28e6e45db1f0879d4372","first_computed_at":"2026-07-05T05:51:09.613497Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:51:09.613497Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TsoaUhwoj6S4NPR1Sqm5JiGCQQ9LEcMDWWM1EfmWzjWhfAS7i+ZCtEpFHV5OmrU4fwqRhzOBqEKAXvztSpfXDw==","signature_status":"signed_v1","signed_at":"2026-07-05T05:51:09.613858Z","signed_message":"canonical_sha256_bytes"},"source_id":"2303.07666","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:722360e2de16e7688d8e1a988906fa4c9f50c23e20221a7eb4963d1de69442de","sha256:177f25ab663d2d8b73bb0c5461173d1d4181066437ce13e7d80b76419aeb099c"],"state_sha256":"2a3b580ad1e34813ba7b574bb7e0ff23eaff11f1d354f207808c9d66196bf35f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LLkCjEcn2+XH5qGhkXKP5YWKd/yc0ntyYesC0z+RSfGp/FNcndqFWQFHDqrvoKEZvpILjO23weVWXkNODx31BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T12:28:35.477741Z","bundle_sha256":"5a3912cbe9ca80f308b29b1b574b5d3d8d891da13e1d1387dbed49d804f0fb15"}}