Optimal Multi-bit Generative Watermarking Schemes Under Worst-Case False-Alarm Constraints
2026-04-13T08:51:51Z•394b16c60c727881f0d67a5b5e1d57d1927c45567bb1e68cc0a7fe9fd50be670
admixed-arrayscauchy-noisecoding-theorycombinatoricsdifferential-privacydynamical-samplinggenerative-watermarkinghigh-altitude-platforms (HAP)holographic-beamforminghull-embeddingsinterference-detectionlanguage-modelslinear-codesmulti-agent-systemsmulti-task-learningnear-fieldone-shot-detectionprony-methodrate-distortionrealisation-level-accountingsemantic-communicationspectral-recoveryvirtual-point-sourcewatermarkingxl-mimo
What happened
Collection of new arXiv submissions (math/IT) covering theory and algorithms across generative watermarking for LLMs, coding theory, wireless/ML signal processing, and privacy accounting. Highlights: a corrected optimal multi-bit generative watermarking theory with two constructions that attain a finite-token lower bound via an LP formulation; exact shortest hull-embedding lengths and constructive algorithms for linear codes over finite fields; a holographic beamforming paradigm with a Virtual Point Source (VPS) method for non-iterative near-field XL‑MIMO design; analysis of one-shot detection
Why it matters
A reviewed impact interpretation has not been published for this record.
Evidence and limitations
- Source ID
- arxiv_math_it
- Record identifier
- 394b16c60c727881f0d67a5b5e1d57d1927c45567bb1e68cc0a7fe9fd50be670
- Enrichment time
- 2026-04-13T08:51:51Z
- AI-assisted enrichment
- Yes
This record may overlap with other records. Its enrichment can be incomplete or wrong, and machine assistance was used. Validate consequential decisions against the linked source and your own environment.