Diagram uniqueness for highly twisted knots
  Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings. Instead, we consider diagrams enumerated by bridge number, following the lead of Schubert who classified 2-bridge knots in the 1950s. We prove a uniqueness result for this enumeration. Using recent developments in geometric topology, including distances in the curve complex and techniques with incompressible surfaces, we show that infinitely many knot and link diagrams have a unique simple $m$-bridge diagram. Precisely, if $m$ is at least three, if each twist region of the diagram has at least three crossings, and if the length $n$ of the diagram is sufficiently long, i.e., $n>4m(m-2)$, then such a diagram is unique up to obvious rotations. This projection gives a canonical form for such knots and links, and thus provides a classification of these knots or links. 
Yoav Moriah and Jessica S. Purcell
math.GT