{"id":"ae93dcb7-c8ff-4aba-814b-56f89c9ed71f","arxiv_id":"2607.09555","paper_version":1,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":5.5,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Certified one-layer improvement of the KS diameter bound at 92 Lennard-Jones sizes, plus the asymptotic form ρ_KS = N − Θ(√N) with exact gain constant.","lead":"This paper certifies a one-layer tightening of the Kuznetsov–Sahinidis diameter bound for optimal Lennard-Jones clusters at 92 sizes up to N=200, using better per-layer energy floors from proven small-cluster minima. It also derives the true asymptotic shape of the original bound as N minus order sqrt(N) and shows the refinement gain grows the same way.","discovery_kind":"extension","skeptic_critique":{"model":"grok-4.5","headline":"No significant objection identified","rationale":"The Reader correctly isolates the KS consecutive-layer property as the sole external premise needed to convert energy certificates on fully occupied profiles into a diameter statement about global minimizers. That premise is stated in Section 3, used only in the final paragraph of the proof of Theorem 1, and does not affect the energy lower bounds, the arrangement-free Lemma 2, the directed-rounding checks, or the asymptotic analysis of Sections 8. Because the paper already flags the limitation, ships independent verification scripts, and claims only a rigorous one-layer tightening of a published a priori bound (plus the asymptotic resolution of an open point), the argument holds under the scrutiny applied here. No stronger load-bearing concern surfaces; the verdict remains ACCEPT.","tokens_in":15881,"tokens_out":504,"duration_ms":6143,"concrete_test":"Independently re-run certify_lemma_free.py (or re-implement Lemma 2 + directed-rounding comparisons) on the 92 sizes listed in the supplementary material, confirming that the lower endpoint of the arrangement-free bound still strictly exceeds the upper endpoint of each V_put (worst reported margin 0.002708 at N=38). If any size fails under independent re-verification, the corresponding certificate of Theorem 1 collapses.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's central claims (Theorem 1 certificates for 92 sizes, Theorem 2 asymptotics of the original KS program, and Corollary 2 on the refined gain) rest on a transparent chain: the layer energy lower bound (5) with the certified f of (7) via the subset inequality and proven V*_5, V*_6; the arrangement-free closure of Lemma 2 (rearrangement inequality only); directed-rounding verification that min ELB exceeds V_put; and the KS consecutive-nonempty-layer structural property for the passage from fully-occupied profiles to minimizers. That structural property is the only external premise, is clearly flagged by the authors and by the Reader, and is used only for the diameter statement about minimizers (the energy claim for fully occupied spans is unconditional). The asymptotic results are independent of it and of the refinement certificates. No internal inconsistency, hidden assumption, or numerical gap that would overturn the claims is apparent; the authors already demonstrate the tightening is non-enabling for solvers and present the work as a theoretical note.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.5","summary":"The paper refines the Kuznetsov–Sahinidis (KS) a priori diameter bound for optimal Lennard–Jones clusters by replacing the trivial per-layer floor −binom(n,2) with a certified estimate f built from the KS subset inequality and the proven minima V*_5, V*_6. The resulting layer energy lower bound is minimized over population profiles; centred decreasing candidates supply numerical thresholds, while an arrangement-free lower bound (Lemma 2), relying only on the rearrangement inequality and elementary field/distance estimates, certifies every comparison over all profiles and placements. Directed-rounding arithmetic closes 92 one-layer improvements of ρ_KS for 5≤N≤200 (Theorem 1). Independently, the original KS layer program is shown to satisfy N−ρ_KS(N)=Θ(√N) (Theorem 2), resolving an open point in [1], and the refined program is proved to gain an additional θ√(2(u_N−σ_0)N)+O(1) layers with explicit θ≈0.026433 (Corollary 2). The authors report a negative downstream test on N≤6 (diameter box not binding) and present the work as a theoretical note that certifies no new global minimum.","tokens_in":16029,"tokens_out":1463,"duration_ms":29620,"significance":"If correct, the contribution is a rigorous, fully certified tightening of a published geometric bound together with a clean asymptotic analysis that replaces an empirical linear fit by N−Θ(√N) and quantifies the refined gain with an exact constant. Strengths that should be credited explicitly include: (i) the arrangement-free closure of Lemma 2, which makes the certificates independent of rearrangement completeness; (ii) directed-rounding re-verification with outward padding of V*_5, V*_6 and V_put, including an explicit worst margin (0.002708 at N=38); (iii) a self-contained reproducibility package that regenerates all 92 certificates and the asymptotic identities; and (iv) the authors’ transparent negative solver experiment and refusal to overclaim practical impact. For a global-optimization journal this is a legitimate theoretical note: it improves a tool used in deterministic LJ work and settles a structural question left open by KS, even though it does not advance the certified-N frontier.","major_comments":[{"comment":"Theorem 1 (and the last paragraph of its proof) uses the KS structural property that every global minimizer occupies a block of consecutive nonempty layers. The energy claim for fully occupied spans is unconditional and rests only on (5), (7), Lemma 2 and directed rounding; the passage to a diameter statement about minimizers, however, depends entirely on that external premise. The manuscript flags the dependence clearly, but for self-containment a short sketch of the argument in [1] (or an explicit theorem/lemma number) should be added in Section 3 so that a reader can verify the only load-bearing external structural input without retrieving the source paper.","section":null},{"comment":"Section 6 and Theorem 1: the certificates are closed by showing that the arrangement-free bound (10) exceeds V_put at D=ρ_KS for every surplus multiset. The text states that a branch-and-bound over all p(e) partitions was used and that 92/92 close, with worst directed margin 0.002708 at N=38. Because the margin at N=38 is three orders of magnitude smaller than typical margins and rests on three copies of V*_5, the supplementary material (or a short appendix table) should list, for that single borderline size, the numerical lower endpoint of (10), the padded V_put, and the three-layer profile that realises the candidate minimum, so that the tightest certificate can be inspected without re-running the package.","section":null}],"minor_comments":[{"comment":"Section 3, display (4): the switch from the original KS kernel V_LJ(d) to the conservative V_LJ(d−1) is correctly described as a self-handicap, and the text asserts that integer ρ_KS is unchanged on 5≤N≤200. A one-line pointer to the script or table that records this identity would make the claim immediately checkable.","section":null},{"comment":"Lemma 3 / Theorem 2: the closed form (12) and the prediction N−⌈e⋆⌉ are verified with zero discrepancy up to N=2000. The manuscript already states that this is a verified identity on that range rather than a theorem for all N; adding the same disclaimer next to the display of (19) would prevent a casual reader from over-reading the asymptotic claim.","section":null},{"comment":"Proposition 1 (Property (R)) is proved by two-point polarization and is not used in the certificates of Sections 5–6. The exposition is clear, but a forward reference in Section 5 (“proved later as Proposition 1; not required for Theorem 1”) would help readers who stop after the main certificates.","section":null},{"comment":"Table 1 is only a summary; the full list of 92 sizes is deferred to the supplementary material. For archival readability it would be useful to include at least the first and last few certified N together with their margins in the main text, or to print the full list as a short table in an appendix.","section":null},{"comment":"Notation: κ(d):=−v̄(d) and the band forms R_t appear in Section 5 before the layer-cake identity is fully motivated. A single sentence recalling that κ is nonincreasing (hence Δ_t≥0) at the start of Lemma 1 would smooth the reading.","section":null},{"comment":"References [3] and [4] both concern the N=5 certificate; a parenthetical note that V*_5 is taken from the Charibde computation as reported in [3] would avoid any ambiguity about the numerical source of the padded value −9.103853.","section":null},{"comment":"Typographical: abstract and introduction use both “Kuznetsov–Sahinidis” and “Kuznetsov and Sahinidis”; pick one style. Also, “P´ olya” in the bibliography should be “Pólya”.","section":null}],"recommendation":"minor_revision","confidential_remarks":"The manuscript is carefully written, does not overclaim, and ships reproducible certificates. It is a natural fit for J. Glob. Optim. as a short theoretical note refining a bound that appeared in the same journal. The only external premise that could worry an editor is the KS consecutive-layer property; once that is sketched or precisely cited, the paper is essentially ready. I see no novelty or citation-pattern concerns."},"author_rebuttal":null,"desk_editor":{"model":"grok-4.5","letter":"This is a careful theoretical note that does exactly what it says. It tightens the Kuznetsov–Sahinidis diameter bound by one layer at 92 sizes up to N=200, and it settles the asymptotic shape of the original KS program as N−Θ(√N) with an explicit constant for the refined gain. Nothing here certifies a new global minimum or shortens a solver run; the author tests the only tractable sizes and reports a negative result, then labels the work a theoretical note. That honesty is useful.\n\nWhat is new is the replacement of the trivial per-layer floor −binom(n,2) by a certified subset estimate built only from the already-proven V*_5, V*_6 and the KS subset inequality, plus the arrangement-free lower bound (Lemma 2) that closes every certificate over all profiles using only the rearrangement inequality and elementary field estimates. Directed-rounding re-verification with outward padding, plus shipped independent scripts, makes the 92 certificates reproducible. The asymptotic analysis (exact minimum of the KS layer program, closed-form ζ constants, and the explicit θ≈0.026 for the gain) is clean and independent of the refinement certificates.\n\nThe only external premise is the KS consecutive-nonempty-layer structural property used to pass from fully-occupied profiles to statements about minimizers. The author flags it clearly; the energy claims for fully occupied spans stand without it. Soft spots are minor and already disclosed: the absolute gain is one layer in the tabulated range (though asymptotically Θ(√N)), the subset floor is deliberately loose for large layers, and the diameter box is not binding for existing solvers. None of that undercuts the claims.\n\nMath, data, and citations look solid. Circularity is low. This is for people who care about a priori geometric bounds and certified global optimization of LJ clusters. I would send it to a serious referee; it is short, precise, and self-contained. Worth engaging if that is your subfield.","headline":"Solid, self-contained theoretical note: certified one-layer tightening at 92 sizes plus a clean asymptotic resolution of an open KS question, with no solver impact claimed or shown.","tokens_in":16707,"tokens_out":506,"would_cite":false,"duration_ms":6084,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["90C26","49M37","65K05"],"pacs":[],"model":"grok-4.5","headline":"A certified one-layer tightening of the Kuznetsov–Sahinidis diameter bound for 92 Lennard–Jones sizes, plus the asymptotic form N − Θ(√N).","keywords":["Lennard-Jones clusters","diameter bound","layer bound","global optimization","rearrangement inequality","asymptotic analysis","certified refinement"],"falsifier":"Recompute the arrangement-free lower bound of Lemma 2 at D = ρ_KS(N) for any of the 92 certified sizes and check whether its directed-rounding lower endpoint still strictly exceeds the upper endpoint of V_put(N); a single size where the inequality fails or equals would falsify the claimed one-layer improvement.","tokens_in":16704,"feed_emoji":"⚛️","tokens_out":836,"duration_ms":7446,"temperature":0.7,"pith_summary":"Optimal Lennard–Jones clusters are hard to certify because the search box is large; an a priori diameter bound shrinks that box. Kuznetsov and Sahinidis obtained such a bound by slicing space into unit-width layers and charging every layer the loosest possible internal energy. This paper replaces that loose charge with a certified estimate built from the proven five- and six-atom minima and a subset inequality already present in their work, then minimizes the resulting energy lower bound over all population profiles. An arrangement-free relaxation that uses only the classical rearrangement inequality for sequences certifies the minimum over every profile, and every comparison is re-checked in directed-rounding arithmetic. The result is a rigorous one-layer improvement of the published bound at 92 sizes between 5 and 200. Independently, the original layer program is shown to satisfy N − ρ_KS = Θ(√N), settling an asymptotic question left open by the earlier paper, while the refined program gains an additional Θ(√N) layers with an explicit constant. The tightening does not yet resolve any open global-optimization case and is presented as a theoretical note: on the only sizes a solver can finish, the diameter box is not the binding resource.","feed_headline":"One-layer tighter diameter bound for 92 LJ cluster sizes","feed_subtitle":"Certified refinement of the KS bound, plus the asymptotic form N − Θ(√N) with exact gain constant","key_machinery":"The arrangement-free lower bound of Lemma 2: after writing the layer energy as background plus surplus–base field plus surplus–surplus binding plus intra-layer terms, the central field is minimal, sorted distances of contiguous sites minimize the kernel, and the rearrangement inequality pairs the sorted products with those distances, closing a rigorous lower bound over every surplus multiset and every placement without enumerating arrangements.","core_discovery":"For each of 92 sizes N in 5 ≤ N ≤ 200, every N-atom configuration whose atoms occupy ρ_KS(N) consecutive nonempty layers has energy strictly greater than V_put(N) ≥ V*_N. By the structural property that a global minimizer occupies a block of consecutive nonempty layers, no global minimizer spans ρ_KS(N) layers, so the diameter bound improves to diam < ρ_KS(N) − 1. Independently, the original KS layer program satisfies N − ρ_KS(N) = Θ(√N), and the refined program gains an additional θ √(2(u_N − σ_0)N) + O(1) layers with explicit θ ≈ 0.026433.","pith_inferences":[],"forward_implications":[],"fun_headline_variants":["Certified one-layer KS diameter shrink for 92 LJ sizes","KS layer bound refined by V5* V6* for 92 clusters","Tighter diam < ρ_KS(N)−1 certified on 92 LJ sizes","Asymptotics of KS bound: N−Θ(√N) plus Θ(√N) gain","Arrangement-free certificates cut KS diameter at 92 N"],"cache_read_input_tokens":128,"weakest_assumption_plain":"The structural claim that every global minimizer occupies a solid block of consecutive nonempty layers; without it the energy certificates for fully occupied profiles still hold, but they no longer imply a diameter bound on the minimizers themselves.","fun_headline_variants_meta":{"raw":{"variants":["Certified one-layer KS diameter shrink for 92 LJ sizes","KS layer bound refined by V5* V6* for 92 clusters","Tighter diam < ρ_KS(N)−1 certified on 92 LJ sizes","Asymptotics of KS bound: N−Θ(√N) plus Θ(√N) gain","Arrangement-free certificates cut KS diameter at 92 N"]},"model":"grok-4.5","effort":"low","cost_usd":0.003064,"raw_usage":{"total_tokens":1138,"prompt_tokens":941,"num_sources_used":0,"completion_tokens":105,"cost_in_usd_ticks":30640000,"prompt_tokens_details":{"text_tokens":941,"audio_tokens":0,"image_tokens":0,"cached_tokens":0},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":92,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":941,"tokens_out":105,"duration_ms":2584,"temperature":1.0,"reasoning_tokens":92,"cache_read_input_tokens":0,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-13T02:10:01.391721+00:00","model_set":{"reader":"grok-4.5"},"falsifier":"Recompute the arrangement-free lower bound of Lemma 2 at D = ρ_KS(N) for any of the 92 certified sizes and check whether its directed-rounding lower endpoint still strictly exceeds the upper endpoint of V_put(N); a single size where the inequality fails or equals would falsify the claimed one-layer improvement.","supporting_citations":[],"review_version":1}