{"id":"c5ff3096-cb29-4bdb-bdf7-2dd5131fa54d","arxiv_id":"2608.07613","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Hexagonal stacking maximizes the proton configuration count among all periodic uniform-registry ice-I polytypes, with certified entropy-constant bounds 1.503360 to 1.540196.","lead":"This paper proves that, among all periodic ways to stack the layers of ordinary ice, hexagonal stacking permits the most proton arrangements under the ice rule. It also supplies certified upper and lower bounds on the entropy constant, narrowing the previously known rigorous range.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Most load-bearing step is the exact transpose identity K(-1)=K^T in Eq. (1)/S2.1; it is proved and finite-checked but not machine-verified, so an independent enumeration check would close the last residual risk to the central comparison.","rationale":"The central proof is a finite trace inequality that is transparent once the transfer-word representation is granted: for any word, |tr(A_1...A_{2m})| ≤ ∏ ||A_j||_{2m} = ||K||_{2m}^{2m} = tr[(KK^T)^m], and the right-hand side is exactly the alternating hexagonal word. The thermodynamic passage for periodic polytypes is standard because one can choose even lengths that are multiples of the true translational period, or equivalently use the trace rate of a nonnegative transfer product. The Nagle-block lower bound and the prism/Finner/Collatz-Wielandt upper bounds are methodologically sound; the exact certificate vectors are not reproduced in the text, but the paper points to deposited verification code. I do not find an internal inconsistency. The one assumption on which everything rests is K^{(-1)} = K^T; the paper proves it and provides a finite check, but because the theorem would be invalid if the mirror relabeling introduced a nontrivial permutation, an independent brute-force enumeration for a nontrivial cross-section is the appropriate stress test. The screw-closure convention is a related subtlety: the lab count is tr(P_σ A_1...A_{2m}) rather than the plain trace, but the same Schatten–Hölder bound applies to that expression, so it does not threaten the periodic-stacking inequality. For these reasons, the reader's ACCEPT verdict remains appropriate; the concern raised here is a verification request rather than a demonstrated error.","tokens_in":15871,"tokens_out":36760,"duration_ms":378510,"concrete_test":"Write an independent brute-force enumerator for the layer model of Sec. S1.2 on a 4×4 torus: build K^{(+)} and K^{(-)} by enumerating all two-layer ice-rule assignments, and assert K^{(-)} == (K^{(+)})^T entrywise in exact integers. Also check that the direct ABAB torus count for two layers equals tr(KK^T), and that for one even-length word with nonzero registry shift, tr(P_σ A_1...A_{2m}) ≤ tr[(KK^T)^m]. If the transpose equality holds, the central comparison is secure.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim stands or falls on the identity K^{(-1)} = (K^{(+)})^T on the common boundary-state space. Equation (3) applies Schatten–Hölder to a word in K and K^T, and the right-hand side tr[(KK^T)^m] is identified with the alternating hexagonal count Z_Q(Ih). If the supplement's mirror-plus-arrow-reversal argument actually produced K^{(-1)} = P K^T P^{-1} with a nontrivial boundary permutation P, then Z_Q(Ih) would be tr[(K P K^T P^{-1})^m], not tr[(KK^T)^m], and the Hölder bound would no longer be a comparison against Ih. The paper proves the identity and gives a 2×3 block-level finite check, but it is not independently machine-checked. A related subtlety: for a screw closure the fixed-coordinate count is tr(P_σ A_1...A_{2m}), not the plain trace; however the same Hölder argument applies to the permuted first factor, so this does not threaten the periodic-stacking conclusion. The exact transpose identity is the one point where a hidden relabeling would invalidate the central theorem.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript proves a rigorous extremal statement for proton configurational entropy in ice I. It identifies every cyclic uniform-registry stacking word with a trace of a product of a nonnegative layer transfer matrix K and its transpose, and applies the Schatten–Hölder inequality to show that for every finite transverse section Q and every even-length word σ, Z_Q(σ) ≤ Z_Q(Ih) = tr[(KK^T)^m] (Eq. 3). From this it concludes that among periodic uniform-registry ice-I polytypes the hexagonal (ABAB) stacking maximizes the ice-rule configurational constant. The paper also supplies certified numerical endpoints: a common lower bound 1.503360395535 from Nagle's positive even-subgraph expansion restricted to exactly enumerated disjoint blocks, and upper bounds 1.540195787172 (common) and 1.52769873835 (cubic) from Finner's degree-two hypergraph Hölder inequality and rational Collatz–Wielandt certificates. Aperiodic sequences are treated along specified prism-tileable exhaustions, with the limitations stated explicitly.","tokens_in":16071,"tokens_out":36488,"duration_ms":349420,"significance":"If the result holds, it is a substantial advance over the previous rigorous endpoint comparisons: it covers the full periodic uniform-registry class rather than only the cubic and hexagonal ideal limits. The proof rests on a clean transfer-word identification and a short matrix inequality; the exact rational certificates, the explicit disclosure of the tileability restriction, and the archived verification code and certificates are notable strengths. I do not see the stress-test concern about a hidden boundary permutation in the transpose identity as a defect: S2.1 gives an argument for K^{(-1)}=(K^{(+)})^T and the displayed 2×3 block makes the transpose concrete. The honest treatment of what remains open (equality versus strict inequality of w(Ic) and w(Ih), uniqueness, exhaustion independence for aperiodic sequences) is a further strength.","major_comments":[],"minor_comments":[{"comment":"The exact transpose identity K^{(-1)}=(K^{(+)})^T is the load-bearing geometric fact behind Eq. (3). The current proof is compressed: reversal transposes the incidence 'while the mirror is a relabelling of Q that fixes the set of admissible pairs. Hence ... K^T.' Please expand this into an explicit coordinate-level bijection in the co-moving basis of S1.2, showing for arbitrary boundary states (η,η') that the opposite-registry count equals (K^{(+)})_{η'η}. The 2×3 finite check is helpful evidence but finite; an algebraic derivation would remove any residual concern about a surviving boundary permutation.","section":"S2.1"},{"comment":"When the period word has nonzero net registry shift modulo 3, a cyclic stack of length an odd or even multiple of p is a screw closure rather than an ordinary torus. For the thermodynamic comparison to the infinite periodic stack, please state that an even multiple of three periods (length 6pr, e.g. the word σ^{6r}) is used, so the registry shift vanishes and the finite graph is an ordinary torus; this factor is harmless in the rate. The sentence 'doubling the period first if p is odd' does not by itself remove a nonzero shift and should be adjusted.","section":"§III, Periodic polytypes"},{"comment":"The claim d_Q=2^{s_Q/2} deserves one explanatory sentence: since s_Q counts oxygen sites per layer and there are two sites per cell, the one-bit-per-cell boundary encoding gives 2^{#cells}=2^{s_Q/2}. As written, a reader may infer d_Q=2^{s_Q} from 'sites per layer'.","section":"S2.3"},{"comment":"Typo: 'apply (3) to 2r players' should read 'periods' or 'layers'.","section":"§III"},{"comment":"The abstract already says 'periodic uniform-registry polytypes,' but the title 'among Ice-I Polytypes' is broader. Since the later limitation statements are explicit, a small qualifier in the title or first sentence would avoid over-reading.","section":"Title/Abstract"}],"recommendation":"minor_revision","confidential_remarks":"This is a strong paper, well-suited to the journal. The remaining points are local clarifications; the code archive and exact certificates strengthen reproducibility. I recommend minor revision."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Josh—\n\nThe short version: this paper is a real step forward on the ice-I entropy question and should go to a serious referee. The authors show that among all periodic uniform-registry polytypes, hexagonal stacking maximizes the ice-rule proton configurational entropy. The key idea is to write every stacking as a word in a nonnegative transfer operator K and its transpose, then apply Schatten–Hölder. The alternating word (hexagonal) hits the Hölder bound, so it wins at every finite cross-section. That is a clean, new structural result, and it extends the old cubic/hexagonal endpoint comparison to all periodic words.\n\nThe paper also improves the certified interval for the configuration constant: 1.503360 to 1.540196, with a tighter cubic ceiling 1.527699. The lower bound comes from restricting Nagle's positive even-subgraph expansion to disjoint blocks; the upper from Finner's hypergraph Hölder inequality and exact rational Collatz–Wielandt certificates. All the certificates are exact arithmetic, and the code is on Zenodo. They are upfront about what remains open, notably whether w(Ic)=w(Ih).\n\nThe main load-bearing point is the exact transpose identity K(-1)=K^T on the boundary-state space. Everything rests on that. The supplement proves it via mirror reflection plus arrow reversal, and gives a small finite check. It is not machine-verified, so an independent enumeration check would close the last residual risk. I find the geometric argument persuasive, but it is the one place a hidden relabeling would sink the theorem. The screw-closure issue is handled honestly: in co-moving coordinates the trace is plain, and in fixed coordinates a permutation appears but is absorbed into the first factor.\n\nMinor complaints: the exact certificate vectors are not in the main text, so a reader has to go to the supplement and the Zenodo deposit to reproduce the bounds. That is not a flaw for this genre. Also, the 2x3 cross-section is untileable and gives a rate above the ceiling, which they flag explicitly.\n\nWho is this for? People working on ice, residual entropy, and rigorous bounds on Eulerian orientations. It is a solid, careful paper and I would cite it. Send it to review; the referee should focus on the transpose identity and the certificate arithmetic.","headline":"A rigorous, honest proof that hexagonal stacking maximizes proton configurational entropy among periodic uniform-registry ice-I polytypes; the load-bearing transpose identity is persuasive but not machine-checked.","tokens_in":16620,"tokens_out":2542,"would_cite":true,"duration_ms":22618,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["82B20","05C30","15A60"],"pacs":[],"model":"deepseek-v4-flash","headline":"By encoding every uniform-registry ice-I stacking as a word in a nonnegative transfer matrix and its transpose, this paper proves that hexagonal stacking maximizes the proton configurational entropy among all periodic polytypes, with…","keywords":["ice I polytypes","proton configurational entropy","ice rule","transfer matrix","hexagonal ice","cubic ice","Eulerian orientations","rigorous entropy bounds"],"falsifier":"For the 2×3 transverse section, construct the six-by-six block $K$ displayed in Eq. (2), enumerate all 16 words of length 4, and compare each trace with $\\operatorname{tr}[(K K^T)^2]$; if any word exceeds the alternating trace, the central inequality is false.","tokens_in":15634,"feed_emoji":"🧊","tokens_out":18248,"duration_ms":151228,"temperature":0.7,"pith_summary":"This paper proves that, within the equal-weight two-in, two-out ice rule, hexagonal stacking maximizes the number of proton configurations among all periodic ice-I polytypes built from the same puckered layer. The proof encodes every uniform-registry stacking sequence as a word in a nonnegative layer transfer matrix $K$ and its transpose, then applies a standard matrix-norm inequality to show that the alternating hexagonal word has the largest trace at every finite cross-section. This gives a thermodynamic statement: the configurational entropy constant $w$ of any periodic polytype is no larger than that of hexagonal ice. The paper also supplies certified bounds, $1.503360395535 \\leq w \\leq 1.540195787172$, with cubic ice bounded by $1.52769873835$, all valid in the infinite-crystal limit without finite-size extrapolation.","feed_headline":"Hexagonal stacking maximizes proton entropy in ice I","feed_subtitle":"Certified bounds put the entropy constant between 1.50336 and 1.54020","key_machinery":"The central object is the layer transfer matrix $K$, whose entries count two-in, two-out assignments between consecutive layers in one registry; the opposite registry is represented by its exact transpose $K^T$. Every uniform-registry stacking becomes a word in these two matrices, and the number of configurations for a periodic stack with matching closure is the trace of that word. The core identity is that the two registry operators are exact transposes, which forces every factor in a word to have identical singular values, so a standard norm inequality bounds the trace of any even-length word by the trace of the alternating word $(K K^T)^m$, namely the hexagonal stack. The certified bounds come from two further constructions: a positive even-subgraph expansion restricted to disjoint blocks for the lower endpoint, and a prism tiling with replica operators bounded by exact positive-vector certificates for the spectral radius for the upper endpoints.","core_discovery":"For a fixed transverse section $Q$ and any even-length word $\\sigma \\in \\{+1,-1\\}^{2m}$, the number of ice-rule configurations is $Z_Q(\\sigma) = \\operatorname{tr}(A_{\\sigma_1} \\cdots A_{\\sigma_{2m}})$, where $A_{+1}=K$ and $A_{-1}=K^T$. The paper proves that $\\operatorname{tr}(A_{\\sigma_1} \\cdots A_{\\sigma_{2m}}) \\leq \\operatorname{tr}[(K K^T)^m] = Z_Q(\\mathrm{Ih})$ for every such word, using the fact that a matrix and its transpose share the same singular values and applying a standard norm inequality for products of matrices. Because every uniform-registry polytype corresponds to such a word, passing to the thermodynamic limit yields $w(\\sigma) \\leq w(\\mathrm{Ih})$ for every periodic polytype. The lower endpoint is obtained by restricting a positive expansion over even subgraphs to disjoint exactly enumerated blocks, and the upper endpoints by tiling the transverse section with prisms whose replica counts are bounded by exact positive-vector certificates for the spectral radius, giving $1.503360395535 \\leq w \\leq 1.540195787172$ and $w(\\mathrm{Ic}) \\leq 1.52769873835$.","pith_inferences":["The certified spread of the bounds (about 0.2 J mol⁻¹ K⁻¹ in entropy) suggests that within the ice-rule model, proton configurational entropy is nearly degenerate across polytypes; observed stacking preferences are therefore more likely determined by energetic, vibrational, or kinetic selection than by the entropy term alone.","If a future proof establishes $w(\\mathrm{Ic}) = w(\\mathrm{Ih})$, cubic stacking would also sit at the entropy maximum, meaning stacking disorder carries essentially no protonic entropy penalty, and the observed prevalence of hexagonal ice would need another explanation.","One could probe the tightness of the inequality by exhaustive enumeration on slightly larger transverse sections: if some long word approaches $\\operatorname{tr}[(K K^T)^m]$ much more closely than cubic does, that word would mark a near-degenerate polytype worth studying with numerical methods.","The prism-tiling upper-bound construction is restricted to sections tileable by at least two prisms in each transverse direction; adapting it to arbitrary cross-sections or laterally varying fault networks would require a new argument, since the degree-two incidence property is essential to the inequality."],"forward_implications":["For every periodic uniform-registry ice-I polytype, the configurational entropy constant satisfies $w(\\sigma) \\leq w(\\mathrm{Ih})$; no cubic or mixed periodic stacking can beat hexagonal ice within the equal-weight ice-rule model.","The certified interval $1.503360395535 \\leq w \\leq 1.540195787172$ is rigorous in the thermodynamic limit, shrinking the previous general interval by a factor of about 4.1 for the whole stacking class and about 6.2 for cubic ice.","Cubic ice has the tighter certified ceiling $w(\\mathrm{Ic}) \\leq 1.52769873835$, but the order of the true constants $w(\\mathrm{Ic})$ and $w(\\mathrm{Ih})$ is not decided; the bounds are consistent with equality and with strict inequality.","The same transfer-word comparison applies to any layered constraint model whose two registry operators are nonnegative exact transposes on a common state space, so the hexagonal maximum is a general combinatorial phenomenon rather than an ice-specific accident.","The bounds are certified without diagonalizing the relevant transfer operators; they rely on exactly enumerated blocks and on positive rational vectors, so they can be independently verified by exact integer arithmetic."],"supporting_citations":[{"why":"Proves the exact transpose relation $K(-1)=K^T$ between the two layer registry operators, the load-bearing geometric identity of the trace-word representation.","marker":"[13]"},{"why":"Supplies the standard matrix-norm inequality (Hölder for Schatten norms) used to show the alternating word maximizes the trace.","marker":"[19]"},{"why":"Gives the positive even-subgraph expansion that underlies the certified lower bound.","marker":"[8]"},{"why":"Provides the graph-counting framework for the positive expansion, alongside the original derivation.","marker":"[21]"},{"why":"Provides the degree-two hypergraph Hölder inequality used in the prism-tiling upper bound.","marker":"[22]"},{"why":"Introduces the positive-vector comparison method used to bound spectral radii without diagonalization.","marker":"[23]"},{"why":"Applies the comparison-vector method to transfer-matrix and corner-transfer settings, supporting the rational certificates.","marker":"[24]"},{"why":"Gives the limit theorem for Eulerian orientations on convergent graph sequences used to define the thermodynamic configuration constant.","marker":"[18]"}],"fun_headline_variants":["Hexagonal stacking maximizes proton entropy in all ice I polytypes","Hexagonal ice I sets the record for proton configurational entropy","Mathematical proof: hexagonal stacking maximizes ice I entropy","Ice I polytypes: hexagonal stacking wins the entropy contest","Hexagonal stacking proven optimal for proton entropy in ice I"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The proof assumes that switching from one layer registry to the other exactly transposes the layer transfer matrix; if the transpose relation between the two registries failed, the hexagonal word would not be the guaranteed maximum.","fun_headline_variants_meta":{"raw":{"variants":["Hexagonal stacking maximizes proton entropy in all ice I polytypes","Hexagonal ice I sets the record for proton configurational entropy","Mathematical proof: hexagonal stacking maximizes ice I entropy","Ice I polytypes: hexagonal stacking wins the entropy contest","Hexagonal stacking proven optimal for proton entropy in ice I"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00124,"raw_usage":{"total_tokens":5107,"prompt_tokens":978,"completion_tokens":4129,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":594,"completion_tokens_details":{"reasoning_tokens":4046}},"tokens_in":594,"tokens_out":4129,"duration_ms":29798,"temperature":1.0,"reasoning_tokens":4046,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-11T00:32:38.006907+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"For the 2×3 transverse section, construct the six-by-six block $K$ displayed in Eq. (2), enumerate all 16 words of length 4, and compare each trace with $\\operatorname{tr}[(K K^T)^2]$; if any word exceeds the alternating trace, the central inequality is false.","supporting_citations":[{"cited_title":"Borbényi and P","cited_arxiv_id":null,"evidence_quote":"Introduces the positive-vector comparison method used to bound spectral radii without diagonalization."},{"cited_title":"Li, Y.-J","cited_arxiv_id":null,"evidence_quote":"Proves the exact transpose relation $K(-1)=K^T$ between the two layer registry operators, the load-bearing geometric identity of the trace-word representation."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the standard matrix-norm inequality (Hölder for Schatten norms) used to show the alternating word maximizes the trace."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Gives the positive even-subgraph expansion that underlies the certified lower bound."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the degree-two hypergraph Hölder inequality used in the prism-tiling upper bound."},{"cited_title":"Finner, A generalization of Hölder’s inequality and some probability inequalities, Ann","cited_arxiv_id":null,"evidence_quote":"Applies the comparison-vector method to transfer-matrix and corner-transfer settings, supporting the rational certificates."},{"cited_title":"Hudait, S","cited_arxiv_id":null,"evidence_quote":"Gives the limit theorem for Eulerian orientations on convergent graph sequences used to define the thermodynamic configuration constant."}],"review_version":1}