{"push_id":1229526298,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"3ecd45d552b1a91d202b674a02cac535c370246f","before":"a1e3d7cb59cc56c9d6295d698d4292bd402b3b25","commits":[{"sha":"3ecd45d552b1a91d202b674a02cac535c370246f","author":{"name":"Vivian Hare","email":"89b3a8851132f56d654405a94c56f636c6542a18@stanford.edu"},"message":"working on graph similarity algorithm in word2vec.py","distinct":true,"url":"https://api.github.com/repos/vhare/recipe_parser/commits/3ecd45d552b1a91d202b674a02cac535c370246f"}]}
{"actor":{"display_login":"vhare"}}