{"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/get-symbols-to-strip-from-output","entry":"get_symbols_to_strip_from_output","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":18,"n_papers_ran":18,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":18,"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":2,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":18,"n_places_pointer_only":16,"n_places_pointer_only_link_open":5,"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":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":"2504.18539","arxiv_id_is_arxiv":true,"paper":"/paper/multi-task-corrupted-prediction-for-learning","title":"Multi-Task Corrupted Prediction for Learning Robust Audio-Visual Speech Representation","date":"2025-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sungnyun/cav2vec","path":"cav2vec/infer_s2s.py","file_url":"https://github.com/sungnyun/cav2vec/blob/HEAD/cav2vec/infer_s2s.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bbe1a698e337d4d4","code_sha256_prefix":"bbe1a698e337d4d4","mcp_get_code":{"code_sha256":"bbe1a698e337d4d4"}},{"arxiv_id":"2407.03563","arxiv_id_is_arxiv":true,"paper":"/paper/learning-video-temporal-dynamics-with-cross","title":"Learning Video Temporal Dynamics with Cross-Modal Attention for Robust Audio-Visual Speech Recognition","date":"2024-07-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sungnyun/avsr-temporal-dynamics","path":"avhubert/infer_s2s.py","file_url":"https://github.com/sungnyun/avsr-temporal-dynamics/blob/HEAD/avhubert/infer_s2s.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"bbe1a698e337d4d4","code_sha256_prefix":"bbe1a698e337d4d4","mcp_get_code":{"code_sha256":"bbe1a698e337d4d4"}},{"arxiv_id":"2406.02237","arxiv_id_is_arxiv":true,"paper":"/paper/self-modifying-state-modeling-for","title":"Self-Modifying State Modeling for Simultaneous Machine Translation","date":"2024-06-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"EurekaForNLP/SM2","path":"generate.py","file_url":"https://github.com/EurekaForNLP/SM2/blob/HEAD/generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 urvashik/knnmt, and GitHub detected no licence in that repository when it was checked","code_sha256":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","mcp_get_code":{"code_sha256":"88ce019380f10478"}},{"arxiv_id":"2405.18906","arxiv_id_is_arxiv":true,"paper":"/paper/language-generation-with-strictly-proper","title":"Language Generation with Strictly Proper Scoring Rules","date":"2024-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"shaochenze/scoringruleslm","path":"generate.py","file_url":"https://github.com/shaochenze/scoringruleslm/blob/HEAD/generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 urvashik/knnmt, and GitHub detected no licence in that repository when it was checked","code_sha256":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","mcp_get_code":{"code_sha256":"88ce019380f10478"}},{"arxiv_id":"2401.05596","arxiv_id_is_arxiv":true,"paper":"/paper/pomp-probability-driven-meta-graph-prompter","title":"POMP: Probability-driven Meta-graph Prompter for LLMs in Low-resource Unsupervised Neural Machine Translation","date":"2024-01-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"slpanir/POMP","path":"encoder_outs.py","file_url":"https://github.com/slpanir/POMP/blob/HEAD/encoder_outs.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 urvashik/knnmt, and GitHub detected no licence in that repository when it was checked","code_sha256":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","mcp_get_code":{"code_sha256":"88ce019380f10478"}},{"arxiv_id":"2206.00100","arxiv_id_is_arxiv":true,"paper":"/paper/valhalla-visual-hallucination-for-machine","title":"VALHALLA: Visual Hallucination for Machine Translation","date":"2022-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jerryyli/valhalla-nmt","path":"generate.py","file_url":"https://github.com/jerryyli/valhalla-nmt/blob/HEAD/generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 urvashik/knnmt, and GitHub detected no licence in that repository when it was checked","code_sha256":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","mcp_get_code":{"code_sha256":"88ce019380f10478"}},{"arxiv_id":"2204.02030","arxiv_id_is_arxiv":true,"paper":"/paper/textit-latent-glat-glancing-at-latent","title":"$\\textit{latent}$-GLAT: Glancing at Latent Variables for Parallel Text Generation","date":"2022-04-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"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":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","mcp_get_code":{"code_sha256":"88ce019380f10478"}},{"arxiv_id":"2201.01763","arxiv_id_is_arxiv":true,"paper":"/paper/robust-self-supervised-audio-visual-speech","title":"Robust Self-Supervised Audio-Visual Speech Recognition","date":"2022-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"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":"bbe1a698e337d4d4","code_sha256_prefix":"bbe1a698e337d4d4","mcp_get_code":{"code_sha256":"bbe1a698e337d4d4"}},{"arxiv_id":"2110.08547","arxiv_id_is_arxiv":true,"paper":"/paper/towards-making-the-most-of-multilingual","title":"Towards Making the Most of Multilingual Pretraining for Zero-Shot Neural Machine Translation","date":"2021-10-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ghchen18/acl22-sixtp","path":"generate.py","file_url":"https://github.com/ghchen18/acl22-sixtp/blob/HEAD/generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, ghchen18/acl22-sixtp, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","mcp_get_code":{"code_sha256":"88ce019380f10478"}},{"arxiv_id":"2110.07936","arxiv_id_is_arxiv":true,"paper":"/paper/bridging-the-gap-cross-lingual-summarization","title":"Unifying Cross-lingual Summarization and Machine Translation with Compression Rate","date":"2021-10-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"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":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","mcp_get_code":{"code_sha256":"88ce019380f10478"}},{"arxiv_id":"2109.11136","arxiv_id_is_arxiv":true,"paper":"/paper/non-parametric-online-learning-from-human","title":"Non-Parametric Online Learning from Human Feedback for Neural Machine Translation","date":"2021-09-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"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":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","mcp_get_code":{"code_sha256":"88ce019380f10478"}},{"arxiv_id":"2109.06604","arxiv_id_is_arxiv":true,"paper":"/paper/non-parametric-unsupervised-domain-adaptation","title":"Non-Parametric Unsupervised Domain Adaptation for Neural Machine Translation","date":"2021-09-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengxxn/uda-knn","path":"knn_generate.py","file_url":"https://github.com/zhengxxn/uda-knn/blob/HEAD/knn_generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, zhengxxn/uda-knn, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","mcp_get_code":{"code_sha256":"88ce019380f10478"}},{"arxiv_id":"2106.06751","arxiv_id_is_arxiv":true,"paper":"/paper/guiding-teacher-forcing-with-seer-forcing-for","title":"Guiding Teacher Forcing with Seer Forcing for Neural Machine Translation","date":"2021-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ictnlp/SeerForcingNMT","path":"generate.py","file_url":"https://github.com/ictnlp/SeerForcingNMT/blob/HEAD/generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, ictnlp/SeerForcingNMT, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","mcp_get_code":{"code_sha256":"88ce019380f10478"}},{"arxiv_id":"2105.13022","arxiv_id_is_arxiv":true,"paper":"/paper/adaptive-nearest-neighbor-machine-translation","title":"Adaptive Nearest Neighbor Machine Translation","date":"2021-05-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengxxn/adaptive-knn-mt","path":"knn_generate.py","file_url":"https://github.com/zhengxxn/adaptive-knn-mt/blob/HEAD/knn_generate.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, zhengxxn/adaptive-knn-mt, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","mcp_get_code":{"code_sha256":"88ce019380f10478"}},{"arxiv_id":"2105.05498","arxiv_id_is_arxiv":true,"paper":"/paper/improving-lexically-constrained-neural","title":"Improving Lexically Constrained Neural Machine Translation with Source-Conditioned Masked Span Prediction","date":"2021-05-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wns823/NMT_SSP","path":"generate_text.py","file_url":"https://github.com/wns823/NMT_SSP/blob/HEAD/generate_text.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, wns823/NMT_SSP, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","mcp_get_code":{"code_sha256":"88ce019380f10478"}},{"arxiv_id":"2010.00710","arxiv_id_is_arxiv":true,"paper":"/paper/nearest-neighbor-machine-translation","title":"Nearest Neighbor Machine Translation","date":"2020-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"urvashik/knnmt","path":"fairseq_cli/generate.py","file_url":"https://github.com/urvashik/knnmt/blob/HEAD/fairseq_cli/generate.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, urvashik/knnmt when it was checked","code_sha256":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","mcp_get_code":{"code_sha256":"88ce019380f10478"}},{"arxiv_id":"1909.08723","arxiv_id_is_arxiv":true,"paper":"/paper/espresso-a-fast-end-to-end-neural-speech","title":"Espresso: A Fast End-to-end Neural Speech Recognition Toolkit","date":"2019-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"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":"bbe1a698e337d4d4","code_sha256_prefix":"bbe1a698e337d4d4","mcp_get_code":{"code_sha256":"bbe1a698e337d4d4"}},{"arxiv_id":"aaai_21303","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_21303","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"duyichao/E2E-ST-TDA","path":"fairseq_cli/generate_tda.py","file_url":"https://github.com/duyichao/E2E-ST-TDA/blob/HEAD/fairseq_cli/generate_tda.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","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 urvashik/knnmt, and GitHub detected no licence in that repository when it was checked","code_sha256":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","mcp_get_code":{"code_sha256":"88ce019380f10478"}}],"record_sha256":"262b87df3fdec57821cfedaf99fe4fe1488105230bb08cf4b1bde9a632909cd0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}