We show that any $n$-bit string can be recovered with high probability from $\exp(\widetilde{O}(n^{1/5}))$ independent random subsequences.

翻译：我们显示,任何一美元比特字符串都可以从$\\ exm(\ loblytilde{O}(n ⁇ 1/5})) 美元独立随机子序列中以很高的概率回收。