AI & ML
PIVOT: Distribution-Preserving Multi-BitWatermarking with Minimax-Optimal Scoring
arXiv cs.CR0 views
arXiv:2611.24109v1 Announce Type: new Abstract: As LLM-generated content becomes increasingly widespread, reliable attribution calls for multi-bit watermarks that embed recoverable messages without distorting the output distribution. We introduce PIVOT, a multi-bit watermark with model-free verification based on mirrored rank-interval sampling. At each generation step, PIVOT uses a keyed pseudorandom scalar and a secret permutation of the vocabulary. The message bit determines whether next-token probability intervals are arranged in forward or reverse secret-rank order. Sampling from these mirrored layouts preserves every token probability exactly while inducing an opposite-signed dependence between the scalar and the sampled token's secret rank. This dependence yields a pivotal rank statistic whose null distribution is invariant to the unknown next-token law, enabling model-free calibration and decoding. We formulate joint watermark detection and message recovery as a multiple-hypothesis testing problem, derive a moment-robust minimax-optimal detection score over a relaxed moment class, and establish finite-sample recovery guarantees. Extensive experiments on two representative large language models validate the effectiveness of PIVOT, demonstrating reliable watermark detection and message recovery while preserving the generator's output distribution.
Source:https://arxiv.org/abs/2611.24109PreviousIntent Contracts: Taking Tools Away from AgentsNextEvaluating LIM Trading Agents: A Critical Review of Backtesting Validity and Reporting Practices
Related posts

LiberNovo’s Black Friday sale takes up to 42% off ergonomic chairs
09to5Mac

WhatsApp is raising group chat limit to 1,500 participants
09to5Mac
Who called me about stolen ID and loans? Handle it like an unauthenticated security alert
0dev.to
Gemini 4 Models Compared on Reasoning, Coding, and Context
0dev.to
Beyond Frozen Weights: How Test-Time Training (TTT) Turns Inference into Live Learning
0dev.to

Why Turn-Based Voice AI Feels Broken: Building a 52ms Barge-In Loop (HardCall)
0dev.to