{"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/collect-params","entry":"collect_params","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":15,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":5,"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":15,"n_samples_ran":14,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":7,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":20,"n_places_pointer_only":1,"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":2,"ran_violates":0,"ran_draft_wrong":7,"ran_fixture":0,"ran":5,"unverified":1},"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","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":"e4502c5930e7208d","code_sha256_prefix":"e4502c5930e7208d","mcp_get_code":{"code_sha256":"e4502c5930e7208d"}},{"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/dsuta.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/dsuta.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":"911be0c0e787cf87","code_sha256_prefix":"911be0c0e787cf87","mcp_get_code":{"code_sha256":"911be0c0e787cf87"}},{"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a03907c2668d4dad","code_sha256_prefix":"a03907c2668d4dad","mcp_get_code":{"code_sha256":"a03907c2668d4dad"}},{"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/tent.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/tent.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":"46ee4be817c11821","code_sha256_prefix":"46ee4be817c11821","mcp_get_code":{"code_sha256":"46ee4be817c11821"}},{"arxiv_id":"2503.02616","arxiv_id_is_arxiv":true,"paper":"/paper/smoothing-the-shift-towards-stable-test-time","title":"Smoothing the Shift: Towards Stable Test-Time Adaptation under Complex Multimodal Noises","date":"2025-03-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zrguo/sumi","path":"src/sumi.py","file_url":"https://github.com/zrguo/sumi/blob/HEAD/src/sumi.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":"394afed8d9dc0d49","code_sha256_prefix":"394afed8d9dc0d49","mcp_get_code":{"code_sha256":"394afed8d9dc0d49"}},{"arxiv_id":"2408.13983","arxiv_id_is_arxiv":true,"paper":"/paper/dual-path-adversarial-lifting-for-domain","title":"Dual-Path Adversarial Lifting for Domain Shift Correction in Online Test-time Adaptation","date":"2024-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yushuntang/dpal","path":"dpal.py","file_url":"https://github.com/yushuntang/dpal/blob/HEAD/dpal.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":"841322c61130157b","code_sha256_prefix":"841322c61130157b","mcp_get_code":{"code_sha256":"841322c61130157b"}},{"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/dpcore.py","file_url":"https://github.com/zybeich/DPCore/blob/HEAD/imagenet/dpcore.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cbef8046cedb6b50","code_sha256_prefix":"cbef8046cedb6b50","mcp_get_code":{"code_sha256":"cbef8046cedb6b50"}},{"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/tent.py","file_url":"https://github.com/zybeich/DPCore/blob/HEAD/imagenet/tent.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":"63832452f78dcb58","code_sha256_prefix":"63832452f78dcb58","mcp_get_code":{"code_sha256":"63832452f78dcb58"}},{"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":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fb3d07027ed3b46c","code_sha256_prefix":"fb3d07027ed3b46c","mcp_get_code":{"code_sha256":"fb3d07027ed3b46c"}},{"arxiv_id":"2403.07366","arxiv_id_is_arxiv":true,"paper":"/paper/entropy-is-not-enough-for-test-time","title":"Entropy is not Enough for Test-Time Adaptation: From the Perspective of Disentangled Factors","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jhyun17/DeYO","path":"methods/deyo.py","file_url":"https://github.com/Jhyun17/DeYO/blob/HEAD/methods/deyo.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":"0c7e495c41c9465c","code_sha256_prefix":"0c7e495c41c9465c","mcp_get_code":{"code_sha256":"0c7e495c41c9465c"}},{"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":"a784a511d03ebe30","code_sha256_prefix":"a784a511d03ebe30","mcp_get_code":{"code_sha256":"a784a511d03ebe30"}},{"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":"ed4d7d29de641df1","code_sha256_prefix":"ed4d7d29de641df1","mcp_get_code":{"code_sha256":"ed4d7d29de641df1"}},{"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/tent.py","file_url":"https://github.com/yangsenqiao/vida/blob/HEAD/imagenet/tent.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":"63832452f78dcb58","code_sha256_prefix":"63832452f78dcb58","mcp_get_code":{"code_sha256":"63832452f78dcb58"}},{"arxiv_id":"2208.11821","arxiv_id_is_arxiv":true,"paper":"/paper/refine-and-represent-region-to-object","title":"Refine and Represent: Region-to-Object Representation Learning","date":"2022-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kkallidromitis/r2o","path":"utils/params_util.py","file_url":"https://github.com/kkallidromitis/r2o/blob/HEAD/utils/params_util.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":"70d9fdb6d11905e9","code_sha256_prefix":"70d9fdb6d11905e9","mcp_get_code":{"code_sha256":"70d9fdb6d11905e9"}},{"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/tent","path":"tent.py","file_url":"https://github.com/DequanWang/tent/blob/HEAD/tent.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":"fb3d07027ed3b46c","code_sha256_prefix":"fb3d07027ed3b46c","mcp_get_code":{"code_sha256":"fb3d07027ed3b46c"}},{"arxiv_id":"2006.10726","arxiv_id_is_arxiv":true,"paper":"/paper/fully-test-time-adaptation-by-entropy","title":"Tent: Fully Test-time Adaptation by Entropy Minimization","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DequanWang/tent","path":"tent.py","file_url":"https://github.com/DequanWang/tent/blob/HEAD/tent.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":"ddcda7ec86db3b8c","code_sha256_prefix":"ddcda7ec86db3b8c","mcp_get_code":{"code_sha256":"ddcda7ec86db3b8c"}},{"arxiv_id":"1810.03581","arxiv_id_is_arxiv":true,"paper":"/paper/improving-the-transformer-translation-model","title":"Improving the Transformer Translation Model with Document-Level Context","date":"2018-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Glaceon31/Document-Transformer","path":"thumt/bin/trainer.py","file_url":"https://github.com/Glaceon31/Document-Transformer/blob/HEAD/thumt/bin/trainer.py","status":"unverified","verification_level":0,"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":"c55c6aba7b709f18","code_sha256_prefix":"c55c6aba7b709f18","mcp_get_code":{"code_sha256":"c55c6aba7b709f18"}},{"arxiv_id":"1805.00631","arxiv_id_is_arxiv":true,"paper":"/paper/accelerating-neural-transformer-via-an","title":"Accelerating Neural Transformer via an Average Attention Network","date":"2018-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bzhangXMU/transformer-aan","path":"code/trainer.py","file_url":"https://github.com/bzhangXMU/transformer-aan/blob/HEAD/code/trainer.py","status":"unverified","verification_level":0,"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":"c55c6aba7b709f18","code_sha256_prefix":"c55c6aba7b709f18","mcp_get_code":{"code_sha256":"c55c6aba7b709f18"}},{"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":"deyo.py","file_url":"https://github.com/scienceliuc/SaTeen/blob/HEAD/deyo.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c7e495c41c9465c","code_sha256_prefix":"0c7e495c41c9465c","mcp_get_code":{"code_sha256":"0c7e495c41c9465c"}},{"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":"tent.py","file_url":"https://github.com/scienceliuc/SaTeen/blob/HEAD/tent.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"46ee4be817c11821","code_sha256_prefix":"46ee4be817c11821","mcp_get_code":{"code_sha256":"46ee4be817c11821"}}],"record_sha256":"73fa275064040f4126d204a11fb8b5e1591c62dc8fa934e13c2620b250eefa14","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}