Anastasiia Linich
Author directory2026
Trace-GRAF: Trace-Guided Granularity Routing for Sequential Agentic Workflows
Anastasiia Linich | Artyom Sosedka | Semen Budennyy
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing: Industry Track
Anastasiia Linich | Artyom Sosedka | Semen Budennyy
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing: Industry Track
Multi-agent LLM results can conflate decomposition with roles, communication, parallelism, and extra compute. We study strictly ordered tool-use workflows of dependent state-changing steps, where segmentation may also support auditing and handoff constraints. We introduce Trace-GRAF, a granularity selector that aligns one single-agent trace to target workflow steps, converts order violations and unrelated drift into split pressure, and selects the smallest granularity on the minimum-pressure plateau. It executes balanced contiguous segments because boundary ablation finds no significant success difference from semantic segmentation; pressure-minimizing partitions characterize cuts. Across held-out cohorts spanning two benchmarks and three executors, fixed decomposition sometimes improves and sometimes reduces success, while greater granularity both rescues failures and regresses solved runs. When SA success is observable, the pressure route preserves successful runs by construction. Across validation resplits on TerminalWorld, the calibrated extension’s mean recovery is 2.3–3.0% for GPT-OSS, 0.0–0.1% for Gemini, and 2.3–4.9% for DeepSeek. Simple fixed fallbacks match much of the observed gain. Trace-GRAF therefore provides a risk-aware routing diagnostic with benchmark- and split-dependent gains.