Pith. sign in

I Can Find You in Seconds! Leveraging Large Language Models for Code Authorship Attribution

2 Pith papers cite this work, alongside 1 external citations. Polarity classification is still indexing.

2 Pith papers citing it
1 external citations · Pith
abstract

Source code authorship attribution is important in software forensics, plagiarism detection, and protecting software patch integrity. Existing techniques often rely on supervised machine learning, which struggles with generalization across different programming languages and coding styles due to the need for large labeled datasets. Inspired by recent advances in natural language authorship analysis using large language models (LLMs), which have shown exceptional performance without task-specific tuning, this paper explores the use of LLMs for source code authorship attribution. We present a comprehensive study demonstrating that state-of-the-art LLMs can successfully attribute source code authorship across different languages. LLMs can determine whether two code snippets are written by the same author with zero-shot prompting, achieving a Matthews Correlation Coefficient (MCC) of 0.78, and can attribute code authorship from a small set of reference code snippets via few-shot learning, achieving MCC of 0.77. Additionally, LLMs show some adversarial robustness against misattribution attacks. Despite these capabilities, we found that naive prompting of LLMs does not scale well with a large number of authors due to input token limitations. To address this, we propose a tournament-style approach for large-scale attribution. Evaluating this approach on datasets of C++ (500 authors, 26,355 samples) and Java (686 authors, 55,267 samples) code from GitHub, we achieve classification accuracy of up to 65% for C++ and 68.7% for Java using only one reference per author. These results open new possibilities for applying LLMs to code authorship attribution in cybersecurity and software engineering.

fields

cs.CR 2

years

2026 2

verdicts

UNVERDICTED 2

representative citing papers

Multi-Channel Spread-Spectrum Code Watermarking

cs.CR · 2026-07-07 · unverdicted · novelty 7.0

A training-free post-hoc code watermark embeds 24-bit identifiers via multi-channel spread-spectrum encoding over naming conventions and semantic pattern pairs, with majority voting and Reed-Solomon recovery.

Anonymous YARA Rules Are Not Anonymous

cs.CR · 2026-05-26 · unverdicted · novelty 7.0

Stylometric analysis of 23,305 YARA rules shows that repository origin, authors, and malware families can be identified with high accuracy from rule text alone.

citing papers explorer

Showing 2 of 2 citing papers.

  • Multi-Channel Spread-Spectrum Code Watermarking cs.CR · 2026-07-07 · unverdicted · none · ref 7 · internal anchor

    A training-free post-hoc code watermark embeds 24-bit identifiers via multi-channel spread-spectrum encoding over naming conventions and semantic pattern pairs, with majority voting and Reed-Solomon recovery.

  • Anonymous YARA Rules Are Not Anonymous cs.CR · 2026-05-26 · unverdicted · none · ref 7

    Stylometric analysis of 23,305 YARA rules shows that repository origin, authors, and malware families can be identified with high accuracy from rule text alone.