{"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-model-probs","entry":"update_model_probs","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":12,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":9,"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":6,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":14,"n_places_pointer_only":7,"n_places_pointer_only_link_open":1,"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":2,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":0,"ran":0,"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":"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/eata.py","file_url":"https://github.com/dmn-sjk/intransigent_teacher/blob/HEAD/methods/eata.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"f4a71b97346fb88d","code_sha256_prefix":"f4a71b97346fb88d","mcp_get_code":{"code_sha256":"f4a71b97346fb88d"}},{"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":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8a1599bccdd2a405","code_sha256_prefix":"8a1599bccdd2a405","mcp_get_code":{"code_sha256":"8a1599bccdd2a405"}},{"arxiv_id":"2603.21928","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-21928","title":"The Golden Subspace: Where Efficiency Meets Generalization in Continual Test-Time Adaptation","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"AIGNLAI/GOLD","path":"classification/methods/cmf.py","file_url":"https://github.com/AIGNLAI/GOLD/blob/HEAD/classification/methods/cmf.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AIGNLAI/GOLD when it was checked","code_sha256":"073ab5af80ddbe36","code_sha256_prefix":"073ab5af80ddbe36","mcp_get_code":{"code_sha256":"073ab5af80ddbe36"}},{"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/eata.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/eata.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"182d3657a9eebb0d","code_sha256_prefix":"182d3657a9eebb0d","mcp_get_code":{"code_sha256":"182d3657a9eebb0d"}},{"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/eata.py","file_url":"https://github.com/WZq975/DA-TTA/blob/HEAD/methods/eata.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"182d3657a9eebb0d","code_sha256_prefix":"182d3657a9eebb0d","mcp_get_code":{"code_sha256":"182d3657a9eebb0d"}},{"arxiv_id":"2402.17316","arxiv_id_is_arxiv":true,"paper":"/paper/towards-robust-and-efficient-cloud-edge","title":"Towards Robust and Efficient Cloud-Edge Elastic Model Adaptation via Selective Entropy Distillation","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"chenyaofo/cema","path":"codebase/core/tta/cema.py","file_url":"https://github.com/chenyaofo/cema/blob/HEAD/codebase/core/tta/cema.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f4a71b97346fb88d","code_sha256_prefix":"f4a71b97346fb88d","mcp_get_code":{"code_sha256":"f4a71b97346fb88d"}},{"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/eata.py","file_url":"https://github.com/yuanyige/tea/blob/HEAD/core/adazoo/eata.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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":"182d3657a9eebb0d","code_sha256_prefix":"182d3657a9eebb0d","mcp_get_code":{"code_sha256":"182d3657a9eebb0d"}},{"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/eata.py","file_url":"https://github.com/gorilla-lab-scut/tribe/blob/HEAD/core/adapter/eata.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"f4a71b97346fb88d","code_sha256_prefix":"f4a71b97346fb88d","mcp_get_code":{"code_sha256":"f4a71b97346fb88d"}},{"arxiv_id":"2306.00650","arxiv_id_is_arxiv":true,"paper":"/paper/universal-test-time-adaptation-through-weight","title":"Universal Test-time Adaptation through Weight Ensembling, Diversity Weighting, and Prior Correction","date":"2023-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mariodoebler/test-time-adaptation","path":"classification/methods/roid.py","file_url":"https://github.com/mariodoebler/test-time-adaptation/blob/HEAD/classification/methods/roid.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0baf3c3fd33582c4","code_sha256_prefix":"0baf3c3fd33582c4","mcp_get_code":{"code_sha256":"0baf3c3fd33582c4"}},{"arxiv_id":"2204.02610","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-test-time-model-adaptation-without","title":"Efficient Test-Time Model Adaptation without Forgetting","date":"2022-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mr-eggplant/eata","path":"eata.py","file_url":"https://github.com/mr-eggplant/eata/blob/HEAD/eata.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, mr-eggplant/eata (NOASSERTION)","code_sha256":"662233292898d011","code_sha256_prefix":"662233292898d011","mcp_get_code":{"code_sha256":"662233292898d011"}},{"arxiv_id":"2204.02610","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-test-time-model-adaptation-without","title":"Efficient Test-Time Model Adaptation without Forgetting","date":"2022-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"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":"f4a71b97346fb88d","code_sha256_prefix":"f4a71b97346fb88d","mcp_get_code":{"code_sha256":"f4a71b97346fb88d"}},{"arxiv_id":"openreview_QYPKLGyz7K","arxiv_id_is_arxiv":false,"paper":null,"title":"OpenReview id openreview_QYPKLGyz7K","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"scienceliuc/SaTeen","path":"eata.py","file_url":"https://github.com/scienceliuc/SaTeen/blob/HEAD/eata.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"182d3657a9eebb0d","code_sha256_prefix":"182d3657a9eebb0d","mcp_get_code":{"code_sha256":"182d3657a9eebb0d"}},{"arxiv_id":"Ni_Maintaining_Consistent_Inter-Class_Topology_in_Continual_Test-Time_Adaptation_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Ni_Maintaining_Consistent_Inter-Class_Topology_in_Continual_Test-Time_Adaptation_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Successybbdwm/TCA","path":"classification/methods/eata.py","file_url":"https://github.com/Successybbdwm/TCA/blob/HEAD/classification/methods/eata.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f4a71b97346fb88d","code_sha256_prefix":"f4a71b97346fb88d","mcp_get_code":{"code_sha256":"f4a71b97346fb88d"}},{"arxiv_id":"Ni_Maintaining_Consistent_Inter-Class_Topology_in_Continual_Test-Time_Adaptation_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Ni_Maintaining_Consistent_Inter-Class_Topology_in_Continual_Test-Time_Adaptation_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Successybbdwm/TCA","path":"classification/methods/cmf.py","file_url":"https://github.com/Successybbdwm/TCA/blob/HEAD/classification/methods/cmf.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 AIGNLAI/GOLD, and GitHub detected no licence in that repository when it was checked","code_sha256":"073ab5af80ddbe36","code_sha256_prefix":"073ab5af80ddbe36","mcp_get_code":{"code_sha256":"073ab5af80ddbe36"}}],"record_sha256":"a0856b90298de5bbd41ae72b97dd5befccfc00b1d195f6c51869c27c686085cb","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}