{"push_id":992264454,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"1f92671a46f86cd0000078822feb04accdb940b3","before":"3f13225bd009892e67ce5ca30383a334afeaab23","commits":[{"sha":"1f92671a46f86cd0000078822feb04accdb940b3","author":{"email":"0185936b848f9d3a9c927d28d9fb98e39dffdc8e@gmail.com","name":"jaymmodi"},"message":"select best m decision trees at every split and finally return the best tree","distinct":true,"url":"https://api.github.com/repos/jaymmodi/DecisionTrees/commits/1f92671a46f86cd0000078822feb04accdb940b3"}]}