The guarantee will be that the \(\ell _p\) -sampling sketch of [1]} generates a sample \(\sim \) , and the Count-Min data structure can recover an approximation
\( \widehat{_1} \approx (x_{\cdot , }) \qquad \text{and}\qquad \widehat{_2} \approx ^{\prime }(\Pr _{}[]). \) 
