REVIEW 3 cited by
Genetic Algorithms and the Search for Viable String Vacua
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
read the original abstract
Genetic Algorithms are introduced as a search method for finding string vacua with viable phenomenological properties. It is shown, by testing them against a class of Free Fermionic models, that they are orders of magnitude more efficient than a randomised search. As an example, three generation, exophobic, Pati-Salam models with a top Yukawa occur once in every 10^{10} models, and yet a Genetic Algorithm can find them after constructing only 10^5 examples. Such non-deterministic search methods may be the only means to search for Standard Model string vacua with detailed phenomenological requirements.
Forward citations
Cited by 3 Pith papers
-
When minor issues matter: symmetries, pluralism, and polarization in similarity-based opinion dynamics
Even an arbitrarily small-weight issue can destabilize stable opinion states and massively slow convergence; concentrating importance on few issues raises polarization, while spreading it promotes pluralism.
-
Machine Learning the 6d Supergravity Landscape
An autoencoder and two neural classifiers, trained only on anomaly Gram matrices, provide automated clustering, outlier detection, and consistency predictions for millions of 6d supergravity building blocks.
-
Pre-Strings Lectures on Artificial Intelligence
Lecture notes define neural-network field theory and survey how it recovers known QFT/string results plus applied AI techniques for string problems.
Discussion (0). Continue with ORCID to comment.