arXiv:2606. 12674v1 Announce Type: new Abstract: Compact language models (LMs) reduce cost, latency, and deployment risk for tool agents.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.
arXiv:2608. 10039v1 Announce Type: new Abstract: Agentic workflows have become an important abstraction for building reliable LLM-based automation systems by organizing large language models (LLMs), tools, and control logic into explicit execution structures.
arXiv:2608. 03468v1 Announce Type: new Abstract: Historical tool-use trajectories provide valuable experience for large language model (LLM) agents to plan and coordinate tool usage.
Historical tool-use trajectories provide valuable experience for large language model (LLM) agents to plan and coordinate tool usage. Existing approaches directly construct tool-level graphs from these trajectories, but the resulting graphs remain tied to specific tools and are hard to generalize across tool sets.
arXiv:2607. 16617v1 Announce Type: cross Abstract: Large language models (LLMs) are increasingly used to automate data-processing workflows, yet coding agents typically produce scripts that are not automatically materialized as persistent, editable platform artifacts.
arXiv:2608. 00106v1 Announce Type: new Abstract: Agentic systems must decide not only what answer to produce, but which reasoning and execution operations should precede it.
The paper introduces complete cyclic subtask graphs for large language model agents, enabling a workflow controller where all subtasks are fully connected and a unified agent selects transitions based on natural‑language criteria. It evaluates task‑specific and benchmark‑generic cyclic graphs on TextCraft, ALFWorld, and Finance‑Agent, comparing them to ReAct and dependency‑directed workflows, and identifies three distinct workflow signatures that influence the effectiveness of cyclic routing. The study also provides a workflow‑signature matrix, robustness analysis, token‑cost accounting, and failure‑mode structure, concluding that cyclic subtask graphs serve as a diagnostic tool to determine when flexible backtracking is worthwhile versus when simpler controllers suffice.