{"id":"7fc94317-0c1e-474d-98c4-9add9fe215e2","arxiv_id":"2412.00937","paper_version":3,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":7.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"New non-isometric kissing configurations are constructed in dimensions 5 and 9, and the uniform 5D packings containing the known kissing configurations are classified.","lead":"The authors construct a fourth 40-sphere kissing configuration in five dimensions and a new 306-sphere configuration in nine dimensions. The accompanying packings do not beat any records, but they show that the standard conjectural lists of optimal low-dimensional packings are incomplete.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 4.3's global classification depends on a depth-first search whose proof does not explicitly show that local uniqueness at the finite shell K0 propagates to the entire infinite uniform packing; a check of whether the search generates a full fundamental cell is needed.","rationale":"The reader's weakest assumption correctly targets the finite computer searches. I agree that this is the critical point, but I want to sharpen it: the most delicate issue is not merely the arithmetic enumeration, but the logical step from local uniqueness at points of K0 to global uniqueness of the whole uniform packing. The proof's phrase 'iterating this procedure determines Kv for every v ∈ K0' is ambiguous; K0 is only the 40-point shell around the origin. Even a perfect DFS that proves uniqueness of the overlap extension for every shell point does not, by itself, exclude a uniform packing made of two translated copies of the same cluster with a gap between them. The search must be shown to generate the infinite connected component and its periods. Since the deposited code presumably does this, the paper would be strengthened by stating exactly what the code computes, including the fundamental domain and stopping criterion. I would not reject the paper, but I would condition acceptance on verification of this point, because Theorem 4.3 is the main classification result and would be false if a second component could be inserted. The explicit-coordinate existence theorems (2.1 and 5.1) are checkable directly from Tables 2.1, 2.2, and 5.3, and are not at issue.","tokens_in":15615,"tokens_out":31801,"duration_ms":293953,"concrete_test":"Instrument the deposited DFS code (hdl.handle.net/1721.1/157699) to log the set of sphere centers generated from the initial K0. For Q5 and R5, verify that this set, modulo the period lattice Λ given in Table 4.2, equals the full set of sphere centers in one fundamental cell of the corresponding uniform packing, and that the iteration does not halt before reaching all 2 or 4 translates. Independently re-run the DFS for one representative v ∈ K0 with a separately written brute-force embedder to confirm the uniqueness classification modulo Sym(K0). If the generated set matches the periodic packing, the global-propagation gap is closed; if it stops early or the independent embedder finds an inequivalent extension, Theorem 4.3 is not proven.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"In Section 4.2, the proof of Theorem 4.3 asserts that if the overlap of a point v in K0 has a unique extension to a kissing configuration isometric to K0, then the entire uniform packing is determined by induction. For Q5 and R5, the proof states that 'iterating this procedure determines Kv for every v ∈ K0.' Taken literally, K0 is only the finite 40-point kissing shell around the origin, and knowing the kissing configuration at each of those 40 points fixes at most the first two or three layers of spheres. It does not, by itself, rule out a second, disconnected component in a uniform packing: a packing formed by two translated copies of the same cluster, separated by a gap large enough to avoid overlaps, would still be uniform if a period-2 translation swaps the components. To rule out such a packing, the search must propagate through the entire connected component and identify its periods. The paper does not state that the deposited code performs this global propagation, nor does it report the iteration count, the stopping criterion, or the size of the fundamental cell generated. If the search terminates after resolving the initial shell, the conclusion 'at most one uniform packing' does not follow. This is the single load-bearing assumption for the classification; the existence claims in Theorems 2.1 and 5.1 rest on explicit coordinates and inner-product tables and are not affected.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies five-dimensional kissing configurations and sphere packings. It introduces a new 40-point kissing configuration R5 by modifying a layer of L5, and proves Theorem 2.1 that D5, L5, Q5, and R5 are pairwise non-isometric, using antipodal-pair counts and inner-product spectra. It then uses a four-coloring construction over D3 layers to produce sphere packings, including two new uniform packings with Q5 and R5 kissing configurations, and states Theorem 4.3 classifying uniform packings with these local configurations. In Section 5 it constructs a new 306-point nine-dimensional kissing configuration by modifying a layer of the Leech-Sloane configuration, proving Theorem 5.1. The paper deposits verification code at DSpace@MIT and positions the results as geometrically distinct constructions that match, but do not improve, known records.","tokens_in":15918,"tokens_out":17933,"duration_ms":177463,"significance":"If Theorem 4.3 is established, it completes the enumeration of uniform five-dimensional packings with the known extremal local kissing configurations and adds two new uniform packings to Leech's list. The new R5 and nine-dimensional configurations are explicit and machine-checkable, with full coordinate tables and inner-product counts. The constructions are parameter-free and produce falsifiable claims, and the code deposit is a genuine strength that supports the computational assertions.","major_comments":[{"comment":"The proof of Theorem 4.3 does not justify the step from local uniqueness of kissing configurations to uniqueness of the entire uniform packing. Uniformity, as defined in the paper (transitive automorphism group on spheres), does not imply that the tangency graph is connected; a uniform packing could a priori consist of multiple components with no contacts between them, each component carrying the same kissing configuration. The induction shows at most one connected component, not at most one packing, and the text does not report the search's stopping criterion, iteration count, or whether it generates periods/fundamental cells that would rule out further components. Please either add an explicit argument that the contact graph is connected for these kissing configurations (for example, using density or covering-radius constraints) or state Theorem 4.3 for connected uniform packings, and make any intended density assumption explicit in the theorem statement.","section":"§4.2, Theorem 4.3"},{"comment":"The sentence 'iterating this procedure determines Kv for every v ∈ K0' is ambiguous and insufficient. If v ranges only over the initial 40-point shell, the argument determines at most the first two shells of the packing. If v ranges over newly generated points, the paper should define the growth process explicitly and prove that it exhausts all spheres of the packing; otherwise the conclusion 'there is therefore at most one uniform packing' does not follow. This is the load-bearing step for the classification claim.","section":"§4.2, proof paragraph"}],"minor_comments":[{"comment":"The statements 'one can check by depth-first search' (Section 3) and 'one can check that there are exactly eight other triples' (Section 5) would be easier to verify if the paper stated the precise search parameters, the relevant code file in the DSpace deposit, and, where possible, a short certificate or enumeration summary.","section":"§3 and §5"},{"comment":"The paragraph before Theorem 4.3 mentions 'with the same density as the D5 root lattice', but the theorem statement itself refers only to 'uniform sphere packings'. Please reconcile these, since the statement and proof currently appear to quantify over different classes of packings.","section":"§4.2"},{"comment":"Table 2.2 is visually dense and easy to misread; separating the four configurations with rules or explicit labels would improve clarity.","section":"§2, Table 2.2"},{"comment":"The notation 'permute' in displayed coordinate lists is informal; a sentence explaining that it means all permutations of the listed coordinates would help readers.","section":"§2, displayed coordinate lists"}],"recommendation":"major_revision","confidential_remarks":"The existence results in Theorems 2.1 and 5.1 are solid and publishable once the computational claims are documented. The main obstacle is the proof of Theorem 4.3, which as written does not rule out uniform packings with multiple connected components; this needs either a connectivity argument or a clarified theorem statement. I therefore recommend major revision rather than rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"First, the good news: the paper's existence claims are real. R5 is a genuinely new 40-point kissing configuration in R5, distinct from D5, L5, and Q5 by antipodal-pair count and inner product spectrum. The nine-dimensional modification of Leech-Sloane is also new, and the coordinates are all in the paper and the deposited code. The five-dimensional packing construction via four-colored tilings is elegant, and the authors are properly careful about attributing the Q5 uniform packing to Andreanov-Kallus. The code deposit at DSpace is a real plus; anyone can verify the inner product counts and the search outputs.\n\nThe soft spot is Theorem 4.3, and it is not minor. The proof shows that if the kissing configuration at every point of the initial shell K0 is uniquely determined, then by induction the entire uniform packing is determined. That induction only determines the connected component of the origin. Nothing in the proof rules out a uniform packing made of two widely separated copies of the same periodic cluster, with a translation swapping the two components. If the gap is large enough, every sphere still has the same kissing configuration, so the packing is uniform. The paper does not report a search that propagates through the whole fundamental domain, nor does it give the iteration count or the size of the cell generated. Without that, 'there is at most one uniform packing' does not follow. I checked the stress-test concern against the proof text, and it holds up.\n\nThe other weakness is that the key searches are not formally verified, so the completeness claims rest on code. That is a normal situation in this kind of paper, but it makes the missing global-propagation argument more important, not less.\n\nBottom line: the paper is worth refereeing, and the constructions are likely correct. But Theorem 4.3 needs either a repaired proof that handles disconnected components or a more modest statement. I would not accept as-is; major revision. The reader's ACCEPT is a bit too generous on this point. Who this is for: sphere packing people, discrete geometers, coding theorists. Bring to reading group if you want to discuss what 'uniform' should mean.","headline":"New 5D and 9D kissing configurations are solid and checkable, but Theorem 4.3's uniform-packing classification has a real gap: local induction doesn't exclude disconnected uniform packings.","tokens_in":629,"tokens_out":810,"would_cite":true,"duration_ms":139243,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["52C17","11H31"],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proves there are at least four non-isometric 40-point kissing configurations in five dimensions, constructs one new one (R5), and uses the same layer-replacement idea to produce a second 306-point kissing configuration in nine…","keywords":["kissing number","sphere packings","five dimensions","nine dimensions","uniform packings","layer replacement","spherical codes","Riesz energy"],"falsifier":"A concrete way to test the central non-extendability claim is to search the 32 deep holes of Q5 for 16 points with pairwise inner product at most $2/5$; finding such a subset would directly refute the paper's assertion that no admissible extension exists.","tokens_in":15420,"feed_emoji":"⚪","tokens_out":10780,"duration_ms":92249,"temperature":0.7,"pith_summary":"The paper establishes that the five-dimensional kissing problem has more geometric diversity than previously known: there are at least four non-isometric configurations of 40 points on a sphere with mutual angular separation at least $\\pi/3$, one of which, R5, is new. It then shows that these configurations extend to five-dimensional sphere packings at the best known density, and that exactly six uniform packings carry these four local configurations. The same layer-replacement mechanism yields a second non-isometric 306-point kissing configuration in nine dimensions. None of the constructions improves the known density or kissing-number records; instead, they show the record values are realized by genuinely different geometries, and they expose an unusual amount of flexibility in dimension five. The paper also proposes a two-dimensional coloring framework that, if its conjecture holds, would classify every weakly recurrent optimally dense five-dimensional packing.","feed_headline":"40 spheres can touch a central 5D sphere in four distinct patterns","feed_subtitle":"The new R5 arrangement and its packings diversify the record-achieving geometries in dimensions 5 and 9.","key_machinery":"The carrying mechanism is layer replacement: slice a known kissing configuration by a hyperplane, keep the central cross section and one outer layer, and replace the opposite layer with a reflected or coordinate-modified copy of the retained one. The admissibility of a replacement is controlled by the deep holes of the central spherical code, the points on the sphere that are as far as possible from all configuration points; a replacement layer is allowed exactly when its points nestle into those holes without violating the $\\pi/3$ separation bound. For packings, the machinery is a four-coloring construction: five-dimensional packings are obtained by stacking translates of the D3 root lattice over a two-dimensional point configuration whose vertices carry colors 0,1,2,3, with distance rules for same, adjacent, and opposite colors. Valid colorings of edge-to-edge tilings by two specific triangles realize the desired kissing configurations, and a depth-first search over isometric embeddings of overlaps is used to prove uniqueness of the uniform packings. Non-isometry of configurations is certified by counting antipodal pairs and by comparing the full histogram of inner products.","core_discovery":"On the paper's own terms, the central discovery is that the record-achieving kissing configurations in five and nine dimensions are not unique, and that the new examples arise from a simple modification of known ones. Starting from L5, the authors replace one outer layer by the reflection of the other across the central hyperplane to get R5; the new configuration is certified as distinct by its antipodal-pair count (12, versus 20, 24, and 20 for D5, L5, and Q5). The same idea works in nine dimensions: modifying one layer of the previously known 306-point configuration produces a new configuration that has broken antipodal symmetry and fewer close pairs. For packings, the paper proves that up to isometry there are exactly six uniform five-dimensional packings whose kissing configuration is one of D5, L5, Q5, or R5; the Q5 packing is 2-periodic and the R5 packing is 4-periodic, and every symmetry of the kissing configuration extends to the packing. It also reports that Q5 and R5 cannot be extended to six dimensions by the layer method, because no admissible 16-point subset of deep holes exists, and conjectures that no six-dimensional kissing configuration with 72 or more points contains either as a cross section.","pith_inferences":["The layer-replacement trick reads as a mutation operation on spherical codes; systematically testing all admissible replacements in dimensions 5 through 9 could uncover further configurations, with the six- and seven-dimensional failures acting as constraints on when mutations exist.","The four-coloring framework converts density optimality for this family into a two-dimensional conjecture; proving that conjecture would establish optimality only among packings built this way, but it would be a concrete stepping stone toward the unsolved five-dimensional sphere packing problem.","The inner-product histograms induce an energy ordering on record configurations, suggesting that Riesz-energy minimization and kissing-number maximization favor different geometries; searches in unsolved dimensions might profit by optimizing both objectives separately.","In nine dimensions the modified layer is obtained by swapping coordinates inside the supporting binary code; since the underlying constant-weight code is unique, further geometric diversity would have to come from different sign patterns or layer choices rather than different codes."],"forward_implications":["Any future proof or classification of optimal five-dimensional packings must accommodate four non-isometric extremal kissing configurations, not just the originally known one.","Within the family of uniform packings, the classification is complete: a uniform five-dimensional packing with any of these kissing configurations is one of six listed packings, one with D5, three with L5, one with Q5, and one with R5.","The layer method used for Q5 and R5 cannot extend them to six dimensions, so the new flexibility appears to be special to dimension five unless a different construction is found.","In nine dimensions, the new 306-point configuration achieves the same kissing record but has fewer pairs at the minimal distance and lower Riesz energy for large exponents, so energy-based selection would prefer the original configuration.","If the proposed conjecture is correct, every weakly recurrent optimally dense five-dimensional packing is represented by a valid four-coloring of a triangular tiling, turning the classification into a two-dimensional problem."],"supporting_citations":[{"why":"Supplies the third five-dimensional kissing configuration Q5, which this paper analyzes and extends to a uniform packing.","marker":"[20]"},{"why":"Provides the original D5 root-system kissing configuration, the baseline for comparison in five dimensions.","marker":"[9]"},{"why":"Introduces the L5 kissing configuration and the three uniform non-lattice five-dimensional packings whose classification this paper extends.","marker":"[11]"},{"why":"Gives the conjectural list of low-dimensional optimal packings and the stacking classification used for the L5 uniform packings.","marker":"[5]"},{"why":"Classifies dense 2-periodic packings and independently discovered the Q5 uniform packing; used to identify the Q5 packing as 2-periodic.","marker":"[1]"},{"why":"Constructs the original 306-point nine-dimensional kissing configuration whose layer is modified.","marker":"[13]"},{"why":"Classifies binary constant-weight codes and supplies the uniqueness of the code underlying the nine-dimensional construction.","marker":"[18]"},{"why":"Records that the 306-point configuration was the only known nine-dimensional kissing configuration, the claim this paper revises.","marker":"[3]"},{"why":"Provides the six-dimensional kissing configurations built from L5, which the paper contrasts with the failed Q5 and R5 extensions.","marker":"[12]"}],"fun_headline_variants":["Fourth distinct 5D kissing arrangement discovered","New 5D and 9D kissing configurations tie records","Mirror trick creates new 5D and 9D kissing arrangements","Four ways to place 40 spheres around a 5D center","Five-dimensional sphere packings get a fourth kissing pattern"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing assumption is that the finite depth-first computer searches are complete and correctly implemented, because the uniqueness of the uniform packings and the non-existence of six-dimensional extensions both rest on those searches.","fun_headline_variants_meta":{"raw":{"variants":["Fourth distinct 5D kissing arrangement discovered","New 5D and 9D kissing configurations tie records","Mirror trick creates new 5D and 9D kissing arrangements","Four ways to place 40 spheres around a 5D center","Five-dimensional sphere packings get a fourth kissing pattern"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001025,"raw_usage":{"total_tokens":4283,"prompt_tokens":871,"completion_tokens":3412,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":487,"completion_tokens_details":{"reasoning_tokens":3329}},"tokens_in":487,"tokens_out":3412,"duration_ms":25188,"temperature":1.0,"reasoning_tokens":3329,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-12T04:50:21.539178+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A concrete way to test the central non-extendability claim is to search the 32 deep holes of Q5 for 16 points with pairwise inner product at most $2/5$; finding such a subset would directly refute the paper's assertion that no admissible extension exists.","supporting_citations":[{"cited_title":"A note on five dimensional kissing arrangements","cited_arxiv_id":"2301.08272","evidence_quote":"Supplies the third five-dimensional kissing configuration Q5, which this paper analyzes and extends to a uniform packing."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduces the L5 kissing configuration and the three uniform non-lattice five-dimensional packings whose classification this paper extends."},{"cited_title":"Locally optimal 2-periodic sphere packings","cited_arxiv_id":"1704.08156","evidence_quote":"Classifies dense 2-periodic packings and independently discovered the Q5 uniform packing; used to identify the Q5 packing as 2-periodic."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Constructs the original 306-point nine-dimensional kissing configuration whose layer is modified."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Classifies binary constant-weight codes and supplies the uniqueness of the code underlying the nine-dimensional construction."},{"cited_title":"Rigidity of spherical codes","cited_arxiv_id":"1102.5060","evidence_quote":"Records that the 306-point configuration was the only known nine-dimensional kissing configuration, the claim this paper revises."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the six-dimensional kissing configurations built from L5, which the paper contrasts with the failed Q5 and R5 extensions."}],"review_version":1}