{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LQDC6B5K2WAFCMS55UKHM4V7NE","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"de6faca86a82e5e0d336bab6e0d75086120a1e7481da4bf8e2edcafd457de10f","cross_cats_sorted":["cs.CL","cs.DC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2026-03-08T18:32:28Z","title_canon_sha256":"dbdfafcff0144142c5f24f139f16e0286100e254a3a30628b16251af463927a4"},"schema_version":"1.0","source":{"id":"2605.13848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13848","created_at":"2026-05-17T23:39:19Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13848v1","created_at":"2026-05-17T23:39:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13848","created_at":"2026-05-17T23:39:19Z"},{"alias_kind":"pith_short_12","alias_value":"LQDC6B5K2WAF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"LQDC6B5K2WAFCMS5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"LQDC6B5K","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:e92e712e40aee48c48dcd16b972c0b52ca699d430c7a8857e9fd4734868c1886","target":"graph","created_at":"2026-05-17T23:39:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"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."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that explicit DAG orchestration with typed functions and a Rust engine can capture the necessary flexibility for diverse real-world workflows without the adaptability of prompted routing."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"GraphBit is a DAG-based engine-orchestrated framework for agentic LLMs that achieves 67.6% accuracy with zero hallucinations on GAIA benchmarks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"GraphBit defines LLM agent workflows as explicit DAGs executed by a Rust engine to eliminate routing hallucinations and improve reproducibility."}],"snapshot_sha256":"880ee2ab4ba9dd76a6ec21b77df40f48a9c2a17f88e9bcbd964436beaaf892bd"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"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","authors_text":"Md Rahmat Ullah, Musa Molla, Shafiq Joty, Yeahia Sarker","cross_cats":["cs.CL","cs.DC"],"headline":"GraphBit defines LLM agent workflows as explicit DAGs executed by a Rust engine to eliminate routing hallucinations and improve reproducibility.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2026-03-08T18:32:28Z","title":"GraphBit: A Graph-based Agentic Framework for Non-Linear Agent Orchestration"},"references":{"count":46,"internal_anchors":9,"resolved_work":46,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Large Language Model Agents: A Comprehensive Survey on Architectures, Capabilities, and Applications , author=. 2025 , publisher=","work_id":"1928ae29-9eb7-40a0-9a2f-9638b6e14790","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Junwei Yu and Yepeng Ding and Hiroyuki Sato , year=","work_id":"bd4627d0-c02d-4122-9d87-5a8895b3c6b5","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A Survey of Frontiers in LLM Reasoning: Inference Scaling, Learning to Reason, and Agentic Systems , author=. 2025 , eprint=","work_id":"2dd2a7a8-fb1d-444c-9b32-837d554a9ed4","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"LLM-based agentic reasoning frameworks: A survey from methods to scenarios","work_id":"72e6ad05-70c7-43be-a64c-81e3d8c8b9dd","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"The Twelfth International Conference on Learning Representations , year=","work_id":"a197f9a8-9836-45b2-83ff-b74f5bd3bccd","year":null}],"snapshot_sha256":"700db8256765d184b5b072227b552e65074bbaf0f58e2414fef5446c0bc59436"},"source":{"id":"2605.13848","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T14:29:55.590019Z","id":"405c3af8-3a6c-4834-8cb7-197902560801","model_set":{"reader":"grok-4.3"},"one_line_summary":"GraphBit is a DAG-based engine-orchestrated framework for agentic LLMs that achieves 67.6% accuracy with zero hallucinations on GAIA benchmarks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"GraphBit defines LLM agent workflows as explicit DAGs executed by a Rust engine to eliminate routing hallucinations and improve reproducibility.","strongest_claim":"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.","weakest_assumption":"The assumption that explicit DAG orchestration with typed functions and a Rust engine can capture the necessary flexibility for diverse real-world workflows without the adaptability of prompted routing."}},"verdict_id":"405c3af8-3a6c-4834-8cb7-197902560801"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d6958bc234dfa4b03991b17e6bf32d596118ae05f534f37f113371506edd7564","target":"record","created_at":"2026-05-17T23:39:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"de6faca86a82e5e0d336bab6e0d75086120a1e7481da4bf8e2edcafd457de10f","cross_cats_sorted":["cs.CL","cs.DC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.AI","submitted_at":"2026-03-08T18:32:28Z","title_canon_sha256":"dbdfafcff0144142c5f24f139f16e0286100e254a3a30628b16251af463927a4"},"schema_version":"1.0","source":{"id":"2605.13848","kind":"arxiv","version":1}},"canonical_sha256":"5c062f07aad58051325ded147672bf692d4eb39a70b799e905b687f9fd565830","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c062f07aad58051325ded147672bf692d4eb39a70b799e905b687f9fd565830","first_computed_at":"2026-05-17T23:39:19.639271Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:19.639271Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"kI0W0hvigUxfOjaFgM/tvwwQlBUdWf3ph2OiuTkFYxUfIHYtTIBobjJEhDcFvPjvHLWKdRjHj5y88YWzKknQBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:19.639995Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d6958bc234dfa4b03991b17e6bf32d596118ae05f534f37f113371506edd7564","sha256:e92e712e40aee48c48dcd16b972c0b52ca699d430c7a8857e9fd4734868c1886"],"state_sha256":"9891107d583d792c73a34cc8d23ef334ecd894b177fc04229318347a3af9d50f"}