Anyone can post to the ArXiv. So now wait a few weeks. One test: does his algorithm work for bipartite graphs? Another test: his algorithm uses real numbers.

Anyone can post to the ArXiv. So now wait a few weeks. One test: does his algorithm work for bipartite graphs? Another test: his algorithm uses real numbers. This is sketchy, as real numbers can't actually be represented in a computer. The paper is pretty poorly written for two reasons: English is clearly not this guy's first language (no crime there, as it is said that the language of science is "heavily accented english") but he is also using a little too much handwaving for my comfort. This is a pretty math-heavy result, and this is not an airtight proof in any sense. Basically: I agree with everything you said about it not being compelling enough for me to spend more time with it. Fun fact so that I'll say more than "I agree": if GI is in P, the the polynomial hierarchy collapses to a level that I forget, and if GI is NPC it collapses to a PI_2! Neat!