Next, given a resultant concept for each of the node/leaf, we backtrack in time and check for the first occurrence when only tuples which satisfy the corresponding concept are assigned to that particular node/leaf.
we compute the earliest time when a node/leaf is 'pure' with respect to its final learned concept.