{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/dataset-dest-prefix","entry":"dataset_dest_prefix","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":11,"n_papers_ran":1,"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":1,"n_samples_fingerprinted":0,"n_places":11,"n_places_pointer_only":4,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":2},"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","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,"code_sha256_prefix":"ee4a597ec93e7f03","mcp_get_code":{"code_sha256":"ee4a597ec93e7f03"}},{"arxiv_id":"2210.07535","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}},{"arxiv_id":"2209.06158","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}},{"arxiv_id":"2206.02369","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}},{"arxiv_id":"2011.00770","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"2020c8115ac4366b","mcp_get_code":{"code_sha256":"2020c8115ac4366b"}},{"arxiv_id":"2010.06138","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}},{"arxiv_id":"2005.02354","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}},{"arxiv_id":"1911.06136","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}},{"arxiv_id":"1904.11660","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}},{"arxiv_id":"1904.07418","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"code_sha256_prefix":"2020c8115ac4366b","mcp_get_code":{"code_sha256":"2020c8115ac4366b"}},{"arxiv_id":"1904.01038","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":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"code_sha256_prefix":"9eda7f80331d658c","mcp_get_code":{"code_sha256":"9eda7f80331d658c"}}]}