Before revision:  Our techniques also give algorithms for F_p moment estimationwith p>2 on arbitrary order insertion-only and turnstile streams, using \frac{1{\varepsilon^{4/p}}\cdot n^{1-2/p}} bits of space and two passes, which is the first optimal multi-pass F_p estimation algorithm up to \log n factors.
After revision:  Our techniques also give algorithms for F_p moment estimationwith p>2 on arbitrary order insertion-only and turnstile streams, using \frac{1{\varepsilon^{4/p}}\cdot n^{1-2/p}} of data streams, Ben-Eliezer et. al. (PODS 2020, best paper award) show how to convert a non-robust algorithm into a robust one with a roughly 1/\varepsilon factor overhead. This was subsequently improved to a 1/\sqrt{\varepsilon the first optimal multi-pass F_p estimation algorithm up to \log n factors.