用编译器逻辑构建可审计的内容治理系统，防止虚假信息流入知识库。
CANONIC: Governance Is Compilation
- 借鉴编译器语法、作用域、类型系统设计内容准入规则
- 实测显示无法通过结构检查过滤虚假文本，因‘混乱’非算法可计算属性
- 适合需要全程可追溯的知识库建设者和内容审核机构
我们提出CANONIC：一种将数字成果以证据链形式规模化编译的治理智能。大语言模型生成文本的速度远超人工核查能力，这一现象被牛津词典称为‘slop’，并列为2025年度词汇。CANONIC通过类似编译器的机制判断内容是否符合准入标准——基于语法、在边界处进行机械式验证。治理遵循三个公理（三元组、继承、内省），分别对应编译理论中的语法层、作用域解析层与类型系统层，准入判定为可判定且线性时间完成。我们通过预注册跨平台基准测试，在四种情境下验证：结构化准入能否有效排除slop。结果表明：仅靠文本结构无法可靠区分可信与不可信内容。slop并非算法可计算属性，而是领域专家的判断结论。因此，治理层不负责判定slop，而是确保记录可审计——每项声明均锚定定义、提交记录与证据窗口，实现端到端可复现、可核查。
原文摘要 · Abstract (English)
We present CANONIC: governed intelligence that compiles digital artifacts into an evidence ledger at scale. Large language models generate prose faster than anyone can check it, the failure Oxford Languages named 'slop', its 2025 Word of the Year. CANONIC governs whether content may enter a corpus the way a compiler decides whether a program is well-formed: mechanically, by a grammar, at the boundary of admission. Governance reduces to three axioms (Triad, Inheritance, Introspection) that map one-to-one onto compiler theory's syntax, scope-resolution, and type-system layers, and admission is a decidable, linear-time check. We then ask, with a pre-registered cross-provider benchmark across four regimes, whether structural admission keeps slop out. It does not: no prose-reading gate reliably separates reliable from unreliable content. Slop is not a property an algorithm computes. It is a verdict of domain expertise. So a governance layer does not decide slop; it keeps the record auditable -- every claim anchored to a definition, a commit, and an evidence window, reproducible and checkable end to end.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。