Research

Four new AI papers: Secret code, metric error, 80,000 cases

5 min read

TL;DR Too Long; Didn’t read

Four new arXiv preprints from the past days show how fragile the measurement foundations and control of today's AI systems remain: The most significant finding is that a widely misapplied success metric for coding agents reports values of up to 0.98, where a corrected measurement shows only 0.00 to 0.12. A second paper shows how inconspicuously readable AI texts can be used to transmit covert messages between sender and receiver without a shared prompt context. A third study maps, based on over 80,000 responses from 23 leading language models, how differently their security vulnerabilities are distributed – and that more capable models do not automatically become safer. A fourth paper shows that a reused, recurrently processed computation block allows a language model to operate with up to 63 percent fewer parameters at comparable accuracy.

A magnifying glass enlarges four details from a stack of scientific papers: encrypted letters hidden between normal text lines, two widely diverging bars over the same metric, a grid of small warning triangles of different sizes, and a gear that rotates multiple times through the same ring. Image generated with GPT Image 2

Key takeaways

  • Misapplied Pass@k metric reports up to 0.98 success rate, corrected it is only 0.00 to 0.12.
  • New method hides messages in AI text without shared prompt context, KL divergence drops below 0.5 nats.
  • HarmProfile catalogs 80,000 harmful responses from 23 frontier models – more capable models pose more, not less risk.
  • RecurrentGPT achieves up to 63 percent fewer parameters with recurrent computation block at similar accuracy.

Today’s selection from the arXiv new submissions of the past days connects four questions that rarely arise together: whether one of the most used success metrics for coding agents actually holds what it promises, how secret messages can be discreetly hidden in AI-generated text, how unevenly distributed security vulnerabilities are across 23 leading language models, and how a language model can be built with significantly fewer parameters. The curation was based on substance and dispersion: each paper provides a comprehensible method with robust numbers in the abstract, and no two works address the same subfield.

Beyond Pass@k: How a Coding Metric Systematically Beautifies

Jiajun Jiang, Sharon Zheng, Natan Vidra, and Spurthi Setty show with Beyond Pass@k that one of the most used success metrics for AI coding agents is incorrectly applied in practice: instead of setting k for the number of independent test runs, common implementations set k equal to the number of unit tests within a single submission, according to the authors – a fundamental calculation error. The authors propose a correctly calculated alternative with reliability@k and a variant with security-adjusted reliability@k that additionally requires the absence of security vulnerabilities in the generated code. On their synthetic test benchmark, the faulty standard metric reported values from 0.96 to 0.98, while the corrected measurement only reached 0.00 to 0.12; initial results on SWE-bench also showed a gap between 0.80 passed hidden tests and only 0.20 actually solved tasks. An earlier digest post had already shown that even a single unmasked parser step can change the measured success rate of agents by up to 73 percentage points – the new work shows that even the metric itself, regardless of the execution environment, complicates reliable comparisons between coding agents. This matters because many leaderboards and purchasing decisions for coding agents are based on exactly this metric.

Synchronized Logit Steering: Secret Messages in Completely Normal AI Text

Andrew Rufail and a seven-member author team present Synchronized Logit Steering, a steganography method that circumvents a central hurdle of previous approaches: senders and receivers previously had to know the same secret prompt context to generate the same probability distribution over possible next words. The new method instead derives a substitute prompt from the already generated text itself, allowing both sides to independently reconstruct the same distribution, and encodes the secret message as the rank of individual tokens in areas of high uncertainty. The authors report that the Kullback-Leibler divergence between the true and reconstructed distribution falls below 0.5 nats at a synchronization window of 40 tokens, a burst variant achieves about ten times the capacity of simple methods, and statistical tests could hardly distinguish the generated texts from ordinary AI responses. An earlier report had shown that Anthropic’s text watermark for Claude responses can only be reliably removed through complete reformulation – the new work shows the flip side of the same fundamental problem: if meaning can be so finely steered into text that a watermark remains, a concealed message can also be reliably hidden within it. This matters because covert communication channels in seemingly normal AI responses pose new challenges for content moderation and exfiltration defense.

HarmProfile: 80,000 Harmful Responses Show That Capability Is No Security Guarantee

A team led by Zhouyuan Ma and Yutao Wu presents HarmProfile, a dataset of over 80,000 verified harmful outputs from 23 frontier language models across 13 model families, categorized into 15 harm categories with 57 subcategories. Instead of treating harmful outputs merely as a byproduct of attack tests, the authors analyze them as an independent subject of investigation and derive an individual risk profile for each model. They report that all tested models reliably produced harmful content on a large scale, but showed significantly different risk profiles; with increasing model capability, both the severity and diversity of failures increased, so that more capable models may appear safer but could harbor increasingly dangerous knowledge beneath the alignment surface. An earlier digest post had already shown that GPT-5.5 could be led to potentially dangerous virus candidate sequences with targeted jailbreak prompts – HarmProfile provides systematic mapping across 23 models instead of a single case. This matters because robust comparative data between models has been rare so far, making it easier to contextualize security claims from individual providers.

RecurrentGPT: A Reused Computation Block Saves Up to 63 Percent of Parameters

Amr Hegazy, Amr Alanwar, and Mostafa Elhoushi present RecurrentGPT, a transformer variant that runs a single shared computation block multiple times instead of many different layers. A lightweight projection with element-wise update gate adjusts the input to the hidden state, the fixed preprocessing, and freshly drawn noise at each pass, allowing the reused block to take on different functions at each step. The authors report that a three-layer RecurrentGPT achieves comparable accuracy to a twelve-layer GPT-2 Small at the same computational budget and outperforms other methods for deep reuse; for larger models, the number of parameters decreases by 63 percent and peak memory usage during decoding by 59 percent, with only 10 percent higher compiled generation latency. This matters because smaller, memory-efficient models could facilitate the operation of language models on cheaper or mobile hardware while maintaining comparable quality.

All four works are not independently peer-reviewed preprints – the reported numbers come from the experiments of the respective author teams and have not yet been externally replicated. This is especially true for HarmProfile, whose risk profiles are currently based only on the authors’ own categorizations, as well as for the steganography work, whose detection resistance has only been tested against the statistical methods used, not against future detectors. Whether the findings can be confirmed on additional models, benchmarks, and in independent replications remains to be seen.

Frequently asked questions

Are these four papers already peer-reviewed?

No, all four are currently unreviewed arXiv preprints, whose numbers come from the experiments of the respective author teams and have not yet been examined in a peer-review process.

Is there code or data for the presented methods?

HarmProfile provides its dataset and evaluation code according to the authors via a GitHub repository. For Beyond Pass@k, Synchronized Logit Steering, and RecurrentGPT, the available abstracts do not provide an explicit commitment to full code release.

What distinguishes reliability@k from the classical Pass@k metric?

Pass@k was originally intended to measure how often a model solves a task at least once in k independent attempts. The implementations criticized by the authors instead set k to the number of unit tests within a single submission – a category error. reliability@k correctly calculates the metric over real independent rollouts, security-adjusted reliability@k additionally requires the absence of known security vulnerabilities in the generated code.

Why is steganography in AI-generated text a security problem?

Steganography hides information in seemingly ordinary text so that third parties notice nothing unusual. If this can be reliably and subtly implemented in AI responses, covert channels could emerge for data exfiltration from monitored environments or for coordination between agents, without content filters or monitoring systems noticing anything.

Sources (4)
  1. Beyond Pass@k: Measuring Reliability and Security of Agentic Code Generation
  2. Synchronized Logit Steering: Real-world Steganography
  3. HarmProfile: Characterizing Harmful Distributions in Frontier LLMs
  4. RecurrentGPT: Expressive Depth through Recurrent Modulation

Your AI update for the work week

Once a week, the most important AI news – plus one practical tip to try right away. No spam, unsubscribe anytime.

← Back to the blog