“…[1, 4, 7], [2, 1, 3], [5,4,2,3,6], [5,6,7] Crossings around B-faces: [4,5,7], [5,6], [6,3,1,7] Edges around A-faces: [14,4,10], [8, 1, 3], [12,5,9,2,7], [13,6,11] Edges around B-faces: [4, 1, 9], [2, 8], [10,5,13], [6,12], [11,7,3,14] D G [n] and find a Gauss code D G [n][K] for a reduced alternating diagram of K . Then we clean up this data by replacing each Gauss code with its reduced form.…”