Welcome to tea
!
tea
(toolkit for efficient analysis) is a set of tools developed at DESY for analysis of any ROOT trees.
It is designed for speed (CPU-intensive operations implemented in C++), based on intuitive loop-based logic, while hidding most of the tricky and tedious operations behind a user-friendly API and using Python for configuration and lightweight operations.
To get a feel for how a tea
app looks like, have a look at an example app.
If you are ready to dive into the world of tea
, check out the installation instructions, and then head to our tutorials.
In case of any questions, ideas, bugs, feature requests, etc. - please open a GitHub issue - we will be more than happy to discuss!
Features
The framework will help you with:
- reading any kind of flat ntuples stored in ROOT files (e.g. NanoAOD or HEPMC converted to ROOT),
- applying selections,
- saving skimmed trees,
- creating cut flow tables,
- creating histograms,
- plotting histograms,
- submission to HTCondor based grid systems (e.g. lxplus or NAF),
- applying correction (e.g. Pile-Up reweighting, b-tagging SFs, muon SFs, etc.).
Upcoming features:
- optimization and verification of ABCD method for background estimation,
- estimation of systematic uncertainties,
- calculating limits with Combine.
Analyses implemented with tea
So far, tea
has been used by the following analyses:
- CMS Light-by-light, 2412.15413
- SHIFT@LHC, 2406.08557
- Search for long-lived ALPs in tt̄ events
- CMS HGCal beam-test analysis
- Search for Hexaquarks
We would be more than happy to welcome you and your analysis on board!
You are also invited to contribute to tea
- help us make it better and more suited for a wide range of scenarios by creating PRs, reporting bugs and creating requests for features.