Table 2:

Relative performance of the Euclidean, network hop, and path probability strategies

	Euclidean Distance			Network Hop Algorithm			Path Probability Algorithm
State	Inferred	Cor?	Certain.	Inferred	Cor?	Certain.
[0 0 1 1 1]	Ordinary	Yes	0.999	ordinary	yes	0.999	ordinary	yes	0.999
[0 1 0 1 0]	Ordinary	yes	0.193	ordinary	yes	0.999	ordinary	yes	0.969
[1 1 0 0 2]	m2-unstarve	no	0.708	m2-unstarve	no	0.551	ordinary	yes	0.999
[0 1 0 1 3]	m1-block	yes	0.365	m1-block	yes	0.743	m1-block	yes	0.898
[1 1 0 0 3]	m2-unstarve	no	0.050	ordinary	yes	0.998	ordinary	yes	0.969
[0 1 0 1 1]	m1-unblock	no	0.503	m1-unblock	no	0.199	ordinary	yes	0.935
[1 1 0 0 0]	m2-starve	yes	0.365	m2-starve	yes	0.734	m2-starve	yes	0.988
[0 0 1 1 0]	ordinary	yes	0.999	ordinary	yes	0.999	ordinary	yes	0.999
[0 0 1 1 2]	ordinary	yes	0.998	ordinary	yes	0.999	ordinary	yes	0.999
[1 1 0 0 1]	m2-unstarve	yes	0.365	m2-unstarve	yes	0.743	m2-unstarve	yes	0.915
[0 1 0 1 2]	m1-unblock	yes	0.365	m1-unblock	yes	0.743	m1-unblock	yes	0.823
[1 0 1 0 0]	ordinary	yes	0.975	ordinary	yes	0.999	ordinary	yes	0.727