Pith. sign in

REVIEW 3 major objections 4 minor 20 references

A table of genus two handlebody-knots with seven crossings

T0 review · 3 major / 4 minor · reviewed 2026-08-03 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper completes the enumeration of all genus-two handlebody-knots with seven crossings, up to mirror image.

desk verdict Solid extension of the genus-two handlebody-knot table to seven crossings with some genuinely new hard-pair proofs, but the completeness claim rests on unshipped enumeration code and a missing figure reference. read the letter →

arxiv 2511.12194 v2 pith:KX4TDWMI submitted 2025-11-15 math.GT

Giovanni Bellettini , Giovanni Paolini , Maurizio Paolini , Yi-Sheng Wang This is my paper · ORCID
classification math.GT MSC 57K1257M1505C30
keywords handlebody-knotgenustwospatialgraphscrossingnumbertableofknotsthetacurveshandcuffKitano-Suzukiinvariants
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

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

The reading

A genus-two handlebody-knot is a thickened surface of genus two embedded in the 3-sphere, studied through diagrams of its trivalent spines. The paper aims to prove that Tables 1 and 2 list every such knot whose crossing number is seven, up to mirror image, with no repetitions: Table 1 for irreducible knots and Table 2 for reducible ones. This extends the previously known table through six crossings. If correct, the classification at crossing number seven is complete, giving researchers an exhaustive catalogue for testing invariants and conjectures about handlebody-knots.

What carries the argument

The load-bearing mechanism is the edge-connectivity trichotomy for minimal diagrams. Every trivalent spine of a genus-two handlebody-knot is a theta graph or a handcuff graph, so its minimal diagrams split into three classes by edge-connectivity (3, 2, or 1). In the 3-connected case, 3-connected plane graphs with two trivalent and seven quadrivalent vertices are enumerated by computer (908 graphs), then crossing choices are resolved and reduced by crossing-reducing moves to 932 candidate diagrams. Connectivity-2 diagrams arise as 2-sums of a 3-connected base graph with prime knots; connectivity-1 diagrams arise as 1-sums of knots. Duplication is ruled out by a growing tree of finite-group in

What would settle it

A single seven-crossing genus-two handlebody-knot whose minimal diagram is not equivalent, up to mirror image, to any diagram in Tables 1 or 2 would falsify the completeness claim. Concretely, one could independently re-run the plane-graph census and the crossing-resolution pipeline: if the 908-graph count or the 932-diagram set differs, or if any 7-crossing knot from the known spatial-graph tables of theta curves and handcuff graphs is missing from the handlebody-knot table, the 'all' claim fails.

Watch

Extended reading notes

Core claim

The central claim is Theorem 1.1 and Theorem 1.2: every genus-two handlebody-knot with seven crossings is represented by exactly one diagram in the union of Table 1 (69 irreducible knots) and Table 2 (reducible knots), up to orientation-preserving homeomorphism of the 3-sphere and mirror image. Completeness is proved by partitioning all minimal diagrams into three classes according to the edge-connectivity of their underlying plane graph: 3-connected, connectivity 2, and connectivity 1. For the 3-connected class the authors enumerate all 908 plane graphs with two trivalent and seven quadrivalent vertices, resolve the quadrivalent vertices into crossings, and filter out diagrams that are mult

Load-bearing premise

The completeness of Theorem 1.1 rests on the computer enumeration in Section 3.1 correctly listing every 3-connected plane graph with two trivalent and seven quadrivalent vertices (claimed to be 908) and on the filtering software removing only diagrams that are multi-component or non-minimal; a bug at either step would break the word 'all' even if every pictured diagram is correct.

Editorial extensions

If this is right

  • The classification gives a complete, duplication-free catalogue of seven-crossing genus-two handlebody-knots, extending the known table from six to seven crossings.
  • Every seven-crossing example is either irreducible (Table 1) or reducible (Table 2), so irreducible versus reducible behaviour at this crossing number is fully known.
  • The table provides a test set for conjectured invariants: any proposed complete invariant must assign distinct values to the 69 irreducible entries and agree within each table's equivalence classes.
  • The results clarify which seven-crossing spatial theta graphs and handcuff graphs represent the same handlebody-knot, refining the correspondence between spatial graphs and their regular neighborhoods.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Editorial inference: if the enumeration pipeline is sound, the same 3-connected graph census could in principle be pushed to eight crossings, though the doubling of crossing resolutions makes the filtering step the practical bottleneck.
  • Editorial inference: the paper's note that quandle invariants can separate some of the hard pairs suggests a purely algebraic proof of non-duplication is available for those entries.
  • Editorial inference: the 908-graph census of 3-connected plane graphs with exactly two trivalent and seven quadrivalent vertices is a self-contained combinatorial statement that could be verified independently and reused in other spatial-graph enumerations.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 4 minor

Summary. The paper presents a complete enumeration of genus two handlebody-knots with seven crossings, up to mirror image, dividing them into an irreducible table (Table 1, 69 entries) and a reducible table (Table 2). The proof splits minimal diagrams into three connectivity classes: 3-connected, connectivity 2, and connectivity 1. The 3-connected case relies on a computer enumeration of 908 underlying plane graphs and a filtering step that yields 932 diagrams; the connectivity 2 case is reduced to 2-sums of base spatial graphs with prime knots; the connectivity 1 case is reduced to 1-sums of genus one handlebody-knots. No duplicates are shown using a dynamic tree of invariants plus explicit proofs for three 'hard pairs' in Section 6 and two pairs delegated to a companion preprint.

Significance. If the computational steps are correct, the paper constitutes a significant extension of the Ishii–Kishimoto–Moriuchi–Suzuki table from six to seven crossings and would give the first complete classification at crossing number 7. The hard-pair proofs use sophisticated tools (unique P3-systems, essential annuli, JSJ decompositions) and are presented in detail. However, the main theorem's completeness depends on unarchived code and an underspecified filtering rule with a missing figure, which prevents independent verification from the paper alone.

major comments (3)
  1. [§3.1] The exhaustiveness claim of Theorem 1.1 for the 3-connected case rests on two computer programs: the second author's code yielding 908 plane graphs and the third author's software reducing 908·2^6 crossing assignments to a set D3 of 932 diagrams. Neither the code nor the resulting data is shipped or referenced to a permanent archive. Moreover, one of the filtering rules refers to 'Fig.??', which is absent. As written, the reduction step is not fully specified and a reader cannot verify that no legitimate minimal diagram is discarded. Please provide the enumeration data, the complete filtering procedure, and the missing figure, or state explicitly where these can be obtained.
  2. [§4 and §6] There is an inconsistency in the list of hard pairs. Section 4 lists the five pairs as (5_1,7_39), (7_40,7_41), (7_43,7_44), (7_59,7_60), and (6_12,7_39), but Theorem 6.3 proves inequivalence of 5_1 and 7_52, not 5_1 and 7_39. If 7_39 is intended, the proof for that pair is missing; if 7_52 is intended, the list contains a typo. This must be corrected so that every listed pair is addressed.
  3. [§4, last paragraph] The inequivalence of the pairs (7_59,7_60) and (6_12,7_39) is delegated to the companion preprint [5]. Since the present paper claims a table with no duplicate entries, this external dependency is load-bearing for the no-duplicates assertion. The authors should either include the proofs for these pairs or explicitly state that the table's distinctness is conditional on [5] being correct.
minor comments (4)
  1. [§2.1] Typo: 'Sectino 4.4' should be 'Section 4.4'.
  2. [§3.2, third paragraph] The sentence 'we have k=2' appears to be a typo for 'k≤2'. Immediately afterwards the authors conclude k=1, which is consistent only with k≤2.
  3. [§4, footnote 2] The footnote reports that Ishii–Kishimoto find 3 hard pairs, while the paper initially lists 5. This discrepancy deserves a brief explanation, especially since quandle invariants are said to differentiate some of the pairs.
  4. [§3.1, last line] The notation '2·2^6' (or 908·2^6) is clear from context, but the expression '908·2 6' in the text may confuse readers; consider typesetting the exponent properly.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the tables are the output of an enumeration, and the load-bearing self-citations are parameter-free prior theorems.

full rationale

The derivation chain is not circular. The completeness claim (Theorem 3.1) is a case split by edge-connectivity: Section 3.1 uses a computer enumeration of 3-connected plane graphs, Section 3.2 reduces connectivity-2 diagrams to base graphs from Table 3 plus prime knots up to five crossings, and Section 3.3 handles 1-sums. No parameter is fitted to the final tables, and no invariant is defined in terms of the table entries. The no-duplication argument uses Kitano-Suzuki and G-image invariants plus explicit Reidemeister-move checks, with the five hard pairs handled by results in [3], [17], [18], and the companion preprint [5]. These citations are to parameter-free theorems that do not assume the present classification, so under the stated rules they are independent support and do not raise the circularity score. The manuscript itself flags reproducibility gaps: the Section 3.1 filtering rule references a missing 'Fig.??', no code or data is shipped, and two hard pairs are deferred to a companion preprint. These are verifiability and completeness concerns, not circularity: no claim is made true by construction or by renaming a fitted quantity. Therefore the circularity score is 0.

Assumptions & free parameters 0 free parameters · 5 assumptions · 0 invented entities

The paper is an enumeration, not a parameter-fitting derivation, so no free parameters appear. The listed axioms are the published equivalence, irreducibility, and uniqueness theorems it relies on, plus the key unverified computational exhaustiveness of the 3-connected graph enumeration.

assumptions (5)
  • standard math Equivalence of handlebody-knots iff their diagrams are connected by generalized Reidemeister moves and IH-moves ([7, Corollary 2]).
    Used from the start to decide when two diagrams represent the same handlebody-knot; the paper relies on it without proof.
  • ad hoc to paper The second author's code exhaustively enumerates all 3-connected plane graphs with two trivalent vertices and seven quadrivalent vertices, yielding 908 graphs up to mirror image.
    Load-bearing for the completeness of Table 1; no code, data, or independent enumeration is shipped in the preprint (Section 3.1).
  • domain assumption Irreducibility criteria in Theorem 5.1, taken from the authors' [2], correctly decide reducibility from rank and Kitano-Suzuki invariants.
    Used in Section 5 to split Tables 1 and 2; the criteria are cited theorems from the same group.
  • domain assumption Uniqueness theorems for essential annuli and maximal P3-systems ([3, Theorem 1.1], [18, Theorem 1.4], [17, Theorem 1.2]) hold for the handlebody-knots in Section 6.
    Basis for the hard-pair inequivalence proofs; these are published results, several by the authors.
  • standard math Standard tables of prime knots, theta-curves, and handcuff graphs up to seven crossings are complete and correct.
    Section 3.2 builds the connectivity-2 class from these tables; Section 3.3 uses knotted-curve sums.

how reviews work

0 comments
Cite this review

Pith. "Pith review of A table of genus two handlebody-knots with seven crossings." pith.science (2026). https://pith.science/paper/KX4TDWMI

@misc{pith2026251112194,
  author       = {Pith},
  title        = {Pith review of: A table of genus two handlebody-knots with seven crossings},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/KX4TDWMI}},
  note         = {Machine review of arXiv:2511.12194}
}
read the original abstract

We enumerate all genus two handlebody-knots with seven crossings, up to mirror image, extending the Ishii-Kishimoto-Moriuchi-Suzuki table.

Figures

Figures reproduced from arXiv: 2511.12194 by the authors.

Figure 2
Figure 2. [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 2.2
Figure 2.2. Classical Reidemeister moves of type I, II, III. IV V [PITH_FULL_IMAGE:figures/full_fig_p004_2_2.png] view at source ↗
Figure 2.3
Figure 2.3. Reidemeister moves IV and V involving a trivalent vertex. IH−move [PITH_FULL_IMAGE:figures/full_fig_p004_2_3.png] view at source ↗
Figures from the paper (8 more)
Figure 2.4
Figure 2.4. Figure 2.4: IH-move. 3. Completeness Hereinafter, for the sake of simplicity, unless otherwise specified, by a handlebody￾knot, we understand a genus two handlebody-knot. To enumerate all seven crossing handlebody-knots, our approach is to divide minimal diagrams into three clas…
Figure 3.1
Figure 3.1. Figure 3.1: Crossing-reducing moves. 01x loop-fork [PITH_FULL_IMAGE:figures/full_fig_p005_3_1.png]
Figure 3.2
Figure 3.2. Figure 3.2: More crossing-reducing moves. “01x” is an IH-move followed by a Move V; “loop-fork” is given by twisting the loop and then a fork in [PITH_FULL_IMAGE:figures/full_fig_p005_3_2.png]
Figure 3.3
Figure 3.3. Figure 3.3: Loop flipping moves. 2-sum of diagrams and spatial graphs. A 2-sum of two spatial graphs Γ1, Γ2 is constructed as follows [11]: For each i = 1, 2, we first orient every arc in Γi , and secondly, consider a 3-ball Bi with Bi ∩ Γi a subarc of an edge ei of Γi ; denote …
Figure 3.4
Figure 3.4. Figure 3.4: One sum of K31 and K41 [PITH_FULL_IMAGE:figures/full_fig_p007_3_4.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p010_6.png]
Figure 6
Figure 6. Figure 6: a (resp. 6.2b). Let [PITH_FULL_IMAGE:figures/full_fig_p011_6.png]
Figure 6
Figure 6. Figure 6 [PITH_FULL_IMAGE:figures/full_fig_p012_6.png]

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

20 extracted references · 1 linked inside Pith

  1. [5]

    Bellettini, G

    G. Bellettini, G. Paolini, M. Paolini, Y.-S. Wang,Effects of tangle replacement on neighbor- hood equivalence classes, arXiv:2511.07796

    arXiv

  2. [1]

    Bellettini, M

    G. Bellettini, M. Paolini, Y.-S. Wang,A complete invariant for connected surfaces in the 3-sphere, J. Knot Theory Ramifications29(2020), 1–24

    2020

  3. [2]

    Bellettini, M

    G. Bellettini, M. Paolini, Y.-S. Wang,Numerical irreducibility criteria for handlebody links, Topology Appl.284(2020), 1–14

    2020

  4. [3]

    Bellettini, M

    G. Bellettini, M. Paolini, Y.-S. Wang,Unique3-decomposition and mapping classes of knotted handlebodies, Geom. Dedicata219(74) (2025)

    2025

  5. [4]

    Bellettini, G

    G. Bellettini, G. Paolini, M. Paolini, Y.-S. Wang,A table ofn-component handlebody links of genusn+ 1up to six crossings, Math. Proc. Camb. Phil. Soc.174(2023), 199–223

    2023

  6. [6]

    Buoncristiano,Fragments of Geometric Topology from the Sixties, Geometry and topology monographs6, University of Warwick, Mathematics Institute (2003)

    S. Buoncristiano,Fragments of Geometric Topology from the Sixties, Geometry and topology monographs6, University of Warwick, Mathematics Institute (2003)

    2003

  7. [7]

    Ishii,Moves and invariants for knotted handlebodies, Algebr

    A. Ishii,Moves and invariants for knotted handlebodies, Algebr. Geom. Topol.8(2008), 1403–1418

    2008

  8. [8]

    Ishii, K

    A. Ishii, K. Kishimoto, H. Moriuchi, M. Suzuki,A table of genus two handlebody-knots up to six crossings, J. Knot Theory Ramifications21(2012), 1250035 (9 pages)

    2012

Show all 20 references
  1. [9]

    Ishii, K

    A. Ishii, K. Kishimoto, M. Ozawa,Knotted handle decomposing spheres for handlebody-knots, J. Math. Soc. Japan67(2015), 407–417

    2015

  2. [10]

    J. H. Lee, S. Lee,Inequivalent handlebody-knots with homeomorphic complements, Algebr. Geom. Topol.12(2012), 1059—1079

    2012

  3. [11]

    Moriuchi,An enumeration of theta-curves with up to seven crossings, J

    H. Moriuchi,An enumeration of theta-curves with up to seven crossings, J. Knot Theory Ramifications18(2009), 67–197

    2009

  4. [12]

    Moriuchi,A table of handcuff graphs with up to seven crossings, OCAMI Studies Vol 1

    H. Moriuchi,A table of handcuff graphs with up to seven crossings, OCAMI Studies Vol 1. Knot Theory for Scientific objects (2007) 179–300

    2007

  5. [13]

    Moriuchi,A table ofθ-curves and handcuff graphs with up to seven crossings, Adv

    H. Moriuchi,A table ofθ-curves and handcuff graphs with up to seven crossings, Adv. Stud. Pure Math. Noncommutativity and Singularities: Proceedings of French–Japanese symposia held at IHES in 2006, J.-P. Bourguignon, M. Kotani, Y. Maeda and N. Tose, eds. (Tokyo: Mathematical ...

    2006

  6. [14]

    Motto,Inequivalent genus two handlebodies inS 3 with homeomorphic complements, Topology Appl.36(3) (1990), 283–290

    M. Motto,Inequivalent genus two handlebodies inS 3 with homeomorphic complements, Topology Appl.36(3) (1990), 283–290

    1990

  7. [15]

    Paolini, Appcontour

    M. Paolini, Appcontour. Computer software. Vers. 2.5.8. Apparent contour. (2018)<git@ github.com:appcontour/appcontour.git/>

    2018

  8. [16]

    Paolini (2024, July 24).Complete table of handlebody knots of genus2up to seven cross- ings.http://dmf.unicatt.it/paolini/handlebodies/

    M. Paolini (2024, July 24).Complete table of handlebody knots of genus2up to seven cross- ings.http://dmf.unicatt.it/paolini/handlebodies/

    2024

  9. [17]

    Wang,Unknotting annuli and handlebody-knot symmetry, Topol

    Y.-S. Wang,Unknotting annuli and handlebody-knot symmetry, Topol. Appl.305(1) (2022), 107884

    2022

  10. [18]

    Wang,JSJ decomposition for handlebody-knots, J

    Y.-S. Wang,JSJ decomposition for handlebody-knots, J. Math. Soc. Japan76(4) (2024), 1049–1085

    2024

  11. [19]

    Whitney,Congruent graphs and the connectivity of graphs, Am

    H. Whitney,Congruent graphs and the connectivity of graphs, Am. J. Math.54(1932), 150–168

    1932

  12. [20]

    E. C. Zeeman,Seminar on combinatorial topology, Notes I.H.E.S. and Warwick (1963). 14 Dipartimento di Scienze Matematiche, Informatiche e Fisiche, via delle Scienze 206, 33100 Udine UD, Italy and International Centre for Theoretical Physics ICTP, Math- ematics Section, 34151 T...

    1963

Pith tools

Reviewed August 3, 2026 · model on record in the stance chip above.