{"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/edit-distance","entry":"edit_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":13,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":1,"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":10,"n_samples_constructed":0,"n_samples_ran_checked":9,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":8,"n_places":13,"n_places_pointer_only":4,"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":5,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":4,"unverified":2},"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":"2609.02255","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-02255","title":"T2LSC-Bench: Benchmarking Localized Semantic Control in Text-to-Image Generation","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"LLMSecResearch/T2LSC-Bench","path":"evaluation/text_metrics.py","file_url":"https://github.com/LLMSecResearch/T2LSC-Bench/blob/HEAD/evaluation/text_metrics.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, LLMSecResearch/T2LSC-Bench when it was checked","code_sha256":"873b94c7cb788eca","code_sha256_prefix":"873b94c7cb788eca","mcp_get_code":{"code_sha256":"873b94c7cb788eca"}},{"arxiv_id":"2607.03870","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2607-03870","title":"Evaluating LLM Uncertainty in Long-Form Generation Using Deterministic Ground Truth","date":null,"month_inferred_from_arxiv_id":"2026-07","title_source":"syntology","repo":"IdoAmit198/SALT","path":"salt_benchmark/tasks/code.py","file_url":"https://github.com/IdoAmit198/SALT/blob/HEAD/salt_benchmark/tasks/code.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1487b0303c654eb4","code_sha256_prefix":"1487b0303c654eb4","mcp_get_code":{"code_sha256":"1487b0303c654eb4"}},{"arxiv_id":"2604.07937","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-07937","title":"HCRE: LLM-based Hierarchical Classification for Cross-Document Relation Extraction with a Prediction-then-Verification Strategy","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"XMUDeepLIT/HCRE","path":"inference/utils.py","file_url":"https://github.com/XMUDeepLIT/HCRE/blob/HEAD/inference/utils.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, XMUDeepLIT/HCRE when it was checked","code_sha256":"79c199943c57a674","code_sha256_prefix":"79c199943c57a674","mcp_get_code":{"code_sha256":"79c199943c57a674"}},{"arxiv_id":"2411.19842","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-transformers-for-low-bitrate-high","title":"Scaling Transformers for Low-Bitrate High-Quality Speech Coding","date":"2024-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Stability-AI/stable-codec","path":"stable_codec/ctc_loss.py","file_url":"https://github.com/Stability-AI/stable-codec/blob/HEAD/stable_codec/ctc_loss.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":"f93cc1014a6ed58c","code_sha256_prefix":"f93cc1014a6ed58c","mcp_get_code":{"code_sha256":"f93cc1014a6ed58c"}},{"arxiv_id":"2407.01687","arxiv_id_is_arxiv":true,"paper":"/paper/deciphering-the-factors-influencing-the","title":"Deciphering the Factors Influencing the Efficacy of Chain-of-Thought: Probability, Memorization, and Noisy Reasoning","date":"2024-07-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aksh555/deciphering_cot","path":"run_openai.py","file_url":"https://github.com/aksh555/deciphering_cot/blob/HEAD/run_openai.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, aksh555/deciphering_cot when it was checked","code_sha256":"ddff9a4bee510eec","code_sha256_prefix":"ddff9a4bee510eec","mcp_get_code":{"code_sha256":"ddff9a4bee510eec"}},{"arxiv_id":"2406.12814","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-attacks-on-multimodal-agents","title":"Dissecting Adversarial Robustness of Multimodal LM Agents","date":"2024-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ChenWu98/agent-attack","path":"agent_attack/attacks/utils.py","file_url":"https://github.com/ChenWu98/agent-attack/blob/HEAD/agent_attack/attacks/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":"018efd26b7538a9c","code_sha256_prefix":"018efd26b7538a9c","mcp_get_code":{"code_sha256":"018efd26b7538a9c"}},{"arxiv_id":"2403.14840","arxiv_id_is_arxiv":true,"paper":"/paper/tams-translation-assisted-morphological","title":"TAMS: Translation-Assisted Morphological Segmentation","date":"2024-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CUNY-CL/yoyodyne","path":"yoyodyne/models/expert.py","file_url":"https://github.com/CUNY-CL/yoyodyne/blob/HEAD/yoyodyne/models/expert.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":"553079964658ff38","code_sha256_prefix":"553079964658ff38","mcp_get_code":{"code_sha256":"553079964658ff38"}},{"arxiv_id":"2204.06175","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-cluster-based-k-nearest-neighbor","title":"Efficient Cluster-Based k-Nearest-Neighbor Machine Translation","date":"2022-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cordercorder/knn-models","path":"knn_models/es_knn_utils.py","file_url":"https://github.com/cordercorder/knn-models/blob/HEAD/knn_models/es_knn_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c9f0e2e7c0c48ee3","code_sha256_prefix":"c9f0e2e7c0c48ee3","mcp_get_code":{"code_sha256":"c9f0e2e7c0c48ee3"}},{"arxiv_id":"2104.08211","arxiv_id_is_arxiv":true,"paper":"/paper/robust-open-vocabulary-translation-from","title":"Robust Open-Vocabulary Translation from Visual Text Representations","date":"2021-04-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"esalesky/visrep","path":"text_utils.py","file_url":"https://github.com/esalesky/visrep/blob/HEAD/text_utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, esalesky/visrep, 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":"b17acca882c5fdae","code_sha256_prefix":"b17acca882c5fdae","mcp_get_code":{"code_sha256":"b17acca882c5fdae"}},{"arxiv_id":"1911.12986","arxiv_id_is_arxiv":true,"paper":"/paper/merging-weak-and-active-supervision-for","title":"Merging Weak and Active Supervision for Semantic Parsing","date":"2019-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"niansong1996/wassp","path":"nsm/nlp_utils.py","file_url":"https://github.com/niansong1996/wassp/blob/HEAD/nsm/nlp_utils.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":"54fb9ba175e6c08b","code_sha256_prefix":"54fb9ba175e6c08b","mcp_get_code":{"code_sha256":"54fb9ba175e6c08b"}},{"arxiv_id":"1807.02322","arxiv_id_is_arxiv":true,"paper":"/paper/memory-augmented-policy-optimization-for","title":"Memory Augmented Policy Optimization for Program Synthesis and Semantic Parsing","date":"2018-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"crazydonkey200/neural-symbolic-machines","path":"nsm/nlp_utils.py","file_url":"https://github.com/crazydonkey200/neural-symbolic-machines/blob/HEAD/nsm/nlp_utils.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":"54fb9ba175e6c08b","code_sha256_prefix":"54fb9ba175e6c08b","mcp_get_code":{"code_sha256":"54fb9ba175e6c08b"}},{"arxiv_id":"1508.01211","arxiv_id_is_arxiv":true,"paper":"/paper/listen-attend-and-spell","title":"Listen, Attend and Spell","date":"2015-08-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WindQAQ/listen-attend-and-spell","path":"utils/metrics_utils.py","file_url":"https://github.com/WindQAQ/listen-attend-and-spell/blob/HEAD/utils/metrics_utils.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":"49847ff466218c84","code_sha256_prefix":"49847ff466218c84","mcp_get_code":{"code_sha256":"49847ff466218c84"}},{"arxiv_id":"2025.findings-acl.318","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.findings-acl.318","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"SCUNLP/BAR","path":"bar/textual_eva/metrics/metric_edit_distance_hard.py","file_url":"https://github.com/SCUNLP/BAR/blob/HEAD/bar/textual_eva/metrics/metric_edit_distance_hard.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":"b451a87c4e7428ec","code_sha256_prefix":"b451a87c4e7428ec","mcp_get_code":{"code_sha256":"b451a87c4e7428ec"}}],"record_sha256":"f8d23841ba6c2c49af9e8d78c21d40778dc0d008c81b84dae2c47cc978dc8f85","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}