{"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/image-test","entry":"image_test","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":9,"n_papers_ran":7,"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":5,"n_samples_ran":4,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":3,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":2,"unverified":1},"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","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,"code_sha256_prefix":"f6d74b0470050306","mcp_get_code":{"code_sha256":"f6d74b0470050306"}},{"arxiv_id":"2402.01887","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,"code_sha256_prefix":"560cf0bf3a66afbc","mcp_get_code":{"code_sha256":"560cf0bf3a66afbc"}},{"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":"6e4265b7f707b718","mcp_get_code":{"code_sha256":"6e4265b7f707b718"}},{"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":"6e4265b7f707b718","mcp_get_code":{"code_sha256":"6e4265b7f707b718"}},{"arxiv_id":"2108.09645","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,"code_sha256_prefix":"60166088c825b407","mcp_get_code":{"code_sha256":"60166088c825b407"}},{"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/SHOT","path":"object/image_multisource.py","file_url":"https://github.com/tim-learn/SHOT/blob/HEAD/object/image_multisource.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":"6e4265b7f707b718","mcp_get_code":{"code_sha256":"6e4265b7f707b718"}},{"arxiv_id":"2003.02541","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,"code_sha256_prefix":"60166088c825b407","mcp_get_code":{"code_sha256":"60166088c825b407"}},{"arxiv_id":"1908.00347","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dff451db0315485c","mcp_get_code":{"code_sha256":"dff451db0315485c"}},{"arxiv_id":"1702.00758","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"dff451db0315485c","mcp_get_code":{"code_sha256":"dff451db0315485c"}}]}