{"action":"opened","issue":{"url":"https://api.github.com/repos/convexengineering/network/issues/1","repository_url":"https://api.github.com/repos/convexengineering/network","labels_url":"https://api.github.com/repos/convexengineering/network/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/convexengineering/network/issues/1/comments","events_url":"https://api.github.com/repos/convexengineering/network/issues/1/events","html_url":"https://github.com/convexengineering/network/issues/1","id":297586961,"number":1,"title":"Solving the Minimum Spanning Tree Problem","user":{"login":"1ozturkbe","id":15684191,"avatar_url":"https://avatars0.githubusercontent.com/u/15684191?v=4","gravatar_id":"","url":"https://api.github.com/users/1ozturkbe","html_url":"https://github.com/1ozturkbe","followers_url":"https://api.github.com/users/1ozturkbe/followers","following_url":"https://api.github.com/users/1ozturkbe/following{/other_user}","gists_url":"https://api.github.com/users/1ozturkbe/gists{/gist_id}","starred_url":"https://api.github.com/users/1ozturkbe/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/1ozturkbe/subscriptions","organizations_url":"https://api.github.com/users/1ozturkbe/orgs","repos_url":"https://api.github.com/users/1ozturkbe/repos","events_url":"https://api.github.com/users/1ozturkbe/events{/privacy}","received_events_url":"https://api.github.com/users/1ozturkbe/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2018-02-15T20:32:46Z","updated_at":"2018-02-15T20:32:46Z","closed_at":null,"author_association":"CONTRIBUTOR","body":"To keep track of what has been tried. \r\nApproaches:\r\n\r\n- [ ] Alternative objective functions: sums and products of connectivity and flows\r\n- [ ] Sequential GP, pruning edges with no connectivity through substitutions. \r\n- [ ] Dynamic GP? (Need to flesh this idea out.)\r\n"}}
{"actor":{"display_login":"1ozturkbe"}}