{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:5DYVCKKQVHCQ5XNAJG6DIQW6FQ","short_pith_number":"pith:5DYVCKKQ","schema_version":"1.0","canonical_sha256":"e8f1512950a9c50edda049bc3442de2c17958a0003b35d599cf284918e4fd40d","source":{"kind":"arxiv","id":"2503.10685","version":2},"attestation_state":"computed","paper":{"title":"VFM-UDA++: Improving Network Architectures and Data Strategies for Unsupervised Domain Adaptive Semantic Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV"],"primary_cat":"cs.CV","authors_text":"Brun\\'o B. Englert, Gijs Dubbelman","submitted_at":"2025-03-11T19:57:52Z","abstract_excerpt":"Unsupervised Domain Adaptation (UDA) enables strong generalization from a labeled source domain to an unlabeled target domain, often with limited data. In parallel, Vision Foundation Models (VFMs) pretrained at scale without labels have also shown impressive downstream performance and generalization. This motivates us to explore how UDA can best leverage VFMs. Prior work (VFM-UDA) demonstrated that replacing a standard ImageNet-pretrained encoder with a VFM improves generalization. However, it also showed that commonly used feature distance losses harm performance when applied to VFMs. Additio"},"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":"2503.10685","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2025-03-11T19:57:52Z","cross_cats_sorted":["eess.IV"],"title_canon_sha256":"4e86d5944ded69cadeb99d0a2a87b74969074322e75731e581e7ed98884e8ffd","abstract_canon_sha256":"0c5dbe72a2b1530ff07afeeb456f9d737ed67838cd25402a34fbaad0d761acdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:23.754117Z","signature_b64":"hnuXSwDw4jiH3gFUjDlQW+zmwTh2Y9OyJygGAF9xayVHWw5VWCXq9+Of3FwEbuEWaD2zo1eAwppyxpfvsMC5Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8f1512950a9c50edda049bc3442de2c17958a0003b35d599cf284918e4fd40d","last_reissued_at":"2026-07-05T11:51:23.753626Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:23.753626Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"VFM-UDA++: Improving Network Architectures and Data Strategies for Unsupervised Domain Adaptive Semantic Segmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.IV"],"primary_cat":"cs.CV","authors_text":"Brun\\'o B. Englert, Gijs Dubbelman","submitted_at":"2025-03-11T19:57:52Z","abstract_excerpt":"Unsupervised Domain Adaptation (UDA) enables strong generalization from a labeled source domain to an unlabeled target domain, often with limited data. In parallel, Vision Foundation Models (VFMs) pretrained at scale without labels have also shown impressive downstream performance and generalization. This motivates us to explore how UDA can best leverage VFMs. Prior work (VFM-UDA) demonstrated that replacing a standard ImageNet-pretrained encoder with a VFM improves generalization. However, it also showed that commonly used feature distance losses harm performance when applied to VFMs. Additio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.10685","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/2503.10685/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":"2503.10685","created_at":"2026-07-05T11:51:23.753678+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.10685v2","created_at":"2026-07-05T11:51:23.753678+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.10685","created_at":"2026-07-05T11:51:23.753678+00:00"},{"alias_kind":"pith_short_12","alias_value":"5DYVCKKQVHCQ","created_at":"2026-07-05T11:51:23.753678+00:00"},{"alias_kind":"pith_short_16","alias_value":"5DYVCKKQVHCQ5XNA","created_at":"2026-07-05T11:51:23.753678+00:00"},{"alias_kind":"pith_short_8","alias_value":"5DYVCKKQ","created_at":"2026-07-05T11:51:23.753678+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.18190","citing_title":"What is the Added Value of UDA in the VFM Era?","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5DYVCKKQVHCQ5XNAJG6DIQW6FQ","json":"https://pith.science/pith/5DYVCKKQVHCQ5XNAJG6DIQW6FQ.json","graph_json":"https://pith.science/api/pith-number/5DYVCKKQVHCQ5XNAJG6DIQW6FQ/graph.json","events_json":"https://pith.science/api/pith-number/5DYVCKKQVHCQ5XNAJG6DIQW6FQ/events.json","paper":"https://pith.science/paper/5DYVCKKQ"},"agent_actions":{"view_html":"https://pith.science/pith/5DYVCKKQVHCQ5XNAJG6DIQW6FQ","download_json":"https://pith.science/pith/5DYVCKKQVHCQ5XNAJG6DIQW6FQ.json","view_paper":"https://pith.science/paper/5DYVCKKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.10685&json=true","fetch_graph":"https://pith.science/api/pith-number/5DYVCKKQVHCQ5XNAJG6DIQW6FQ/graph.json","fetch_events":"https://pith.science/api/pith-number/5DYVCKKQVHCQ5XNAJG6DIQW6FQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5DYVCKKQVHCQ5XNAJG6DIQW6FQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5DYVCKKQVHCQ5XNAJG6DIQW6FQ/action/storage_attestation","attest_author":"https://pith.science/pith/5DYVCKKQVHCQ5XNAJG6DIQW6FQ/action/author_attestation","sign_citation":"https://pith.science/pith/5DYVCKKQVHCQ5XNAJG6DIQW6FQ/action/citation_signature","submit_replication":"https://pith.science/pith/5DYVCKKQVHCQ5XNAJG6DIQW6FQ/action/replication_record"}},"created_at":"2026-07-05T11:51:23.753678+00:00","updated_at":"2026-07-05T11:51:23.753678+00:00"}