Papers › Bootstrability in Line-Defect CFT with Improved Truncation Methods
Bootstrability in Line-Defect CFT with Improved Truncation Methods
V. Niarchos, C. Papageorgakis, P. Richmond, A. G. Stapleton, M. Woolley
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study the conformal bootstrap of 1D CFTs on the straight Maldacena-Wilson line in 4D N=4 super-Yang-Mills theory. We introduce an improved truncation scheme with an 'OPE tail' approximation and use it to reproduce the 'bootstrability' results of Cavagli\`a et al. for the OPE-coefficients squared of the first three unprotected operators. For example, for the first OPE-coefficient squared at 't Hooft coupling (4π)², linear-functional methods with two sum rules from integrated correlators give the rigorous result 0.294014873 ±4.88 ·10⁻⁸, whereas our methods give with machine-precision computations 0.294014228 ±6.77 ·10⁻⁷. For our numerical searches, we benchmark the Reinforcement Learning Soft Actor-Critic algorithm against an Interior Point Method algorithm (IPOPT) and comment on the merits of each algorithm.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections