https://eprint.iacr.org/2015/736.pdf claims to "solve search version of
LWE" in "probabilistic polynomial time".
However, at first glance (see "Theorem 2" on page 7), it's breaking
merely an "LWE oracle" that returns a noisy dot product of the secret
with an input vector. This is trivial and well known (repeat an input
many times and average the results to eliminate the noise) and doesn't
break the version of LWE used in cryptography.
---Dan