Verify-Gated Completion as Admission Control in a Governed Multi-Agent Runtime: A Bounded Architecture Case Study
Hai-Duong Nguyen, Xuan-The Tran

TL;DR
This study explores verify-gated completion as an admission-control pattern in governed multi-agent runtimes, demonstrating its effectiveness in making completion decisions inspectable and fail-closed under observed conditions.
Contribution
It provides an empirical analysis of verify-gated completion in a bounded architecture, highlighting its auditability and fail-closed properties in a specific implementation.
Findings
99.5% success rate in verify-completed slice
98.58% rule agreement in Policy/Governance Verifier
Fail-closed completion decisions under observed conditions
Abstract
As multi-agent systems move from short interactions to tool-using workflows with specialized roles and persistent state, completion becomes a runtime-control problem rather than a purely generative one. This preprint studies verify-gated completion as an admission-control pattern for governed multi-agent runtimes: agents may propose completion, but a read-only verifier decides whether the claim is admitted. Ambiguous or weakly evidenced cases resolve fail-closed, while packetized state and event traces preserve an audit path. We examine one bounded reference implementation and ask what the released evidence can support about auditable, verify-gated completion. In the released verify-completed slice, the known-outcome invoked-event verify success share was 1,791/1,800 = 99.5%. This is an accounting measure over invoked verification events, not a task-completion, production-reliability,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
