Pith. sign in

REVIEW 2 major objections 20 references

Discrete p-density and compression-radius profiles of lattice knots are finitely computable for any fixed explored graph.

Reviewed by Pith at T0; open to challenge. T0 means a machine referee read the full paper against a public rubric. the ladder, T0–T4 →

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

T0 review · grok-4.5

2026-07-14 18:39 UTC pith:6JEZKUFW

load-bearing objection Wrong full text was supplied for arXiv:2605.29160; only the abstract is usable, so the claimed finite-state theorems cannot be audited and the paper stays provisional but referee-worthy on its face. the 2 major comments →

arxiv 2605.29160 v2 pith:6JEZKUFW submitted 2026-05-27 math.GT

Discrete p-Density and Compression Radii of Lattice Knots

Makoto Ozawa This is my paper
classification math.GT MSC 57M25
keywords lattice knotsp-densitycompression radiusBFACF movesknot filtrationmirror barriersdiscrete knot invariants
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

The pith

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

This paper builds a finite-state framework that measures how densely packed and how compressible a lattice knot can be at each fixed edge length. Representatives of a knot type are taken modulo lattice isometries, optionally restricted to subgraphs grown from chosen seeds by local moves such as BFACF. Raw density and compression functionals sit directly on the polygons; a finite smoothing scheme adds controlled perturbation and thickness certification. For any fixed explored graph and smoothing scheme the author proves the resulting profiles are finitely computable, grow monotonically when the length cap is raised, and satisfy componentwise inequalities when graphs are merged. A two-parameter filtration by lattice length and by a density or compression threshold then supplies a fully computable discrete counterpart of continuous filtered knot spaces. Preliminary raw-lattice and seed-generated data for the unknot, trefoil, and the amphichiral knots 4₁ and 6₃ illustrate competing density-versus-compression behaviour and extract seed-specific mirror barriers, while the analytic passage from lattice to continuum remains open.

Core claim

Once an explored graph of lattice polygons of a fixed knot type and a finite smoothing scheme are fixed, the discrete p-density and compression-radius profiles are finitely computable, monotone under increasing length caps, and obey componentwise inequalities under graph mergers. The associated two-parameter filtration by lattice length and by a density or compression threshold is therefore a computable discrete analogue of continuous filtered knot spaces.

What carries the argument

The discrete p-density and compression-radius profiles (raw or finitely smoothed) attached to lattice polygons, together with the two-parameter filtration they induce by length N and by a density or compression threshold; these objects carry the finite-computability, monotonicity and merger inequalities.

Load-bearing premise

The seed-restricted subgraphs grown by local moves are assumed rich enough that the reported profiles and mirror barriers still speak about the knot type, even though they are not claimed to be exhaustive invariants and the continuous approximation problem is left open.

What would settle it

Produce a verified seed-generated BFACF path for 4₁ or 6₃ under the same length caps that merges a knot with its mirror at a barrier strictly smaller than the reported values 2 and 4, or exhibit an enlargement of the explored graph that reverses the claimed monotonicity of the density or compression profiles.

Watch this falsifier — get emailed when new claim-graph text bears on it.

If this is right

  • Any fixed seed-generated BFACF graph yields finite, machine-checkable certificates for density and compression along paths that connect a knot to its mirror.
  • Seed-specific mirror barriers become rigorously extractable by exact separation at the preceding admissible length levels.
  • Density and compression function as competing rather than redundant objectives along verified merge certificates.
  • Raising the length cap refines the profiles monotonically without discarding earlier levels.
  • The resulting discrete filtered space can be compared directly with continuous knot-energy filtrations once the open lattice-to-continuous approximation is settled.

Where Pith is reading between the lines

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

  • If seed-generated subgraphs can be systematically enlarged, the observed mirror barriers may stabilise into genuine knot-type invariants rather than path-dependent numbers.
  • The competing character of density and compression points toward multi-objective optimisation over lattice knot spaces as more informative than single-functional minimisation.
  • The same finite-state setup extends immediately to other local-move systems or to lattice embeddings of knotted surfaces.
  • Closing the lattice-to-continuous gap would turn the reported numerical profiles into certified approximations of continuous thickness or energy filtrations.

Editorial analysis

A structured set of objections, weighed in public.

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

Referee Report

2 major / 0 minor

Summary. The abstract of arXiv:2605.29160 introduces a finite-state framework for discrete p-density and compression-radius profiles of lattice knots. At fixed lattice length N, representatives of a knot type are considered modulo orientation-preserving lattice isometries, optionally restricted to seed-generated subgraphs under local moves (e.g., BFACF). Raw density and compression functionals are attached to lattice polygons; a finite smoothing scheme allows controlled perturbation, corner rounding, thickness certification, and normalization. The abstract asserts finite computability, monotonicity under increasing length caps, and componentwise inequalities under graph mergers for any fixed explored graph and finite smoothing scheme, and defines a two-parameter filtration by length and density/compression threshold as a discrete counterpart of continuous filtered knot spaces. Preliminary raw or seed-generated numerical data are reported for the square unknot, a 24-edge cubic trefoil, restricted trefoil profiles for N=24–32, and BFACF mirror-merge certificates for amphichiral knots 4₁ (21 states/20 moves, N≤32) and 6₃ (153 states/152 moves, N≤44), yielding seed-specific mirror barriers 2 and 4. The lattice-to-continuous approximation problem is left open, and the numbers are explicitly not claimed as exhaustive smoothed knot-type invariants.

Significance. If the claimed structural theorems hold, the work would supply a rigorously computable discrete filtration framework for lattice-knot density and compression, with clear monotonicity and merger inequalities that make seed-restricted BFACF explorations and mirror-barrier certificates mathematically well-defined rather than purely experimental. That would be a useful contribution to computational geometric topology, especially for amphichiral knots and competing density-versus-compression objectives. The abstract’s careful disclaimers (raw/seed-generated data only; continuous approximation open) are appropriate. However, significance cannot be assessed beyond the abstract: the body text supplied under this paper_id is an unrelated manuscript on late-interaction protein homolog retrieval (PROTOCOL / arXiv:2605.29158), so the definitions, proofs, and certificates cannot be audited.

major comments (2)
  1. The full manuscript body provided under paper_id 2605.29160 is not the lattice-knot paper. It is the complete text of an unrelated work, “Late Interaction Retrieval for Protein Homolog Search” (PROTOCOL; arXiv:2605.29158, cs.LG). Consequently the definitions of raw and smoothed p-density and compression functionals, the precise two-parameter filtration, the proofs of finite computability, monotonicity under length caps, and componentwise merger inequalities, and the verification of the 4₁/6₃ BFACF certificates and mirror barriers 2 and 4 are all inaccessible. The central claims of the abstract cannot be checked against any argument in the supplied text.
  2. Without the actual manuscript, it is impossible to confirm that the asserted properties follow from the stated hypotheses alone (fixed explored graph + finite smoothing scheme), or that the seed-restricted BFACF subgraphs and reported numerical profiles are correctly derived. The abstract’s disclaimers do not substitute for verification of the proofs or the certificates. A referee report on the mathematical content of 2605.29160 cannot be completed until the correct full text is supplied.

Circularity Check

0 steps flagged

No circularity detectable; full derivation chain inaccessible due to wrong manuscript text supplied

full rationale

The supplied full-text block is an unrelated preprint (PROTOCOL protein retrieval, arXiv:2605.29158) rather than the lattice-knot manuscript whose abstract and claims are under review. Consequently no equations, definitions of raw/smoothed p-density or compression functionals, filtration constructions, or proofs of finite computability/monotonicity/merger inequalities can be inspected. The abstract alone presents structural theorems for fixed explored graphs and finite smoothing schemes, together with explicitly raw or seed-generated numerical certificates that are disclaimed as non-exhaustive invariants; nothing in that abstract equates a claimed prediction to a fitted input or reduces a theorem to a self-citation by construction. Absent the actual derivation chain, no circular step can be exhibited, so the circularity score is zero by the hard rule that circularity may be claimed only when a specific reduction is quotable from the paper.

Axiom & Free-Parameter Ledger

4 free parameters · 5 axioms · 4 invented entities

The central claims rest on standard lattice-knot and local-move background plus paper-specific definitions of discrete p-density, compression radius, smoothing schemes, and the two-parameter filtration. Free parameters are the length caps, seeds, move system, and smoothing scheme used for the reported profiles. Invented entities are the discrete profiles, the filtration, and the seed-specific mirror barriers as reported numerical objects. No continuous approximation theorem is claimed.

free parameters (4)
  • lattice length cap N
    Profiles and certificates are computed under explicit caps (e.g. N=24..32 for trefoil; N=32 for 4₁; N=44 for 6₃). Choice of N truncates the explored graph and affects reported values.
  • seed polygons and BFACF (or other) local move system
    Optional restriction to seed-generated subgraphs determines which states enter the profiles and mirror-merge certificates; different seeds can yield different barriers.
  • finite smoothing scheme (perturbation, corner rounding, thickness, normalization)
    Smoothed functionals depend on a chosen finite scheme; the abstract treats the scheme as fixed for the computability theorems.
  • density or compression threshold in the two-parameter filtration
    The filtration is by lattice length and by a density/compression threshold; the threshold is a free cutoff defining the filtered spaces.
axioms (5)
  • domain assumption Lattice knots are closed polygons on the square or cubic lattice, considered up to orientation-preserving lattice isometries.
    Standard setup for lattice knot theory; used throughout the abstract as the ambient category of representatives.
  • domain assumption Local move systems such as BFACF generate subgraphs of lattice polygons of a fixed knot type from specified seeds.
    BFACF is a standard ergodic move set for lattice polygons; the abstract uses it for optional seed-generated exploration and certificates.
  • ad hoc to paper Raw density and compression functionals can be attached directly to lattice polygons; a finite smoothing scheme yields controlled perturbation, corner rounding, thickness certification, and normalization.
    The specific discrete functionals and smoothing package are introduced by the paper; their exact formulas are not in the abstract but are load-bearing for the profiles.
  • ad hoc to paper For fixed explored graph and finite smoothing scheme, the profiles are finitely computable, monotone in length caps, and satisfy componentwise inequalities under graph mergers.
    These are the paper’s stated theorems; treated as proved in the body we do not have.
  • domain assumption The analytic lattice-to-continuous approximation problem remains open.
    Explicitly left open; continuous interpretation of the discrete profiles is not assumed.
invented entities (4)
  • discrete p-density profile of a lattice knot type (at length level N) no independent evidence
    purpose: Package packing density of lattice representatives into a finite-state, computable profile.
    Defined by attaching raw or smoothed density functionals to lattice polygons modulo isometries, optionally on seed-generated graphs.
  • compression-radius profile of a lattice knot type no independent evidence
    purpose: Measure compressibility of lattice representatives as a competing objective to density.
    Introduced alongside density; abstract reports they behave as competing rather than redundant objectives along BFACF paths.
  • two-parameter filtration by lattice length and density/compression threshold no independent evidence
    purpose: Provide a computable discrete counterpart of continuous filtered knot spaces.
    New organizational structure claimed in the abstract; continuous approximation not established.
  • seed-specific mirror barriers (values 2 and 4 for 4₁ and 6₃ paths) no independent evidence
    purpose: Quantify exact separation of mirrors at preceding admissible levels along verified BFACF mirror-merge certificates.
    Numerical objects extracted from the reported certificates; seed-specific by construction.

pith-pipeline@v1.1.0-grok45 · 13522 in / 3862 out tokens · 49007 ms · 2026-07-14T18:39:20.694037+00:00 · methodology

0 comments
read the original abstract

We introduce a finite-state framework for discrete $p$-density and compression-radius profiles of lattice knots. At a lattice length level $N$, we consider representatives of a fixed knot type modulo orientation-preserving lattice isometries, and optionally restrict to subgraphs generated from specified seeds by a local move system such as BFACF moves. Raw density and compression functionals are attached directly to lattice polygons; a smoothed version permits controlled perturbation, corner rounding, thickness certification, and normalization. For a fixed explored graph and finite smoothing scheme, we prove finite computability, monotonicity under increasing length caps, and componentwise inequalities under graph mergers. We also introduce a two-parameter filtration by lattice length and by a density or compression threshold, giving a computable discrete counterpart of continuous filtered knot spaces. The analytic lattice-to-continuous approximation problem remains open. As preliminary computations, we give raw-lattice data for the square unknot and a $24$-edge cubic-lattice trefoil, together with a restricted trefoil profile for $N=24,26,28,30,32$. We further evaluate density and compression along verified seed-generated BFACF mirror-merge certificates for the amphichiral knots $4_1$ and $6_3$. The certificates have, respectively, $21$ states and $20$ moves under the cap $N=32$, and $153$ states and $152$ moves under the cap $N=44$. Exact separation at the preceding admissible levels yields seed-specific mirror barriers $2$ and $4$. Along both paths, density and compression behave as competing rather than redundant objectives. All numerical values are explicitly raw-lattice or seed-generated and are not claimed to be exhaustive smoothed knot-type invariants.

Figures

Figures reproduced from arXiv: 2605.29160 by Makoto Ozawa.

Figure 1
Figure 1. Figure 1: Raw density and compression values along the extracted 21-state figure-eight BFACF merge path at length bound N = 32. The dashed vertical line marks the connecting state η = s5. The plotted data are raw lattice values under the labelled convention Thipoly = 1/2. In the raw simple-cubic convention used here, the formal product satisfies ρD(P) CRadSC D (P) = 2ℓ(P) for both D = D2 and D = diam. Hence the merg… view at source ↗

Review history (2 revisions) →

discussion (0)

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

Reference graph

Works this paper leans on

20 extracted references · 3 linked inside Pith

  1. [1]

    Ashton, J

    T. Ashton, J. Cantarella, M. Piatek, and E. Rawdon, Knot tightening by constrained gradient descent, Experiment. Math. 20 (2011), no. 1, 57--90

    2011

  2. [2]

    Berg and D

    B. Berg and D. F \"o rster, Random paths and random surfaces on a digital computer, Phys. Lett. B 106 (1981), 323--326

    1981

  3. [3]

    Arag \ a o de Carvalho, S

    C. Arag \ a o de Carvalho, S. Caracciolo, and J. Fr \"o hlich, Polymers and g| |^4 theory in four dimensions, Nucl. Phys. B 215 (1983), 209--248

    1983

  4. [4]

    E. J. Janse van Rensburg and S. G. Whittington, The BFACF algorithm and knotted polygons, J. Phys. A 24 (1991), 5553--5567

    1991

  5. [5]

    Cantarella, R

    J. Cantarella, R. B. Kusner, and J. M. Sullivan, On the minimum ropelength of knots and links, Invent. Math. 150 (2002), 257--286

    2002

  6. [6]

    Diao, Minimal knotted polygons on the cubic lattice, J

    Y. Diao, Minimal knotted polygons on the cubic lattice, J. Knot Theory Ramifications 2 (1993), no. 4, 413--425

    1993

  7. [7]

    Diao, The number of smallest knots on the cubic lattice, J

    Y. Diao, The number of smallest knots on the cubic lattice, J. Statist. Phys. 74 (1994), 1247--1254

    1994

  8. [8]

    Exner, E

    P. Exner, E. M. Harrell, and M. Loss, Inequalities for means of chords, with application to isoperimetric problems, Lett. Math. Phys. 75 (2006), 225--233

    2006

  9. [9]

    Gonzalez and J

    O. Gonzalez and J. H. Maddocks, Global curvature, thickness, and the ideal shapes of knots, Proc. Natl. Acad. Sci. USA 96 (1999), 4769--4773

    1999

  10. [10]

    E. J. Janse van Rensburg, The Statistical Mechanics of Interacting Walks, Polygons, Animals and Vesicles, Oxford University Press, 2015

    2015

  11. [11]

    R. A. Litherland, J. Simon, O. Durumeric, and E. Rawdon, Thickness of knots, Topology Appl. 91 (1999), 233--244

    1999

  12. [12]

    E. J. Janse van Rensburg and A. Rechnitzer, Minimal knotted polygons in the cubic lattice, J. Phys. A 44 (2011), 165001

    2011

  13. [13]

    O'Hara, Energy of a knot, Topology 30 (1991), 241--247

    J. O'Hara, Energy of a knot, Topology 30 (1991), 241--247

    1991

  14. [14]

    R. Scharein, KnotPlot cubic-lattice knot coordinates, KnotPlot data page, available at https://knotplot.com/EquiLat/coords.html (accessed for the coordinate seed recorded in Appendix A)

  15. [15]

    Ozawa, Experimental Discrete Knot Theory via Lattice-Filtered Move Graphs: Seed-Generated BFACF Graphs and Merge Scales, arXiv:2605.25322

    M. Ozawa, Experimental Discrete Knot Theory via Lattice-Filtered Move Graphs: Seed-Generated BFACF Graphs and Merge Scales, arXiv:2605.25322

    Pith/arXiv arXiv

  16. [16]

    Ozawa, Unconstrained and Ropelength-Windowed p -densities of Knot Types, arXiv:2604.23621

    M. Ozawa, Unconstrained and Ropelength-Windowed p -densities of Knot Types, arXiv:2604.23621

    Pith/arXiv arXiv

  17. [17]

    Ozawa, Geometric densities and compression radii of knot types, arXiv:2604.27912

    M. Ozawa, Geometric densities and compression radii of knot types, arXiv:2604.27912

    Pith/arXiv arXiv

  18. [18]

    Ozawa, Supplementary code and data for ``Discrete p -Density and Compression Radii of Lattice Knots'', Zenodo, 2026

    M. Ozawa, Supplementary code and data for ``Discrete p -Density and Compression Radii of Lattice Knots'', Zenodo, 2026. https://doi.org/10.5281/zenodo.20419442

    doi:10.5281/zenodo.20419442 2026

  19. [19]

    E. J. Rawdon, Approximating the thickness of a knot, Ideal Knots, Ser. Knots Everything 19, World Scientific, 1998, 143--150

    1998

  20. [20]

    E. J. Rawdon and J. K. Simon, Polygonal approximation and energy of smooth knots, J. Knot Theory Ramifications 15 (2006), 429--451

    2006