{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7ZGI4Y3WZ2NGW6AEKCP2BTPWD5","short_pith_number":"pith:7ZGI4Y3W","schema_version":"1.0","canonical_sha256":"fe4c8e6376ce9a6b7804509fa0cdf61f4830170a8a6c700f0a6e7e6d0f8bf1de","source":{"kind":"arxiv","id":"1905.10748","version":4},"attestation_state":"computed","paper":{"title":"Learning Smooth Representation for Unsupervised Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Die Hu, Guanyu Cai, Hesham Alhumade, Lianghua He, Mengchu Zhou","submitted_at":"2019-05-26T06:55:30Z","abstract_excerpt":"Typical adversarial-training-based unsupervised domain adaptation methods are vulnerable when the source and target datasets are highly-complex or exhibit a large discrepancy between their data distributions. Recently, several Lipschitz-constraint-based methods have been explored. The satisfaction of Lipschitz continuity guarantees a remarkable performance on a target domain. However, they lack a mathematical analysis of why a Lipschitz constraint is beneficial to unsupervised domain adaptation and usually perform poorly on large-scale datasets. In this paper, we take the principle of utilizin"},"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":"1905.10748","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2019-05-26T06:55:30Z","cross_cats_sorted":[],"title_canon_sha256":"56637c46fccd92b5985207682bc0a7ea73730129a616e135323270d92e3fb025","abstract_canon_sha256":"84be2b05d05322615f3e100a1cc1be6d9ef3761d4578fe870d168287c3946933"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:05:41.150908Z","signature_b64":"byqQYKHtHojBLGtdNGJJblNr8Y1l4DT8d2AwpGxrtGjdJcKJiOYgBh3Xd888G395t72n9PRkHhnOQpgrK32SBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe4c8e6376ce9a6b7804509fa0cdf61f4830170a8a6c700f0a6e7e6d0f8bf1de","last_reissued_at":"2026-07-05T03:05:41.150476Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:05:41.150476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Smooth Representation for Unsupervised Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Die Hu, Guanyu Cai, Hesham Alhumade, Lianghua He, Mengchu Zhou","submitted_at":"2019-05-26T06:55:30Z","abstract_excerpt":"Typical adversarial-training-based unsupervised domain adaptation methods are vulnerable when the source and target datasets are highly-complex or exhibit a large discrepancy between their data distributions. Recently, several Lipschitz-constraint-based methods have been explored. The satisfaction of Lipschitz continuity guarantees a remarkable performance on a target domain. However, they lack a mathematical analysis of why a Lipschitz constraint is beneficial to unsupervised domain adaptation and usually perform poorly on large-scale datasets. In this paper, we take the principle of utilizin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10748","kind":"arxiv","version":4},"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/1905.10748/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":"1905.10748","created_at":"2026-07-05T03:05:41.150533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10748v4","created_at":"2026-07-05T03:05:41.150533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10748","created_at":"2026-07-05T03:05:41.150533+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZGI4Y3WZ2NG","created_at":"2026-07-05T03:05:41.150533+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZGI4Y3WZ2NGW6AE","created_at":"2026-07-05T03:05:41.150533+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZGI4Y3W","created_at":"2026-07-05T03:05:41.150533+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/7ZGI4Y3WZ2NGW6AEKCP2BTPWD5","json":"https://pith.science/pith/7ZGI4Y3WZ2NGW6AEKCP2BTPWD5.json","graph_json":"https://pith.science/api/pith-number/7ZGI4Y3WZ2NGW6AEKCP2BTPWD5/graph.json","events_json":"https://pith.science/api/pith-number/7ZGI4Y3WZ2NGW6AEKCP2BTPWD5/events.json","paper":"https://pith.science/paper/7ZGI4Y3W"},"agent_actions":{"view_html":"https://pith.science/pith/7ZGI4Y3WZ2NGW6AEKCP2BTPWD5","download_json":"https://pith.science/pith/7ZGI4Y3WZ2NGW6AEKCP2BTPWD5.json","view_paper":"https://pith.science/paper/7ZGI4Y3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10748&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZGI4Y3WZ2NGW6AEKCP2BTPWD5/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZGI4Y3WZ2NGW6AEKCP2BTPWD5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZGI4Y3WZ2NGW6AEKCP2BTPWD5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZGI4Y3WZ2NGW6AEKCP2BTPWD5/action/storage_attestation","attest_author":"https://pith.science/pith/7ZGI4Y3WZ2NGW6AEKCP2BTPWD5/action/author_attestation","sign_citation":"https://pith.science/pith/7ZGI4Y3WZ2NGW6AEKCP2BTPWD5/action/citation_signature","submit_replication":"https://pith.science/pith/7ZGI4Y3WZ2NGW6AEKCP2BTPWD5/action/replication_record"}},"created_at":"2026-07-05T03:05:41.150533+00:00","updated_at":"2026-07-05T03:05:41.150533+00:00"}