{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/code/op-copy","entry":"op_copy","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":17,"n_papers_ran":17,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":1,"n_samples_ran":1,"n_samples_fingerprinted":0,"n_places":17,"n_places_pointer_only":11,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":0},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2607.17653","paper":"/paper/arxiv-2607-17653","title":"LFM: Leveraging Foundation Models for Source-Free Universal Domain Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2605.01369","paper":"/paper/arxiv-2605-01369","title":"MU-SHOT-Fi: Self-Supervised Multi-User Wi-Fi Sensing with Source-free Unsupervised Domain Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"AhmedRadwan02/mu-shot-fi","path":"WiDAR/SHOT/uda_widar.py","file_url":"https://github.com/AhmedRadwan02/mu-shot-fi/blob/HEAD/WiDAR/SHOT/uda_widar.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2412.14301","paper":"/paper/what-has-been-overlooked-in-contrastive","title":"What Has Been Overlooked in Contrastive Source-Free Domain Adaptation: Leveraging Source-Informed Latent Augmentation within Neighborhood Context","date":"2024-12-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2411.12558","paper":"/paper/recall-and-refine-a-simple-but-effective","title":"Recall and Refine: A Simple but Effective Source-free Open-set Domain Adaptation Framework","date":"2024-11-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2403.03421","paper":"/paper/lead-learning-decomposition-for-source-free","title":"LEAD: Learning Decomposition for Source-free Universal Domain Adaptation","date":"2024-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ispc-lab/glc","path":"train_source.py","file_url":"https://github.com/ispc-lab/glc/blob/HEAD/train_source.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2307.03133","paper":"/paper/benchmarking-test-time-adaptation-against","title":"Benchmarking Test-Time Adaptation against Distribution Shifts in Image Classification","date":"2023-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuyongcan/benchmark-tta","path":"train_source.py","file_url":"https://github.com/yuyongcan/benchmark-tta/blob/HEAD/train_source.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2211.03876","paper":"/paper/conmix-for-source-free-single-and-multi","title":"CoNMix for Source-free Single and Multi-target Domain Adaptation","date":"2022-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2208.13986","paper":"/paper/uncertainty-induced-transferability","title":"Uncertainty-Induced Transferability Representation for Source-Free Unsupervised Domain Adaptation","date":"2022-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2207.13247","paper":"/paper/concurrent-subsidiary-supervision-for","title":"Concurrent Subsidiary Supervision for Unsupervised Source-Free Domain Adaptation","date":"2022-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albert0147/sfda_neighbors","path":"train_src.py","file_url":"https://github.com/albert0147/sfda_neighbors/blob/HEAD/train_src.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2207.08877","paper":"/paper/prior-knowledge-guided-unsupervised-domain","title":"Prior Knowledge Guided Unsupervised Domain Adaptation","date":"2022-07-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsun/KUDA","path":"DINE/DINE_dist.py","file_url":"https://github.com/tsun/KUDA/blob/HEAD/DINE/DINE_dist.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2205.04183","paper":"/paper/local-prediction-aggregation-a-frustratingly","title":"Attracting and Dispersing: A Simple Approach for Source-free Domain Adaptation","date":"2022-05-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"albert0147/aad_sfda","path":"tar_adaptation.py","file_url":"https://github.com/albert0147/aad_sfda/blob/HEAD/tar_adaptation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2202.00796","paper":"/paper/on-the-benefits-of-selectivity-in-pseudo","title":"On Balancing Bias and Variance in Unsupervised Multi-Source-Free Domain Adaptation","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maohaos2/MSFDA","path":"adapt.py","file_url":"https://github.com/maohaos2/MSFDA/blob/HEAD/adapt.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2107.12585","paper":"/paper/nearest-neighborhood-based-deep-clustering","title":"Nearest Neighborhood-Based Deep Clustering for Source Data-absent Unsupervised Domain Adaptation","date":"2021-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tntek/N2DCX","path":"object/N2DCEX_target.py","file_url":"https://github.com/tntek/N2DCX/blob/HEAD/object/N2DCEX_target.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2104.01539","paper":"/paper/distill-and-fine-tune-effective-adaptation","title":"DINE: Domain Adaptation from Single and Multiple Black-box Predictors","date":"2021-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tim-learn/Dis-tune","path":"DINE_dist.py","file_url":"https://github.com/tim-learn/Dis-tune/blob/HEAD/DINE_dist.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2012.07297","paper":"/paper/source-data-absent-unsupervised-domain","title":"Source Data-absent Unsupervised Domain Adaptation through Hypothesis Transfer and Labeling Transfer","date":"2020-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"2002.08546","paper":"/paper/do-we-really-need-to-access-the-source-data","title":"Do We Really Need to Access the Source Data? Source Hypothesis Transfer for Unsupervised Domain Adaptation","date":"2020-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}},{"arxiv_id":"Liang_DINE_Domain_Adaptation_From_Single_and_Multiple_Black-Box_Predictors_CVPR_2022_paper","paper":null,"title":"arXiv:Liang_DINE_Domain_Adaptation_From_Single_and_Multiple_Black-Box_Predictors_CVPR_2022_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"tim-learn/DINE","path":"DINE_dist.py","file_url":"https://github.com/tim-learn/DINE/blob/HEAD/DINE_dist.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"93a11f62e4a129f0","mcp_get_code":{"code_sha256":"93a11f62e4a129f0"}}]}