{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:REF5BQ25QX4WRQ36OBWUTNI3U4","short_pith_number":"pith:REF5BQ25","schema_version":"1.0","canonical_sha256":"890bd0c35d85f968c37e706d49b51ba70312dcc40ddc24585093c92aafaa0bf8","source":{"kind":"arxiv","id":"2306.06510","version":2},"attestation_state":"computed","paper":{"title":"Partial Identifiability for Domain Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Guangyi Chen, Kun Zhang, Lingjing Kong, Petar Stojanov, Shaoan Xie, Victor Akinwande, Weiran Yao, Yujia Zheng","submitted_at":"2023-06-10T19:04:03Z","abstract_excerpt":"Unsupervised domain adaptation is critical to many real-world applications where label information is unavailable in the target domain. In general, without further assumptions, the joint distribution of the features and the label is not identifiable in the target domain. To address this issue, we rely on the property of minimal changes of causal mechanisms across domains to minimize unnecessary influences of distribution shifts. To encode this property, we first formulate the data-generating process using a latent variable model with two partitioned latent subspaces: invariant components whose"},"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":"2306.06510","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-06-10T19:04:03Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ec511277a3fc0d301ccc95a712ab28a5c798c970e13e0c7b3e9f6bede4ebe30c","abstract_canon_sha256":"0ce96a5b3724d283baec227af8f9f5fe2c89bed67daa0852972cd767bdff0f13"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:56:47.176120Z","signature_b64":"zT1XHXlY2KdMXHMnpzCmozEP44aicbq1WQZ8AKuGpxVMPSXa13AKtTFtofiK7EhPnQU0gMoJzRhrYf0fio2cCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"890bd0c35d85f968c37e706d49b51ba70312dcc40ddc24585093c92aafaa0bf8","last_reissued_at":"2026-07-05T09:56:47.175516Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:56:47.175516Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Partial Identifiability for Domain Adaptation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Guangyi Chen, Kun Zhang, Lingjing Kong, Petar Stojanov, Shaoan Xie, Victor Akinwande, Weiran Yao, Yujia Zheng","submitted_at":"2023-06-10T19:04:03Z","abstract_excerpt":"Unsupervised domain adaptation is critical to many real-world applications where label information is unavailable in the target domain. In general, without further assumptions, the joint distribution of the features and the label is not identifiable in the target domain. To address this issue, we rely on the property of minimal changes of causal mechanisms across domains to minimize unnecessary influences of distribution shifts. To encode this property, we first formulate the data-generating process using a latent variable model with two partitioned latent subspaces: invariant components whose"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.06510","kind":"arxiv","version":2},"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/2306.06510/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":"2306.06510","created_at":"2026-07-05T09:56:47.175585+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.06510v2","created_at":"2026-07-05T09:56:47.175585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.06510","created_at":"2026-07-05T09:56:47.175585+00:00"},{"alias_kind":"pith_short_12","alias_value":"REF5BQ25QX4W","created_at":"2026-07-05T09:56:47.175585+00:00"},{"alias_kind":"pith_short_16","alias_value":"REF5BQ25QX4WRQ36","created_at":"2026-07-05T09:56:47.175585+00:00"},{"alias_kind":"pith_short_8","alias_value":"REF5BQ25","created_at":"2026-07-05T09:56:47.175585+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2410.14375","citing_title":"Causal Fine-Tuning under Latent Confounded Shift","ref_index":33,"is_internal_anchor":false},{"citing_arxiv_id":"2601.21350","citing_title":"Factored Causal Representation Learning for Robust Reward Modeling in RLHF","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/REF5BQ25QX4WRQ36OBWUTNI3U4","json":"https://pith.science/pith/REF5BQ25QX4WRQ36OBWUTNI3U4.json","graph_json":"https://pith.science/api/pith-number/REF5BQ25QX4WRQ36OBWUTNI3U4/graph.json","events_json":"https://pith.science/api/pith-number/REF5BQ25QX4WRQ36OBWUTNI3U4/events.json","paper":"https://pith.science/paper/REF5BQ25"},"agent_actions":{"view_html":"https://pith.science/pith/REF5BQ25QX4WRQ36OBWUTNI3U4","download_json":"https://pith.science/pith/REF5BQ25QX4WRQ36OBWUTNI3U4.json","view_paper":"https://pith.science/paper/REF5BQ25","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.06510&json=true","fetch_graph":"https://pith.science/api/pith-number/REF5BQ25QX4WRQ36OBWUTNI3U4/graph.json","fetch_events":"https://pith.science/api/pith-number/REF5BQ25QX4WRQ36OBWUTNI3U4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/REF5BQ25QX4WRQ36OBWUTNI3U4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/REF5BQ25QX4WRQ36OBWUTNI3U4/action/storage_attestation","attest_author":"https://pith.science/pith/REF5BQ25QX4WRQ36OBWUTNI3U4/action/author_attestation","sign_citation":"https://pith.science/pith/REF5BQ25QX4WRQ36OBWUTNI3U4/action/citation_signature","submit_replication":"https://pith.science/pith/REF5BQ25QX4WRQ36OBWUTNI3U4/action/replication_record"}},"created_at":"2026-07-05T09:56:47.175585+00:00","updated_at":"2026-07-05T09:56:47.175585+00:00"}