{"id":"824f2d2f-8297-49a8-bced-9b3302a565a7","arxiv_id":"2509.03697","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"The paper proves that criticality of the 1D dissipative abelian sandpile with arbitrary traps is equivalent to divergence of an explicit recursive sequence, giving a three-regime classification with thresholds at ((3+√5)/2)^k and a^{2^k}.","lead":"This paper classifies when a one-dimensional random walk with soft traps has finite or infinite expected survival time, which pins down critical versus non-critical behavior for the dissipative abelian sandpile. It finds three growth regimes for trap spacing, with a sharp threshold at the square of the golden ratio, and shows that spreading traps farther apart can turn infinite survival time into finite survival time.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Theorem 2.10's proof is internally inconsistent: the ratio test (23) and the function f_k in (24) are misdefined, so the non-critical ratio criterion is unproven as written.","rationale":"The central recursive criterion in Theorem 2.6 is derived from a sound finite-difference calculation, and the half-line reduction in Theorem 4.4 has a missing +1 in formula (9) that changes the exact value of E0[T] but not the finiteness equivalence, so those are not the most dangerous obstacles. The most load-bearing gap is Theorem 2.10, because it supplies the advertised practical threshold: if limsup xn+1/xn^2 < 1 then the system is non-critical. Its proof as printed is internally inconsistent: the ratio test statement (23) does not match the series, and the function f_k in (24) has the bracketed factor in the wrong place, making the claimed value f_k(x_k+1)≤9/10 false for the displayed formula. The surrounding argument strongly suggests the intended reciprocal function and index shift, but the written proof does not establish the theorem. Since this is a concrete proof gap rather than a refutation, and since Theorem 2.6 plus independent checks likely support the classification, the reader's CONDITIONAL verdict remains appropriate; no change in verdict is needed.","tokens_in":16209,"tokens_out":28054,"duration_ms":246756,"concrete_test":"Re-run the ratio-test proof of Theorem 2.10 with the correct ratio r_k = x_{k+2}/x_{k+1} / [1+x_{k+1}(1-x_{k+1}/x_{k+2})] and with F_k(x)=x/[x_k(1+x_k(1-x_k/x))] in place of (24). Verify whether limsup x_{n+1}/x_n^2 < 1 implies limsup r_k < 1; if yes, the theorem is fixable as a typographical/index error, and if not, the stated non-critical criterion fails and needs a counterexample.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The paper's practical criterion for non-criticality rests on Theorem 2.10, whose proof in §5.4 contains two mutually reinforcing algebraic errors. First, the d'Alembert ratio test applied to the series Σ x_{k+1} ∏_{r=1}^k [1+x_r(1-x_r/x_{r+1})]^{-1} has ratio x_{k+2}/x_{k+1} divided by [1+x_{k+1}(1-x_{k+1}/x_{k+2})], not the expression in (23), which has the bracket in the numerator and shifts the index by one. Second, the function f_k in (24) is displayed as f_k(x)=x/x_k (1+x_k(1-x_k/x)); for x=x_k+1 this evaluates to 2+1/x_k, contradicting the claimed bound f_k(x_k+1)≤9/10. The displayed bound is instead correct for the reciprocal function F_k(x)=x/[x_k(1+x_k(1-x_k/x))], whose derivative analysis matches the subsequent monotonicity discussion. Thus the printed argument does not establish convergence of the bounding series, and the non-critical direction of the ratio criterion is unsupported unless the proof is repaired. This is load-bearing because the three-regime classification advertises xn+1/xn^2 as the practical threshold criterion, and Theorem 2.10 is the half of that criterion that asserts non-criticality below 1. The underlying statement is likely salvageable, but the proof as written is internally inconsistent.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the dissipative Abelian sandpile model on Z with trap sites at arbitrary locations (x_k), equivalently a nearest-neighbor random walk on Z that is absorbed at rate 1/3 when at a trap and at an additional sink. The main result is a three-regime classification of criticality (infinite expected avalanche size / infinite expected absorption time). The paper proves that criticality of the full system is equivalent to criticality of the two half-line walks, and for a half-line with traps x_1<x_2<... it introduces explicit sequences p_n, q_n defined by (2), showing the model is critical iff q_n/p_n -> infinity. It then derives: non-criticality for x_k = O(rho^k) with rho < phi = (3+sqrt(5))/2; existence of critical sequences below every rho^k for rho > phi; and practical ratio criteria limsup x_{n+1}/x_n^2 < 1 implies non-critical, liminf > 1 implies critical, with a double-exponential boundary. The proofs are based on solving the linear system for expected hitting times on finite intervals, representing q_n/p_n as a barycenter, and bounding the barycentric weights.","tokens_in":16577,"tokens_out":12154,"duration_ms":88540,"significance":"If the results are correct, this gives a complete classification of criticality for the one-dimensional dissipative sandpile with arbitrary trap positions, going beyond the symmetric recursive case studied in [6] and identifying sharp thresholds. The paper's method is transparent and self-contained: the recursive sequences are derived from first principles, no parameters are fitted, and the examples recover [6] as a special case. The counterintuitive non-monotonicity (Theorem 2.8 and Section 2.2) is a genuine contribution. However, two central proof steps in the non-critical criterion (Theorem 2.10) contain algebraic errors that must be repaired before the classification is fully established; the half-line reduction also has a small error in the displayed excursion-length formula. The overall framework is convincing and the statements are likely true, but the printed proofs do not currently support every claim.","major_comments":[{"comment":"The d'Alembert ratio test is applied to the series with terms a_k = x_{k+1} * product_{r=1}^k [1+x_r(1-x_r/x_{r+1})]^{-1}; the actual ratio is a_{k+1}/a_k = (x_{k+2}/x_{k+1}) / [1+x_{k+1}(1-x_{k+1}/x_{k+2})]. Condition (23) states limsup (x_{k+1}/x_k)(1+x_k(1-x_k/x_{k+1})) < 1, which is neither the correct ratio nor its reciprocal under the stated indexing. The convergence of the bounding series is therefore not established by the argument given. Since this is the only proof of the non-critical direction of the ratio criterion, this is a load-bearing gap.","section":"Section 5.4, Theorem 2.10"},{"comment":"The function f_k(x) = (x/x_k)(1+x_k(1-x_k/x)) is linear with positive slope (1+x_k)/x_k, so it cannot be decreasing on (x_k+1, 2x_k^2/(x_k+1)) as claimed, and its value at x_k+1 is 2+1/x_k, not (x_k+1)^2/(x_k(2x_k+1)) <= 9/10. The stated bound and monotonicity are correct for the reciprocal function F_k(x) = x / [x_k(1+x_k(1-x_k/x))]. The definition of x_+(k,alpha) as the larger root of f_k(x)=alpha is therefore attached to the wrong function, and the derivation of limsup f_k(x_{k+1}) < 1 does not imply the desired ratio-test bound.","section":"Section 5.4, Eq. (24)"},{"comment":"The formula for E[L_1] omits the +1 contributed by the first step from 0 to +/-1 in each non-absorbed excursion; it should read E[L_1] = 1 + (1-p)/2 E_1[tau] + (1-p)/2 E_{-1}[tau] (or equivalently p*1 + (1-p)/2 (1+E_1[tau]) + (1-p)/2 (1+E_{-1}[tau])). The displayed equality (9) is therefore not exact, although the finiteness equivalence survives because the omitted constant is finite. Please correct the displayed formula.","section":"Section 4.2, Theorem 4.4, Eq. (9)"}],"minor_comments":[{"comment":"The sentence 'the system is critical if and only if lim_{N->infty} A(N) < infinity' should read '= infinity', since A(N) is the expected stopping time of the truncated walk and increases with N.","section":"Section 5.1"},{"comment":"The display 'the recurrence relation on |I_k| |I_{k+1}| = c|I_k|^2' is missing a colon; also the c=1 boundary case, which is covered by Example 2.17 with epsilon_k=0, should be made explicit.","section":"Remark 2.18"},{"comment":"The symbol 'J-n,nK' is nonstandard; consider replacing with { -n, ..., n } or [-n,n] intersect Z.","section":"Notation"},{"comment":"The sequence y_k is initially described as any increasing sequence with k phi^k = o(y_k); it is then written as lambda_k k phi^k with lambda_k -> infinity. This equivalence should be stated explicitly.","section":"Theorem 2.8 proof"},{"comment":"There are a few grammatical errors (e.g., 'by a homothety' in Section 2.2 and 'the recursion' in Remark 2.18) that should be corrected.","section":"Section 2.2 and Remark 2.18"}],"recommendation":"major_revision","confidential_remarks":"The paper is largely sound in its recursive framework, and the classification statements appear correct, but the two algebraic errors in Section 5.4 and the slip in Section 4.2 are real. I recommend major revision rather than rejection, because the errors are localized and fixable: Theorem 2.10 can be repaired by computing the ratio test with the correct function and checking limsup x_{n+1}/x_n^2 < 1. The author should be asked to rewrite the proof of Theorem 2.10 cleanly and to correct Eq. (9). The rest of the paper can stand."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Rezzouk's paper is a real step forward. It replaces the special symmetric quadratic-gap case handled in [6] with a complete three-regime picture for arbitrary trap positions, and gives an explicit recursive criterion (q_n/p_n → ∞) in Theorem 2.6. That criterion is new, and the way the paper derives it from the linear system for the expected stopping time is clean. The barycentric representation (14)-(15) and the bounds (20)-(22) are the right tools, and the recovery of [6] as a corollary checks out. No parameters are fitted; the paper is self-contained.\n\nThe soft spots are in the write-up of two proofs. The most serious is Theorem 2.10. The d'Alembert ratio test is applied to a series whose ratio is (x_{k+2}/x_{k+1}) · [1+x_{k+1}(1-x_{k+1}/x_{k+2})]^{-1}, but condition (23) has the bracket in the numerator and the indices shifted. The function f_k in (24) also is not the one that yields the claimed bound: f_k(x_k+1)=2+1/x_k, not ≤9/10. The bound is correct for the reciprocal function. So the non-critical direction of the ratio criterion is unsupported as written. The statement is very likely true—the ratio test can be repaired—but the printed proof is not.\n\nSecond, Theorem 4.4's displayed formula (9) omits the +1 for the first step from 0 to ±1 in non-absorbed excursions. The expected excursion length should have an extra 1-p in the numerator. The qualitative equivalence (finitude of E_0[T] iff both half-line expectations are finite) survives, but the exact formula as printed is wrong.\n\nThird, the constructive proof of Theorem 2.8 does not explicitly verify that the recursively built sequence never exceeds the prescribed y_k before the jump steps. This is likely a minor omission, but it needs a sentence or two.\n\nThe rest of the analysis, including the geometric-threshold proof in Section 5.3, is plausible and the examples are consistent. I would send this to a competent referee: the core results are worth publishing, but the paper needs a major revision to fix the Theorem 2.10 proof and equation (9). The author should also double-check the monotonicity statements in the proof of Theorem 2.7, which are a bit heuristic in places.\n\nWho is this for? Mathematicians working on sandpile models, random walks in random environments, and recurrence criteria. It deserves peer review, not desk rejection.","headline":"Genuinely new classification for 1D dissipative sandpile with arbitrary traps, but the proof of the practical non-criticality criterion (Thm 2.10) is internally inconsistent as printed and needs repair.","tokens_in":17115,"tokens_out":5432,"would_cite":true,"duration_ms":40830,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60K35","82C27","60G50"],"pacs":[],"model":"deepseek-v4-flash","headline":"A single recursive ratio decides whether a one-dimensional sandpile with traps is critical, splitting all trap configurations into three regimes.","keywords":["abelian sandpile","dissipative sandpile","trapped random walk","expected stopping time","criticality","phase transition","golden ratio"],"falsifier":"Compute the recursion and the expected absorption time for the explicit trap sequence $x_k=\\lfloor \\rho^k\\rfloor$ with a fixed $\\rho$ just below $(3+\\sqrt5)/2$; the paper predicts finite $E_0[T]$ for every such sequence, so a single $\\rho$ in that range with diverging expectation would disprove Theorem 2.7. A cheaper check is to evaluate displayed formula (9) for the half-line with one trap: as printed it omits the $+1$ for the first step and will not reproduce the true expectation.","tokens_in":15916,"feed_emoji":"🏖️","tokens_out":7733,"duration_ms":67905,"temperature":0.7,"pith_summary":"The paper asks when a walker on the integer line, with traps that absorb with probability 1/3, dies quickly enough for the equivalent dissipative abelian sandpile to be non-critical. It proves that this phase transition is governed by an explicit recursive sequence attached to the trap positions, and that the whole line can be analyzed through two half-line walks. The resulting classification has three regimes separated by the square of the golden ratio, $(3+\\sqrt5)/2$: trap sequences growing slower than that geometric rate are always non-critical, faster-growing sequences can be either critical or non-critical, and sequences growing faster than every double exponential $a^{2^k}$ are always critical. A striking consequence is that spacing traps farther apart can shorten the expected lifetime, reversing the naive monotonicity intuition.","feed_headline":"One recursive ratio decides criticality for one-dimensional sandpiles","feed_subtitle":"Trap positions split the model into stable, mixed, and always-critical regimes, with a golden-ratio threshold.","key_machinery":"The machine that carries the argument is the recursion of Theorem 2.6. Writing the finite-volume expected absorption time at trap $k$ as $E_k=p_k A-q_k$ and imposing the boundary condition $E_N=0$ gives $A(N)=q_N/p_N$, so the full expected absorption time is finite exactly when the increasing sequence $q_n/p_n$ has a finite limit. The proof then rewrites $q_n/p_n$ as $\\varepsilon_n+\\sum_k \\mu_k x_k$, a barycenter of trap positions with weights $\\mu_k$, and translates the recursion into the identity $R_{k-1}-R_k=\\sum_{j>k} x_k(1-x_k/x_j)(R_{j-1}-R_j)$ for the tail sums $R_k$. Bounding this renewal-type identity from below produces the characteristic polynomial $X^2-3X+1$, whose larger root is $(3+\\sqrt5)/2$, the geometric threshold; bounding it from above yields the ratio test $x_{n+1}/x_n^2$ that separates the intermediate regimes.","core_discovery":"The paper establishes that for a dissipative abelian sandpile on $\\mathbb{Z}$ with traps at arbitrary positions, the model is non-critical exactly when the expected absorption time of the associated trapped random walk is finite, and that this is decided by a single explicit recursion. For the ordered trap sequence $x_1<x_2<\\cdots$ on the positive half-line, define $p_1=x_1$, $q_1=x_1^2$, and for $n\\ge 2$, $p_n=x_n+\\sum_{i<n}(x_n-x_i)p_i$ and $q_n=x_n^2+\\sum_{i<n}(x_n-x_i)(q_i+1)$. Then $q_n/p_n$ is increasing, and the model is critical if and only if $q_n/p_n\\to\\infty$. Around this criterion the paper finds a sharp geometric threshold at the square of the golden ratio, $\\phi^2=(3+\\sqrt5)/2$: slower-than-$\\phi^2$ growth is always non-critical; faster growth admits both critical and non-critical configurations, with $x_{n+1}/x_n^2$ lying below or above $1$ as a practical discriminator; and any trap sequence that eventually exceeds $a^{2^k}$ for every $a>1$ is necessarily critical.","pith_inferences":["The boundary case $x_k\\sim \\phi^{2k}$ is left partly open; the ratio and series criteria together suggest that criticality there depends on subleading constants and logarithmic factors, which a direct computation of $q_n/p_n$ could settle.","The non-monotonicity under dilating trap spacing implies that criticality is controlled by trap geometry, not merely trap density, so any higher-dimensional analogue would need to track the arrangement of dissipative sites.","Remark 2.19 indicates the threshold should shift with the trap absorption probability $p$ through $\\alpha=2p/(1-p)$; extending the three-regime analysis to general $p$ is a concrete continuation of the same method."],"forward_implications":["If trap positions grow at most like $\\rho^k$ with $\\rho<(3+\\sqrt5)/2$, the model is non-critical: the expected absorption time stays finite.","If $\\limsup_{n\\to\\infty} x_{n+1}/x_n^2<1$, the model is non-critical; if $\\liminf_{n\\to\\infty} x_{n+1}/x_n^2>1$, the model is critical.","Any trap sequence that eventually has $x_k>a^{2^k}$ for every $a>1$ is critical.","Adding or removing finitely many traps, and in particular whether $0$ is a trap, does not change criticality.","In the symmetric case, the full system is critical exactly when its positive half-line process is critical."],"supporting_citations":[{"why":"Supplies the definition of non-criticality via finiteness of summed Green functions, the notion the paper classifies.","marker":"[5]"},{"why":"Provides the prior symmetric-trap analysis with recursive spacings $|I_{k+1}|=c|I_k|^2$; this paper recovers and extends its threshold.","marker":"[6]"},{"why":"Gives the Green's function identity linking expected avalanche size to random-walk visit counts, which drives the reduction to stopping time.","marker":"[4]"},{"why":"Establishes the abelian sandpile formalism that the dissipative model is built on.","marker":"[2]"},{"why":"Introduces self-organized criticality, the physical motivation for studying sandpile criticality.","marker":"[1]"}],"fun_headline_variants":["One recursion settles criticality of 1D sandpiles","Golden ratio squared gates sandpile criticality","Trapped walks decide if a sandpile is critical","In 1D, sandpile criticality obeys a simple test","Recursive criterion: when do 1D sandpiles turn critical?"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The entire classification rests on assuming that the walk from 0 breaks into independent excursions, each ending at 0 or at the sink, so that the total absorption time is a geometric sum of excursion lengths; if that decomposition failed for some trap arrangement, the half-line reduction (and hence the three-regime picture) would not follow.","fun_headline_variants_meta":{"raw":{"variants":["One recursion settles criticality of 1D sandpiles","Golden ratio squared gates sandpile criticality","Trapped walks decide if a sandpile is critical","In 1D, sandpile criticality obeys a simple test","Recursive criterion: when do 1D sandpiles turn critical?"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.00052,"raw_usage":{"total_tokens":2488,"prompt_tokens":885,"completion_tokens":1603,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":501,"completion_tokens_details":{"reasoning_tokens":1519}},"tokens_in":501,"tokens_out":1603,"duration_ms":12145,"temperature":1.0,"reasoning_tokens":1519,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-15T16:33:02.635278+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Compute the recursion and the expected absorption time for the explicit trap sequence $x_k=\\lfloor \\rho^k\\rfloor$ with a fixed $\\rho$ just below $(3+\\sqrt5)/2$; the paper predicts finite $E_0[T]$ for every such sequence, so a single $\\rho$ in that range with diverging expectation would disprove Theorem 2.7. A cheaper check is to evaluate displayed formula (9) for the half-line with one trap: as printed it omits the $+1$ for the first step and will not reproduce the true expectation.","supporting_citations":[{"cited_title":"Non-criticality criteria for Abelian sandpile models with sources and sinks","cited_arxiv_id":null,"evidence_quote":"Supplies the definition of non-criticality via finiteness of summed Green functions, the notion the paper classifies."},{"cited_title":"Random walks in a field of soft traps and criticality for the dissipative Abelian Sandpile Model","cited_arxiv_id":"2507.00562","evidence_quote":"Provides the prior symmetric-trap analysis with recursive spacings $|I_{k+1}|=c|I_k|^2$; this paper recovers and extends its threshold."},{"cited_title":"The Abelian sandpile and related models","cited_arxiv_id":null,"evidence_quote":"Establishes the abelian sandpile formalism that the dissipative model is built on."}],"review_version":2}