REVIEW 4 cited by
Soft-Collinear Messengers: A New Mode in Soft-Collinear Effective Theory
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
Soft-Collinear Messengers: A New Mode in Soft-Collinear Effective Theory
read the original abstract
It is argued that soft-collinear effective theory for processes involving both soft and collinear partons, such as exclusive B-meson decays, should include a new mode in addition to soft and collinear fields. These "soft-collinear messengers" can interact with both soft and collinear particles without taking them far off-shell. They thus can communicate between the soft and collinear sectors of the theory. The relevance of the new mode is demonstrated with an explicit example, and the formalism incorporating the corresponding quark and gluon fields into the effective Lagrangian is developed.
Forward citations
Cited by 4 Pith papers
-
Probing unknown nonperturbative effects in $b \to s \ell\ell$ with inclusive and exclusive observables
Ratios of exclusive to inclusive b to s lepton lepton observables discriminate between new physics and constant hadronic effects, with current data favoring new physics.
-
The Fate of Ultra-Collinear Modes in On-Shell Massive Sudakov Form Factors
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...
-
Random Reshuffling-Based Distributed Nash Equilibrium Seeking
Random reshuffling enables distributed Nash equilibrium seeking with linear convergence to a neighborhood under constant steps and exact almost-sure convergence under diminishing steps.
-
Random Reshuffling-Based Distributed Nash Equilibrium Seeking
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...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.