REVIEW 1 cited by
Artificial intelligence and machine learning generated conjectures with TxGraffiti
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
\emph{TxGraffiti} is a machine learning and heuristic based artificial intelligence designed to automate the task of conjecturing in mathematics. Since its inception, TxGraffiti has generated many surprising conjectures leading to publication in respectable mathematical journals. In this paper we outline the machine learning and heuristic techniques implemented by TxGraffiti. We also recall its contributions to the mathematical literature and announce a new online version of the program available for anyone curious to explore conjectures in graph theory.
Forward citations
Cited by 1 Pith paper
-
Reinforcement learning for graph theory, Parallelizing Wagner's approach
A parallelized RL search over graphs produces three new counterexamples to conjectured Laplacian spectral radius bounds, alongside a speedup claim that is only weakly supported.
Discussion (0). Continue with ORCID to comment.