{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:AUS7L4G4HKYGRQFCN7IKIT4YBM","short_pith_number":"pith:AUS7L4G4","canonical_record":{"source":{"id":"1903.12117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-28T17:03:04Z","cross_cats_sorted":[],"title_canon_sha256":"705ccbeee87f1cf4f5c3c4fbe95b51d271e91b0d5f858176832e04650268350b","abstract_canon_sha256":"6ebeb5e3e33974b98089951858d7582325ebe29c10aa8e7cf8e1978d613df463"},"schema_version":"1.0"},"canonical_sha256":"0525f5f0dc3ab068c0a26fd0a44f980b2ef0c25af29f59c829bc3e2c7ab56c81","source":{"kind":"arxiv","id":"1903.12117","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12117","created_at":"2026-05-17T23:49:58Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12117v1","created_at":"2026-05-17T23:49:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12117","created_at":"2026-05-17T23:49:58Z"},{"alias_kind":"pith_short_12","alias_value":"AUS7L4G4HKYG","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AUS7L4G4HKYGRQFC","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AUS7L4G4","created_at":"2026-05-18T12:33:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:AUS7L4G4HKYGRQFCN7IKIT4YBM","target":"record","payload":{"canonical_record":{"source":{"id":"1903.12117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-28T17:03:04Z","cross_cats_sorted":[],"title_canon_sha256":"705ccbeee87f1cf4f5c3c4fbe95b51d271e91b0d5f858176832e04650268350b","abstract_canon_sha256":"6ebeb5e3e33974b98089951858d7582325ebe29c10aa8e7cf8e1978d613df463"},"schema_version":"1.0"},"canonical_sha256":"0525f5f0dc3ab068c0a26fd0a44f980b2ef0c25af29f59c829bc3e2c7ab56c81","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:58.001450Z","signature_b64":"p0jMPCLSocdF4s8ywj/vueK0HsdMIqK+u1v34LSIXPp8GMMbMEWYafTqhGfM6epV4RItGjXpzJEOcVBXvsJlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0525f5f0dc3ab068c0a26fd0a44f980b2ef0c25af29f59c829bc3e2c7ab56c81","last_reissued_at":"2026-05-17T23:49:58.000794Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:58.000794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.12117","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:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K6UnbGoQh31A1/ZOc9puDjnrokNbw2exywwCMAcDsKVX9N/4gOmfFE6ExpOWdvLu5ckHKRtCkhWhPKmqsd1pDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:12:12.470297Z"},"content_sha256":"36f55a9849b5bb1c2aa061b5fdd5475aaf804372efbaeabfc67539b970299fd6","schema_version":"1.0","event_id":"sha256:36f55a9849b5bb1c2aa061b5fdd5475aaf804372efbaeabfc67539b970299fd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:AUS7L4G4HKYGRQFCN7IKIT4YBM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Many Task Learning with Task Routing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Gjorgji Strezoski, Marcel Worring, Nanne van Noord","submitted_at":"2019-03-28T17:03:04Z","abstract_excerpt":"Typical multi-task learning (MTL) methods rely on architectural adjustments and a large trainable parameter set to jointly optimize over several tasks. However, when the number of tasks increases so do the complexity of the architectural adjustments and resource requirements. In this paper, we introduce a method which applies a conditional feature-wise transformation over the convolutional activations that enables a model to successfully perform a large number of tasks. To distinguish from regular MTL, we introduce Many Task Learning (MaTL) as a special case of MTL where more than 20 tasks are"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12117","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:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vM6ZXXTYWFkJuzTJjtXs+uXHMje9SQLGiKFw9Q60v+THYBMPsLjkuDdXeCClWQGqhytB5PPSqXwaA8AtjQiiDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T07:12:12.470911Z"},"content_sha256":"8a1670d3d121eba5919bbe90af7227ec856b3123927f9ac41d32a552072e5e6d","schema_version":"1.0","event_id":"sha256:8a1670d3d121eba5919bbe90af7227ec856b3123927f9ac41d32a552072e5e6d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AUS7L4G4HKYGRQFCN7IKIT4YBM/bundle.json","state_url":"https://pith.science/pith/AUS7L4G4HKYGRQFCN7IKIT4YBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AUS7L4G4HKYGRQFCN7IKIT4YBM/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-26T07:12:12Z","links":{"resolver":"https://pith.science/pith/AUS7L4G4HKYGRQFCN7IKIT4YBM","bundle":"https://pith.science/pith/AUS7L4G4HKYGRQFCN7IKIT4YBM/bundle.json","state":"https://pith.science/pith/AUS7L4G4HKYGRQFCN7IKIT4YBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AUS7L4G4HKYGRQFCN7IKIT4YBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:AUS7L4G4HKYGRQFCN7IKIT4YBM","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":"6ebeb5e3e33974b98089951858d7582325ebe29c10aa8e7cf8e1978d613df463","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-28T17:03:04Z","title_canon_sha256":"705ccbeee87f1cf4f5c3c4fbe95b51d271e91b0d5f858176832e04650268350b"},"schema_version":"1.0","source":{"id":"1903.12117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.12117","created_at":"2026-05-17T23:49:58Z"},{"alias_kind":"arxiv_version","alias_value":"1903.12117v1","created_at":"2026-05-17T23:49:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12117","created_at":"2026-05-17T23:49:58Z"},{"alias_kind":"pith_short_12","alias_value":"AUS7L4G4HKYG","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_16","alias_value":"AUS7L4G4HKYGRQFC","created_at":"2026-05-18T12:33:12Z"},{"alias_kind":"pith_short_8","alias_value":"AUS7L4G4","created_at":"2026-05-18T12:33:12Z"}],"graph_snapshots":[{"event_id":"sha256:8a1670d3d121eba5919bbe90af7227ec856b3123927f9ac41d32a552072e5e6d","target":"graph","created_at":"2026-05-17T23:49:58Z","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":"Typical multi-task learning (MTL) methods rely on architectural adjustments and a large trainable parameter set to jointly optimize over several tasks. However, when the number of tasks increases so do the complexity of the architectural adjustments and resource requirements. In this paper, we introduce a method which applies a conditional feature-wise transformation over the convolutional activations that enables a model to successfully perform a large number of tasks. To distinguish from regular MTL, we introduce Many Task Learning (MaTL) as a special case of MTL where more than 20 tasks are","authors_text":"Gjorgji Strezoski, Marcel Worring, Nanne van Noord","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-28T17:03:04Z","title":"Many Task Learning with Task Routing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12117","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:36f55a9849b5bb1c2aa061b5fdd5475aaf804372efbaeabfc67539b970299fd6","target":"record","created_at":"2026-05-17T23:49:58Z","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":"6ebeb5e3e33974b98089951858d7582325ebe29c10aa8e7cf8e1978d613df463","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-03-28T17:03:04Z","title_canon_sha256":"705ccbeee87f1cf4f5c3c4fbe95b51d271e91b0d5f858176832e04650268350b"},"schema_version":"1.0","source":{"id":"1903.12117","kind":"arxiv","version":1}},"canonical_sha256":"0525f5f0dc3ab068c0a26fd0a44f980b2ef0c25af29f59c829bc3e2c7ab56c81","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0525f5f0dc3ab068c0a26fd0a44f980b2ef0c25af29f59c829bc3e2c7ab56c81","first_computed_at":"2026-05-17T23:49:58.000794Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:58.000794Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p0jMPCLSocdF4s8ywj/vueK0HsdMIqK+u1v34LSIXPp8GMMbMEWYafTqhGfM6epV4RItGjXpzJEOcVBXvsJlBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:58.001450Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.12117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:36f55a9849b5bb1c2aa061b5fdd5475aaf804372efbaeabfc67539b970299fd6","sha256:8a1670d3d121eba5919bbe90af7227ec856b3123927f9ac41d32a552072e5e6d"],"state_sha256":"4e7fdca2221ad27958ec8de7ad6a5c3ab5b2737ddf0048e5cbc6491909df7a9c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lo0eHtSjmU/1Ymy+WY7v6qK7Ab4orERGh5/9upGZ9bBS2BMpWjJN4vkx6rZdvQ7ewTTdp8QxIHPt7oEeV2AxCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T07:12:12.474287Z","bundle_sha256":"cf6fc2eec8e005240c14ccd9a724706524da53b838f5cf7e6dfaff4a9694f10a"}}