Different first choices could lead to different solutions in the greedy algorithm by step (v) in the description. The implementation of Twyman et al. repeats the process three times by using each of the first three oxidation products from the initial ranking as the first choice, which we denote with a suffix "F3". For example, the implementation by Twyman et al. is marked as "Lazy-F3". Alternatively, greedy algorithms can be implemented by iterating over all possible first choices, and the suffix "All" is used to denote them, e.g., "Diligent-All".