{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:66UKDZ2UTRTGWTE4CZ4GANU37F","short_pith_number":"pith:66UKDZ2U","canonical_record":{"source":{"id":"2305.17305","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-05-26T23:43:21Z","cross_cats_sorted":[],"title_canon_sha256":"67fc739d037968bb4e0dc58f486675b28e8e929086437cd19a7266492c196e3d","abstract_canon_sha256":"c61145f1d3ea17b93fb8621193e175d3bcc91fe6cf394a82e92926e96a982cf3"},"schema_version":"1.0"},"canonical_sha256":"f7a8a1e7549c666b4c9c167860369bf955cc1048ee64f2406a49f4151d5e5d4a","source":{"kind":"arxiv","id":"2305.17305","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.17305","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"2305.17305v1","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.17305","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"66UKDZ2UTRTG","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"pith_short_16","alias_value":"66UKDZ2UTRTGWTE4","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"pith_short_8","alias_value":"66UKDZ2U","created_at":"2026-07-05T06:14:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:66UKDZ2UTRTGWTE4CZ4GANU37F","target":"record","payload":{"canonical_record":{"source":{"id":"2305.17305","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-05-26T23:43:21Z","cross_cats_sorted":[],"title_canon_sha256":"67fc739d037968bb4e0dc58f486675b28e8e929086437cd19a7266492c196e3d","abstract_canon_sha256":"c61145f1d3ea17b93fb8621193e175d3bcc91fe6cf394a82e92926e96a982cf3"},"schema_version":"1.0"},"canonical_sha256":"f7a8a1e7549c666b4c9c167860369bf955cc1048ee64f2406a49f4151d5e5d4a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:14:26.215987Z","signature_b64":"2pDuWYmDRbKtKqKwcdF9uhqtCYUn7Hvgj86y6SbDcAal+GOwc6r+khClQsDqmhFXOLvk6pooGFTiqt05w12jAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7a8a1e7549c666b4c9c167860369bf955cc1048ee64f2406a49f4151d5e5d4a","last_reissued_at":"2026-07-05T06:14:26.215550Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:14:26.215550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2305.17305","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-05T06:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GUkZ5qMlzGMCYivee6GNtxhDFnrrRd/0eRoih8HnDyuSYH4hdjkh2ywA5weBwbvVmaTiOwe0J/9arUQmtvagAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T19:11:16.235214Z"},"content_sha256":"02df634f19c679ce3f89fb4740aabba03d12d41ddabbe4cb7bfa7a6352bcff62","schema_version":"1.0","event_id":"sha256:02df634f19c679ce3f89fb4740aabba03d12d41ddabbe4cb7bfa7a6352bcff62"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:66UKDZ2UTRTGWTE4CZ4GANU37F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DynaShare: Task and Instance Conditioned Parameter Sharing for Multi-Task Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Elahe Rahimian, Frederick Tung, Gabriel Oliveira, Golara Javadi","submitted_at":"2023-05-26T23:43:21Z","abstract_excerpt":"Multi-task networks rely on effective parameter sharing to achieve robust generalization across tasks. In this paper, we present a novel parameter sharing method for multi-task learning that conditions parameter sharing on both the task and the intermediate feature representations at inference time. In contrast to traditional parameter sharing approaches, which fix or learn a deterministic sharing pattern during training and apply the same pattern to all examples during inference, we propose to dynamically decide which parts of the network to activate based on both the task and the input insta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.17305","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/2305.17305/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-05T06:14:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SLaNN/X/8UHQmQ5ApHKHwXMOpiOfLRMshWe0kZZmTvrAKJsLqm+nz235Iz1VzACYA3pPbxQXeAHluIy9UNm3Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T19:11:16.235744Z"},"content_sha256":"82545b3559c3726ae7befb587db15929d48532790fcff3abd63d391589923c3e","schema_version":"1.0","event_id":"sha256:82545b3559c3726ae7befb587db15929d48532790fcff3abd63d391589923c3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66UKDZ2UTRTGWTE4CZ4GANU37F/bundle.json","state_url":"https://pith.science/pith/66UKDZ2UTRTGWTE4CZ4GANU37F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66UKDZ2UTRTGWTE4CZ4GANU37F/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-19T19:11:16Z","links":{"resolver":"https://pith.science/pith/66UKDZ2UTRTGWTE4CZ4GANU37F","bundle":"https://pith.science/pith/66UKDZ2UTRTGWTE4CZ4GANU37F/bundle.json","state":"https://pith.science/pith/66UKDZ2UTRTGWTE4CZ4GANU37F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66UKDZ2UTRTGWTE4CZ4GANU37F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:66UKDZ2UTRTGWTE4CZ4GANU37F","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":"c61145f1d3ea17b93fb8621193e175d3bcc91fe6cf394a82e92926e96a982cf3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-05-26T23:43:21Z","title_canon_sha256":"67fc739d037968bb4e0dc58f486675b28e8e929086437cd19a7266492c196e3d"},"schema_version":"1.0","source":{"id":"2305.17305","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2305.17305","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"arxiv_version","alias_value":"2305.17305v1","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.17305","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"pith_short_12","alias_value":"66UKDZ2UTRTG","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"pith_short_16","alias_value":"66UKDZ2UTRTGWTE4","created_at":"2026-07-05T06:14:26Z"},{"alias_kind":"pith_short_8","alias_value":"66UKDZ2U","created_at":"2026-07-05T06:14:26Z"}],"graph_snapshots":[{"event_id":"sha256:82545b3559c3726ae7befb587db15929d48532790fcff3abd63d391589923c3e","target":"graph","created_at":"2026-07-05T06:14:26Z","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/2305.17305/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-task networks rely on effective parameter sharing to achieve robust generalization across tasks. In this paper, we present a novel parameter sharing method for multi-task learning that conditions parameter sharing on both the task and the intermediate feature representations at inference time. In contrast to traditional parameter sharing approaches, which fix or learn a deterministic sharing pattern during training and apply the same pattern to all examples during inference, we propose to dynamically decide which parts of the network to activate based on both the task and the input insta","authors_text":"Elahe Rahimian, Frederick Tung, Gabriel Oliveira, Golara Javadi","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-05-26T23:43:21Z","title":"DynaShare: Task and Instance Conditioned Parameter Sharing for Multi-Task Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.17305","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:02df634f19c679ce3f89fb4740aabba03d12d41ddabbe4cb7bfa7a6352bcff62","target":"record","created_at":"2026-07-05T06:14:26Z","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":"c61145f1d3ea17b93fb8621193e175d3bcc91fe6cf394a82e92926e96a982cf3","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2023-05-26T23:43:21Z","title_canon_sha256":"67fc739d037968bb4e0dc58f486675b28e8e929086437cd19a7266492c196e3d"},"schema_version":"1.0","source":{"id":"2305.17305","kind":"arxiv","version":1}},"canonical_sha256":"f7a8a1e7549c666b4c9c167860369bf955cc1048ee64f2406a49f4151d5e5d4a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7a8a1e7549c666b4c9c167860369bf955cc1048ee64f2406a49f4151d5e5d4a","first_computed_at":"2026-07-05T06:14:26.215550Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:14:26.215550Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2pDuWYmDRbKtKqKwcdF9uhqtCYUn7Hvgj86y6SbDcAal+GOwc6r+khClQsDqmhFXOLvk6pooGFTiqt05w12jAw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:14:26.215987Z","signed_message":"canonical_sha256_bytes"},"source_id":"2305.17305","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02df634f19c679ce3f89fb4740aabba03d12d41ddabbe4cb7bfa7a6352bcff62","sha256:82545b3559c3726ae7befb587db15929d48532790fcff3abd63d391589923c3e"],"state_sha256":"645283d22900cb8d6c411b614bd690bb4f79e56221d108a1ee6c7ba16c254b5c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bApRrCbxeZJzQfQ8qOKKVCbn1w22fjkHeakx4KxJ00qheF29Y2ZqbuATLxGolC0G1i5sH13T0hEzyU++BFDADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T19:11:16.239901Z","bundle_sha256":"6fb276b8558410ea39082c96631add49bd3da7ca87ea41f05d1bb92174a3cfe2"}}