History
No superpolynomial lower bound has been proven for any NP problem in a general model of computation.
Claim entered the graph
Nothing has happened to this claim yet beyond its creation: no assessments, contributions, or decisions are on record.