{"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/levenshtein-distance","entry":"levenshtein_distance","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":18,"n_papers_ran":16,"n_papers_ran_no_instrument_failure":14,"n_papers_ran_instrument_only":2,"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":9,"n_samples_instrument":2,"n_samples_unverified":1,"n_samples_fingerprinted":8,"n_places":20,"n_places_pointer_only":7,"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":6,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":1,"ran":3,"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":"2602.16012","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-16012","title":"Towards Efficient Constraint Handling in Neural Solvers for Routing Problems","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"jieyibi/CaR-constraint","path":"analysis/similarity.py","file_url":"https://github.com/jieyibi/CaR-constraint/blob/HEAD/analysis/similarity.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d345ac1930735cb8","code_sha256_prefix":"d345ac1930735cb8","mcp_get_code":{"code_sha256":"d345ac1930735cb8"}},{"arxiv_id":"2601.03973","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-03973","title":"Muse: Towards Reproducible Long-Form Song Generation with Fine-Grained Style Control","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"yuhui1038/Muse","path":"eval_pipeline/phoneme_utils.py","file_url":"https://github.com/yuhui1038/Muse/blob/HEAD/eval_pipeline/phoneme_utils.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cb01272840d69137","code_sha256_prefix":"cb01272840d69137","mcp_get_code":{"code_sha256":"cb01272840d69137"}},{"arxiv_id":"2509.07666","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2509-07666","title":"MoLoRAG: Bootstrapping Document Understanding via Multi-modal Logic-aware Retrieval","date":null,"month_inferred_from_arxiv_id":"2025-09","title_source":"syntology","repo":"WxxShirley/MoLoRAG","path":"evaluate/eval_qa.py","file_url":"https://github.com/WxxShirley/MoLoRAG/blob/HEAD/evaluate/eval_qa.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, WxxShirley/MoLoRAG when it was checked","code_sha256":"5fbdf0aff19a1398","code_sha256_prefix":"5fbdf0aff19a1398","mcp_get_code":{"code_sha256":"5fbdf0aff19a1398"}},{"arxiv_id":"2411.16775","arxiv_id_is_arxiv":true,"paper":"/paper/parameter-efficient-instruction-tuning-an","title":"Parameter Efficient Instruction Tuning: An Empirical Study","date":"2024-11-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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":"01f1ac304787218d","code_sha256_prefix":"01f1ac304787218d","mcp_get_code":{"code_sha256":"01f1ac304787218d"}},{"arxiv_id":"2411.04358","arxiv_id_is_arxiv":true,"paper":"/paper/robust-and-efficient-fine-tuning-of-llms-with","title":"Robust and Efficient Fine-tuning of LLMs with Bayesian Reparameterization of Low-Rank Adaptation","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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":"d267d33e45b87bcd","code_sha256_prefix":"d267d33e45b87bcd","mcp_get_code":{"code_sha256":"d267d33e45b87bcd"}},{"arxiv_id":"2409.07556","arxiv_id_is_arxiv":true,"paper":"/paper/ssr-speech-towards-stable-safe-and-robust","title":"SSR-Speech: Towards Stable, Safe and Robust Zero-shot Text-based Speech Editing and Synthesis","date":"2024-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WangHelin1997/SSR-Speech","path":"edit_utils_en.py","file_url":"https://github.com/WangHelin1997/SSR-Speech/blob/HEAD/edit_utils_en.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"922c92e8fa2727c6","code_sha256_prefix":"922c92e8fa2727c6","mcp_get_code":{"code_sha256":"922c92e8fa2727c6"}},{"arxiv_id":"2408.15300","arxiv_id_is_arxiv":true,"paper":"/paper/gift-sw-gaussian-noise-injected-fine-tuning","title":"GIFT-SW: Gaussian noise Injected Fine-Tuning of Salient Weights for LLMs","date":"2024-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"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":"d267d33e45b87bcd","code_sha256_prefix":"d267d33e45b87bcd","mcp_get_code":{"code_sha256":"d267d33e45b87bcd"}},{"arxiv_id":"2407.01523","arxiv_id_is_arxiv":true,"paper":"/paper/mmlongbench-doc-benchmarking-long-context","title":"MMLongBench-Doc: Benchmarking Long-context Document Understanding with Visualizations","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mayubo2333/mmlongbench-doc","path":"eval/eval_score.py","file_url":"https://github.com/mayubo2333/mmlongbench-doc/blob/HEAD/eval/eval_score.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from Brandon3964/MultiModal-Task-Vector, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"90a8e73fa6de72a4","code_sha256_prefix":"90a8e73fa6de72a4","mcp_get_code":{"code_sha256":"90a8e73fa6de72a4"}},{"arxiv_id":"2406.15334","arxiv_id_is_arxiv":true,"paper":"/paper/multimodal-task-vectors-enable-many-shot","title":"Multimodal Task Vectors Enable Many-Shot Multimodal In-Context Learning","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Brandon3964/MultiModal-Task-Vector","path":"eval_mm/infographicsvqa_eval.py","file_url":"https://github.com/Brandon3964/MultiModal-Task-Vector/blob/HEAD/eval_mm/infographicsvqa_eval.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, Brandon3964/MultiModal-Task-Vector (NOASSERTION)","code_sha256":"90a8e73fa6de72a4","code_sha256_prefix":"90a8e73fa6de72a4","mcp_get_code":{"code_sha256":"90a8e73fa6de72a4"}},{"arxiv_id":"2402.15938","arxiv_id_is_arxiv":true,"paper":"/paper/generalization-or-memorization-data","title":"Generalization or Memorization: Data Contamination and Trustworthy Evaluation for Large Language Models","date":"2024-02-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yihongdong/cdd-ted4llms","path":"CDD.py","file_url":"https://github.com/yihongdong/cdd-ted4llms/blob/HEAD/CDD.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ed2809abeb95c6db","code_sha256_prefix":"ed2809abeb95c6db","mcp_get_code":{"code_sha256":"ed2809abeb95c6db"}},{"arxiv_id":"2401.16405","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-sparse-fine-tuning-to-large-language","title":"Scaling Sparse Fine-Tuning to Large Language Models","date":"2024-01-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alanansell/peft","path":"examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py","file_url":"https://github.com/alanansell/peft/blob/HEAD/examples/causal_language_modeling/peft_lora_clm_accelerate_ds_zero3_offload.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"01f1ac304787218d","code_sha256_prefix":"01f1ac304787218d","mcp_get_code":{"code_sha256":"01f1ac304787218d"}},{"arxiv_id":"2401.04259","arxiv_id_is_arxiv":true,"paper":"/paper/marg-multi-agent-review-generation-for","title":"MARG: Multi-Agent Review Generation for Scientific Papers","date":"2024-01-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/marg-reviewer","path":"review_worker/aries/util/edit.py","file_url":"https://github.com/allenai/marg-reviewer/blob/HEAD/review_worker/aries/util/edit.py","status":"unverified","verification_level":0,"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":"519a75e4f9f6bd58","code_sha256_prefix":"519a75e4f9f6bd58","mcp_get_code":{"code_sha256":"519a75e4f9f6bd58"}},{"arxiv_id":"2312.08578","arxiv_id_is_arxiv":true,"paper":"/paper/a-picture-is-worth-more-than-77-text-tokens","title":"A Picture is Worth More Than 77 Text Tokens: Evaluating CLIP-Style Models on Dense Captions","date":"2023-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/dci","path":"dataset/densely_captioned_images/dataset/spacy_negs.py","file_url":"https://github.com/facebookresearch/dci/blob/HEAD/dataset/densely_captioned_images/dataset/spacy_negs.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, facebookresearch/dci when it was checked","code_sha256":"90a8e73fa6de72a4","code_sha256_prefix":"90a8e73fa6de72a4","mcp_get_code":{"code_sha256":"90a8e73fa6de72a4"}},{"arxiv_id":"2311.09060","arxiv_id_is_arxiv":true,"paper":"/paper/do-localization-methods-actually-localize","title":"Do Localization Methods Actually Localize Memorized Data in LLMs? A Tale of Two Benchmarks","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"terarachang/memdata","path":"downstream.py","file_url":"https://github.com/terarachang/memdata/blob/HEAD/downstream.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":"7145470f99f9e88b","code_sha256_prefix":"7145470f99f9e88b","mcp_get_code":{"code_sha256":"7145470f99f9e88b"}},{"arxiv_id":"2311.09060","arxiv_id_is_arxiv":true,"paper":"/paper/do-localization-methods-actually-localize","title":"Do Localization Methods Actually Localize Memorized Data in LLMs? A Tale of Two Benchmarks","date":"2023-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"terarachang/memdata","path":"downstream_manual.py","file_url":"https://github.com/terarachang/memdata/blob/HEAD/downstream_manual.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":"cb5a6337f362e74e","code_sha256_prefix":"cb5a6337f362e74e","mcp_get_code":{"code_sha256":"cb5a6337f362e74e"}},{"arxiv_id":"2306.12587","arxiv_id_is_arxiv":true,"paper":"/paper/aries-a-corpus-of-scientific-paper-edits-made","title":"ARIES: A Corpus of Scientific Paper Edits Made in Response to Peer Reviews","date":"2023-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"allenai/aries","path":"aries/util/edit.py","file_url":"https://github.com/allenai/aries/blob/HEAD/aries/util/edit.py","status":"unverified","verification_level":0,"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":"519a75e4f9f6bd58","code_sha256_prefix":"519a75e4f9f6bd58","mcp_get_code":{"code_sha256":"519a75e4f9f6bd58"}},{"arxiv_id":"2303.18223","arxiv_id_is_arxiv":true,"paper":"/paper/a-survey-of-large-language-models","title":"A Survey of Large Language Models","date":"2023-03-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huggingface/peft","path":"examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py","file_url":"https://github.com/huggingface/peft/blob/HEAD/examples/conditional_generation/peft_lora_seq2seq_accelerate_ds_zero3_offload.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"d267d33e45b87bcd","code_sha256_prefix":"d267d33e45b87bcd","mcp_get_code":{"code_sha256":"d267d33e45b87bcd"}},{"arxiv_id":"1904.08779","arxiv_id_is_arxiv":true,"paper":"/paper/specaugment-a-simple-data-augmentation-method","title":"SpecAugment: A Simple Data Augmentation Method for Automatic Speech Recognition","date":"2019-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cosmoquester/speech-recognition","path":"speech_recognition/utils.py","file_url":"https://github.com/cosmoquester/speech-recognition/blob/HEAD/speech_recognition/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":"2046b512475f2561","code_sha256_prefix":"2046b512475f2561","mcp_get_code":{"code_sha256":"2046b512475f2561"}},{"arxiv_id":"2024.naacl-long.176","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.naacl-long.176","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"terarachang/MemPi","path":"downstream.py","file_url":"https://github.com/terarachang/MemPi/blob/HEAD/downstream.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":"7145470f99f9e88b","code_sha256_prefix":"7145470f99f9e88b","mcp_get_code":{"code_sha256":"7145470f99f9e88b"}},{"arxiv_id":"2024.naacl-long.176","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2024.naacl-long.176","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"terarachang/MemPi","path":"downstream_manual.py","file_url":"https://github.com/terarachang/MemPi/blob/HEAD/downstream_manual.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":"cb5a6337f362e74e","code_sha256_prefix":"cb5a6337f362e74e","mcp_get_code":{"code_sha256":"cb5a6337f362e74e"}}],"record_sha256":"5a8fa2aa4c1367764e4e6b333cfa125c058785964ddc441ec579e72a4bee4208","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}