{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KIK3X4ZHLBCW6HMMWPGBASNNGG","short_pith_number":"pith:KIK3X4ZH","schema_version":"1.0","canonical_sha256":"5215bbf32758456f1d8cb3cc1049ad3186a2f53c95bf9053a08500ef938bbc2c","source":{"kind":"arxiv","id":"2403.06424","version":1},"attestation_state":"computed","paper":{"title":"Bridging Domains with Approximately Shared Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Qi Lei, Xiang Pan, Ziliang Samuel Zhong","submitted_at":"2024-03-11T04:25:41Z","abstract_excerpt":"Multi-source domain adaptation aims to reduce performance degradation when applying machine learning models to unseen domains. A fundamental challenge is devising the optimal strategy for feature selection. Existing literature is somewhat paradoxical: some advocate for learning invariant features from source domains, while others favor more diverse features. To address the challenge, we propose a statistical framework that distinguishes the utilities of features based on the variance of their correlation to label $y$ across domains. Under our framework, we design and analyze a learning procedu"},"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":"2403.06424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2024-03-11T04:25:41Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"78128792c548a60910b578578fa040a172f407eab140ba21c2b0f151e9429fa4","abstract_canon_sha256":"8aa4b962b0fe3b287085b8caf66f9e3d46b7912624311836430261908766909a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:54:37.884278Z","signature_b64":"rzjFsHiWWExcJQBA7a7BgRBotIxZhLatQciA69F8OribPOM8hABzTjYlMYlBqDqU5oSImhkhPbRKD8hAk6jYBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5215bbf32758456f1d8cb3cc1049ad3186a2f53c95bf9053a08500ef938bbc2c","last_reissued_at":"2026-07-05T07:54:37.883809Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:54:37.883809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bridging Domains with Approximately Shared Features","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"stat.ML","authors_text":"Qi Lei, Xiang Pan, Ziliang Samuel Zhong","submitted_at":"2024-03-11T04:25:41Z","abstract_excerpt":"Multi-source domain adaptation aims to reduce performance degradation when applying machine learning models to unseen domains. A fundamental challenge is devising the optimal strategy for feature selection. Existing literature is somewhat paradoxical: some advocate for learning invariant features from source domains, while others favor more diverse features. To address the challenge, we propose a statistical framework that distinguishes the utilities of features based on the variance of their correlation to label $y$ across domains. Under our framework, we design and analyze a learning procedu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.06424","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/2403.06424/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":"2403.06424","created_at":"2026-07-05T07:54:37.883869+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.06424v1","created_at":"2026-07-05T07:54:37.883869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.06424","created_at":"2026-07-05T07:54:37.883869+00:00"},{"alias_kind":"pith_short_12","alias_value":"KIK3X4ZHLBCW","created_at":"2026-07-05T07:54:37.883869+00:00"},{"alias_kind":"pith_short_16","alias_value":"KIK3X4ZHLBCW6HMM","created_at":"2026-07-05T07:54:37.883869+00:00"},{"alias_kind":"pith_short_8","alias_value":"KIK3X4ZH","created_at":"2026-07-05T07:54:37.883869+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.09850","citing_title":"Elastic Representation: Mitigating Spurious Correlations for Group Robustness","ref_index":43,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KIK3X4ZHLBCW6HMMWPGBASNNGG","json":"https://pith.science/pith/KIK3X4ZHLBCW6HMMWPGBASNNGG.json","graph_json":"https://pith.science/api/pith-number/KIK3X4ZHLBCW6HMMWPGBASNNGG/graph.json","events_json":"https://pith.science/api/pith-number/KIK3X4ZHLBCW6HMMWPGBASNNGG/events.json","paper":"https://pith.science/paper/KIK3X4ZH"},"agent_actions":{"view_html":"https://pith.science/pith/KIK3X4ZHLBCW6HMMWPGBASNNGG","download_json":"https://pith.science/pith/KIK3X4ZHLBCW6HMMWPGBASNNGG.json","view_paper":"https://pith.science/paper/KIK3X4ZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.06424&json=true","fetch_graph":"https://pith.science/api/pith-number/KIK3X4ZHLBCW6HMMWPGBASNNGG/graph.json","fetch_events":"https://pith.science/api/pith-number/KIK3X4ZHLBCW6HMMWPGBASNNGG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KIK3X4ZHLBCW6HMMWPGBASNNGG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KIK3X4ZHLBCW6HMMWPGBASNNGG/action/storage_attestation","attest_author":"https://pith.science/pith/KIK3X4ZHLBCW6HMMWPGBASNNGG/action/author_attestation","sign_citation":"https://pith.science/pith/KIK3X4ZHLBCW6HMMWPGBASNNGG/action/citation_signature","submit_replication":"https://pith.science/pith/KIK3X4ZHLBCW6HMMWPGBASNNGG/action/replication_record"}},"created_at":"2026-07-05T07:54:37.883869+00:00","updated_at":"2026-07-05T07:54:37.883869+00:00"}