{"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/module-name-fordropout","entry":"module_name_fordropout","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":8,"n_papers_ran":8,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":5,"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":6,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":12,"n_places_pointer_only":4,"n_places_pointer_only_link_open":3,"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":4,"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":"2501.02979","arxiv_id_is_arxiv":true,"paper":"/paper/registering-source-tokens-to-target-language","title":"Registering Source Tokens to Target Language Spaces in Multilingual Neural Machine Translation","date":"2025-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhiqu22/mitre","path":"mitre/models/transformer_decoder_register.py","file_url":"https://github.com/zhiqu22/mitre/blob/HEAD/mitre/models/transformer_decoder_register.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"13cfe21ed5a7b812","code_sha256_prefix":"13cfe21ed5a7b812","mcp_get_code":{"code_sha256":"13cfe21ed5a7b812"}},{"arxiv_id":"2501.02979","arxiv_id_is_arxiv":true,"paper":"/paper/registering-source-tokens-to-target-language","title":"Registering Source Tokens to Target Language Spaces in Multilingual Neural Machine Translation","date":"2025-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhiqu22/mitre","path":"mitre/models/transformer_encoder_register.py","file_url":"https://github.com/zhiqu22/mitre/blob/HEAD/mitre/models/transformer_encoder_register.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ae285f7d6c2a685e","code_sha256_prefix":"ae285f7d6c2a685e","mcp_get_code":{"code_sha256":"ae285f7d6c2a685e"}},{"arxiv_id":"2406.02876","arxiv_id_is_arxiv":true,"paper":"/paper/lcs-a-language-converter-strategy-for-zero","title":"LCS: A Language Converter Strategy for Zero-Shot Neural Machine Translation","date":"2024-06-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"acerkoo/lcs","path":"fairseq/fairseq-LCS/fairseq/models/transformer/transformer_encoder.py","file_url":"https://github.com/acerkoo/lcs/blob/HEAD/fairseq/fairseq-LCS/fairseq/models/transformer/transformer_encoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, acerkoo/lcs when it was checked","code_sha256":"c3fcda996a38b833","code_sha256_prefix":"c3fcda996a38b833","mcp_get_code":{"code_sha256":"c3fcda996a38b833"}},{"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":"fairseq/models/transformer_with_SM2/transformer_encoder.py","file_url":"https://github.com/EurekaForNLP/SM2/blob/HEAD/fairseq/models/transformer_with_SM2/transformer_encoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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 acerkoo/lcs, and GitHub detected no licence in that repository when it was checked","code_sha256":"c3fcda996a38b833","code_sha256_prefix":"c3fcda996a38b833","mcp_get_code":{"code_sha256":"c3fcda996a38b833"}},{"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":"fairseq/models/transformer_with_SM2/transformer_decoder.py","file_url":"https://github.com/EurekaForNLP/SM2/blob/HEAD/fairseq/models/transformer_with_SM2/transformer_decoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e63f8c52be2a8547","code_sha256_prefix":"e63f8c52be2a8547","mcp_get_code":{"code_sha256":"e63f8c52be2a8547"}},{"arxiv_id":"2404.00656","arxiv_id_is_arxiv":true,"paper":"/paper/wavllm-towards-robust-and-adaptive-speech","title":"WavLLM: Towards Robust and Adaptive Speech Large Language Model","date":"2024-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/speecht5","path":"SpeechLM/modules.py","file_url":"https://github.com/microsoft/speecht5/blob/HEAD/SpeechLM/modules.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"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 acerkoo/lcs, and GitHub detected no licence in that repository when it was checked","code_sha256":"c3fcda996a38b833","code_sha256_prefix":"c3fcda996a38b833","mcp_get_code":{"code_sha256":"c3fcda996a38b833"}},{"arxiv_id":"2302.05737","arxiv_id_is_arxiv":true,"paper":"/paper/a-reparameterized-discrete-diffusion-model","title":"A Reparameterized Discrete Diffusion Model for Text Generation","date":"2023-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkunlp/reparam-discrete-diffusion","path":"fairseq/diffusion_mt/models/diffusion_transformer_decoder.py","file_url":"https://github.com/hkunlp/reparam-discrete-diffusion/blob/HEAD/fairseq/diffusion_mt/models/diffusion_transformer_decoder.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":"e63f8c52be2a8547","code_sha256_prefix":"e63f8c52be2a8547","mcp_get_code":{"code_sha256":"e63f8c52be2a8547"}},{"arxiv_id":"2302.05737","arxiv_id_is_arxiv":true,"paper":"/paper/a-reparameterized-discrete-diffusion-model","title":"A Reparameterized Discrete Diffusion Model for Text Generation","date":"2023-02-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hkunlp/reparam-discrete-diffusion","path":"fairseq/diffusion_mt/models/diffusion_transformer_encoder.py","file_url":"https://github.com/hkunlp/reparam-discrete-diffusion/blob/HEAD/fairseq/diffusion_mt/models/diffusion_transformer_encoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"090e30ed6f0ab09b","code_sha256_prefix":"090e30ed6f0ab09b","mcp_get_code":{"code_sha256":"090e30ed6f0ab09b"}},{"arxiv_id":"2210.05144","arxiv_id_is_arxiv":true,"paper":"/paper/mixture-of-attention-heads-selecting","title":"Mixture of Attention Heads: Selecting Attention Heads Per Token","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yikangshen/moa","path":"transformer_encoder.py","file_url":"https://github.com/yikangshen/moa/blob/HEAD/transformer_encoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (BSD-3-Clause), but get_code serves the stored copy, first harvested from acerkoo/lcs, and GitHub detected no licence in that repository when it was checked","code_sha256":"c3fcda996a38b833","code_sha256_prefix":"c3fcda996a38b833","mcp_get_code":{"code_sha256":"c3fcda996a38b833"}},{"arxiv_id":"2210.05144","arxiv_id_is_arxiv":true,"paper":"/paper/mixture-of-attention-heads-selecting","title":"Mixture of Attention Heads: Selecting Attention Heads Per Token","date":"2022-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yikangshen/moa","path":"transformer_decoder.py","file_url":"https://github.com/yikangshen/moa/blob/HEAD/transformer_decoder.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e63f8c52be2a8547","code_sha256_prefix":"e63f8c52be2a8547","mcp_get_code":{"code_sha256":"e63f8c52be2a8547"}},{"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":"models/transformer_discrete_encoder.py","file_url":"https://github.com/jerryyli/valhalla-nmt/blob/HEAD/models/transformer_discrete_encoder.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"006572a6fdddbaed","code_sha256_prefix":"006572a6fdddbaed","mcp_get_code":{"code_sha256":"006572a6fdddbaed"}},{"arxiv_id":"2024.acl-long.435","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.acl-long.435","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"ytf-philp/AmbigST","path":"speechut/modules/transformer_decoder.py","file_url":"https://github.com/ytf-philp/AmbigST/blob/HEAD/speechut/modules/transformer_decoder.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":"e63f8c52be2a8547","code_sha256_prefix":"e63f8c52be2a8547","mcp_get_code":{"code_sha256":"e63f8c52be2a8547"}}],"record_sha256":"dd0932b468674cc02b6b4cab683ceec90545b19ea05b9bfc52351f31f4dd160f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}