GraphBit: A Graph-based Agentic Framework for Non-Linear Agent Orchestration

• URL: http://arxiv.org/abs/2605.13848v1
• Date: Sun, 08 Mar 2026 18:32:28 GMT
• Title: GraphBit: A Graph-based Agentic Framework for Non-Linear Agent Orchestration
• Abstract summary: GraphBit is an engine-orchestrated framework that defines explicitly and deterministically as a directed acyclic graph (DAG)<n>Unlike prompted orchestration, agents in GraphBit operate as typed functions, while a Rust-based engine governs routing, state transitions, and tool invocation, ensuring auditability.<n>A three-tier memory architecture consisting of ephemeral scratch space, structured state, and external connectors isolates context across stages, preventing cascading context that degrades reasoning in long-running pipelines.
• Score: 34.588097323063074
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Agentic LLM frameworks that rely on prompted orchestration, where the model itself determines workflow transitions, often suffer from hallucinated routing, infinite loops, and non-reproducible execution. We introduce GraphBit, an engine-orchestrated framework that defines workflows explicitly and deterministically as a directed acyclic graph (DAG). Unlike prompted orchestration, agents in GraphBit operate as typed functions, while a Rust-based engine governs routing, state transitions, and tool invocation, ensuring reproducibility and auditability. The engine supports parallel branch execution, conditional control flow over structured state predicates, and configurable error recovery. A three-tier memory architecture consisting of ephemeral scratch space, structured state, and external connectors isolates context across stages, preventing cascading context bloat that degrades reasoning in long-running pipelines. Across GAIA benchmark tasks spanning zero-tool, document-augmented, and web-enabled workflows, GraphBit outperforms six existing frameworks, achieving the highest accuracy (67.6 percent), zero framework-induced hallucinations, the lowest latency (11.9 ms overhead), and the highest throughput. Ablation studies demonstrate that each memory tier contributes measurably to performance, with deterministic execution providing the greatest gains on tool-intensive tasks representative of real-world deployments.

Related papers

• Inference-Time Graph Engineering for Multi-Agent LLM Workflows [51.56038180639833]
  We introduce ReActNet, a training-free framework that compiles a query and a set of role-specialized agents into a sequence of directed communication graphs.<n>We show that ReActNet consistently improves over fixed-topology and learned-topology baselines while maintaining competitive inference cost.
  arXiv  Detail & Related papers  (2026-09-04T23:32:11Z)
• PeakBench: Benchmarking Resource-Aware Tool Invocation in LLM Agents [79.28372522980153]
  PeakBench is a benchmark of executable multi-tool dependency annotations and measured resource profiles.<n>We show that strong logical planning does not reliably translate into safe or efficient execution under resource constraints.<n>PeakBench is a useful testbed for diagnosing resource-aware agent behavior.
  arXiv  Detail & Related papers  (2026-08-25T12:56:08Z)
• Graph-Based Agentic AI with LangGraph: Workflow Pathways for Long-Running Stateful Business Processes [0.0]
  We present three executable recipes to show how typed state, conditional routing, deterministic tools, retries, interrupts, checkpoints, and traces fit together.<n>LangGraph is positioned by workflow-complexity fit, not as a universal default.
  arXiv  Detail & Related papers  (2026-07-21T17:07:13Z)
• A Formal Hierarchical Architecture for Agentic Orchestration with Stack-Based Execution and Lazy Discovery [5.106901034158075]
  This paper presents a hierarchical, skill-based architecture for agentic orchestration.<n> Capabilities are organized as a rooted tree where internal nodes make routing decisions and leaf nodes execute deterministic tasks.<n>By replacing global memory with localized stack frames, the architecture prevents outputs from one execution branch from leaking into another.
  arXiv  Detail & Related papers  (2026-07-13T06:15:51Z)
• Atomic Task Graph: A Unified Framework for Agentic Planning and Execution [13.978062792065215]
  Atomic Task Graph (ATG) is a unified control framework for planning and execution.<n>ATG maintains an explicit graph to expose dependencies and support reuse.<n>ATG consistently outperforms strong baselines in success rate and execution efficiency.
  arXiv  Detail & Related papers  (2026-07-02T09:34:20Z)
• The Log is the Agent: Event-Sourced Reactive Graphs for Auditable, Forkable Agentic Systems [0.0]
  We describe ActiveGraph, a runtime that inverts the typical agent framework.<n>The append-only event log is the source of truth; the working graph is a deterministic projection of that log.<n>No component instructs another; coordination happens entirely through the shared graph.
  arXiv  Detail & Related papers  (2026-05-21T04:55:38Z)
• GraphFlow: An Architecture for Formally Verifiable Visual Workflows Enabling Reliable Agentic AI Automation [0.0]
  GraphFlow is a visual workflow system designed to improve the reliability of agentic AI automation in mission-critical processes.<n>Existing workflow platforms provide durable execution and observability but offer few semantic correctness guarantees.<n>A year-long pilot across three clinical sites executed 8,728 cohort-enrolled workflow runs with a 97.08% completion rate.
  arXiv  Detail & Related papers  (2026-05-14T15:33:05Z)
• GraphWalk: Enabling Reasoning in Large Language Models through Tool-Based Graph Navigation [0.2999888908665658]
  We present GraphWalk, a problem-agnostic, training-free, tool-based framework that allows off-the-shelf LLMs to reason through sequential graph navigation.<n>We evaluate whether models equipped with GraphWalk can compose these operations into correct multi-step reasoning chains.
  arXiv  Detail & Related papers  (2026-04-02T04:43:01Z)
• Robust and Efficient Tool Orchestration via Layered Execution Structures with Reflective Correction [55.13278005189741]
  We model tool orchestration as learning a layered execution structure that captures high-level tool dependencies.<n>We introduce a schema-aware reflective correction mechanism that detects and repairs errors locally.<n>This design confines errors to individual tool calls and avoids re-planning entire execution trajectories.
  arXiv  Detail & Related papers  (2026-02-21T22:20:01Z)
• ANCHOR: Branch-Point Data Generation for GUI Agents [52.22377425487]
  End-to-end GUI agents for real desktop environments require large amounts of high-quality interaction data.<n>We present a trajectory expansion framework Anchor that bootstraps scalable desktop supervision from a small set of verified seed demonstrations.<n>Experiments on standard desktop benchmarks, OSWorld and WindowsAgentArena, show that models fine-tuned on our expanded corpus achieve consistent improvements.
  arXiv  Detail & Related papers  (2026-02-06T19:55:26Z)
• Embodied Task Planning via Graph-Informed Action Generation with Large Lanaguage Model [6.302973995986435]
  GiG is a novel planning framework that structures embodied agents' memory using a Graph-in-Graph architecture.<n>By clustering these graph embeddings, the framework enables retrieval of structure-aware priors.<n>We evaluate our framework on three embodied planning benchmarks-Robotouille Synchronous, Robotouille Asynchronous, and ALFWorld.
  arXiv  Detail & Related papers  (2026-01-29T15:18:58Z)
• GLOW: Graph-Language Co-Reasoning for Agentic Workflow Performance Prediction [51.83437071408662]
  We propose GLOW, a unified framework for AW performance prediction.<n>GLOW combines the graph-structure modeling capabilities of GNNs with the reasoning power of LLMs.<n>Experiments on FLORA-Bench show that GLOW outperforms state-of-the-art baselines in prediction accuracy and ranking utility.
  arXiv  Detail & Related papers  (2025-12-11T13:30:46Z)
• Flash-Searcher: Fast and Effective Web Agents via DAG-Based Parallel Execution [48.7788770680643]
  Flash-Searcher is a novel parallel agent reasoning framework.<n>It decomposes complex tasks into subtasks with explicit dependencies, enabling concurrent execution of independent reasoning paths.<n>It achieves 67.7% accuracy on BrowseComp and 83% on xbench-DeepSearch, while reducing agent execution steps by up to 35% compared to current frameworks.
  arXiv  Detail & Related papers  (2025-09-29T17:39:30Z)
• Follow the Flow: Fine-grained Flowchart Attribution with Neurosymbolic Agents [106.04963073116468]
  Flowcharts are a critical tool for visualizing decision-making processes.<n> vision-language models frequently hallucinate nonexistent connections and decision paths when analyzing these diagrams.<n>We introduce Fine-grained Flowchart, which traces specific components grounding a flowchart referring LLM response.<n>We propose FlowPathAgent, a neurosymbolic agent that performs fine-grained post hoc attribution through graph-based reasoning.
  arXiv  Detail & Related papers  (2025-06-02T06:02:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.