Definitions
All loose histograms only employ basic cut.
List of all tight cuts:
Cut Definition
Basic (Minbias) nPrim=2, nTot=2, qTot=0
Basic (Topology) nPrim=2, nTot=2, qTot=0, p5>10, p5!=20
allrapid 0.1 < y < 1.0
masscut 0.55 < mInv < 0.92
vertex abs(zVertex) < 50, abs(rVertex) < 8
Efficiency is defined as the (tight) data histogram divided by the corresponding monte carlo histogram.