{"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/print-row","entry":"print_row","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":14,"n_papers_ran":0,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":0,"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":3,"n_samples_ran":0,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":14,"n_places_pointer_only":7,"n_places_pointer_only_link_open":0,"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":0,"ran_fixture":0,"ran":0,"unverified":3},"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":"2605.16372","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-16372","title":"SWORDBENCH: Evaluating Orthogonality of Steering Image Representations","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Weixin-Liang/MetaShift","path":"experiments/distribution_shift/misc.py","file_url":"https://github.com/Weixin-Liang/MetaShift/blob/HEAD/experiments/distribution_shift/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af3c9a80c8fd1f7a","code_sha256_prefix":"af3c9a80c8fd1f7a","mcp_get_code":{"code_sha256":"af3c9a80c8fd1f7a"}},{"arxiv_id":"2410.23996","arxiv_id_is_arxiv":true,"paper":"/paper/an-information-criterion-for-controlled","title":"An Information Criterion for Controlled Disentanglement of Multimodal Data","date":"2024-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uhlerlab/disentangledssl","path":"synthetic_task/algorithms.py","file_url":"https://github.com/uhlerlab/disentangledssl/blob/HEAD/synthetic_task/algorithms.py","status":"unverified","verification_level":0,"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, uhlerlab/disentangledssl when it was checked","code_sha256":"d7b63020c31d1627","code_sha256_prefix":"d7b63020c31d1627","mcp_get_code":{"code_sha256":"d7b63020c31d1627"}},{"arxiv_id":"2407.09498","arxiv_id_is_arxiv":true,"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/misc.py","file_url":"https://github.com/zybeich/ot-vp/blob/HEAD/domainbed/lib/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6fe6cf9070a01da7","code_sha256_prefix":"6fe6cf9070a01da7","mcp_get_code":{"code_sha256":"6fe6cf9070a01da7"}},{"arxiv_id":"2403.08649","arxiv_id_is_arxiv":true,"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/misc.py","file_url":"https://github.com/liangchen527/causeb/blob/HEAD/domainbed/lib/misc.py","status":"unverified","verification_level":0,"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, liangchen527/causeb when it was checked","code_sha256":"af3c9a80c8fd1f7a","code_sha256_prefix":"af3c9a80c8fd1f7a","mcp_get_code":{"code_sha256":"af3c9a80c8fd1f7a"}},{"arxiv_id":"2308.11158","arxiv_id_is_arxiv":true,"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/misc.py","file_url":"https://github.com/liangchen527/ridg/blob/HEAD/domainbed/lib/misc.py","status":"unverified","verification_level":0,"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, liangchen527/ridg when it was checked","code_sha256":"af3c9a80c8fd1f7a","code_sha256_prefix":"af3c9a80c8fd1f7a","mcp_get_code":{"code_sha256":"af3c9a80c8fd1f7a"}},{"arxiv_id":"2308.04431","arxiv_id_is_arxiv":true,"paper":"/paper/when-more-is-less-incorporating-additional","title":"When More is Less: Incorporating Additional Datasets Can Hurt Performance By Introducing Spurious Correlations","date":"2023-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"basedrhys/ood-generalization","path":"clinicaldg/lib/misc.py","file_url":"https://github.com/basedrhys/ood-generalization/blob/HEAD/clinicaldg/lib/misc.py","status":"unverified","verification_level":0,"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, basedrhys/ood-generalization when it was checked","code_sha256":"af3c9a80c8fd1f7a","code_sha256_prefix":"af3c9a80c8fd1f7a","mcp_get_code":{"code_sha256":"af3c9a80c8fd1f7a"}},{"arxiv_id":"2307.08187","arxiv_id_is_arxiv":true,"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/misc.py","file_url":"https://github.com/hiroki11x/timm_ood_calibration/blob/HEAD/domainbed/lib/misc.py","status":"unverified","verification_level":0,"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":"af3c9a80c8fd1f7a","code_sha256_prefix":"af3c9a80c8fd1f7a","mcp_get_code":{"code_sha256":"af3c9a80c8fd1f7a"}},{"arxiv_id":"2305.01134","arxiv_id_is_arxiv":true,"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/misc.py","file_url":"https://github.com/qdata/pgrad/blob/HEAD/domainbed/lib/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af3c9a80c8fd1f7a","code_sha256_prefix":"af3c9a80c8fd1f7a","mcp_get_code":{"code_sha256":"af3c9a80c8fd1f7a"}},{"arxiv_id":"2208.08914","arxiv_id_is_arxiv":true,"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/misc.py","file_url":"https://github.com/zhengzangw/DoPrompt/blob/HEAD/domainbed/lib/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"af3c9a80c8fd1f7a","code_sha256_prefix":"af3c9a80c8fd1f7a","mcp_get_code":{"code_sha256":"af3c9a80c8fd1f7a"}},{"arxiv_id":"2207.10792","arxiv_id_is_arxiv":true,"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/misc.py","file_url":"https://github.com/mingukjang/tast/blob/HEAD/domainbed/lib/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, mingukjang/tast, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"af3c9a80c8fd1f7a","code_sha256_prefix":"af3c9a80c8fd1f7a","mcp_get_code":{"code_sha256":"af3c9a80c8fd1f7a"}},{"arxiv_id":"2205.13462","arxiv_id_is_arxiv":true,"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/misc.py","file_url":"https://github.com/lins-lab/fedbr/blob/HEAD/fedbr/lib/misc.py","status":"unverified","verification_level":0,"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":"af3c9a80c8fd1f7a","code_sha256_prefix":"af3c9a80c8fd1f7a","mcp_get_code":{"code_sha256":"af3c9a80c8fd1f7a"}},{"arxiv_id":"2111.12853","arxiv_id_is_arxiv":true,"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/misc.py","file_url":"https://github.com/shogi880/DPLCLIP/blob/HEAD/domainbed/lib/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, shogi880/DPLCLIP, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"af3c9a80c8fd1f7a","code_sha256_prefix":"af3c9a80c8fd1f7a","mcp_get_code":{"code_sha256":"af3c9a80c8fd1f7a"}},{"arxiv_id":"2106.02266","arxiv_id_is_arxiv":true,"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/misc.py","file_url":"https://github.com/shahtalebi/SAND-mask/blob/HEAD/domainbed/lib/misc.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, shahtalebi/SAND-mask, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"af3c9a80c8fd1f7a","code_sha256_prefix":"af3c9a80c8fd1f7a","mcp_get_code":{"code_sha256":"af3c9a80c8fd1f7a"}},{"arxiv_id":"1907.02893","arxiv_id_is_arxiv":true,"paper":"/paper/invariant-risk-minimization","title":"Invariant Risk Minimization","date":"2019-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"katoro8989/irm_variants_calibration","path":"domainbed/lib/misc.py","file_url":"https://github.com/katoro8989/irm_variants_calibration/blob/HEAD/domainbed/lib/misc.py","status":"unverified","verification_level":0,"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":"af3c9a80c8fd1f7a","code_sha256_prefix":"af3c9a80c8fd1f7a","mcp_get_code":{"code_sha256":"af3c9a80c8fd1f7a"}}],"record_sha256":"722bf8d546d2d21ae681d4f4f25d7ed07f5f516f8cf0a94652ac9b971db8afe6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}