Tag
This paper presents IsalHG, a method to represent any finite connected hypergraph as a string over a compact instruction alphabet, decoded by a virtual machine. It introduces a canonical string conjecture for hypergraph isomorphism and benchmarks against established methods.