arXiv cs.CY· Torsten Olivi Tiltack, Yifei Dong, Kun Yu, Xu Wang, Wei Liu, Jianlong Zhou, Ren Ping Liu, Fang Chen·· 13 小时前AI 评分24
PAC-2026 发布 Publication Authority：为 AI 辅助主张建立可证伪的发布记录协议
Making AI-Assisted Claims Independently Challengeable: Publication Authority and a Protocol for Falsifiable Publication Records
AI 导读
PAC-2026 提出 Publication Authority 机制，一种精确状态、不可转移、单次使用的发布能力，其 SF-4 规范定义证据、运行与产物、测量披露、授权、表面一致性和生命周期连续性六项不可补偿义务。
正文 · 原文
Abstract:AI-assisted claims can appear authoritative when evidence, analysis, human authorization, presentation, and correction history describe different states. We develop Publication Authority: an exact-state, non-transferable, single-use publication capability within PAC-2026 (Publication-Accountability Calculus), an AIJIM Protocol candidate. The evaluated specification version (SF-4) defines six non-compensating obligations: evidence, runs and artifacts, measurement disclosure, authorization, surface correspondence, and lifecycle continuity. Each yields a target-bound witness, localized counterexample, or localized unverifiability. Only a fresh, complete all-pass record derives a permit consumed by one atomic publication transition. Ten models explored 110,764 distinct safe reachable states; 76 unsafe configurations yielded the expected violation or observer countermodel. A surface passing its correspondence check cannot authorize publication unless admitted by the accepted record. SF-4 separates evidence horizon from verification time and rejects authentic but causally invalid authorization. An in-house, instance-blind study (G7-B) matched 183 scored expectations after shared integration. Three author-led native comparisons identify gaps in a constructed in-toto/OPA profile: measurement-state admission, proof-expiry evaluation, and required-run identity. Repairs restore parity on the tested cases. An exploratory extension constructs exact claim-edit regions under existing e-closure semantics: a minimum retained core qualifies every permitted selection. For the full hypothesis universe (U=H), a quadratic frontier computes all strongest-core sizes. Enumeration and native controls distinguish reusable statistical qualification from the fresh publication authority each candidate requires. Results yield transferable protection rules; independent conformance and field evaluation remain open.
| Comments: | Updated with claim-edit regions, three native protection diagnostics, and a separate-team implementation inventory; original SF-4 results unchanged. Main article: 28 pages, 4 figures; supplementary material: 21 pages. Preprint; not peer-reviewed. Yifei Dong is the corresponding author |
| Subjects: | Artificial Intelligence (cs.AI); Cryptography and Security (cs.CR); Computers and Society (cs.CY) |
| Cite as: | arXiv:2609.17631 [cs.AI] |
| (or arXiv:2609.17631v2 [cs.AI] for this version) | |
| https://doi.org/10.48550/arXiv.2609.17631 arXiv-issued DOI via DataCite |
Submission history
From: Torsten Olivi Tiltack [view email]
[v1]
Tue, 15 Sep 2026 10:10:50 UTC (472 KB)
[v2]
Wed, 21 Oct 2026 07:48:53 UTC (496 KB)
来源：arXiv cs.CY · arxiv.org