Justification logics involving \(?\) were the first examples that went beyond sublogics of \({\textsf{LP}}\). More recently it has been discovered that there is an infinite family of modal logics that have justification counterparts, but for which the connection with arithmetic proofs is weak or missing. We discuss a single case in some detail, and sketch others.