{"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/method-name-prediction","name":"Method name prediction","slug":"method-name-prediction","description_markdown":null,"categories":[{"name":"Computer Code","url":"/area/computer-code"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":24,"papers_with_code":15,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"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":1,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/method-name-prediction-on-codesearchnet","slug":"method-name-prediction-on-codesearchnet","dataset":"CodeSearchNet","dataset_url":"/dataset/codesearchnet","rows_in_archive":1,"metrics":["F1"],"first_row_in_archive_order":{"model":"ContraCode","paper_title":"Contrastive Code Representation Learning","paper_url":"/paper/contrastive-code-representation-learning","paper_date":"2020-07-09","arxiv_id":"2007.04973","code_links":[{"title":"parasj/contracode","url":"https://github.com/parasj/contracode"}],"syntology":null}}],"datasets":[{"url":"/dataset/codesearchnet","name":"CodeSearchNet","full_name":"","num_papers_in_archive":308}],"subtasks":[],"parent_tasks":[{"url":"/task/code-summarization","name":"Source Code Summarization"}],"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":24,"of":24,"of_with_code":15,"tagged_in_all":24,"counts":{"archive_papers_tagged":24,"with_a_code_link":15,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":24,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"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/assessing-project-level-fine-tuning-of-ml4se","slug":"assessing-project-level-fine-tuning-of-ml4se","title":"Assessing Project-Level Fine-Tuning of ML4SE Models","date":"2022-06-07","arxiv_id":"2206.03333","repositories_listed":2,"syntology":null},{"url":"/paper/syntax-guided-program-reduction-for","slug":"syntax-guided-program-reduction-for","title":"Syntax-Guided Program Reduction for Understanding Neural Code Intelligence Models","date":"2022-05-28","arxiv_id":"2205.14374","repositories_listed":2,"syntology":null},{"url":"/paper/extracting-label-specific-key-input-features","slug":"extracting-label-specific-key-input-features","title":"Extracting Label-specific Key Input Features for Neural Code Intelligence Models","date":"2022-02-14","arxiv_id":"2202.06474","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/embedding-java-classes-with-code2vec","slug":"embedding-java-classes-with-code2vec","title":"Embedding Java Classes with code2vec: Improvements from Variable Obfuscation","date":"2020-04-06","arxiv_id":"2004.02942","repositories_listed":2,"syntology":null},{"url":"/paper/testing-neural-programs","slug":"testing-neural-programs","title":"Testing Neural Program Analyzers","date":"2019-08-25","arxiv_id":"1908.10711","repositories_listed":2,"syntology":null},{"url":"/paper/wrdscore-new-metric-for-evaluation-of-natural","slug":"wrdscore-new-metric-for-evaluation-of-natural","title":"WRDScore: New Metric for Evaluation of Natural Language Generation Models","date":"2024-05-29","arxiv_id":"2405.19220","repositories_listed":1,"syntology":null},{"url":"/paper/studying-vulnerable-code-entities-in-r","slug":"studying-vulnerable-code-entities-in-r","title":"Studying Vulnerable Code Entities in R","date":"2024-02-06","arxiv_id":"2402.04421","repositories_listed":1,"syntology":null},{"url":"/paper/transformcode-a-contrastive-learning","slug":"transformcode-a-contrastive-learning","title":"TransformCode: A Contrastive Learning Framework for Code Embedding via Subtree Transformation","date":"2023-11-10","arxiv_id":"2311.08157","repositories_listed":1,"syntology":null},{"url":"/paper/psiminer-a-tool-for-mining-rich-abstract","slug":"psiminer-a-tool-for-mining-rich-abstract","title":"PSIMiner: A Tool for Mining Rich Abstract Syntax Trees from Code","date":"2021-03-23","arxiv_id":"2103.12778","repositories_listed":1,"syntology":null},{"url":"/paper/towards-demystifying-dimensions-of-source","slug":"towards-demystifying-dimensions-of-source","title":"Towards Demystifying Dimensions of Source Code Embeddings","date":"2020-08-29","arxiv_id":"2008.13064","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-generalizability-of-neural-program","slug":"on-the-generalizability-of-neural-program","title":"On the Generalizability of Neural Program Models with respect to Semantic-Preserving Program Transformations","date":"2020-07-31","arxiv_id":"2008.01566","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-code-representation-learning","slug":"contrastive-code-representation-learning","title":"Contrastive Code Representation Learning","date":"2020-07-09","arxiv_id":"2007.04973","repositories_listed":1,"syntology":null},{"url":"/paper/evaluation-of-generalizability-of-neural","slug":"evaluation-of-generalizability-of-neural","title":"Evaluation of Generalizability of Neural Program Analyzers under Semantic-Preserving Transformations","date":"2020-04-15","arxiv_id":"2004.07313","repositories_listed":1,"syntology":null},{"url":null,"slug":"do-current-language-models-support-code","title":"Do Current Language Models Support Code Intelligence for R Programming Language?","date":"2024-10-10","arxiv_id":"2410.07793","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-empirical-study-on-capability-of-large","title":"An Empirical Study on Capability of Large Language Models in Understanding Code Semantics","date":"2024-07-04","arxiv_id":"2407.03611","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-the-impact-of-source-code-parsers","title":"Evaluating the Impact of Source Code Parsers on ML4SE Models","date":"2022-06-17","arxiv_id":"2206.08713","repositories_listed":0,"syntology":null},{"url":null,"slug":"encoding-program-as-image-evaluating-visual","title":"Code2Snapshot: Using Code Snapshots for Learning Representations of Source Code","date":"2021-11-01","arxiv_id":"2111.01097","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-representation-for-code","title":"Universal Representation for Code","date":"2021-03-04","arxiv_id":"2103.03116","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-distributed-representations-of-code","title":"InferCode: Self-Supervised Learning of Code Representations by Predicting Subtrees","date":"2020-12-13","arxiv_id":"2012.07023","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-framework-for-learning-code","title":"Self-Supervised Contrastive Learning for Code Retrieval and Summarization via Semantic-Preserving Transformations","date":"2020-09-06","arxiv_id":"2009.02731","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},{"url":null,"slug":"a-hybrid-approach-for-learning-program","title":"Learning Blended, Precise Semantic Program Embeddings","date":"2019-07-03","arxiv_id":"1907.02136","repositories_listed":0,"syntology":null}],"syntology_records":0,"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":0,"papers_where_code_ran_first_page":null,"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":[],"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":"75e2366b6e9b292c0274795752a274843bca04f7f84b2192b415e9c518de1afc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}