{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MNBITDVCCTPN534QAOPFBKTAG7","short_pith_number":"pith:MNBITDVC","schema_version":"1.0","canonical_sha256":"6342898ea214dedeef90039e50aa6037fbc2a45a54a5c0c027da468b40441421","source":{"kind":"arxiv","id":"2403.03421","version":1},"attestation_state":"computed","paper":{"title":"LEAD: Learning Decomposition for Source-free Universal Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Alois Knoll, Changjun Jiang, Florian R\\\"ohrbein, Guang Chen, Lianghua He, Sanqing Qu, Tianpei Zou","submitted_at":"2024-03-06T03:08:20Z","abstract_excerpt":"Universal Domain Adaptation (UniDA) targets knowledge transfer in the presence of both covariate and label shifts. Recently, Source-free Universal Domain Adaptation (SF-UniDA) has emerged to achieve UniDA without access to source data, which tends to be more practical due to data protection policies. The main challenge lies in determining whether covariate-shifted samples belong to target-private unknown categories. Existing methods tackle this either through hand-crafted thresholding or by developing time-consuming iterative clustering strategies. In this paper, we propose a new idea of LEArn"},"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.03421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2024-03-06T03:08:20Z","cross_cats_sorted":["cs.AI","cs.LG"],"title_canon_sha256":"0d518022758896ae4f90529bfc4ca0142f0561b34202309535216de4c882aa40","abstract_canon_sha256":"bb1464f2f597ef32e5ca42e54f66c5100d76c11f7eb37ba85bd7f861237c68a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:52:47.971296Z","signature_b64":"H9RTQ7OpGHLyvLWrGDnuarrhsfqYMvvmu4rwtcJ+QDSBrEdcUOkSsAY79GFL0Rq0SLyLBKhZj/zSfURYl1IWDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6342898ea214dedeef90039e50aa6037fbc2a45a54a5c0c027da468b40441421","last_reissued_at":"2026-07-05T07:52:47.970766Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:52:47.970766Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"LEAD: Learning Decomposition for Source-free Universal Domain Adaptation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.LG"],"primary_cat":"cs.CV","authors_text":"Alois Knoll, Changjun Jiang, Florian R\\\"ohrbein, Guang Chen, Lianghua He, Sanqing Qu, Tianpei Zou","submitted_at":"2024-03-06T03:08:20Z","abstract_excerpt":"Universal Domain Adaptation (UniDA) targets knowledge transfer in the presence of both covariate and label shifts. Recently, Source-free Universal Domain Adaptation (SF-UniDA) has emerged to achieve UniDA without access to source data, which tends to be more practical due to data protection policies. The main challenge lies in determining whether covariate-shifted samples belong to target-private unknown categories. Existing methods tackle this either through hand-crafted thresholding or by developing time-consuming iterative clustering strategies. In this paper, we propose a new idea of LEArn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.03421","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.03421/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.03421","created_at":"2026-07-05T07:52:47.970828+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.03421v1","created_at":"2026-07-05T07:52:47.970828+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.03421","created_at":"2026-07-05T07:52:47.970828+00:00"},{"alias_kind":"pith_short_12","alias_value":"MNBITDVCCTPN","created_at":"2026-07-05T07:52:47.970828+00:00"},{"alias_kind":"pith_short_16","alias_value":"MNBITDVCCTPN534Q","created_at":"2026-07-05T07:52:47.970828+00:00"},{"alias_kind":"pith_short_8","alias_value":"MNBITDVC","created_at":"2026-07-05T07:52:47.970828+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/MNBITDVCCTPN534QAOPFBKTAG7","json":"https://pith.science/pith/MNBITDVCCTPN534QAOPFBKTAG7.json","graph_json":"https://pith.science/api/pith-number/MNBITDVCCTPN534QAOPFBKTAG7/graph.json","events_json":"https://pith.science/api/pith-number/MNBITDVCCTPN534QAOPFBKTAG7/events.json","paper":"https://pith.science/paper/MNBITDVC"},"agent_actions":{"view_html":"https://pith.science/pith/MNBITDVCCTPN534QAOPFBKTAG7","download_json":"https://pith.science/pith/MNBITDVCCTPN534QAOPFBKTAG7.json","view_paper":"https://pith.science/paper/MNBITDVC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.03421&json=true","fetch_graph":"https://pith.science/api/pith-number/MNBITDVCCTPN534QAOPFBKTAG7/graph.json","fetch_events":"https://pith.science/api/pith-number/MNBITDVCCTPN534QAOPFBKTAG7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MNBITDVCCTPN534QAOPFBKTAG7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MNBITDVCCTPN534QAOPFBKTAG7/action/storage_attestation","attest_author":"https://pith.science/pith/MNBITDVCCTPN534QAOPFBKTAG7/action/author_attestation","sign_citation":"https://pith.science/pith/MNBITDVCCTPN534QAOPFBKTAG7/action/citation_signature","submit_replication":"https://pith.science/pith/MNBITDVCCTPN534QAOPFBKTAG7/action/replication_record"}},"created_at":"2026-07-05T07:52:47.970828+00:00","updated_at":"2026-07-05T07:52:47.970828+00:00"}