{"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":"/task/variable-misuse","name":"Variable misuse","slug":"variable-misuse","description_markdown":null,"categories":[{"name":"Computer Code","url":"/area/computer-code"},{"name":"Reasoning","url":"/area/reasoning"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"derived"},"counts":{"papers_tagged":15,"papers_with_code":11,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"subtasks":[],"parent_tasks":[{"url":"/task/program-repair","name":"Program Repair"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":15,"of":15,"of_with_code":11,"tagged_in_all":15,"counts":{"archive_papers_tagged":15,"with_a_code_link":11,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":15,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/graph-conditioned-sparse-attention-for","slug":"graph-conditioned-sparse-attention-for","title":"Graph Conditioned Sparse-Attention for Improved Source Code Understanding","date":"2021-12-01","arxiv_id":"2112.00663","repositories_listed":2,"syntology":null},{"url":"/paper/memorization-and-generalization-in-neural","slug":"memorization-and-generalization-in-neural","title":"Memorization and Generalization in Neural Code Intelligence Models","date":"2021-06-16","arxiv_id":"2106.08704","repositories_listed":2,"syntology":null},{"url":"/paper/understanding-neural-code-intelligence","slug":"understanding-neural-code-intelligence","title":"Understanding Neural Code Intelligence Through Program Simplification","date":"2021-06-07","arxiv_id":"2106.03353","repositories_listed":2,"syntology":null},{"url":"/paper/pre-trained-contextual-embedding-of-source-1","slug":"pre-trained-contextual-embedding-of-source-1","title":"Learning and Evaluating Contextual Embedding of Source Code","date":"2019-12-21","arxiv_id":"2001.00059","repositories_listed":2,"syntology":null},{"url":"/paper/neural-program-repair-by-jointly-learning-to-1","slug":"neural-program-repair-by-jointly-learning-to-1","title":"Neural Program Repair by Jointly Learning to Localize and Repair","date":"2019-04-03","arxiv_id":"1904.01720","repositories_listed":2,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-program-repair-by-jointly-learning-to-1#ran","syntology_url":"https://syntology.ai/paper/1904.01720","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.01720"}},"official":null}},{"url":"/paper/the-power-of-types-exploring-the-impact-of","slug":"the-power-of-types-exploring-the-impact-of","title":"The Power of Types: Exploring the Impact of Type Checking on Neural Bug Detection in Dynamically Typed Languages","date":"2024-11-22","arxiv_id":"2411.15368","repositories_listed":1,"syntology":null},{"url":"/paper/a-critical-study-of-what-code-llms-do-not","slug":"a-critical-study-of-what-code-llms-do-not","title":"A Critical Study of What Code-LLMs (Do Not) Learn","date":"2024-06-17","arxiv_id":"2406.11930","repositories_listed":1,"syntology":null},{"url":"/paper/probing-pretrained-models-of-source-code","slug":"probing-pretrained-models-of-source-code","title":"Probing Pretrained Models of Source Code","date":"2022-02-16","arxiv_id":"2202.08975","repositories_listed":1,"syntology":null},{"url":"/paper/codetrek-flexible-modeling-of-code-using-an","slug":"codetrek-flexible-modeling-of-code-using-an","title":"CodeTrek: Flexible Modeling of Code using an Extensible Relational Representation","date":"2021-09-29","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-graph-structure-with-a-finite-state","slug":"learning-graph-structure-with-a-finite-state","title":"Learning Graph Structure With A Finite-State Automaton Layer","date":"2020-07-09","arxiv_id":"2007.04929","repositories_listed":1,"syntology":null},{"url":"/paper/global-relational-models-of-source-code","slug":"global-relational-models-of-source-code","title":"Global Relational Models of Source Code","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"neural-interpretation-of-generic-source-code","title":"Neuro-Symbolic Execution of Generic Source Code","date":"2023-03-23","arxiv_id":"2304.00989","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-does-transformer-learn-about-source-code","title":"What does Transformer learn about source code?","date":"2022-07-18","arxiv_id":"2207.08466","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-extend-program-graphs-to-work-in","title":"Learning to Extend Program Graphs to Work-in-Progress Code","date":"2021-05-28","arxiv_id":"2105.14038","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-semantic-program-embeddings-with","title":"Learning Semantic Program Embeddings with Graph Interval Neural Network","date":"2020-05-18","arxiv_id":"2005.09997","repositories_listed":0,"syntology":null}],"syntology_records":1,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":1,"papers_where_code_ran_first_page":"/task/variable-misuse/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/variable-misuse/papers/ran/1","json":"/task/variable-misuse/papers/ran/1.json","rows":1}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","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)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"e62d65f68a2be9f90f5b1e573c6d479e0af860b50fca74b960cc92667491de61","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}