{"push_id":3007462619,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"9b665bf73f82a0f9f9440936f15c07d26c008575","before":"f15262d249d4d046627859280d53cf24aa0c1ba3","commits":[{"sha":"9b665bf73f82a0f9f9440936f15c07d26c008575","author":{"name":"mSengera","email":"e274eeff768c6396088ec6eb091f4bf4d47ab1e0@marvin-sengera.de"},"message":"Basic structure of backtracking","distinct":true,"url":"https://api.github.com/repos/mSengera/Planning-and-Heuristic-Search_Uni-Paderborn/commits/9b665bf73f82a0f9f9440936f15c07d26c008575"}]}
{"actor":{"display_login":"mSengera"}}