{"repository":{"description":"Convert an integer factorization problem into a boolean SATISFIABILITY problem.","watchers":1,"stargazers":1,"forks":0,"fork":false,"size":292,"owner":"sjneph","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C++","created_at":"2013-10-15T12:19:19-07:00","pushed_at":"2013-11-13T20:23:24-08:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Shane Neph","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/sjneph/satfactor/compare/b4ac822cb6...600d3837c5"}