{"action":"closed","issue":{"url":"https://api.github.com/repos/OICR/PGMLab/issues/12","repository_url":"https://api.github.com/repos/OICR/PGMLab","labels_url":"https://api.github.com/repos/OICR/PGMLab/issues/12/labels{/name}","comments_url":"https://api.github.com/repos/OICR/PGMLab/issues/12/comments","events_url":"https://api.github.com/repos/OICR/PGMLab/issues/12/events","html_url":"https://github.com/OICR/PGMLab/issues/12","id":152561078,"number":12,"title":"Make it so that pgmlab splits up nodes that have more than n parents","user":{"login":"a8wright","id":668955,"avatar_url":"https://avatars.githubusercontent.com/u/668955?v=3","gravatar_id":"","url":"https://api.github.com/users/a8wright","html_url":"https://github.com/a8wright","followers_url":"https://api.github.com/users/a8wright/followers","following_url":"https://api.github.com/users/a8wright/following{/other_user}","gists_url":"https://api.github.com/users/a8wright/gists{/gist_id}","starred_url":"https://api.github.com/users/a8wright/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/a8wright/subscriptions","organizations_url":"https://api.github.com/users/a8wright/orgs","repos_url":"https://api.github.com/users/a8wright/repos","events_url":"https://api.github.com/users/a8wright/events{/privacy}","received_events_url":"https://api.github.com/users/a8wright/received_events","type":"User","site_admin":false},"labels":[],"state":"closed","locked":false,"assignee":null,"assignees":[],"milestone":{"url":"https://api.github.com/repos/OICR/PGMLab/milestones/2","html_url":"https://github.com/OICR/PGMLab/milestones/pgmlab-core","labels_url":"https://api.github.com/repos/OICR/PGMLab/milestones/2/labels","id":1742514,"number":2,"title":"pgmlab-core","description":"This is the server side code that runs loopy belief propagation\r\n","creator":{"login":"a8wright","id":668955,"avatar_url":"https://avatars.githubusercontent.com/u/668955?v=3","gravatar_id":"","url":"https://api.github.com/users/a8wright","html_url":"https://github.com/a8wright","followers_url":"https://api.github.com/users/a8wright/followers","following_url":"https://api.github.com/users/a8wright/following{/other_user}","gists_url":"https://api.github.com/users/a8wright/gists{/gist_id}","starred_url":"https://api.github.com/users/a8wright/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/a8wright/subscriptions","organizations_url":"https://api.github.com/users/a8wright/orgs","repos_url":"https://api.github.com/users/a8wright/repos","events_url":"https://api.github.com/users/a8wright/events{/privacy}","received_events_url":"https://api.github.com/users/a8wright/received_events","type":"User","site_admin":false},"open_issues":1,"closed_issues":1,"state":"open","created_at":"2016-05-02T14:04:58Z","updated_at":"2016-07-20T18:52:56Z","due_on":null,"closed_at":null},"comments":1,"created_at":"2016-05-02T14:09:56Z","updated_at":"2016-07-20T18:52:56Z","closed_at":"2016-07-20T18:52:56Z","body":"The problem is that the algorithm uses an exponential amount of memory when storing the CPT for each node. This increases with the number of parents. We would like to devise a way to have PGMLab handle these circumstances automatically (without the user needing to be aware). "}}
{"actor":{"display_login":"a8wright"}}