{"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/create-parser","entry":"create_parser","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":4,"n_papers_ran_instrument_only":7,"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":19,"n_samples_ran":19,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":10,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":21,"n_places_pointer_only":7,"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":10,"ran_fixture":0,"ran":9,"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":"2607.00890","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-00890","title":"MultiSynt/MT: Trillion-Token Multi-Parallel Pre-Training Data Translated Across 36 Languages","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"Helsinki-NLP/Opus-MT","path":"apply_bpe.py","file_url":"https://github.com/Helsinki-NLP/Opus-MT/blob/HEAD/apply_bpe.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f49716cdf8379c4f","code_sha256_prefix":"f49716cdf8379c4f","mcp_get_code":{"code_sha256":"f49716cdf8379c4f"}},{"arxiv_id":"2402.02317","arxiv_id_is_arxiv":true,"paper":"/paper/invit-a-generalizable-routing-problem-solver","title":"INViT: A Generalizable Routing Problem Solver with Invariant Nested View Transformer","date":"2024-02-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kasumigaoka-utaha/invit","path":"utils/utils_for_model.py","file_url":"https://github.com/kasumigaoka-utaha/invit/blob/HEAD/utils/utils_for_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kasumigaoka-utaha/invit when it was checked","code_sha256":"797fad5ede15d1a2","code_sha256_prefix":"797fad5ede15d1a2","mcp_get_code":{"code_sha256":"797fad5ede15d1a2"}},{"arxiv_id":"2208.05083","arxiv_id_is_arxiv":true,"paper":"/paper/reducing-exploitability-with-population-based","title":"Reducing Exploitability with Population Based Training","date":"2022-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"humancompatibleai/reducing-exploitability","path":"src/dep/evaluate.py","file_url":"https://github.com/humancompatibleai/reducing-exploitability/blob/HEAD/src/dep/evaluate.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":"0e5de1a0b68887a8","code_sha256_prefix":"0e5de1a0b68887a8","mcp_get_code":{"code_sha256":"0e5de1a0b68887a8"}},{"arxiv_id":"2108.04718","arxiv_id_is_arxiv":true,"paper":"/paper/sampling-based-minimum-bayes-risk-decoding","title":"Sampling-Based Approximations to Minimum Bayes Risk Decoding for Neural Machine Translation","date":"2021-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"roxot/mbr-nmt","path":"mbr_nmt/translate.py","file_url":"https://github.com/roxot/mbr-nmt/blob/HEAD/mbr_nmt/translate.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, roxot/mbr-nmt when it was checked","code_sha256":"fb3ecde1e5f83089","code_sha256_prefix":"fb3ecde1e5f83089","mcp_get_code":{"code_sha256":"fb3ecde1e5f83089"}},{"arxiv_id":"2108.04718","arxiv_id_is_arxiv":true,"paper":"/paper/sampling-based-minimum-bayes-risk-decoding","title":"Sampling-Based Approximations to Minimum Bayes Risk Decoding for Neural Machine Translation","date":"2021-08-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"roxot/mbr-nmt","path":"mbr_nmt/convert.py","file_url":"https://github.com/roxot/mbr-nmt/blob/HEAD/mbr_nmt/convert.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, roxot/mbr-nmt when it was checked","code_sha256":"df35dfd8645abfbc","code_sha256_prefix":"df35dfd8645abfbc","mcp_get_code":{"code_sha256":"df35dfd8645abfbc"}},{"arxiv_id":"2001.01808","arxiv_id_is_arxiv":true,"paper":"/paper/autockt-deep-reinforcement-learning-of-analog","title":"AutoCkt: Deep Reinforcement Learning of Analog Circuit Designs","date":null,"month_inferred_from_arxiv_id":"2020-01","title_source":"archive","repo":"ksettaluri6/AutoCkt","path":"autockt/rollout.py","file_url":"https://github.com/ksettaluri6/AutoCkt/blob/HEAD/autockt/rollout.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, ksettaluri6/AutoCkt when it was checked","code_sha256":"58009d260823e23c","code_sha256_prefix":"58009d260823e23c","mcp_get_code":{"code_sha256":"58009d260823e23c"}},{"arxiv_id":"1910.13267","arxiv_id_is_arxiv":true,"paper":"/paper/191013267","title":"BPE-Dropout: Simple and Effective Subword Regularization","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rsennrich/subword-nmt","path":"subword_nmt/learn_bpe.py","file_url":"https://github.com/rsennrich/subword-nmt/blob/HEAD/subword_nmt/learn_bpe.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1dc5d59fd80a7419","code_sha256_prefix":"1dc5d59fd80a7419","mcp_get_code":{"code_sha256":"1dc5d59fd80a7419"}},{"arxiv_id":"1910.13267","arxiv_id_is_arxiv":true,"paper":"/paper/191013267","title":"BPE-Dropout: Simple and Effective Subword Regularization","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rsennrich/subword-nmt","path":"subword_nmt/apply_bpe.py","file_url":"https://github.com/rsennrich/subword-nmt/blob/HEAD/subword_nmt/apply_bpe.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f9d4ba98fc7a6214","code_sha256_prefix":"f9d4ba98fc7a6214","mcp_get_code":{"code_sha256":"f9d4ba98fc7a6214"}},{"arxiv_id":"1910.13267","arxiv_id_is_arxiv":true,"paper":"/paper/191013267","title":"BPE-Dropout: Simple and Effective Subword Regularization","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PatxiofromAlphensign/subword-nmt-mods","path":"subword_nmt/apply_bpe.py","file_url":"https://github.com/PatxiofromAlphensign/subword-nmt-mods/blob/HEAD/subword_nmt/apply_bpe.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":"68576350e37086cd","code_sha256_prefix":"68576350e37086cd","mcp_get_code":{"code_sha256":"68576350e37086cd"}},{"arxiv_id":"1910.13267","arxiv_id_is_arxiv":true,"paper":"/paper/191013267","title":"BPE-Dropout: Simple and Effective Subword Regularization","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PatxiofromAlphensign/subword-nmt-mods","path":"subword_nmt/get_vocab.py","file_url":"https://github.com/PatxiofromAlphensign/subword-nmt-mods/blob/HEAD/subword_nmt/get_vocab.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":"640ae72885772256","code_sha256_prefix":"640ae72885772256","mcp_get_code":{"code_sha256":"640ae72885772256"}},{"arxiv_id":"1910.13267","arxiv_id_is_arxiv":true,"paper":"/paper/191013267","title":"BPE-Dropout: Simple and Effective Subword Regularization","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PatxiofromAlphensign/subword-nmt-mods","path":"subword_nmt/learn_bpe.py","file_url":"https://github.com/PatxiofromAlphensign/subword-nmt-mods/blob/HEAD/subword_nmt/learn_bpe.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":"c330a23c53f2f1b3","code_sha256_prefix":"c330a23c53f2f1b3","mcp_get_code":{"code_sha256":"c330a23c53f2f1b3"}},{"arxiv_id":"1910.13267","arxiv_id_is_arxiv":true,"paper":"/paper/191013267","title":"BPE-Dropout: Simple and Effective Subword Regularization","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PatxiofromAlphensign/subword-nmt-mods","path":"subword_nmt/learn_joint_bpe_and_vocab.py","file_url":"https://github.com/PatxiofromAlphensign/subword-nmt-mods/blob/HEAD/subword_nmt/learn_joint_bpe_and_vocab.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":"e4ba5660a014dc1f","code_sha256_prefix":"e4ba5660a014dc1f","mcp_get_code":{"code_sha256":"e4ba5660a014dc1f"}},{"arxiv_id":"1910.13267","arxiv_id_is_arxiv":true,"paper":"/paper/191013267","title":"BPE-Dropout: Simple and Effective Subword Regularization","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PatxiofromAlphensign/subword-nmt-mods","path":"subword_nmt/segment_char_ngrams.py","file_url":"https://github.com/PatxiofromAlphensign/subword-nmt-mods/blob/HEAD/subword_nmt/segment_char_ngrams.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":"3a29f95d3b790d29","code_sha256_prefix":"3a29f95d3b790d29","mcp_get_code":{"code_sha256":"3a29f95d3b790d29"}},{"arxiv_id":"1910.13267","arxiv_id_is_arxiv":true,"paper":"/paper/191013267","title":"BPE-Dropout: Simple and Effective Subword Regularization","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mozilla/subword-nmt","path":"subword_nmt/apply_bpe.py","file_url":"https://github.com/mozilla/subword-nmt/blob/HEAD/subword_nmt/apply_bpe.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":"3a18c84fbdddf7b4","code_sha256_prefix":"3a18c84fbdddf7b4","mcp_get_code":{"code_sha256":"3a18c84fbdddf7b4"}},{"arxiv_id":"1905.12090","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-amortised-bayesian-inference-for","title":"Efficient Amortised Bayesian Inference for Hierarchical and Nonlinear Dynamical Systems","date":"2019-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Microsoft/vi-hds","path":"vihds/run_xval.py","file_url":"https://github.com/Microsoft/vi-hds/blob/HEAD/vihds/run_xval.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"79d2f48178bcc9e1","code_sha256_prefix":"79d2f48178bcc9e1","mcp_get_code":{"code_sha256":"79d2f48178bcc9e1"}},{"arxiv_id":"1905.08459","arxiv_id_is_arxiv":true,"paper":"/paper/parallel-neural-text-to-speech","title":"Non-Autoregressive Neural Text-to-Speech","date":"2019-05-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"vardaan123/ParaNet","path":"apply_bpe.py","file_url":"https://github.com/vardaan123/ParaNet/blob/HEAD/apply_bpe.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":"92b2d4c3fefb21b7","code_sha256_prefix":"92b2d4c3fefb21b7","mcp_get_code":{"code_sha256":"92b2d4c3fefb21b7"}},{"arxiv_id":"1807.05118","arxiv_id_is_arxiv":true,"paper":"/paper/tune-a-research-platform-for-distributed","title":"Tune: A Research Platform for Distributed Model Selection and Training","date":"2018-07-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AmeerHajAli/ray2","path":"rllib/rollout.py","file_url":"https://github.com/AmeerHajAli/ray2/blob/HEAD/rllib/rollout.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, AmeerHajAli/ray2, 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":"e3b0fec19aed3138","code_sha256_prefix":"e3b0fec19aed3138","mcp_get_code":{"code_sha256":"e3b0fec19aed3138"}},{"arxiv_id":"1805.01831","arxiv_id_is_arxiv":true,"paper":"/paper/a-64mw-dnn-based-visual-navigation-engine-for","title":"A 64mW DNN-based Visual Navigation Engine for Autonomous Nano-Drones","date":"2018-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pulp-platform/pulp-dronet","path":"pulp-dronet-v2/training.py","file_url":"https://github.com/pulp-platform/pulp-dronet/blob/HEAD/pulp-dronet-v2/training.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":"94e78b4bdd7b3efb","code_sha256_prefix":"94e78b4bdd7b3efb","mcp_get_code":{"code_sha256":"94e78b4bdd7b3efb"}},{"arxiv_id":"1805.01831","arxiv_id_is_arxiv":true,"paper":"/paper/a-64mw-dnn-based-visual-navigation-engine-for","title":"A 64mW DNN-based Visual Navigation Engine for Autonomous Nano-Drones","date":"2018-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"pulp-platform/pulp-dronet","path":"pulp-dronet-v2/evaluation.py","file_url":"https://github.com/pulp-platform/pulp-dronet/blob/HEAD/pulp-dronet-v2/evaluation.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":"315a9025b9376db7","code_sha256_prefix":"315a9025b9376db7","mcp_get_code":{"code_sha256":"315a9025b9376db7"}},{"arxiv_id":"1710.11041","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-neural-machine-translation","title":"Unsupervised Neural Machine Translation","date":"2017-10-30","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":"1dc5d59fd80a7419","code_sha256_prefix":"1dc5d59fd80a7419","mcp_get_code":{"code_sha256":"1dc5d59fd80a7419"}},{"arxiv_id":"1710.11041","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-neural-machine-translation","title":"Unsupervised Neural Machine Translation","date":"2017-10-30","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":"f9d4ba98fc7a6214","code_sha256_prefix":"f9d4ba98fc7a6214","mcp_get_code":{"code_sha256":"f9d4ba98fc7a6214"}}],"record_sha256":"7f75d329012c65f10fd8bdfef511badb1d427c006e2acb8c80e3b665fff8cb75","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}