According to Artificial Intelligence: A Modern Approach 4th edition in IDA* the cutoff is the $f$-cost($g+h$); at each iteration, the cutoff value is the smallest $f$-cost of any node that exceeded the cutoff on the previous iteration. In other words, each iteration exhaustively searches an $f$-contour, finds a node just beyond that contour, and uses that ...