Code for prompt numerical computation of the leading order GPD evolution

A.V. Vinnikov

Code for prompt numerical computation of the leading order GPD evolution

Not yet reviewed by Pith; the record is open.

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

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

arxiv hep-ph/0604248 v1 pith:Q43524CS submitted 2006-04-27 hep-ph

A.V. Vinnikov This is my paper

classification hep-ph

keywords codecomputationcomputerevolutiongpdsleadingnumericalorder

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original abstract

This paper describes the design and work of a set of computer routines capable for numerical computation of generalized parton distributions (GPDs) evolution at the leading order. The main intention of this work is to present a fast-working computer code making possible fitting of GPDs parameters to the data on hard electron-nucleon scattering.

Discussion (0). Sign in 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

Toward an event-level analysis of hadron structure using differential programming
hep-ph 2025-07 conditional novelty 4.0 of 10

LOITS is a differentiable sampling method, demonstrated in a GAN closure test, that maps sampled events back to the parameters of a target density for event-level inference.

Pith tools