{"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","entry":"update_ema","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":11,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":7,"n_papers_ran_instrument_only":2,"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":7,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":2,"n_places":11,"n_places_pointer_only":3,"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":1,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":2},"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/sar.py","file_url":"https://github.com/JiahengDong/SETTA/blob/HEAD/TTAs/sar.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"17259eab7993e1c7","code_sha256_prefix":"17259eab7993e1c7","mcp_get_code":{"code_sha256":"17259eab7993e1c7"}},{"arxiv_id":"2505.20704","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2505.20704","date":null,"month_inferred_from_arxiv_id":"2025-05","title_source":null,"repo":"hzcar/ReCAP","path":"recap_plpd.py","file_url":"https://github.com/hzcar/ReCAP/blob/HEAD/recap_plpd.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"858f2647e510ea6a","code_sha256_prefix":"858f2647e510ea6a","mcp_get_code":{"code_sha256":"858f2647e510ea6a"}},{"arxiv_id":"2411.07007","arxiv_id_is_arxiv":true,"paper":"/paper/non-adversarial-inverse-reinforcement","title":"Non-Adversarial Inverse Reinforcement Learning via Successor Feature Matching","date":"2024-11-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"arnavkj1995/sfm","path":"agents/sfm_sac.py","file_url":"https://github.com/arnavkj1995/sfm/blob/HEAD/agents/sfm_sac.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"523179247a3ff659","code_sha256_prefix":"523179247a3ff659","mcp_get_code":{"code_sha256":"523179247a3ff659"}},{"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_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"17259eab7993e1c7","code_sha256_prefix":"17259eab7993e1c7","mcp_get_code":{"code_sha256":"17259eab7993e1c7"}},{"arxiv_id":"2405.14664","arxiv_id_is_arxiv":true,"paper":"/paper/fisher-flow-matching-for-generative-modeling","title":"Fisher Flow Matching for Generative Modeling over Discrete Data","date":"2024-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"olsdavis/fisher-flow","path":"src/dfm/flow_utils.py","file_url":"https://github.com/olsdavis/fisher-flow/blob/HEAD/src/dfm/flow_utils.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, olsdavis/fisher-flow when it was checked","code_sha256":"55205512756a9ef1","code_sha256_prefix":"55205512756a9ef1","mcp_get_code":{"code_sha256":"55205512756a9ef1"}},{"arxiv_id":"2404.16482","arxiv_id_is_arxiv":true,"paper":"/paper/cocog-controllable-visual-stimuli-generation","title":"CoCoG: Controllable Visual Stimuli Generation based on Human Concept Representations","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ncclab-sustech/CoCoG","path":"diffusion_prior.py","file_url":"https://github.com/ncclab-sustech/CoCoG/blob/HEAD/diffusion_prior.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, ncclab-sustech/CoCoG when it was checked","code_sha256":"27311a4bc856eb7f","code_sha256_prefix":"27311a4bc856eb7f","mcp_get_code":{"code_sha256":"27311a4bc856eb7f"}},{"arxiv_id":"2402.05841","arxiv_id_is_arxiv":true,"paper":"/paper/dirichlet-flow-matching-with-applications-to","title":"Dirichlet Flow Matching with Applications to DNA Sequence Design","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hannesstark/dirichlet-flow-matching","path":"utils/flow_utils.py","file_url":"https://github.com/hannesstark/dirichlet-flow-matching/blob/HEAD/utils/flow_utils.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":"55205512756a9ef1","code_sha256_prefix":"55205512756a9ef1","mcp_get_code":{"code_sha256":"55205512756a9ef1"}},{"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/sar.py","file_url":"https://github.com/yuanyige/tea/blob/HEAD/core/adazoo/sar.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, yuanyige/tea when it was checked","code_sha256":"17259eab7993e1c7","code_sha256_prefix":"17259eab7993e1c7","mcp_get_code":{"code_sha256":"17259eab7993e1c7"}},{"arxiv_id":"2302.12400","arxiv_id_is_arxiv":true,"paper":"/paper/towards-stable-test-time-adaptation-in","title":"Towards Stable Test-Time Adaptation in Dynamic Wild World","date":"2023-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mr-eggplant/SAR","path":"sar.py","file_url":"https://github.com/mr-eggplant/SAR/blob/HEAD/sar.py","status":"unverified","verification_level":0,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"317e20a5c06dee54","code_sha256_prefix":"317e20a5c06dee54","mcp_get_code":{"code_sha256":"317e20a5c06dee54"}},{"arxiv_id":"2203.15296","arxiv_id_is_arxiv":true,"paper":"/paper/frequency-dynamic-convolution-frequency","title":"Frequency Dynamic Convolution: Frequency-Adaptive Pattern Recognition for Sound Event Detection","date":"2022-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"frednam93/FDY-SED","path":"utils/utils.py","file_url":"https://github.com/frednam93/FDY-SED/blob/HEAD/utils/utils.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":"4a179359e2060751","code_sha256_prefix":"4a179359e2060751","mcp_get_code":{"code_sha256":"4a179359e2060751"}},{"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":"recap_plpd.py","file_url":"https://github.com/scienceliuc/SaTeen/blob/HEAD/recap_plpd.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"17259eab7993e1c7","code_sha256_prefix":"17259eab7993e1c7","mcp_get_code":{"code_sha256":"17259eab7993e1c7"}}],"record_sha256":"68c1793d5c93705a1550f7653e84fb75d60e63dbdcf3439720df4ae298ea6a1a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}