Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
We construct minimum-width confidence bands with a predefined nominal coverage from a finite set of sample paths. In contrast to the several heuristics suggested in the literature, our mixed-integer optimization algorithm calculates global minimum-width pathwise confidence bands. For very large problems, our solution can be used as an approximation with a bounded and known gap to the globally optimal solution.