Komargodski and Weinstein base security on hardness assumptions about batches of low-rank random linear equations, and list PoUW "from more standard or well-studied assumptions" as an open problem 1. Pearl's floating-point variant introduces a further "quantized-subspace hardness" assumption 2.