Pith. sign in

REVIEW 3 cited by

Massive three-loop form factors: anomaly contribution

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 2302.00693 v1 pith:4MJNPJAH submitted 2023-02-01 hep-ph

Massive three-loop form factors: anomaly contribution

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

We compute three-loop corrections to the singlet form factors for massive quarks using a semi-analytic method which provides precise results over the whole kinematic range. Particular emphasis is put on the anomaly contribution originating from an external axial-vector current. We also discuss in detail the contribution for a pseudoscalar current and verify the chiral Ward identity to three-loop order. Explicit results are presented for the low- and high-energy regions and the expansions around threshold.

discussion (0)

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

Forward citations

Cited by 3 Pith papers

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

  1. 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...

  2. 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.

  3. 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...