{"id":"c742fbed-cdfe-4a0d-beb2-28be869c61f6","arxiv_id":"2608.04730","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For k-bonding, the scaled empirical distribution of expected gaps converges weakly to the Rényi parking gap distribution, and two mixed k1,k2-bonding models have explicit limiting bonding densities.","lead":"This paper derives explicit formulas for the limiting density of bonded molecules in one-dimensional random sequential adsorption, both for single-size and mixed two-size bonding, and proves that gap statistics in the discrete model converge to the continuous Rényi parking gap distribution. Mathematicians and physical chemists studying adsorption and parking processes should read it for the new asymptotic limits and the discrete-continuum connection.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 7 relies on the unproved asymptotic lemma (6.11), whose continuity hypothesis excludes the singular h(s)=s^(-k1/2) used in the proof; until the lemma is proved in the needed form, the limit (1.17) is not fully justified.","rationale":"The reader's weakest-assumption pick is exactly right: (6.11) is the only place where a nontrivial asymptotic is asserted without proof, and it carries the evaluation of IV_k2 in Theorem 7. The paper's numerical tables and the structure of Theorems 5 through 9 are otherwise internally consistent, and the weak-convergence argument in Theorem 3 is a routine dominated-convergence application modulo Theorem 2. The unproved lemma is likely true in a wider form, so the concern does not amount to a demonstrated error; it is a proof gap that justifies the CONDITIONAL verdict. I would not change the reader's recommendation: the authors should supply a proof of (6.11) with hypotheses covering the singular h used, and a uniform-error justification for the replacement of M(j) by j m_k1.","tokens_in":22961,"tokens_out":20083,"duration_ms":199961,"concrete_test":"Independently re-derive (6.11) as a rigorous Laplace expansion for h(s)=s^(-alpha) phi(s) with phi continuous on [0,1] and phi(1)>0, and then verify that replacing M^(j)_k1 by j m_k1 in III_k2 and IV_k2 leaves an error that is o(1) after integration; if the lemma cannot be extended to this singular h, or if the replacement error contributes a nonzero constant to the limit (1.17), the proof of Theorem 7 must be revised.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central new asymptotic result for Model II, Theorem 7, is proved by splitting (1.13) into four parts and using the asymptotic lemma (6.11) to pass from finite-k2 sums over M^(j)_k1 to their leading behavior. The lemma is stated without proof (\"it is easy to see\") and its hypotheses require h continuous on [0,1] with h(1)>0. In the actual applications, the natural h is h(s)=s^(-k1/2) exp(sum_{j=1}^{k1-1}(s^j-1)/j), which is unbounded at s=0 and also depends on k2. The lemma is a standard Watson/Laplace expansion, so a statement covering functions with polynomial singularities at 0 is plausibly true, but it is not what is written. Moreover, applying the lemma to justify replacing M^(j)_k1 by j m_k1 inside the double sums defining III_k2 and IV_k2 requires uniform (in n) error estimates; the paper gives no such estimates. Consequently the derivation of (6.12)-(6.13), and hence of the constant D+(1-D)m_k1 in (1.17), is not a complete proof as it stands. This is a fillable gap, not an identified numerical error.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies one-dimensional random sequential adsorption (RSA) in a discrete setting. For k-bonding on a row of n molecules, it analyzes the expected densities g_{k;l} of gaps of sizes l=0,...,k-1 and shows that, after scaling the k-grid, the empirical measure of expected gap densities converges weakly as k→∞ to the gap distribution of the continuous Rényi parking problem (Theorem 3). The paper then introduces two mixed models in which both k1-bonding and k2-bonding occur. For Model I (sequential k2 then k1 bonding) and Model II (competitive k1/k2 bonding followed by k1 bonding), it derives explicit integral formulas for the limiting expected bonding densities (Theorems 4 and 5) and evaluates limits as k2→∞ with k1 fixed (Theorems 6 and 7) and as k1→∞ with k2≈Lk1 (Theorems 8 and 9). The new asymptotics for Model II involve a constant D≈0.4166 that is independent of k1. The proofs use generating functions, linear ODEs, and Laplace/Watson-type asymptotic expansions.","tokens_in":23174,"tokens_out":7500,"duration_ms":80458,"significance":"If the proofs are completed, the paper makes two substantial contributions. First, Theorem 3 establishes a discrete-to-continuum convergence of expected gap distributions to the Rényi parking gap law, complementing Bánkövi's continuum result with a rigorous lattice analogue. Second, Theorems 5–9 provide explicit formulas for mixed RSA models, including a striking new constant D≈0.4166 that quantifies how small k1-bonds suppress k2-bonding in the competitive model. The derivations are largely formula-driven and parameter-free, and the paper contains no circularity: constants such as m∞ and D are computed from integrals, not fitted. However, the proof of Theorem 7 relies on an unproved asymptotic lemma and on a non-uniform replacement of M^{(j)}_{k1} by its limit, and the existence of the limits underlying several theorems is delegated to the author's book [13] without a self-contained argument. These gaps are fillable but currently leave the central Model II asymptotics not fully justified.","major_comments":[{"comment":"The asymptotic lemma (6.11) is stated with no proof ('it is easy to see') and its hypotheses require h continuous on [0,1] with h(1)>0. In the proof of Theorem 7 the lemma is applied to h(s)=s^{-k1/2} exp(sum_{j=1}^{k1-1}(s^j-1)/j), which is unbounded at s=0 and therefore not continuous on [0,1]. The lemma is plausibly true for such singular h under a standard Watson/Laplace expansion, but that extension is neither stated nor proved. Please provide a proof of (6.11) in the needed generality, or give a direct asymptotic treatment of the actual integrand in IV_{k2}.","section":"Section 6, Eq. (6.11)"},{"comment":"The replacement of M^{(j)}_{k1} by j m_{k1} inside the double sums defining III_{k2} and IV_{k2} is asserted to follow from (1.1), but (1.1) is a pointwise limit as j→∞. For n near k2, the inner sums contain only finitely many terms with j of order k1, where the approximation M^{(j)}_{k1}≈j m_{k1} is not valid, and no uniform error estimates are supplied. The statement in (6.8) that the approximation holds 'uniformly over n' needs a quantitative justification showing that the contribution of the small-j terms vanishes after integration against the s^{b k2} weight.","section":"Section 6, passage from (1.13) to (6.12)–(6.13)"},{"comment":"The existence of the limit lim_{n→∞} G^{(n)}_{k;l}/n is delegated to 'almost exactly the same' as Proposition 3.3 in [13] without reproducing the argument or even stating the proposition. The same 'similar to the proof of Theorem 2' step is used in (4.16) to pass from the generating function to the limit defining m_{k1,k2;II}. Since Theorems 3–9 all depend on these limit statements, please make the existence argument self-contained (or state the referenced result precisely and verify it applies) so that the integral formulas in Theorems 2 and 5 are not conditional on an omitted proof.","section":"Section 2 and Section 4, proof of Theorem 2 and derivation of (4.16)"}],"minor_comments":[{"comment":"The phrase 'The second part of the this paper' should be 'The second part of this paper'.","section":"Abstract"},{"comment":"The title has a typo: 'A NEW LOOK A T SOME ASPECTS' should read 'A NEW LOOK AT SOME ASPECTS'.","section":"Title page"},{"comment":"In the sentence 'with boundary condition M^{(n)}_k = 0' there is a stray subscript: it reads 'M^{(n)}_{k;l}' but should be 'M^{(n)}_k'.","section":"Section 2, after Eq. (2.10)"},{"comment":"The phrase 'where B1, Bs are as in (4.12)' should read 'where B1, B2 are as in (4.12)'.","section":"Section 4, after Eq. (4.16)"},{"comment":"The text says 'In Model 1', which should be 'In Model I' for consistency with the notation in (1.10).","section":"Proof of Theorem 4"},{"comment":"The parameter D in the lemma conflicts with the constant D introduced in (1.18); renaming the lemma parameter, e.g., to α, would avoid confusion.","section":"Eq. (6.11)"}],"recommendation":"major_revision","confidential_remarks":"The paper is within scope and the main ideas appear sound. The most serious issue is the proof of Theorem 7, which rests on an unproved lemma whose stated hypotheses exclude the actual choice of h, and on an unjustified uniform replacement of M^{(j)}_{k1}. These are fillable gaps rather than identified numerical errors. I recommend major revision rather than rejection."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Ross Pinsky has written a careful paper that extends the one-dimensional RSA story in two directions. The first is Theorem 3: the empirical distribution of expected gap sizes in the discrete k-bonding problem, scaled by k, converges to the known gap distribution in Rényi's parking problem. The proof is a straightforward dominated-convergence argument once you write the generating function the right way, and it works. The second direction is the mixed k1,k2-bonding models. Theorem 5's explicit integral formulas are genuinely new, and the asymptotic results in Theorems 6-9, particularly the constant D ≈ 0.4166 for Model II, are interesting. I spot-checked some of the algebra in Theorems 5, 8, and 9 and the tables; they are consistent.\n\nThe main soft spot is exactly the one flagged in the stress-test: the proof of Theorem 7 rests on the asymptotic lemma (6.11), which is stated without proof and with a continuity hypothesis that does not cover the h(s) = s^{-k1/2} exp(...) actually used in the application. This is a standard Watson/Laplace lemma, and extending it to polynomial singularities at 0 is routine, so the gap is fillable, not a numerical error. But as written, the derivation of (1.17) is not complete. The paper also needs uniform error estimates for replacing M^{(j)}_{k1} by j m_{k1} inside the double sums in (6.12)-(6.13); the estimates are plausible, but they are not in the text. One smaller delegation: the proof of Theorem 2 refers to the author's book [13] for the existence of the limit. That is acceptable, but it is a dependency.\n\nThe citation pattern is honest; the paper credits Flory, Page, Rényi, and Klaassen-Runnenburg properly, and the author's own book is the right source for Theorem 1. There is no fitting or circular reasoning; the limits are derived from the definitions.\n\nWho should read this? Anyone working on parking problems, discrete RSA, or the connection between lattice and continuum packing. It is not a world-shaking result, but it closes a natural gap and supplies formulas that were missing. It deserves a serious referee, not a desk reject. The referee should ask for a proof or precise statement of the asymptotic lemma, and then the paper should be publishable.","headline":"Solid RSA paper with a clean gap-convergence theorem and a fillable but real gap in the proof of Theorem 7's asymptotic for Model II.","tokens_in":23745,"tokens_out":10790,"would_cite":true,"duration_ms":101006,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60C05","60F05","60F99","82B20"],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that, as k grows, the scaled expected gaps of the discrete k-bonding process converge to the gap distribution of the continuum parking problem, and it derives explicit density limits for two mixed k1,k2-bonding models…","keywords":["random sequential adsorption","discrete packing","parking problem","vacancies on a line","packing problem","gap distribution","limit theorems","mixed-size bonding"],"falsifier":"Numerically evaluate the left side of (6.11) for a smooth $h$ with $h(1)>0$, say $h\\equiv 1$, $b=1$, $D=1$, for $C=1,2,3$ and $k_2=10^3,10^4$: the observed growth rates should match the claimed threshold $C=D+1=2$ exactly. Independently, simulate Model II on large $n$ with $k_1$ fixed, say 2, and $k_2=500$, and measure the fraction of bonded molecules when no $k_2$-blocks remain; it should approach $D\\approx 0.4166$, not $m_\\infty\\approx 0.7476$. A systematic deviation would falsify Theorem 7.","tokens_in":22686,"feed_emoji":"🧩","tokens_out":10309,"duration_ms":107269,"temperature":0.7,"pith_summary":"Consider a row of n molecules and repeatedly pick, uniformly at random, a nearest-neighbor block of k consecutive molecules and bond them, stopping when no unbonded k-blocks remain. This paper studies two aspects of that process: the gaps of 0,1,…,k−1 unbonded molecules left between bonded k-blocks, and the expected density of bonded molecules when two block sizes k1<k2 bond either sequentially or competitively. It proves that after scaling the lattice by k, the empirical distribution of expected gap densities converges weakly as k→∞ to the known gap distribution of the continuous parking analogue. It also obtains explicit integral formulas and limits for the mixed models: when k2→∞ with k1 fixed, the sequential model has limiting density $m_\\infty+(1-m_\\infty)m_{k_1}$, while the competitive model has stage-one density $D\\approx 0.4166$ independent of k1, and final density $D+(1-D)m_{k_1}$. These results give a quantitative bridge between a discrete lattice adsorption process and its continuum limit, and yield computable asymptotics for two-species random sequential adsorption.","feed_headline":"Discrete bonding gaps converge to the continuum parking gap law","feed_subtitle":"New formulas pin down two mixed two-size bonding models, whose large-block density limit is about 0.4166","key_machinery":"The workhorse is the generating function for expected counts. For fixed k and l, the expected number $G^{(n)}_{k;l}$ of l-gaps satisfies a linear recursion, and multiplying the recursion by $(n-k+1)t^n$ and summing over n turns it into a first-order linear ordinary differential equation for the generating function $g_{k;l}(t)=\\sum_n G^{(n)}_{k;l}t^n$. Solving that ODE and letting $t\\to 1^-$ yields the integral formula (1.3) for the limiting gap density $g_{k;l}$. Theorem 3 then follows by substituting $x=k(1-s)$ and applying dominated convergence, with the discrete sums collapsing to the continuum exponentials $\\exp(-2\\int_0^x (1-e^{-y})/y\\,dy)$. The mixed-bonding results use the same machinery on a two-size recursion, producing an ODE with coefficient $A(t)=\\frac{k_1+k_2-2}{2t}+\\frac{t^{k_1-1}+t^{k_2-1}}{1-t}$. The asymptotic limits as $k_2\\to\\infty$ are extracted from integrals of the form $\\int_0^1 \\exp(\\sum_{j=1}^{k_2-1}(s^j-1)/j)(1-s)^D s^{b k_2}h(s)\\,ds$, whose threshold behavior is controlled by the lemma stated in (6.11), which localizes the contribution near $s=1$ at the scale $x=k_2(1-s)$.","core_discovery":"The central discovery is a law-of-large-numbers bridge from the discrete to the continuum. For k-bonding, Theorem 3 shows that the probability measure $\\mu^{\\mathrm{gaps}}_k$ on $[0,1]$, obtained by rescaling the expected gap counts by $k/m_k$, converges weakly to $\\mu^{\\mathrm{gaps}}_\\infty$ with density $f(\\gamma)=\\frac{2}{m_\\infty}\\int_0^\\infty x e^{-\\gamma x}\\exp(-2\\int_0^x \\frac{1-e^{-y}}{y}\\,dy)\\,dx$; this is exactly the gap distribution derived for the continuum parking process, so the discrete lattice gaps reproduce, in the $k\\to\\infty$ limit, the continuum gap law. The second contribution is a pair of explicit two-stage models with block sizes $k_1<k_2$. In Model I (k2-bonding to completion, then k1-bonding on the gaps) Theorem 4 gives $m_{k_1,k_2;\\mathrm{I}}=m_{k_2}+\\sum_{l=k_1}^{k_2-1} g_{k_2;l}M^{(l)}_{k_1}$, and Theorem 6 gives $\\lim_{k_2\\to\\infty} m_{k_1,k_2;\\mathrm{I}}=m_\\infty+(1-m_\\infty)m_{k_1}$. In Model II (k1- and k2-bonding chosen uniformly at random until no k2-blocks remain, then k1-bonding) Theorem 5 gives explicit integrals for the stage-one density and the final density, and Theorem 7 shows $\\lim_{k_2\\to\\infty} m_{k_1,k_2;\\mathrm{II}_1}=D\\approx 0.4166$, independent of k1, while $\\lim_{k_2\\to\\infty} m_{k_1,k_2;\\mathrm{II}}=D+(1-D)m_{k_1}$. Theorems 8 and 9 provide further integral limits when $k_1\\to\\infty$ with $k_2=[Lk_1]$, $L\\in(1,2]$.","pith_inferences":["The independence of $D$ from $k_1$ suggests a robust continuum phenomenon: in a two-species parking process where infinitesimally small dust particles compete with unit cars, the fraction of space occupied when no more cars fit might be a universal constant $D\\approx 0.4166$, irrespective of the dust size; one could test this by continuous-space simulation with two particle sizes.","The unproved threshold lemma (6.11) is a one-dimensional Laplace/Abelian estimate; supplying a proof would close the only gap in Theorem 7, and a failure for some continuous $h$ would likely show up as a wrong prefactor in $D+(1-D)m_{k_1}$.","The decomposition pattern $m_\\infty+(1-m_\\infty)m$ and $D+(1-D)m$ looks like a general fill-the-gaps principle for one-dimensional random sequential adsorption: if the first phase leaves residual gaps whose local density vanishes in the relevant limit, the second phase simply multiplies the empty fraction by its own limiting density. In higher dimensions, gap geometry is not intervals, so the prin"],"forward_implications":["For large k, the rescaled gaps in k-bonding follow the continuum parking gap law: the average gap size tends to $(1-m_\\infty)/m_\\infty\\approx 0.3376$, just over one-third of the maximum gap size $k-1$.","For the sequential $k_2$-then-$k_1$ model, the limiting density as $k_2\\to\\infty$ is $m_\\infty+(1-m_\\infty)m_{k_1}$, so a short-bonding pass on the leftover gaps recovers a fraction $m_{k_1}$ of the previously empty space.","For the competitive model, the density when $k_2$-blocks disappear is $D\\approx 0.4166$ for every fixed $k_1$, and the final density after $k_1$-bonding is $D+(1-D)m_{k_1}$; competition between the two sizes cuts the first-stage occupation nearly in half compared with $m_\\infty\\approx 0.7476$.","When $k_1\\to\\infty$ with $k_2\\sim Lk_1$ for $L\\in(1,2]$, both mixed models have explicit continuum-integral limits given by (1.19) and (1.20), and both reduce to $m_\\infty$ when $L=1$.","The paper's tables show the ordering $m_{k_1,k_2;\\mathrm{I}} \\ge m_{k_1,k_2;\\mathrm{II}} \\ge m_{k_1}$, so sequential two-size bonding packs more densely than competitive two-size bonding, which in turn beats pure $k_1$-bonding."],"supporting_citations":[{"why":"Provides the integral formula (1.1) for the expected density $m_k$ and the generating-function method on which this paper's proofs are modeled.","marker":"[13]"},{"why":"Proved the gap-density formula (1.3) and a central limit theorem for gap counts; Theorem 2 here is an alternative proof of (1.3), and Theorem 3 starts from it.","marker":"[10]"},{"why":"Introduced the continuum parking problem and proved that its limiting density is $m_\\infty\\approx 0.7476$; this is the constant all the $k\\to\\infty$ limits here are compared with.","marker":"[14]"},{"why":"Supplied the proof of (1.2), the convergence of $m_k$ to $m_\\infty$; variants of this substitution-and-dominated-convergence argument are reused throughout the paper.","marker":"[2]"},{"why":"Derived the gap distribution for the continuum parking problem, which is the exact measure that Theorem 3 identifies as the weak limit.","marker":"[1]"},{"why":"Contains an earlier similar proof of (1.2) found in the paper's literature search; it corroborates the identity used as the continuum starting point.","marker":"[4]"}],"fun_headline_variants":["Discrete k-bonding gaps converge to continuum parking gap law","Mixed two-size bonding densities solved: limit 0.4166","Lattice gaps reproduce continuum parking gap density","Two-size bonding model yields density limit 0.4166","Discrete gaps match Renyi parking law in continuum limit"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The main limit for the competitive model depends on an asymptotic estimate, equation (6.11), that the paper states without proof; the estimate dictates exactly how the $k_2$-power threshold of a certain integral behaves, and if that threshold is wrong the constant 0.4166 and the formula $D+(1-D)m_{k_1}$ would not follow.","fun_headline_variants_meta":{"raw":{"variants":["Discrete k-bonding gaps converge to continuum parking gap law","Mixed two-size bonding densities solved: limit 0.4166","Lattice gaps reproduce continuum parking gap density","Two-size bonding model yields density limit 0.4166","Discrete gaps match Renyi parking law in continuum limit"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000696,"raw_usage":{"total_tokens":3364,"prompt_tokens":1380,"completion_tokens":1984,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":996,"completion_tokens_details":{"reasoning_tokens":1902}},"tokens_in":996,"tokens_out":1984,"duration_ms":16324,"temperature":1.0,"reasoning_tokens":1902,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T17:54:20.134985+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Numerically evaluate the left side of (6.11) for a smooth $h$ with $h(1)>0$, say $h\\equiv 1$, $b=1$, $D=1$, for $C=1,2,3$ and $k_2=10^3,10^4$: the observed growth rates should match the claimed threshold $C=D+1=2$ exactly. Independently, simulate Model II on large $n$ with $k_1$ fixed, say 2, and $k_2=500$, and measure the fraction of bonded molecules when no $k_2$-blocks remain; it should approach $D\\approx 0.4166$, not $m_\\infty\\approx 0.7476$. A systematic deviation would falsify Theorem 7.","supporting_citations":[{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Provides the integral formula (1.1) for the expected density $m_k$ and the generating-function method on which this paper's proofs are modeled."},{"cited_title":"and Runnenburg, J.T., Discrete spacings, Stat","cited_arxiv_id":null,"evidence_quote":"Proved the gap-density formula (1.3) and a central limit theorem for gap counts; Theorem 2 here is an alternative proof of (1.3), and Theorem 3 starts from it."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Introduced the continuum parking problem and proved that its limiting density is $m_\\infty\\approx 0.7476$; this is the constant all the $k\\to\\infty$ limits here are compared with."},{"cited_title":"private communication (2015)","cited_arxiv_id":null,"evidence_quote":"Supplied the proof of (1.2), the convergence of $m_k$ to $m_\\infty$; variants of this substitution-and-dominated-convergence argument are reused throughout the paper."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Derived the gap distribution for the continuum parking problem, which is the exact measure that Theorem 3 identifies as the weak limit."},{"cited_title":"and ˘Zubrini´ c, J.,Complexity function of jammed configurations of Rydberg atoms , Ars Math","cited_arxiv_id":null,"evidence_quote":"Contains an earlier similar proof of (1.2) found in the paper's literature search; it corroborates the identity used as the continuum starting point."}],"review_version":1}