{"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/read-text","entry":"read_text","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":29,"n_papers_ran":28,"n_papers_ran_no_instrument_failure":11,"n_papers_ran_instrument_only":17,"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":33,"n_samples_ran":27,"n_samples_constructed":0,"n_samples_ran_checked":12,"n_samples_instrument":15,"n_samples_unverified":6,"n_samples_fingerprinted":2,"n_places":35,"n_places_pointer_only":15,"n_places_pointer_only_link_open":2,"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":1,"ran_violates":0,"ran_draft_wrong":15,"ran_fixture":0,"ran":11,"unverified":6},"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.00918","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-00918","title":"RPCBench: A Benchmark for Proactive Premise Critique in LLM-based Recommendation","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"ZhongruChen/RPCBench","path":"src/step3/_step3_common.py","file_url":"https://github.com/ZhongruChen/RPCBench/blob/HEAD/src/step3/_step3_common.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, ZhongruChen/RPCBench when it was checked","code_sha256":"20fcd0305364bce7","code_sha256_prefix":"20fcd0305364bce7","mcp_get_code":{"code_sha256":"20fcd0305364bce7"}},{"arxiv_id":"2608.03743","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-03743","title":"Can LLMs Test Terminal User Interfaces?","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"tui-testing/tuicov","path":"src/tuicov/util.py","file_url":"https://github.com/tui-testing/tuicov/blob/HEAD/src/tuicov/util.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":"59fbe599a8d2d6de","code_sha256_prefix":"59fbe599a8d2d6de","mcp_get_code":{"code_sha256":"59fbe599a8d2d6de"}},{"arxiv_id":"2607.23588","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-23588","title":"JarvisHub: An Open Harness for Canvas-Native Multimodal Creative Agents","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"LYL1015/JarvisHub","path":"apps/agents-cli/emp_code/scrape/component_card_index.py","file_url":"https://github.com/LYL1015/JarvisHub/blob/HEAD/apps/agents-cli/emp_code/scrape/component_card_index.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2d084296a9ef1d2f","code_sha256_prefix":"2d084296a9ef1d2f","mcp_get_code":{"code_sha256":"2d084296a9ef1d2f"}},{"arxiv_id":"2607.22832","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-22832","title":"MEMENTO: Memory-Guided Memetic Code-as-Policy Evolution","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"sygkounas/MEMENTO","path":"MEMENTO/utils.py","file_url":"https://github.com/sygkounas/MEMENTO/blob/HEAD/MEMENTO/utils.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, sygkounas/MEMENTO when it was checked","code_sha256":"57c26356a848e98c","code_sha256_prefix":"57c26356a848e98c","mcp_get_code":{"code_sha256":"57c26356a848e98c"}},{"arxiv_id":"2605.30358","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-30358","title":"QASM-Eval: A Dataset to Train and Evaluate LLMs on OpenQASM-3 Beyond Quantum Circuits","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"fuzhenxiao/QASM-Eval","path":"dataset_factory/build_parquet_dataset.py","file_url":"https://github.com/fuzhenxiao/QASM-Eval/blob/HEAD/dataset_factory/build_parquet_dataset.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, fuzhenxiao/QASM-Eval when it was checked","code_sha256":"1162e7f1352ecaac","code_sha256_prefix":"1162e7f1352ecaac","mcp_get_code":{"code_sha256":"1162e7f1352ecaac"}},{"arxiv_id":"2604.24348","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-24348","title":"OS-SPEAR: A Toolkit for the Safety, Performance, Efficiency, and Robustness Analysis of OS Agents","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"Wuzheng02/OS-SPEAR","path":"report/evaluate.py","file_url":"https://github.com/Wuzheng02/OS-SPEAR/blob/HEAD/report/evaluate.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, Wuzheng02/OS-SPEAR when it was checked","code_sha256":"4c644a9a6cf99165","code_sha256_prefix":"4c644a9a6cf99165","mcp_get_code":{"code_sha256":"4c644a9a6cf99165"}},{"arxiv_id":"2601.08955","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-08955","title":"Imagine-then-Plan: Agent Learning from Adaptive Lookahead with World Models","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"loyiv/ITP","path":"itp/orchestrator.py","file_url":"https://github.com/loyiv/ITP/blob/HEAD/itp/orchestrator.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":"aa20ac65f6b33d56","code_sha256_prefix":"aa20ac65f6b33d56","mcp_get_code":{"code_sha256":"aa20ac65f6b33d56"}},{"arxiv_id":"2601.05051","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-05051","title":"Publishing FAIR and Machine-actionable Reviews in Materials Science: The Case for Symbolic Knowledge in Neuro-symbolic Artificial Intelligence","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"sciknoworg/ald-ale-orkg-review","path":"llm-experiments/nl_query_generator_csv_onetable.py","file_url":"https://github.com/sciknoworg/ald-ale-orkg-review/blob/HEAD/llm-experiments/nl_query_generator_csv_onetable.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a1d9b2a4ec83505a","code_sha256_prefix":"a1d9b2a4ec83505a","mcp_get_code":{"code_sha256":"a1d9b2a4ec83505a"}},{"arxiv_id":"2510.02392","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-02392","title":"KnowledgeSmith: Uncovering Knowledge Updating in LLMs with Model Editing and Unlearning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"AIFrontierLab/KnowledgeSmith","path":"training/unlearn/baselines/src/utils.py","file_url":"https://github.com/AIFrontierLab/KnowledgeSmith/blob/HEAD/training/unlearn/baselines/src/utils.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, AIFrontierLab/KnowledgeSmith when it was checked","code_sha256":"ed81414ea2349a5f","code_sha256_prefix":"ed81414ea2349a5f","mcp_get_code":{"code_sha256":"ed81414ea2349a5f"}},{"arxiv_id":"2507.04701","arxiv_id_is_arxiv":true,"paper":"/paper/xiyan-sql-a-novel-multi-generator-framework","title":"XiYan-SQL: A Novel Multi-Generator Framework For Text-to-SQL","date":"2025-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XGenerationLab/M-Schema","path":"utils.py","file_url":"https://github.com/XGenerationLab/M-Schema/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fe5a7de21a351e05","code_sha256_prefix":"fe5a7de21a351e05","mcp_get_code":{"code_sha256":"fe5a7de21a351e05"}},{"arxiv_id":"2507.04701","arxiv_id_is_arxiv":true,"paper":"/paper/xiyan-sql-a-novel-multi-generator-framework","title":"XiYan-SQL: A Novel Multi-Generator Framework For Text-to-SQL","date":"2025-07-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xgenerationlab/xiyan_mcp_server","path":"src/xiyan_mcp_server/utils/file_util.py","file_url":"https://github.com/xgenerationlab/xiyan_mcp_server/blob/HEAD/src/xiyan_mcp_server/utils/file_util.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"83f493000b654a46","code_sha256_prefix":"83f493000b654a46","mcp_get_code":{"code_sha256":"83f493000b654a46"}},{"arxiv_id":"2504.07483","arxiv_id_is_arxiv":true,"paper":"/paper/program-skeletons-for-automated-program","title":"Program Skeletons for Automated Program Translation","date":null,"month_inferred_from_arxiv_id":"2025-04","title_source":"archive","repo":"lty12b9b0a1/skel","path":"scripts/evaluation.py","file_url":"https://github.com/lty12b9b0a1/skel/blob/HEAD/scripts/evaluation.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":"8adb3abddbe5d685","code_sha256_prefix":"8adb3abddbe5d685","mcp_get_code":{"code_sha256":"8adb3abddbe5d685"}},{"arxiv_id":"2502.11190","arxiv_id_is_arxiv":true,"paper":"/paper/relearn-unlearning-via-learning-for-large","title":"ReLearn: Unlearning via Learning for Large Language Models","date":"2025-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zjunlp/unlearn","path":"baselines/src/utils.py","file_url":"https://github.com/zjunlp/unlearn/blob/HEAD/baselines/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 AIFrontierLab/KnowledgeSmith, and GitHub detected no licence in that repository when it was checked","code_sha256":"ed81414ea2349a5f","code_sha256_prefix":"ed81414ea2349a5f","mcp_get_code":{"code_sha256":"ed81414ea2349a5f"}},{"arxiv_id":"2502.05374","arxiv_id_is_arxiv":true,"paper":"/paper/towards-llm-unlearning-resilient-to","title":"Towards LLM Unlearning Resilient to Relearning Attacks: A Sharpness-Aware Minimization Perspective and Beyond","date":"2025-02-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"optml-group/unlearn-smooth","path":"MUSE/utils.py","file_url":"https://github.com/optml-group/unlearn-smooth/blob/HEAD/MUSE/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"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 zzwjames/FailureLLMUnlearning, and GitHub detected no licence in that repository when it was checked","code_sha256":"e5eddaddc316682b","code_sha256_prefix":"e5eddaddc316682b","mcp_get_code":{"code_sha256":"e5eddaddc316682b"}},{"arxiv_id":"2410.21662","arxiv_id_is_arxiv":true,"paper":"/paper/f-po-generalizing-preference-optimization","title":"$f$-PO: Generalizing Preference Optimization with $f$-divergence Minimization","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"minkaixu/fpo","path":"src/api.py","file_url":"https://github.com/minkaixu/fpo/blob/HEAD/src/api.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":"c97333aaf3e9d25f","code_sha256_prefix":"c97333aaf3e9d25f","mcp_get_code":{"code_sha256":"c97333aaf3e9d25f"}},{"arxiv_id":"2410.16454","arxiv_id_is_arxiv":true,"paper":"/paper/does-your-llm-truly-unlearn-an-embarrassingly","title":"Catastrophic Failure of LLM Unlearning via Quantization","date":"2024-10-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzwjames/FailureLLMUnlearning","path":"utils.py","file_url":"https://github.com/zzwjames/FailureLLMUnlearning/blob/HEAD/utils.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, zzwjames/FailureLLMUnlearning when it was checked","code_sha256":"e5eddaddc316682b","code_sha256_prefix":"e5eddaddc316682b","mcp_get_code":{"code_sha256":"e5eddaddc316682b"}},{"arxiv_id":"2407.07084","arxiv_id_is_arxiv":true,"paper":"/paper/stabilized-proximal-point-methods-for","title":"Stabilized Proximal-Point Methods for Federated Optimization","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mlolab/s-dane","path":"src/utils.py","file_url":"https://github.com/mlolab/s-dane/blob/HEAD/src/utils.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, mlolab/s-dane when it was checked","code_sha256":"4c6787e9e326cb19","code_sha256_prefix":"4c6787e9e326cb19","mcp_get_code":{"code_sha256":"4c6787e9e326cb19"}},{"arxiv_id":"2407.06491","arxiv_id_is_arxiv":true,"paper":"/paper/videoeval-comprehensive-benchmark-suite-for","title":"VideoEval: Comprehensive Benchmark Suite for Low-Cost Evaluation of Video Foundation Model","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leexinhao/VideoEval","path":"VidTAB_Zeroshot/vid_prompt_gen.py","file_url":"https://github.com/leexinhao/VideoEval/blob/HEAD/VidTAB_Zeroshot/vid_prompt_gen.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, leexinhao/VideoEval when it was checked","code_sha256":"31baa455fe73dd62","code_sha256_prefix":"31baa455fe73dd62","mcp_get_code":{"code_sha256":"31baa455fe73dd62"}},{"arxiv_id":"2407.06491","arxiv_id_is_arxiv":true,"paper":"/paper/videoeval-comprehensive-benchmark-suite-for","title":"VideoEval: Comprehensive Benchmark Suite for Low-Cost Evaluation of Video Foundation Model","date":"2024-07-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leexinhao/VideoEval","path":"VidTAB_Zeroshot/img_prompt_gen.py","file_url":"https://github.com/leexinhao/VideoEval/blob/HEAD/VidTAB_Zeroshot/img_prompt_gen.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, leexinhao/VideoEval when it was checked","code_sha256":"1992dca569248e15","code_sha256_prefix":"1992dca569248e15","mcp_get_code":{"code_sha256":"1992dca569248e15"}},{"arxiv_id":"2402.07945","arxiv_id_is_arxiv":true,"paper":"/paper/screenagent-a-vision-language-model-driven","title":"ScreenAgent: A Vision Language Model-driven Computer Control Agent","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niuzaisheng/ScreenAgent","path":"client/asyncvnc.py","file_url":"https://github.com/niuzaisheng/ScreenAgent/blob/HEAD/client/asyncvnc.py","status":"ran","verification_level":1,"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, niuzaisheng/ScreenAgent (NOASSERTION)","code_sha256":"52dc9a4327ee52bd","code_sha256_prefix":"52dc9a4327ee52bd","mcp_get_code":{"code_sha256":"52dc9a4327ee52bd"}},{"arxiv_id":"2310.09505","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-test-time-adaptation-for-acoustic","title":"Advancing Test-Time Adaptation in Wild Acoustic Test Settings","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Waffle-Liu/CEA","path":"corpus/CHiME.py","file_url":"https://github.com/Waffle-Liu/CEA/blob/HEAD/corpus/CHiME.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":"8f95ea6583bad9ea","code_sha256_prefix":"8f95ea6583bad9ea","mcp_get_code":{"code_sha256":"8f95ea6583bad9ea"}},{"arxiv_id":"2310.09505","arxiv_id_is_arxiv":true,"paper":"/paper/advancing-test-time-adaptation-for-acoustic","title":"Advancing Test-Time Adaptation in Wild Acoustic Test Settings","date":"2023-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Waffle-Liu/CEA","path":"corpus/librispeech.py","file_url":"https://github.com/Waffle-Liu/CEA/blob/HEAD/corpus/librispeech.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":"0fc0a419d5c391d6","code_sha256_prefix":"0fc0a419d5c391d6","mcp_get_code":{"code_sha256":"0fc0a419d5c391d6"}},{"arxiv_id":"2309.03904","arxiv_id_is_arxiv":true,"paper":"/paper/exploring-sparse-moe-in-gans-for-text","title":"Exploring Sparse MoE in GANs for Text-conditioned Image Synthesis","date":"2023-09-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhujiapeng/aurora","path":"run_synthesize.py","file_url":"https://github.com/zhujiapeng/aurora/blob/HEAD/run_synthesize.py","status":"ran","verification_level":1,"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, zhujiapeng/aurora (NOASSERTION)","code_sha256":"665e2fc06573f4d0","code_sha256_prefix":"665e2fc06573f4d0","mcp_get_code":{"code_sha256":"665e2fc06573f4d0"}},{"arxiv_id":"2306.01981","arxiv_id_is_arxiv":true,"paper":"/paper/sgem-test-time-adaptation-for-automatic","title":"SGEM: Test-Time Adaptation for Automatic Speech Recognition via Sequential-Level Generalized Entropy Minimization","date":"2023-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drumpt/sgem","path":"corpus/ted.py","file_url":"https://github.com/drumpt/sgem/blob/HEAD/corpus/ted.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":"4b1f53425f7a3379","code_sha256_prefix":"4b1f53425f7a3379","mcp_get_code":{"code_sha256":"4b1f53425f7a3379"}},{"arxiv_id":"2306.01981","arxiv_id_is_arxiv":true,"paper":"/paper/sgem-test-time-adaptation-for-automatic","title":"SGEM: Test-Time Adaptation for Automatic Speech Recognition via Sequential-Level Generalized Entropy Minimization","date":"2023-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drumpt/sgem","path":"corpus/CHiME.py","file_url":"https://github.com/drumpt/sgem/blob/HEAD/corpus/CHiME.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":"ed861ce6a327e3b5","code_sha256_prefix":"ed861ce6a327e3b5","mcp_get_code":{"code_sha256":"ed861ce6a327e3b5"}},{"arxiv_id":"2306.01981","arxiv_id_is_arxiv":true,"paper":"/paper/sgem-test-time-adaptation-for-automatic","title":"SGEM: Test-Time Adaptation for Automatic Speech Recognition via Sequential-Level Generalized Entropy Minimization","date":"2023-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"drumpt/sgem","path":"corpus/librispeech.py","file_url":"https://github.com/drumpt/sgem/blob/HEAD/corpus/librispeech.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":"30b97f1aebe60c1d","code_sha256_prefix":"30b97f1aebe60c1d","mcp_get_code":{"code_sha256":"30b97f1aebe60c1d"}},{"arxiv_id":"2305.19713","arxiv_id_is_arxiv":true,"paper":"/paper/red-teaming-language-model-detectors-with","title":"Red Teaming Language Model Detectors with Language Models","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shizhouxing/Attack-LM-Detectors","path":"utils.py","file_url":"https://github.com/shizhouxing/Attack-LM-Detectors/blob/HEAD/utils.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":"c3a40e446ef9f89c","code_sha256_prefix":"c3a40e446ef9f89c","mcp_get_code":{"code_sha256":"c3a40e446ef9f89c"}},{"arxiv_id":"2201.12716","arxiv_id_is_arxiv":true,"paper":"/paper/you-only-demonstrate-once-category-level","title":"You Only Demonstrate Once: Category-Level Manipulation from Single Visual Demonstration","date":"2022-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenbowen123/BundleTrack","path":"lf-net-release/common/io_utils.py","file_url":"https://github.com/wenbowen123/BundleTrack/blob/HEAD/lf-net-release/common/io_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e84972e37db0a57a","code_sha256_prefix":"e84972e37db0a57a","mcp_get_code":{"code_sha256":"e84972e37db0a57a"}},{"arxiv_id":"2006.12467","arxiv_id_is_arxiv":true,"paper":"/paper/limits-to-depth-efficiencies-of-self","title":"The Depth-to-Width Interplay in Self-Attention","date":"2020-06-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"uf-hobi-informatics-lab/GatorTron","path":"finetuning/nemo_ner/nemo2bio.py","file_url":"https://github.com/uf-hobi-informatics-lab/GatorTron/blob/HEAD/finetuning/nemo_ner/nemo2bio.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":"fbf1f4b2112b56ad","code_sha256_prefix":"fbf1f4b2112b56ad","mcp_get_code":{"code_sha256":"fbf1f4b2112b56ad"}},{"arxiv_id":"1910.12638","arxiv_id_is_arxiv":true,"paper":"/paper/mockingjay-unsupervised-speech-representation","title":"Mockingjay: Unsupervised Speech Representation Learning with Deep Bidirectional Transformer Encoders","date":"2019-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samirsahoo007/Audio-and-Speech-Processing","path":"preprocess_timit.py","file_url":"https://github.com/samirsahoo007/Audio-and-Speech-Processing/blob/HEAD/preprocess_timit.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":"a3073fde9ca15c72","code_sha256_prefix":"a3073fde9ca15c72","mcp_get_code":{"code_sha256":"a3073fde9ca15c72"}},{"arxiv_id":"1910.12638","arxiv_id_is_arxiv":true,"paper":"/paper/mockingjay-unsupervised-speech-representation","title":"Mockingjay: Unsupervised Speech Representation Learning with Deep Bidirectional Transformer Encoders","date":"2019-10-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samirsahoo007/Audio-and-Speech-Processing","path":"preprocess.py","file_url":"https://github.com/samirsahoo007/Audio-and-Speech-Processing/blob/HEAD/preprocess.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":"35551a0a794f39cb","code_sha256_prefix":"35551a0a794f39cb","mcp_get_code":{"code_sha256":"35551a0a794f39cb"}},{"arxiv_id":"1807.09856","arxiv_id_is_arxiv":true,"paper":"/paper/where-are-the-blobs-counting-by-localization","title":"Where are the Blobs: Counting by Localization with Point Supervision","date":"2018-07-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ElementAI/LCFCN","path":"src/utils.py","file_url":"https://github.com/ElementAI/LCFCN/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6bb69822b71a0057","code_sha256_prefix":"6bb69822b71a0057","mcp_get_code":{"code_sha256":"6bb69822b71a0057"}},{"arxiv_id":"1606.07772","arxiv_id_is_arxiv":true,"paper":"/paper/the-emotional-arcs-of-stories-are-dominated","title":"The emotional arcs of stories are dominated by six basic shapes","date":"2016-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"andyreagan/core-stories","path":"src/build_csvs.py","file_url":"https://github.com/andyreagan/core-stories/blob/HEAD/src/build_csvs.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, andyreagan/core-stories when it was checked","code_sha256":"86b80cf66abcc8bf","code_sha256_prefix":"86b80cf66abcc8bf","mcp_get_code":{"code_sha256":"86b80cf66abcc8bf"}},{"arxiv_id":"1408.5882","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-neural-networks-for-sentence","title":"Convolutional Neural Networks for Sentence Classification","date":"2014-08-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kh-kim/simple-ntc","path":"classify.py","file_url":"https://github.com/kh-kim/simple-ntc/blob/HEAD/classify.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kh-kim/simple-ntc when it was checked","code_sha256":"aa2e11b6e900e44a","code_sha256_prefix":"aa2e11b6e900e44a","mcp_get_code":{"code_sha256":"aa2e11b6e900e44a"}},{"arxiv_id":"2022.findings-emnlp.137","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.findings-emnlp.137","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"xlxwalex/FCGEC","path":"model/STG-correction/demo_pipeline.py","file_url":"https://github.com/xlxwalex/FCGEC/blob/HEAD/model/STG-correction/demo_pipeline.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"273ee7e3a249499d","code_sha256_prefix":"273ee7e3a249499d","mcp_get_code":{"code_sha256":"273ee7e3a249499d"}}],"record_sha256":"cc9b28e221ee60054abd4e59dd27f29e1c6f69684df7148772837aa8a6fb4ce9","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}