Can Q-learning with graph networks learn a generalizable branching heuristic for a SAT solver? 著者: Kurin, V, Godil, S, Whiteson, S, Catanzaro, B