arXiv (All)
open access
Truthful and Expected-Payment-Optimal Model Routing in Graph-Based Agentic Workflows
Assigning routine tasks to cheaper large language model (LLM) providers can reduce generation cost, but switching providers may require processing accumulated context again. Keeping dependent tasks with the same provider can instead reuse eligible context. Graph-based workflows therefore couple rout
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Evaluating LLMs as Agentic Workflow Executors in Real-World Customer Support Skills#1324947
- SENTINEL-RL: Offloading Topological Reasoning from LLM Agents in the Security Operations Center#927025
- AgentLoop: Runtime Control of Slot-closed Execution Loops for Tool-augmented LLM Agents#1118027
- AgentLoop: Runtime Control of Slot-closed Execution Loops for Tool-augmented LLM Agents#1108730
- From Preference to Reciprocity: Decentralized Matching with Empirically Grounded LLM-agent Based Modeling#1128938
Record · ID 1345139
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive