In this work, we propose a novel framework for graph canonisation called Hyperset Individualisation, using
bisimulation on a set-theoretic framework in an effort to tackle the Graph Isomorphism problem on simple
graphs. Building on this idea, we define algorithm HID, which we prove to be strictly more expressive than
colour refinement. Moreover, we define two versions of a k-dimensional HID, which we prove to have different
expressive power.
