{"push_id":645288321,"size":2,"distinct_size":2,"ref":"refs/heads/master","head":"2ad347fb22352b4614b7eea8da9ad8ea2571ac6c","before":"b35f50ea356174bc35ce3cd9b8f7f1f209027c4b","commits":[{"sha":"838c9cb57996332404aaee47a7939ba8e57169cc","author":{"email":"6be22709311687a30a968ca327f806f1e24a262b@rny.cz","name":"Michal Pokorný"},"message":"Prove splay tree theorems by citation","distinct":true,"url":"https://api.github.com/repos/MichalPokorny/thesis/commits/838c9cb57996332404aaee47a7939ba8e57169cc"},{"sha":"2ad347fb22352b4614b7eea8da9ad8ea2571ac6c","author":{"email":"6be22709311687a30a968ca327f806f1e24a262b@rny.cz","name":"Michal Pokorný"},"message":"Mention cache-oblivious limits","distinct":true,"url":"https://api.github.com/repos/MichalPokorny/thesis/commits/2ad347fb22352b4614b7eea8da9ad8ea2571ac6c"}]}