Then, each net in the structure is identified by its dimensionality (one, two or threedimensional) and a unique identifier, its topological genome: it is a finite series of integers, such as 3 1 2 0 0 0 1 2 0 0 1 1 2 0 1 0 1 2 1 0 0 for the diamondoid (dia) net. This genome is provably unique for each net, only depends on the net itself and not its representation, and can be computed in polynomial time of the size of the net. In previous versions of CrystalNets.jl, some unstable nets could not be assigned a unique genome: this happened when at least two vertices, in their equilibrium placement, have the same position -we refer the interested reader to Ref. 11 for more details on this. In the latest version, we introduced a new algorithm to uniquely identify unstable nets. However, this algorithm is factorial in complexity, while our algorithm for the general case is polynomial. Therefore, the algorithm is too slow to be used for some very large unstable nets: this accounted for 78 out of 170455 structures.