{"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/code-classification","name":"Code Classification","slug":"code-classification","description_markdown":null,"categories":[{"name":"Computer Code","url":"/area/computer-code"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":39,"papers_with_code":15,"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":8,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/xcodeeval","name":"xCodeEval","full_name":"xCodeEval","num_papers_in_archive":15},{"url":"/dataset/pytorrent","name":"PyTorrent","full_name":"PyTorrent","num_papers_in_archive":5},{"url":"/dataset/spectre-v1","name":"Spectre-v1","full_name":"","num_papers_in_archive":3},{"url":"/dataset/a-software-maintainability-dataset","name":"A Software Maintainability Dataset","full_name":"","num_papers_in_archive":1},{"url":"/dataset/fixeval","name":"FixEval","full_name":"FixEval","num_papers_in_archive":1},{"url":"/dataset/isadetect-dataset","name":"ISAdetect dataset","full_name":"ISAdetect binary file and object code dataset","num_papers_in_archive":1},{"url":"/dataset/taco-topics-in-algorithmic-code-generation","name":"TACO-BAAI","full_name":"Topics in Algorithmic Code generation dataset","num_papers_in_archive":1},{"url":"/dataset/codescan","name":"CodeSCAN","full_name":"ScreenCast ANalysis for Video Programming Tutorials","num_papers_in_archive":0}],"subtasks":[],"parent_tasks":[],"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":39,"of":39,"of_with_code":15,"tagged_in_all":39,"counts":{"archive_papers_tagged":39,"with_a_code_link":15,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":39,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"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/codes-a-distribution-shift-benchmark-dataset","slug":"codes-a-distribution-shift-benchmark-dataset","title":"CodeS: Towards Code Model Generalization Under Distribution Shift","date":"2022-06-11","arxiv_id":"2206.05480","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/castle-benchmarking-dataset-for-static-code","slug":"castle-benchmarking-dataset-for-static-code","title":"CASTLE: Benchmarking Dataset for Static Code Analyzers and LLMs towards CWE Detection","date":"2025-03-12","arxiv_id":"2503.09433","repositories_listed":1,"syntology":null},{"url":"/paper/codeprompt-improving-source-code-related","slug":"codeprompt-improving-source-code-related","title":"Enhancing Source Code Classification Effectiveness via Prompt Learning Incorporating Knowledge Features","date":"2024-01-10","arxiv_id":"2401.05544","repositories_listed":1,"syntology":null},{"url":"/paper/graph-convolutions-enrich-the-self-attention","slug":"graph-convolutions-enrich-the-self-attention","title":"Graph Convolutions Enrich the Self-Attention in Transformers!","date":"2023-12-07","arxiv_id":"2312.04234","repositories_listed":1,"syntology":{"n":29,"n_ran":22,"n_constructed":0,"n_ran_checked":11,"n_instrument":11,"n_unverified":7,"n_honours":2,"n_violates":5,"n_no_contract":4,"n_pointer_only":10,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 2 honoured, 5 violated, 4 with no contract checked; 11 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/graph-convolutions-enrich-the-self-attention#ran","syntology_url":"https://syntology.ai/paper/2312.04234","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2312.04234"}},"official":{"repos":["jeongwhanchoi/gfsa"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["found_in_text","official"]}}},{"url":"/paper/a-general-purpose-self-supervised-model-for","slug":"a-general-purpose-self-supervised-model-for","title":"A General-Purpose Self-Supervised Model for Computational Pathology","date":"2023-08-29","arxiv_id":"2308.15474","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-programs-by-exploiting-fuzzing","slug":"understanding-programs-by-exploiting-fuzzing","title":"Understanding Programs by Exploiting (Fuzzing) Test Cases","date":"2023-05-23","arxiv_id":"2305.13592","repositories_listed":1,"syntology":null},{"url":"/paper/the-earlybird-catches-the-bug-on-exploiting","slug":"the-earlybird-catches-the-bug-on-exploiting","title":"The EarlyBIRD Catches the Bug: On Exploiting Early Layers of Encoder Models for More Efficient Code Classification","date":"2023-05-08","arxiv_id":"2305.04940","repositories_listed":1,"syntology":null},{"url":"/paper/heterogeneous-directed-hypergraph-neural","slug":"heterogeneous-directed-hypergraph-neural","title":"Heterogeneous Directed Hypergraph Neural Network over abstract syntax tree (AST) for Code Classification","date":"2023-05-07","arxiv_id":"2305.04228","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-code-classification-by-mixup-based","slug":"enhancing-code-classification-by-mixup-based","title":"MIXCODE: Enhancing Code Classification by Mixup-Based Data Augmentation","date":"2022-10-06","arxiv_id":"2210.03003","repositories_listed":1,"syntology":null},{"url":"/paper/enhancing-mixup-based-graph-learning-for","slug":"enhancing-mixup-based-graph-learning-for","title":"On the Effectiveness of Hybrid Pooling in Mixup-Based Graph Learning for Language Processing","date":"2022-10-06","arxiv_id":"2210.03123","repositories_listed":1,"syntology":null},{"url":"/paper/learning-program-semantics-with-code","slug":"learning-program-semantics-with-code","title":"Learning Program Semantics with Code Representations: An Empirical Study","date":"2022-03-22","arxiv_id":"2203.11790","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-code-classification-for-automated","slug":"semantic-code-classification-for-automated","title":"Semantic Code Classification for Automated Machine Learning","date":"2022-01-25","arxiv_id":"2201.11252","repositories_listed":1,"syntology":null},{"url":"/paper/project-codenet-a-large-scale-ai-for-code","slug":"project-codenet-a-large-scale-ai-for-code","title":"CodeNet: A Large-Scale AI for Code Dataset for Learning a Diversity of Coding Tasks","date":"2021-05-25","arxiv_id":"2105.12655","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/project-codenet-a-large-scale-ai-for-code#ran","syntology_url":"https://syntology.ai/paper/2105.12655","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.12655"}},"official":{"repos":["IBM/Project_CodeNet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/scc-automatic-classification-of-code-snippets","slug":"scc-automatic-classification-of-code-snippets","title":"SCC: Automatic Classification of Code Snippets","date":"2018-09-21","arxiv_id":"1809.07945","repositories_listed":1,"syntology":null},{"url":null,"slug":"federated-learning-for-icd-classification","title":"Federated Learning for ICD Classification with Lightweight Models and Pretrained Embeddings","date":"2025-07-03","arxiv_id":"2507.03122","repositories_listed":0,"syntology":null},{"url":null,"slug":"origami-a-generative-transformer-architecture","title":"ORIGAMI: A generative transformer architecture for predictions from semi-structured data","date":"2024-12-23","arxiv_id":"2412.17348","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-language-model-in-medical-informatics","title":"Large Language Model in Medical Informatics: Direct Classification and Enhanced Text Representations for Automatic ICD Coding","date":"2024-11-11","arxiv_id":"2411.06823","repositories_listed":0,"syntology":null},{"url":null,"slug":"more-questions-than-answers-lessons-from","title":"More Questions than Answers? Lessons from Integrating Explainable AI into a Cyber-AI Tool","date":"2024-08-08","arxiv_id":"2408.04746","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-attention-based-neural-networks-for","title":"Sparse Attention-Based Neural Networks for Code Classification","date":"2023-11-11","arxiv_id":"2311.06575","repositories_listed":0,"syntology":null},{"url":null,"slug":"replication-and-extension-of-schnappingers","title":"Replication and Extension of Schnappinger’s Study on Human-level Ordinal Maintainability Prediction Based on Static Code Metrics","date":"2023-06-14","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inproc-industry-and-product-service-code","title":"InProC: Industry and Product/Service Code Classification","date":"2023-05-22","arxiv_id":"2305.13532","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-source-code-learning-with-data","title":"Boosting Source Code Learning with Text-Oriented Data Augmentation: An Empirical Study","date":"2023-03-13","arxiv_id":"2303.06808","repositories_listed":0,"syntology":null},{"url":null,"slug":"xastnn-improved-code-representations-for","title":"xASTNN: Improved Code Representations for Industrial Practice","date":"2023-03-13","arxiv_id":"2303.07104","repositories_listed":0,"syntology":null},{"url":null,"slug":"adding-context-to-source-code-representations","title":"Adding Context to Source Code Representations for Deep Learning","date":"2022-07-30","arxiv_id":"2208.00203","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-represent-programs-with-code","title":"HierarchyNet: Learning to Summarize Source Code with Heterogeneous Representations","date":"2022-05-31","arxiv_id":"2205.15479","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-using-data-centric-approach-for","title":"Towards Using Data-Influence Methods to Detect Noisy Samples in Source Code Corpora","date":"2022-05-25","arxiv_id":"2205.13022","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-quality-estimation-framework-for-faster","title":"Data Quality Estimation Framework for Faster Tax Code Classification","date":"2022-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"icdbigbird-a-contextual-embedding-model-for","title":"ICDBigBird: A Contextual Embedding Model for ICD Code Classification","date":"2022-04-21","arxiv_id":"2204.10408","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-code-search-with-deep-hashing","title":"Accelerating Code Search with Deep Hashing and Code Classification","date":"2022-03-29","arxiv_id":"2203.15287","repositories_listed":0,"syntology":null},{"url":null,"slug":"energy-bounded-learning-for-robust-models-of","title":"Energy-bounded Learning for Robust Models of Code","date":"2021-12-20","arxiv_id":"2112.11226","repositories_listed":0,"syntology":null},{"url":null,"slug":"code-synonyms-do-matter-multiple-synonyms","title":"Code Synonyms Do Matter: Multiple Synonyms Matching Network for Automatic ICD Coding","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-of-goods-using-text","title":"Classification of Goods Using Text Descriptions With Sentences Retrieval","date":"2021-11-02","arxiv_id":"2111.01663","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":"supervised-learning-in-the-presence-of-noise","title":"Supervised Learning in the Presence of Noise: Application in ICD-10 Code Classification","date":"2021-03-13","arxiv_id":"2103.07808","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-semi-automatic-misconception-discovery","title":"Toward Semi-Automatic Misconception Discovery Using Code Embeddings","date":"2021-03-07","arxiv_id":"2103.04448","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":"source-code-classification-for-energy","title":"Source Code Classification for Energy Efficiency in Parallel Ultra Low-Power Microcontrollers","date":"2020-12-12","arxiv_id":"2012.06836","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-based-source-code","title":"Machine Learning Based Source Code Classification Using Syntax Oriented Features","date":"2017-03-04","arxiv_id":"1703.07638","repositories_listed":0,"syntology":null}],"syntology_records":2,"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":2,"papers_where_code_ran_first_page":"/task/code-classification/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/code-classification/papers/ran/1","json":"/task/code-classification/papers/ran/1.json","rows":2}],"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":"abf40325a9cf74296aa3f1bdf221c203a3c4509a0fb8734fdf6c9bfe317a1c1b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}