The class of near-testable sets, NT, was defined by Goldsmith, Joseph, and Young. They noted that $P\subseteq NT\subseteq PSPACE$, and asked whether P=NT. This note shows that NT shares the same $m$-degree as the parity-based complexity class $⨁P$ (i.e., $NT\equiv mp\oplus P$) and uses this to prove that relative to a random oracle $A,PA\ne NTA$ with probability one. Indeed, with probability one, $NTA-(NPA\bigcup coNPA)\ne 0$.