{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KQIZJ72AXSVFUB27AUAC2UAJBU","short_pith_number":"pith:KQIZJ72A","schema_version":"1.0","canonical_sha256":"541194ff40bcaa5a075f05002d50090d02f5e53111c2586aa3d13ca3347a503a","source":{"kind":"arxiv","id":"1807.02552","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1807.02552","created_at":"2026-05-18T00:11:16.780550+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.02552v1","created_at":"2026-05-18T00:11:16.780550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.02552","created_at":"2026-05-18T00:11:16.780550+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQIZJ72AXSVF","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQIZJ72AXSVFUB27","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQIZJ72A","created_at":"2026-05-18T12:32:33.847187+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KQIZJ72AXSVFUB27AUAC2UAJBU","json":"https://pith.science/pith/KQIZJ72AXSVFUB27AUAC2UAJBU.json","graph_json":"https://pith.science/api/pith-number/KQIZJ72AXSVFUB27AUAC2UAJBU/graph.json","events_json":"https://pith.science/api/pith-number/KQIZJ72AXSVFUB27AUAC2UAJBU/events.json","paper":"https://pith.science/paper/KQIZJ72A"},"agent_actions":{"view_html":"https://pith.science/pith/KQIZJ72AXSVFUB27AUAC2UAJBU","download_json":"https://pith.science/pith/KQIZJ72AXSVFUB27AUAC2UAJBU.json","view_paper":"https://pith.science/paper/KQIZJ72A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.02552&json=true","fetch_graph":"https://pith.science/api/pith-number/KQIZJ72AXSVFUB27AUAC2UAJBU/graph.json","fetch_events":"https://pith.science/api/pith-number/KQIZJ72AXSVFUB27AUAC2UAJBU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQIZJ72AXSVFUB27AUAC2UAJBU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQIZJ72AXSVFUB27AUAC2UAJBU/action/storage_attestation","attest_author":"https://pith.science/pith/KQIZJ72AXSVFUB27AUAC2UAJBU/action/author_attestation","sign_citation":"https://pith.science/pith/KQIZJ72AXSVFUB27AUAC2UAJBU/action/citation_signature","submit_replication":"https://pith.science/pith/KQIZJ72AXSVFUB27AUAC2UAJBU/action/replication_record"}},"created_at":"2026-05-18T00:11:16.780550+00:00","updated_at":"2026-05-18T00:11:16.780550+00:00"}