{"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/get-tta-transforms","entry":"get_tta_transforms","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":10,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":1,"n_papers_ran_instrument_only":5,"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":11,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":5,"n_samples_unverified":5,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":8,"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":4,"ran_fixture":1,"ran":1,"unverified":5},"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":"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, RoyZry98/MoASE-Pytorch when it was checked","code_sha256":"d12712f3619d56ad","code_sha256_prefix":"d12712f3619d56ad","mcp_get_code":{"code_sha256":"d12712f3619d56ad"}},{"arxiv_id":"2603.03796","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-03796","title":"When and Where to Reset Matters for Long-Term Test-Time Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"YonseiML/asr","path":"methods/rotta.py","file_url":"https://github.com/YonseiML/asr/blob/HEAD/methods/rotta.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, YonseiML/asr when it was checked","code_sha256":"1057374ec6e0051f","code_sha256_prefix":"1057374ec6e0051f","mcp_get_code":{"code_sha256":"1057374ec6e0051f"}},{"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/cotta.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/cotta.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0dd73a10b6cdfba4","code_sha256_prefix":"0dd73a10b6cdfba4","mcp_get_code":{"code_sha256":"0dd73a10b6cdfba4"}},{"arxiv_id":"2601.11161","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-11161","title":"GMM-COMET: Continual Source-Free Universal Domain Adaptation via a Mean Teacher and Gaussian Mixture Model-Based Pseudo-Labeling","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"pascalschlachter/GMM-COMET","path":"adaptation.py","file_url":"https://github.com/pascalschlachter/GMM-COMET/blob/HEAD/adaptation.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, pascalschlachter/GMM-COMET when it was checked","code_sha256":"b13ce7897fb5f663","code_sha256_prefix":"b13ce7897fb5f663","mcp_get_code":{"code_sha256":"b13ce7897fb5f663"}},{"arxiv_id":"2503.20354","arxiv_id_is_arxiv":true,"paper":"/paper/surgeon-memory-adaptive-fully-test-time","title":"SURGEON: Memory-Adaptive Fully Test-Time Adaptation via Dynamic Activation Sparsity","date":"2025-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kadmkbl/SURGEON","path":"methods/das.py","file_url":"https://github.com/kadmkbl/SURGEON/blob/HEAD/methods/das.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, kadmkbl/SURGEON when it was checked","code_sha256":"d343b36a78d08d71","code_sha256_prefix":"d343b36a78d08d71","mcp_get_code":{"code_sha256":"d343b36a78d08d71"}},{"arxiv_id":"2404.05094","arxiv_id_is_arxiv":true,"paper":"/paper/active-test-time-adaptation-theoretical","title":"Active Test-Time Adaptation: Theoretical Analyses and An Algorithm","date":"2024-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"divelab/atta","path":"ATTA/kernel/algorithms/CoTTA.py","file_url":"https://github.com/divelab/atta/blob/HEAD/ATTA/kernel/algorithms/CoTTA.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, divelab/atta, is not in the permissive set Syntology serves inline","code_sha256":"a2430caeeefdb595","code_sha256_prefix":"a2430caeeefdb595","mcp_get_code":{"code_sha256":"a2430caeeefdb595"}},{"arxiv_id":"2311.18193","arxiv_id_is_arxiv":true,"paper":"/paper/persistent-test-time-adaptation-in-episodic","title":"Persistent Test-time Adaptation in Recurring Testing Scenarios","date":"2023-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hthieu166/petta","path":"src/adapter/petta.py","file_url":"https://github.com/hthieu166/petta/blob/HEAD/src/adapter/petta.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, hthieu166/petta when it was checked","code_sha256":"36688c7857b983fd","code_sha256_prefix":"36688c7857b983fd","mcp_get_code":{"code_sha256":"36688c7857b983fd"}},{"arxiv_id":"2309.14949","arxiv_id_is_arxiv":true,"paper":"/paper/towards-real-world-test-time-adaptation-tri","title":"Towards Real-World Test-Time Adaptation: Tri-Net Self-Training with Balanced Normalization","date":"2023-09-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gorilla-lab-scut/tribe","path":"core/adapter/cotta.py","file_url":"https://github.com/gorilla-lab-scut/tribe/blob/HEAD/core/adapter/cotta.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, gorilla-lab-scut/tribe when it was checked","code_sha256":"3dc11f35b4b01ab2","code_sha256_prefix":"3dc11f35b4b01ab2","mcp_get_code":{"code_sha256":"3dc11f35b4b01ab2"}},{"arxiv_id":"2303.13899","arxiv_id_is_arxiv":true,"paper":"/paper/robust-test-time-adaptation-in-dynamic","title":"Robust Test-Time Adaptation in Dynamic Scenarios","date":"2023-03-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"BIT-DA/RoTTA","path":"core/adapter/rotta.py","file_url":"https://github.com/BIT-DA/RoTTA/blob/HEAD/core/adapter/rotta.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":"2810e57d868cd873","code_sha256_prefix":"2810e57d868cd873","mcp_get_code":{"code_sha256":"2810e57d868cd873"}},{"arxiv_id":"2203.13591","arxiv_id_is_arxiv":true,"paper":"/paper/continual-test-time-domain-adaptation","title":"Continual Test-Time Domain Adaptation","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gist-ailab/domain-specific-block-selection-and-paired-view-pseudo-labeling-for-online-tta","path":"classification/methods/cotta.py","file_url":"https://github.com/gist-ailab/domain-specific-block-selection-and-paired-view-pseudo-labeling-for-online-tta/blob/HEAD/classification/methods/cotta.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":"a8e9d937548d1d57","code_sha256_prefix":"a8e9d937548d1d57","mcp_get_code":{"code_sha256":"a8e9d937548d1d57"}},{"arxiv_id":"2203.13591","arxiv_id_is_arxiv":true,"paper":"/paper/continual-test-time-domain-adaptation","title":"Continual Test-Time Domain Adaptation","date":"2022-03-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qinenergy/cotta","path":"imagenet/cotta.py","file_url":"https://github.com/qinenergy/cotta/blob/HEAD/imagenet/cotta.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, qinenergy/cotta (NOASSERTION)","code_sha256":"3e1ce9963cc81750","code_sha256_prefix":"3e1ce9963cc81750","mcp_get_code":{"code_sha256":"3e1ce9963cc81750"}}],"record_sha256":"83f11c634f6ad52a87d9065ed91c7e88b03aa5fedc8e9cd90c0e821ed8eb2c66","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}