Spiro's signed-tree conjecture concerns the minimum signed Wiener index
of a tree
,
obtained by minimizing the signed index over all assignments of signs to its edges.
Spiro (2022) proposed two bounds for a tree on
vertices. The lower bound
is
, where
is the path graph and an alternating
signing gives
, with
denoting the floor function.
The upper bound is the largest
over
-vertex double stars, formed by joining the centers of two
star graphs by an edge.
Guo et al. (2023) refuted the lower bound for every . Orden (2026) reports that the path
graph is the unique minimizing underlying tree for
. At
it ties with exactly one other tree,
with minimum 210. Claude agents developed a filter and exact search programs. Two
separately written implementations shared part of the method and agreed on the results.
The author released code and certificates, and the note is under journal review.
The upper bound is a separate open question. Orden (2026) reports finite checks through 28 vertices.