{"id":"3a28938e-26fc-40d2-9334-4a945efb70d9","arxiv_id":"1908.04991","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":4,"one_line_summary":"Locally driving BTW and Manna sandpiles toward high or low sites changes avalanche statistics; maximum-drive reduces cost with an optimal search depth, and Manna remains critical while BTW minimum-drive does not.","lead":"This paper tests whether avalanches in two standard sandpile models can be made cheaper by locally choosing where each new grain lands, instead of adding it at a random site. It finds that steering grains toward high sites reduces large-avalanche cost in the BTW model, that steering toward low sites destroys simple scaling in BTW but not in Manna, and that a finite search depth minimizes total cost.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The cost objective in Eq. (2) is normalization-ambiguous: p_{mu,n}(s) is never specified as conditional on avalanches or over all drive events, while the search cost b*mu is per drive event. The quoted optimal mu* and n* are therefore not quantitatively supported.","rationale":"The reader's weakest_assumption identifies the same issue I find most load-bearing: the comparison between avalanche damage and search cost in Sec. IV is undefined unless p_{mu,n}(s) and b*mu are measured in the same per-drive-event units. The numerical difference is potentially large because the avalanche-trigger probability is far below 1 and is itself drive-dependent. The qualitative finding that Max drive reduces the weight of large avalanches is supported by the PDFs in Figs. 2 and 5, but the quantitative optima mu* and n* are not. I also note a smaller, independent issue in the scaling argument: for p_mu(s)=s^{-tau}g_mu(s/L^D), the moment should scale as L^{D(alpha-tau+1)}, not L^{alpha+tau-1} as written in Sec. IV; this affects the stated large-L reasoning, though the quoted optima come from simulation data. Since the reader's conditional verdict already requires resolving the normalization issue, my read does not move the verdict; it reinforces the same condition.","tokens_in":11819,"tokens_out":5687,"duration_ms":58536,"concrete_test":"Regenerate the avalanche-size histograms for BTW Max and Manna Max at L=512, alpha=1.5, b/c=10^5 for mu in [0,1] (and for the depth search up to n=8). Recompute the cost objective twice: (a) normalize p(s) over avalanches only and multiply by the measured avalanche probability P_av(mu,n); (b) normalize p(s) over all drive events, treating silent additions as a delta at s=0. If the location of the minimum in mu, or the optimum depth n, changes by more than the resolution of Figs. 8, 9, and 11, then Eq. (2) is not a well-defined objective and the quoted optima are normalization-dependent.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central numerical optimum is computed in Sec. IV by comparing avalanche damage with search cost. Equation (2) defines the mean avalanche cost as \\int p_{\\mu,n}(s) A(s)\\,ds, and the text then adds a search cost b\\mu. The paper never states whether p_{\\mu,n}(s) is the distribution of avalanche sizes conditional on an avalanche having occurred, or the distribution over all drive events including silent additions with s=0. These differ by the avalanche probability P_av(\\mu,n,L). In sandpile models P_av is far below 1: in ordinary BTW only about 44% of random additions trigger topplings, and in the Min models the whole point of the drive is that most additions are placed on low sites and do not topple. If p is conditional, the correct per-drive-event expected cost is P_av(\\mu,n,L) \\int p(s)A(s)\\,ds + b\\mu, and P_av itself depends on \\mu, n, and L. If p already includes silent events, then the plotted PDFs and the moments computed from them must be renormalized accordingly, and the delta-at-zero mass must be handled explicitly. Either way, the quoted optima \\mu^*\\simeq0.58 (BTW Max), \\mu^*\\simeq0.68 (Manna Max), and n^*=3 are not robust until this normalization is specified. This is the main unresolved step in the central cost-minimization claim.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"This manuscript studies the BTW and Manna sandpile models under a locally modified drive: with probability μ the sand grain is added to the minimum or maximum height among the selected site and its neighbors, and alternatively the search depth n is varied. The authors report that maximum drive shifts avalanche-size distributions toward smaller sizes, that minimum drive in the BTW model produces much larger avalanches and no clean finite-size collapse, while the Manna model remains robust to both drive methods. They define an avalanche cost A(s)=c s^α, add a search cost b per local search, and compute an average total cost from measured avalanche distributions. They report an optimal μ*≈0.58 for the BTW Max model (L=512, α=1.5, b/c=10^5), μ*≈0.68 for the Manna Max model, and an optimal search depth n*=3 for the BTW cost parameters, concluding that full maximum drive is increasingly beneficial in large systems.","tokens_in":12121,"tokens_out":7672,"duration_ms":81410,"significance":"If the results were fully supported, the proposed local drive mechanism would be an appealing way to reduce large avalanche risk in SOC models without requiring non-local information, and the reported distinction between the fragile BTW model and the robust Manna model would be a useful contribution to the control of self-organized critical systems. The finite-size-scaling data collapse and quoted exponents for the Manna models, with error bars, are credible strengths, as is the qualitative observation that search-depth performance saturates exponentially in the BTW case. However, the cost-optimization part is the paper's central quantitative claim and is currently not supported to the required standard because the normalization in Eq. (2) is ambiguous and the cost curves have no reported uncertainties. With a corrected normalization, corrected scaling argument, and error estimates, the paper could become a solid contribution.","major_comments":[{"comment":"Equation (2) defines the mean avalanche cost as ∫ p_{μ,n}(s) A(s) ds, and this is added to the per-drive-event search cost bμ. The normalization of p_{μ,n}(s) is never specified. If p is conditional on avalanches, the expected cost per drive event is P_av(μ,n,L) ∫ p(s) A(s) ds + bμ, where P_av is the probability that a drive event triggers an avalanche; P_av depends on μ, n, and L and is substantially less than 1 in sandpile models. If p is normalized over all drive events, including silent additions, then it has a probability mass at s=0 and the plotted PDFs and moments must be renormalized accordingly. Because the two normalizations differ by the factor P_av, the reported optimal values μ*≈0.58, μ*≈0.68, and n*=3 are not quantitatively supported until the normalization is specified and the optimization is repeated with the avalanche probability explicitly included.","section":"§IV, Eq. (2)"},{"comment":"The text uses the relation ⟨s^α⟩_μ = L^{α+τ−1} f_α(μ) to argue that for large L the search-cost term bμ is negligible and full maximum drive is optimal. With the finite-size scaling form p(s)=s^{−τ} g(s/L^D) stated in Sec. III, the moment scales as L^{D(α+1−τ)}, not L^{α+τ−1}; the exponent as written does not involve D and has the wrong dependence on τ. This invalidates the large-system argument as presented and needs to be corrected before the conclusion about full drive in large systems can be accepted.","section":"§IV, moment scaling argument"},{"comment":"The conclusion states that 'in the BTW the criticality is gone with Minimum drive', but Sec. III A reports for the Min BTW model no clean data collapse, a size-dependent slope, and an extrapolated exponent τ∞=1.6±0.3 that is consistent with ordinary BTW within its large error bars. The evidence supports a qualitative change with stronger multiscaling, but not necessarily a loss of criticality. Please state the criterion used for 'criticality is gone' and either support it with a quantitative test or soften the conclusion.","section":"§III A and §V"},{"comment":"The quoted optimal parameters μ* and n* are read from cost curves with no error bars or statistical uncertainties. In Fig. 8 the minimum is shallow, with the cost varying by only a few percent over a wide range of μ, so without bootstrap or repetition errors the reported optimum values are not robust. Please provide error estimates on all cost curves and, ideally, release the simulation data or code so the optima can be independently verified.","section":"§IV, Figs. 7–12"}],"minor_comments":[{"comment":"The text says the cost function should be concave and that α>1 makes it concave, but A(s)=c s^α with α>1 is convex in s. If the intended assumption is increasing marginal cost (risk aversion), the wording should say 'convex'; if diminishing marginal cost is intended, the model requires α<1.","section":"§IV, Eq. (1)"},{"comment":"The sentence 'we have shown that with the new drive method, the system is still critical' is too broad: it is not true for the Min BTW model, for which Fig. 3 explicitly shows no single-exponent power law and no clear data collapse.","section":"§IV, paragraph after Eq. (2)"},{"comment":"There are several small presentation issues: 'Tbaldi' should be 'Tebaldi'; the range '10^{-6} - 10^{-5}' should use a consistent dash; and the captions of Figs. 7 and 8 should state the units of the vertical axis and the value of c/b more clearly.","section":"General presentation"},{"comment":"The exponential fits for A(n) report n01=3.2 and n02=12.2 and the saturation values A∞1 and A∞2, but no uncertainties are given for these fit parameters, and the cost for searching n neighbors is not written as an equation. Please add confidence intervals and state the search-cost model explicitly.","section":"§IV, Fig. 10 and Fig. 11"},{"comment":"No code or processed data are provided. For a numerical study whose central claims are quantitative optima, a data/code repository would substantially improve reproducibility and allow referees to check the normalization issue raised above.","section":"Reproducibility"}],"recommendation":"major_revision","confidential_remarks":"The normalization ambiguity in Eq. (2) is the key technical issue and is central to the paper's main quantitative claim; it should be treated as a blocking point rather than a cosmetic point. I see no signs of misconduct, and the self-citation in Ref. [18] is not problematic. A revision that specifies the normalization, corrects the moment-scaling expression, adds error bars, and tempers the criticality claim would make the paper acceptable in my view."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Short version: this is a decent numerical study of a genuinely local drive protocol for BTW and Manna sandpiles. The qualitative finding—Max drive suppresses large avalanches, Min drive makes them worse in BTW but Manna is robust—is credible and worth knowing. The quantitative optimization in Section IV is the soft spot: the optimum search frequency and depth are computed from a cost integral whose normalization is never pinned down.\n\nWhat's new: [34] used non-local knowledge of all height-2 sites on a graph; here the drive only looks at the chosen site and its neighbors. They check both BTW and Manna, report a robustness asymmetry, and add a search-depth cost tradeoff. That's a real extension. The Manna FSS collapse is clean, and the claim that the Manna model absorbs the perturbation is supported by the height-relaxation experiment in Section III.\n\nCredit where due: the cost function explicitly avoids the negative-cost pathology of [34] by assigning zero benefit to no-avalanche events. The exponential decay of avalanche cost with search depth is a nice empirical structure, and they fit it with maximum likelihood.\n\nThe main problem: Eq. (2) defines the mean avalanche cost as the integral of p_{mu,n}(s) A(s) ds, and they add b*mu as a per-event search cost. But p(s) is never specified as conditional on avalanches or over all drive events including silent additions. In sandpiles, many additions don't topple; in Min drive that's the whole point. If p is conditional, the periodic cost should be P_av * integral + b*mu, where P_av depends on mu and L. If p already includes silent events, the plotted PDFs must be renormalized accordingly. So the quoted optima (mu* ~0.58, mu* ~0.68, n*=3) are not quantitatively defensible as they stand. That's not a fatal flaw in the qualitative story, but it means the headline numbers from Section IV shouldn't be trusted until the normalization is cleared up.\n\nMinor soft spots: no error bars on any cost curve; no code or data release, so the numerics aren't independently checkable; and the conclusion's 'criticality is gone' for BTW Min outruns the paper's own evidence—the body says multi-scaling with a cutoff exponent consistent with the original BTW. It's a fair statement that single-scaling criticality is lost, but 'gone' is too strong.\n\nBottom line: this paper deserves a serious referee. The local protocol and Manna robustness are useful, and the normalization issue is fixable. I'd send it to review, and I'd push the authors to state the normalization, add error bars, and soften the BTW Min conclusion.","headline":"A plausible local control scheme for sandpiles whose quantitative cost optimum rests on an unstated normalization assumption.","tokens_in":12667,"tokens_out":2211,"would_cite":true,"duration_ms":21046,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":["05.65.+b"],"model":"deepseek-v4-flash","headline":"A local, neighbor-based rule for choosing where to add sand reduces large-avalanche probability in the BTW and Manna sandpile models, and an intermediate search frequency or depth minimizes total avalanche plus search cost.","keywords":["self-organized criticality","sandpile models","BTW model","Manna model","drive modification","avalanche cost","finite-size scaling","criticality control"],"falsifier":"A direct check is to rerun the BTW Max simulations for $L = 512$, $\\alpha = 1.5$, $b/c = 10^5$ and record explicitly the number of drive events that produce no avalanche; if $p(s)$ in Eq. (2) is conditional on avalanches, recomputing the average over all drive events should remove or shift the minimum at $\\mu \\simeq 0.58$. Also, directly measuring $f_\\alpha(\\mu)$ for two system sizes and checking whether $\\mu^*$ moves toward 1 as $L$ increases would settle the large-system claim.","tokens_in":11574,"feed_emoji":"🏔️","tokens_out":7967,"duration_ms":73833,"temperature":0.7,"pith_summary":"This paper asks whether a purely local change in how a sandpile is driven—checking the height of a randomly selected site and its neighbors, then dropping the grain on the lowest (Min) or highest (Max) site among them—can shrink the largest avalanches in two classic self-organized criticality models, BTW and Manna. It finds that Max drive modestly suppresses large avalanches in BTW while keeping its critical scaling, whereas Min drive removes ordinary single-exponent criticality from BTW and lets avalanches reach sizes comparable to the whole lattice. The Manna model, by contrast, keeps its critical exponents under both drives. Assigning a concave power-law cost to avalanche size and a linear cost to each local search, the paper reports an intermediate drive frequency ($\\mu^* \\approx 0.58$ for BTW Max, $\\approx 0.68$ for Manna Max at $L = 512$, $\\alpha = 1.5$, $b/c = 10^5$) and an intermediate search depth ($n = 3$ for the BTW costs tested) that minimize total cost. If correct, this means catastrophic-event risk in such systems can be steered downward using only local information, with a finite overhead for the search.","feed_headline":"Local drive cuts avalanche cost in sandpile models","feed_subtitle":"Choosing where to drop each grain can shrink catastrophic avalanches, and a sweet spot minimizes total cost.","key_machinery":"The central object is the local neighborhood drive: at each step select one site at random, inspect the height of that site and its (first, then possibly second) neighbors, and deposit the grain on the site of minimum or maximum height among those inspected. The argument is carried by the probability distribution $p_{\\mu,n}(s)$ of avalanche sizes under this drive, the cost functional $\\langle\\text{cost}\\rangle = \\int p_{\\mu,n}(s) c s^{\\alpha} \\, ds + b$ times the search frequency or depth, and the finite-size scaling ansatz $p(s) = s^{-\\tau} g(s/L^D)$, which turns the average cost into a moment $\\langle s^{\\alpha}\\rangle = L^{\\alpha+\\tau-1} f_\\alpha(\\mu)$ that grows with system size while the search cost $b\\mu$ stays size-independent. That tension between a size-growing avalanche benefit and a size-independent search overhead is what produces the interior optimum in $\\mu$ and $n$.","core_discovery":"The authors claim that replacing purely random sand addition by a local Max drive—always adding to the highest site among the selected site and its neighbors—reduces the probability of very large avalanches in the BTW model without changing its universality class, while the corresponding Min drive pushes BTW away from ordinary criticality, amplifying its multi-scaling and shifting the avalanche-size cutoff to sizes comparable to the whole lattice. In the Manna model both drives leave the critical exponents essentially unchanged. With a cost function $A(s) = c s^{\\alpha}$ ($\\alpha > 1$) for avalanche size $s$ plus a search cost $b$ times the frequency or depth of the local search, the total cost as a function of the mixing probability $\\mu$ has an interior minimum ($\\mu^* \\simeq 0.58$ for BTW Max and $\\simeq 0.68$ for Manna Max at $L = 512$, $\\alpha = 1.5$, $b/c = 10^5$), while the avalanche cost alone decreases monotonically with $\\mu$. For large enough systems the moment integral scales as $L^{\\alpha+\\tau-1}$, so full Max drive wins in the thermodynamic limit. The optimal search depth for BTW is $n = 3$ for the tested costs, with the avalanche cost decaying exponentially in $n$ in two stages corresponding to nearest and next-nearest neighbors.","pith_inferences":["If the reported interior optimum survives careful normalization, the same trade-off should appear in any SOC system whose avalanche moment grows with system size and whose search cost is constant: an optimal intervention frequency that tends to 1 as $L$ grows, with a crossover that could be measured directly by extracting $f_\\alpha(\\mu)$ at fixed $L$.","The two-stage exponential decay of cost with $n$ suggests the relevant control variable is not simply the number of sites inspected but the topological distance reached by the search; a testable extension would compare searches that inspect $n$ sites all at distance 1 against searches that inspect fewer sites at distance 2.","A practical extension the paper does not pursue is time-dependent drive: alternating periods of Max drive with periods of random drive may prevent the slow build-up of maximum-height clusters that Min drive induces, potentially reducing cost further than any fixed $\\mu$.","One could also test the paper's cost picture on systems with absorbing states or non-conservative dynamics, where the local Max rule may have a different effect on the avalanche cutoff and therefore on the optimal search depth."],"forward_implications":["In both models a Max drive at full frequency lowers the expected avalanche cost to about two-thirds of the ordinary random-drive value for the BTW parameters examined, and the reduction is larger for larger $\\alpha$.","Because the avalanche-moment contribution grows with $L^{\\alpha+\\tau-1}$ while search cost is independent of $L$, for sufficiently large systems the optimal strategy is always full maximum drive ($\\mu = 1$), while for small systems the search cost can make any modification counterproductive.","The Min drive is counterproductive for cost in BTW: it raises mean cost by up to a factor of four and makes the avalanche distribution develop a peak near $s \\sim 14$–$16$ with a cutoff extended to about $10^6$ on a $256 \\times 256$ lattice.","For BTW, the avalanche cost as a function of search depth $n$ falls exponentially in two stages (decay constants $n_0 \\simeq 3.2$ for nearest neighbors and $n_0 \\simeq 12.2$ for next-nearest neighbors), so most of the benefit is obtained from shallow local searches; for Manna the initial drop is even steeper but no clean exponential form is found.","The Manna model's critical exponents under Min drive ($\\tau = 1.27 \\pm 0.01$, $D = 2.73 \\pm 0.05$) are unchanged by the drive modification, whereas BTW's Min-drive data fail a single-exponent finite-size collapse, indicating the modification amplifies BTW's multi-scaling."],"supporting_citations":[{"why":"Introduces the BTW model and the idea that a sandpile self-organizes to criticality; supplies the primary system the paper modifies.","marker":"[1]"},{"why":"Introduces the stochastic Manna model, the second system studied throughout the paper.","marker":"[15]"},{"why":"Previous height-biased drive that motivates the local Max/Min rule and showed criticality survives only when maximum-height sites are favored.","marker":"[33]"},{"why":"Supplies the avalanche cost function and the earlier result that full maximum drive minimizes avalanche cost; the paper extends this with local drives and explicit search costs.","marker":"[34]"},{"why":"Establishes multi-scaling in the BTW model, which the paper invokes to interpret the Min-drive results.","marker":"[31]"},{"why":"Justifies the concave power-law cost function as a risk-aversion measure for avalanche sizes.","marker":"[39]"}],"fun_headline_variants":["Local drive tames avalanches in BTW sandpile","Optimal local drive minimizes sandpile cost","BTW sandpile cost sweet spot from local drive","Locally driven sandpile reduces avalanche cost","Tuned drive lowers sandpile avalanche cost"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The quoted optimal values of $\\mu$ and $n$ assume that the avalanche-cost moment and the per-search cost $b\\mu$ are measured per drive event in the same normalization; if the size distribution is normalized over avalanches only, the balance between the two terms changes and the interior minimum may be an artifact.","fun_headline_variants_meta":{"raw":{"variants":["Local drive tames avalanches in BTW sandpile","Optimal local drive minimizes sandpile cost","BTW sandpile cost sweet spot from local drive","Locally driven sandpile reduces avalanche cost","Tuned drive lowers sandpile avalanche cost"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001178,"raw_usage":{"total_tokens":4838,"prompt_tokens":888,"completion_tokens":3950,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":504,"completion_tokens_details":{"reasoning_tokens":3879}},"tokens_in":504,"tokens_out":3950,"duration_ms":27430,"temperature":1.0,"reasoning_tokens":3879,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T13:26:43.961780+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"A direct check is to rerun the BTW Max simulations for $L = 512$, $\\alpha = 1.5$, $b/c = 10^5$ and record explicitly the number of drive events that produce no avalanche; if $p(s)$ in Eq. (2) is conditional on avalanches, recomputing the average over all drive events should remove or shift the minimum at $\\mu \\simeq 0.58$. Also, directly measuring $f_\\alpha(\\mu)$ for two system sizes and checking whether $\\mu^*$ moves toward 1 as $L$ increases would settle the large-system claim.","supporting_citations":[{"cited_title":"Manna, J","cited_arxiv_id":null,"evidence_quote":"Introduces the stochastic Manna model, the second system studied throughout the paper."},{"cited_title":"Jo urnal of Physics A: Mathematical and Theoretical 48.40 (2015): 405003","cited_arxiv_id":null,"evidence_quote":"Previous height-biased drive that motivates the local Max/Min rule and showed criticality survives only when maximum-height sites are favored."},{"cited_title":"Brummitt, and Raissa M","cited_arxiv_id":null,"evidence_quote":"Supplies the avalanche cost function and the earlier result that full maximum drive minimizes avalanche cost; the paper extends this with local drives and explicit search costs."},{"cited_title":"Tebaldi, M","cited_arxiv_id":null,"evidence_quote":"Establishes multi-scaling in the BTW model, which the paper invokes to interpret the Min-drive results."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Justifies the concave power-law cost function as a risk-aversion measure for avalanche sizes."}],"review_version":1}