---
格式版本: 2
标题: "How to Verify Consistency of Probabilistic Claims"
原文链接: "https://arxiv.org/abs/2608.11181"
发布日期: "2026-08-11"
发布时间校准状态: "found"
发布时间需复核: "否"
发布时间来源: "rule:local:strict_original_body"
发布时间证据: "**\\[v1\\]** Tue, 11 Aug 2026 17:41:39 UTC (81 KB)"
发布时间校准原因: "规则确认唯一严格发布时间，来源 local:strict_original_body"
发布时间校准置信度: "high"
发布时间候选数量: 18
发布时间严格候选数量: 6
发布时间原页读取状态: "source template page reused from URL open"
发布时间未找到原因: ""
发布时间校准时间: "2026-08-12T10:58:16+08:00"
发布时间仲裁状态: "skipped"
发布时间仲裁尝试次数: 0
发布时间仲裁耗时毫秒: 0
发现时间: "2026-08-12T10:57:49+08:00"
入库时间: "2026-08-12T02:58:16.665Z"
来源平台: "arXiv 学术论文搜索"
搜索渠道: "source_template"
搜索词: "https://arxiv.org/search/?query=Oracle&searchtype=all"
匹配关键词:
  - "AI"
相关厂家:
  - "Oracle"
相关专家:
  []
内容类型: "网页"
抓取工具: "Free Fetch + Defuddle"
清洗工具: "Defuddle Markdown + Defuddle/Readability 正文提取"
原始附件:
  []
AI优质: "否"
AI打分: 0
AI分档: "非优质"
AI质检状态: "不通过"
AI打分理由: "论文内容为概率一致性验证的复杂性理论，与超节点/AI Rack/机柜级AI基础设施完全无关。"
AI质检模型: "ali-deepseek-v4-flash"
AI质检时间: "2026-08-12T10:58:20+08:00"
AI主题相关性: 0
AI来源权威性: 0
AI新颖性: 0
AI技术细节: 0
AI商业部署信号: 0
AI完整性: 0
采集批次: "2026年8月12日2点04分20秒"
采集批次ID: "20260812-020420-289"
去重键: "https://arxiv.org/abs/2608.11181"
---

## Computer Science > Computational Complexity

## Title:How to Verify Consistency of Probabilistic Claims

[View PDF](https://arxiv.org/pdf/2608.11181) [HTML (experimental)](https://arxiv.org/html/2608.11181v1)

> Abstract:When a probabilistic predictor answers many conditional-probability queries, are its answers self-consistent, and can this be verified in polynomial time? This problem is of interest for AI safety, where safety is derived from honesty about probabilistic predictions of unwanted outcomes potentially caused by an AI action. We construct an interactive PCP as follows. Let a predictive model be specified by a probability circuit P and a circuit Q which outputs confidence in predictions. Together, P and Q implicitly specify exponentially many probabilistic claims. We show a protocol in which a polynomial-time verifier can verify the approximate consistency of (P,Q). The verifier is given the pair of circuits (P,Q), which it evaluates at only a few points; alongside them it is given a proof oracle, an encoding of a witnessing probability distribution allegedly consistent with the predictions of (P,Q), which it reads at a few locations while interacting with a single untrusted prover. En route, we must ensure the existence of a sparse witnessing distribution consistent with the model's predictions. To do so, we first consider witness distributions for the consistency of explicit probabilistic claims, rather than claims specified by a predictor: say m claims, each of the form Pr\[Y = 1 | X = x\] = p, over n Boolean variables. Building on work initiated by Nilsson (Artif. Intell., 1986), we place l\_2-approximate probabilistic consistency of explicit claims in NP, with certificates of length O(mn + log B) in the input bit-precision B; we further show how a small additive completeness-soundness gap removes the dependence on B. Together these results provide a complexity-theoretic foundation for certifying the self-consistency of probabilistic predictors. We view our interactive PCP as a first step toward training predictive models to prove their own consistency.

| Subjects: | Computational Complexity (cs.CC); Artificial Intelligence (cs.AI); Machine Learning (cs.LG) |
| --- | --- |
| Cite as: | [arXiv:2608.11181](https://arxiv.org/abs/2608.11181) \[cs.CC\] |
|  | (or [arXiv:2608.11181v1](https://arxiv.org/abs/2608.11181v1) \[cs.CC\] for this version) |
|  | [https://doi.org/10.48550/arXiv.2608.11181](https://doi.org/10.48550/arXiv.2608.11181) |

## Submission history

From: Orr Paradise \[[view email](https://arxiv.org/show-email/2d0e1079/2608.11181)\]  
**\[v1\]** Tue, 11 Aug 2026 17:41:39 UTC (81 KB)

[Which authors of this paper are endorsers?](https://arxiv.org/auth/show-endorsers/2608.11181) | Disable MathJax ([What is MathJax?](https://info.arxiv.org/help/mathjax.html))
