{"action":"opened","issue":{"url":"https://api.github.com/repos/mstrimas/prioritizr/issues/5","repository_url":"https://api.github.com/repos/mstrimas/prioritizr","labels_url":"https://api.github.com/repos/mstrimas/prioritizr/issues/5/labels{/name}","comments_url":"https://api.github.com/repos/mstrimas/prioritizr/issues/5/comments","events_url":"https://api.github.com/repos/mstrimas/prioritizr/issues/5/events","html_url":"https://github.com/mstrimas/prioritizr/issues/5","id":183556179,"number":5,"title":"Ready for use?","user":{"login":"jeffreyhanson","id":3610005,"avatar_url":"https://avatars.githubusercontent.com/u/3610005?v=3","gravatar_id":"","url":"https://api.github.com/users/jeffreyhanson","html_url":"https://github.com/jeffreyhanson","followers_url":"https://api.github.com/users/jeffreyhanson/followers","following_url":"https://api.github.com/users/jeffreyhanson/following{/other_user}","gists_url":"https://api.github.com/users/jeffreyhanson/gists{/gist_id}","starred_url":"https://api.github.com/users/jeffreyhanson/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/jeffreyhanson/subscriptions","organizations_url":"https://api.github.com/users/jeffreyhanson/orgs","repos_url":"https://api.github.com/users/jeffreyhanson/repos","events_url":"https://api.github.com/users/jeffreyhanson/events{/privacy}","received_events_url":"https://api.github.com/users/jeffreyhanson/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2016-10-17T23:43:01Z","updated_at":"2016-10-17T23:43:01Z","closed_at":null,"body":"Hi,\r\n\r\nI want to generate prioritisations using the maximum coverage reformulation of the marxan problem, and I was wondering if this package was ready for use?\r\n\r\nCheers,\r\n\r\nJeff"}}
{"actor":{"display_login":"jeffreyhanson"}}