ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “expert verification”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.CRcs.AIcs.MARecentApr 5, 2026

The Art of Building Verifiers for Computer Use Agents

Corby Rosset, Pratyusha Sharma, Andrew Zhao, Miguel Gonzalez-Fernandez +1 more

The paper introduces the Universal Verifier, a robust system for verifying computer use agent (CUA) trajectories, which significantly improves reliability and agreement with human judgment compared to…

View →
cs.AIcs.CRcs.IRRecentApr 3, 2026

AutoVerifier: An Agentic Automated Verification Framework Using Large Language Models

Yuntao Du, Minh Dinh, Kaiyuan Zhang, Ninghui Li

AutoVerifier is an LLM-based agentic framework that automates the end-to-end verification of complex technical claims, enabling non-experts to generate evidence-backed intelligence assessments.

View →
cs.CRcs.LOcs.MARecentMay 19, 2026

Pramana: A Protocol-Layer Treatment of Claim Verification in Autonomous Agent Networks

Ravi Kiran Kadaboina

Pramana introduces a standardized, protocol-level wire format for autonomous agent outputs, ensuring that every consequential claim is accompanied by a verifiable artifact that can be re-executed by a…

View →
cs.AIcs.CLcs.LGEmpiricalRecentJul 6, 2026

LLM-as-a-Verifier: A General-Purpose Verification Framework

Jacky Kwok, Shulu Li, Pranav Atreya, Yuejiang Liu +5 more

This paper introduces LLM-as-a-Verifier, a framework for fine-grained verification of LLMs using continuous scores, achieving state-of-the-art performance on various benchmarks.

View →
cs.CRcs.AIcs.MARecentMay 1, 2026

Skills as Verifiable Artifacts: A Trust Schema and a Biconditional Correctness Criterion for Human-in-the-Loop Agent Runtimes

Alfredo Metere

The paper proposes a trust schema and verification framework to ensure that agent skills, which augment LLMs, are rigorously verified before deployment, thereby making human-in-the-loop oversight scal…

View →
cs.CRcs.ARcs.CLRecentMay 24, 2026

RouteScan: A Non-Intrusive Approach to Auditing MoE LLMs Safety via Expert Routing Telemetry

Bo Lv, Zhiheng Xu, KeDong Xiu, Ruyi Ding +3 more

RouteScan introduces a non-intrusive framework that audits the safety of Mixture-of-Experts (MoE) LLMs by analyzing low-level GPU expert routing telemetry, achieving high accuracy even on unseen harmf…

View →
cs.LGcs.AIcs.CLRecentMay 28, 2026

Self-Trained Verification for Training- and Test-Time Self-Improvement

Chen Henry Wu, Aditi Raghunathan

The paper proposes Self-Trained Verification (STV), a novel method that trains verifiers to catch self-generated errors by leveraging reference solutions, significantly boosting performance in both te…

View →
cs.LGcs.CRTheoreticalRecentJul 23, 2026

Agree on the Model, Verify the Inference: GKR Protocols for HND-Based Transformer Inference

Xiaolong Liang, Juanjuan Li, Rui Qin, Yisheng Lv

This paper introduces GKR-HND, a protocol for verifying the polynomial backbone of Homomorphic--Nonhomomorphic Decomposition Transformers, allowing delegated computation while ensuring model security.

View →
cs.AIEmpiricalRecentJun 23, 2026

When CQs Go Wrong: Challenges in CQ Verification with OE-Assist

Anna Sofia Lippolis, Mohammad Javad Saeedizade, Robin Keskisärkkä, Aldo Gangemi +2 more

This paper investigates the challenges of Competency Questions (CQs) in CQ-verification and proposes solutions to enhance users' performance.

View →
cs.AIRecentMay 31, 2026

Diagnosing LLM Arbitration Behavior over Pre-evidence Epistemic States in RAG-based Fact-Checking

Yuxi Sun, Wenbo Shang, Wei Gao, Xin Huang +1 more

The paper introduces a diagnostic testbed, PAVE, to evaluate how LLMs arbitrate between their internal knowledge and retrieved evidence during fact-checking, revealing that this arbitration is unrelia…

View →
cs.LOcs.CLcs.CRRecentMay 13, 2026

Proof-Carrying Certificates for LLM Pipelines: A Trust-Boundary Architecture

George Koomullil

The paper proposes a trust-boundary architecture using Lean 4 to verify the deterministic structured computations surrounding LLM pipelines, providing verifiable certificates for high-stakes deploymen…

View →
cs.LGcs.AIcs.CVRecentJun 1, 2026

Rethinking Evaluation Paradigms in IBP-based Certified Training

Konstantin Kaulen, Hadar Shavit, Holger H. Hoos

The paper proposes evaluating certified training methods by comparing their Pareto fronts across the natural-certified accuracy trade-off, revealing superior performance and previously unappreciated c…

View →
cs.LOcs.CEcs.ETRecentJun 1, 2026

Federated Formal Verification: Cross-Backend Citation, Cross-Axis Convergence, and AI-Orchestrated Proof Dispatch for Production Systems

Pierre Falda

The paper proposes a federated formal verification architecture that treats verification as a polyglot proof system, successfully validating it on complex production subsystems like a Raft consensus m…

View →
cs.PLcs.CRRecentMay 29, 2026

Neuroforger: certified violation witnesses for smart contracts verification via LLMs

Massimo Bartoletti, Enrico Lipparini

The paper introduces Neuroforger, a system that combines a new formal specification language with LLMs and type checking to reliably generate and validate concrete violation witnesses (counterexamples…

View →
cs.AIRecentMay 28, 2026

FinVerBench: Benchmark Validity and Calibration in Large Language Model Financial Statement Verification

Silu Panda

The paper introduces FinVerBench, a comprehensive benchmark for financial statement verification, concluding that successful verification requires calibrated judgment under realistic observational con…

View →
cs.CRcs.AIcs.CLRecentMay 25, 2026

TTPrint: Evidence-Grounded TTP Extraction via Diverge-then-Converge Verification

Yutong Cheng, Changze Li, Raihan Sultan Pasha Basuki, Qian Cui +2 more

TTPrint proposes a novel diverge-then-converge framework for extracting MITRE ATT&CK techniques from CTI reports, significantly improving both recall and precision compared to existing methods.

View →
cs.AIcs.CCcs.CRTheoreticalRecentJul 3, 2026

How to Avoid Debate: Scalable AI Safety via Doubly-Efficient Interactive Proofs

Liyan Chen, Yael Tauman Kalai, Zoe Xi

This paper introduces doubly-efficient single-prover interactive proofs and arguments for oracle-aided computations in AI safety.

View →
cs.GTcs.DSTheoreticalRecentJul 9, 2026

Algorithmic Expert Aggregation

Wei Tang, Hanrui Zhang

This paper studies the problem of aggregating calibrated Bayesian experts into a new calibrated expert.

View →