REVIEW 2 cited by
Kernel methods for evolution of generalized parton distributions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Kernel methods for evolution of generalized parton distributions
read the original abstract
Generalized parton distributions (GPDs) characterize the 3-dimensional structure of hadrons, combining information about their internal quark and gluon longitudinal momentum distributions and transverse position within the hadron. The dependence of GPDs on the factorization scale $Q^2$ allows one to connect hard exclusive processes involving GPDs at disparate energy and momentum scales, which is needed in global analyses of experimental data. In this work we explore how finite element methods can be used to construct fast and differentiable $Q^2$ evolution codes for GPDs in momentum space, which can be used in a machine learning framework. We show numerical benchmarks of the methods' accuracy, including a comparison to an existing evolution code from PARTONS/APFEL++, and provide a repository where the code can be accessed.
Forward citations
Cited by 2 Pith papers
-
TMDs in the Lens of Generative AI: A Pixel-Based Approach to Partonic Imaging
A nonparametric pixel-based Bayesian method integrates TMD evolution with generative AI and SVD to image parton distributions and reveal null TMDs unconstrained by observables.
-
TMDs in the Lens of Generative AI: A Pixel-Based Approach to Partonic Imaging
A nonparametric pixel-based Bayesian method integrates TMD evolution with generative AI sampling and SVD to extract parton distributions and identify unconstrained null components from multi-scale observables.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.