x_{1} is direct ancestor/mentorial-ancestor of x_{2} of order x_{3} (li; nonnegative integer) in graph/network of ancestry (family tree) x_{4} (defaults to maximal option), where x_{3} is the smallest possible number which is so constrained; x_{1} is the x_{3}th-great-grandparent of x_{2}.

If x_{3}=0, then x_{1 }= x_{2}; if x_{3}=1, then x_{1} is the parent/mentor/rirni x_{2}; if x_{3}=2, then x_{1} is the grandparent/mentor's mentor/riryrirni of x_{2}; if x_{3}=n, then x_{1} is the (n-2)th-great-grand-parent of x_{2} (id est: great-great-...-great-grandparent, where the number of "great-"s is n-2). x_{3} must be the geodesic path length; in an actual tree-graph family tree, this is the only option; but, in practice, there is usually some closure of the graph (inbreeding/incest) and one specimen may be the ancestor of the subject in multiple different ways; in such cases, the shortest path(s) are the ones which determine x_{3} and, thus, x_{4} can be used to subtract out those connections in order to say something like "A is both B's grandparent and B's great-grandparent" (the latter requiring edge-subtraction from the ancestry graph). See also: ".utka'au", "rirni", ".abvele", riryriryrirni.

- utka'au
- x
_{1}and x_{2}are path-linked by binary predicate x_{3}(ka; possibly non-symmetric/non-commutative) via a from-x_{1}-to-x_{2}-directed graph geodesic of length x_{4}(li; nonnegative integer or positive infinity) in graph x_{5}(default: maximal) which is generated by relation x_{3}.