A 2D-CFT Factory: Critical Lattice Models from Competing Anyon Condensation Processes in SymTO/SymTFT
Bibliographic record
Abstract
In this paper, we introduce a ``CFT factory'' : a novel algorithm of methodically generating 2D lattice models that would flow to 2D conformal fixed points in the infrared. These 2D models are realised by giving critical boundary conditions to 3D topological orders (symTOs/symTFTs) described by string-net models, often called the strange correlators. We engineer these critical boundary conditions by introducing a commensurate amount of non-commuting anyon condensates. The non-invertible symmetries preserved at the critical point can be controlled by studying a novel ``refined condensation tree''. Our structured method generates an infinite family of critical lattice models, including the A-series minimal models, and uncovers previously unknown critical points. Notably, we find at least three novel critical points (c$\approx 1.3$, $1.8$, and $2.5$ respectively) preserving the Haagerup symmetries, in addition to recovering previously reported ones. The condensation tree, together with a generalised Kramers-Wannier duality, predicts precisely large swathes of phase boundaries, fixes almost completely the global phase diagram, and sieves out second order phase transitions. This is not only illustrated in well-known examples (such as the 8-vertex model related to the $A_5$ category) but also further verified with precision numerics, using our improved (non-invertible) symmetry-preserving tensor-network RG, in novel examples involving the Haagerup symmetries. We show that critical couplings can be precisely encoded in the categorical data (Frobenius algebras and quantum dimensions in unitary fusion categories), thus establishing a powerful, systematic route to discovering and potentially classifying new conformal field theories.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".