Pith. sign in

REVIEW 4 cited by

Massive vector form factors to three loops

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

arxiv 2202.05276 v1 pith:INH2DRFJ submitted 2022-02-10 hep-ph

Massive vector form factors to three loops

classification hep-ph
keywords factorsformaccountaccuracyallowsaroundcombinecompute
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We compute the three-loop non-singlet corrections to the photon-quark form factors taking into account the full dependence on the virtuality of the photon and the quark mass. We combine the method of differential equations in an effective way with expansions around regular and singular points. This allows us to obtain results for the form factors with an accuracy of about eight to twelve digits in the whole kinematic range.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 4 Pith papers

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

  1. Feynman Integrals Meet Second-Order Partial Differential Equations

    hep-ph 2026-07 conditional novelty 6.0

    Feynman integrals can be solved globally over phase space by rewriting them as second-order PDE equilibrium problems and discretizing with finite elements.

  2. The Fate of Ultra-Collinear Modes in On-Shell Massive Sudakov Form Factors

    hep-ph 2026-04 unverdicted novelty 6.0

    Ultra-collinear modes cancel to all orders in on-shell massive Sudakov form factors by gauge invariance, preserving SCET_II factorization, with explicit two-loop soft and jet functions computed via eta regulator and N...

  3. Random Reshuffling-Based Distributed Nash Equilibrium Seeking

    math.OC 2026-04 unverdicted novelty 6.0

    Random reshuffling enables distributed Nash equilibrium seeking with linear convergence to a neighborhood under constant steps and exact almost-sure convergence under diminishing steps.

  4. Random Reshuffling-Based Distributed Nash Equilibrium Seeking

    math.OC 2026-04 unverdicted novelty 5.0

    Random reshuffling yields distributed Nash-seeking algorithms that, under partial decision information, converge linearly to a neighborhood (constant steps) or exactly a.s./in mean square (diminishing steps), outperfo...