{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:H6TZERS5UXLDXYTONPICA4X3XY","short_pith_number":"pith:H6TZERS5","canonical_record":{"source":{"id":"2207.01117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-03T20:26:44Z","cross_cats_sorted":[],"title_canon_sha256":"09cd3f6f73d8ee11dc24f41abc37cabb2c4bed72da9fb7c267eae606cc81d499","abstract_canon_sha256":"9e79eabb8ffb3f41af418dcfe930ab18b3b29e9fe44437d7a8cb045adb3fc590"},"schema_version":"1.0"},"canonical_sha256":"3fa792465da5d63be26e6bd02072fbbe22de16e18b3db69cbea27f86aad3e71f","source":{"kind":"arxiv","id":"2207.01117","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.01117","created_at":"2026-07-05T04:37:08Z"},{"alias_kind":"arxiv_version","alias_value":"2207.01117v1","created_at":"2026-07-05T04:37:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.01117","created_at":"2026-07-05T04:37:08Z"},{"alias_kind":"pith_short_12","alias_value":"H6TZERS5UXLD","created_at":"2026-07-05T04:37:08Z"},{"alias_kind":"pith_short_16","alias_value":"H6TZERS5UXLDXYTO","created_at":"2026-07-05T04:37:08Z"},{"alias_kind":"pith_short_8","alias_value":"H6TZERS5","created_at":"2026-07-05T04:37:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:H6TZERS5UXLDXYTONPICA4X3XY","target":"record","payload":{"canonical_record":{"source":{"id":"2207.01117","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-03T20:26:44Z","cross_cats_sorted":[],"title_canon_sha256":"09cd3f6f73d8ee11dc24f41abc37cabb2c4bed72da9fb7c267eae606cc81d499","abstract_canon_sha256":"9e79eabb8ffb3f41af418dcfe930ab18b3b29e9fe44437d7a8cb045adb3fc590"},"schema_version":"1.0"},"canonical_sha256":"3fa792465da5d63be26e6bd02072fbbe22de16e18b3db69cbea27f86aad3e71f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:37:08.096493Z","signature_b64":"nsBrQKglq43qSJQwSESp4GGAXOnas8P/VcVbq4D2mP9mwXKnH9NLWPnw44yTkibR7d7xOalFQdr1Aq5boXNVCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3fa792465da5d63be26e6bd02072fbbe22de16e18b3db69cbea27f86aad3e71f","last_reissued_at":"2026-07-05T04:37:08.096023Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:37:08.096023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2207.01117","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-05T04:37:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Or0WgMCsl9edJKylk2lYjk3+whDCTEhu2fy11o9czxRf17b2LZUnl4fRN2eaW0P6S8/GfnV5zBNJeu0eQdEjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:45:22.211974Z"},"content_sha256":"cf5c01d96dbb5c0292a33f0412f2382fc7ab9abf341d6d7db527d1d08f92bf09","schema_version":"1.0","event_id":"sha256:cf5c01d96dbb5c0292a33f0412f2382fc7ab9abf341d6d7db527d1d08f92bf09"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:H6TZERS5UXLDXYTONPICA4X3XY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Saliency-Regularized Deep Multi-Task Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Guangji Bai, Liang Zhao","submitted_at":"2022-07-03T20:26:44Z","abstract_excerpt":"Multitask learning is a framework that enforces multiple learning tasks to share knowledge to improve their generalization abilities. While shallow multitask learning can learn task relations, it can only handle predefined features. Modern deep multitask learning can jointly learn latent features and task sharing, but they are obscure in task relation. Also, they predefine which layers and neurons should share across tasks and cannot learn adaptively. To address these challenges, this paper proposes a new multitask learning framework that jointly learns latent features and explicit task relati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.01117","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/2207.01117/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-05T04:37:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OFfobuoACRhA57vBxGRTjH1XyKcfA00KIpoBGrqOvo7mH4Whf+gr2kOqfkVwQ1KGAsgmwkGqypXD/uGICfe0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-14T08:45:22.212514Z"},"content_sha256":"11bceed2e420d8bc93880d6e9a8435fe4729c6b01ac4b3735be03c0f22954413","schema_version":"1.0","event_id":"sha256:11bceed2e420d8bc93880d6e9a8435fe4729c6b01ac4b3735be03c0f22954413"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H6TZERS5UXLDXYTONPICA4X3XY/bundle.json","state_url":"https://pith.science/pith/H6TZERS5UXLDXYTONPICA4X3XY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H6TZERS5UXLDXYTONPICA4X3XY/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-14T08:45:22Z","links":{"resolver":"https://pith.science/pith/H6TZERS5UXLDXYTONPICA4X3XY","bundle":"https://pith.science/pith/H6TZERS5UXLDXYTONPICA4X3XY/bundle.json","state":"https://pith.science/pith/H6TZERS5UXLDXYTONPICA4X3XY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H6TZERS5UXLDXYTONPICA4X3XY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:H6TZERS5UXLDXYTONPICA4X3XY","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":"9e79eabb8ffb3f41af418dcfe930ab18b3b29e9fe44437d7a8cb045adb3fc590","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-03T20:26:44Z","title_canon_sha256":"09cd3f6f73d8ee11dc24f41abc37cabb2c4bed72da9fb7c267eae606cc81d499"},"schema_version":"1.0","source":{"id":"2207.01117","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2207.01117","created_at":"2026-07-05T04:37:08Z"},{"alias_kind":"arxiv_version","alias_value":"2207.01117v1","created_at":"2026-07-05T04:37:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.01117","created_at":"2026-07-05T04:37:08Z"},{"alias_kind":"pith_short_12","alias_value":"H6TZERS5UXLD","created_at":"2026-07-05T04:37:08Z"},{"alias_kind":"pith_short_16","alias_value":"H6TZERS5UXLDXYTO","created_at":"2026-07-05T04:37:08Z"},{"alias_kind":"pith_short_8","alias_value":"H6TZERS5","created_at":"2026-07-05T04:37:08Z"}],"graph_snapshots":[{"event_id":"sha256:11bceed2e420d8bc93880d6e9a8435fe4729c6b01ac4b3735be03c0f22954413","target":"graph","created_at":"2026-07-05T04:37:08Z","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/2207.01117/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multitask learning is a framework that enforces multiple learning tasks to share knowledge to improve their generalization abilities. While shallow multitask learning can learn task relations, it can only handle predefined features. Modern deep multitask learning can jointly learn latent features and task sharing, but they are obscure in task relation. Also, they predefine which layers and neurons should share across tasks and cannot learn adaptively. To address these challenges, this paper proposes a new multitask learning framework that jointly learns latent features and explicit task relati","authors_text":"Guangji Bai, Liang Zhao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-03T20:26:44Z","title":"Saliency-Regularized Deep Multi-Task Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.01117","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:cf5c01d96dbb5c0292a33f0412f2382fc7ab9abf341d6d7db527d1d08f92bf09","target":"record","created_at":"2026-07-05T04:37:08Z","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":"9e79eabb8ffb3f41af418dcfe930ab18b3b29e9fe44437d7a8cb045adb3fc590","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2022-07-03T20:26:44Z","title_canon_sha256":"09cd3f6f73d8ee11dc24f41abc37cabb2c4bed72da9fb7c267eae606cc81d499"},"schema_version":"1.0","source":{"id":"2207.01117","kind":"arxiv","version":1}},"canonical_sha256":"3fa792465da5d63be26e6bd02072fbbe22de16e18b3db69cbea27f86aad3e71f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3fa792465da5d63be26e6bd02072fbbe22de16e18b3db69cbea27f86aad3e71f","first_computed_at":"2026-07-05T04:37:08.096023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:37:08.096023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nsBrQKglq43qSJQwSESp4GGAXOnas8P/VcVbq4D2mP9mwXKnH9NLWPnw44yTkibR7d7xOalFQdr1Aq5boXNVCw==","signature_status":"signed_v1","signed_at":"2026-07-05T04:37:08.096493Z","signed_message":"canonical_sha256_bytes"},"source_id":"2207.01117","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf5c01d96dbb5c0292a33f0412f2382fc7ab9abf341d6d7db527d1d08f92bf09","sha256:11bceed2e420d8bc93880d6e9a8435fe4729c6b01ac4b3735be03c0f22954413"],"state_sha256":"6580fedbd574daa5cef643216005e87772d0ea0dbe3fb59cd3d1e4ad16b1485c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ab5aQcS8NFGbYg75UbqguthcxQr5jCpRO12UknChQN1PN64KFqiB5ds2qvz2xtp45bNREnLsovyXE46ZceMiAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-14T08:45:22.217602Z","bundle_sha256":"91a58b0f07a1c6c2fb588e6815aede2b362fbedf5d4b13d16471093e7229a893"}}