Papers
Topics
Authors
Recent
Search
2000 character limit reached

Priority-Based Recombination (p-jet) Algorithm

Updated 7 December 2025
  • The paper introduces the p-jet algorithm, which uses an energy-thresholded priority measure to merge four-vectors and suppress pileup noise in hadron collider jets.
  • It employs a dynamic, distance-dependent T(ΔR) threshold function to ensure only collinear, energetic radiation is clustered, enhancing jet energy resolution.
  • Empirical results show that p-jets yield a 20% narrower reconstructed Z mass width and absorb 40% less pileup energy compared to conventional anti-kT jets.

A priority-based recombination algorithm—termed the p-jet algorithm—constitutes a framework for jet definition in high-luminosity hadron colliders, designed to provide robust noise suppression by explicitly controlling the merging of calorimeter towers or four-vectors based on an energy-thresholded “priority” measure. Unlike conventional fixed-cone or sequential recombination algorithms such as anti-kTk_T, the p-jet algorithm employs a local, distance-dependent threshold function that restricts the inclusion of low-energy, diffuse background (pileup) into signal jets, thereby improving energy resolution and preserving sensitivity in challenging pileup environments (Duffty et al., 2016).

1. Motivation and Theoretical Context

In collider environments characterized by elevated instantaneous luminosities, pileup from numerous soft proton-proton interactions per bunch crossing severely contaminates low-energy QCD jet measurements, typically in the $40$–$60$ GeV regime. Standard jet algorithms, notably anti-kTk_T and related sequential recombination schemes, produce geometric cone-like objects by clustering calorimeter towers within a fixed radius RR, thus including significant pileup energy by construction. This results in broadened resonance peaks, reduced sensitivity to low-mass signals, and necessitates extensive area-based pileup subtraction.

The p-jet framework replaces the widely used distance-based ordering with an energy-dependent merging criterion. By requiring each candidate jet merge to satisfy a local energy ratio threshold parameterized by inter-object angular distance, the algorithm selectively incorporates only energetic, collinear radiation into jets, while excluding isotropic, low-energy pileup. This method targets scenarios where signal-to-background discrimination is impeded by conventional fixed-cone area accumulation (Duffty et al., 2016).

2. Priority Measure and Threshold Function

The merging criterion for the p-jet algorithm relies on a pairwise priority score. For two proto-jets or objects ii and jj (EiEjE_i \geq E_j), and separation

ΔRij=(ηiηj)2+(ϕiϕj)2,\Delta R_{ij} = \sqrt{(\eta_i - \eta_j)^2 + (\phi_i - \phi_j)^2},

the priority is

pij=max(Ej/EiT(ΔRij), 0)p_{ij} = \max(E_j/E_i - T(\Delta R_{ij}), \ 0 )

where T(ΔR)T(\Delta R) is a monotonic, user-specified threshold function mapping [0,Rmax][0,1][0, R_{\max}] \to [0,1]. Only pairs with pij>0p_{ij} > 0 are eligible for merging; the maximum pijp_{ij} in the current object list dictates merging sequence. Collinear emissions (ΔR0\Delta R \to 0) require T(0)=0T(0)=0 for safety, ensuring pij1p_{ij} \to 1 when EjEiE_j \approx E_i. An example threshold,

T(ΔR)=2sin(4πΔRRmax),T(\Delta R) = 2 \sin\left( \frac{4\pi \Delta R}{R_{\max}} \right),

generates a threshold that is minimal at ΔR=0\Delta R=0, peaks at Rmax/2R_{\max}/2, and reaches unity at ΔR=Rmax\Delta R=R_{\max}. This profile approximates the QCD dipole radiation angular distribution.

3. Algorithmic Procedure

The p-jet recombination algorithm progresses according to the following scheme:

  1. Treat each input object as an initial proto-jet.
  2. Compute all unique pairwise priorities pijp_{ij}.
  3. While any pij>0p_{ij} > 0:
    • Identify the pair (i,j)(i, j) with maximal pijp_{ij}.
    • Merge ii and jj into a new object aa with four-momentum pa=pi+pjp_a = p_i + p_j.
    • Remove ii and jj, and include aa in the active set.
    • Recompute priorities involving aa.
  4. Declare objects with no positive pijp_{ij} as final jets.
  5. Apply standard jet-energy corrections (JEC), typically calibrated using ZZ+jet balancing.

The algorithm clusters the most signal-like pairs preferentially, limiting the recombination of background-dominated wide-angle pairs. Because only pairs with enough relative energy within a local angular region are merged, the resulting jets are “zero-area”: they do not possess a fixed geometric size, circumventing the need for area-based pileup subtraction.

4. Noise Suppression and Theoretical Properties

The core of noise suppression lies in the choice and tuning of T(ΔR)T(\Delta R). To ensure both collinear and infrared safety, T(0)=0T(0) = 0 and T(ΔR)T(\Delta R) increases monotonically, reaching unity at RmaxR_{\max}. This ensures soft, wide-angle proto-jets do not satisfy the energy threshold and remain unclustered. Since pileup is typically isotropic and low in energy, it rarely meets the required Ej/EiE_j/E_i criterion across relevant angular scales and is thus efficiently suppressed. Only particles with energy exceeding this dynamic threshold within a given angular separation enter the jet core, sharply reducing pileup contributions by construction.

Formally, p-jets lack a fixed geometric area, further distinguishing them from conventional algorithms. This property eliminates the necessity for area-based corrections, simplifying downstream calibration and analysis steps.

5. Performance and Empirical Comparison

The computational complexity of the p-jet algorithm is O(N2)O(N^2) for naïve implementations, paralleling anti-kTk_T; tree-based optimizations reduce complexity to O(NlogN)O(N\log N). In trials using resonant ZjjZ\rightarrow jj production with $50$ pileup events, the following features were observed:

  • Without any cell-level subtraction, anti-kTk_T (R=0.5R=0.5) yields a reconstructed ZZ peak at \sim188 GeV (width \sim82 GeV).
  • With area-based pileup subtraction and JEC, anti-kTk_T yields a peak at \sim122 GeV (width \sim68 GeV).
  • P-jet algorithm, with matching RmaxR_{\max} and thresholding, requires only mild JEC and reproduces the ZZ mass at \sim102 GeV with a width of \sim53 GeV, approximately 20% narrower than anti-kTk_T.

P-jets absorb about 40% less pileup energy post-JEC compared to anti-kTk_T, resulting in smaller, less negative corrections and reduced event-by-event energy fluctuations. The lower reconstructed width demonstrates enhanced stability in high pileup.

6. Tuning and Applicability

The adaptability of the framework arises from the form of T(ΔR)T(\Delta R). For environments with extreme pileup, steepening the threshold (e.g., increasing oscillation frequency in the T(ΔR)T(\Delta R) sinusoidal component or adding a linear term) can further reject wide-angle soft radiation. For moderate backgrounds, using thresholds mirroring QCD dipole radiation allows retention of genuine soft QCD emissions. To increase acceptance of wide showers characteristic of bb- or cc-quark jets, compressing T(ΔR)T(\Delta R) enhances clustering of medium-angle emissions. In all cases, T(0)=0T(0)=0 and T(Rmax)=1T(R_{\max})=1 must be strictly satisfied to maintain both safety and well-defined clustering boundaries. JEC validation is performed using standard ZZ+jet or γ\gamma+jet methods, with expected residuals below ±10%\pm10\% (Duffty et al., 2016).

7. Implications and Future Development

The p-jet framework complements traditional algorithms by offering customizable noise suppression within a computationally efficient and theoretically sound paradigm. By leveraging a tunable, QCD-motivated threshold function, it enhances resolution in the presence of high pileup without reliance on geometric area constructs. Potential extensions involve further tuning of T(ΔR)T(\Delta R) for specialized physics analyses or detector environments, including high-luminosity upgrades and precision measurements. A plausible implication is that by minimizing pileup influence at the algorithmic level, future analyses may exhibit improved stability and reduced systematic uncertainties, particularly in low-mass or rare process searches.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Priority-Based Recombination Algorithm.