{"repository":{"description":"A program to find the GCD of two umbers using the Euclidean algorithm","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":76,"owner":"Felttrip","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"C","created_at":"2013-10-08T11:22:36-07:00","pushed_at":"2013-10-08T15:16:11-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Nate Thompson","location":"Columbia, Missouri","email":"1a73af9e7ae00182733b2292511b814be66f065f@NathanielThompson.info"},"url":"https://github.com/Felttrip/Euclidean_Algorithm/compare/3ddedcf008...d22fd844e3"}