More than 40 years ago, Galvin, Rival, and Sands showed that every Ks,s-free graph containing an n-vertex path must contain an induced path of length f(n), where f(n)→∞ as n→∞. Recently, it was shown by Duron, Esperet, and Raymond that one can take f(n) = (log log n)1/5-o(1). In this note, we give a short self-contained proof that a Ks,s-free graph with an n-vertex path contains an induced path of length at least (log log n)1-o(1). Combined with the recent remarkable example of Couëtoux, Defrain, and Raymond, which provides an upper bound of O((log log n)1+o(1)), this essentially resolves this old problem.