Several recent papers have shown that some properties of the maximum weight stable set problem hold true in the more general setting of binary integer programs with two variables per inequality. In this paper, we show that in fact the two problems are equivalent by using the transitive closure of the binary integer program and (possibly) reducing the number of variables by fixing, complementing, or identifying them. We use this equivalence to prove two conjectures made by Johnson and Padberg regarding the perfection of bidirected graphs.