{"push_id":2933746618,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"742c4666ed1b320788351a68ac380e3843cc5743","before":"b6ea9de7824f51861248ef0a5bd905a52962ba8a","commits":[{"sha":"742c4666ed1b320788351a68ac380e3843cc5743","author":{"name":"cyunguo@umich.edu","email":"75181267705bdd3eb3ab8e2da72cbab080f3ac4f@umich.edu"},"message":"\"path.csv:fixed\"","distinct":true,"url":"https://api.github.com/repos/tc-imba/q-learning-shortest-path-with-relay/commits/742c4666ed1b320788351a68ac380e3843cc5743"}]}
{"actor":{"display_login":"cyunguo"}}