{"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/update-ema-variables","entry":"update_ema_variables","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":17,"n_papers_ran":14,"n_papers_ran_no_instrument_failure":2,"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":6,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":2,"n_samples_unverified":3,"n_samples_fingerprinted":0,"n_places":19,"n_places_pointer_only":16,"n_places_pointer_only_link_open":7,"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":2,"ran_fixture":0,"ran":1,"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":"2609.02507","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-02507","title":"Rethinking the Teacher-Student Framework for Test-Time Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"dmn-sjk/intransigent_teacher","path":"methods/cotta.py","file_url":"https://github.com/dmn-sjk/intransigent_teacher/blob/HEAD/methods/cotta.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, dmn-sjk/intransigent_teacher when it was checked","code_sha256":"a77d556c0aea19c1","code_sha256_prefix":"a77d556c0aea19c1","mcp_get_code":{"code_sha256":"a77d556c0aea19c1"}},{"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":"006d7b109e1c73e7","code_sha256_prefix":"006d7b109e1c73e7","mcp_get_code":{"code_sha256":"006d7b109e1c73e7"}},{"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_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 joe817/gcal, and GitHub detected no licence in that repository when it was checked","code_sha256":"a77d556c0aea19c1","code_sha256_prefix":"a77d556c0aea19c1","mcp_get_code":{"code_sha256":"a77d556c0aea19c1"}},{"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":"a77d556c0aea19c1","code_sha256_prefix":"a77d556c0aea19c1","mcp_get_code":{"code_sha256":"a77d556c0aea19c1"}},{"arxiv_id":"2407.12128","arxiv_id_is_arxiv":true,"paper":"/paper/distribution-alignment-for-fully-test-time","title":"Distribution Alignment for Fully Test-Time Adaptation with Dynamic Online Data Streams","date":"2024-07-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WZq975/DA-TTA","path":"methods/cotta.py","file_url":"https://github.com/WZq975/DA-TTA/blob/HEAD/methods/cotta.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 joe817/gcal, and GitHub detected no licence in that repository when it was checked","code_sha256":"a77d556c0aea19c1","code_sha256_prefix":"a77d556c0aea19c1","mcp_get_code":{"code_sha256":"a77d556c0aea19c1"}},{"arxiv_id":"2406.10737","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-domains-dynamic-solutions-dpcore-for","title":"Dynamic Domains, Dynamic Solutions: DPCore for Continual Test-Time Adaptation","date":"2024-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zybeich/DPCore","path":"imagenet/cotta.py","file_url":"https://github.com/zybeich/DPCore/blob/HEAD/imagenet/cotta.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 joe817/gcal, and GitHub detected no licence in that repository when it was checked","code_sha256":"a77d556c0aea19c1","code_sha256_prefix":"a77d556c0aea19c1","mcp_get_code":{"code_sha256":"a77d556c0aea19c1"}},{"arxiv_id":"2406.10737","arxiv_id_is_arxiv":true,"paper":"/paper/dynamic-domains-dynamic-solutions-dpcore-for","title":"Dynamic Domains, Dynamic Solutions: DPCore for Continual Test-Time Adaptation","date":"2024-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zybeich/DPCore","path":"imagenet/vida.py","file_url":"https://github.com/zybeich/DPCore/blob/HEAD/imagenet/vida.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":"f11bbc6fc4cc3fe7","code_sha256_prefix":"f11bbc6fc4cc3fe7","mcp_get_code":{"code_sha256":"f11bbc6fc4cc3fe7"}},{"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":"cotta_vit.py","file_url":"https://github.com/royzry98/moase-pytorch/blob/HEAD/cotta_vit.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, royzry98/moase-pytorch when it was checked","code_sha256":"a77d556c0aea19c1","code_sha256_prefix":"a77d556c0aea19c1","mcp_get_code":{"code_sha256":"a77d556c0aea19c1"}},{"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/cotta.py","file_url":"https://github.com/gaozhengqing/UniEnt/blob/HEAD/imagenet/cotta.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 joe817/gcal, and GitHub detected no licence in that repository when it was checked","code_sha256":"a77d556c0aea19c1","code_sha256_prefix":"a77d556c0aea19c1","mcp_get_code":{"code_sha256":"a77d556c0aea19c1"}},{"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":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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":"a77d556c0aea19c1","code_sha256_prefix":"a77d556c0aea19c1","mcp_get_code":{"code_sha256":"a77d556c0aea19c1"}},{"arxiv_id":"2403.04272","arxiv_id_is_arxiv":true,"paper":"/paper/active-generalized-category-discovery","title":"Active Generalized Category Discovery","date":"2024-03-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mashijie1028/activegcd","path":"utils_al/train_recipes_ema.py","file_url":"https://github.com/mashijie1028/activegcd/blob/HEAD/utils_al/train_recipes_ema.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":"e253169eb9c23d84","code_sha256_prefix":"e253169eb9c23d84","mcp_get_code":{"code_sha256":"e253169eb9c23d84"}},{"arxiv_id":"2401.08328","arxiv_id_is_arxiv":true,"paper":"/paper/un-mixing-test-time-normalization-statistics","title":"Un-Mixing Test-Time Normalization Statistics: Combatting Label Temporal Correlation","date":"2024-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"devavratTomar/unmixtns","path":"tta_experiments/methods/cotta.py","file_url":"https://github.com/devavratTomar/unmixtns/blob/HEAD/tta_experiments/methods/cotta.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, devavratTomar/unmixtns when it was checked","code_sha256":"a77d556c0aea19c1","code_sha256_prefix":"a77d556c0aea19c1","mcp_get_code":{"code_sha256":"a77d556c0aea19c1"}},{"arxiv_id":"2310.20199","arxiv_id_is_arxiv":true,"paper":"/paper/in-search-of-lost-online-test-time-adaptation","title":"In Search of Lost Online Test-time Adaptation: A Survey","date":"2023-10-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jo-wang/otta_vit_survey","path":"classification/methods/cotta.py","file_url":"https://github.com/jo-wang/otta_vit_survey/blob/HEAD/classification/methods/cotta.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 joe817/gcal, and GitHub detected no licence in that repository when it was checked","code_sha256":"a77d556c0aea19c1","code_sha256_prefix":"a77d556c0aea19c1","mcp_get_code":{"code_sha256":"a77d556c0aea19c1"}},{"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":"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, gorilla-lab-scut/tribe when it was checked","code_sha256":"a77d556c0aea19c1","code_sha256_prefix":"a77d556c0aea19c1","mcp_get_code":{"code_sha256":"a77d556c0aea19c1"}},{"arxiv_id":"2306.04344","arxiv_id_is_arxiv":true,"paper":"/paper/vida-homeostatic-visual-domain-adapter-for","title":"ViDA: Homeostatic Visual Domain Adapter for Continual Test Time Adaptation","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangsenqiao/vida","path":"imagenet/cotta.py","file_url":"https://github.com/yangsenqiao/vida/blob/HEAD/imagenet/cotta.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 joe817/gcal, and GitHub detected no licence in that repository when it was checked","code_sha256":"a77d556c0aea19c1","code_sha256_prefix":"a77d556c0aea19c1","mcp_get_code":{"code_sha256":"a77d556c0aea19c1"}},{"arxiv_id":"2306.04344","arxiv_id_is_arxiv":true,"paper":"/paper/vida-homeostatic-visual-domain-adapter-for","title":"ViDA: Homeostatic Visual Domain Adapter for Continual Test Time Adaptation","date":"2023-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangsenqiao/vida","path":"imagenet/vida.py","file_url":"https://github.com/yangsenqiao/vida/blob/HEAD/imagenet/vida.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":"f11bbc6fc4cc3fe7","code_sha256_prefix":"f11bbc6fc4cc3fe7","mcp_get_code":{"code_sha256":"f11bbc6fc4cc3fe7"}},{"arxiv_id":"2303.13090","arxiv_id_is_arxiv":true,"paper":"/paper/orthogonal-annotation-benefits-barely","title":"Orthogonal Annotation Benefits Barely-supervised Medical Image Segmentation","date":"2023-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HengCai-NJU/DeSCO","path":"code/train_desco.py","file_url":"https://github.com/HengCai-NJU/DeSCO/blob/HEAD/code/train_desco.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, HengCai-NJU/DeSCO when it was checked","code_sha256":"4a42247c80f7b15a","code_sha256_prefix":"4a42247c80f7b15a","mcp_get_code":{"code_sha256":"4a42247c80f7b15a"}},{"arxiv_id":"2212.09713","arxiv_id_is_arxiv":true,"paper":"/paper/a-probabilistic-framework-for-lifelong-test","title":"A Probabilistic Framework for Lifelong Test-Time Adaptation","date":"2022-12-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dhanajitb/petal","path":"imagenet/petal.py","file_url":"https://github.com/dhanajitb/petal/blob/HEAD/imagenet/petal.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 joe817/gcal, and GitHub detected no licence in that repository when it was checked","code_sha256":"a77d556c0aea19c1","code_sha256_prefix":"a77d556c0aea19c1","mcp_get_code":{"code_sha256":"a77d556c0aea19c1"}},{"arxiv_id":"2203.13993","arxiv_id_is_arxiv":true,"paper":"/paper/rscfed-random-sampling-consensus-federated","title":"RSCFed: Random Sampling Consensus Federated Semi-supervised Learning","date":"2022-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XMed-Lab/RSCFed","path":"local_unsupervised.py","file_url":"https://github.com/XMed-Lab/RSCFed/blob/HEAD/local_unsupervised.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, XMed-Lab/RSCFed (NOASSERTION)","code_sha256":"142c27603591df9b","code_sha256_prefix":"142c27603591df9b","mcp_get_code":{"code_sha256":"142c27603591df9b"}}],"record_sha256":"bf5632f28f76a4ce9be56498694a800cc7276327c2cd30d2a571c91f6d8f9b4b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}