{"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/configure-model","entry":"configure_model","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":14,"n_papers_ran_no_instrument_failure":6,"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":13,"n_samples_ran":13,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":9,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":18,"n_places_pointer_only":9,"n_places_pointer_only_link_open":2,"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":9,"ran_fixture":0,"ran":4,"unverified":0},"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":"2601.16240","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-16240","title":"Test-Time Adaptation for Speech Emotion Recognition","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"JiahengDong/SETTA","path":"TTAs/awmc.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/awmc.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":"cba1227868760f74","code_sha256_prefix":"cba1227868760f74","mcp_get_code":{"code_sha256":"cba1227868760f74"}},{"arxiv_id":"2601.16240","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-16240","title":"Test-Time Adaptation for Speech Emotion Recognition","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"JiahengDong/SETTA","path":"TTAs/foa.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/foa.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":"9a2691d3cbcb8ac5","code_sha256_prefix":"9a2691d3cbcb8ac5","mcp_get_code":{"code_sha256":"9a2691d3cbcb8ac5"}},{"arxiv_id":"2601.16240","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-16240","title":"Test-Time Adaptation for Speech Emotion Recognition","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"JiahengDong/SETTA","path":"TTAs/lame.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/lame.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":"1e2bf759e443d20d","code_sha256_prefix":"1e2bf759e443d20d","mcp_get_code":{"code_sha256":"1e2bf759e443d20d"}},{"arxiv_id":"2601.16240","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-16240","title":"Test-Time Adaptation for Speech Emotion Recognition","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"JiahengDong/SETTA","path":"TTAs/t3a.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/t3a.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":"909ab68fbaa4f281","code_sha256_prefix":"909ab68fbaa4f281","mcp_get_code":{"code_sha256":"909ab68fbaa4f281"}},{"arxiv_id":"2510.22127","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-22127","title":"Mint: A Simple Test-Time Adaptation of Vision-Language Models against Common Corruptions","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"baowenxuan/Mint","path":"src/methods/utils.py","file_url":"https://github.com/baowenxuan/Mint/blob/HEAD/src/methods/utils.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, baowenxuan/Mint when it was checked","code_sha256":"f0706a15b36dcf6a","code_sha256_prefix":"f0706a15b36dcf6a","mcp_get_code":{"code_sha256":"f0706a15b36dcf6a"}},{"arxiv_id":"2505.16860","arxiv_id_is_arxiv":true,"paper":"/paper/gcal-adapting-graph-models-to-evolving-domain","title":"GCAL: Adapting Graph Models to Evolving Domain Shifts","date":"2025-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joe817/gcal","path":"GCAL.py","file_url":"https://github.com/joe817/gcal/blob/HEAD/GCAL.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, joe817/gcal when it was checked","code_sha256":"8541b1126f4f1e8f","code_sha256_prefix":"8541b1126f4f1e8f","mcp_get_code":{"code_sha256":"8541b1126f4f1e8f"}},{"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/adapt_algorithms.py","file_url":"https://github.com/zybeich/ot-vp/blob/HEAD/domainbed/adapt_algorithms.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":"09762c09de098b26","code_sha256_prefix":"09762c09de098b26","mcp_get_code":{"code_sha256":"09762c09de098b26"}},{"arxiv_id":"2405.16486","arxiv_id_is_arxiv":true,"paper":"/paper/decomposing-the-neurons-activation-sparsity","title":"Decomposing the Neurons: Activation Sparsity via Mixture of Experts for Continual Test Time Adaptation","date":"2024-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"royzry98/moase-pytorch","path":"norm.py","file_url":"https://github.com/royzry98/moase-pytorch/blob/HEAD/norm.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, royzry98/moase-pytorch when it was checked","code_sha256":"8f537ee8d4a9b397","code_sha256_prefix":"8f537ee8d4a9b397","mcp_get_code":{"code_sha256":"8f537ee8d4a9b397"}},{"arxiv_id":"2404.06065","arxiv_id_is_arxiv":true,"paper":"/paper/unified-entropy-optimization-for-open-set","title":"Unified Entropy Optimization for Open-Set Test-Time Adaptation","date":"2024-04-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gaozhengqing/UniEnt","path":"imagenet/norm.py","file_url":"https://github.com/gaozhengqing/UniEnt/blob/HEAD/imagenet/norm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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 royzry98/moase-pytorch, and GitHub detected no licence in that repository when it was checked","code_sha256":"8f537ee8d4a9b397","code_sha256_prefix":"8f537ee8d4a9b397","mcp_get_code":{"code_sha256":"8f537ee8d4a9b397"}},{"arxiv_id":"2311.14402","arxiv_id_is_arxiv":true,"paper":"/paper/tea-test-time-energy-adaptation","title":"TEA: Test-time Energy Adaptation","date":"2023-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuanyige/tea","path":"core/adazoo/norm.py","file_url":"https://github.com/yuanyige/tea/blob/HEAD/core/adazoo/norm.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, yuanyige/tea when it was checked","code_sha256":"8f537ee8d4a9b397","code_sha256_prefix":"8f537ee8d4a9b397","mcp_get_code":{"code_sha256":"8f537ee8d4a9b397"}},{"arxiv_id":"2311.14402","arxiv_id_is_arxiv":true,"paper":"/paper/tea-test-time-energy-adaptation","title":"TEA: Test-time Energy Adaptation","date":"2023-11-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuanyige/tea","path":"core/param.py","file_url":"https://github.com/yuanyige/tea/blob/HEAD/core/param.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, yuanyige/tea when it was checked","code_sha256":"16a89171a04c1ac1","code_sha256_prefix":"16a89171a04c1ac1","mcp_get_code":{"code_sha256":"16a89171a04c1ac1"}},{"arxiv_id":"2310.19011","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-test-time-adaptation-for-super-1","title":"Efficient Test-Time Adaptation for Super-Resolution with Second-Order Degradation and Reconstruction","date":"2023-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DengZeshuai/SRTTA","path":"src/srtta.py","file_url":"https://github.com/DengZeshuai/SRTTA/blob/HEAD/src/srtta.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d06f6abb54aaa2af","code_sha256_prefix":"d06f6abb54aaa2af","mcp_get_code":{"code_sha256":"d06f6abb54aaa2af"}},{"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/adapt_algorithms.py","file_url":"https://github.com/mingukjang/tast/blob/HEAD/domainbed/adapt_algorithms.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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":"09762c09de098b26","code_sha256_prefix":"09762c09de098b26","mcp_get_code":{"code_sha256":"09762c09de098b26"}},{"arxiv_id":"2207.09640","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-adaptation-via-conjugate-pseudo","title":"Test-Time Adaptation via Conjugate Pseudo-labels","date":"2022-07-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/tta_conjugate","path":"cifar_tta_test.py","file_url":"https://github.com/locuslab/tta_conjugate/blob/HEAD/cifar_tta_test.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3f2dcd69307df74d","code_sha256_prefix":"3f2dcd69307df74d","mcp_get_code":{"code_sha256":"3f2dcd69307df74d"}},{"arxiv_id":"2206.15476","arxiv_id_is_arxiv":true,"paper":"/paper/anoshift-a-distribution-shift-benchmark-for","title":"AnoShift: A Distribution Shift Benchmark for Unsupervised Anomaly Detection","date":"2022-06-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bit-ml/anoshift","path":"language_models/model_utils.py","file_url":"https://github.com/bit-ml/anoshift/blob/HEAD/language_models/model_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5a538b08c1e8471b","code_sha256_prefix":"5a538b08c1e8471b","mcp_get_code":{"code_sha256":"5a538b08c1e8471b"}},{"arxiv_id":"2203.05574","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-fly-test-time-adaptation-for-medical","title":"On-the-Fly Test-time Adaptation for Medical Image Segmentation","date":"2022-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeya-maria-jose/on-the-fly-adaptation","path":"val_adaptiveunet.py","file_url":"https://github.com/jeya-maria-jose/on-the-fly-adaptation/blob/HEAD/val_adaptiveunet.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0e62e898cf223451","code_sha256_prefix":"0e62e898cf223451","mcp_get_code":{"code_sha256":"0e62e898cf223451"}},{"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/adapt_algorithms.py","file_url":"https://github.com/shogi880/DPLCLIP/blob/HEAD/domainbed/adapt_algorithms.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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":"09762c09de098b26","code_sha256_prefix":"09762c09de098b26","mcp_get_code":{"code_sha256":"09762c09de098b26"}},{"arxiv_id":"2105.08714","arxiv_id_is_arxiv":true,"paper":"/paper/fighting-gradients-with-gradients-dynamic","title":"Fighting Gradients with Gradients: Dynamic Defenses against Adversarial Attacks","date":"2021-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DequanWang/dent","path":"norm.py","file_url":"https://github.com/DequanWang/dent/blob/HEAD/norm.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"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 royzry98/moase-pytorch, and GitHub detected no licence in that repository when it was checked","code_sha256":"8f537ee8d4a9b397","code_sha256_prefix":"8f537ee8d4a9b397","mcp_get_code":{"code_sha256":"8f537ee8d4a9b397"}}],"record_sha256":"4d999a5439dd8ef232a149f2ae70d257723bc56b2e4f107a3d935e9b5009f6eb","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}