{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/image-train","entry":"image_train","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+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 = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":18,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":8,"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":10,"n_samples_ran":9,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":19,"n_places_pointer_only":11,"n_places_pointer_only_link_open":5,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":7,"unverified":1},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"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":"2406.02862","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-guidance-information-to-utilize","title":"Rethinking Guidance Information to Utilize Unlabeled Samples:A Label Encoding Perspective","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhangyl660/LERM","path":"UDA/DA/CDAN-LERM/pre_process.py","file_url":"https://github.com/zhangyl660/LERM/blob/HEAD/UDA/DA/CDAN-LERM/pre_process.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, zhangyl660/LERM when it was checked","code_sha256":"782c9941712c32ae","code_sha256_prefix":"782c9941712c32ae","mcp_get_code":{"code_sha256":"782c9941712c32ae"}},{"arxiv_id":"2404.07794","arxiv_id_is_arxiv":true,"paper":"/paper/dgmamba-domain-generalization-via-generalized","title":"DGMamba: Domain Generalization via Generalized State Space Model","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"longshaocong/dgmamba","path":"datautil/imgdata/util.py","file_url":"https://github.com/longshaocong/dgmamba/blob/HEAD/datautil/imgdata/util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, longshaocong/dgmamba when it was checked","code_sha256":"a58ba2e71a236bcb","code_sha256_prefix":"a58ba2e71a236bcb","mcp_get_code":{"code_sha256":"a58ba2e71a236bcb"}},{"arxiv_id":"2402.01887","arxiv_id_is_arxiv":true,"paper":"/paper/on-f-divergence-principled-domain-adaptation","title":"On $f$-Divergence Principled Domain Adaptation: An Improved Framework","date":"2024-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/CDAN","path":"pytorch/pre_process.py","file_url":"https://github.com/thuml/CDAN/blob/HEAD/pytorch/pre_process.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, thuml/CDAN when it was checked","code_sha256":"7ca82968fbea82c4","code_sha256_prefix":"7ca82968fbea82c4","mcp_get_code":{"code_sha256":"7ca82968fbea82c4"}},{"arxiv_id":"2307.03133","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yuyongcan/benchmark-tta when it was checked","code_sha256":"35c2d572ebd185f5","code_sha256_prefix":"35c2d572ebd185f5","mcp_get_code":{"code_sha256":"35c2d572ebd185f5"}},{"arxiv_id":"2211.06612","arxiv_id_is_arxiv":true,"paper":"/paper/divide-and-contrast-source-free-domain","title":"Divide and Contrast: Source-free Domain Adaptation via Adaptive Contrastive Learning","date":"2022-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zyezhang/dac","path":"VisDA/target.py","file_url":"https://github.com/zyezhang/dac/blob/HEAD/VisDA/target.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, zyezhang/dac, is not in the permissive set Syntology serves inline","code_sha256":"cd55b45f072d883a","code_sha256_prefix":"cd55b45f072d883a","mcp_get_code":{"code_sha256":"cd55b45f072d883a"}},{"arxiv_id":"2207.13247","arxiv_id_is_arxiv":true,"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":"office-home/utils.py","file_url":"https://github.com/albert0147/sfda_neighbors/blob/HEAD/office-home/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"620153a1ea154802","code_sha256_prefix":"620153a1ea154802","mcp_get_code":{"code_sha256":"620153a1ea154802"}},{"arxiv_id":"2207.08877","arxiv_id_is_arxiv":true,"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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Albert0147/AaD_SFDA, and GitHub detected no licence in that repository when it was checked","code_sha256":"35c2d572ebd185f5","code_sha256_prefix":"35c2d572ebd185f5","mcp_get_code":{"code_sha256":"35c2d572ebd185f5"}},{"arxiv_id":"2206.06640","arxiv_id_is_arxiv":true,"paper":"/paper/confidence-score-for-source-free-unsupervised","title":"Confidence Score for Source-Free Unsupervised Domain Adaptation","date":"2022-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jhyun17/cowa-jmds","path":"image_target_CoWA.py","file_url":"https://github.com/jhyun17/cowa-jmds/blob/HEAD/image_target_CoWA.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d9601c3485e6033d","code_sha256_prefix":"d9601c3485e6033d","mcp_get_code":{"code_sha256":"d9601c3485e6033d"}},{"arxiv_id":"2205.04183","arxiv_id_is_arxiv":true,"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,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Albert0147/AaD_SFDA when it was checked","code_sha256":"35c2d572ebd185f5","code_sha256_prefix":"35c2d572ebd185f5","mcp_get_code":{"code_sha256":"35c2d572ebd185f5"}},{"arxiv_id":"2202.00796","arxiv_id_is_arxiv":true,"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":"train_source.py","file_url":"https://github.com/maohaos2/MSFDA/blob/HEAD/train_source.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Albert0147/AaD_SFDA, and GitHub detected no licence in that repository when it was checked","code_sha256":"35c2d572ebd185f5","code_sha256_prefix":"35c2d572ebd185f5","mcp_get_code":{"code_sha256":"35c2d572ebd185f5"}},{"arxiv_id":"2202.00796","arxiv_id_is_arxiv":true,"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","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9c0d2ceeef4fc6b3","code_sha256_prefix":"9c0d2ceeef4fc6b3","mcp_get_code":{"code_sha256":"9c0d2ceeef4fc6b3"}},{"arxiv_id":"2108.09645","arxiv_id_is_arxiv":true,"paper":"/paper/an-efficient-mini-batch-method-via-partial","title":"Improving Mini-batch Optimal Transport via Partial Transportation","date":"2021-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"khainb/BoMb-OT","path":"PartialDA/run_mOT.py","file_url":"https://github.com/khainb/BoMb-OT/blob/HEAD/PartialDA/run_mOT.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6d14e3fcb8d93fa1","code_sha256_prefix":"6d14e3fcb8d93fa1","mcp_get_code":{"code_sha256":"6d14e3fcb8d93fa1"}},{"arxiv_id":"2107.12585","arxiv_id_is_arxiv":true,"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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Albert0147/AaD_SFDA, and GitHub detected no licence in that repository when it was checked","code_sha256":"35c2d572ebd185f5","code_sha256_prefix":"35c2d572ebd185f5","mcp_get_code":{"code_sha256":"35c2d572ebd185f5"}},{"arxiv_id":"2104.01539","arxiv_id_is_arxiv":true,"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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Albert0147/AaD_SFDA, and GitHub detected no licence in that repository when it was checked","code_sha256":"35c2d572ebd185f5","code_sha256_prefix":"35c2d572ebd185f5","mcp_get_code":{"code_sha256":"35c2d572ebd185f5"}},{"arxiv_id":"2003.02541","arxiv_id_is_arxiv":true,"paper":"/paper/a-balanced-and-uncertainty-aware-approach-for","title":"A Balanced and Uncertainty-aware Approach for Partial Domain Adaptation","date":"2020-03-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tim-learn/BA3US","path":"run_partial.py","file_url":"https://github.com/tim-learn/BA3US/blob/HEAD/run_partial.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6d14e3fcb8d93fa1","code_sha256_prefix":"6d14e3fcb8d93fa1","mcp_get_code":{"code_sha256":"6d14e3fcb8d93fa1"}},{"arxiv_id":"1908.00347","arxiv_id_is_arxiv":true,"paper":"/paper/central-similarity-hashing-via-hadamard","title":"Central Similarity Quantization for Efficient Image and Video Retrieval","date":"2019-08-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuanli2333/Hadamard-Matrix-for-hashing","path":"pre_process.py","file_url":"https://github.com/yuanli2333/Hadamard-Matrix-for-hashing/blob/HEAD/pre_process.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3331c5176304df6a","code_sha256_prefix":"3331c5176304df6a","mcp_get_code":{"code_sha256":"3331c5176304df6a"}},{"arxiv_id":"1702.00758","arxiv_id_is_arxiv":true,"paper":"/paper/hashnet-deep-learning-to-hash-by-continuation","title":"HashNet: Deep Learning to Hash by Continuation","date":"2017-02-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thuml/HashNet","path":"pytorch/src/pre_process.py","file_url":"https://github.com/thuml/HashNet/blob/HEAD/pytorch/src/pre_process.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3331c5176304df6a","code_sha256_prefix":"3331c5176304df6a","mcp_get_code":{"code_sha256":"3331c5176304df6a"}},{"arxiv_id":"aaai_28150","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28150","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lhrrrrrr/DiDA","path":"utils/utils.py","file_url":"https://github.com/lhrrrrrr/DiDA/blob/HEAD/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"620153a1ea154802","code_sha256_prefix":"620153a1ea154802","mcp_get_code":{"code_sha256":"620153a1ea154802"}},{"arxiv_id":"Liang_DINE_Domain_Adaptation_From_Single_and_Multiple_Black-Box_Predictors_CVPR_2022_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id 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":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Albert0147/AaD_SFDA, and GitHub detected no licence in that repository when it was checked","code_sha256":"35c2d572ebd185f5","code_sha256_prefix":"35c2d572ebd185f5","mcp_get_code":{"code_sha256":"35c2d572ebd185f5"}}],"record_sha256":"371dcf114a803792a509d7c6f44ec9e27b4ef2d88c43398320adba0948105f97","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}