AIarXiv

Ranked by formulaVerdict: Notable

Hidden Messages Between Diffusion Language Model Agents: Causal Evidence for Latent Communication

Diffusion language models form answers through a sequence of revisable continuous states, but multi-agent systems usually discard those states and make agents communicate only after decoding text.

By Gazzaev, Gavrilov, Muravyov +1

Score████░░░░░░4.1

VerdictWorth a reader's time today.

Read the originalPDFCode

Abstract

Diffusion language models form answers through a sequence of revisable continuous states, but multi-agent systems usually discard those states and make agents communicate only after decoding text. We ask whether one independent diffusion trajectory can pass a compact hidden message into another and, crucially, whether the receiver uses what that message means. In Hidden Messages, a sender compresses its denoising state into four signed dense vectors; the receiver consumes them while retaining its own context, canvas, and trajectory. Removing a message tests whether the channel matters; replacing it with a message from another example tests whether its content matters. Across controlled tasks, derangement removes a +63.6-point advantage on Tiny-A2D and a +100.0-point advantage on Dream-7B, while targeted substitutions steer the receiver toward the substituted fact. On QASC with the two supporting facts split across agents, matched communication reaches 80.8%, but a wrong-example message lowers accuracy to 46.8%, a content effect of +34.0 points. The surprising result is temporal: one late transfer reaches 87.8%, exceeding four recurrent exchanges by +7.0 points. These experiments provide causal evidence for continuous hidden communication between diffusion-LM agents and show that when information is transferred can matter more than how many times agents exchange it.

Alan-Barsag Gazzaev, Alexey Gavrilov, Sergey Muravyov, Ilya Makarov

The editor's rubric

Heuristic review

Leverage3 / 5
A method or resource many groups across the field will adopt within a year.
24% of this desk’s rubric
Magnitude3 / 5
Large gain: roughly 2x, or a clear new state of the art on a hard, unsaturated problem.
18% of this desk’s rubric
Evidence3 / 5
Solid: multiple benchmarks or cohorts, ablations, fair baselines, released code or data.
14% of this desk’s rubric
Novelty3 / 5
A genuinely new approach to an open problem.
16% of this desk’s rubric
Trajectory2 / 5
Some room to improve with obvious engineering.
18% of this desk’s rubric
Stakes2 / 5
Benefits a professional community (practitioners, clinicians, engineers).
10% of this desk’s rubric

Editor’s rationale

Heuristic triage from title and abstract text only, not a reading of the paper. Cues found: gains (relative gain, outperforms); novelty (unexpected); stakes (general AI).

How the score was computed

rank-2026-10-18

Score████░░░░░░4.1

Score = 10 × (65% × adjusted merit / 10 + 25% × attention + 10% × freshness)

Desks place stronger verdicts first, then use this score to order work within the same verdict.

Merit
5.4 / 10
Weighted rubric, evidence-gated.
Adjusted merit
4.5 / 10
Shrunk toward the desk prior by editor confidence (38%).
Attention
35%
Citations, upvotes, points, mentions.
Freshness
27%
Half-life decay since publication.
  • Hugging Face upvotes12 (reference 25, via hf-daily, Oct 24, 2026, 13:49 UTC)
  • GitHub stars2 (reference 250, via hf-daily, Oct 24, 2026, 13:49 UTC)

The record

  • Reviewed by heuristic-v10 on Oct 25, 2026, 13:49 UTC. Paper type: empirical.
  • Categories: cs.AI
  • BRIEF, No.10 in the Artificial Intelligence edition of October 25, 2026.