Pith. sign in

REVIEW 1 cited by

A global optimization method for Landau gauge fixing in Lattice QCD

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-lat/0309184 v3 pith:36D5DQTK submitted 2003-09-29 hep-lat

O. Oliveira , P. J. Silva This is my paper
classification hep-lat
keywords gaugealgorithmfixinglatticemethodbetalandauable
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

An algorithm for gauge fixing to the minimal Landau gauge in lattice QCD is described. The method, a combination of an evolutionary algorithm with a steepest descent method, is able to solve the problem of the nonperturbative gauge fixing. The performance of the combined algorithm is investigated on $8^4$, $\beta = 5.7$, and $16^4$, $\beta = 6.0$, lattice SU(3) gauge configurations.

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.

  1. A Machine Learning Approach for Lattice Gauge Fixing

    hep-lat 2026-02 conditional novelty 5.0 of 10

    A Wilson-line-bundle CNN generates approximate Coulomb-gauge transformations that, combined with iterative gauge fixing, reduce lattice-gauge-fixing cost by ~1–4% and transfer across lattice volumes.

Pith tools