In a chain of AI steps, which ones does everything else lean on, so one mistake spreads furthest?
Which workflow positions concentrate the most downstream dependencies?
This explores which steps in a multi-step AI workflow (an agent pipeline, a chain of subtasks) are the ones everything else leans on, so that a mistake or a planted signal there spreads furthest.
This explores which steps in a multi-step AI workflow are the ones everything else leans on. The corpus has no dependency map that ranks positions, but it points at three places where dependencies pile up: high-influence subtasks that many later steps read from, the planning step that sets the shape of the whole run, and the handoffs and commit points where errors compound or become permanent.
The most direct evidence is from security research. Malicious signals injected into high-influence subtasks spread far more than ones injected into peripheral nodes, and downstream agents relay a signal even more readily when it is framed as task-relevant evidence (How does a signal's position in a workflow change its influence?). The note doesn't say which positions count as high-influence, so I'm inferring that they're the nodes with many downstream readers. That is a fair reading, but the paper doesn't state it as a rule. The practical point is that position matters as much as content. The same bad input does little at the edge of a workflow and a lot near its centre.
Planning steps look like a second concentration point. In ReWOO, the whole plan is written before any tool runs, and every later call is just carrying it out (Can reasoning and tool execution be truly decoupled?). Splitting a decomposer from a solver gives a similar picture. The decomposer's output is the frame the solver works inside, and decomposition skill transfers across domains while solving skill doesn't (Does separating planning from execution improve reasoning accuracy?). Trees show a version of the same thing. In Tree-GRPO, early branches carry coarse strategy-level signals and late branches carry fine detail, so an early choice sets the direction for everything under it (Does tree depth automatically produce supervision at multiple granularities?). None of these notes say it in dependency terms, but in each case the early step is the one that everything after it is built on.
The end of the workflow is the third place, and the damage there comes from accumulation and irreversibility. Frontier models lose about 25% of a document's content over long relay workflows, the errors compound silently, and spot checks miss them (Do frontier LLMs silently corrupt documents in long workflows?). Each handoff inherits whatever the last one broke. The commit point, where an irreversible action fires, is where all of that finally lands. It is also the only place the whole assembled workflow can be seen at once, which is why SafeFlow validates there (Where should workflow validation gates be placed for safety?).
These positions are hard to protect because a step can pass its own check while the workflow as a whole still fails. Local checks test different properties than the ones that decide end-to-end safety (Can individual components pass safety checks if the system still fails?). So the steps with the most downstream dependents are the ones where step-by-step inspection is least reliable. Any check aimed at them needs to look at the workflow as a whole.
Sources 7 notes
Malicious signals injected into high-influence subtasks propagate far more than those in peripheral nodes, and signals framed as task-relevant evidence are relayed by downstream agents. FLOWSTEER exploits both regularities to steer multi-agent workflows.
ReWOO and Chain-of-Abstraction both decouple reasoning from tool responses through different mechanisms—planning-before-execution and abstract placeholders respectively—eliminating quadratic prompt growth and sequential latency while maintaining reasoning quality.
Modular architectures with separate decomposer and solver models outperform monolithic LLMs, with decomposition ability transferring across domains while solving ability does not. The separation prevents planning-execution interference and produces more generalizable skills.
Tree-GRPO's random expansion strategy naturally produces supervision at varying granularities—early branches provide coarse strategy-level signals while late branches provide fine-grained detail supervision. This multi-resolution signal emerges from sampling structure alone, without annotation effort or granularity scheduling.
Even the strongest models (Gemini 3.1 Pro, Claude 4.6 Opus, GPT 5.4) degrade documents by ~25% over long relay workflows across 52 domains. Degradation decelerates but never plateaus, and errors compound silently, remaining undetected in spot-checked outputs.
Show all 7 sources
SafeFlow validates assembled workflows at irreversible action boundaries, reconstructing the global risk picture that no single step holds. This commit-point placement complements planning-boundary and per-hop defenses, each seeing attacks the others miss.
Three mechanisms across SafeFlow, ChannelGuard, and Honest Quorum show that passing local checks (plausibility, alignment, protocol compliance) does not prevent system failures. The gap persists because local checks verify different properties than those that determine safe end-to-end behavior.
Papers this line draws on 8
The research behind the notes this line reads — ranked by how closely each paper relates.
- Trust propagation and structural containment in Multi-agent LLM pipelines
- Divide-or-Conquer? Which Part Should You Distill Your LLM?
- FLOWSTEER: Prompt-Only Workflow Steering Exposes Planning-Time Vulnerabilities in Multi-Agent LLM Systems
- Scaling Reasoning, Losing Control: Evaluating Instruction Following in Large Reasoning Models
- LLMs Corrupt Your Documents When You Delegate
- SafeFlow: Semantic Information-Flow Control for Blocking Malicious Propagation in Multi-Agent Systems
- PACT: Can Enterprise AI Assistants Be Trusted Under Pressure?
- interwhen: A Generalizable Framework for Steering Reasoning Models with Test-time Verification