MétaCan
Menu
Back to cohort
Record W4412082768 · doi:10.1109/cai64502.2025.00200

ICARuS: Intercode-CTF Auto-Randomization System

2025· article· en· W4412082768 on OpenAlexaff
Ryan Kerr, Adrian Taylor, Madeena Sultana, Jean-Pierre Sabbagh El-Rami

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Data Compression Techniques
Canadian institutionsDefence Research and Development Canada
Fundersnot available
KeywordsICARUSComputer sciencePhysicsAstronomy

Abstract

fetched live from OpenAlex

Large Language Models (LLMs) have seen rapid advancements since 2020 and have shown impressive capabilities in the domain of software development. This has raised both curiosity and concerns surrounding the cybersecurity capabilities of LLMs. Recent work has sought to quantify these capabilities by adapting publicly available capture-the-flag (CTF) challenges into a benchmark. While CTF challenges are an attractive choice for benchmarking LLM cybersecurity capabilities due to their self-contained nature across a wide-range of cyber-related skills, there is a risk of test-set contamination where the LLMs have been trained on publicly-available solutions. To measure the extent that LLMs can adapt to variations in these types of problems, we present ICARuS, a randomization framework that generates randomized instances of tasks defined in a previously published benchmark (InterCode-CTF). In addition, we estimate the complexity of each Intercode-CTF task and show model performance degradation is inversely correlated with the number of steps required to solve the problem.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.883
Threshold uncertainty score0.318

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.005
GPT teacher head0.259
Teacher spread0.254 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Compression TechniquesFrench-language works237,207