{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:76URSAY6OYQR65NKWIFPA7Z7TN","short_pith_number":"pith:76URSAY6","canonical_record":{"source":{"id":"1905.07553","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-18T08:20:14Z","cross_cats_sorted":[],"title_canon_sha256":"3479c35f410a07e0dbd4a2b05b859d996a0507e07985512b1ce3f014700706cb","abstract_canon_sha256":"293e0b2c9aa52145f3cc81b3b735239e36d1e4f4da74879bcfe5badc16cadd1c"},"schema_version":"1.0"},"canonical_sha256":"ffa919031e76211f75aab20af07f3f9b5cfd9ec4e71be86d4df4c7268c7d9d6f","source":{"kind":"arxiv","id":"1905.07553","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07553","created_at":"2026-07-05T01:32:41Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07553v4","created_at":"2026-07-05T01:32:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07553","created_at":"2026-07-05T01:32:41Z"},{"alias_kind":"pith_short_12","alias_value":"76URSAY6OYQR","created_at":"2026-07-05T01:32:41Z"},{"alias_kind":"pith_short_16","alias_value":"76URSAY6OYQR65NK","created_at":"2026-07-05T01:32:41Z"},{"alias_kind":"pith_short_8","alias_value":"76URSAY6","created_at":"2026-07-05T01:32:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:76URSAY6OYQR65NKWIFPA7Z7TN","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07553","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-18T08:20:14Z","cross_cats_sorted":[],"title_canon_sha256":"3479c35f410a07e0dbd4a2b05b859d996a0507e07985512b1ce3f014700706cb","abstract_canon_sha256":"293e0b2c9aa52145f3cc81b3b735239e36d1e4f4da74879bcfe5badc16cadd1c"},"schema_version":"1.0"},"canonical_sha256":"ffa919031e76211f75aab20af07f3f9b5cfd9ec4e71be86d4df4c7268c7d9d6f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:32:41.037493Z","signature_b64":"OR8j9+ZnkqYiOpVLJYk1zhSor1Z9QX18hC2HyBuaiGXbCtQ8WprcvvCbJt1pPeZmchTz9nUufDJGIN1Tl9q+Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ffa919031e76211f75aab20af07f3f9b5cfd9ec4e71be86d4df4c7268c7d9d6f","last_reissued_at":"2026-07-05T01:32:41.037129Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:32:41.037129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07553","source_version":4,"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-05T01:32:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EeShSJNTpGLOxAhITfy7BNyMogxVDV/0DMpruBhHxlgjLQMGkBVQDeJw7BvKOS9+UWdhLN2tyhl0h7Oefw3aBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:43:30.637854Z"},"content_sha256":"b12c13c38be2ef30727b137a870e78781ab87a040f28a341392487f3ed1dae91","schema_version":"1.0","event_id":"sha256:b12c13c38be2ef30727b137a870e78781ab87a040f28a341392487f3ed1dae91"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:76URSAY6OYQR65NKWIFPA7Z7TN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Which Tasks Should Be Learned Together in Multi-task Learning?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Amir R. Zamir, Dawn Chen, Jitendra Malik, Leonidas Guibas, Silvio Savarese, Trevor Standley","submitted_at":"2019-05-18T08:20:14Z","abstract_excerpt":"Many computer vision applications require solving multiple tasks in real-time. A neural network can be trained to solve multiple tasks simultaneously using multi-task learning. This can save computation at inference time as only a single network needs to be evaluated. Unfortunately, this often leads to inferior overall performance as task objectives can compete, which consequently poses the question: which tasks should and should not be learned together in one network when employing multi-task learning? We study task cooperation and competition in several different learning settings and propos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07553","kind":"arxiv","version":4},"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/1905.07553/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-05T01:32:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BQcsie1qlC+RpyHbSK6ejzs8a+hPABjvDCUyjLs0QWEE/RnPTej2Xc/A4Y7CaO9b+4U8wjn1xAsT/jzP145ADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T13:43:30.638331Z"},"content_sha256":"0d0d998db07dbf2f151a2a3fed019a5442f108599d7e322513901a46d73742eb","schema_version":"1.0","event_id":"sha256:0d0d998db07dbf2f151a2a3fed019a5442f108599d7e322513901a46d73742eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/76URSAY6OYQR65NKWIFPA7Z7TN/bundle.json","state_url":"https://pith.science/pith/76URSAY6OYQR65NKWIFPA7Z7TN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/76URSAY6OYQR65NKWIFPA7Z7TN/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-08-11T13:43:30Z","links":{"resolver":"https://pith.science/pith/76URSAY6OYQR65NKWIFPA7Z7TN","bundle":"https://pith.science/pith/76URSAY6OYQR65NKWIFPA7Z7TN/bundle.json","state":"https://pith.science/pith/76URSAY6OYQR65NKWIFPA7Z7TN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/76URSAY6OYQR65NKWIFPA7Z7TN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:76URSAY6OYQR65NKWIFPA7Z7TN","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":"293e0b2c9aa52145f3cc81b3b735239e36d1e4f4da74879bcfe5badc16cadd1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-18T08:20:14Z","title_canon_sha256":"3479c35f410a07e0dbd4a2b05b859d996a0507e07985512b1ce3f014700706cb"},"schema_version":"1.0","source":{"id":"1905.07553","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07553","created_at":"2026-07-05T01:32:41Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07553v4","created_at":"2026-07-05T01:32:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07553","created_at":"2026-07-05T01:32:41Z"},{"alias_kind":"pith_short_12","alias_value":"76URSAY6OYQR","created_at":"2026-07-05T01:32:41Z"},{"alias_kind":"pith_short_16","alias_value":"76URSAY6OYQR65NK","created_at":"2026-07-05T01:32:41Z"},{"alias_kind":"pith_short_8","alias_value":"76URSAY6","created_at":"2026-07-05T01:32:41Z"}],"graph_snapshots":[{"event_id":"sha256:0d0d998db07dbf2f151a2a3fed019a5442f108599d7e322513901a46d73742eb","target":"graph","created_at":"2026-07-05T01:32:41Z","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/1905.07553/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Many computer vision applications require solving multiple tasks in real-time. A neural network can be trained to solve multiple tasks simultaneously using multi-task learning. This can save computation at inference time as only a single network needs to be evaluated. Unfortunately, this often leads to inferior overall performance as task objectives can compete, which consequently poses the question: which tasks should and should not be learned together in one network when employing multi-task learning? We study task cooperation and competition in several different learning settings and propos","authors_text":"Amir R. Zamir, Dawn Chen, Jitendra Malik, Leonidas Guibas, Silvio Savarese, Trevor Standley","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-18T08:20:14Z","title":"Which Tasks Should Be Learned Together in Multi-task Learning?"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07553","kind":"arxiv","version":4},"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:b12c13c38be2ef30727b137a870e78781ab87a040f28a341392487f3ed1dae91","target":"record","created_at":"2026-07-05T01:32:41Z","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":"293e0b2c9aa52145f3cc81b3b735239e36d1e4f4da74879bcfe5badc16cadd1c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-18T08:20:14Z","title_canon_sha256":"3479c35f410a07e0dbd4a2b05b859d996a0507e07985512b1ce3f014700706cb"},"schema_version":"1.0","source":{"id":"1905.07553","kind":"arxiv","version":4}},"canonical_sha256":"ffa919031e76211f75aab20af07f3f9b5cfd9ec4e71be86d4df4c7268c7d9d6f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ffa919031e76211f75aab20af07f3f9b5cfd9ec4e71be86d4df4c7268c7d9d6f","first_computed_at":"2026-07-05T01:32:41.037129Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:32:41.037129Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OR8j9+ZnkqYiOpVLJYk1zhSor1Z9QX18hC2HyBuaiGXbCtQ8WprcvvCbJt1pPeZmchTz9nUufDJGIN1Tl9q+Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:32:41.037493Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07553","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b12c13c38be2ef30727b137a870e78781ab87a040f28a341392487f3ed1dae91","sha256:0d0d998db07dbf2f151a2a3fed019a5442f108599d7e322513901a46d73742eb"],"state_sha256":"c6e8d574f9a2344981642bd3294e755bb3afa3bb05ded6c21d129b5ba1b1ef4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmdtfEHFmsNL5xdCylSaglqGAZzmRllC1HtB6dcvqz1rkPN+yT9bwg/XZaRyiZvU95Sma3gFVvbvlHfey0NCCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T13:43:30.642624Z","bundle_sha256":"e520ad6ef7b9a613f1a366e8fb29c56231f0ff219d181859f5c5b122ce9cb95d"}}