{"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/copy-model-and-optimizer","entry":"copy_model_and_optimizer","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":13,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":12,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":7,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":13,"n_places_pointer_only":10,"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":7,"ran_fixture":0,"ran":1,"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":"2605.17743","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-17743","title":"MoASE++: Mixture of Activation Sparsity Experts with Domain-Adaptive On-policy Distillation for Continual Test Time Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"RoyZry98/MoASE-Pytorch","path":"cotta_vit_opd.py","file_url":"https://github.com/RoyZry98/MoASE-Pytorch/blob/HEAD/cotta_vit_opd.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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":"5542fb2ea9736d38","code_sha256_prefix":"5542fb2ea9736d38","mcp_get_code":{"code_sha256":"5542fb2ea9736d38"}},{"arxiv_id":"2604.15609","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-15609","title":"Adapting in the Dark: Efficient and Stable Test-Time Adaptation for Black-Box Models","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"yunbeizhang/BETA","path":"tta_library/beta.py","file_url":"https://github.com/yunbeizhang/BETA/blob/HEAD/tta_library/beta.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":"cc43e62b9781b688","code_sha256_prefix":"cc43e62b9781b688","mcp_get_code":{"code_sha256":"cc43e62b9781b688"}},{"arxiv_id":"2604.15494","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-15494","title":"ICLR 2026 Test-Time Updates (TTU) Workshop PROTOTTA: PROTOTYPE-GUIDED TEST-TIME ADAPTATION","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"DeepRCL/ProtoTTA","path":"ProtoPFormer/proto_tta.py","file_url":"https://github.com/DeepRCL/ProtoTTA/blob/HEAD/ProtoPFormer/proto_tta.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, DeepRCL/ProtoTTA when it was checked","code_sha256":"47c20bff2d896510","code_sha256_prefix":"47c20bff2d896510","mcp_get_code":{"code_sha256":"47c20bff2d896510"}},{"arxiv_id":"2602.03292","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03292","title":"A3-TTA: Adaptive Anchor Alignment Test-Time Adaptation for Image Segmentation","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"HiLab-git/A3-TTA","path":"a3_tta.py","file_url":"https://github.com/HiLab-git/A3-TTA/blob/HEAD/a3_tta.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, HiLab-git/A3-TTA when it was checked","code_sha256":"1c838b49ddce9877","code_sha256_prefix":"1c838b49ddce9877","mcp_get_code":{"code_sha256":"1c838b49ddce9877"}},{"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/cea.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/cea.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":"aa08b2e342dc684c","code_sha256_prefix":"aa08b2e342dc684c","mcp_get_code":{"code_sha256":"aa08b2e342dc684c"}},{"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":"e64eebbbe753e1c2","code_sha256_prefix":"e64eebbbe753e1c2","mcp_get_code":{"code_sha256":"e64eebbbe753e1c2"}},{"arxiv_id":"2407.15773","arxiv_id_is_arxiv":true,"paper":"/paper/stamp-outlier-aware-test-time-adaptation-with","title":"STAMP: Outlier-Aware Test-Time Adaptation with Stable Memory Replay","date":"2024-07-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuyongcan/stamp","path":"src/methods/stamp.py","file_url":"https://github.com/yuyongcan/stamp/blob/HEAD/src/methods/stamp.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/stamp when it was checked","code_sha256":"d203451c6493f65d","code_sha256_prefix":"d203451c6493f65d","mcp_get_code":{"code_sha256":"d203451c6493f65d"}},{"arxiv_id":"2405.05012","arxiv_id_is_arxiv":true,"paper":"/paper/the-entropy-enigma-success-and-failure-of","title":"The Entropy Enigma: Success and Failure of Entropy Minimization","date":"2024-05-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"oripress/entropyenigma","path":"rdumb.py","file_url":"https://github.com/oripress/entropyenigma/blob/HEAD/rdumb.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 yuyongcan/stamp, and GitHub detected no licence in that repository when it was checked","code_sha256":"d203451c6493f65d","code_sha256_prefix":"d203451c6493f65d","mcp_get_code":{"code_sha256":"d203451c6493f65d"}},{"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_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, yuanyige/tea when it was checked","code_sha256":"d203451c6493f65d","code_sha256_prefix":"d203451c6493f65d","mcp_get_code":{"code_sha256":"d203451c6493f65d"}},{"arxiv_id":"2310.09505","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-test-time-adaptation-for-acoustic","title":"Advancing Test-Time Adaptation in Wild Acoustic Test Settings","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Waffle-Liu/CEA","path":"utils.py","file_url":"https://github.com/Waffle-Liu/CEA/blob/HEAD/utils.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":"aa08b2e342dc684c","code_sha256_prefix":"aa08b2e342dc684c","mcp_get_code":{"code_sha256":"aa08b2e342dc684c"}},{"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","verification_level":1,"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":"eeef10dc6caedb9c","code_sha256_prefix":"eeef10dc6caedb9c","mcp_get_code":{"code_sha256":"eeef10dc6caedb9c"}},{"arxiv_id":"2110.10232","arxiv_id_is_arxiv":true,"paper":"/paper/test-time-adaptation-through-perturbation","title":"Test time Adaptation through Perturbation Robustness","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"prabhuteja12/pest","path":"utils/model_utils.py","file_url":"https://github.com/prabhuteja12/pest/blob/HEAD/utils/model_utils.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 yuyongcan/stamp, and GitHub detected no licence in that repository when it was checked","code_sha256":"d203451c6493f65d","code_sha256_prefix":"d203451c6493f65d","mcp_get_code":{"code_sha256":"d203451c6493f65d"}},{"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":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"d203451c6493f65d","code_sha256_prefix":"d203451c6493f65d","mcp_get_code":{"code_sha256":"d203451c6493f65d"}}],"record_sha256":"ce110f1f4579e488152416f25e11d1cb3c7e2e64dedc36bda456e20cadaeb97b","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}