{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:LVAS2KVNSBDYHBIIE225STW6EA","short_pith_number":"pith:LVAS2KVN","canonical_record":{"source":{"id":"2003.07077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-16T08:58:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"24479064b666c635c3072baf6f328b7a5620830fecfd85a308666437cb6ff02f","abstract_canon_sha256":"bd32fcdadde6a0093c283d74d9973fd6569d69e1aa16f05d7da917583847d6ce"},"schema_version":"1.0"},"canonical_sha256":"5d412d2aad904783850826b5d94ede200710ef9bd289d1050466bf9e41ad230a","source":{"kind":"arxiv","id":"2003.07077","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.07077","created_at":"2026-07-05T00:48:09Z"},{"alias_kind":"arxiv_version","alias_value":"2003.07077v1","created_at":"2026-07-05T00:48:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.07077","created_at":"2026-07-05T00:48:09Z"},{"alias_kind":"pith_short_12","alias_value":"LVAS2KVNSBDY","created_at":"2026-07-05T00:48:09Z"},{"alias_kind":"pith_short_16","alias_value":"LVAS2KVNSBDYHBII","created_at":"2026-07-05T00:48:09Z"},{"alias_kind":"pith_short_8","alias_value":"LVAS2KVN","created_at":"2026-07-05T00:48:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:LVAS2KVNSBDYHBIIE225STW6EA","target":"record","payload":{"canonical_record":{"source":{"id":"2003.07077","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-16T08:58:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"24479064b666c635c3072baf6f328b7a5620830fecfd85a308666437cb6ff02f","abstract_canon_sha256":"bd32fcdadde6a0093c283d74d9973fd6569d69e1aa16f05d7da917583847d6ce"},"schema_version":"1.0"},"canonical_sha256":"5d412d2aad904783850826b5d94ede200710ef9bd289d1050466bf9e41ad230a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:48:09.501530Z","signature_b64":"wbrc8lsVgj25+B7IgxC4hnUV1DsoWUt40Z3CUZl63o5fBQfgETnN5Y78UZA+5j7nix7Q2+4Uoxv5as9z6mqTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d412d2aad904783850826b5d94ede200710ef9bd289d1050466bf9e41ad230a","last_reissued_at":"2026-07-05T00:48:09.501078Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:48:09.501078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2003.07077","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-05T00:48:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"djETsR3aFj65rIGCxN8dPTpjxdjOWriQzkEPNxT752CpKukVVZ9iWhJPstJp9/EiOUzuoYdXMQb0Lm2ALEJeBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T14:45:17.074904Z"},"content_sha256":"db71b266bba9804a3cf67c6129c218db560cf36bf3e28820d7c68171b5ef5b34","schema_version":"1.0","event_id":"sha256:db71b266bba9804a3cf67c6129c218db560cf36bf3e28820d7c68171b5ef5b34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:LVAS2KVNSBDYHBIIE225STW6EA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Interpretable MTL from Heterogeneous Domains using Boosted Tree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Longfei Li, Ya-Lin Zhang","submitted_at":"2020-03-16T08:58:51Z","abstract_excerpt":"Multi-task learning (MTL) aims at improving the generalization performance of several related tasks by leveraging useful information contained in them. However, in industrial scenarios, interpretability is always demanded, and the data of different tasks may be in heterogeneous domains, making the existing methods unsuitable or unsatisfactory. In this paper, following the philosophy of boosted tree, we proposed a two-stage method. In stage one, a common model is built to learn the commonalities using the common features of all instances. Different from the training of conventional boosted tree"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.07077","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/2003.07077/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-05T00:48:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vh9Z37x2+VHFYgKVpLaC/KVFD78bJ51IdWqU58yE1RBfgjFOr5R2EFc93C5zQX/3OV2oad5RqtdJlN4uZELQBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T14:45:17.075991Z"},"content_sha256":"2fe99f0f239c8cfcbefcd1d5031f48ebf5915a6ffb74c30b183701256a82edaf","schema_version":"1.0","event_id":"sha256:2fe99f0f239c8cfcbefcd1d5031f48ebf5915a6ffb74c30b183701256a82edaf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LVAS2KVNSBDYHBIIE225STW6EA/bundle.json","state_url":"https://pith.science/pith/LVAS2KVNSBDYHBIIE225STW6EA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LVAS2KVNSBDYHBIIE225STW6EA/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-20T14:45:17Z","links":{"resolver":"https://pith.science/pith/LVAS2KVNSBDYHBIIE225STW6EA","bundle":"https://pith.science/pith/LVAS2KVNSBDYHBIIE225STW6EA/bundle.json","state":"https://pith.science/pith/LVAS2KVNSBDYHBIIE225STW6EA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LVAS2KVNSBDYHBIIE225STW6EA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:LVAS2KVNSBDYHBIIE225STW6EA","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":"bd32fcdadde6a0093c283d74d9973fd6569d69e1aa16f05d7da917583847d6ce","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-16T08:58:51Z","title_canon_sha256":"24479064b666c635c3072baf6f328b7a5620830fecfd85a308666437cb6ff02f"},"schema_version":"1.0","source":{"id":"2003.07077","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2003.07077","created_at":"2026-07-05T00:48:09Z"},{"alias_kind":"arxiv_version","alias_value":"2003.07077v1","created_at":"2026-07-05T00:48:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2003.07077","created_at":"2026-07-05T00:48:09Z"},{"alias_kind":"pith_short_12","alias_value":"LVAS2KVNSBDY","created_at":"2026-07-05T00:48:09Z"},{"alias_kind":"pith_short_16","alias_value":"LVAS2KVNSBDYHBII","created_at":"2026-07-05T00:48:09Z"},{"alias_kind":"pith_short_8","alias_value":"LVAS2KVN","created_at":"2026-07-05T00:48:09Z"}],"graph_snapshots":[{"event_id":"sha256:2fe99f0f239c8cfcbefcd1d5031f48ebf5915a6ffb74c30b183701256a82edaf","target":"graph","created_at":"2026-07-05T00:48:09Z","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/2003.07077/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Multi-task learning (MTL) aims at improving the generalization performance of several related tasks by leveraging useful information contained in them. However, in industrial scenarios, interpretability is always demanded, and the data of different tasks may be in heterogeneous domains, making the existing methods unsuitable or unsatisfactory. In this paper, following the philosophy of boosted tree, we proposed a two-stage method. In stage one, a common model is built to learn the commonalities using the common features of all instances. Different from the training of conventional boosted tree","authors_text":"Longfei Li, Ya-Lin Zhang","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-16T08:58:51Z","title":"Interpretable MTL from Heterogeneous Domains using Boosted Tree"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2003.07077","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:db71b266bba9804a3cf67c6129c218db560cf36bf3e28820d7c68171b5ef5b34","target":"record","created_at":"2026-07-05T00:48:09Z","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":"bd32fcdadde6a0093c283d74d9973fd6569d69e1aa16f05d7da917583847d6ce","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-03-16T08:58:51Z","title_canon_sha256":"24479064b666c635c3072baf6f328b7a5620830fecfd85a308666437cb6ff02f"},"schema_version":"1.0","source":{"id":"2003.07077","kind":"arxiv","version":1}},"canonical_sha256":"5d412d2aad904783850826b5d94ede200710ef9bd289d1050466bf9e41ad230a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d412d2aad904783850826b5d94ede200710ef9bd289d1050466bf9e41ad230a","first_computed_at":"2026-07-05T00:48:09.501078Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:48:09.501078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wbrc8lsVgj25+B7IgxC4hnUV1DsoWUt40Z3CUZl63o5fBQfgETnN5Y78UZA+5j7nix7Q2+4Uoxv5as9z6mqTBA==","signature_status":"signed_v1","signed_at":"2026-07-05T00:48:09.501530Z","signed_message":"canonical_sha256_bytes"},"source_id":"2003.07077","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:db71b266bba9804a3cf67c6129c218db560cf36bf3e28820d7c68171b5ef5b34","sha256:2fe99f0f239c8cfcbefcd1d5031f48ebf5915a6ffb74c30b183701256a82edaf"],"state_sha256":"5ae914ca1658bea9aacd99038f102f42d70cda68630afaa4c1d2e7936a476db4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NgJX2jiubmypFk8xNst6FwbZymXBzrKmZ/mtPXCUOLOFV1nWjq1ZB1dsBbBIhw5ixH1XRnz7zs73LiJmq/cUAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T14:45:17.084947Z","bundle_sha256":"99b0ef0eafe11669e58d5f64de582f839dc0fac939fd0bfc4d9a412d2a039b34"}}