Papers › The automation of SMEFT-Assisted Constraints on UV-Complete Models
The automation of SMEFT-Assisted Constraints on UV-Complete Models
Jaco ter Hoeve, Giacomo Magni, Juan Rojo, Alejo N. Rossia, Eleni Vryonidou
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The ongoing Effective Field Theory (EFT) program at the LHC and elsewhere is motivated by streamlining the connection between experimental data and UV-complete scenarios of heavy new physics beyond the Standard Model (BSM). This connection is provided by matching relations mapping the Wilson coefficients of the EFT to the couplings and masses of UV-complete models. Building upon recent work on the automation of tree-level and one-loop matching in the SMEFT, we present a novel strategy automating the constraint-setting procedure on the parameter space of general heavy UV-models matched to dimension-six SMEFT operators. A new Mathematica package, match2fit, interfaces Matchmakereft, which derives the matching relations for a given UV model, and SMEFiT, which provides bounds on the Wilson coefficients by comparing with data. By means of this pipeline and using both tree-level and one-loop matching, we derive bounds on a wide range of single- and multi-particle extensions of the SM from a global dataset composed by LHC and LEP measurements. Whenever possible, we benchmark our results with existing studies. Our framework realises one of the main objectives of the EFT program in particle physics: deploying the SMEFT to bypass the need of directly comparing the predictions of heavy UV models with experimental data.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections