{"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":"/paper/nearest-neighbor-machine-translation","title":"Nearest Neighbor Machine Translation","arxiv_id":"2010.00710","date":"2020-10-01","proceeding":"ICLR 2021 1","authors":["Urvashi Khandelwal","Angela Fan","Dan Jurafsky","Luke Zettlemoyer","Mike Lewis"],"abstract":"We introduce $k$-nearest-neighbor machine translation ($k$NN-MT), which predicts tokens with a nearest neighbor classifier over a large datastore of cached examples, using representations from a neural translation model for similarity search. This approach requires no additional training and scales to give the decoder direct access to billions of examples at test time, resulting in a highly expressive model that consistently improves performance across many settings. Simply adding nearest neighbor search improves a state-of-the-art German-English translation model by 1.5 BLEU. $k$NN-MT allows a single model to be adapted to diverse domains by using a domain-specific datastore, improving results by an average of 9.2 BLEU over zero-shot transfer, and achieving new state-of-the-art results -- without training on these domains. A massively multilingual model can also be specialized for particular language pairs, with improvements of 3 BLEU for translating from English into German and Chinese. Qualitatively, $k$NN-MT is easily interpretable; it combines source and target context to retrieve highly relevant examples.","url_abs":"https://arxiv.org/abs/2010.00710v2","url_pdf":"https://arxiv.org/pdf/2010.00710v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"nearest-neighbor-machine-translation","repo_url":"https://github.com/urvashik/knnlm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null},{"paper_slug":"nearest-neighbor-machine-translation","repo_url":"https://github.com/hubreb/imitkd_ast","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"nearest-neighbor-machine-translation","repo_url":"https://github.com/neulab/knn-transformers","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"nearest-neighbor-machine-translation","repo_url":"https://github.com/urvashik/knnmt","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"nearest-neighbor-machine-translation","repo_url":"https://github.com/cordercorder/knn-models","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"decoder","task_name":"Decoder"},{"task_slug":"machine-translation","task_name":"Machine Translation"},{"task_slug":"translation","task_name":"Translation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2010.00710","atlas_url":"https://app.syntology.ai/?focus=2010.00710","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.00710"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.00710"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2010.00710"},"call":"get_harvested_code_for_paper(arxiv_id=\"2010.00710\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2010.00710"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2010.00710\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2010.00710"},"call":"get_concepts_for_paper(arxiv_id=\"2010.00710\")"}],"by_repo":[{"repo":"urvashik/knnlm","kind":"official","samples":1,"ran":0,"instrument":0,"unverified":1},{"repo":"hubreb/imitkd_ast","kind":"listed","samples":1,"ran":0,"instrument":0,"unverified":1},{"repo":"neulab/knn-transformers","kind":"listed","samples":6,"ran":3,"instrument":2,"unverified":3,"placed_by_identical_code":2},{"repo":"urvashik/knnmt","kind":"listed","samples":2,"ran":1,"instrument":1,"unverified":1},{"repo":"cordercorder/knn-models","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2204.06175"],"harvested_for_calls":[{"arxiv_id":"2204.06175","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2204.06175"},"call":"get_harvested_code_for_paper(arxiv_id=\"2204.06175\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","assemblies":[{"assembly_sha256":"566406eb3b4d6cf4","source_kind":"harvested","method_name":"kNN-MT","realizes_method":"kNN-MT","graph_method":"kNN-MT","realizes_severed":false,"claim":"The code implements a datastore for k-nearest-neighbor machine translation, using cached examples and similarity search based on neural translation model representations.","centrality":"contribution","entry":"KNN_Dstore","entry_sha256":"22d23f04ff2d14de","n_bricks":1,"bricks":[{"entry":"KNN_Dstore","code_sha256":"22d23f04ff2d14de","role":"entry","order":0,"level":0,"status":"unverified"}],"ran_individually":0,"ran_individually_constructed":0,"ran_individually_by_status":{},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"26c2b69b1c23","n_siblings":3,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"58de98cebf7c1356","source_kind":"harvested","method_name":"kNN-MT","realizes_method":"kNN-MT","graph_method":"kNN-MT","realizes_severed":false,"claim":"The code implements a k-nearest-neighbor machine translation (kNN-MT) method that predicts tokens using a nearest neighbor classifier over a cached datastore of examples, leveraging neural model representations for similarity search.","centrality":"contribution","entry":"KNNWrapper","entry_sha256":"0e7bf9fbf9dd8617","n_bricks":6,"bricks":[{"entry":"KNNWrapper","code_sha256":"0e7bf9fbf9dd8617","role":"entry","order":0,"level":0,"status":"unverified"},{"entry":"ActivationCapturer","code_sha256":"41c932a1879b6eca","role":"helper","order":1,"level":1,"status":"ran"},{"entry":"DIST","code_sha256":"4f270d89f02eecd7","role":"helper","order":2,"level":0,"status":"unverified"},{"entry":"KEY_TYPE","code_sha256":"bf7d9cb24001654f","role":"helper","order":3,"level":0,"status":"unverified"},{"entry":"get_dstore_path","code_sha256":"05520f6527f04bde","role":"helper","order":4,"level":1,"status":"ran_draft_wrong"},{"entry":"get_index_path","code_sha256":"918cf1d7f24a77f5","role":"helper","order":5,"level":1,"status":"ran_draft_wrong"}],"ran_individually":3,"ran_individually_constructed":1,"ran_individually_by_status":{"ran":1,"ran_draft_wrong":2},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"26c2b69b1c23","n_siblings":3,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"a3eb8c8b00bee4d3","source_kind":"harvested","method_name":"kNN-MT","realizes_method":"kNN-MT","graph_method":"kNN-MT","realizes_severed":false,"claim":"The code implements a k-nearest-neighbor datastore for machine translation, using cached examples and neural model representations for similarity search to predict tokens without additional training.","centrality":"contribution","entry":"KNN_Dstore","entry_sha256":"d1ecba343e9e4ddb","n_bricks":1,"bricks":[{"entry":"KNN_Dstore","code_sha256":"d1ecba343e9e4ddb","role":"entry","order":0,"level":0,"status":"unverified"}],"ran_individually":0,"ran_individually_constructed":0,"ran_individually_by_status":{},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"26c2b69b1c23","n_siblings":3,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"},{"assembly_sha256":"e4654e51927cf848","source_kind":"harvested","method_name":"kNN-MT","realizes_method":"kNN-MT","graph_method":"kNN-MT","realizes_severed":false,"claim":"The code implements a datastore for k-nearest-neighbor machine translation (kNN-MT) that caches examples and uses neural translation model representations for similarity search.","centrality":"contribution","entry":"KNN_Dstore","entry_sha256":"dc707b421046950e","n_bricks":1,"bricks":[{"entry":"KNN_Dstore","code_sha256":"dc707b421046950e","role":"entry","order":0,"level":0,"status":"unverified"}],"ran_individually":0,"ran_individually_constructed":0,"ran_individually_by_status":{},"end_to_end":{"ran":false,"level":0},"level_lowered":null,"claim_match":"IMPLEMENTS","claim_match_rule":"single_judge","claim_match_basis":"judge:global.anthropic.claude-sonnet-4-5-20250929-v1:0","claim_match_judges":["global.anthropic.claude-sonnet-4-5-20250929-v1:0"],"label_verdict":"matches","label_verdict_judged":true,"suggested_method":null,"batch_at":"2026-09-09T22:44:46+00:00","sibling_group":"26c2b69b1c23","n_siblings":3,"retention":"keep","provenance":"assembly:harvest_method_v6","attached_at":"2026-09-09T22:44:46+00:00","attached_provenance":"assembly:harvest_method_v6"}],"assembly_sibling_groups":[{"group":"26c2b69b1c23","realizes_method":"kNN-MT","source_kind":"harvested","batch_at":"2026-09-09T22:44:46+00:00","members":["566406eb3b4d6cf4","58de98cebf7c1356","a3eb8c8b00bee4d3","e4654e51927cf848"]}],"assemblies_is":{"about":"What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results.","harvested":"assembled from code harvested from a repository linked to the paper","generated":"generated from the paper text, not the repository's code","end_to_end":"for a harvested assembly, the assembly has not been run end-to-end; for a generated one, end_to_end.level is the assembly's own level and against_independent_peer says whether it ran against a peer: an independent peer is a second implementation generated separately from the same paper text; neither implementation read the authors' code. At level 2 the two agreed numerically on the fixture's inputs; level 3 is recorded when property tests derived from the paper also passed on both, and each level 3 card prints how many its report lists","bricks_level":"each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level","ran_individually":"a COUNT of bricks that ran on their own on a fixture (split by status in ran_individually_by_status), not a level; instrument statuses are failures of Syntology's instrument, not of the code","siblings":"assemblies lifted from this paper in the same batch for the same method: alternative readings kept side by side; none replaces or supersedes another","judged":"Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it. A generated assembly's label was set when its code was generated for the method, and no model judged it; its card prints it as \"by construction\" or \"not judged by a model\"","level_lowered":"a generated assembly whose level Syntology's graph lowered, with the level it had, the recorded reason and when","retention":"Syntology's spending triage for further verification, not a verdict","claim_match":"the claim_match vote: IMPLEMENTS, COMPONENT or UNCLEAR. Where claim_match_basis is \"judge:<model>\", it is one model's judgement of the assembly's label against the paper's claim (claim_match_rule single_judge, the model in claim_match_judges): not a verification and not a run. Where it is \"construction\", the value was set when the code was generated for this method and no model judged it, whatever claim_match_rule says. The page prints no claim match for any assembly","label_verdict":"whether the assembly's code is the method it is labelled with: matches, cannot_tell, mislabelled (suggested_method names what it looks like instead) or not_the_method; label_verdict_judged is true only when a model read the code (claim_match_basis \"judge:<model>\")","label_verdict_judged":"where true (claim_match_basis \"judge:<model>\"), label_verdict is a single model's judgement; not calibrated; not printed on the page; where false, it was set by construction, and the page prints it unless the node is shared with another paper (node_properties_written_for)","claim":"the claim text stored on the assembly node: for a harvested assembly, what the paper claims the code implements, as the lifting model wrote it; for a generated one, the specification the code was generated from. Not verified text","centrality":"how central the lifted method is to the paper, as the lifting step recorded it: contribution, component or incidental","v3_tests_passed_both_sides":"end_to_end.v3_tests_passed_both_sides: the number of property tests derived from the paper that passed on both implementations, as the attached report lists them; a level 3 card with 0 says its report lists none","ran_individually_constructed":"ran_individually_constructed: of the bricks counted in ran_individually, how many constructed an object rather than computing a result (Syntology's RAN record's rule, read from the graph-layer sample with the brick's code_sha256); a part of ran_individually, never subtracted from it and never a failure; null where a brick that ran has no sample in the graph layer this build read, so the figure was not counted"},"assemblies_call":{"tool":"assembly","arguments":{"arxiv_id":"2010.00710"},"call":"assembly(arxiv_id=\"2010.00710\")"},"read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2010.00710.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2010.00710.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/hubreb/imitkd_ast","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/urvashik/knnmt","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/neulab/knn-transformers","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/cordercorder/knn-models","reach":{"status":"ok","spdx":"Apache-2.0"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/urvashik/knnlm","reach":null}],"summary":{"ran":1,"ran_draft_wrong":3,"unverified":6},"n_samples":10,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":6,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"key_notes":{"n_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_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)"},"by_repo_kind":{"official":{"samples":1,"ran":0,"n_ran_checked":0,"n_instrument":0,"repositories":1},"listed":{"samples":9,"ran":4,"n_ran_checked":1,"n_instrument":3,"repositories":3}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":4,"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_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":3,"n_ran_without_level_date":1,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"41c932a1879b6eca","code_sha256_prefix":"41c932a1879b6eca","entry":"ActivationCapturer","repo":"neulab/knn-transformers","repo_kind":"listed","path":"knnlm.py","file_url":"https://github.com/neulab/knn-transformers/blob/HEAD/knnlm.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":"deterministic","behaviour_fingerprint":false,"fixture_out_type":"ActivationCapturer","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"41c932a1879b6eca"}},{"code_sha256":"05520f6527f04bde","code_sha256_prefix":"05520f6527f04bde","entry":"get_dstore_path","repo":null,"repo_kind":"listed","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"dstore_dir:str/0/str, model_type:str/0/str, dstore_size:int/0/int, dimension:int/0/int","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":null,"census":null,"placed_by_identical_code":{"repo":"neulab/knn-transformers","path":"knnlm.py","file_url":"https://github.com/neulab/knn-transformers/blob/HEAD/knnlm.py","papers":["1911.00172"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"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","mcp_get_code":{"code_sha256":"05520f6527f04bde"}},{"code_sha256":"918cf1d7f24a77f5","code_sha256_prefix":"918cf1d7f24a77f5","entry":"get_index_path","repo":null,"repo_kind":"listed","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"dstore_dir:str/0/str, model_type:str/0/str, dstore_size:int/0/int, dimension:int/0/int","fixture_out_type":"str","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/get-index-path","census":null,"placed_by_identical_code":{"repo":"neulab/knn-transformers","path":"knnlm.py","file_url":"https://github.com/neulab/knn-transformers/blob/HEAD/knnlm.py","papers":["1911.00172"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"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","mcp_get_code":{"code_sha256":"918cf1d7f24a77f5"}},{"code_sha256":"88ce019380f10478","code_sha256_prefix":"88ce019380f10478","entry":"get_symbols_to_strip_from_output","repo":"urvashik/knnmt","repo_kind":"listed","path":"fairseq_cli/generate.py","file_url":"https://github.com/urvashik/knnmt/blob/HEAD/fairseq_cli/generate.py","link_basis":"first_harvest_node","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"generator:GeneratorWithSymbols/0/?","fixture_out_type":"set","code_page":"/code/get-symbols-to-strip-from-output","census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, urvashik/knnmt when it was checked","mcp_get_code":{"code_sha256":"88ce019380f10478"}},{"code_sha256":"4f270d89f02eecd7","code_sha256_prefix":"4f270d89f02eecd7","entry":"DIST","repo":"neulab/knn-transformers","repo_kind":"listed","path":"knnlm.py","file_url":"https://github.com/neulab/knn-transformers/blob/HEAD/knnlm.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"4f270d89f02eecd7"}},{"code_sha256":"bf7d9cb24001654f","code_sha256_prefix":"bf7d9cb24001654f","entry":"KEY_TYPE","repo":"neulab/knn-transformers","repo_kind":"listed","path":"knnlm.py","file_url":"https://github.com/neulab/knn-transformers/blob/HEAD/knnlm.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"bf7d9cb24001654f"}},{"code_sha256":"0e7bf9fbf9dd8617","code_sha256_prefix":"0e7bf9fbf9dd8617","entry":"KNNWrapper","repo":"neulab/knn-transformers","repo_kind":"listed","path":"knnlm.py","file_url":"https://github.com/neulab/knn-transformers/blob/HEAD/knnlm.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0e7bf9fbf9dd8617"}},{"code_sha256":"22d23f04ff2d14de","code_sha256_prefix":"22d23f04ff2d14de","entry":"KNN_Dstore","repo":"urvashik/knnlm","repo_kind":"official","path":"fairseq/knnlm.py","file_url":"https://github.com/urvashik/knnlm/blob/HEAD/fairseq/knnlm.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"22d23f04ff2d14de"}},{"code_sha256":"d1ecba343e9e4ddb","code_sha256_prefix":"d1ecba343e9e4ddb","entry":"KNN_Dstore","repo":"urvashik/knnmt","repo_kind":"listed","path":"fairseq/knnlm.py","file_url":"https://github.com/urvashik/knnmt/blob/HEAD/fairseq/knnlm.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, urvashik/knnmt when it was checked","mcp_get_code":{"code_sha256":"d1ecba343e9e4ddb"}},{"code_sha256":"dc707b421046950e","code_sha256_prefix":"dc707b421046950e","entry":"KNN_Dstore","repo":"hubreb/imitkd_ast","repo_kind":"listed","path":"fairseq/fairseq/knnlm.py","file_url":"https://github.com/hubreb/imitkd_ast/blob/HEAD/fairseq/fairseq/knnlm.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"dc707b421046950e"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"791cff9048d2c861b499faa6b1d4f87c4865ac8124e4f9f6fa469577f544cd7c","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}