{"action":"created","issue":{"url":"https://api.github.com/repos/rreusser/summation-algorithms/issues/1","repository_url":"https://api.github.com/repos/rreusser/summation-algorithms","labels_url":"https://api.github.com/repos/rreusser/summation-algorithms/issues/1/labels{/name}","comments_url":"https://api.github.com/repos/rreusser/summation-algorithms/issues/1/comments","events_url":"https://api.github.com/repos/rreusser/summation-algorithms/issues/1/events","html_url":"https://github.com/rreusser/summation-algorithms/issues/1","id":149007212,"number":1,"title":"Pairwise summation hierarchy not identical","user":{"login":"rreusser","id":572717,"avatar_url":"https://avatars.githubusercontent.com/u/572717?v=3","gravatar_id":"","url":"https://api.github.com/users/rreusser","html_url":"https://github.com/rreusser","followers_url":"https://api.github.com/users/rreusser/followers","following_url":"https://api.github.com/users/rreusser/following{/other_user}","gists_url":"https://api.github.com/users/rreusser/gists{/gist_id}","starred_url":"https://api.github.com/users/rreusser/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/rreusser/subscriptions","organizations_url":"https://api.github.com/users/rreusser/orgs","repos_url":"https://api.github.com/users/rreusser/repos","events_url":"https://api.github.com/users/rreusser/events{/privacy}","received_events_url":"https://api.github.com/users/rreusser/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"milestone":null,"comments":9,"created_at":"2016-04-17T23:46:19Z","updated_at":"2016-04-25T17:33:48Z","closed_at":null,"body":"The trees are slightly different for the recursive and non-recursive algorithms. The non-recursive algorithm works in terms of powers of two. The recursive algorithm splits the tree roughly in half. It's not clear to me whether this has a meaningful effect on the stability of the computed result. Presumably the elements that fall through have slightly different numerical properties than the elements that percolate through the whole tree, which is an unpleasant and maybe prohibitive asymmetry."},"comment":{"url":"https://api.github.com/repos/rreusser/summation-algorithms/issues/comments/214452015","html_url":"https://github.com/rreusser/summation-algorithms/issues/1#issuecomment-214452015","issue_url":"https://api.github.com/repos/rreusser/summation-algorithms/issues/1","id":214452015,"user":{"login":"rreusser","id":572717,"avatar_url":"https://avatars.githubusercontent.com/u/572717?v=3","gravatar_id":"","url":"https://api.github.com/users/rreusser","html_url":"https://github.com/rreusser","followers_url":"https://api.github.com/users/rreusser/followers","following_url":"https://api.github.com/users/rreusser/following{/other_user}","gists_url":"https://api.github.com/users/rreusser/gists{/gist_id}","starred_url":"https://api.github.com/users/rreusser/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/rreusser/subscriptions","organizations_url":"https://api.github.com/users/rreusser/orgs","repos_url":"https://api.github.com/users/rreusser/repos","events_url":"https://api.github.com/users/rreusser/events{/privacy}","received_events_url":"https://api.github.com/users/rreusser/received_events","type":"User","site_admin":false},"created_at":"2016-04-25T17:33:48Z","updated_at":"2016-04-25T17:33:48Z","body":"Oh, and should add I did the basic try/catch sanity check to verify that the answer to \"optimized?\" seems at least meaningful. (Answer: yes, try/catch kills optimization)"}}