Pith. sign in

REVIEW 3 cited by

Reconstructing $S$-matrix Phases with Machine Learning

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 2308.09451 v1 pith:5ODP7YDT submitted 2023-08-18 hep-th cs.LGhep-ph

classification hep-thcs.LGhep-ph
keywords moduluslearningmachinematrixunitarityconsistentelementequation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

An important element of the $S$-matrix bootstrap program is the relationship between the modulus of an $S$-matrix element and its phase. Unitarity relates them by an integral equation. Even in the simplest case of elastic scattering, this integral equation cannot be solved analytically and numerical approaches are required. We apply modern machine learning techniques to studying the unitarity constraint. We find that for a given modulus, when a phase exists it can generally be reconstructed to good accuracy with machine learning. Moreover, the loss of the reconstruction algorithm provides a good proxy for whether a given modulus can be consistent with unitarity at all. In addition, we study the question of whether multiple phases can be consistent with a single modulus, finding novel phase-ambiguous solutions. In particular, we find a new phase-ambiguous solution which pushes the known limit on such solutions significantly beyond the previous bound.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Descending into the Modular Bootstrap

    hep-th 2026-04 unverdicted novelty 7.0 of 10

    Numerical search finds candidate modular-invariant spectra with integer degeneracies for 1 < c < 8/7 and hints at a stronger gap bound near c = 1.

  2. The S-matrix bootstrap with neural optimizers I: zero double discontinuity

    hep-th 2024-12 conditional novelty 7.0 of 10

    A neural optimizer solves the Atkinson-Mandelstam unitarity equations over the full space of amplitudes and, together with standard bootstrap methods, maps the allowed region of zero-double-discontinuity S-matrices, t...

  3. Explainable AI-assisted Optimization for Feynman Integral Reduction

    hep-ph 2025-02 conditional novelty 6.0 of 10

    FunSearch discovered a simple priority function for ordering IBP seeding integrals, reducing the number needed for multi-loop Feynman integral reductions by factors up to 3058.

Pith tools