The Binary Tree Mechanism is Optimal for Approximate Differentially Private Continual Counting
DGX agentarXiv:2607.00876v1 Announce Type: cross Abstract: Private continual counting is a fundamental problem in differential privacy: given a binary stream of length n, where each 1 corresponds to the contri