{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SXXFJER2P7AZNNBTJU3SELNHY6","short_pith_number":"pith:SXXFJER2","canonical_record":{"source":{"id":"1911.12423","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-11-27T21:07:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"decc8ade9da53ee0b838fe77845bb057e3ffec8b824e7627a97b259a6036832b","abstract_canon_sha256":"aeac1c00db36fd0878381047dec750c29175799c9464b44753a8d1a5bac8c48a"},"schema_version":"1.0"},"canonical_sha256":"95ee54923a7fc196b4334d37222da7c7bdf522d1723e49b13be0bf0009687592","source":{"kind":"arxiv","id":"1911.12423","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.12423","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"arxiv_version","alias_value":"1911.12423v2","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.12423","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"pith_short_12","alias_value":"SXXFJER2P7AZ","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"pith_short_16","alias_value":"SXXFJER2P7AZNNBT","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"pith_short_8","alias_value":"SXXFJER2","created_at":"2026-07-05T01:52:45Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SXXFJER2P7AZNNBTJU3SELNHY6","target":"record","payload":{"canonical_record":{"source":{"id":"1911.12423","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-11-27T21:07:25Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"decc8ade9da53ee0b838fe77845bb057e3ffec8b824e7627a97b259a6036832b","abstract_canon_sha256":"aeac1c00db36fd0878381047dec750c29175799c9464b44753a8d1a5bac8c48a"},"schema_version":"1.0"},"canonical_sha256":"95ee54923a7fc196b4334d37222da7c7bdf522d1723e49b13be0bf0009687592","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:52:45.411950Z","signature_b64":"wtLemxmjE8CaV4Eo6kxnBUDW2aqETKui46zp4i9V0SYBYncoPtraZO9QwAF7vSkhgqIgQfVvbTQl920hZYZjCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95ee54923a7fc196b4334d37222da7c7bdf522d1723e49b13be0bf0009687592","last_reissued_at":"2026-07-05T01:52:45.411478Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:52:45.411478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.12423","source_version":2,"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:52:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w1QuqldVb6K6yii8Eo7fIIxFsyB10A5CaItylPxY5Z+CO6NRDFScaI7I5X1DFHpsJfnbBueHkZpRLN08Q2ivCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T18:16:57.665226Z"},"content_sha256":"62511e087524f05fc4bae31dd554b6b09287462736396669d2bed42c215c3b67","schema_version":"1.0","event_id":"sha256:62511e087524f05fc4bae31dd554b6b09287462736396669d2bed42c215c3b67"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SXXFJER2P7AZNNBTJU3SELNHY6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"AdaShare: Learning What To Share For Efficient Deep Multi-Task Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Kate Saenko, Rameswar Panda, Rogerio Feris, Ximeng Sun","submitted_at":"2019-11-27T21:07:25Z","abstract_excerpt":"Multi-task learning is an open and challenging problem in computer vision. The typical way of conducting multi-task learning with deep neural networks is either through handcrafted schemes that share all initial layers and branch out at an adhoc point, or through separate task-specific networks with an additional feature sharing/fusion mechanism. Unlike existing methods, we propose an adaptive sharing approach, called AdaShare, that decides what to share across which tasks to achieve the best recognition accuracy, while taking resource efficiency into account. Specifically, our main idea is to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.12423","kind":"arxiv","version":2},"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/1911.12423/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:52:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V11dSHbBilMn+3xjj0lw3KD8p8BvTHtVrvw6GjPATAVErozLGh4V6cVKg/xaBCakHgOtMSyHaLHTuhJ/MUybBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-17T18:16:57.665783Z"},"content_sha256":"d49ce640a8c3f2e5d39048f0e8e8b6c11241f1ed0667800ff8563282cd65497d","schema_version":"1.0","event_id":"sha256:d49ce640a8c3f2e5d39048f0e8e8b6c11241f1ed0667800ff8563282cd65497d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SXXFJER2P7AZNNBTJU3SELNHY6/bundle.json","state_url":"https://pith.science/pith/SXXFJER2P7AZNNBTJU3SELNHY6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SXXFJER2P7AZNNBTJU3SELNHY6/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-17T18:16:57Z","links":{"resolver":"https://pith.science/pith/SXXFJER2P7AZNNBTJU3SELNHY6","bundle":"https://pith.science/pith/SXXFJER2P7AZNNBTJU3SELNHY6/bundle.json","state":"https://pith.science/pith/SXXFJER2P7AZNNBTJU3SELNHY6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SXXFJER2P7AZNNBTJU3SELNHY6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SXXFJER2P7AZNNBTJU3SELNHY6","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":"aeac1c00db36fd0878381047dec750c29175799c9464b44753a8d1a5bac8c48a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-11-27T21:07:25Z","title_canon_sha256":"decc8ade9da53ee0b838fe77845bb057e3ffec8b824e7627a97b259a6036832b"},"schema_version":"1.0","source":{"id":"1911.12423","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.12423","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"arxiv_version","alias_value":"1911.12423v2","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.12423","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"pith_short_12","alias_value":"SXXFJER2P7AZ","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"pith_short_16","alias_value":"SXXFJER2P7AZNNBT","created_at":"2026-07-05T01:52:45Z"},{"alias_kind":"pith_short_8","alias_value":"SXXFJER2","created_at":"2026-07-05T01:52:45Z"}],"graph_snapshots":[{"event_id":"sha256:d49ce640a8c3f2e5d39048f0e8e8b6c11241f1ed0667800ff8563282cd65497d","target":"graph","created_at":"2026-07-05T01:52:45Z","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/1911.12423/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-task learning is an open and challenging problem in computer vision. The typical way of conducting multi-task learning with deep neural networks is either through handcrafted schemes that share all initial layers and branch out at an adhoc point, or through separate task-specific networks with an additional feature sharing/fusion mechanism. Unlike existing methods, we propose an adaptive sharing approach, called AdaShare, that decides what to share across which tasks to achieve the best recognition accuracy, while taking resource efficiency into account. Specifically, our main idea is to","authors_text":"Kate Saenko, Rameswar Panda, Rogerio Feris, Ximeng Sun","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-11-27T21:07:25Z","title":"AdaShare: Learning What To Share For Efficient Deep Multi-Task Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.12423","kind":"arxiv","version":2},"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:62511e087524f05fc4bae31dd554b6b09287462736396669d2bed42c215c3b67","target":"record","created_at":"2026-07-05T01:52:45Z","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":"aeac1c00db36fd0878381047dec750c29175799c9464b44753a8d1a5bac8c48a","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-11-27T21:07:25Z","title_canon_sha256":"decc8ade9da53ee0b838fe77845bb057e3ffec8b824e7627a97b259a6036832b"},"schema_version":"1.0","source":{"id":"1911.12423","kind":"arxiv","version":2}},"canonical_sha256":"95ee54923a7fc196b4334d37222da7c7bdf522d1723e49b13be0bf0009687592","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95ee54923a7fc196b4334d37222da7c7bdf522d1723e49b13be0bf0009687592","first_computed_at":"2026-07-05T01:52:45.411478Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:52:45.411478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wtLemxmjE8CaV4Eo6kxnBUDW2aqETKui46zp4i9V0SYBYncoPtraZO9QwAF7vSkhgqIgQfVvbTQl920hZYZjCA==","signature_status":"signed_v1","signed_at":"2026-07-05T01:52:45.411950Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.12423","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:62511e087524f05fc4bae31dd554b6b09287462736396669d2bed42c215c3b67","sha256:d49ce640a8c3f2e5d39048f0e8e8b6c11241f1ed0667800ff8563282cd65497d"],"state_sha256":"da34b6d39f987f8c649c7054f64e44c8ecf4da216ac209743bdcf5b91113a994"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kktapmRY3EALB2xpdtjOOUuHZQafzOBdJuzeVGucUUSCRiZZcV/Kpay+b5exUT9NkTEd3qdZLCZHZssp2UQRCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-17T18:16:57.674752Z","bundle_sha256":"d533dfd8892bd575d0db67cb087eb689d36bbdbe74db5866fdd97a3ccd383774"}}