Pith. sign in

REVIEW 3 major objections 5 minor 1 cited by

Accelerating Berends-Giele recursion for gluons in arbitrary dimensions over finite fields

T0 review · 3 major / 5 minor · reviewed 2026-08-08 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper shows that Berends-Giele recursion for gluon amplitudes can run on GPUs in arbitrary dimensions over finite fields.

desk verdict A genuinely useful proof-of-concept for GPU-accelerated finite-field amplitudes in d dimensions, but the 'arbitrary d' claim needs a proof of the polarization basis beyond d=6 to be fully secured. read the letter →

arxiv 2502.07060 v2 pith:F7PTQEMC submitted 2025-02-10 hep-ph physics.comp-ph

Juan M. Cruz-Martinez , Giuseppe De Laurentis , Mathieu Pellen This is my paper · ORCID
classification hep-phphysics.comp-ph
keywords Berends-GielerecursiongluonamplitudesGPUaccelerationfinitefieldsarbitrarydimensionstree-levelnumericalunitarityQCD
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper aims to establish that the Berends-Giele recursion can be accelerated on GPUs while computing in arbitrary space-time dimensions over finite fields, not just in four dimensions over complex numbers. This is a proof of concept for using hardware acceleration in the tree-amplitude stage of higher-order calculations, where numerical unitarity needs many d-dimensional finite-field tree amplitudes to build loop integrands. The authors implement a public program, validate it against analytic MHV and NMHV results and against an external CPU framework, and benchmark its scaling in legs, events, dimension, and GPU model. If correct, the work opens the way to GPU-accelerated loop-level predictions.

What carries the argument

The machinery is the off-shell current of Berends-Giele, defined recursively in Eq. (6): a current with n legs is built from smaller currents via the three- and four-gluon vertices, divided by the total momentum squared, and the on-shell amplitude is obtained by removing the last propagator and contracting with a polarisation vector. The d-dimensional part rests on the explicit polarisation vectors of Eqs. (11), (16), and (17), constructed to satisfy the completeness relation (13) and orthogonality (12) without square roots, which would require field extensions in finite fields. The finite-field layer performs all arithmetic in 64-bit integers modulo a prime p < $2^{31}$, with custom kernels for the batched tensor contractions and for division via the extended Euclidean algorithm.

What would settle it

Compute the polarisation vectors of Eq. (17) in a dimension such as d = 11 or d = 12 for a generic massless momentum, evaluate the left- and right-hand sides of the completeness relation (13), and check whether their difference vanishes; a nonzero difference would mean the construction fails in that dimension and the amplitudes computed with it would be wrong.

Watch

Extended reading notes

Core claim

The central claim is that the Berends-Giele recursion for pure-gluon tree amplitudes can be ported to GPUs while preserving the ability to work in any number of space-time dimensions d and over finite fields, and that this is the first such GPU implementation. The recursion builds n-gluon amplitudes from off-shell currents via Eq. (6); the implementation parallelises strictly over phase-space points, prepares the recursion and the d-dimensional polarisation states on the host, and uses custom GPU kernels for batched tensor contractions and finite-field division modulo a prime. The authors validate the code through internal consistency checks, the Ward identity, the MHV and NMHV analytic formulas, and a comparison with an external framework for d-dimensional amplitudes, and they report benchmarks showing flat scaling with event count until GPU capacity is reached, then linear growth.

Load-bearing premise

The load-bearing premise is that the explicit polarisation vectors constructed for d > 6 in Eq. (17) satisfy the completeness and orthogonality relations in every dimension; the paper verifies this numerically only up to d = 10 and gives no general proof.

Editorial extensions

If this is right

  • The exponential scaling in the number of external legs is preserved on GPU, so the gain is higher throughput over phase-space points rather than a change in asymptotic complexity.
  • A runtime that is roughly constant as the number of events grows up to a hardware threshold means large batches of phase-space points can be processed with little additional cost, which suits the many-evaluation workloads of numerical unitarity.
  • Because finite-field d-dimensional trees are the ingredient needed for loop integrands, this proof of concept points toward GPU-accelerated fixed-order QCD predictions beyond leading order.
  • The modular separation of the finite-field tensor layer from the recursion makes the code portable to other hardware and extendable beyond gluons to quarks and electroweak states.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A proof of the completeness relation (13) for the polarisation vectors of Eq. (17) in all dimensions would remove the main residual risk of the construction; until then, users should verify the relation beyond d = 10 before trusting amplitudes in higher dimensions.
  • The same custom finite-field kernels could serve other exact-arithmetic workloads, such as machine-learning pipelines requiring exact gradients or large-scale modular linear algebra.
  • Comparing against a CPU implementation of the same recursion with the same finite-field type would isolate the hardware gain from the overhead of the flexible high-level wrapper, and would tell whether the reported factor-of-ten gap to a specialised four-dimensional code is inherent or an artefact of the design choices.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper presents a GPU-accelerated implementation of the Berends-Giele recursion for pure-gluon tree amplitudes, with support for arbitrary spacetime dimension d and for finite-field arithmetic, and releases the code as a public package. The implementation is validated by internal consistency checks (Ward identity, metric and vertex tests, completeness of polarization states in d=4,...,10), by comparison with Parke-Taylor and NMHV analytic results, and by a one-to-one comparison with the external library Caravel in higher dimensions. Benchmarks show the expected exponential scaling in the number of legs, approximately constant time in the number of events up to a GPU threshold, and a comparison with BlockGen that is one order of magnitude slower in the finite-field mode. The stated goal is a proof of concept for GPU-accelerated computation of tree amplitudes relevant for loop integrands via numerical unitarity.

Significance. If the arbitrary-dimension construction is correct, this is a useful proof of concept: it is, to the best of the paper's claim, the first GPU implementation of Berends-Giele recursion over finite fields in arbitrary dimensions, and it directly targets a bottleneck in numerical unitarity and finite-field reconstruction. The manuscript's strengths are its public code, continuous-integration tests, and validation against independent analytic and external-library results; the Caravel comparison in particular is a strong external check. The main weakness is that the 'arbitrary d' part of the central claim rests on an unproved and, as printed, internally inconsistent formula for the polarization states, so the claim is stronger than the evidence currently provided.

major comments (3)
  1. [Section 2.3, Eq. (17)] The construction of the d-2 polarization states is asserted rather than proved. The completeness and orthogonality checks in Section 3.1 are limited to d = 4,...,10, and the Caravel comparison is for specific dimensions (e.g., 8), so the 'arbitrary number of space-time dimensions' claim is exactly as strong as an unproved generalization. This is load-bearing because any dimension for which Eq. (17) fails would silently produce incorrect amplitudes. Please provide a general proof (or an induction construction) for the completeness relation for all d, or explicitly restrict the claim to the tested range.
  2. [Section 2.3, Eqs. (16) and (17)] As printed, the formula for the state labeled x = 5 gives a vector with non-zero entries only in coordinates 4 and 5, with -mu_6^2 at coordinate 5. Under the mostly-negative metric used in the paper, this vector is not transverse to a massless k with k_6 != 0: one obtains k . epsilon_5 = k_5 (mu_6^2 - k_4^2)/(mu_6 mu_7) = k_5^3/(mu_6 mu_7), which is generically non-zero. This appears to be an indexing or sign typo (the state should presumably involve the new coordinate 6 and have the -mu_6^2 entry at coordinate 6). Because the code passes the reported tests, I expect the implementation differs from the printed formula; nevertheless, the paper must be corrected or the notation clarified so that the arbitrary-d construction is self-consistent.
  3. [Section 3.2, Figures 1-4] The benchmarks do not include a CPU run of the same code for the same finite-field and higher-dimensional configurations. The comparisons to Caravel and BlockGen conflate differences in hardware, implementation language, numeric type, and algorithmic scope, so the abstract's claim that the work 'demonstrates the advantages of hardware acceleration' for finite fields and d > 4 is not directly established by the presented data. A same-code CPU baseline (even for a subset of the points) would make the hardware-acceleration part of the central claim load-bearing rather than illustrative.
minor comments (5)
  1. [Section 2.1, Eq. (4)] The denominator notation P_{Gamma'}/P_{Gamma'} appears to be a typo for the set difference P_{Gamma'} \ P_{Gamma}; please correct it.
  2. [Throughout] The project name is written as 'Cara vel' in several places; it should be 'Caravel' consistently (the reference [32] uses the latter).
  3. [Abstract and page 1] There is a typo 'quantumchromodynamics' in the full-text abstract; it should read 'quantum chromodynamics'.
  4. [Figure captions, Figs. 1 and 3] The captions do not state the numeric mode (finite field vs. double-precision complex) used in each benchmark; please state this explicitly since the comparison in Fig. 4 depends on it.
  5. [Section 3.2, Fig. 4] The comparison with BlockGen is labelled as illustrative, but the text should also state whether the same helicity configuration, phase-space generation, and event count are used for both codes; this would help readers interpret the reported factor of ten.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the GPU Berends-Giele implementation is validated against independent external benchmarks, and no load-bearing claim reduces to a fit or to a self-citation.

full rationale

The central derivation is self-contained and externally checked. The Berends-Giele recursion is a standard recurrence (Eq. (6), Ref. [23]), and the implementation is validated against independent analytic results (Parke-Taylor formula Eq. (22), known NMHV amplitudes at n = 6 and 7) and against the external library Caravel for d-dimensional finite-field and complex data. No parameter is fitted to data, and no result is renamed from an input. The only self-citation is the Lips phase-space generator [57], by author G. De Laurentis, used for host-side momentum preparation; that component is auxiliary, validated by on-shell and momentum-conservation checks, and is not the subject of the paper's central claim. The d-dimensional polarization states of Eqs. (16)-(17) are constructed by imposing completeness and orthogonality; the tests verify those imposed relations for d = 4 through 10. The absence of a general proof that Eq. (17) satisfies completeness for every d is an unproved-generalization or correctness caveat, not a circularity, because the construction is not being used to predict the same condition it was defined to satisfy, and the tested dimensions are a genuine sample rather than the full claim. Thus no circular step is present.

Assumptions & free parameters 0 free parameters · 3 assumptions · 0 invented entities

The central claim rests on standard recursion relations, the finite-field representation of arithmetic, and the assumed completeness of the d-dimensional polarization basis. The chosen prime p is an implementation parameter, not a physical fit. No invented entities are introduced.

assumptions (3)
  • standard math Berends-Giele recursion (Eq. 6) correctly computes colour-ordered gluon tree amplitudes.
    Established result from Ref. [23], used as the foundation of the implementation.
  • domain assumption The polarization completeness relation (Eq. 13) and the construction in Eqs. (16)-(17) hold in arbitrary dimensions over finite fields.
    The paper states it follows from imposing completeness and orthogonality, but no general proof is given; numerically checked only up to d=10.
  • domain assumption Finite-field arithmetic over Fp with p containing the imaginary unit i is sufficient to reconstruct rational amplitudes.
    Standard practice in modern amplitude reconstruction (Refs. [33-36]); the paper relies on this for numerical stability. The specific default p is an implementation choice, not a physical parameter.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Accelerating Berends-Giele recursion for gluons in arbitrary dimensions over finite fields." pith.science (2026). https://pith.science/paper/F7PTQEMC

@misc{pith2026250207060,
  author       = {Pith},
  title        = {Pith review of: Accelerating Berends-Giele recursion for gluons in arbitrary dimensions over finite fields},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/F7PTQEMC}},
  note         = {Machine review of arXiv:2502.07060}
}
abstract

This work provides a proof of concept for the computation of pure gluonic amplitudes in quantum chromodynamics (QCD) on graphics processing units (GPUs). The implementation relies on the Berends-Giele recursion algorithm and, for the first time on a GPU, enables the numerical computation of amplitudes in an arbitrary number of space-time dimensions and over finite fields. This demonstrates the advantages of hardware acceleration, not only for the computation of tree-level amplitudes for real-radiation processes in four dimensions over complex numbers but also for generating loop integrands for virtual corrections in $d$ dimensions over finite fields. The associated computer program is publicly available.

Figures

Figures reproduced from arXiv: 2502.07060 by the authors.

Figure 1
Figure 1. Total time it takes to compute the amplitude for the given number of phase space [PITH_FULL_IMAGE:figures/full_fig_p010_1.png] view at source ↗
Figure 2
Figure 2. Total time it takes to compute the amplitude for the given number of phase space [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗
Figure 3
Figure 3. Total time it takes to compute the amplitude for [PITH_FULL_IMAGE:figures/full_fig_p011_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Comparison between the framework introduced in this work and [PITH_FULL_IMAGE:figures/full_fig_p012_4.png]

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Data-parallel leading-order event generation in MadGraph5_aMC@NLO

    hep-ph 2025-07 conditional novelty 6.0 of 10

    CUDACPP gives MadGraph data-parallel helicity amplitudes, delivering linear SIMD CPU speed-ups and up to order-of-magnitude GPU speed-ups for high-multiplicity QCD event generation.

Reference graph

Works this paper leans on

65 extracted references · 17 canonical work pages · cited by 1 Pith paper

  1. [1]

    A. Huss, J. Huston, S. Jones, and M. Pellen,Les Houches 2021—physics at TeV colliders: report on the standard model precision wishlist. J. Phys. G50 (2023) no. 4, 043001, arXiv:2207.02122 [hep-ph]

    arXiv 2023

  2. [2]

    Buckley,Computational challenges for MC event generation

    A. Buckley,Computational challenges for MC event generation. J. Phys. Conf. Ser.1525 (2020) no. 1, 012023,arXiv:1908.00167 [hep-ph]

    arXiv 2020

  3. [3]

    Amorosoet al., Challenges in Monte Carlo Event Generator Software for High-Luminosity LHC

    HSF Physics Event Generator WG Collaboration, S. Amorosoet al., Challenges in Monte Carlo Event Generator Software for High-Luminosity LHC. Comput. Softw. Big Sci. 5 (2021) no. 1, 12,arXiv:2004.13687 [hep-ph]

    arXiv 2021

  4. [4]

    HEP computing collaborations for the challenges of the next decade

    S. Campana, A. Di Girolamo, P. Laycock, Z. Marshall, H. Schellman, and G. A. Stewart, “HEP computing collaborations for the challenges of the next decade,” inSnowmass 2021. 3, 2022. arXiv:2203.07237 [physics.comp-ph]

    work page Pith review arXiv 2021

  5. [5]

    Febres Cordero, A

    F. Febres Cordero, A. von Manteuffel, and T. Neumann,Computational Challenges for Multi-loop Collider Phenomenology: A Snowmass 2021 White Paper. Comput. Softw. Big Sci. 6 (2022) no. 1, 14,arXiv:2204.04200 [hep-ph]

    arXiv 2022

  6. [6]

    Borowka, G

    S. Borowka, G. Heinrich, S. Jahn, S. P. Jones, M. Kerner, and J. Schlenk,A GPU compatible quasi-Monte Carlo integrator interfaced to pySecDec. Comput. Phys. Commun. 240 (2019) 120–137, arXiv:1811.11720 [physics.comp-ph]

    arXiv 2019

  7. [7]

    Carrazza and J

    S. Carrazza and J. M. Cruz-Martinez,VegasFlow: accelerating Monte Carlo simulation across multiple hardware platforms. Comput. Phys. Commun.254 (2020) 107376, arXiv:2002.12921 [physics.comp-ph]

    arXiv 2020

  8. [8]

    Gómez, H

    P. Gómez, H. H. Toftevaag, and G. Meoni,torchquad: Numerical Integration in Arbitrary Dimensions with PyTorch. Journal of Open Source Software6 (2021) no. 64, 3439. https://doi.org/10.21105/joss.03439

    doi:10.21105/joss.03439 2021

Show all 65 references
  1. [9]

    NNPDF Collaboration, R. D. Ballet al., An open-source machine learning framework for global analyses of parton distributions. Eur. Phys. J. C81 (2021) no. 10, 958, arXiv:2109.02671 [hep-ph]

    2021 arXiv

  2. [10]

    Cruz-Martinez, A

    J. Cruz-Martinez, A. Jansen, G. van Oord, T. R. Rabemananjara, C. M. R. Rocha, J. Rojo, and R. Stegeman,Hyperparameter Optimisation in Deep Learning from Ensemble Methods: Applications to Proton Structure. arXiv:2410.16248 [hep-ph]

    arXiv

  3. [11]

    Carrazza, J

    S. Carrazza, J. M. Cruz-Martinez, and M. Rossi,PDFFlow: parton distribution functions on GPU. arXiv:2009.06635 [hep-ph]

    2009 arXiv

  4. [12]

    M. H. Seymour and S. Sule,An Algorithm to Parallelise Parton Showers on a GPU. arXiv:2403.08692 [hep-ph] . 13

    arXiv

  5. [13]

    Bothmann, W

    E. Bothmann, W. Giele, S. Hoeche, J. Isaacson, and M. Knobbe,Many-gluon tree amplitudes on modern GPUs: A case study for novel event generators. SciPost Phys. Codeb. 2022 (2022) 3, arXiv:2106.06507 [hep-ph]

    2022 arXiv

  6. [14]

    Heinrich, S

    G. Heinrich, S. P. Jones, M. Kerner, V. Magerya, A. Olsson, and J. Schlenk,Numerical scattering amplitudes with pySecDec. Comput. Phys. Commun.295 (2024) 108956, arXiv:2305.19768 [hep-ph]

    2024 arXiv

  7. [15]

    Carrazza, J

    S. Carrazza, J. Cruz-Martinez, M. Rossi, and M. Zaro,MadFlow: automating Monte Carlo simulation on GPU for particle physics processes. Eur. Phys. J. C81 (2021) no. 7, 656, arXiv:2106.10279 [physics.comp-ph]

    2021 arXiv

  8. [16]

    Carrazza, J

    S. Carrazza, J. M. Cruz-Martinez, and G. Palazzo,Extending MadFlow: device-specific optimization. PoS ICHEP2022 (2022) 207, arXiv:2211.14056 [physics.comp-ph]

    2022 arXiv

  9. [17]

    Bothmann, T

    E. Bothmann, T. Childers, W. Giele, S. Höche, J. Isaacson, and M. Knobbe,A Portable Parton-Level Event Generator for the High-Luminosity LHC. arXiv:2311.06198 [hep-ph]

    arXiv

  10. [18]

    Valassi, S

    A. Valassi, S. Roiser, O. Mattelaer, and S. Hageboeck,Design and engineering of a simplified workflow execution for the MG5aMC event generator on GPUs and vector CPUs. EPJ Web Conf.251 (2021) 03045, arXiv:2106.12631 [physics.comp-ph]

    2021 arXiv

  11. [19]

    Valassi, T

    A. Valassi, T. Childers, L. Field, S. Hageboeck, W. Hopkins, O. Mattelaer, N. Nichols, S. Roiser, and D. Smith,Developments in Performance and Portability for MadGraph5_aMC@NLO. PoS ICHEP2022 (2022) 212, arXiv:2210.11122 [physics.comp-ph]

    2022 arXiv

  12. [20]

    Speeding up Madgraph5 aMC@NLO through CPU vectorization and GPU offloading: towards a first alpha release,

    A. Valassiet al., “Speeding up Madgraph5 aMC@NLO through CPU vectorization and GPU offloading: towards a first alpha release,” in21th International Workshop on Advanced Computing and Analysis Techniques in Physics Research: AI meets Reality. 3,

  13. [21]

    Wettersten, O

    Z. Wettersten, O. Mattelaer, S. Roiser, R. Schöfbeck, and A. Valassi,Acceleration beyond lowest order event generation. An outlook on further parallelism within MadGraph5_aMC@NLO. EPJ Web Conf.295 (2024) 10001, arXiv:2312.07440 [physics.comp-ph]

    2024 arXiv

  14. [22]

    Hageboeck, T

    S. Hageboeck, T. Childers, W. Hopkins, O. Mattelaer, N. Nichols, S. Roiser, J. Teig, A. Valassi, C. Vuosalo, and Z. Wettersten,Madgraph5_aMC@NLO on GPUs and vector CPUs Experience with the first alpha release. EPJ Web Conf.295 (2024) 11013, arXiv:2312.02898 [physics.comp-ph]

    2024 arXiv

  15. [23]

    F. A. Berends and W. T. Giele,Recursive Calculations for Processes with n Gluons. Nucl. Phys. B 306 (1988) 759–808

    1988

  16. [24]

    van Hameren,Multi-gluon one-loop amplitudes using tensor integrals

    A. van Hameren,Multi-gluon one-loop amplitudes using tensor integrals. JHEP 07 (2009) 088, arXiv:0905.1005 [hep-ph]

    2009 arXiv

  17. [25]

    Kanaki and C

    A. Kanaki and C. G. Papadopoulos,HELAC: A Package to compute electroweak helicity amplitudes. Comput. Phys. Commun.132 (2000) 306–315, arXiv:hep-ph/0002082. 14

    2000 arXiv

  18. [26]

    Cascioli, P

    F. Cascioli, P. Maierhöfer, and S. Pozzorini,Scattering Amplitudes with Open Loops. Phys. Rev. Lett. 108 (2012) 111601, arXiv:1111.5206 [hep-ph]

    2012 arXiv

  19. [27]

    Actis, A

    S. Actis, A. Denner, L. Hofer, J.-N. Lang, A. Scharf, and S. Uccirati,RECOLA: REcursive Computation of One-Loop Amplitudes. Comput. Phys. Commun.214 (2017) 140–173, arXiv:1605.01090 [hep-ph]

    2017 arXiv

  20. [28]

    Giele, G

    W. Giele, G. Stavenga, and J.-C. Winter,Thread-Scalable Evaluation of Multi-Jet Observables. Eur. Phys. J. C71 (2011) 1703, arXiv:1002.3446 [hep-ph]

    2011 arXiv

  21. [29]

    Hagiwara, J

    K. Hagiwara, J. Kanzaki, N. Okamura, D. Rainwater, and T. Stelzer,Calculation of HELAS amplitudes for QCD processes using graphics processing unit (GPU). Eur. Phys. J. C 70 (2010) 513–524, arXiv:0909.5257 [hep-ph]

    2010 arXiv

  22. [30]

    Hagiwara, J

    K. Hagiwara, J. Kanzaki, N. Okamura, D. Rainwater, and T. Stelzer,Fast calculation of HELAS amplitudes using graphics processing unit (GPU). Eur. Phys. J. C66 (2010) 477–492, arXiv:0908.4403 [physics.comp-ph]

    2010 arXiv

  23. [31]

    Z. Li, J. Wang, Q.-S. Yan, and X. Zhao,Efficient numerical evaluation of Feynman integrals. Chin. Phys. C40 (2016) no. 3, 033103,arXiv:1508.02512 [hep-ph]

    2016 arXiv

  24. [32]

    Abreu, J

    S. Abreu, J. Dormans, F. Febres Cordero, H. Ita, M. Kraus, B. Page, E. Pascual, M. S. Ruf, and V. Sotnikov,Caravel: A C++ framework for the computation of multi-loop amplitudes with numerical unitarity. Comput. Phys. Commun.267 (2021) 108069, arXiv:2009.11957 [hep-ph]

    2021 arXiv

  25. [33]

    von Manteuffel and R

    A. von Manteuffel and R. M. Schabinger,A novel approach to integration by parts reduction. Phys. Lett. B744 (2015) 101–104, arXiv:1406.4513 [hep-ph]

    2015 arXiv

  26. [34]

    Peraro,Scattering amplitudes over finite fields and multivariate functional reconstruction

    T. Peraro,Scattering amplitudes over finite fields and multivariate functional reconstruction. JHEP 12 (2016) 030, arXiv:1608.01902 [hep-ph]

    2016 arXiv

  27. [35]

    H. B. Hartanto, S. Badger, C. Brønnum-Hansen, and T. Peraro,A numerical evaluation of planar two-loop helicity amplitudes for a W-boson plus four partons. JHEP 09 (2019) 119, arXiv:1906.11862 [hep-ph]

    2019 arXiv

  28. [36]

    Badger, M

    S. Badger, M. Becchetti, C. Brancaccio, H. B. Hartanto, and S. Zoia,Numerical evaluation of two-loop QCD helicity amplitudes forgg → ttg at leading colour. JHEP 03 (2025) 070, arXiv:2412.13876 [hep-ph]

    2025 arXiv

  29. [37]

    Höche, S

    S. Höche, S. Prestel, and H. Schulz,Simulation of Vector Boson Plus Many Jet Final States at the High Luminosity LHC. Phys. Rev. D100 (2019) no. 1, 014024, arXiv:1905.05120 [hep-ph]

    2019 arXiv

  30. [38]

    Bothmann, A

    E. Bothmann, A. Buckley, I. A. Christidi, C. Gütschow, S. Höche, M. Knobbe, T. Martin, and M. Schönherr,Accelerating LHC event generation with simplified pilot runs and fast PDFs. Eur. Phys. J. C82 (2022) no. 12, 1128,arXiv:2209.00843 [hep-ph]

    2022 arXiv

  31. [39]

    Z. Bern, L. J. Dixon, D. C. Dunbar, and D. A. Kosower,One loop n point gauge theory amplitudes, unitarity and collinear limits. Nucl. Phys. B425 (1994) 217–260, arXiv:hep-ph/9403226. 15

    1994 arXiv

  32. [40]

    Z. Bern, L. J. Dixon, D. C. Dunbar, and D. A. Kosower,Fusing gauge theory tree amplitudes into loop amplitudes. Nucl. Phys. B435 (1995) 59–101, arXiv:hep-ph/9409265

    1995 arXiv

  33. [41]

    Z. Bern, L. J. Dixon, and D. A. Kosower,One loop amplitudes for e+ e- to four partons. Nucl. Phys. B513 (1998) 3–86, arXiv:hep-ph/9708239

    1998 arXiv

  34. [42]

    Britto, F

    R. Britto, F. Cachazo, and B. Feng,Generalized unitarity and one-loop amplitudes in N=4 super-Yang-Mills. Nucl. Phys. B725 (2005) 275–305, arXiv:hep-th/0412103

    2005 arXiv

  35. [43]

    R. K. Ellis, W. T. Giele, and Z. Kunszt,A Numerical Unitarity Formalism for Evaluating One-Loop Amplitudes. JHEP 03 (2008) 003, arXiv:0708.2398 [hep-ph]

    2008 arXiv

  36. [44]

    W. T. Giele, Z. Kunszt, and K. Melnikov,Full one-loop amplitudes from tree amplitudes. JHEP 04 (2008) 049, arXiv:0801.2237 [hep-ph]

    2008 arXiv

  37. [45]

    C. F. Berger, Z. Bern, L. J. Dixon, F. Febres Cordero, D. Forde, H. Ita, D. A. Kosower, and D. Maitre,An Automated Implementation of On-Shell Methods for One-Loop Amplitudes. Phys. Rev. D78 (2008) 036003, arXiv:0803.4180 [hep-ph]

    2008 arXiv

  38. [46]

    Abreu, F

    S. Abreu, F. Febres Cordero, H. Ita, M. Jaquier, and B. Page,Subleading Poles in the Numerical Unitarity Method at Two Loops. Phys. Rev. D95 (2017) no. 9, 096011, arXiv:1703.05255 [hep-ph]

    2017 arXiv

  39. [47]

    Abreu, F

    S. Abreu, F. Febres Cordero, H. Ita, M. Jaquier, B. Page, and M. Zeng,Two-Loop Four-Gluon Amplitudes from Numerical Unitarity. Phys. Rev. Lett.119 (2017) no. 14, 142001, arXiv:1703.05273 [hep-ph]

    2017 arXiv

  40. [48]

    Gluza, K

    J. Gluza, K. Kajda, and D. A. Kosower,Towards a Basis for Planar Two-Loop Integrals. Phys. Rev. D83 (2011) 045012, arXiv:1009.0472 [hep-th]

    2011 arXiv

  41. [49]

    Badger, H

    S. Badger, H. Frellesvig, and Y. Zhang,Hepta-Cuts of Two-Loop Scattering Amplitudes. JHEP 04 (2012) 055, arXiv:1202.2019 [hep-ph]

    2012 arXiv

  42. [50]

    Badger, H

    S. Badger, H. Frellesvig, and Y. Zhang,A Two-Loop Five-Gluon Helicity Amplitude in QCD. JHEP 12 (2013) 045, arXiv:1310.1051 [hep-ph]

    2013 arXiv

  43. [51]

    Ita,Two-loop Integrand Decomposition into Master Integrals and Surface Terms

    H. Ita,Two-loop Integrand Decomposition into Master Integrals and Surface Terms. Phys. Rev. D 94 (2016) no. 11, 116015,arXiv:1510.05626 [hep-th]

    2016 arXiv

  44. [52]

    Badger, G

    S. Badger, G. Mogull, A. Ochirov, and D. O’Connell,A Complete Two-Loop, Five-Gluon Helicity Amplitude in Yang-Mills Theory. JHEP 10 (2015) 064, arXiv:1507.08797 [hep-ph]

    2015 arXiv

  45. [53]

    Gnendigeret al., To d, or not tod: recent developments and comparisons of regularization schemes

    C. Gnendigeret al., To d, or not tod: recent developments and comparisons of regularization schemes. Eur. Phys. J. C77 (2017) no. 7, 471,arXiv:1705.01827 [hep-ph]

    2017 arXiv

  46. [54]

    Abadiet al., TensorFlow: Large-Scale Machine Learning on Heterogeneous Systems,

    M. Abadiet al., TensorFlow: Large-Scale Machine Learning on Heterogeneous Systems,

  47. [55]

    mpmath development team,mpmath: a Python library for arbitrary-precision floating-point arithmetic (version 1.3.0), 2023

    T. mpmath development team,mpmath: a Python library for arbitrary-precision floating-point arithmetic (version 1.3.0), 2023. http://mpmath.org/. 16

    2023

  48. [56]

    C. R. Harris, K. J. Millman, S. J. van der Walt, R. Gommers, P. Virtanen, D. Cournapeau, E. Wieser, J. Taylor, S. Berg, N. J. Smith, R. Kern, M. Picus, S. Hoyer, M. H. van Kerkwijk, M. Brett, A. Haldane, J. F. del Río, M. Wiebe, P. Peterson, P. Gérard-Marchant, K. Sheppard, T....

    2020

  49. [57]

    Lips:p-adic and singular phase space,

    G. De Laurentis, “Lips:p-adic and singular phase space,” in21th International Workshop on Advanced Computing and Analysis Techniques in Physics Research: AI meets Reality. 5, 2023. arXiv:2305.14075 [hep-th]

    2023 arXiv

  50. [58]

    Decker, G.-M

    W. Decker, G.-M. Greuel, G. Pfister, and H. Schönemann,Singular 4-4-0 — A computer algebra system for polynomial computations, http://www.singular.uni-kl.de, 2024

    2024

  51. [59]

    Vingelmann, and F

    NVIDIA, P. Vingelmann, and F. H. Fitzek,CUDA, release: 10.2.89, 2020. https://developer.nvidia.com/cuda-toolkit

    2020

  52. [60]

    Pytorch: An imperative style, high-performance deep learning library,

    A. Paszkeet al., “Pytorch: An imperative style, high-performance deep learning library,” in Advances in Neural Information Processing Systems 32, pp. 8024–8035. Curran Associates, Inc., 2019. http://papers.neurips.cc/paper/ 9015-pytorch-an-imperative-style-high-performance-dee...

    2019

  53. [61]

    Heimel, O

    T. Heimel, O. Mattelaer, T. Plehn, and R. Winterhalder,Differentiable MadNIS-Lite. arXiv:2408.01486 [hep-ph]

    arXiv

  54. [62]

    S. J. Parke and T. R. Taylor,An Amplitude forn Gluon Scattering. Phys. Rev. Lett.56 (1986) 2459

    1986

  55. [63]

    Bothmannet al., Event Generation with Sherpa 2.2

    Sherpa Collaboration, E. Bothmannet al., Event Generation with Sherpa 2.2. SciPost Phys. 7 (2019) 034, arXiv:1905.09127 [hep-ph] . 17

    2019 arXiv

  56. [2015]

    Software available from tensorflow.org

    https://www.tensorflow.org/. Software available from tensorflow.org

  57. [2023]

    arXiv:2303.18244 [physics.comp-ph]

    arXiv

Pith tools

Reviewed August 8, 2026 · model on record in the stance chip above.