Human-LLM Deliberation as Interactive Proof: Conditions for Verifiability Without Transparency

Paper recorded by Signals 4 on 2026-09-21 in cs.CL. Abstract reproduced from arXiv; link to the original below.

Published 2026-09-21 on arXiv · recorded by Signals 4 on 2026-09-22

Category: cs.CL · 自然语言处理 · first seen 2026-09-22

Abstract

When an LLM supplies an argument that a user could not readily construct, how can the user decide whether to accept its claim? Inspired by interactive proofs, we model human-LLM deliberation as an interaction between a prover with unrestricted internal search and a resource-bounded human verifier. The verifier requests and checks supporting details without access to the LLM's internal state. Passe

Read on arXiv →