pith. sign in

arxiv: 2409.19379 · v2 · submitted 2024-09-28 · 🧮 math.CO · cs.AI

Automated conjecturing with TxGraffiti

Randy Davila This is my paper

Pith reviewed 2026-05-23 21:12 UTC · model grok-4.3

classification 🧮 math.CO cs.AI
keywords automated conjecturinggraph theoryTxGraffitiDalmatian heuristicconjecture generationheuristic filteringmathematical software
0
0 comments X

The pith

TxGraffiti automates conjecture generation in graph theory by collecting data on objects and applying the Dalmatian heuristic to remove redundant claims.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper presents TxGraffiti as a data-driven program that generates mathematical conjectures, building on the earlier Graffiti system. It details the steps of gathering information about graphs or other structures, forming plausible statements, and using the Dalmatian heuristic to discard those that are implied by others or already known. The program has produced conjectures that led to actual publications, and a new web interface lets users browse the output. A reader would care if the approach scales because it shifts some of the initial exploration work from humans to computation.

Core claim

TxGraffiti collects data on mathematical objects such as graphs, generates candidate conjectures from that data, and applies the Dalmatian heuristic to filter out redundant or transitive statements, thereby producing a set of conjectures that have been verified and published in the mathematical literature.

What carries the argument

The Dalmatian heuristic, which identifies and removes conjectures that are logically implied by others or already established, thereby reducing the output to non-redundant statements.

If this is right

  • Conjectures produced by the program have been proved and appeared in graph-theory publications.
  • The same data-collection and filtering steps can be applied outside graph theory.
  • A web interface allows direct exploration of the generated conjectures without running the program locally.
  • Continued use of the heuristic keeps the list of active conjectures free of obvious repetitions.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the filtering step works reliably, mathematicians could spend less time checking trivial or already-known statements.
  • Extending the data sources to include larger or more varied families of objects might surface conjectures that current manual searches miss.
  • Combining the output with automated proof assistants could create a tighter loop from conjecture to verification.

Load-bearing premise

The Dalmatian heuristic and the chosen data collection rules succeed in producing conjectures that are both new enough and interesting enough to be proved and published.

What would settle it

A record showing that after 2024 no further peer-reviewed papers cite or prove new conjectures first generated by TxGraffiti.

read the original abstract

\emph{TxGraffiti} is a data-driven, heuristic-based computer program developed to automate the process of generating conjectures across various mathematical domains. Since its creation in 2017, \emph{TxGraffiti} has contributed to numerous mathematical publications, particularly in graph theory. In this paper, we present the design and core principles of \emph{TxGraffiti}, including its roots in the original \emph{Graffiti} program, which pioneered the automation of mathematical conjecturing. We describe the data collection process, the generation of plausible conjectures, and methods such as the \emph{Dalmatian} heuristic for filtering out redundant or transitive conjectures. Additionally, we highlight its contributions to the mathematical literature and introduce a new web-based interface that allows users to explore conjectures interactively. While we focus on graph theory, the techniques demonstrated extend to other areas of mathematics.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 3 minor

Summary. The manuscript describes TxGraffiti, a data-driven heuristic-based program for automating conjecture generation in mathematics (with emphasis on graph theory). It traces the program's roots to the original Graffiti system, outlines the data collection process and conjecture generation methods, details the Dalmatian heuristic for filtering redundant or transitive conjectures, reports historical contributions to publications since 2017, and introduces a new web-based interface for interactive exploration.

Significance. If the reported history of contributions and the practical utility of the Dalmatian heuristic are accurate, the work provides a documented case study of automated conjecturing tools in combinatorics and makes the system more accessible via the web interface. The paper's value lies in its descriptive account of an established tool rather than new theorems or derivations.

minor comments (3)
  1. [Abstract] The abstract states that TxGraffiti 'has contributed to numerous mathematical publications' but provides no specific citations, examples of conjectures, or summary table; adding a brief list or reference to the relevant prior papers would improve verifiability of the central historical claim.
  2. The description of the Dalmatian heuristic is high-level; a short pseudocode outline or concrete example of how it identifies and removes transitive conjectures would clarify its operation without altering the descriptive scope.
  3. [Abstract] The claim that 'the techniques demonstrated extend to other areas of mathematics' is stated but not illustrated; a single non-graph-theory example or reference would strengthen the generality statement.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their review of our manuscript on TxGraffiti. The provided summary accurately reflects the paper's content, and we appreciate the recommendation for minor revision. No specific major comments were raised in the report.

Circularity Check

0 steps flagged

No significant circularity

full rationale

The paper is a descriptive account of the TxGraffiti software, its design, data collection methods, and the Dalmatian heuristic for conjecture filtering. No mathematical derivation, equations, fitted parameters presented as predictions, or load-bearing self-citations appear in the abstract or stated scope. The central claim of contributions to publications is presented as historical reporting rather than a theorem derived from internal steps. No self-definitional loops, ansatzes smuggled via citation, or renaming of known results are present. The paper is self-contained as a methods description against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

This is a software description paper with no mathematical derivation, fitted parameters, or theoretical axioms; no free parameters, axioms, or invented entities apply.

pith-pipeline@v0.9.0 · 5670 in / 1032 out tokens · 28294 ms · 2026-05-23T21:12:56.938773+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. SCALAR: A Neurosymbolic Framework for Automated Conjecture and Reasoning in Quantum Circuit Analysis

    quant-ph 2026-05 unverdicted novelty 6.0

    SCALAR generates conjectures linking optimal QAOA parameters to graph invariants, recovers known periodicity and parameter-transfer properties, and identifies correlations with optimization landscapes across thousands...

  2. Artificial Intelligence and the Structure of Mathematics

    cs.AI 2026-04 unverdicted novelty 4.0

    AI agents exploring Platonic mathematical structures via proof hypergraphs may reveal the overall architecture of formal mathematics and what makes parts of it human-accessible.

Reference graph

Works this paper leans on

70 extracted references · 70 canonical work pages · cited by 2 Pith papers

  1. [1]

    The Essential Turing, 395–432 (2004)

    Turing, A.: Intelligent machinery. The Essential Turing, 395–432 (2004)

    work page 2004

  2. [2]

    Simon, H.A., Newell, A.: Heuristic problem solving: the next advance in opera- tions research. Oper. Res. 6, 1–10 (1958)

    work page 1958

  3. [3]

    McCune, W.: Solution of the robbins problem. J. Autom. Reason. 19, 263–276 (1997)

    work page 1997

  4. [4]

    Computation, Logic, Philosophy, 63–75 (1990)

    Wang, H.: Computer theorem proving and artificial intelligence. Computation, Logic, Philosophy, 63–75 (1990)

    work page 1990

  5. [5]

    Fajtlowicz, S.: On conjectures of graffiti, II. Congr. Numer. 60 (1987)

    work page 1987

  6. [6]

    Fajtlowicz, S.: A characterization of radius-critical graphs. J. Graph Theory 12 (1988)

    work page 1988

  7. [7]

    Discrete Math

    Fajtlowicz, S.: On conjectures of graffiti. Discrete Math. 72, 113–118 (1988)

    work page 1988

  8. [8]

    Fajtlowicz, S.: On conjectures of graffiti, III. Congr. Numer. 66 (1988)

    work page 1988

  9. [9]

    Fajtlowicz, S.: On conjectures of graffiti, IV. Congr. Numer., 231–240 (1990)

    work page 1990

  10. [10]

    In: 7th Int

    Fajtlowicz, S.: On conjectures of graffiti, part V. In: 7th Int. Quadrennial Conf. Graph Theory, Comb. Appl., vol. 1, pp. 367–376 (1995)

    work page 1995

  11. [11]

    Fajtlowicz, S., Waller, W.: On two conjectures of graffiti. Congr. Numer. (1986)

    work page 1986

  12. [12]

    Chung, F.: The average distance is not more than the independence number. J. Graph Theory 12, 229–235 (1988)

    work page 1988

  13. [13]

    Alon, N., Seymour, P.: A counter-example to the rank-coloring conjecture. J. Graph Theory 13, 523–525 (1989)

    work page 1989

  14. [14]

    In: 4th Proceedings Clemson Miniconference (1989)

    Fajtlowicz, S.: On conjectures and methods of graffiti. In: 4th Proceedings Clemson Miniconference (1989)

    work page 1989

  15. [15]

    Technical report, University of Puget Sound Dept

    Beezer, R.A., Riegsecker, J., Smith, B.A.: On conjectures of graffiti concerning regular graphs. Technical report, University of Puget Sound Dept. of Mathematics and Computer Science (1989). Technical Report No. 89-1

    work page 1989

  16. [16]

    Ars Comb

    Favaron, O., Maheo, M., Sacle, J.-F.: Some results on conjectures of graffiti - 1. Ars Comb. 29, 90–106 (1990)

    work page 1990

  17. [17]

    Technical report, Universite de Paris-Sud (1991)

    Favaron, O., Maheo, M., Sacle, J.-F.: Some results on conjectures of graffiti - iii. Technical report, Universite de Paris-Sud (1991). Research Report No. 670, LRI 23

    work page 1991

  18. [18]

    Favaron, O., Maheo, M., Sacle, J.-F.: On the residue of a graph. J. Graph Theory 15, 39–64 (1991)

    work page 1991

  19. [19]

    Discrete Math

    Favaron, O., Maheo, M., Sacle, J.-F.: Some eigenvalue properties in graphs (conjectures of graffiti - ii). Discrete Math. 111, 197–220 (1993)

    work page 1993

  20. [20]

    Discrete Math

    Griggs, J.R., Kleitman, D.J.: Independence and the havel-hakimi residue. Discrete Math. 127, 209–212 (1994)

    work page 1994

  21. [21]

    Ars Comb

    Fajtlowicz, S., McColgan, T., Reid, T.J., Staton, W.: Ramsey numbers of induced regular subgraphs. Ars Comb. 39, 149–154 (1995)

    work page 1995

  22. [22]

    Wang, L.-X.: On one of graffiti’s conjecture 583. Appl. Math. Mech. 18(4), 357– 360 (1997)

    work page 1997

  23. [23]

    Discrete Appl

    Firby, P., Haviland, J.: Independence and average distance in graphs. Discrete Appl. Math. 75, 27–37 (1997)

    work page 1997

  24. [24]

    Ars Comb

    Bollobas, B., Erdos, P.: Graphs of extremal weights. Ars Comb. 50, 255–233 (1998)

    work page 1998

  25. [25]

    Discrete Math

    Bollobas, B., Riordan, O.M.: On some conjectures of graffiti. Discrete Math. 179, 223–230 (1998)

    work page 1998

  26. [26]

    Caro, Y.: Colorability, frequency and graffiti-119. J. Comb. Math. Comb. Comput. 27, 129–134 (1998)

    work page 1998

  27. [27]

    Dankelmann, P., Swart, H., Oellermann, O.: On three conjectures of graffiti. J. Comb. Math. Comb. Comput. 26, 131–137 (1998)

    work page 1998

  28. [28]

    Jelen, F.: k-independence and the k-residue of a graph. J. Graph Theory 32, 241–249 (1999)

    work page 1999

  29. [29]

    Linear Algebra Appl

    Codenotti, B., Del Corso, G., Manzini, G.: Matrix rank and communication complexity. Linear Algebra Appl. 304, 193–200 (2000)

    work page 2000

  30. [30]

    Discrete Math

    Beezer, R.A., Riegsecker, J., Smith, B.A.: Using minimum degree to bound average distance. Discrete Math. 226, 365–371 (2001)

    work page 2001

  31. [31]

    MATCH Commun

    Favaron, O., Maheo, M., Sacle, J.-F.: The randic index and other graffiti parameters of graphs. MATCH Commun. Math. Comput. Chem.47, 7–23 (2003)

    work page 2003

  32. [32]

    Linear Algebra Appl

    Zhang, X.-D.: On the two conjectures of graffiti. Linear Algebra Appl. 385, 369– 379 (2004)

    work page 2004

  33. [33]

    Dankelmann, P., Dlamini, G., Swart, H.C.: Upper bounds on distance measures in k3,3-free graphs. Util. Math. 67, 205–221 (2005) 24

    work page 2005

  34. [34]

    Hansen, P., Hertz, A., Kilani, R., Marcotte, O., Schindl, D.: Average distance and maximum induced forest. J. Graph Theory 60(1), 31–54 (2009)

    work page 2009

  35. [35]

    MATCH Commun

    Cygan, M., Pilipczuk, M., Skrekovski, R.: On the inequality between radius and rankic index for graphs. MATCH Commun. Math. Comput. Chem. 67, 451–466 (2012)

    work page 2012

  36. [36]

    Discrete Math

    Yue, J., Zhu, Y., Klavzar, S.: The annihilation number does not bound the 2- domination number from the above. Discrete Math. (2019)

    work page 2019

  37. [37]

    Fowler, P.: Fullerene graphs with more negative than positive eigenvalues; the exceptions that prove the rule of electron deficiency. J. Chem. Soc. Faraday 93, 1–3 (1997)

    work page 1997

  38. [38]

    Fowler, P., Hansen, P., Rogers, K.M., Fajtlowicz, S.: C60br24 as a chemical illustration of graph theoretical independence. J. Chem. Soc. Perkin Trans. 2 (1998)

    work page 1998

  39. [39]

    leapfrog, cylinder and fullerene graphs

    Fowler, P., Rodgers, K., Fajtlowicz, S., Hansen, P., Caporossi, G.: Facts and conjectures about fullerene graphs. leapfrog, cylinder and fullerene graphs. In: Proc. Euroconf. ALCOMA (1999)

    work page 1999

  40. [40]

    Fajtlowicz, S., Larson, C.: Graph-theoretical independence as a predictor of fullerene stability. Chem. Phys. Lett. 377, 485–490 (2003)

    work page 2003

  41. [41]

    In: Graphs and Discovery DIMACS: Ser

    Stevanovic, D., Caporossi, G.: On the (1,2)-spectral spread of fullerenes. In: Graphs and Discovery DIMACS: Ser. Discrete Math. Theor. Comput. Sci. vol. 69, pp. 395–370 (2005)

    work page 2005

  42. [42]

    In: Graphs and Discovery DIMACS: Ser

    Fajtlowicz, S.: On representation and characterization of buckminsterfullerene c60. In: Graphs and Discovery DIMACS: Ser. Discrete Math. Theor. Comput. Sci. vol. 69, pp. 127–135 (2005)

    work page 2005

  43. [43]

    Fajtlowicz, S., John, P., Sach, H.: On maximum matchings and eigenvalues of benzenoid graphs. Croat. Chem. Acta 78, 195–201 (2005)

    work page 2005

  44. [44]

    MATCH Commun

    Doslic, T., Reti, T.: Spectral properties of fullerene graphs. MATCH Commun. Math. Comput. Chem. 66, 733–742 (2011)

    work page 2011

  45. [45]

    Larson, C.E., Van Cleemput, N.: Automated conjecturing i: Fajtlowicz’s dalma- tian heuristic revisited. Artif. Intell. 231, 17–38 (2016)

    work page 2016

  46. [46]

    Discrete Math

    Henning, M.A., Yeo, A.: Total domination and matching numbers in graphs with all vertices in triangles. Discrete Math. 313, 174–181 (2013)

    work page 2013

  47. [47]

    Discrete Appl

    Henning, M.A., Yeo, A.: A new lower bound for the total domination number in graphs proving a graffiti.pc conjecture. Discrete Appl. Math. 173, 45–52 (2014) 25

    work page 2014

  48. [48]

    Discrete Math

    Henning, M.A., Wash, K.: Matchings, path covers and domination. Discrete Math. 340, 3207–3216 (2017)

    work page 2017

  49. [49]

    Lenat, D.B.: The ubiquity of discovery. Artif. Intell. 9, 257–285 (1977)

    work page 1977

  50. [50]

    Lenat, D.B.: On automated scientific theory formation: A case study using the am program. Mach. Intell. 9, 251–286 (1979)

    work page 1979

  51. [51]

    Lenat, D.B.: The nature of heuristics. Artif. Intell. 9, 189–249 (1982)

    work page 1982

  52. [52]

    Epstein, S.L.: Learning and discovery: One system’s search for mathematical knowledge. Comput. Intell. 4(1), 42–53 (1988)

    work page 1988

  53. [53]

    In: Proceedings of the 16th International Joint Conference on Artificial Intelligence, vol

    Colton, S., Bundy, A., Walsh, T.: Automated concept formation in pure mathe- matics. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence, vol. 2, pp. 786–791. Morgan Kaufmann Publishers, San Francisco, CA (1999)

    work page 1999

  54. [54]

    Colton, S.: Refactorable numbers—a machine invention. J. Integer Seq. 2, 99–12 (1999)

    work page 1999

  55. [55]

    Springer, Hei- delberg (2002)

    Colton, S.: Automated Theory Formation in Pure Mathematics. Springer, Hei- delberg (2002). https://doi.org/10.1007/978-1-4471-0147-5

    work page doi:10.1007/978-1-4471-0147-5 2002

  56. [56]

    Discrete Math

    Caporossi, G., Hansen, P.: Variable neighborhood search for extremal graphs: 1 the autographix system. Discrete Math. 212(1–2), 29–44 (2000)

    work page 2000

  57. [57]

    Discrete Math

    Caporossi, G., Hansen, P.: Variable neighborhood search for extremal graphs: 5 three ways to automate finding conjectures. Discrete Math. 276(1–3), 81–94 (2004)

    work page 2004

  58. [58]

    Discrete Appl

    M´ elot, H.: Facet defining inequalities among graph invariants: The system graphedron. Discrete Appl. Math. 156, 1875–1891 (2008)

    work page 2008

  59. [59]

    In: Operations Research Proceedings 2018: Selected Papers of the Annual Inter- national Conference of the German Operations Research Society, pp

    Devillez, G., Hauweele, P., M´ elot, H.: PHOEG Helps to Obtain Extremal Graphs. In: Operations Research Proceedings 2018: Selected Papers of the Annual Inter- national Conference of the German Operations Research Society, pp. 251–257. Springer, Cham, Switzerland (2019)

    work page 2018

  60. [60]

    Akademiai Kiado, Budapest (1936)

    K˝ onig, D.: Theory of Finite and Infinite Graphs. Akademiai Kiado, Budapest (1936)

    work page 1936

  61. [61]

    ArXiv abs/2104.14516 (2021)

    Wagner, A.Z.: Constructions in combinatorics via neural networks. ArXiv abs/2104.14516 (2021)

    work page arXiv 2021

  62. [62]

    reimplementation of wagner’s approach

    Ghebleh, M., Al-Yakoob, S.M., Kanso, A.A., Stevanovi´ c, D.: Reinforcement learning for graph theory, i. reimplementation of wagner’s approach. (2024). https://api.semanticscholar.org/CorpusID:268723946 26

    work page 2024

  63. [63]

    In: Fajtlowicz, S., Fowler, P.W., Hansen, P., Janowitz, M.F., Roberts, F.S

    Pepper, R.: On new didactics of mathematics: Learning graph theory via graf- fiti. In: Fajtlowicz, S., Fowler, P.W., Hansen, P., Janowitz, M.F., Roberts, F.S. (eds.) Graphs and Discovery. DIMACS Series in Discrete Mathematics and The- oretical Computer Science, vol. 69, pp. 77–88. American Mathematical Society, Providence, RI (2005). https://doi.org/10.10...

    work page doi:10.1090/dimacs/069 2005

  64. [64]

    Caro, Y., Davila, R., Pepper, R.: New results relating matching and independence. Discuss. Math. Graph Theory 42, 921–935 (2020)

    work page 2020

  65. [65]

    Discrete Appl

    Brimkov, B., Davila, R., Schuerger, H., Young, M.: Computer assisted discovery: Zero forcing vs vertex cover. Discrete Appl. Math. 359, 290–302 (2024)

    work page 2024

  66. [66]

    Australas

    Caro, Y., Davila, R., Henning, M.A., Pepper, R.: Conjectures of TxGraffiti: Independence, domination, and matchings. Australas. J. Comb. 84(2), 258–274 (2022)

    work page 2022

  67. [67]

    Davila, R., Henning, M.A.: Zero forcing versus domination in cubic graphs. J. Comb. Optim. 41, 553–577 (2021)

    work page 2021

  68. [68]

    Davila, R., Henning, M.A.: Total forcing versus total domination in cubic graphs. Appl. Math. Comput. 354, 385–395 (2019)

    work page 2019

  69. [69]

    arXiv preprint arXiv:2406.19231 (2024)

    Davila, R.: Another conjecture of TxGraffiti concerning zero forcing and dom- ination in graphs. arXiv preprint arXiv:2406.19231 (2024). https://doi.org/10. 48550/arXiv.2406.19231

    work page arXiv 2024

  70. [70]

    West, D.: Introduction to Graph Theory 2nd Edition, 2nd edn. Prentice-Hall, HoBoken, New Jersey (2000) A Number Theory Conjectures Definitions • Prime: A positive integer n is a prime number if it has exactly two distinct positive divisors: 1 and itself. • Sum of digits: The sum of digits of a positive integer n, denoted as sum of digits(n), is the sum of...

    work page 2000