{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FO4TBIL5LBVZ6RLHYVHKQYMD5X","short_pith_number":"pith:FO4TBIL5","canonical_record":{"source":{"id":"1904.03846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-08T05:39:46Z","cross_cats_sorted":[],"title_canon_sha256":"0b9d3453c06ee8986e732a8577ef632b2db0e418f6db277858032d3b6d248a9f","abstract_canon_sha256":"b52a6d02d65672a159f6be41d7f0503f703a591b768a202d1e90d8715d47b33b"},"schema_version":"1.0"},"canonical_sha256":"2bb930a17d586b9f4567c54ea86183edc6abd5c64b8eb271fd822c604ec33bdc","source":{"kind":"arxiv","id":"1904.03846","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03846","created_at":"2026-05-17T23:49:07Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03846v1","created_at":"2026-05-17T23:49:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03846","created_at":"2026-05-17T23:49:07Z"},{"alias_kind":"pith_short_12","alias_value":"FO4TBIL5LBVZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FO4TBIL5LBVZ6RLH","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FO4TBIL5","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FO4TBIL5LBVZ6RLHYVHKQYMD5X","target":"record","payload":{"canonical_record":{"source":{"id":"1904.03846","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-08T05:39:46Z","cross_cats_sorted":[],"title_canon_sha256":"0b9d3453c06ee8986e732a8577ef632b2db0e418f6db277858032d3b6d248a9f","abstract_canon_sha256":"b52a6d02d65672a159f6be41d7f0503f703a591b768a202d1e90d8715d47b33b"},"schema_version":"1.0"},"canonical_sha256":"2bb930a17d586b9f4567c54ea86183edc6abd5c64b8eb271fd822c604ec33bdc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:07.958660Z","signature_b64":"zpyORtUu2PJX3oLxAL8gnEGRG2wZNjgLalTqlBWy+sx1KdBkr2zJi5TNo/ZOaJVRnGWPVsTGAXyD1JHa833QAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2bb930a17d586b9f4567c54ea86183edc6abd5c64b8eb271fd822c604ec33bdc","last_reissued_at":"2026-05-17T23:49:07.957974Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:07.957974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.03846","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:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pu9GFbKNenWYmL8SXp7jWk37vzbfkA/KJwcbFPixsNQd0fGl4mI3r4qFf1oaec5FkusrP61fVw3oUExqvfuwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:59:01.498585Z"},"content_sha256":"ad08fd693d763819cb28b8bb1a988e12523859d96dfc3ce1597dfa67b2799bb3","schema_version":"1.0","event_id":"sha256:ad08fd693d763819cb28b8bb1a988e12523859d96dfc3ce1597dfa67b2799bb3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FO4TBIL5LBVZ6RLHYVHKQYMD5X","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposition-Based Transfer Distance Metric Learning for Image Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Chao Xu, Dacheng Tao, Tongliang Liu, Yong Luo","submitted_at":"2019-04-08T05:39:46Z","abstract_excerpt":"Distance metric learning (DML) is a critical factor for image analysis and pattern recognition. To learn a robust distance metric for a target task, we need abundant side information (i.e., the similarity/dissimilarity pairwise constraints over the labeled data), which is usually unavailable in practice due to the high labeling cost. This paper considers the transfer learning setting by exploiting the large quantity of side information from certain related, but different source tasks to help with target metric learning (with only a little side information). The state-of-the-art metric learning"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03846","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:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"raiglWsL5wc0BRcIe9zn3n0DSRhmoeCnLBSNwog4425iZWgOQvLY2SBpwk0rKFGqGxSEleWGp0xq+ccjOOKuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T07:59:01.498941Z"},"content_sha256":"f50f77a9d0a60f70b8cd068850fb14210551c8e3073ac66a866c26916f938bb8","schema_version":"1.0","event_id":"sha256:f50f77a9d0a60f70b8cd068850fb14210551c8e3073ac66a866c26916f938bb8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FO4TBIL5LBVZ6RLHYVHKQYMD5X/bundle.json","state_url":"https://pith.science/pith/FO4TBIL5LBVZ6RLHYVHKQYMD5X/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FO4TBIL5LBVZ6RLHYVHKQYMD5X/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-28T07:59:01Z","links":{"resolver":"https://pith.science/pith/FO4TBIL5LBVZ6RLHYVHKQYMD5X","bundle":"https://pith.science/pith/FO4TBIL5LBVZ6RLHYVHKQYMD5X/bundle.json","state":"https://pith.science/pith/FO4TBIL5LBVZ6RLHYVHKQYMD5X/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FO4TBIL5LBVZ6RLHYVHKQYMD5X/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FO4TBIL5LBVZ6RLHYVHKQYMD5X","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":"b52a6d02d65672a159f6be41d7f0503f703a591b768a202d1e90d8715d47b33b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-08T05:39:46Z","title_canon_sha256":"0b9d3453c06ee8986e732a8577ef632b2db0e418f6db277858032d3b6d248a9f"},"schema_version":"1.0","source":{"id":"1904.03846","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.03846","created_at":"2026-05-17T23:49:07Z"},{"alias_kind":"arxiv_version","alias_value":"1904.03846v1","created_at":"2026-05-17T23:49:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.03846","created_at":"2026-05-17T23:49:07Z"},{"alias_kind":"pith_short_12","alias_value":"FO4TBIL5LBVZ","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FO4TBIL5LBVZ6RLH","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FO4TBIL5","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:f50f77a9d0a60f70b8cd068850fb14210551c8e3073ac66a866c26916f938bb8","target":"graph","created_at":"2026-05-17T23:49:07Z","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":"Distance metric learning (DML) is a critical factor for image analysis and pattern recognition. To learn a robust distance metric for a target task, we need abundant side information (i.e., the similarity/dissimilarity pairwise constraints over the labeled data), which is usually unavailable in practice due to the high labeling cost. This paper considers the transfer learning setting by exploiting the large quantity of side information from certain related, but different source tasks to help with target metric learning (with only a little side information). The state-of-the-art metric learning","authors_text":"Chao Xu, Dacheng Tao, Tongliang Liu, Yong Luo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-08T05:39:46Z","title":"Decomposition-Based Transfer Distance Metric Learning for Image Classification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.03846","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:ad08fd693d763819cb28b8bb1a988e12523859d96dfc3ce1597dfa67b2799bb3","target":"record","created_at":"2026-05-17T23:49:07Z","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":"b52a6d02d65672a159f6be41d7f0503f703a591b768a202d1e90d8715d47b33b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-04-08T05:39:46Z","title_canon_sha256":"0b9d3453c06ee8986e732a8577ef632b2db0e418f6db277858032d3b6d248a9f"},"schema_version":"1.0","source":{"id":"1904.03846","kind":"arxiv","version":1}},"canonical_sha256":"2bb930a17d586b9f4567c54ea86183edc6abd5c64b8eb271fd822c604ec33bdc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2bb930a17d586b9f4567c54ea86183edc6abd5c64b8eb271fd822c604ec33bdc","first_computed_at":"2026-05-17T23:49:07.957974Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:07.957974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zpyORtUu2PJX3oLxAL8gnEGRG2wZNjgLalTqlBWy+sx1KdBkr2zJi5TNo/ZOaJVRnGWPVsTGAXyD1JHa833QAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:07.958660Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.03846","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ad08fd693d763819cb28b8bb1a988e12523859d96dfc3ce1597dfa67b2799bb3","sha256:f50f77a9d0a60f70b8cd068850fb14210551c8e3073ac66a866c26916f938bb8"],"state_sha256":"1628be424ea3c5e216c7f9c5a374adf8bd2383ba13427b4dc672429d503cf478"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ThW+Y8AJ1kBG48azxBbx+EknxI2Db6eUwQtALKfYG2Fzm4NsPVIIsA5RZjHdqSYa4M7PgOnU+v4VqYKoaNcJCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T07:59:01.500854Z","bundle_sha256":"342533192e7712c3848f9aa6e81d2762ee8b42656a58b0a961cfd368449ebe0c"}}