{"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/forward-and-adapt-eata","entry":"forward_and_adapt_eata","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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":1,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":4,"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":2,"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/eata.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/eata.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":"a937e659c4d110b0","code_sha256_prefix":"a937e659c4d110b0","mcp_get_code":{"code_sha256":"a937e659c4d110b0"}},{"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/eata.py","file_url":"https://github.com/gaozhengqing/UniEnt/blob/HEAD/imagenet/eata.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":"513dc262cb3f7002","code_sha256_prefix":"513dc262cb3f7002","mcp_get_code":{"code_sha256":"513dc262cb3f7002"}},{"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":"tiny_imagenet/eata.py","file_url":"https://github.com/gaozhengqing/UniEnt/blob/HEAD/tiny_imagenet/eata.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":"2495003ded423e33","code_sha256_prefix":"2495003ded423e33","mcp_get_code":{"code_sha256":"2495003ded423e33"}},{"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","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":"611482e1142a774f","code_sha256_prefix":"611482e1142a774f","mcp_get_code":{"code_sha256":"611482e1142a774f"}},{"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":"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":"7853dec9689a762f","code_sha256_prefix":"7853dec9689a762f","mcp_get_code":{"code_sha256":"7853dec9689a762f"}},{"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":"deterministic","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, mr-eggplant/eata (NOASSERTION)","code_sha256":"580afbcac2de4dc1","code_sha256_prefix":"580afbcac2de4dc1","mcp_get_code":{"code_sha256":"580afbcac2de4dc1"}},{"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":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, mr-eggplant/eata (NOASSERTION)","code_sha256":"f72cf6943b00dddf","code_sha256_prefix":"f72cf6943b00dddf","mcp_get_code":{"code_sha256":"f72cf6943b00dddf"}},{"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","verification_level":1,"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":"e1d18a73c138cdf9","code_sha256_prefix":"e1d18a73c138cdf9","mcp_get_code":{"code_sha256":"e1d18a73c138cdf9"}}],"record_sha256":"70a6a62832fcbc283114c26a64dbf59064fcd433998b6861c5787dc9ca8bd019","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}