{"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/get-vocabulary","entry":"get_vocabulary","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":10,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":4,"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":12,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":15,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":5,"ran_fixture":0,"ran":6,"unverified":1},"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":"2603.24150","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-24150","title":"A visual observation on the geometry of UMAP projections of the difference vectors of antonym and synonym word pair embeddings","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"ramiluisto/CuriousSwirl","path":"semsim/data.py","file_url":"https://github.com/ramiluisto/CuriousSwirl/blob/HEAD/semsim/data.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":"f60cc27077f1980b","code_sha256_prefix":"f60cc27077f1980b","mcp_get_code":{"code_sha256":"f60cc27077f1980b"}},{"arxiv_id":"2405.04346","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-character-level-adversarial","title":"Revisiting Character-level Adversarial Attacks for Language Models","date":"2024-05-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LIONS-EPFL/Charmer","path":"utils.py","file_url":"https://github.com/LIONS-EPFL/Charmer/blob/HEAD/utils.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":"593614c84d8b37c2","code_sha256_prefix":"593614c84d8b37c2","mcp_get_code":{"code_sha256":"593614c84d8b37c2"}},{"arxiv_id":"2402.10376","arxiv_id_is_arxiv":true,"paper":"/paper/interpreting-clip-with-sparse-linear-concept","title":"Interpreting CLIP with Sparse Linear Concept Embeddings (SpLiCE)","date":"2024-02-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AI4LIFE-GROUP/SpLiCE","path":"splice/splice.py","file_url":"https://github.com/AI4LIFE-GROUP/SpLiCE/blob/HEAD/splice/splice.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":"75d0d4017fcd11fd","code_sha256_prefix":"75d0d4017fcd11fd","mcp_get_code":{"code_sha256":"75d0d4017fcd11fd"}},{"arxiv_id":"2301.02195","arxiv_id_is_arxiv":true,"paper":"/paper/towards-autoformalization-of-mathematics-and","title":"Towards Autoformalization of Mathematics and Code Correctness: Experiments with Elementary Proofs","date":"2023-01-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gc974517/autoformalization","path":"src/load.py","file_url":"https://github.com/gc974517/autoformalization/blob/HEAD/src/load.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":"a4fbab6684b34cac","code_sha256_prefix":"a4fbab6684b34cac","mcp_get_code":{"code_sha256":"a4fbab6684b34cac"}},{"arxiv_id":"2206.12088","arxiv_id_is_arxiv":true,"paper":"/paper/classifying-unstructured-clinical-notes-via","title":"Classifying Unstructured Clinical Notes via Automatic Weak Supervision","date":"2022-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonlab/KeyClass","path":"keyclass/create_lfs.py","file_url":"https://github.com/autonlab/KeyClass/blob/HEAD/keyclass/create_lfs.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5e3d4b993b102216","code_sha256_prefix":"5e3d4b993b102216","mcp_get_code":{"code_sha256":"5e3d4b993b102216"}},{"arxiv_id":"2203.01976","arxiv_id_is_arxiv":true,"paper":"/paper/overlap-based-vocabulary-generation-improves","title":"Overlap-based Vocabulary Generation Improves Cross-lingual Transfer Among Related Languages","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vaidehi99/OBPE","path":"tokenizer.py","file_url":"https://github.com/Vaidehi99/OBPE/blob/HEAD/tokenizer.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":"8ebaf21ef830e017","code_sha256_prefix":"8ebaf21ef830e017","mcp_get_code":{"code_sha256":"8ebaf21ef830e017"}},{"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":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b83d785ca99bfc9f","code_sha256_prefix":"b83d785ca99bfc9f","mcp_get_code":{"code_sha256":"b83d785ca99bfc9f"}},{"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/learn_bpe.py","file_url":"https://github.com/mozilla/subword-nmt/blob/HEAD/subword_nmt/learn_bpe.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"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 thinkwee/DPP_CNN_Summarization, and GitHub detected no licence in that repository when it was checked","code_sha256":"bc7574327ea1f634","code_sha256_prefix":"bc7574327ea1f634","mcp_get_code":{"code_sha256":"bc7574327ea1f634"}},{"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":"7d923800aaefd70c","code_sha256_prefix":"7d923800aaefd70c","mcp_get_code":{"code_sha256":"7d923800aaefd70c"}},{"arxiv_id":"1910.02562","arxiv_id_is_arxiv":true,"paper":"/paper/master-multi-aspect-non-local-network-for","title":"MASTER: Multi-Aspect Non-local Network for Scene Text Recognition","date":"2019-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jiangxiluning/MASTER-TF","path":"src/dataset/utils.py","file_url":"https://github.com/jiangxiluning/MASTER-TF/blob/HEAD/src/dataset/utils.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":"a7852c913c2d2af2","code_sha256_prefix":"a7852c913c2d2af2","mcp_get_code":{"code_sha256":"a7852c913c2d2af2"}},{"arxiv_id":"1909.00502","arxiv_id_is_arxiv":true,"paper":"/paper/an-empirical-study-of-incorporating-pseudo","title":"An Empirical Study of Incorporating Pseudo Data into Grammatical Error Correction","date":"2019-09-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"butsugiri/gec-pseudodata","path":"generate_pseudo_samples.py","file_url":"https://github.com/butsugiri/gec-pseudodata/blob/HEAD/generate_pseudo_samples.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":"8644011efb17c983","code_sha256_prefix":"8644011efb17c983","mcp_get_code":{"code_sha256":"8644011efb17c983"}},{"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":null,"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":"b83d785ca99bfc9f","code_sha256_prefix":"b83d785ca99bfc9f","mcp_get_code":{"code_sha256":"b83d785ca99bfc9f"}},{"arxiv_id":"1508.07909","arxiv_id_is_arxiv":true,"paper":"/paper/neural-machine-translation-of-rare-words-with","title":"Neural Machine Translation of Rare Words with Subword Units","date":"2015-08-31","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":null,"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":"b83d785ca99bfc9f","code_sha256_prefix":"b83d785ca99bfc9f","mcp_get_code":{"code_sha256":"b83d785ca99bfc9f"}},{"arxiv_id":"1508.07909","arxiv_id_is_arxiv":true,"paper":"/paper/neural-machine-translation-of-rare-words-with","title":"Neural Machine Translation of Rare Words with Subword Units","date":"2015-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kh-mo/QA_wikisql","path":"learn_bpe.py","file_url":"https://github.com/kh-mo/QA_wikisql/blob/HEAD/learn_bpe.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, kh-mo/QA_wikisql when it was checked","code_sha256":"9425aef3e44f6979","code_sha256_prefix":"9425aef3e44f6979","mcp_get_code":{"code_sha256":"9425aef3e44f6979"}},{"arxiv_id":"1508.07909","arxiv_id_is_arxiv":true,"paper":"/paper/neural-machine-translation-of-rare-words-with","title":"Neural Machine Translation of Rare Words with Subword Units","date":"2015-08-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thinkwee/DPP_CNN_Summarization","path":"fairseq/raw_dataset/subword_nmt/learn_bpe.py","file_url":"https://github.com/thinkwee/DPP_CNN_Summarization/blob/HEAD/fairseq/raw_dataset/subword_nmt/learn_bpe.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, thinkwee/DPP_CNN_Summarization when it was checked","code_sha256":"bc7574327ea1f634","code_sha256_prefix":"bc7574327ea1f634","mcp_get_code":{"code_sha256":"bc7574327ea1f634"}}],"record_sha256":"77e35cdacc8d577f332e1ef5e1c75774088bf217ebd50ba1c096874daa8703b1","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}