Prismatic Soft Cubes

Kinga Kocsis

REVIEW 4 major objections 5 minor 4 references

Prismatic Soft Cubes

T0 review · 4 major / 5 minor · reviewed 2026-08-04 · deepseek-v4-flash

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

Pith's one-line read Exactly 26 geometrically distinct soft cube cells exist that partially agree with the cubic lattice to second order under lattice-direction and planar-edge constraints, and they generate 68 fundamental domains in 8 symmetry classes.

desk verdict A plausible classification of 26 soft cubic cells, but the central 'exactly' claim leans on an unjustified WLOG in Theorem 1 that needs fixing before publication. read the letter →

arxiv 2608.00002 v1 pith:I2Z7WYU2 submitted 2026-05-12 cond-mat.soft

Kinga Kocsis This is my paper · ORCID

classification cond-mat.soft MSC 52C2052C2205B45

keywords softcellsspace-fillingtilingscubiclatticemonohedralcubesprismaticfundamentaldomainschiral

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

The paper sets out to answer a question left open by earlier work: when the standard cubic lattice tiling is softened so that no tile has sharp corners, how many essentially different soft cubes are there? It proves that, under two natural restrictions — edge half-tangents must point in lattice directions and tile edges must be planar — there are exactly 26 geometrically distinct soft cube cells, all of them prismatic. This is a complete classification: any soft tiling meeting those conditions must be one of the 26. The paper further shows that the 26 cells generate 68 distinct minimal translational units, or fundamental domains, which fall into 8 lattice-symmetry classes, and that none of the tilings retains the full symmetry of the cubic lattice. A reader should care because the classification turns an open-ended existence question into a finite list, with an algorithmic method that could be reused for other polyhedral tilings.

What carries the argument

The load-bearing object is the 'softening equation' u_i · u_j = −1, expressing that two edge half-tangents at a node are opposite, so the two edges join into a smooth curve. The Extended Edge Bending algorithm, run with the identity symmetry group and with half-tangents restricted to the six cubic lattice directions, converts the local softness condition into 12 complete sets of such equations; the admissible node configuration from Theorem 2 is then propagated through a cell by rotating it at each of the eight vertices. The combinatorial catalogue is organized by four curved edge types (1,1',2,2', depending on whether endpoint tangents coincide or are opposite) and the six curved face types

What would settle it

Run an exhaustive computer search over all assignments of six unit vectors drawn from the six cubic lattice directions to the six edge half-tangents at a node, imposing only the softness condition that each of the eight corner triples contains an opposite pair, and do not assume the A_i/B_i split used in Theorem 1. If any node configuration outside the 12 equation sets of Table 1 is found, the 26-cell classification is incomplete; if none is found, the missing-proof concern is settled.

Watch

Extended reading notes

Core claim

The central claim is Theorem 4: up to rotation, reflection, and composition, there are exactly 26 parallel soft tilings that partially agree to second order with the cubic lattice. Here 'partially agree to second order' means the node positions are those of the cubic lattice and the half-tangent unit vectors of the softened edges are a subset of the six original lattice directions; 'parallel' adds that every edge is a planar curve. The proof route is Theorem 1: the softening equations admit exactly 12 complete solution sets; Theorem 2: only one of these (up to equivalence) makes all eight corners at a node soft; Theorem 3: any gap-free soft tiling built this way is prismatic, i.e. it has a p

Load-bearing premise

The enumeration hinges on the unproved assumption, made in the proof of Theorem 1 (Section 2, just after Eq. (2)), that the six half-tangents at a node can always be relabeled as A_i={a,c,e} and B_i={b,d,f} with ac and bd already complementary; if a valid soft node cannot be represented this way, the 'exactly 26' count could miss cases.

Editorial extensions

If this is right

If the classification is right, the search for soft cubic cells is closed: every lattice-directed, planar-edged soft cube is on the 26-cell list, so no further examples exist under those conditions.
Any such soft tiling is prismatic, so the full 3D tiling can be understood by studying a stack of square-lattice layers, reducing the problem to 2D.
The 68 fundamental domains, sorted into 8 lattice-symmetry classes, provide a catalog of minimal translational building blocks for space-filling soft shapes.
The enumeration shows that no soft cube tiling keeps the full cubic symmetry; the largest symmetry groups have order 8, which limits how symmetric a soft cubic tiling can be.
The accompanying Python algorithm gives a concrete way to regenerate the 26 cells and to check whether a proposed cell tiles achirally or requires mirror copies.

Reading between the lines

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

Beyond the paper: if the assumed node splitting A_i={a,c,e}, B_i={b,d,f} were relaxed, additional node configurations might exist; a brute-force enumeration over all ways to choose six lattice-direction unit vectors at a node, without that split, would test whether 26 is truly exhaustive.
Beyond the paper: the prismatic character suggests the 26 soft cubes are, in a precise sense, extruded versions of 2D soft square tilings; studying the 2D analogue might yield an independent derivation of the list.
Beyond the paper: the method of fixing lattice directions and planarity could be applied to other space-filling polyhedra, such as truncated octahedra or tetrahedral frameworks, to produce analogous finite classifications with crystallographic relevance.
Beyond the paper: the 8 lattice-symmetry classes of fundamental domains may correspond to specific crystallographic space groups, which could be used to search for photonic or phononic crystals built from soft cells.

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.

Desk Editor's Note

read the letter

The paper gives a novel and plausible census: 26 soft cubic cells and 68 fundamental domains for the cubic lattice under natural conditions, extending the group's earlier work on truncated octahedra. The figures, tables, and the short Python program are genuinely useful, and the prismatic-structure result (Theorem 3) is a nice step that reduces the problem to pairing curved faces. If the enumeration is right, this is a solid contribution to the soft-tiling niche.

The soft spot is in the middle. Theorem 1's proof asserts, without real justification, that every complete set of softening equations has the form of three cross-pairs (a bijection between A and B) plus one intra-subset equation. That is not a harmless WLOG. The stress-test example—(a,b),(b,c),(c,d),(d,a)—covers all eight corners and is not in Table 1. I suspect it is degenerate and unlikely to extend to a space-filling tiling, but the proof does not say why, and Theorem 4's 'exactly 26' rests on the exhaustiveness of these 12 systems. Similarly, Theorem 2 leans on 'it can be verified', and Algorithm 2 classifies face pairs but does not itself test gap-free/overlap-free tiling; that property is carried by Theorem 3 and the construction, but the gap between the algorithm's output and the tiling claim is not fully bridged. These are addressable, but they are load-bearing, not cosmetic.

The self-citation pattern is not a real problem here: the prior framework is the natural starting point, and the new work extends it. What is missing is a formal enumeration argument, an explicit check that all 26 cells actually tile, and an independent verification of the six face types in Lemma 1.

Who is this for? Researchers in soft cells, monohedral tilings, or geometric modeling of cellular materials. It deserves a serious referee—this is a real classification attempt with visible evidence, not a toy—but it should not be accepted as is. A revision that turns Theorem 1 into a real proof and makes the tiling checks explicit would move it from 'conditional' to 'accept'. I would not cite it in my own work until those gaps are closed.

Referee Report

4 major / 5 minor

Summary. The paper classifies soft tilings of the cubic lattice under the restrictions that edge half-tangents point along lattice directions and that edges are planar. The central claim is that, up to the equivalence defined in Theorem 4, there are exactly 26 parallel soft tilings that partially agree to second order with the cubic lattice, and that these give rise to 68 fundamental domains in 8 lattice-symmetry classes. The argument proceeds by (i) enumerating complete sets of softening equations at a node (Theorem 1), (ii) selecting the node configuration that softens all eight corners (Theorem 2), (iii) proving that any gap-free, overlap-free soft tiling must be prismatic (Theorem 3), (iv) classifying curved edge and face types (Lemma 1), and (v) enumerating cells from face pairings via an algorithm with a Python implementation (Theorem 4). A symmetry classification and fundamental-domain counts are then presented (Theorem 5).

Significance. If the central classification is correct, the paper provides a valuable and nontrivial complete enumeration: it goes beyond existence statements for soft cells and gives a concrete list of geometries under natural constraints, together with explicit symmetry data. The manuscript includes several strengths that should be acknowledged: it ships the Python code used for the enumeration, it provides extensive tables and figures for all 26 cells and 68 fundamental domains, and it makes precise, falsifiable numerical claims (26, 68, 8). These strengths make the paper potentially useful as a reference classification. However, the exactness of the counts is not currently supported to the standard required by a journal proof: the load-bearing enumeration in Theorem 1 is asserted rather than proved, and the reproduced code does not implement the equivalence relation used in the main theorem. The result may well be correct, but the manuscript needs additional rigorous support before the classification can be accepted.

major comments (4)

[Section 2, Theorem 1 proof, after Eq. (2)] The proof asserts, without demonstration, that every complete set of softening equations has the form of a bijection C_i,j between A_i={a,c,e} and B_i={b,d,f}, plus one intra-subset equation (a,e) or (c,e). The definition of a complete set only requires at least one equation in every vertex set; the four-equation lower bound does not force this particular structural form. The proof rules out neither non-bijective sets of cross-pairs nor a fourth equation lying in B_i or being another cross-pair, after the complementary pairs ac and bd are imposed. The 'general case is obtained by specifying three pairs...' sentence is an assumption, not a derivation. Since the 12 systems of Table 1 are the sole input to Theorem 4's 'exactly 26', this gap is load-bearing. A rigorous exhaustive enumeration, or a machine-checkable certificate that all complete sets reducing to these 12 systems, is needed.
[Section 2, Theorem 2 proof] The proof of Theorem 2 relies on 'It can be verified' to assert that exactly one of the 12 systems, in four equivalent guises, softens all eight corners. This is a finite but nontrivial check: one has to solve each of the 12 systems under the lattice-direction restriction, list the resulting half-tangent assignments, and verify the corner-softening condition for each of the eight corners. The claim that 1A and 1B fail in the stated corners is plausible but not shown. Since Theorem 2 is what identifies the unique admissible node configuration used in all later steps, the verification should be written out or delegated to a small reproducible script included with the paper.
[Section 3, Lemma 1] Lemma 1 states that the admissible node configuration yields exactly four curved edge types and six curved face types, with the sentence 'More curved face types cannot be realized while preserving the softness conditions.' No derivation of this exhaustiveness is given; the classification is justified by schematic inspection of Figures 6--8. The later 26-cell count depends directly on this lemma. Please provide either a proof from the endpoint half-tangent conditions that no other edge and face types are possible, or an independent exhaustive enumeration of face types that is shown to be complete.
[Section 4, Theorem 4 proof and Appendix code] Algorithm 2, as reproduced in the Appendix, does not implement the equivalence relation stated in Theorem 4. The text defines two cells as identical if they are related by rotations and/or reflection, and Algorithm 1 uses that definition. The Python code, however, defines transformations only as z-rotations, y-rotations, and their compositions; there is no mirror transformation. The paper itself observes that without mirror transformations the output is 43 copies (9 achiral + 17 chiral multiplied by 2), not 26. Thus the code, as printed, supports the 43-count and not the 26-count of Theorem 4. The exactness of 26 currently rests on the manual Algorithm 1, not on the reproducible algorithm. Moreover, neither Algorithm 2 nor the code explicitly checks that the paired cells tile space without gaps or overlaps; it relies on Theorem 3 without verifying that the resulting pairings satisfy the

minor comments (5)

[Definition 1] The phrase 'polihedric tiling' appears to be a typo for 'polyhedric tiling'.
[Section 1.1, EEB algorithm] The numbering of the steps is confusing: Step 4* is listed after Step 4 but used instead of Step 4; consider renumbering or denoting it as a variant clearly.
[Figures 13--21] The symmetry-group illustrations point to an external website (newton.ex.ac.uk). This is not a stable reference; please include the group names in text and cite a permanent source.
[Table 1 and notation] The notation for the subsets is inconsistent in places: A_i and B_i are used in the text and equations, while Table 1 uses A and B only. This should be harmonized for readability.
[Appendix Python code] The code would benefit from comments explaining that it deliberately omits mirror transformations, and from an explicit output showing whether the printed length is 43 or 26; currently the text says 'The algorithm shows 26' while the code description says 43 without mirror transformations.

Circularity Check

0 steps flagged · score 1.0 of 10

No circular derivation: the 26-cell count is an enumeration under stated geometric constraints; the main risk is an unproved exhaustiveness assumption in Theorem 1, which is a correctness gap rather than a self-referential reduction.

full rationale

The derivation chain is an enumeration, not a fit. Theorem 1 counts 12 complete sets of softening equations as 6 bijections C_i,j times 2 fourth equations; this count is exactly the number of equation systems of the assumed bijection-plus-one-intra-subset form. The paper does not, however, define 'complete set' to be that form: Definition 3 (taken verbatim from [3]) defines a complete set as any system with at least one equation in every vertex set. The assertion after Eq. (2), 'The general case is obtained by specifying three pairs of edges whose half-tangents, after softening, become complementary half-lines', is an unproved classification premise. If false, the 'exactly 12' and downstream 'exactly 26' claims could be incomplete, but that is a correctness gap, not a circular reduction: the conclusion is not true by construction, nor is a fitted value renamed as a prediction. Theorem 4's 26 cells are produced from six curved face types by Algorithm 2 and Table 2; the input contains face types, not the number 26. Theorem 5's 68 fundamental domains are likewise a stated count obtained from per-face extension rules. The self-citations [1]-[3] provide the general softening algorithm and definitions; they are not tuned to output the cubic-lattice classification and are not used to forbid alternatives. I find no step where an equation is made true by definition or where a fitted parameter is called a prediction. (Separately, the printed Algorithm 2 appears not to identify mirror images, while the theorem's 26 count identifies them; that is a reproducibility/correctness concern, not circularity.)

Assumptions & free parameters 1 free parameters · 6 assumptions · 0 invented entities

No constants are fitted to data; the only free geometric parameter is the prism's straight-edge length. The central result rests on the EEB framework from the authors' prior papers plus several classification assumptions (WLOG labeling, equation-count bound, six face types, fundamental-domain space filling) that are asserted rather than fully proved.

free parameters (1)

Prismatic straight-edge length
Theorem 3 shows the soft cube has one free parameter, the length of the straight prism edge. The 26-cell count is independent of its value, so it is not fitted or used to force the main result.

assumptions (6)

domain assumption Softness is characterized by the existence of opposite half-tangent pairs u_i·u_j=-1 at each node (Definition 2, taken from [3]).
This is the basis for generating all softening equations; the equivalence with the no-sharp-corner definition is assumed from prior work.
ad hoc to paper At least four softening equations of the form a·b=-1 are required to soften a cubic cell.
Counting bound in Theorem 1: a pair of half-tangents can determine a face in at most two corners, so three pairs cover at most six corners. This drives the 12-solution count.
ad hoc to paper Up to relabeling, the node half-tangents split as A_i={a,c,e} and B_i={b,d,f}, with ac and bd complementary pairs.
Stated without proof in Theorem 1. If other splits admit valid soft configurations, the enumeration is incomplete.
ad hoc to paper The four curved edge types and six curved face types of Lemma 1 exhaust all soft prismatic cells.
Established by schematic classification and 'it can be verified' reasoning rather than a formal exhaustive proof.
domain assumption Cells are identical if related by rotations and reflections; chiral cells require mirror copies to tile.
This is the equivalence convention used in Algorithm 1 and Algorithm 2. Changing the equivalence relation would change the 26 count.
domain assumption Constructing a fundamental domain via face-to-face attachment guarantees a gap-free, overlap-free tiling.
Used in Theorems 4 and 5 to assert space-filling; Algorithm 2 itself does not test tiling.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Prismatic Soft Cubes." pith.science (2026). https://pith.science/paper/I2Z7WYU2

@misc{pith2026260800002,
  author       = {Pith},
  title        = {Pith review of: Prismatic Soft Cubes},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/I2Z7WYU2}},
  note         = {Machine review of arXiv:2608.00002}
}

read the original abstract

Soft cells are shapes without sharp corners that can fill the space without gaps and overlaps [2]. A sharp corner is a point on the surface of the solid through which no smooth curve passes. In the paper introducing the concept of soft cells [2], the authors proved that there exists an algorithm that can soften tilings consisting of convex polyhedra, preserving the lattice points and combinatorial structure of the original tiling. Although the algorithm guarantees (with a few restrictions) that there exists a soft tiling that is combinatorially equivalent to the convex polyhedral tiling, the proof does not address how to find all such tilings. For a polyhedral tiling based on a truncated octahedral cell, paper [3] shows how to find all soft tilings for a fixed symmetry group. In this paper, we extend this method and apply it to the cubic lattice, imposing only natural conditions, rather than symmetry constraints. The natural conditions being, the directions of edge half-tangents of the tiling are restricted to lattice directions, and the edges of the tiling are planar. This results in 26 soft cubic cells with different geometries. A total of 68 fundamental domains can be created from the cells, which can be classified into 8 groups based on their lattice symmetry. The paper also presents an algorithmic process (with a corresponding program in language Python) for classifying the 26 non-equivalent geometric cell types.

Figures

Figures reproduced from arXiv: 2608.00002 by the authors.

**Figure 2.** FIGURE 2. K=6 edge half-tangent unit vectors meet at each node of the cubic lattice. These [PITH_FULL_IMAGE:figures/full_fig_p005_2.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

4 extracted references · 1 canonical work pages

[1]

Math.} (2022)

Domokos, G., G.Horváth Á., Regős, K.: A two-vertex theorem for normal tilings {\em Aequat. Math.} (2022). DOI:10.1007/s00010-022-00888-0

work page doi:10.1007/s00010-022-00888-0 2022
[2]

Domokos, G., G.Horváth, Á., Goriely, A., Regős, K.: Soft cells and the geometry of seashells {\em PNAS NEXUS} {\bf 3/9} pgae311, 10 p. (2024)

2024
[3]

Domokos, G., G.Horváth, Á., Goriely, A., Regős, K.: Soft cells, Kelvin's foam and the minimal surfaces of Schwarz \url{https://arxiv.org/abs/2412.04491}

arXiv
[4]

A", (1,0):

Prince, E., ed. (2006). International Tables for Crystallography. doi:10.1107/97809553602060000001. ISBN 978-1-4020-4969-9. S2CID 146060934. KINGA KOCSIS, DEPARTMENT OF MORPHOLOGY AND GEOMETRIC MODELLING and HUN-REN- BME MORPHODYNAMICS RESEARCH GROUP, BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS, Műegyetem Rkp. 3., K220, Budapest 1111, Hungary Email ad...

doi:10.1107/97809553602060000001 2006

Pith tools

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

[1] [1]

Math.} (2022)

Domokos, G., G.Horváth Á., Regős, K.: A two-vertex theorem for normal tilings {\em Aequat. Math.} (2022). DOI:10.1007/s00010-022-00888-0

work page doi:10.1007/s00010-022-00888-0 2022

[2] [2]

Domokos, G., G.Horváth, Á., Goriely, A., Regős, K.: Soft cells and the geometry of seashells {\em PNAS NEXUS} {\bf 3/9} pgae311, 10 p. (2024)

2024

[3] [3]

Domokos, G., G.Horváth, Á., Goriely, A., Regős, K.: Soft cells, Kelvin's foam and the minimal surfaces of Schwarz \url{https://arxiv.org/abs/2412.04491}

arXiv

[4] [4]

A", (1,0):

Prince, E., ed. (2006). International Tables for Crystallography. doi:10.1107/97809553602060000001. ISBN 978-1-4020-4969-9. S2CID 146060934. KINGA KOCSIS, DEPARTMENT OF MORPHOLOGY AND GEOMETRIC MODELLING and HUN-REN- BME MORPHODYNAMICS RESEARCH GROUP, BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS, Műegyetem Rkp. 3., K220, Budapest 1111, Hungary Email ad...

doi:10.1107/97809553602060000001 2006