
























Abstract:Online-safety regulation under the UK Online Safety Act and the EU Digital Services Act increasingly treats scalar metrics as compliance evidence. Once announced, such a metric also becomes an optimization target: a strategic platform can improve its score by routing recommendations through semantically equivalent content variants, without reducing true harm. We ask when such an audit metric can still certify a genuine reduction in harm. The protocol is modeled as a published transformation graph whose connected components form semantic classes, and the metric itself is treated as a security object. Three results follow. First, any metric that scores variants directly is manipulable as soon as two equivalent variants in a harmful class disagree in score. Second, the semantic-envelope lift, which assigns each variant the maximum score in its class, is the unique pointwise minimum among conservative classwise-constant repairs. Third, a class-stratified certificate, $H^\star(x) \le (1/\hat\alpha) M_{\mathrm{Env}(m)}(x) + \bar\eta$, holds for every platform strategy, with $\bar\eta$ absorbing annotation and protocol error. We check the claims at three levels: exhaustive enumeration on a finite-state grid of mixed strategies, an SMT encoding in Z3 cross-replayed in cvc5, and a bounded single-player MDP encoded in PRISM-games. The fragile metric fails manipulation invariance and cannot support the same useful predeclared class-coverage certificate; under the envelope-level certificate, it produces large violations at every tested instance, with a large mean gaming gap across random catalogs at a fixed audit budget. The semantic-envelope metric exhibits no such violation in the tested instances.
| Subjects: | Cryptography and Security (cs.CR); Computers and Society (cs.CY); Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.06324 [cs.CR] |
| (or arXiv:2605.06324v1 [cs.CR] for this version) | |
| https://doi.org/10.48550/arXiv.2605.06324 arXiv-issued DOI via DataCite (pending registration) |
From: Florian Burnat [view email]
[v1]
Thu, 7 May 2026 14:22:21 UTC (94 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。