Jev-Guard: Fast Routing and Auditing Agent Actions over Editable Policy Trees

Wenbin Hu, Huihao Jing, Haochen Shi, Yuxuan Liu, Changxuan Fan +7 more
10/13/2026
cs.CRcs.CL

No confident code implementation found for this paper.

Abstract

Agent harnesses require a low-latency guardrail model together with customizable audit policies. However, deploying an auto-regressive guardrail model remains challenging: such models incur high inference latency and are often poorly aligned with customized policies. To address these problems, we present Jev-Guard, a unified model for safety classification and policy routing. We further construct a policy tree over which Jev-Guard performs routing, spanning diverse domains including content moderation, cybersecurity, privacy, and legal compliance. Specifically, Jev-Guard first navigates the policy tree to select the applicable audit policy given the caller's audit context, and then performs safety classification conditioned on the retrieved policies. On 7,033 evaluation cases, Jev-Guard achieves 93.72\% safety accuracy, a mean latency of 58ms, and 93.10\% hierarchical routing accuracy. The full routing-and-classification pipeline averages 240ms. Furthermore, we integrate Jev-Guard into the Hermes harness framework. Across agent trajectories, its separate permission gate cuts mean review time per task from 4.80s for an SFT-LLM judge to 1.33s, with no policy violations are observed for either guard.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{hu2026jevguard,
  title  = {Jev-Guard: Fast Routing and Auditing Agent Actions over Editable Policy Trees},
  author = {Wenbin Hu and Huihao Jing and Haochen Shi and Yuxuan Liu and Changxuan Fan and Sirui Zhang and Kawai Chung and Hanyu Yang and Zhenhuan Wang and Ziyi Chen and Haoran Li and Yangqiu Song},
  year   = {2026},
  eprint = {2610.18326},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2610.18326v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2610.18326.svg)](https://codeofpaper.com/paper/2610.18326)

Discussion