Probing SMEFT Operators through $t\bar{t}t\bar{t}$ Production with Hyper-Graph Neural Networks at the LHC

Amir Subba; Sanmay Ganguly

hep-phMay 18, 2026

Probing SMEFT Operators through $t\bar{t}t\bar{t}$ Production with Hyper-Graph Neural Networks at the LHCProbing SMEFT Operators through t\bar{t}t\bar{t} Production with Hyper-Graph Neural Networks at the LHC

Authors: Amir Subba, Sanmay Ganguly

Abstract

We present a phenomenological study of $t\bar{t}t\bar{t}$ production in proton-proton collisions at $\sqrt{s} = 13$ ~TeV, using a Hyper-Graph Neural Network (H-GNN) to discriminate multilepton signal events from the dominant SM backgrounds, namely $t\bar{t}W$ , $t\bar{t}Z$ , $t\bar{t}H$ , $t\bar{t}VV$ , single-top associated production, and diboson and triboson processes. In the H-GNN architecture each event is represented as a hypergraph whose nodes correspond to reconstructed jets and leptons and whose hyperedges encode higher-order correlations among arbitrary subsets of these objects, allowing the network to learn the many-body kinematic structures that characterize the $t\bar{t}t\bar{t}$ final state. Combining same-sign di-lepton, tri-lepton, and four-lepton channels following a CMS-like event selection, the H-GNN attains an area under the ROC curve of $0.951$ for the $t\bar{t}t\bar{t}$ signal and yields a statistical significance of $Z = 9.11$ at an integrated luminosity of $\mathcal{L} = 140~\mathrm{fb}^{-1}$ , to be compared with $Z = 8.62$ for a SPANet baseline, $Z = 7.37$ for a Particle Transformer baseline, and $Z = 5.13$ obtained by the ATLAS analysis, evaluated under identical event selection. We exploit the improved signal extraction to derive one- and two-parameter $95\%$ confidence level limits on the Wilson coefficients of the dimension-six operators $\mathcal{O}_{Φu}$ , $\mathcal{O}^{(1)}_{tt}$ , $\mathcal{O}^{(1)}_{qq}$ , $\mathcal{O}^{(1)}_{qt}$ , and $\mathcal{O}^{(8)}_{qt}$ , and we project the expected sensitivity at the HL-LHC integrated luminosities of $1000~\mathrm{fb}^{-1}$ and $3000~\mathrm{fb}^{-1}$ with $50\%$ uncertainty on the background estimation.

Explore similar work

Jul 3, 2026hep-th

Graph Neural Networks for the Graphical Bootstrap

We study a graph classification problem involving over 20 million graphs, arising from high-order perturbative computations of correlators in planar

\mathcal{N}=4

super-Yang--Mills, a model closely related to the theory of the strong nuclear force. We benchmark graph neural networks, including graph transformers, achieving robust generalization to larger graphs with up to

99.996\%

ROC AUC. Then, we analyze how the models can be used to gain a computational speedup compared to the traditional graphical bootstrap algorithm, through shrinking the redundant data by up to

85.5\%

at the level of denominator graphs. Finally, we study the embeddings of the models to investigate their interpretability.

Rigers Aliaj, Gabriele Dian, Reza Doobary +1

Graph Neural Networks Artificial Neural Networks Perturbation Propagation

Ask PDF

Sep 9, 2026hep-ph

Searching for New Physics with Reinforcement Learning

Finding new physics (NP) is the most important problem in particle physics today. Studying ``anomalies'', i.e., measurements of low-energy observables whose values disagree with the predictions of the Standard Model (SM), is a powerful search strategy. The SM Effective Field Theory (SMEFT) provides a general model-independent framework for parameterizing NP; it is natural to try to find the SMEFT operator(s) that can explain such anomalies. This is a challenging task because (i) the number of SMEFT operators is enormous, and (ii) at loop level there are very complicated correlations among the operators. Analyses by humans typically rely on phenomenological intuition to decide which operators are relevant. This is often biased and does not explore the complete SMEFT operator space. Interestingly, reinforcement learning (RL) techniques excel at tasks that require decision making to achieve their goals. In this paper, we introduce an RL method that can be used to find the SMEFT operators that explain any anomalies. We test it on the CDF

W

-mass anomaly, and show that it reproduces (and improves upon) known results. We then consider a far more complicated situation with multiple anomalies and show that, even here, this method is able to find the SMEFT operators that explain the data. Our RL method can therefore be used to efficiently search for NP at the level of SMEFT.

Jacky Kumar, Marianne Bouchard, David London

Effective Field Theory

Ask PDF

Sep 14, 2026cs.AI

Interpreting the predictions of neural network classification based on a Taylor Coefficient Analysis (TCA)

We introduce a rigid and comprehensive taxonomy and paradigm for characterizing the influence of the input feature space

X

on the predictions

\hat{y}

of a neural network (NN) used for event classification, based on a Taylor expansion of

\hat{y}

X

. The complete process of introspection we refer to as Taylor Coefficient Analysis (TCA). Based on two simplistic example tasks, which can be easily understood and bencmarked, we illustrate the power of the TCA when it comes to revealing, what properties of

X

have led to what value of

\hat{y}

, of a given NN model, building up intuition for the method. A more complex application is meant to represent

X

of a typical classification task at a CERN LHC experiment. Based on this application, we play through the different levels of introspection that the TCA offers and discuss a number of practical aspects for a TCA application typical for the analysis of CERN LHC data. We conclude with a study to support the assumption that those properties of

X

most relevant for tasks of the complexity typical for a CERN LHC experiment, are usually caught by a TCA up to the second order.

Markus Klute, Artur Monsch, Lars Sowa +1

Topic pending

Ask PDF