{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KQIZJ72AXSVFUB27AUAC2UAJBU","short_pith_number":"pith:KQIZJ72A","canonical_record":{"source":{"id":"1807.02552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-06T19:21:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8038850eb254df9dd35502020636689737c57adae0117bf2b4234d96206beb1b","abstract_canon_sha256":"2bffd92a8e5723ce51133ff6cf24a110c65a0e318b03d7f52fed353f0436ecb8"},"schema_version":"1.0"},"canonical_sha256":"541194ff40bcaa5a075f05002d50090d02f5e53111c2586aa3d13ca3347a503a","source":{"kind":"arxiv","id":"1807.02552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02552","created_at":"2026-05-18T00:11:16Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02552v1","created_at":"2026-05-18T00:11:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02552","created_at":"2026-05-18T00:11:16Z"},{"alias_kind":"pith_short_12","alias_value":"KQIZJ72AXSVF","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KQIZJ72AXSVFUB27","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KQIZJ72A","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KQIZJ72AXSVFUB27AUAC2UAJBU","target":"record","payload":{"canonical_record":{"source":{"id":"1807.02552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-06T19:21:59Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8038850eb254df9dd35502020636689737c57adae0117bf2b4234d96206beb1b","abstract_canon_sha256":"2bffd92a8e5723ce51133ff6cf24a110c65a0e318b03d7f52fed353f0436ecb8"},"schema_version":"1.0"},"canonical_sha256":"541194ff40bcaa5a075f05002d50090d02f5e53111c2586aa3d13ca3347a503a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:16.781100Z","signature_b64":"Kfw400rTLPlu9V6XtfPJ0bbpkda8gHqUzhKeBJ4hl01YAB1hK6jMPeCAQg72K4DqRrvoudWKev6Mle+IUDaABg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"541194ff40bcaa5a075f05002d50090d02f5e53111c2586aa3d13ca3347a503a","last_reissued_at":"2026-05-18T00:11:16.780460Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:16.780460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1807.02552","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-18T00:11:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qt+CdhH6VPuYGsROtpjwxiCcgC3Y6X9w9SljNlBugcqebzmEHXTn+mVQVgVCF3oIbbwTOYCC0XJyVXHkNmN8Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:19:17.088542Z"},"content_sha256":"c2bd79e6df34775626f3fd4b0df5aa20a82cdf208c40d8e5e8dfaabe2102fdab","schema_version":"1.0","event_id":"sha256:c2bd79e6df34775626f3fd4b0df5aa20a82cdf208c40d8e5e8dfaabe2102fdab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KQIZJ72AXSVFUB27AUAC2UAJBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"M-ADDA: Unsupervised Domain Adaptation with Deep Metric Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Issam Laradji, Reza Babanezhad","submitted_at":"2018-07-06T19:21:59Z","abstract_excerpt":"Unsupervised domain adaptation techniques have been successful for a wide range of problems where supervised labels are limited. The task is to classify an unlabeled `target' dataset by leveraging a labeled `source' dataset that comes from a slightly similar distribution. We propose metric-based adversarial discriminative domain adaptation (M-ADDA) which performs two main steps. First, it uses a metric learning approach to train the source model on the source dataset by optimizing the triplet loss function. This results in clusters where embeddings of the same label are close to each other and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02552","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-18T00:11:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RsVmBFE9aBtDvAMUkx8C+3KMIELvPf0amshfpx7RMdKyMh25fftYSuMMjfgizkEFsF6JqEYss/Qg6ntFwh9bCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:19:17.089106Z"},"content_sha256":"cbeb3a3766beb2dd62207df773c14fbe6b3ee6f8f380cb912642f008313ad3a2","schema_version":"1.0","event_id":"sha256:cbeb3a3766beb2dd62207df773c14fbe6b3ee6f8f380cb912642f008313ad3a2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KQIZJ72AXSVFUB27AUAC2UAJBU/bundle.json","state_url":"https://pith.science/pith/KQIZJ72AXSVFUB27AUAC2UAJBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KQIZJ72AXSVFUB27AUAC2UAJBU/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-06-06T21:19:17Z","links":{"resolver":"https://pith.science/pith/KQIZJ72AXSVFUB27AUAC2UAJBU","bundle":"https://pith.science/pith/KQIZJ72AXSVFUB27AUAC2UAJBU/bundle.json","state":"https://pith.science/pith/KQIZJ72AXSVFUB27AUAC2UAJBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KQIZJ72AXSVFUB27AUAC2UAJBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KQIZJ72AXSVFUB27AUAC2UAJBU","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":"2bffd92a8e5723ce51133ff6cf24a110c65a0e318b03d7f52fed353f0436ecb8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-06T19:21:59Z","title_canon_sha256":"8038850eb254df9dd35502020636689737c57adae0117bf2b4234d96206beb1b"},"schema_version":"1.0","source":{"id":"1807.02552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1807.02552","created_at":"2026-05-18T00:11:16Z"},{"alias_kind":"arxiv_version","alias_value":"1807.02552v1","created_at":"2026-05-18T00:11:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02552","created_at":"2026-05-18T00:11:16Z"},{"alias_kind":"pith_short_12","alias_value":"KQIZJ72AXSVF","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KQIZJ72AXSVFUB27","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KQIZJ72A","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:cbeb3a3766beb2dd62207df773c14fbe6b3ee6f8f380cb912642f008313ad3a2","target":"graph","created_at":"2026-05-18T00:11:16Z","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":"Unsupervised domain adaptation techniques have been successful for a wide range of problems where supervised labels are limited. The task is to classify an unlabeled `target' dataset by leveraging a labeled `source' dataset that comes from a slightly similar distribution. We propose metric-based adversarial discriminative domain adaptation (M-ADDA) which performs two main steps. First, it uses a metric learning approach to train the source model on the source dataset by optimizing the triplet loss function. This results in clusters where embeddings of the same label are close to each other and","authors_text":"Issam Laradji, Reza Babanezhad","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-06T19:21:59Z","title":"M-ADDA: Unsupervised Domain Adaptation with Deep Metric Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.02552","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:c2bd79e6df34775626f3fd4b0df5aa20a82cdf208c40d8e5e8dfaabe2102fdab","target":"record","created_at":"2026-05-18T00:11:16Z","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":"2bffd92a8e5723ce51133ff6cf24a110c65a0e318b03d7f52fed353f0436ecb8","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-07-06T19:21:59Z","title_canon_sha256":"8038850eb254df9dd35502020636689737c57adae0117bf2b4234d96206beb1b"},"schema_version":"1.0","source":{"id":"1807.02552","kind":"arxiv","version":1}},"canonical_sha256":"541194ff40bcaa5a075f05002d50090d02f5e53111c2586aa3d13ca3347a503a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"541194ff40bcaa5a075f05002d50090d02f5e53111c2586aa3d13ca3347a503a","first_computed_at":"2026-05-18T00:11:16.780460Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:11:16.780460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kfw400rTLPlu9V6XtfPJ0bbpkda8gHqUzhKeBJ4hl01YAB1hK6jMPeCAQg72K4DqRrvoudWKev6Mle+IUDaABg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:11:16.781100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1807.02552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c2bd79e6df34775626f3fd4b0df5aa20a82cdf208c40d8e5e8dfaabe2102fdab","sha256:cbeb3a3766beb2dd62207df773c14fbe6b3ee6f8f380cb912642f008313ad3a2"],"state_sha256":"7f3caedd72a7e8d3f6477a4c3de914b5fa8018ff1fa627c689eb59a043f71bc8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cqRr4G9Nj4u36p/0nULZUkkqzm2DVz+PC1Dsxl1fVu4tPBgELkyVLXPOdXTRTrvvLCTdbraax+TuGPtJJjTxCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:19:17.092938Z","bundle_sha256":"8dc6b1620aadcea35f9cd975fecbe7d445f6b98566bd6bb7d2641b12866a5933"}}