{"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/jaccard-similarity","entry":"jaccard_similarity","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":19,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":13,"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":17,"n_samples_ran":15,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":4,"n_samples_unverified":2,"n_samples_fingerprinted":10,"n_places":19,"n_places_pointer_only":2,"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":4,"ran_fixture":0,"ran":6,"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":"2608.16643","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-16643","title":"Toward Better Assessment of LLMs' Performance in Clinical Error Detection","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"healthylaife/paired-clinical-eval","path":"build_pairs.py","file_url":"https://github.com/healthylaife/paired-clinical-eval/blob/HEAD/build_pairs.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":"f31a7f3584994961","code_sha256_prefix":"f31a7f3584994961","mcp_get_code":{"code_sha256":"f31a7f3584994961"}},{"arxiv_id":"2604.22760","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2604-22760","title":"Quantifying Divergence in Inter-LLM Communication Through API Retrieval and Ranking","date":null,"month_inferred_from_arxiv_id":"2026-04","title_source":"syntology","repo":"aeris-lab/llmrank","path":"aaai_lamas_study.ipynb.py","file_url":"https://github.com/aeris-lab/llmrank/blob/HEAD/aaai_lamas_study.ipynb.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, aeris-lab/llmrank when it was checked","code_sha256":"9ffccdf789b0e482","code_sha256_prefix":"9ffccdf789b0e482","mcp_get_code":{"code_sha256":"9ffccdf789b0e482"}},{"arxiv_id":"2603.12478","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-12478","title":"Less Data, Faster Convergence: Goal-Driven Data Optimization for Multimodal Instruction Tuning","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"rujiewu/GDO","path":"gdo/extract_six_metrics.py","file_url":"https://github.com/rujiewu/GDO/blob/HEAD/gdo/extract_six_metrics.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":"cd6a7e9e2afeead9","code_sha256_prefix":"cd6a7e9e2afeead9","mcp_get_code":{"code_sha256":"cd6a7e9e2afeead9"}},{"arxiv_id":"2506.20803","arxiv_id_is_arxiv":true,"paper":"/paper/the-ideation-execution-gap-execution-outcomes","title":"The Ideation-Execution Gap: Execution Outcomes of LLM-Generated versus Human Research Ideas","date":"2025-06-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"NoviScl/AI-Researcher","path":"ai_researcher/src/analyze_experiment_plans_semantic_similarity.py","file_url":"https://github.com/NoviScl/AI-Researcher/blob/HEAD/ai_researcher/src/analyze_experiment_plans_semantic_similarity.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aa1065b49e195e70","code_sha256_prefix":"aa1065b49e195e70","mcp_get_code":{"code_sha256":"aa1065b49e195e70"}},{"arxiv_id":"2409.04109","arxiv_id_is_arxiv":true,"paper":"/paper/can-llms-generate-novel-research-ideas-a","title":"Can LLMs Generate Novel Research Ideas? A Large-Scale Human Study with 100+ NLP Researchers","date":"2024-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"simplaj/AI-Researcher-Spark","path":"ai_researcher/src/analyze_experiment_plans_semantic_similarity.py","file_url":"https://github.com/simplaj/AI-Researcher-Spark/blob/HEAD/ai_researcher/src/analyze_experiment_plans_semantic_similarity.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"aa1065b49e195e70","code_sha256_prefix":"aa1065b49e195e70","mcp_get_code":{"code_sha256":"aa1065b49e195e70"}},{"arxiv_id":"2405.19740","arxiv_id_is_arxiv":true,"paper":"/paper/perteval-unveiling-real-knowledge-capacity-of","title":"PertEval: Unveiling Real Knowledge Capacity of LLMs with Knowledge-Invariant Perturbations","date":"2024-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aigc-apps/PertEval","path":"transition_analysis.py","file_url":"https://github.com/aigc-apps/PertEval/blob/HEAD/transition_analysis.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":"9c137effe97e6ce1","code_sha256_prefix":"9c137effe97e6ce1","mcp_get_code":{"code_sha256":"9c137effe97e6ce1"}},{"arxiv_id":"2405.15523","arxiv_id_is_arxiv":true,"paper":"/paper/mosaic-memory-fuzzy-duplication-in-copyright","title":"The Mosaic Memory of Large Language Models","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"computationalprivacy/mosaic_memory","path":"src/gen_canaries.py","file_url":"https://github.com/computationalprivacy/mosaic_memory/blob/HEAD/src/gen_canaries.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"60ab76511145062d","code_sha256_prefix":"60ab76511145062d","mcp_get_code":{"code_sha256":"60ab76511145062d"}},{"arxiv_id":"2403.09732","arxiv_id_is_arxiv":true,"paper":"/paper/pet-sql-a-prompt-enhanced-two-stage-text-to","title":"PET-SQL: A Prompt-Enhanced Two-Round Refinement of Text-to-SQL with Cross-consistency","date":"2024-03-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhshlii/petsql","path":"src/sources/sql_gen/sql_gen_utils.py","file_url":"https://github.com/zhshlii/petsql/blob/HEAD/src/sources/sql_gen/sql_gen_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, zhshlii/petsql when it was checked","code_sha256":"a1579e74824be11f","code_sha256_prefix":"a1579e74824be11f","mcp_get_code":{"code_sha256":"a1579e74824be11f"}},{"arxiv_id":"2402.14700","arxiv_id_is_arxiv":true,"paper":"/paper/unveiling-linguistic-regions-in-large","title":"Unveiling Linguistic Regions in Large Language Models","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zzhang0179/Unveiling-Linguistic-Regions-in-LLMs","path":"region_selection/extract_accumulated_core_linguistic_region.py","file_url":"https://github.com/zzhang0179/Unveiling-Linguistic-Regions-in-LLMs/blob/HEAD/region_selection/extract_accumulated_core_linguistic_region.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"055c2b5ab3275ac2","code_sha256_prefix":"055c2b5ab3275ac2","mcp_get_code":{"code_sha256":"055c2b5ab3275ac2"}},{"arxiv_id":"2402.09363","arxiv_id_is_arxiv":true,"paper":"/paper/copyright-traps-for-large-language-models","title":"Copyright Traps for Large Language Models","date":"2024-02-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"computationalprivacy/copyright-traps","path":"src/utils.py","file_url":"https://github.com/computationalprivacy/copyright-traps/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4eef3bc43ceb9a6e","code_sha256_prefix":"4eef3bc43ceb9a6e","mcp_get_code":{"code_sha256":"4eef3bc43ceb9a6e"}},{"arxiv_id":"2402.06221","arxiv_id_is_arxiv":true,"paper":"/paper/resumeflow-an-llm-facilitated-pipeline-for","title":"ResumeFlow: An LLM-facilitated Pipeline for Personalized Resume Generation and Refinement","date":"2024-02-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ztrimus/job-llm","path":"zlm/utils/metrics.py","file_url":"https://github.com/Ztrimus/job-llm/blob/HEAD/zlm/utils/metrics.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":"78dddf7fab0bf963","code_sha256_prefix":"78dddf7fab0bf963","mcp_get_code":{"code_sha256":"78dddf7fab0bf963"}},{"arxiv_id":"2401.16744","arxiv_id_is_arxiv":true,"paper":"/paper/sharp-explaining-rankings-with-shapley-values","title":"ShaRP: A Novel Feature Importance Framework for Ranking","date":"2024-01-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dataresponsibly/sharp","path":"sharp/metrics/_base.py","file_url":"https://github.com/dataresponsibly/sharp/blob/HEAD/sharp/metrics/_base.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9363f8db4167743d","code_sha256_prefix":"9363f8db4167743d","mcp_get_code":{"code_sha256":"9363f8db4167743d"}},{"arxiv_id":"2310.13132","arxiv_id_is_arxiv":true,"paper":"/paper/ask-me-in-english-instead-cross-lingual","title":"Better to Ask in English: Cross-Lingual Evaluation of Large Language Models for Healthcare Queries","date":"2023-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"claws-lab/XLingEval","path":"consistency/consistency_answer_evaluation.py","file_url":"https://github.com/claws-lab/XLingEval/blob/HEAD/consistency/consistency_answer_evaluation.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":"9a52e4e9f92b3c06","code_sha256_prefix":"9a52e4e9f92b3c06","mcp_get_code":{"code_sha256":"9a52e4e9f92b3c06"}},{"arxiv_id":"2310.11248","arxiv_id_is_arxiv":true,"paper":"/paper/crosscodeeval-a-diverse-and-multilingual","title":"CrossCodeEval: A Diverse and Multilingual Benchmark for Cross-File Code Completion","date":"2023-10-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"amazon-science/cceval","path":"prompt_builder/rerank_utils.py","file_url":"https://github.com/amazon-science/cceval/blob/HEAD/prompt_builder/rerank_utils.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":"ae5ed04d466c8051","code_sha256_prefix":"ae5ed04d466c8051","mcp_get_code":{"code_sha256":"ae5ed04d466c8051"}},{"arxiv_id":"2305.14292","arxiv_id_is_arxiv":true,"paper":"/paper/wikichat-a-few-shot-llm-based-chatbot","title":"WikiChat: Stopping the Hallucination of Large Language Model Chatbots by Few-Shot Grounding on Wikipedia","date":"2023-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stanford-oval/wikichat","path":"pipelines/dialogue_state.py","file_url":"https://github.com/stanford-oval/wikichat/blob/HEAD/pipelines/dialogue_state.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":"34a2e796a199d00d","code_sha256_prefix":"34a2e796a199d00d","mcp_get_code":{"code_sha256":"34a2e796a199d00d"}},{"arxiv_id":"2204.09888","arxiv_id_is_arxiv":true,"paper":"/paper/fairness-in-graph-mining-a-survey","title":"Fairness in Graph Mining: A Survey","date":"2022-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yushundong/pygdebias","path":"pygdebias/debiasing/GUIDE.py","file_url":"https://github.com/yushundong/pygdebias/blob/HEAD/pygdebias/debiasing/GUIDE.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"917ebaecb4caaf74","code_sha256_prefix":"917ebaecb4caaf74","mcp_get_code":{"code_sha256":"917ebaecb4caaf74"}},{"arxiv_id":"2111.13654","arxiv_id_is_arxiv":true,"paper":"/paper/do-language-models-have-beliefs-methods-for","title":"Do Language Models Have Beliefs? Methods for Detecting, Updating, and Visualizing Model Beliefs","date":"2021-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peterbhase/slag-belief-updating","path":"metrics.py","file_url":"https://github.com/peterbhase/slag-belief-updating/blob/HEAD/metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f4cecdbe8b090444","code_sha256_prefix":"f4cecdbe8b090444","mcp_get_code":{"code_sha256":"f4cecdbe8b090444"}},{"arxiv_id":"1906.10263","arxiv_id_is_arxiv":true,"paper":"/paper/dlime-a-deterministic-local-interpretable","title":"DLIME: A Deterministic Local Interpretable Model-Agnostic Explanations Approach for Computer-Aided Diagnosis Systems","date":"2019-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rehmanzafar/dlime_experiments","path":"experiments_bc_nn.py","file_url":"https://github.com/rehmanzafar/dlime_experiments/blob/HEAD/experiments_bc_nn.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9a52e4e9f92b3c06","code_sha256_prefix":"9a52e4e9f92b3c06","mcp_get_code":{"code_sha256":"9a52e4e9f92b3c06"}},{"arxiv_id":"2022.findings-naacl.156","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2022.findings-naacl.156","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"MJ-Jang/beyond-distributional","path":"src/metrics/eval_metrics.py","file_url":"https://github.com/MJ-Jang/beyond-distributional/blob/HEAD/src/metrics/eval_metrics.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c3fb804a84a0ac5b","code_sha256_prefix":"c3fb804a84a0ac5b","mcp_get_code":{"code_sha256":"c3fb804a84a0ac5b"}}],"record_sha256":"77f3bee9f81fe06fb53390611896479552dfaf85d1626d63ccc954e5fff0fdfe","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}