{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SLHZXBO5WDE3Z3H3XI2MRYEBES","short_pith_number":"pith:SLHZXBO5","schema_version":"1.0","canonical_sha256":"92cf9b85ddb0c9bcecfbba34c8e081249ae9c5bd0a29bdcfca7263900f5d8f0d","source":{"kind":"arxiv","id":"2607.28125","version":1},"attestation_state":"computed","paper":{"title":"Towards Practical Algorithm Selection for Unsupervised Domain Adaptation in Medical Imaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Daniel Santak Wolf, Heiko Hillenhagen, Luisa Gall\\'ee, Michael G\\\"otz, Yiheng Xiong","submitted_at":"2026-07-30T12:34:07Z","abstract_excerpt":"Numerous unsupervised domain adaptation (UDA) algori-thms exist, but for clinical practice, selecting the best-suited one along with proper hyperparameters often remains unclear, as the unlabeled deployment (target) domain prevents direct evaluation. We propose a label-free criterion that jointly selects the algorithm and hyperparameters for UDA. Given a pool of candidate models from multiple algorithms trained with different hyperparameters, our approach scores each candidate against an agreement reference, and selects the one with the highest score. The agreement reference is constructed in "},"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":"2607.28125","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2026-07-30T12:34:07Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ca9446cd6e51d2790315f978a03664dd703c396fe1eb33b27b057576d51eb722","abstract_canon_sha256":"03f1bc3c26ee8310c493dfd8fb8037592dc64b0ebaf7dd1f3823a9a81977b827"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92cf9b85ddb0c9bcecfbba34c8e081249ae9c5bd0a29bdcfca7263900f5d8f0d","last_reissued_at":"2026-07-31T01:35:49.324098Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-31T01:35:49.324098Z"},"graph_snapshot":{"paper":{"title":"Towards Practical Algorithm Selection for Unsupervised Domain Adaptation in Medical Imaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CV","authors_text":"Daniel Santak Wolf, Heiko Hillenhagen, Luisa Gall\\'ee, Michael G\\\"otz, Yiheng Xiong","submitted_at":"2026-07-30T12:34:07Z","abstract_excerpt":"Numerous unsupervised domain adaptation (UDA) algori-thms exist, but for clinical practice, selecting the best-suited one along with proper hyperparameters often remains unclear, as the unlabeled deployment (target) domain prevents direct evaluation. We propose a label-free criterion that jointly selects the algorithm and hyperparameters for UDA. Given a pool of candidate models from multiple algorithms trained with different hyperparameters, our approach scores each candidate against an agreement reference, and selects the one with the highest score. The agreement reference is constructed in "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.28125","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/2607.28125/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":"2607.28125","created_at":"2026-07-31T01:35:49.327251+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.28125v1","created_at":"2026-07-31T01:35:49.327251+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.28125","created_at":"2026-07-31T01:35:49.327251+00:00"},{"alias_kind":"pith_short_12","alias_value":"SLHZXBO5WDE3","created_at":"2026-07-31T01:35:49.327251+00:00"},{"alias_kind":"pith_short_16","alias_value":"SLHZXBO5WDE3Z3H3","created_at":"2026-07-31T01:35:49.327251+00:00"},{"alias_kind":"pith_short_8","alias_value":"SLHZXBO5","created_at":"2026-07-31T01:35:49.327251+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/SLHZXBO5WDE3Z3H3XI2MRYEBES","json":"https://pith.science/pith/SLHZXBO5WDE3Z3H3XI2MRYEBES.json","graph_json":"https://pith.science/api/pith-number/SLHZXBO5WDE3Z3H3XI2MRYEBES/graph.json","events_json":"https://pith.science/api/pith-number/SLHZXBO5WDE3Z3H3XI2MRYEBES/events.json","paper":"https://pith.science/paper/SLHZXBO5"},"agent_actions":{"view_html":"https://pith.science/pith/SLHZXBO5WDE3Z3H3XI2MRYEBES","download_json":"https://pith.science/pith/SLHZXBO5WDE3Z3H3XI2MRYEBES.json","view_paper":"https://pith.science/paper/SLHZXBO5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.28125&json=true","fetch_graph":"https://pith.science/api/pith-number/SLHZXBO5WDE3Z3H3XI2MRYEBES/graph.json","fetch_events":"https://pith.science/api/pith-number/SLHZXBO5WDE3Z3H3XI2MRYEBES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SLHZXBO5WDE3Z3H3XI2MRYEBES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SLHZXBO5WDE3Z3H3XI2MRYEBES/action/storage_attestation","attest_author":"https://pith.science/pith/SLHZXBO5WDE3Z3H3XI2MRYEBES/action/author_attestation","sign_citation":"https://pith.science/pith/SLHZXBO5WDE3Z3H3XI2MRYEBES/action/citation_signature","submit_replication":"https://pith.science/pith/SLHZXBO5WDE3Z3H3XI2MRYEBES/action/replication_record"}},"created_at":"2026-07-31T01:35:49.327251+00:00","updated_at":"2026-07-31T01:35:49.327251+00:00"}