SimpleMark: Fast Multi-Bit Text Watermarking under f -Divergence Constraints 44Q2H3DWNW
| URI | m2://res/44Q2H3DWNW |
|---|---|
| Kind | preprint |
| Creators | Benjamin D. Kim, Wanrong Zhang, Weitong Ruan, Lav R. Varshney, Daniel Alabi |
| Date | 2026-10-05 |
| Subjects | arxiv cs.CR, arxiv cs.AI, arxiv cs.IT, arxiv math.IT |
| Scope | border |
Expressions
e1: version, preprint
| Date | 2026-10-05 |
|---|---|
| Ids | arXiv 2610.05712 |
Items in this resource
The mentions of the inventory that name this resource. Each name links to the card of its inventory row.
| Item | Kind | Where | Source |
|---|---|---|---|
| Achievability in the idealized induced DMC model | statement | theorem 3 | arxiv |
| Per-key constrained embedding channel | definition | definition 3 | arxiv |
| Universal single-letter constrained capacity | definition | definition 5 | arxiv |
| Uniform sequence-level TV guarantee | statement | corollary 1 | arxiv |
| Uniform per-key $\varepsilon$-TV distortion | definition | definition 1 | arxiv |
| Average-key distortion-freeness can be highly detectable | statement | proposition 4 | arxiv |
| Feasible per-key channel family | definition | definition 2 | arxiv |
| Rate vanishes as $\varepsilon\to 0$ | statement | proposition 1 | arxiv |
| Sequence-level TV bound from uniform per-step TV control | statement | lemma 1 | arxiv |
| Uniform per-key distortion-freeness | statement | proposition 2 | arxiv |
| QNMMBZWAVG | statement | theorem 1 | arxiv |
| Converse under uniform per-key TV constraint | statement | theorem 2 | arxiv |
| Single-letter per-time constrained capacity | definition | definition 4 | arxiv |
| ZTACG9MXXW | statement | proposition 3 | arxiv |
Catalogue records
- arxiv: 2610.05712 (work)