{"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/get-index-path","entry":"get_index_path","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":6,"n_papers_ran":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":4,"n_samples_ran":1,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":6,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":0,"unverified":3},"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":"2601.08160","paper":"/paper/arxiv-2601-08160","title":"SwiftMem: Fast Agentic Memory via Query-aware Indexing","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"EdwardTex/SwiftMem","path":"evaluation/add.py","file_url":"https://github.com/EdwardTex/SwiftMem/blob/HEAD/evaluation/add.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"4b64f86ade9ad68a","mcp_get_code":{"code_sha256":"4b64f86ade9ad68a"}},{"arxiv_id":"2601.08160","paper":"/paper/arxiv-2601-08160","title":"SwiftMem: Fast Agentic Memory via Query-aware Indexing","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"EdwardTex/SwiftMem","path":"evaluation/search.py","file_url":"https://github.com/EdwardTex/SwiftMem/blob/HEAD/evaluation/search.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"2e1d98c49715ff8b","mcp_get_code":{"code_sha256":"2e1d98c49715ff8b"}},{"arxiv_id":"2601.03908","paper":"/paper/arxiv-2601-03908","title":"Decide Then Retrieve: A Training-Free Framework with Uncertainty-Guided Triggering and Dual-Path Retrieval","date":"2026-01-07","month_inferred_from_arxiv_id":null,"title_source":"syntology","repo":"ChenWangHKU/DTR","path":"dataset/load_data.py","file_url":"https://github.com/ChenWangHKU/DTR/blob/HEAD/dataset/load_data.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"33eb0683baa7dede","mcp_get_code":{"code_sha256":"33eb0683baa7dede"}},{"arxiv_id":"2408.11815","paper":"/paper/great-memory-shallow-reasoning-limits-of-k-nn","title":"Great Memory, Shallow Reasoning: Limits of $k$NN-LMs","date":"2024-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gsyfate/knnlm-limits","path":"knnlm.py","file_url":"https://github.com/gsyfate/knnlm-limits/blob/HEAD/knnlm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"918cf1d7f24a77f5","mcp_get_code":{"code_sha256":"918cf1d7f24a77f5"}},{"arxiv_id":"2402.17840","paper":"/paper/follow-my-instruction-and-spill-the-beans","title":"Follow My Instruction and Spill the Beans: Scalable Data Extraction from Retrieval-Augmented Generation Systems","date":"2024-02-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhentingqi/rag-privacy","path":"modules/knnlm_backbone.py","file_url":"https://github.com/zhentingqi/rag-privacy/blob/HEAD/modules/knnlm_backbone.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"918cf1d7f24a77f5","mcp_get_code":{"code_sha256":"918cf1d7f24a77f5"}},{"arxiv_id":"2010.00710","paper":"/paper/nearest-neighbor-machine-translation","title":"Nearest Neighbor Machine Translation","date":"2020-10-01","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":true,"licence":null,"inline_ok":false,"code_sha256_prefix":"918cf1d7f24a77f5","mcp_get_code":{"code_sha256":"918cf1d7f24a77f5"}},{"arxiv_id":"1911.00172","paper":"/paper/generalization-through-memorization-nearest","title":"Generalization through Memorization: Nearest Neighbor Language Models","date":"2019-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neulab/knn-transformers","path":"knnlm.py","file_url":"https://github.com/neulab/knn-transformers/blob/HEAD/knnlm.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"918cf1d7f24a77f5","mcp_get_code":{"code_sha256":"918cf1d7f24a77f5"}}]}