🚀NEW COURSEVibe Coding AI Apps with Claude Code 🤖✨Enroll now
← All papers  /  Sep 16, 2026
Agents

Decomposition Buys Integrity, Not Yield

First page
Decomposition Buys Integrity, Not Yield
The curator’s take

Rong He models a multi-agent decomposition as a tree where each agent keeps a fraction of the items it receives, and measures the constants on production deep-research traces to show that adding tiers reduces how many findings reach the root while protecting the root context.

Ask this paper

Key points
01

Yield law: If an agent handed b items keeps each with probability r(b) = C b^-delta, a depth-k tree over N findings delivers C^k N^(1-delta); task size and architecture separate, so a flat layout maximizes yield.

02

Measured constants: On 600 production research traces delta is 0.34 (95% CI 0.30 to 0.38) by three independent methods, so an agent that surfaces four times as many sources forwards only 2.3 times as many; each extra tier costs about 45% of findings, 46.4% once briefing loss is included.

03

What depth buys: Depth reduces how many items the root context must hold, and it lowers cost: flat agents bill sub-quadratically in rounds, and at equal spend two tiers overtake flat at 403 findings. The optimum is two or three tiers at measured parameters.

04

Deployed behavior: Across 743,819 production tool calls, delegation does not respond to a filling context (odds ratio 0.969 per doubling) and is chosen as an opening move; the model predicts 0.7% to 11.3% of sessions merit delegation against 7.8% observed.

Abstract

Multi-agent systems split a task across a tree of agents and justify the split with folklore: smaller contexts, cleaner separation, parallelism. We ask what the split does to how much of what the leaves discover reaches the root. Model a decomposition as a tree in which an agent handed $b$ items keeps any one with probability $r(b)$. If $r(b)=1/b$, every tree delivers exactly one finding, for every task size and every shape; we verify this to $2.4 \times 10^{-15}$ on 20,000 random irregular trees. If $r(b)=Cb^{-δ}$, a depth-$k$ tree over $N$ findings yields $C^k N^{1-δ}$: task size and architecture separate, and architecture contributes only $C \le 1$ per level, so flat is optimal for yield and no arrangement of agents escapes the exponent $δ$. On 600 production deep-research traces $δ= 0.34$ [0.30, 0.38], by three identifications that do not share a failure mode. At a hop where item boundaries come from the tool rather than a text heuristic, and where $b=1$ occurs 550 times, $C = 0.571$ [0.527, 0.615] is observed rather than extrapolated, over 16,082 hops. A tier also costs alignment: on 1,012 annotated multi-agent traces one brief in sixteen goes off-target, giving $μ= 0.939$ and a per-tier penalty $Cμ= 0.536$. Depth is bought on two other axes. The root context is the only state that persists and the only one that cannot cheaply forget, and depth cuts its exposure from $N$ items to $N^{1/k}$. Depth is also cheaper: production flat agents bill as $N^{1.39}$, not the $N^2$ an append-only context predicts, and at equal spend two tiers overtake flat at 403 findings. Across every parameter we measured the model says 0.7% to 11.3% of production sessions are worth delegating, against 7.8% that do. A hazard model on 743,819 production tool calls finds that delegation does not respond to a filling context and is instead an opening move.

Every Monday
Get next week’s papers.
Subscribe on Substack