{"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/hashable","entry":"hashable","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":21,"n_papers_ran":21,"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":1,"n_places":21,"n_places_pointer_only":7,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"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":"2407.15085","paper":"/paper/learn-to-preserve-and-diversify-parameter","title":"Learn to Preserve and Diversify: Parameter-Efficient Group with Orthogonal Regularization for Domain Generalization","date":"2024-07-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JudgingH/PEGO","path":"domainbed/lib/query.py","file_url":"https://github.com/JudgingH/PEGO/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2407.09498","paper":"/paper/ot-vp-optimal-transport-guided-visual","title":"OT-VP: Optimal Transport-guided Visual Prompting for Test-Time Adaptation","date":"2024-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zybeich/ot-vp","path":"domainbed/lib/query.py","file_url":"https://github.com/zybeich/ot-vp/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2404.16277","paper":"/paper/causally-inspired-regularization-enables","title":"Causally Inspired Regularization Enables Domain General Representations","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"olawalesalaudeen/tcri","path":"DomainBed/domainbed/lib/query.py","file_url":"https://github.com/olawalesalaudeen/tcri/blob/HEAD/DomainBed/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2403.08649","paper":"/paper/a-causal-inspired-early-branching-structure","title":"A Causal Inspired Early-Branching Structure for Domain Generalization","date":"2024-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liangchen527/causeb","path":"domainbed/lib/query.py","file_url":"https://github.com/liangchen527/causeb/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2401.14846","paper":"/paper/understanding-domain-generalization-a-noise","title":"Understanding Domain Generalization: A Noise Robustness Perspective","date":"2024-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qiaoruiyt/NoiseRobustDG","path":"domainbed/lib/query.py","file_url":"https://github.com/qiaoruiyt/NoiseRobustDG/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2310.08255","paper":"/paper/distilling-from-vision-language-models-for","title":"Leveraging Vision-Language Models for Improving Domain Generalization in Image Classification","date":"2023-10-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/VL2V-ADiP","path":"domainbed/lib/query.py","file_url":"https://github.com/val-iisc/VL2V-ADiP/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2308.11158","paper":"/paper/domain-generalization-via-rationale","title":"Domain Generalization via Rationale Invariance","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liangchen527/ridg","path":"domainbed/lib/query.py","file_url":"https://github.com/liangchen527/ridg/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2307.12502","paper":"/paper/cross-contrastive-feature-perturbation-for","title":"Cross Contrasting Feature Perturbation for Domain Generalization","date":"2023-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hackmebroo/ccfp","path":"lib/query.py","file_url":"https://github.com/hackmebroo/ccfp/blob/HEAD/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2307.08187","paper":"/paper/an-empirical-investigation-of-pre-trained-1","title":"An Empirical Study of Pre-trained Model Selection for Out-of-Distribution Generalization and Calibration","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hiroki11x/timm_ood_calibration","path":"domainbed/lib/query.py","file_url":"https://github.com/hiroki11x/timm_ood_calibration/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2305.13046","paper":"/paper/poem-polarization-of-embeddings-for-domain","title":"POEM: Polarization of Embeddings for Domain-Invariant Representations","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JoSangYoung/Official-POEM","path":"POEM/domainbed/lib/query.py","file_url":"https://github.com/JoSangYoung/Official-POEM/blob/HEAD/POEM/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2305.01134","paper":"/paper/pgrad-learning-principal-gradients-for-domain","title":"PGrad: Learning Principal Gradients For Domain Generalization","date":"2023-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qdata/pgrad","path":"domainbed/lib/query.py","file_url":"https://github.com/qdata/pgrad/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2303.01233","paper":"/paper/domain-aware-triplet-loss-in-domain","title":"Domain-aware Triplet loss in Domain Generalization","date":"2023-03-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"workerbcd/dct","path":"domainbed/lib/query.py","file_url":"https://github.com/workerbcd/dct/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2302.14685","paper":"/paper/dart-diversify-aggregate-repeat-training","title":"DART: Diversify-Aggregate-Repeat Training Improves Generalization of Neural Networks","date":"2023-02-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"val-iisc/DART","path":"domainbed/lib/query.py","file_url":"https://github.com/val-iisc/DART/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2208.08914","paper":"/paper/prompt-vision-transformer-for-domain","title":"Prompt Vision Transformer for Domain Generalization","date":"2022-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengzangw/DoPrompt","path":"domainbed/lib/query.py","file_url":"https://github.com/zhengzangw/DoPrompt/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2207.10792","paper":"/paper/test-time-adaptation-via-self-training-with","title":"Test-Time Adaptation via Self-Training with Nearest Neighbor Information","date":"2022-07-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mingukjang/tast","path":"domainbed/lib/query.py","file_url":"https://github.com/mingukjang/tast/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2206.04046","paper":"/paper/sparse-fusion-mixture-of-experts-are-domain","title":"Sparse Mixture-of-Experts are Domain Generalizable Learners","date":"2022-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luodian/sf-moe-dg","path":"domainbed/lib/query.py","file_url":"https://github.com/luodian/sf-moe-dg/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2205.13462","paper":"/paper/fedaug-reducing-the-local-learning-bias","title":"FedBR: Improving Federated Learning on Heterogeneous Data via Local Learning Bias Reduction","date":"2022-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lins-lab/fedbr","path":"fedbr/lib/query.py","file_url":"https://github.com/lins-lab/fedbr/blob/HEAD/fedbr/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2205.09739","paper":"/paper/diverse-weight-averaging-for-out-of","title":"Diverse Weight Averaging for Out-of-Distribution Generalization","date":"2022-05-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alexrame/diwa","path":"domainbed/lib/query.py","file_url":"https://github.com/alexrame/diwa/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2203.10789","paper":"/paper/domain-generalization-by-mutual-information","title":"Domain Generalization by Mutual-Information Regularization with Pre-trained Models","date":"2022-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kakaobrain/miro","path":"domainbed/lib/query.py","file_url":"https://github.com/kakaobrain/miro/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2111.12853","paper":"/paper/amortized-prompt-lightweight-fine-tuning-for","title":"Domain Prompt Learning for Efficiently Adapting CLIP to Unseen Domains","date":"2021-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shogi880/DPLCLIP","path":"domainbed/lib/query.py","file_url":"https://github.com/shogi880/DPLCLIP/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}},{"arxiv_id":"2106.02266","paper":"/paper/sand-mask-an-enhanced-gradient-masking","title":"SAND-mask: An Enhanced Gradient Masking Strategy for the Discovery of Invariances in Domain Generalization","date":"2021-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shahtalebi/SAND-mask","path":"domainbed/lib/query.py","file_url":"https://github.com/shahtalebi/SAND-mask/blob/HEAD/domainbed/lib/query.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"71a3a61ceed99bf3","mcp_get_code":{"code_sha256":"71a3a61ceed99bf3"}}]}