{"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/dataset-dest-prefix","entry":"dataset_dest_prefix","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":11,"n_papers_ran_no_instrument_failure":11,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":4,"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":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":3,"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":"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":"preprocess.py","file_url":"https://github.com/shaochenze/scoringruleslm/blob/HEAD/preprocess.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":"ee4a597ec93e7f03","code_sha256_prefix":"ee4a597ec93e7f03","mcp_get_code":{"code_sha256":"ee4a597ec93e7f03"}},{"arxiv_id":"2210.07535","arxiv_id_is_arxiv":true,"paper":"/paper/automoe-neural-architecture-search-for","title":"AutoMoE: Heterogeneous Mixture-of-Experts with Adaptive Computation for Efficient Neural Machine Translation","date":"2022-10-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/automoe","path":"preprocess.py","file_url":"https://github.com/microsoft/automoe/blob/HEAD/preprocess.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":"9eda7f80331d658c","code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}},{"arxiv_id":"2209.06158","arxiv_id_is_arxiv":true,"paper":"/paper/tailoring-molecules-for-protein-pockets-a","title":"Tailoring Molecules for Protein Pockets: a Transformer-based Generative Solution for Structured-based Drug Design","date":"2022-08-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hankerwu/tamgent","path":"preprocess.py","file_url":"https://github.com/hankerwu/tamgent/blob/HEAD/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, hankerwu/tamgent, 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":"9eda7f80331d658c","code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}},{"arxiv_id":"2206.02369","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-break-the-loop-analyzing-and","title":"Learning to Break the Loop: Analyzing and Mitigating Repetitions for Neural Text Generation","date":"2022-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Jxu-Thu/DIITTO","path":"preprocess.py","file_url":"https://github.com/Jxu-Thu/DIITTO/blob/HEAD/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, Jxu-Thu/DIITTO, 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":"9eda7f80331d658c","code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}},{"arxiv_id":"2011.00770","arxiv_id_is_arxiv":true,"paper":"/paper/context-aware-cross-attention-for-non","title":"Context-Aware Cross-Attention for Non-Autoregressive Translation","date":"2020-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alphadl/CCAN","path":"preprocess.py","file_url":"https://github.com/alphadl/CCAN/blob/HEAD/preprocess.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":"2020c8115ac4366b","code_sha256_prefix":"2020c8115ac4366b","mcp_get_code":{"code_sha256":"2020c8115ac4366b"}},{"arxiv_id":"2010.06138","arxiv_id_is_arxiv":true,"paper":"/paper/incorporating-bert-into-parallel-sequence","title":"Incorporating BERT into Parallel Sequence Decoding with Adapters","date":"2020-10-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lemmonation/abnet","path":"preprocess.py","file_url":"https://github.com/lemmonation/abnet/blob/HEAD/preprocess.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":"9eda7f80331d658c","code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}},{"arxiv_id":"2005.02354","arxiv_id_is_arxiv":true,"paper":"/paper/it-s-easier-to-translate-out-of-english-than","title":"It's Easier to Translate out of English than into it: Measuring Neural Translation Difficulty by Cross-Mutual Information","date":"2020-05-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"e-bug/nmt-difficulty","path":"fairseq-0.6.2/preprocess.py","file_url":"https://github.com/e-bug/nmt-difficulty/blob/HEAD/fairseq-0.6.2/preprocess.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":"9eda7f80331d658c","code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}},{"arxiv_id":"1911.06136","arxiv_id_is_arxiv":true,"paper":"/paper/kepler-a-unified-model-for-knowledge","title":"KEPLER: A Unified Model for Knowledge Embedding and Pre-trained Language Representation","date":"2019-11-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"THU-KEG/KEPLER","path":"preprocess.py","file_url":"https://github.com/THU-KEG/KEPLER/blob/HEAD/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, THU-KEG/KEPLER, 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":"9eda7f80331d658c","code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}},{"arxiv_id":"1904.11660","arxiv_id_is_arxiv":true,"paper":"/paper/transformers-with-convolutional-context-for","title":"Transformers with convolutional context for ASR","date":"2019-04-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"insop/pytorch-hackathon","path":"fairseq/preprocess.py","file_url":"https://github.com/insop/pytorch-hackathon/blob/HEAD/fairseq/preprocess.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":"9eda7f80331d658c","code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}},{"arxiv_id":"1904.07418","arxiv_id_is_arxiv":true,"paper":"/paper/positional-encoding-to-control-output","title":"Positional Encoding to Control Output Sequence Length","date":"2019-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"takase/control-length","path":"encdec/preprocess.py","file_url":"https://github.com/takase/control-length/blob/HEAD/encdec/preprocess.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":"2020c8115ac4366b","code_sha256_prefix":"2020c8115ac4366b","mcp_get_code":{"code_sha256":"2020c8115ac4366b"}},{"arxiv_id":"1904.01038","arxiv_id_is_arxiv":true,"paper":"/paper/fairseq-a-fast-extensible-toolkit-for","title":"fairseq: A Fast, Extensible Toolkit for Sequence Modeling","date":"2019-04-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lucylow/En_francais_si_vous_plait-","path":"preprocess.py","file_url":"https://github.com/lucylow/En_francais_si_vous_plait-/blob/HEAD/preprocess.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, lucylow/En_francais_si_vous_plait-, 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":"9eda7f80331d658c","code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}}],"record_sha256":"24fbadb779a93d11aa3d0774a160509805c3bf63f180100f6b276a73ef8ad2c1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}