{"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/clone-detection","name":"Clone Detection","slug":"clone-detection","description_markdown":null,"categories":[],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":68,"papers_with_code":27,"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":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/codexglue","name":"CodeXGLUE","full_name":"","num_papers_in_archive":205}],"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":68,"of":68,"of_with_code":27,"tagged_in_all":68,"counts":{"archive_papers_tagged":68,"with_a_code_link":27,"where_syntology_ran_a_sample":7,"not_listed_spam_title":0,"listed":68,"listed_where_code_ran":7,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":6,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":6,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/codexglue-a-machine-learning-benchmark","slug":"codexglue-a-machine-learning-benchmark","title":"CodeXGLUE: A Machine Learning Benchmark Dataset for Code Understanding and Generation","date":"2021-02-09","arxiv_id":"2102.04664","repositories_listed":7,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/codexglue-a-machine-learning-benchmark#ran","syntology_url":"https://syntology.ai/paper/2102.04664","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.04664"}},"official":{"repos":["microsoft/CodeXGLUE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/codet5-identifier-aware-unified-pre-trained","slug":"codet5-identifier-aware-unified-pre-trained","title":"CodeT5: Identifier-aware Unified Pre-trained Encoder-Decoder Models for Code Understanding and Generation","date":"2021-09-02","arxiv_id":"2109.00859","repositories_listed":5,"syntology":{"n":11,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/codet5-identifier-aware-unified-pre-trained#ran","syntology_url":"https://syntology.ai/paper/2109.00859","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.00859"}},"official":{"repos":["salesforce/codet5"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/trained-without-my-consent-detecting-code","slug":"trained-without-my-consent-detecting-code","title":"Trained Without My Consent: Detecting Code Inclusion In Language Models Trained on Code","date":"2024-02-14","arxiv_id":"2402.09299","repositories_listed":2,"syntology":null},{"url":"/paper/unified-pre-training-for-program","slug":"unified-pre-training-for-program","title":"Unified Pre-training for Program Understanding and Generation","date":"2021-03-10","arxiv_id":"2103.06333","repositories_listed":2,"syntology":null},{"url":"/paper/ast-enhanced-or-ast-overloaded-the-surprising","slug":"ast-enhanced-or-ast-overloaded-the-surprising","title":"AST-Enhanced or AST-Overloaded? The Surprising Impact of Hybrid Graph Representations on Code Clone Detection","date":"2025-06-17","arxiv_id":"2506.14470","repositories_listed":1,"syntology":null},{"url":"/paper/on-the-use-of-deep-learning-models-for","slug":"on-the-use-of-deep-learning-models-for","title":"On the Use of Deep Learning Models for Semantic Clone Detection","date":"2024-12-19","arxiv_id":"2412.14739","repositories_listed":1,"syntology":null},{"url":"/paper/codesam-source-code-representation-learning","slug":"codesam-source-code-representation-learning","title":"CodeSAM: Source Code Representation Learning by Infusing Self-Attention with Multi-Code-View Graphs","date":"2024-11-21","arxiv_id":"2411.14611","repositories_listed":1,"syntology":null},{"url":"/paper/augmenting-the-interpretability-of","slug":"augmenting-the-interpretability-of","title":"Augmenting the Interpretability of GraphCodeBERT for Code Similarity Tasks","date":"2024-09-20","arxiv_id":"2410.05275","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-for-cross-language-code","slug":"large-language-models-for-cross-language-code","title":"The Struggles of LLMs in Cross-lingual Code Clone Detection","date":"2024-08-08","arxiv_id":"2408.04430","repositories_listed":1,"syntology":null},{"url":"/paper/advanced-detection-of-source-code-clones-via","slug":"advanced-detection-of-source-code-clones-via","title":"Advanced Detection of Source Code Clones via an Ensemble of Unsupervised Similarity Measures","date":"2024-05-03","arxiv_id":"2405.02095","repositories_listed":1,"syntology":null},{"url":"/paper/investigating-the-efficacy-of-large-language-1","slug":"investigating-the-efficacy-of-large-language-1","title":"Investigating the Efficacy of Large Language Models for Code Clone Detection","date":"2024-01-24","arxiv_id":"2401.13802","repositories_listed":1,"syntology":null},{"url":"/paper/source-code-clone-detection-using","slug":"source-code-clone-detection-using","title":"Source Code Clone Detection Using Unsupervised Similarity Measures","date":"2024-01-18","arxiv_id":"2401.09885","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/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/cloning-and-beyond-a-quantum-solution-to","slug":"cloning-and-beyond-a-quantum-solution-to","title":"Cloning and Beyond: A Quantum Solution to Duplicate Code","date":"2023-10-19","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/zc3-zero-shot-cross-language-code-clone","slug":"zc3-zero-shot-cross-language-code-clone","title":"ZC3: Zero-Shot Cross-Language Code Clone Detection","date":"2023-08-26","arxiv_id":"2308.13754","repositories_listed":1,"syntology":null},{"url":"/paper/graph-neural-networks-for-mapping-variables","slug":"graph-neural-networks-for-mapping-variables","title":"Graph Neural Networks For Mapping Variables Between Programs -- Extended Version","date":"2023-07-24","arxiv_id":"2307.13014","repositories_listed":1,"syntology":null},{"url":"/paper/transcoder-towards-unified-transferable-code","slug":"transcoder-towards-unified-transferable-code","title":"TransCoder: Towards Unified Transferable Code Representation Learning Inspired by Human Skills","date":"2023-05-23","arxiv_id":"2306.07285","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/transcoder-towards-unified-transferable-code#ran","syntology_url":"https://syntology.ai/paper/2306.07285","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07285"}},"official":{"repos":["qiushisun/transcoder"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":5,"ran_from_kinds":["official"]}}},{"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/uniasm-binary-code-similarity-detection","slug":"uniasm-binary-code-similarity-detection","title":"UniASM: Binary Code Similarity Detection without Fine-tuning","date":"2022-10-28","arxiv_id":"2211.01144","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/uniasm-binary-code-similarity-detection#ran","syntology_url":"https://syntology.ai/paper/2211.01144","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.01144"}},"official":{"repos":["clm07/uniasm"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-neural-network-architecture-for-program-1","slug":"a-neural-network-architecture-for-program-1","title":"A Neural Network Architecture for Program Understanding Inspired by Human Behaviors","date":"2022-05-10","arxiv_id":"2206.04730","repositories_listed":1,"syntology":{"n":9,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/a-neural-network-architecture-for-program-1#ran","syntology_url":"https://syntology.ai/paper/2206.04730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.04730"}},"official":{"repos":["recklessronan/pgnn-ek"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["found_in_text"]}}},{"url":"/paper/on-the-cross-modal-transfer-from-natural","slug":"on-the-cross-modal-transfer-from-natural","title":"On The Cross-Modal Transfer from Natural Language to Code through Adapter Modules","date":"2022-04-19","arxiv_id":"2204.08653","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/bridging-pre-trained-models-and-downstream","slug":"bridging-pre-trained-models-and-downstream","title":"Bridging Pre-trained Models and Downstream Tasks for Source Code Understanding","date":"2021-12-04","arxiv_id":"2112.02268","repositories_listed":1,"syntology":{"n":13,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/bridging-pre-trained-models-and-downstream#ran","syntology_url":"https://syntology.ai/paper/2112.02268","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.02268"}},"official":{"repos":["wangdeze18/DACL"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/graphcodebert-pre-training-code","slug":"graphcodebert-pre-training-code","title":"GraphCodeBERT: Pre-training Code Representations with Data Flow","date":"2020-09-17","arxiv_id":"2009.08366","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/detecting-code-clones-with-graph-neural","slug":"detecting-code-clones-with-graph-neural","title":"Detecting Code Clones with Graph Neural Networkand Flow-Augmented Abstract Syntax Tree","date":"2020-02-20","arxiv_id":"2002.08653","repositories_listed":1,"syntology":null},{"url":null,"slug":"gradient-based-model-fingerprinting-for-llm","title":"Gradient-Based Model Fingerprinting for LLM Similarity Detection and Family Classification","date":"2025-06-02","arxiv_id":"2506.01631","repositories_listed":0,"syntology":null},{"url":null,"slug":"bigscoder-state-space-model-for-code","title":"CodeSSM: Towards State Space Models for Code Understanding","date":"2025-05-02","arxiv_id":"2505.01475","repositories_listed":0,"syntology":null},{"url":null,"slug":"should-code-models-learn-pedagogically-a","title":"Should Code Models Learn Pedagogically? A Preliminary Evaluation of Curriculum Learning for Real-World Software Engineering Tasks","date":"2025-02-06","arxiv_id":"2502.03806","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-secure-ai-driven-industrial-metaverse","title":"Towards Secure AI-driven Industrial Metaverse with NFT Digital Twins","date":"2024-12-20","arxiv_id":"2412.15716","repositories_listed":0,"syntology":null},{"url":null,"slug":"in-context-code-text-learning-for-bimodal","title":"In-Context Code-Text Learning for Bimodal Software Engineering","date":"2024-10-08","arxiv_id":"2410.18107","repositories_listed":0,"syntology":null},{"url":null,"slug":"zsllmcode-an-effective-approach-for","title":"An Effective Approach to Embedding Source Code by Combining Large Language and Sentence Embedding Models","date":"2024-09-23","arxiv_id":"2409.14644","repositories_listed":0,"syntology":null},{"url":null,"slug":"eliminating-backdoors-in-neural-code-models","title":"Eliminating Backdoors in Neural Code Models for Secure Code Understanding","date":"2024-08-08","arxiv_id":"2408.04683","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepcodeprobe-towards-understanding-what","title":"DeepCodeProbe: Towards Understanding What Models Trained on Code Learn","date":"2024-07-11","arxiv_id":"2407.08890","repositories_listed":0,"syntology":null},{"url":null,"slug":"assessing-the-code-clone-detection-capability","title":"Assessing the Code Clone Detection Capability of Large Language Models","date":"2024-07-02","arxiv_id":"2407.02402","repositories_listed":0,"syntology":null},{"url":null,"slug":"simclone-detecting-tabular-data-clones-using","title":"SimClone: Detecting Tabular Data Clones using Value Similarity","date":"2024-06-24","arxiv_id":"2407.12802","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-exploring-the-code-understanding","title":"Toward Exploring the Code Understanding Capabilities of Pre-trained Code Generation Models","date":"2024-06-18","arxiv_id":"2406.12326","repositories_listed":0,"syntology":null},{"url":null,"slug":"importance-guided-data-augmentation-for","title":"GenCode: A Generic Data Augmentation Framework for Boosting Deep Learning-Based Code Understanding","date":"2024-02-24","arxiv_id":"2402.15769","repositories_listed":0,"syntology":null},{"url":null,"slug":"source-code-is-a-graph-not-a-sequence-a-cross","title":"Source Code is a Graph, Not a Sequence: A Cross-Lingual Perspective on Code Clone Detection","date":"2023-12-27","arxiv_id":"2312.16488","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaccd-adaptive-semantic-contrasts-discovery","title":"AdaCCD: Adaptive Semantic Contrasts Discovery Based Cross Lingual Adaptation for Code Clone Detection","date":"2023-11-13","arxiv_id":"2311.07277","repositories_listed":0,"syntology":null},{"url":null,"slug":"natural-language-generation-and-understanding","title":"Natural Language Generation and Understanding of Big Code for AI-Assisted Programming: A Review","date":"2023-07-04","arxiv_id":"2307.02503","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-systematic-literature-review-on-source-code","title":"A systematic literature review on source code similarity measurement and clone detection: techniques, applications, and challenges","date":"2023-06-28","arxiv_id":"2306.16171","repositories_listed":0,"syntology":null},{"url":null,"slug":"cct-code-cross-consistency-training-for","title":"CCT-Code: Cross-Consistency Training for Multilingual Clone Detection and Code Search","date":"2023-05-19","arxiv_id":"2305.11626","repositories_listed":0,"syntology":null},{"url":null,"slug":"rnns-representation-nearest-neighbor-search","title":"A Black-Box Attack on Code Models via Representation Nearest Neighbor Search","date":"2023-05-10","arxiv_id":"2305.05896","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":"poison-attack-and-defense-on-deep-source-code","title":"Poison Attack and Defense on Deep Source Code Processing Models","date":"2022-10-31","arxiv_id":"2210.17029","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalizability-of-code-clone-detection-on","title":"Generalizability of Code Clone Detection on CodeBERT","date":"2022-08-26","arxiv_id":"2208.12588","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluation-of-contrastive-learning-with","title":"Evaluation of Contrastive Learning with Various Code Representations for Code Clone Detection","date":"2022-06-17","arxiv_id":"2206.08726","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":"an-exploratory-study-on-code-attention-in","title":"An Exploratory Study on Code Attention in BERT","date":"2022-04-05","arxiv_id":"2204.10200","repositories_listed":0,"syntology":null},{"url":null,"slug":"astbert-enabling-language-model-for-code","title":"AstBERT: Enabling Language Model for Financial Code Understanding with Abstract Syntax Trees","date":"2022-01-20","arxiv_id":"2201.07984","repositories_listed":0,"syntology":null},{"url":null,"slug":"programming-knowledge-tracing-a-comprehensive","title":"Programming Knowledge Tracing: A Comprehensive Dataset and A New Model","date":"2021-12-11","arxiv_id":"2112.08273","repositories_listed":0,"syntology":null},{"url":null,"slug":"borrowing-from-similar-code-a-deep-learning","title":"Borrowing from Similar Code: A Deep Learning NLP-Based Approach for Log Statement Automation","date":"2021-12-02","arxiv_id":"2112.01259","repositories_listed":0,"syntology":null},{"url":null,"slug":"code-clone-detection-based-on-event-embedding","title":"Code Clone Detection based on Event Embedding and Event Dependency","date":"2021-11-28","arxiv_id":"2111.14183","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-neural-networks-understand-programs-like","title":"Can Neural Networks Understand Programs like Humans?","date":"2021-11-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"contrastive-learning-for-source-code-with","title":"Towards Learning (Dis)-Similarity of Source Code from Program Contrasts","date":"2021-10-08","arxiv_id":"2110.03868","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-code-clones-and-natural-language","title":"Leveraging Code Clones and Natural Language Processing for Log Statement Prediction","date":"2021-09-08","arxiv_id":"2109.03859","repositories_listed":0,"syntology":null},{"url":null,"slug":"clsebert-contrastive-learning-for-syntax","title":"SynCoBERT: Syntax-Guided Multi-Modal Contrastive Pre-Training for Code Representation","date":"2021-08-10","arxiv_id":"2108.04556","repositories_listed":0,"syntology":null},{"url":null,"slug":"semantic-aware-binary-code-representation","title":"Semantic-aware Binary Code Representation with BERT","date":"2021-06-10","arxiv_id":"2106.05478","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-tags-are-alright-robust-large-scale-rfid","title":"The Tags Are Alright: Robust Large-Scale RFID Clone Detection Through Federated Data-Augmented Radio Fingerprinting","date":"2021-05-08","arxiv_id":"2105.03671","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":"semantic-clone-detection-via-probabilistic","title":"Semantic Clone Detection via Probabilistic Software Modeling","date":"2020-08-11","arxiv_id":"2008.04891","repositories_listed":0,"syntology":null},{"url":null,"slug":"misim-an-end-to-end-neural-code-similarity","title":"MISIM: A Neural Code Semantics Similarity System Using the Context-Aware Semantics Structure","date":"2020-06-05","arxiv_id":"2006.05265","repositories_listed":0,"syntology":null},{"url":null,"slug":"twin-finder-integrated-reasoning-engine-for","title":"Twin-Finder: Integrated Reasoning Engine for Pointer-related Code Clone Detection","date":"2019-11-01","arxiv_id":"1911.00561","repositories_listed":0,"syntology":null},{"url":"/paper/apk2vec-semi-supervised-multi-view","slug":"apk2vec-semi-supervised-multi-view","title":"apk2vec: Semi-supervised multi-view representation learning for profiling Android applications","date":"2018-09-15","arxiv_id":"1809.05693","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-clone-detection-support-quality","title":"Can clone detection support quality assessments of requirements specifications?","date":"2017-11-15","arxiv_id":"1711.05472","repositories_listed":0,"syntology":null}],"syntology_records":7,"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":7,"papers_where_code_ran_first_page":"/task/clone-detection/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/clone-detection/papers/ran/1","json":"/task/clone-detection/papers/ran/1.json","rows":7}],"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":"626cad66eb7cf97848a054ff0cf1500308698ba5134106ae1f3c8479fc537be1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}