A cost of 1 is incurred if the system graph and the goldstandard graph disagree on whether a node (or edge) should be included.
the first component of the loss function max G (score(G) + cost(G; G * )) yields a decoded system graph that is slightly worse thanĜ = arg max G score(G); and the second component max G (score(G) − cost(G; G * )) yields a graph that is slightly better thanĜ.