> To be clear though, it does not imply that NP is subexponential

Is there a subset of NP problems for which a subexponential algorithm would witness the entire NP class being subexponential?