标题： 认知战争中的验证成本不对称性：一个复杂性理论框架 显示英文标题

标题： Verification Cost Asymmetry in Cognitive Warfare: A Complexity-Theoretic Framework

摘要： 在对抗性信息流下的人员验证作为一种受工作记忆限制和认知偏差约束的成本有限的决策过程。 我们引入了验证成本不对称性（VCA）系数，将其形式化为在相同声明分布下不同群体之间预期验证工作的比率。 基于概率可检查证明（PCP）和参数化复杂性理论，我们构建了传播协议，将对可信受众的验证降低到恒定的人工努力，同时对缺乏密码基础设施的对抗性群体施加超线性成本。 我们证明了这种不对称性的理论保证，通过受控用户研究验证了该框架，测量了在有无可抽查来源情况下的验证努力，并展示了对现实世界信息活动的实际编码。 结果确立了认知战争中工程民主优势的复杂性理论基础，具有立即应用于内容认证、平台治理和信息作战教义的潜力。 显示英文摘要

摘要： Human verification under adversarial information flow operates as a cost-bounded decision procedure constrained by working memory limits and cognitive biases. We introduce the Verification Cost Asymmetry (VCA) coefficient, formalizing it as the ratio of expected verification work between populations under identical claim distributions. Drawing on probabilistically checkable proofs (PCP) and parameterized complexity theory, we construct dissemination protocols that reduce verification for trusted audiences to constant human effort while imposing superlinear costs on adversarial populations lacking cryptographic infrastructure. We prove theoretical guarantees for this asymmetry, validate the framework through controlled user studies measuring verification effort with and without spot-checkable provenance, and demonstrate practical encoding of real-world information campaigns. The results establish complexity-theoretic foundations for engineering democratic advantage in cognitive warfare, with immediate applications to content authentication, platform governance, and information operations doctrine.