{"repository":{"description":"Finding shortest generators of permutations (using (2 1 3 ... n) and (2 3 ... n 1)).","watchers":0,"stargazers":0,"forks":0,"fork":false,"size":184,"owner":"isturdy","private":false,"open_issues":0,"has_issues":true,"has_downloads":true,"has_wiki":true,"language":"Haskell","created_at":"2013-05-04T17:21:54-07:00","pushed_at":"2013-05-20T13:44:40-07:00","master_branch":"master"},"actor_attributes":{"type":"User","name":"Ian Sturdy","blog":"http://blog.iansturdy.com","location":"Virginia","email":"da39a3ee5e6b4b0d3255bfef95601890afd80709"},"url":"https://github.com/isturdy/permGen/compare/8694c7c96e...2c969679b5"}