Hi, I stumpled upon the LPPL implementation in this repo by accident. I find it a perfect fit for my needs - thanks for the efforts implementing it. However, some of the methods are lacking documentation e.g. the functions mp_compute_nested_fits and compute_nested_fits. Could you please explain the parameters? I assume they have heavy impact on the computing time needed and even the results. Specifically these arguments are interesting to me: window_size smallest_window_size outer_increment inner_increment max_searches Thanks, Sven