{"id":"818a5d6c-d731-4825-be97-f01f79e492e5","arxiv_id":"2507.00562","paper_version":2,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":6.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"For traps spaced by |I_{j+1}| = c |I_j|^2, the expected survival time is finite for c<1 and infinite for c>1, a sharp criticality threshold.","lead":"One-dimensional random walk with traps placed increasingly far apart stays alive forever on average if the gaps between traps grow by squaring times a constant above one, and dies in finite expected time if the constant is below one. The result pinpoints a sharp boundary for when adding sparse dissipation to a one-dimensional sandpile model destroys its critical behavior.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"Lemma 4.1's derivation of the left-move upper bound contains an algebraic error in Eq. (51); the final bound (24) survives a corrected computation, but the proof as written needs repair.","rationale":"The central result, Theorem 3.1, is a sharp phase transition at c = 1 for the expected survival time of a random walk in a super-exponentially spaced soft-trap landscape. The proof structure is sound: Lemma 4.1 compares arbitrary embedded-walk paths to the all-right path, Theorem 3.2 converts those bounds into finite/infinite expectation thresholds for a fixed first interval, and Theorem 3.3 upgrades the thresholds to c = 1 via tail equivalence. I checked the key recursions and the upper/lower bound factors numerically and analytically for small cases; the factors 2/c and 2/(c^2|I_1|^2) are correct, and the thresholds pinch to c = 1 as |I_1| → ∞. The most serious issue I found is an algebraic error in equation (51) of Lemma 4.1, in the s < i−2 case of the left-move bound. The displayed expression is missing a factor relative to the correct combination of (49) and (50), so the derivation of (52) as written is invalid. However, the corrected ratio is still bounded by the right-hand side of (52), so the lemma's conclusion (24) is true. This is a proof gap that must be fixed, but it does not overturn the central claim. The reader's conditional verdict is appropriate; no verdict change is needed. Other issues (the Section 5.1 range [1/2, 2/3] and the sign typo in Eq. (79)) are non-essential and do not affect Theorem 3.1.","tokens_in":25116,"tokens_out":59391,"duration_ms":541973,"concrete_test":"Independently recompute P(A_{κ_{s,-1}})/P(Aκ) directly from (49) and (50) for s < i−2, using the transition probabilities in (28). Verify that the ratio equals 2^{I(Θ=1)} |I_{f−2}||I_{f−1}|/|I_Θ|^2, and then check whether this is bounded by 2|I_{f−2}||I_{f−1}|/|I_1|^2. If the corrected ratio exceeds this bound, the upper bound (24) and Theorem 3.1 would be at risk; if it does not, as our calculation indicates, the fix is purely typographical and the central claim stands.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The proof of Lemma 4.1, which is the load-bearing step for Theorem 3.1, has an incorrect intermediate formula. In the derivation of the upper bound for replacing an entry by σ = −1, the text combines (49) and (50) into (51). For the case s < i−2, a direct computation gives P(A_{κ_{s,-1}})/P(Aκ) = 2^{I(Θ=1)} |I_{f−2}||I_{f−1}|/|I_Θ|^2, using that validity of κ_{s,-1} forces Θ ≥ 1. Equation (51) instead contains the extra factor (2/3)(1/(2|I_{Θ+1}|)) in the s < i−2 term, making the displayed expression too small by a factor that can be as large as O(|I_1|). Consequently, the displayed inequality (52) with the bracket value 2/3 for s < i−2 does not follow from (51) as written. Importantly, the corrected ratio is still at most 2|I_{f−2}||I_{f−1}|/|I_1|^2, so the final bound (52) and hence Lemma 4.1(24) remain valid; the error is in the proof's intermediate algebra, not in the stated bound. A referee should require the corrected calculation before accepting the manuscript.","agreement_with_reader":"partial"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies a reflected simple random walk on the nonnegative integers, killed with probability 1/3 at each trap site, with trap locations 0 = x0 < x1 < x2 < ... and interval lengths |I_j| = x_j - x_{j-1} obeying the recursion |I_{j+1}| = c |I_j|^2. The main result (Theorem 3.1) is that, for c > 1/|I1| and under the integrality restriction of Remark 3.1, the expected survival time is finite for c < 1 and infinite for c > 1. The proof passes through an embedded walk on traps and compares arbitrary embedded histories with the all-right history via Lemma 4.1, then establishes a tail-similarity statement (Theorem 3.3) that lets the first interval be shifted away. The paper also gives a counterexample to monotonicity of the expected survival time in interval lengths. Through the equivalence established in [6], the phase transition is interpreted as the threshold between non-critical and critical dissipative one-dimensional abelian sandpile behavior.","tokens_in":25347,"tokens_out":20838,"duration_ms":208463,"significance":"If the proof is repaired, the paper gives a sharp, parameter-free phase transition in this random-walk model: the upper and lower bounds in Section 4 pinch exactly at c = 1, with no fitting parameters. The explicit embedded-walk computation, the tail property that reduces the transition to the asymptotic growth of intervals, and the concrete non-monotonicity example are all valuable contributions. The sandpile conclusion is conditional on the external equivalence proved in [6], which is not re-proved here, but the random-walk theorem itself is self-contained and does not use sandpile criticality as an input. I found no circularity in the main derivation.","major_comments":[{"comment":"The displayed combination of (49) and (50) for the substitution sigma = -1 is algebraically incorrect in the case s < i - 2. Direct computation gives P(A_{kappa_{s,-1}})/P(A_kappa) = 2^{I(Theta=1)} |I_{f-2}| |I_{f-1}| / |I_Theta|^2, using that validity of kappa_{s,-1} forces Theta >= 1. Equation (51) instead contains the extra factor (2/3)(1/(2|I_{Theta+1}|)) in the s < i - 2 term, making the displayed expression too small by a factor that can be as large as O(|I_1|). As a consequence, the displayed inequality (52) with the bracket value 2/3 for s < i - 2 does not follow from (51) as written. The corrected ratio is still at most 2 |I_{f-2}| |I_{f-1}| / |I_1|^2, so the final bound (52) and hence Lemma 4.1(24) remain valid, but the proof as written needs a repaired calculation before the manuscript can be accepted.","section":"Section 4.1, Eq. (51)"}],"minor_comments":[{"comment":"The displayed algebra in (79) is incorrect: 3 - 2(1 - 1/|I1|)^2 = 1 + 4/|I1| - 2/|I1|^2, not 1 + 4/|I1| - 1/|I1|^2. The subsequent integer-gap argument is unaffected, but the equation should be corrected.","section":"Section 4.2.2, Eq. (79)"},{"comment":"The notation |I_i + I(i=0)| in the stay-at-the-same-trap transition probability is ambiguous. For i = 0 the intended expression appears to be 2/3 (1 - 1/|I1|); please rewrite this formula so that the i = 0 case is explicit.","section":"Section 2, Eq. (28)"},{"comment":"The wording 'increasing the size of a single interval' is imprecise: the comparison in Example 5.1 enlarges every interval by a factor of four. The rigorous single-interval counterexample is given in Section 5.1, so the earlier example should be described as a motivation rather than as a single-interval perturbation.","section":"Example 5.1"},{"comment":"The numerical bounds in (107)-(109) are stated for P_+ and P_- in [1/2, 2/3], while inequality (105) only proves the range [1/3, 2/3]. Please justify that a landscape can be chosen with P_+, P_- in [1/2, 2/3], or extend the numerical verification to the full range.","section":"Section 5.1, Eq. (107)-(109)"},{"comment":"There are several small presentation issues: a summation index typo in the definition of N in (5), the duplicated equations (42)/(44) and (43)/(45), and the misspelling 'don not' in Section 5. These should be cleaned up in revision.","section":"Throughout"}],"recommendation":"major_revision","confidential_remarks":"The only substantive defect I found is the algebraic error in Eq. (51) of Lemma 4.1. It is localized and fixable, and the final bounds of Lemma 4.1 survive the corrected computation, so rejection is not warranted. The sandpile interpretation rests on the equivalence in [6]; the authors should make clear that this paper's independent contribution is the random-walk theorem, with the sandpile conclusion inherited from that equivalence. I recommend major revision so that the corrected calculation can be checked."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Frank,\n\nMain headline: the c=1 threshold is new and the proof structure is right. For traps spaced by |I_{j+1}|=c|I_j|^2, expected survival time is finite for c<1 and infinite for c>1; via the equivalence in [6] this gives a sharp dissipation threshold in the 1D sandpile. The embedded-walk decomposition and the way the upper and lower bounds pinch after sending the first interval length to infinity are well done. The explicit formula for the all-right path, (26), is a nice piece of work.\n\nThe weak points are localized. Lemma 4.1 is load-bearing and its σ=-1 case has an algebraic error. In the derivation for s < i-2, equation (51) carries a spurious factor (2/3)(1/(2|I_{Θ+1}|)). The ratio should be 2^{I(Θ=1)} |I_{f-2}||I_{f-1}|/|I_Θ|^2. The final bound (52) still holds because the bracket is bounded by 2 either way, so Lemma 4.1(24) survives the corrected computation, but the proof as written needs a fix. A referee should require it.\n\nSection 5.1's non-monotonicity example claims the numerical inequalities are checked on [1/2,2/3] for P±, while (105) only gives [1/3,2/3]. I agree with the reader that the inequalities seem to hold on the larger interval, so this is a range typo, not a broken argument. Equation (79) also has a small algebra slip in the displayed equality; the conclusion is unaffected.\n\nThe sandpile interpretation is imported from [6] rather than re-proved. That is legitimate and clearly flagged, but it means the physical punchline inherits the assumptions of that earlier paper.\n\nOverall the core theorem is sound, the defects are repairable, and the result deserves a serious referee. I'd send it out.","headline":"Sharp c=1 threshold for super-exponentially spaced traps is a real advance; proof needs a fix in Lemma 4.1 but the bound survives.","tokens_in":25939,"tokens_out":6686,"would_cite":true,"duration_ms":52439,"reading_group":"yes","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["60G50","60J10"],"pacs":[],"model":"deepseek-v4-flash","headline":"A one-dimensional random walk among soft traps with spacings obeying $|I_{j+1}|=c|I_j|^2$ has finite expected lifetime for $c<1$ and infinite expected lifetime for $c>1$, placing the phase transition at $c=1$ in this trap landscape.","keywords":["random walk","soft traps","expected survival time","dissipative abelian sandpile","criticality transition","super-exponential trap spacings","embedded random walk","tail invariance"],"falsifier":"Evaluate $E(\\tau)$ numerically for the recursion with $|I_1|=3$ on truncated systems at $c=0.9$ and $c=1.1$: if the mean survival time does not stay bounded at $c=0.9$, or does not grow without bound at $c=1.1$ as the truncation is removed, the phase boundary is not at $c=1$.","tokens_in":24868,"feed_emoji":"🪤","tokens_out":7929,"duration_ms":76168,"temperature":0.7,"pith_summary":"The paper studies a simple random walk on the nonnegative integers, reflected at 0, with soft traps at sites $x_0=0<x_1<\\cdots$; each hit kills the walker with probability $1/3$, independently. When the interval lengths between successive traps grow according to $|I_{j+1}| = c|I_j|^2$, the expected survival time is proved finite for $c<1$ and infinite for $c>1$, provided $c>|I_1|^{-1}$. Because finite expected avalanche size in the dissipative abelian sandpile is equivalent to finite expected survival time of the associated trapped walk, this sharp transition at $c=1$ is claimed to say exactly how much dissipation a one-dimensional sandpile can absorb before losing criticality. The paper also proves that finiteness of the expected survival time depends only on the tail of the trap configuration, and gives an explicit example where enlarging every interval turns a critical landscape into a non-critical one.","feed_headline":"Mean walk lifetime flips at trap-spacing constant c=1","feed_subtitle":"It fixes how much dissipation a one-dimensional sandpile can absorb before losing criticality.","key_machinery":"The argument runs through the embedded random walk $\\xi_n$, the walk's sequence of visits to trap locations. For any prescribed itinerary of right moves, stays, and left moves between traps, Lemma 4.1 bounds the product of path probability times expected inter-arrival time against the all-right itinerary, with factors $2/c$ per stay and $2/(c^2|I_1|^2)$ per left move, plus matching lower bounds for nonnegative itineraries. The recurrence $|I_{j+1}|=c|I_j|^2$ makes these factors telescope, yielding an explicit formula for the all-right contribution, and Theorem 3.3 (finiteness depends only on the tail) lets the proof replace the initial interval by an arbitrarily distant one.","core_discovery":"The central claim is a sharp phase transition in the expected lifetime of the walk. For traps placed so that $|I_{j+1}|=c|I_j|^2$ with $c>|I_1|^{-1}$, Theorem 3.1 states that $E(\\tau)<\\infty$ when $c<1$ and $E(\\tau)=\\infty$ when $c>1$. The proof obtains upper and lower bounds on $E(\\tau)$ that approach each other as the first interval length $|I_1|$ grows, then uses a tail-invariance result to push the first interval arbitrarily far away, making the bounds pinch at $c=1$. Through the previously established correspondence between this trapped random walk and the dissipative abelian sandpile, the same dichotomy is stated for the sandpile: non-critical (finite expected avalanche size) for $c<1$, critical (infinite expected avalanche size) for $c>1$.","pith_inferences":["At $c=1$ itself the theorem is silent; the upper and lower bounds pinch at that point, so a natural conjecture—not made by the paper—is that $E(\\tau)$ diverges exactly at $c=1$, possibly with a slowly growing partial-sum rate.","The same comparison method could be applied to other growth rules such as $|I_{j+1}| = c |I_j|^p$; if the correction factors still telescope, the analogue of the critical $c$ would be a function of $p$, a statement the paper does not contain.","In the sandpile reading, the non-monotonicity example suggests that moving dissipative sites farther apart can reduce the average avalanche size; that consequence for avalanches is implicit rather than proved here."],"forward_implications":["For $c<1$, the corresponding one-dimensional dissipative sandpile has finite expected avalanche size: dissipation disrupts criticality.","For $c>1$, expected avalanche size is infinite even though the trap density is zero: criticality survives a super-exponentially sparse set of dissipative sites.","Changing any finite initial segment of the trap landscape cannot flip finiteness of $E(\\tau)$; only the tail matters.","The expected survival time is not monotone in interval lengths: a landscape with all intervals four times larger can have finite $E(\\tau)$ where the smaller-interval landscape has infinite $E(\\tau)$."],"supporting_citations":[{"why":"introduces self-organized criticality through the sandpile, the phenomenon the dissipative model either preserves or loses.","marker":"[1]"},{"why":"supplies the definition and standard properties of the abelian sandpile model whose criticality is at stake.","marker":"[2]"},{"why":"introduces the dissipative abelian sandpile and proves that bulk dissipation breaks self-organized criticality, motivating the question of how much dissipation is needed.","marker":"[3]"},{"why":"treats the infinite-volume limit of dissipative sandpiles, the setting in which finite versus infinite avalanche expectation is defined.","marker":"[4]"},{"why":"studies the zero-dissipation limit and frames the critical/non-critical distinction the recursion is meant to interpolate between.","marker":"[5]"},{"why":"establishes the equivalence between finite expected avalanche size in the dissipative abelian sandpile and finite expected survival time of the trapped random walk, which transfers the phase transition to the sandpile.","marker":"[6]"}],"fun_headline_variants":["Random walk lifetime diverges when sandpile traps cross c=1","Trap spacing constant c=1 sets sandpile criticality threshold","Walk survival flips at c=1: dissipation threshold for sandpile","Dissipation threshold pinned: c=1 separates finite and infinite walk lifetimes","Sandpile's criticality hinges on trap-ratio constant c=1"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is that the correction factors in Lemma 4.1—a stay multiplies a contribution by at most $2/c$ and a left move by at most $2/(c^2|I_1|^2)$, with matching lower bounds—are exact consequences of the recursion $|I_{j+1}|=c|I_j|^2$; if those factors differ, the critical constant shifts, and the sandpile conclusion additionally assumes the cited equivalence between finite survival time and finite avalanche expectation.","fun_headline_variants_meta":{"raw":{"variants":["Random walk lifetime diverges when sandpile traps cross c=1","Trap spacing constant c=1 sets sandpile criticality threshold","Walk survival flips at c=1: dissipation threshold for sandpile","Dissipation threshold pinned: c=1 separates finite and infinite walk lifetimes","Sandpile's criticality hinges on trap-ratio constant c=1"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000496,"raw_usage":{"total_tokens":2390,"prompt_tokens":862,"completion_tokens":1528,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":478,"completion_tokens_details":{"reasoning_tokens":1434}},"tokens_in":478,"tokens_out":1528,"duration_ms":11586,"temperature":1.0,"reasoning_tokens":1434,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-06T21:15:06.767493+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Evaluate $E(\\tau)$ numerically for the recursion with $|I_1|=3$ on truncated systems at $c=0.9$ and $c=1.1$: if the mean survival time does not stay bounded at $c=0.9$, or does not grow without bound at $c=1.1$ as the truncation is removed, the phase boundary is not at $c=1$.","supporting_citations":[{"cited_title":"Self-organized criticality: An explanation of the 1/f noise","cited_arxiv_id":null,"evidence_quote":"introduces self-organized criticality through the sandpile, the phenomenon the dissipative model either preserves or loses."},{"cited_title":"The abelian sandpile and related models","cited_arxiv_id":null,"evidence_quote":"supplies the definition and standard properties of the abelian sandpile model whose criticality is at stake."},{"cited_title":"Proof of breaking of self-organized criticality in a nonconservative abelian sandpile model","cited_arxiv_id":null,"evidence_quote":"introduces the dissipative abelian sandpile and proves that bulk dissipation breaks self-organized criticality, motivating the question of how much dissipation is needed."},{"cited_title":"The infinite volume limit of dissipative abelian sandpiles","cited_arxiv_id":null,"evidence_quote":"treats the infinite-volume limit of dissipative sandpiles, the setting in which finite versus infinite avalanche expectation is defined."},{"cited_title":"Approaching criticality via the zero dissipation limit in the abelian avalanche model","cited_arxiv_id":null,"evidence_quote":"studies the zero-dissipation limit and frames the critical/non-critical distinction the recursion is meant to interpolate between."},{"cited_title":"Ruszel, and Ellen Saada","cited_arxiv_id":null,"evidence_quote":"establishes the equivalence between finite expected avalanche size in the dissipative abelian sandpile and finite expected survival time of the trapped random walk, which transfers the phase transition to the sandpile."}],"review_version":1}