{"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/check-sru-requirement","entry":"check_sru_requirement","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":9,"n_papers_ran":9,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":0,"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":1,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":9,"n_places_pointer_only":0,"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":1,"ran_draft_wrong":0,"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":"2004.00588","arxiv_id_is_arxiv":true,"paper":"/paper/sign-language-translation-with-transformers","title":"Better Sign Language Translation with STMC-Transformer","date":"2020-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kayoyin/transformer-slt","path":"onmt/models/sru.py","file_url":"https://github.com/kayoyin/transformer-slt/blob/HEAD/onmt/models/sru.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c93830510f645a3","code_sha256_prefix":"0c93830510f645a3","mcp_get_code":{"code_sha256":"0c93830510f645a3"}},{"arxiv_id":"2003.03190","arxiv_id_is_arxiv":true,"paper":"/paper/a-bayesian-algorithm-for-retrosynthesis","title":"A Bayesian algorithm for retrosynthesis","date":"2020-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zguo235/bayesian_retro","path":"onmt/models/sru.py","file_url":"https://github.com/zguo235/bayesian_retro/blob/HEAD/onmt/models/sru.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c93830510f645a3","code_sha256_prefix":"0c93830510f645a3","mcp_get_code":{"code_sha256":"0c93830510f645a3"}},{"arxiv_id":"1912.05372","arxiv_id_is_arxiv":true,"paper":"/paper/flaubert-unsupervised-language-model-pre","title":"FlauBERT: Unsupervised Language Model Pre-training for French","date":"2019-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"getalp/disambiguate","path":"python/onmt/models/sru.py","file_url":"https://github.com/getalp/disambiguate/blob/HEAD/python/onmt/models/sru.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c93830510f645a3","code_sha256_prefix":"0c93830510f645a3","mcp_get_code":{"code_sha256":"0c93830510f645a3"}},{"arxiv_id":"1910.02555","arxiv_id_is_arxiv":true,"paper":"/paper/domain-differential-adaptation-for-neural","title":"Domain Differential Adaptation for Neural Machine Translation","date":"2019-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zdou0830/DDA","path":"onmt/models/sru.py","file_url":"https://github.com/zdou0830/DDA/blob/HEAD/onmt/models/sru.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c93830510f645a3","code_sha256_prefix":"0c93830510f645a3","mcp_get_code":{"code_sha256":"0c93830510f645a3"}},{"arxiv_id":"1906.07651","arxiv_id_is_arxiv":true,"paper":"/paper/scheduled-sampling-for-transformers","title":"Scheduled Sampling for Transformers","date":"2019-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deep-spin/scheduled-sampling-transformers","path":"onmt/models/sru.py","file_url":"https://github.com/deep-spin/scheduled-sampling-transformers/blob/HEAD/onmt/models/sru.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c93830510f645a3","code_sha256_prefix":"0c93830510f645a3","mcp_get_code":{"code_sha256":"0c93830510f645a3"}},{"arxiv_id":"1906.06253","arxiv_id_is_arxiv":true,"paper":"/paper/a-simple-and-effective-approach-to-automatic","title":"A Simple and Effective Approach to Automatic Post-Editing with Transfer Learning","date":"2019-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"deep-spin/OpenNMT-APE","path":"onmt/models/sru.py","file_url":"https://github.com/deep-spin/OpenNMT-APE/blob/HEAD/onmt/models/sru.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c93830510f645a3","code_sha256_prefix":"0c93830510f645a3","mcp_get_code":{"code_sha256":"0c93830510f645a3"}},{"arxiv_id":"1805.11462","arxiv_id_is_arxiv":true,"paper":"/paper/opennmt-neural-machine-translation-toolkit","title":"OpenNMT: Neural Machine Translation Toolkit","date":"2018-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Helsinki-NLP/OpenNMT-py","path":"onmt/models/sru.py","file_url":"https://github.com/Helsinki-NLP/OpenNMT-py/blob/HEAD/onmt/models/sru.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c93830510f645a3","code_sha256_prefix":"0c93830510f645a3","mcp_get_code":{"code_sha256":"0c93830510f645a3"}},{"arxiv_id":"1709.02755","arxiv_id_is_arxiv":true,"paper":"/paper/simple-recurrent-units-for-highly","title":"Simple Recurrent Units for Highly Parallelizable Recurrence","date":"2017-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"butsugiri/shape","path":"onmt/models/sru.py","file_url":"https://github.com/butsugiri/shape/blob/HEAD/onmt/models/sru.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c93830510f645a3","code_sha256_prefix":"0c93830510f645a3","mcp_get_code":{"code_sha256":"0c93830510f645a3"}},{"arxiv_id":"2020.acl-main.640","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2020.acl-main.640","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"QAQ-v/HetGT","path":"onmt/models/sru.py","file_url":"https://github.com/QAQ-v/HetGT/blob/HEAD/onmt/models/sru.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"0c93830510f645a3","code_sha256_prefix":"0c93830510f645a3","mcp_get_code":{"code_sha256":"0c93830510f645a3"}}],"record_sha256":"3a6894fc3c5d86ce704a49586094baaf2ae62d92a307eab701f12c4f3c813419","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}