arXiv (All)
open access
Fixed-Composition Shuffle Asymptotics in the Full-Support Gaussian Regime
We study privacy amplification by shuffling for binary-input local randomizers with a fixed finite output alphabet and full support. For a dataset containing exactly k ones among n users, let T_{n,k} denote the shuffled histogram law. For fixed-composition neighboring shuffled histogram laws in the
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Random Regular Expression Over Huge Alphabets#1358752
- Permutation-invariant social welfare orders are anonymous#103343
- Benchmarking Personally Identifiable Information (PII) Anonymization Strategies for Brazilian Portuguese: From Regex to Hybrid LLM Approaches#1042757
- Stable patterns on permutations of multisets#820362
- Parity and Pattern Detection in Permutation Streams#986669
Record · ID 1399789
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive