{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4HDNFMQKKDJVQCIU6BBJDVPL72","short_pith_number":"pith:4HDNFMQK","schema_version":"1.0","canonical_sha256":"e1c6d2b20a50d3580914f04291d5ebfeba53d4ba3400ad0ad5eead13cb99bccf","source":{"kind":"arxiv","id":"1909.03442","version":1},"attestation_state":"computed","paper":{"title":"CUDA: Contradistinguisher for Unsupervised Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ambedkar Dukkipati, Sourabh Balgi","submitted_at":"2019-09-08T12:16:33Z","abstract_excerpt":"In this paper, we propose a simple model referred as Contradistinguisher (CTDR) for unsupervised domain adaptation whose objective is to jointly learn to contradistinguish on unlabeled target domain in a fully unsupervised manner along with prior knowledge acquired by supervised learning on an entirely different domain. Most recent works in domain adaptation rely on an indirect way of first aligning the source and target domain distributions and then learn a classifier on a labeled source domain to classify target domain. This approach of an indirect way of addressing the real task of unlabele"},"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":"1909.03442","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-09-08T12:16:33Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"ffa14e1f38f46225c2e5e32f6c56789f77ef440a9b9acc24af1905a4fcf2f89f","abstract_canon_sha256":"a988b68a6c7219573859f21dcf4d2af3e382a28dcc6b93df9fcf5a49b5630463"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:09:19.331729Z","signature_b64":"Ztb9eqWbXwMgHSXoPAtnb3u6cyzlXkMKXi5oD4+4soj5uQHDTt8nAjD6LJLXjjg6KMclXQZ0fIMIi1DjZAKmAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1c6d2b20a50d3580914f04291d5ebfeba53d4ba3400ad0ad5eead13cb99bccf","last_reissued_at":"2026-07-05T01:09:19.331126Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:09:19.331126Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"CUDA: Contradistinguisher for Unsupervised Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ambedkar Dukkipati, Sourabh Balgi","submitted_at":"2019-09-08T12:16:33Z","abstract_excerpt":"In this paper, we propose a simple model referred as Contradistinguisher (CTDR) for unsupervised domain adaptation whose objective is to jointly learn to contradistinguish on unlabeled target domain in a fully unsupervised manner along with prior knowledge acquired by supervised learning on an entirely different domain. Most recent works in domain adaptation rely on an indirect way of first aligning the source and target domain distributions and then learn a classifier on a labeled source domain to classify target domain. This approach of an indirect way of addressing the real task of unlabele"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.03442","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/1909.03442/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1909.03442","created_at":"2026-07-05T01:09:19.331198+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.03442v1","created_at":"2026-07-05T01:09:19.331198+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.03442","created_at":"2026-07-05T01:09:19.331198+00:00"},{"alias_kind":"pith_short_12","alias_value":"4HDNFMQKKDJV","created_at":"2026-07-05T01:09:19.331198+00:00"},{"alias_kind":"pith_short_16","alias_value":"4HDNFMQKKDJVQCIU","created_at":"2026-07-05T01:09:19.331198+00:00"},{"alias_kind":"pith_short_8","alias_value":"4HDNFMQK","created_at":"2026-07-05T01:09:19.331198+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11642","citing_title":"3-Key-Input: Exploring the Theoretical Minimum Keys for Text Entry","ref_index":12,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4HDNFMQKKDJVQCIU6BBJDVPL72","json":"https://pith.science/pith/4HDNFMQKKDJVQCIU6BBJDVPL72.json","graph_json":"https://pith.science/api/pith-number/4HDNFMQKKDJVQCIU6BBJDVPL72/graph.json","events_json":"https://pith.science/api/pith-number/4HDNFMQKKDJVQCIU6BBJDVPL72/events.json","paper":"https://pith.science/paper/4HDNFMQK"},"agent_actions":{"view_html":"https://pith.science/pith/4HDNFMQKKDJVQCIU6BBJDVPL72","download_json":"https://pith.science/pith/4HDNFMQKKDJVQCIU6BBJDVPL72.json","view_paper":"https://pith.science/paper/4HDNFMQK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.03442&json=true","fetch_graph":"https://pith.science/api/pith-number/4HDNFMQKKDJVQCIU6BBJDVPL72/graph.json","fetch_events":"https://pith.science/api/pith-number/4HDNFMQKKDJVQCIU6BBJDVPL72/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4HDNFMQKKDJVQCIU6BBJDVPL72/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4HDNFMQKKDJVQCIU6BBJDVPL72/action/storage_attestation","attest_author":"https://pith.science/pith/4HDNFMQKKDJVQCIU6BBJDVPL72/action/author_attestation","sign_citation":"https://pith.science/pith/4HDNFMQKKDJVQCIU6BBJDVPL72/action/citation_signature","submit_replication":"https://pith.science/pith/4HDNFMQKKDJVQCIU6BBJDVPL72/action/replication_record"}},"created_at":"2026-07-05T01:09:19.331198+00:00","updated_at":"2026-07-05T01:09:19.331198+00:00"}