{"id":"dd43ea55-a293-46f3-828b-1af111f361f4","arxiv_id":"2501.04463","paper_version":1,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":5.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":0,"one_line_summary":"A modified heterogeneous mean-field SIS model with a Verhulst-style mitigation factor has zero epidemic threshold on Barabasi-Albert networks, a nonmonotonic edge infection probability, and a monotonically increasing prevalence.","lead":"This paper adds a mitigation factor to a standard network epidemic model, so that infected people are counted less often as transmitters when infection is widespread. It shows on a scale-free network that the edge infection probability becomes nonmonotonic while the overall infection level still grows with the infection rate.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The λc=0 claim rests on an infinite, cutoff-free BA degree distribution; on any finite BA network the threshold is positive, so the central claim needs a thermodynamic-limit qualifier.","rationale":"The reader's conditional verdict is appropriate. I re-derived the modified self-consistency equation: with q(k)=m/k^2 and ρ(1−ρ)=λkΘ/(1+λkΘ)^2, the integral gives exactly Eq. (15). I also recomputed dΘ/dλ by implicit differentiation of Eq. (16); the correct factor is Θ+λ dΘ/dλ = (λmΘ)(1+λmΘ)^2/(λm)^2, which is positive for all λ>0. Equation (29) as printed has an extra denominator factor, but its sign, and hence the monotonicity proof, survive correction. The load-bearing concern is therefore not internal; it is the infinite-degree assumption. The proof of λc=0 relies on integrating P(k) to infinity in Eq. (7). On any finite BA network the maximum degree is finite, the second moment is finite, and the discrete versions of Eqs. (15) and (24) have a positive threshold. Since the paper does not qualify 'BA network' as the thermodynamic limit, the headline claim overreaches. A truncated-sum check would settle whether this concern lands. If the authors add this qualifier and the finite-K_max calculation, the conditional acceptance stands.","tokens_in":6086,"tokens_out":19115,"duration_ms":182694,"concrete_test":"Replace the integral in Eqs. (15) and (24) by a sum over degrees up to K_max for BA networks of size N with K_max∼N^{1/2}; solve the discrete self-consistency equation for λc(K_max). If λc(K_max) does not tend to zero as K_max→∞, the claimed λc=0 is an artifact of the cutoff-free distribution. Additionally, run quasi-stationary SIS simulations on BA networks with N=10^3 to 10^6 using a microscopic isolation rule consistent with the mHMF ansatz, and compare prevalence with Eq. (24); if the effective threshold remains positive at all accessible N and does not scale to zero, the central claim fails for finite BA networks.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central analytical result, λc=0 for the mHMF, follows from replacing the BA degree sum by an integral over P(k)=2m^2/k^3 with no upper cutoff (Eq. 7). The self-consistency equations (15) and (24) have a nontrivial solution for every λ>0 only because the unbounded tail of this distribution makes the effective branching ratio diverge. A finite BA network has maximum degree K_max∼N^{1/2} and degree-degree correlations; with a cutoff at K_max the same equations have a finite epidemic threshold λc(K_max)>0, and the prevalence curve differs from Eq. (24). Since the paper states the result for 'the Barabasi-Albert network' without this qualifier, the strongest claim is not established for any actual BA network of finite size. This is not an internal algebraic error: the HMF derivation is consistent, and the flawed Eq. (29) is repairable without changing the sign of the prevalence derivative. The load-bearing condition for the headline conclusion is the infinite-size idealization, and the paper does not flag it as such.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The paper studies the susceptible-infected-susceptible (SIS) model on Barabási-Albert networks within the heterogeneous mean-field approximation. It introduces a Verhulst-like mitigation factor into the probability that an edge connects to an infected node, replacing the standard relation Θ = Σ_k q(k)ρ_k with Θ = Σ_k q(k)ρ_k(1−ρ_k). The authors derive the stationary self-consistency equation for the modified model, prove that a nontrivial solution exists for every positive infection rate, conclude that the epidemic threshold is λc = 0, and analyze the prevalence. They compare the modified model with the original HMF model and show that, although the probability Θ becomes non-monotone in the modified model, the prevalence remains monotonically increasing with the infection rate. All main results are derived analytically under the continuous, cutoff-free degree distribution P(k) = 2m^2/k^3.","tokens_in":6303,"tokens_out":18799,"duration_ms":160640,"significance":"If the results are correct, the paper offers a simple, analytically tractable modification of HMF that models isolation or hospitalization of infected individuals. Its main strength is that the stationary equations and threshold condition are derived self-consistently from the model definition, with no fitted parameters and no reliance on external numerical calibration. The comparison between the behavior of Θ and the prevalence is a clean and potentially instructive result for network epidemiology. The main limitation is that the conclusions are obtained under the annealed HMF approximation and under an idealized infinite BA degree distribution; the paper would benefit from stating this qualifier explicitly. The algebraic error in Eq. (29) affects the displayed proof of monotonicity, but the positivity of the prevalence derivative is recoverable with a corrected derivative, so the central claim is defensible after revision.","major_comments":[{"comment":"The identity for Θ + λ dΘ/dλ is algebraically incorrect and needs to be fixed. Starting from F(λ,Θ) = λm[ln(1+1/x) − 1/(1+x)] − 1 = 0 with x = λmΘ, one obtains F_Θ = −λm/[Θ(1+x)^2] and F_λ = 1/λ − m/(1+x)^2. Implicit differentiation therefore gives Θ + λ dΘ/dλ = x(1+x)^2/(λm)^2 > 0, not the expression displayed in Eq. (29). For example, at the self-consistent point λm ≈ 5.177 and x = 1, the corrected expression gives about 0.149, while Eq. (29) gives about 0.050. The positivity of Θ + λ dΘ/dλ, and hence the monotonicity of the prevalence, follows from the corrected expression, but the displayed derivation in the manuscript must be revised.","section":"§III.B, Eq. (29)"},{"comment":"The claim λc = 0 is established only for the idealized thermodynamic limit with the cutoff-free power-law distribution P(k) = 2m^2/k^3 in Eq. (7). On a finite BA network with a maximum degree Kmax, the integrals in Eqs. (8), (12), and (15) are cut off and the same equations yield a positive threshold. Since the text states the result for 'the Barabási-Albert network' without this qualifier, the paper should explicitly say that λc = 0 holds in the infinite-network, continuous-degree approximation. This is not an internal inconsistency of the derivation, but it is load-bearing for the headline threshold result and should be flagged in the main text and the conclusion.","section":"§III.A and §IV"}],"minor_comments":[{"comment":"There is a typo in 'one seees' in the paragraph after Eq. (3); it should be 'one sees'.","section":"§II.A"},{"comment":"The notation in Eq. (29), written as 1/((λm)^2), could be mistaken for 1/(λm)^2 with dimensional inconsistency; the corrected formula should be written with clear parentheses, e.g., x(1+x)^2/(λm)^2.","section":"§III.B"},{"comment":"The conclusion states that the results are 'based on exact results'; this should be qualified as 'exact within the heterogeneous mean-field approximation and the cutoff-free BA degree distribution' to avoid overstatement.","section":"§IV"},{"comment":"The proof that g(1) < 1 relies on Ψ(λm) being strictly less than 1 for finite λm; this is correct, but stating explicitly that Ψ(z) < 1 for all finite z > 0 would make the argument more transparent.","section":"§III.A"},{"comment":"The paper would be easier to read if the relation between Eq. (14) and the classical Verhulst factor were stated slightly more precisely, since the mitigation factor appears in the edge probability Θ rather than directly in the infection rate λ.","section":"General"}],"recommendation":"major_revision","confidential_remarks":"I concur with the conditional assessment in the reader's report: the main idea is sound and the model is analytically tractable, but the displayed identity in Eq. (29) is a load-bearing algebraic error and the zero-threshold claim needs a clear finite-size/thermodynamic-limit qualifier. Both issues are repairable within the paper's scope, so reject is not warranted. If the authors fix these points and add the qualifier, the manuscript could be suitable for publication in a statistical mechanics / network epidemiology venue."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: this is a small, mostly correct analytic paper. The new piece is Eq. (14), replacing the usual Θ = Σ q(k)ρ_k with Θ = Σ q(k)ρ_k(1 − ρ_k), and the exact BA analysis that follows: nonmonotonic Θ with a peak, yet monotone prevalence. That contrast is genuinely not in the cited HMF papers, and the derivation of the stationary solution is self-contained. Credit where due: the threshold proof via g(Θ) is clean, the peak calculation in Eqs. (22)–(23) is neat, and the paper does not oversell the modeling interpretation.\n\nThe soft spots, in order of real weight. First, Eq. (29) is simply wrong as printed: the left side Θ + λ dΘ/dλ does not equal that expression. With λm ≈ 5.177 and λmΘ = 1, the printed formula gives a negative number and the bracket can even go negative, so the proof of monotone prevalence is not supported by the algebra shown. This is repairable—the derivative can be computed correctly from (15)–(16), and numerically the monotonicity claim appears true—but as submitted it is a genuine flaw in a proof the authors call exact.\n\nSecond, and load-bearing for the headline: λc = 0 comes from the continuous BA distribution P(k) = 2m²/k³ integrated to infinity with no cutoff. On any finite BA network the maximum degree is ~N^{1/2}, the same equations give a positive threshold, and the quantitative prevalence curve changes. The paper states the result for “the Barabási–Albert network” without flagging that the zero threshold is a strict thermodynamic-limit artifact of the cutoff-free degree distribution. This is not an internal inconsistency—the HMF derivation is fine under its stated idealization—but the claim needs a qualifier.\n\nMinor points: the mitigation factor is an ad hoc postulate, not derived from data or validated by simulation; a finite-network Monte Carlo check would strengthen the paper considerably. Self-citations to [15] and [18] are appropriate since the logistic idea is explicitly theirs and the model is a variant.\n\nWho is this for? People working on degree-based mean-field epidemiology who want a one-page analytic variant of SIS with isolation. It deserves a serious referee: the algebra error is fixable, the central idea is clear, and the comparison between monotone prevalence and peaked Θ is worth publishing once corrected. I would send it to review, with the request that the authors fix Eq. (29) and either add a finite-size simulation or explicitly qualify the infinite-network limit in the abstract and conclusion.","headline":"A clean analytic extension of HMF-SIS with a mitigation factor; main claims survive the faulty Eq. (29), but the zero-threshold result needs its infinite-network qualifier stated openly.","tokens_in":6844,"tokens_out":760,"would_cite":false,"duration_ms":9071,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"This paper proves that a mitigated SIS model on a Barabási-Albert network stays endemic at every positive infection rate and that overall prevalence rises monotonically even though the edge-reachable infected fraction peaks.","keywords":["SIS epidemics","heterogeneous mean-field","Barabási-Albert network","epidemic threshold","mitigation factor","logistic suppression","prevalence","scale-free networks"],"falsifier":"On a finite Barabási-Albert network with $N$ vertices (maximum degree of order $\\sqrt{N}$), solve the stationary condition with the discrete sum instead of the integral over the unbounded power law: if the numerical solution shows a positive threshold $\\lambda_c>0$ below which only the absorbing state exists, then the unbounded continuous approximation, not the mitigation mechanism alone, is producing the claimed zero threshold.","tokens_in":5863,"feed_emoji":"🦠","tokens_out":12299,"duration_ms":110286,"temperature":0.7,"pith_summary":"This paper analyzes a susceptible-infected-susceptible epidemic model in which infected individuals progressively withdraw from the infection dynamics, as under isolation or hospitalization. The modifying idea is a logistic-type suppression: the probability of reaching an infected node along a randomly chosen edge is replaced by $\\Theta = (1/\\langle k\\rangle) \\sum_k kP(k)\\rho_k(1-\\rho_k)$, so a heavily infected degree class contributes less to new infections. On a Barabási-Albert scale-free network with degree distribution $P(k)=2m^2/k^3$, the paper proves that the mitigated model still has no epidemic threshold: a nontrivial infected state exists for every positive infection rate $\\lambda$, so $\\lambda_c=0$. The total prevalence $\\rho$ nevertheless increases monotonically with $\\lambda$, even though the edge-level probability $\\Theta$ is nonmonotonic and displays a peak. The consequence is that mitigation, while quantitatively reshaping the epidemic, does not by itself create a safe infection rate on unbounded scale-free contact networks.","feed_headline":"Mitigation does not lift the zero threshold on scale-free networks","feed_subtitle":"A logistic-style suppression keeps prevalence rising even as the edge-reachable infected fraction peaks.","key_machinery":"The central object is the modified self-consistency function $g(\\Theta)=\\lambda m\\left[\\ln\\left(1+\\frac{1}{\\lambda m\\Theta}\\right)-\\frac{1}{1+\\lambda m\\Theta}\\right]$, whose intersection with the line $y=1$ locates the stationary infected state. The proof that $g(1)<1$ for all $\\lambda m>0$ uses the auxiliary function $\\Psi(z)=z\\ln(1+1/z)$, which increases and approaches $1$ as $z\\to\\infty$; this, together with the divergence of $g(\\Theta)$ at $\\Theta\\to0^+$, forces a nontrivial solution at every positive infection rate. The prevalence is then controlled by $\\Psi_2(x)=2-2x\\ln(1+1/x)-\\frac{1}{1+x}$, which is nonnegative and makes $d\\rho/d\\lambda$ positive in both the original and modified models. These identities carry the analytic argument from the modified mean-field closure to a monotone prevalence and a peaked edge-infection probability.","core_discovery":"The paper establishes that replacing the standard heterogeneous mean-field closure $\\Theta = \\sum_k q(k)\\rho_k$ with the mitigated closure $\\Theta = \\sum_k q(k)\\rho_k(1-\\rho_k)$ leaves the zero-threshold property of scale-free networks intact while changing the shape of $\\Theta$. On a Barabási-Albert network the stationary condition becomes $\\Theta = \\lambda m\\Theta\\left[\\ln\\left(1+\\frac{1}{\\lambda m\\Theta}\\right)-\\frac{1}{1+\\lambda m\\Theta}\\right]$, and because the associated function $g(\\Theta)$ decreases from $+\\infty$ at $\\Theta\\to0^+$ and satisfies $g(1)<1$ for all $\\lambda m>0$, a nontrivial solution exists at every positive infection rate. The total prevalence $\\rho = 2(\\lambda m\\Theta)^2\\left[\\frac{1}{\\lambda m\\Theta}-\\ln\\left(1+\\frac{1}{\\lambda m\\Theta}\\right)\\right]$ is shown to be strictly increasing in $\\lambda$, using the positivity of $\\Psi_2(x)=2-2x\\ln(1+1/x)-\\frac{1}{1+x}$. Thus the mitigation factor caps the edge-level infection probability, producing a peak in $\\Theta$, but does not create an epidemic threshold and does not reverse the monotonic increase of overall prevalence.","pith_inferences":["On any finite network, or with a hard maximum degree, the divergence of $g(\\Theta)$ at $\\Theta\\to0^+$ is cut off, so a positive threshold is expected to reappear; the zero-threshold conclusion is tied to the unbounded power-law limit.","The peak in $\\Theta$ suggests a testable surveillance signature: the fraction of contacts that reach an infected person could start falling while total prevalence is still rising, if isolation intensifies with local infection burden.","The same logistic-suppression closure could be applied to quenched mean-field or temporal-network SIS dynamics, where the annealed approximation is relaxed; the monotonicity of prevalence and the location of the peak may change with degree correlations."],"forward_implications":["On a Barabási-Albert network with the continuous unbounded degree distribution $P(k)=2m^2/k^3$, the mitigated SIS model is endemic for every positive infection rate, so the epidemic threshold is $\\lambda_c=0$.","The probability $\\Theta$ of reaching an infected node along a randomly chosen edge is no longer monotonic: it rises to a peak and then decreases, a qualitative change from the original heterogeneous mean-field model.","The overall prevalence $\\rho$ remains a strictly increasing function of $\\lambda$ in both the original and mitigated models, despite the different behavior of $\\Theta$.","The suppressing factor $(1-\\rho_k)$ only becomes significant when a degree class is heavily infected, so the departure from the original model is small at low prevalence and large near saturation."],"supporting_citations":[{"why":"supplies the heterogeneous mean-field master equation and the definition of Theta for uncorrelated networks that the modified closure replaces.","marker":"[21]"},{"why":"establishes the original heterogeneous mean-field SIS behavior on scale-free networks, including the zero-threshold result that the mitigated model is compared with.","marker":"[22]"},{"why":"provides the logistic-growth idea that motivates the suppressing factor in the new closure.","marker":"[16]"},{"why":"is the earlier model in which infected individuals weaken their links, the alternative mitigation approach that the present paper contrasts with its own.","marker":"[15]"},{"why":"supplies the Barabási-Albert scale-free network construction and degree distribution used in the analytic calculations.","marker":"[9]"},{"why":"defines the excess-degree distribution q(k)=kP(k)/langle k rangle used in both the original and mitigated closures.","marker":"[6]"}],"fun_headline_variants":["Mitigation can't rescue scale-free networks from zero threshold","Mitigation doesn't create threshold in scale-free SIS","Zero threshold persists even with infected seclusion","Mitigation caps infected edge spread but not epidemic threshold"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The load-bearing premise is the annealed, uncorrelated heterogeneous mean-field approximation together with the continuous unbounded Barabási-Albert degree distribution $P(k)=2m^2/k^3$; if the network is finite or has degree-degree correlations, the zero threshold and the exact shape of $\\Theta$ do not follow.","fun_headline_variants_meta":{"raw":{"variants":["Mitigation can't rescue scale-free networks from zero threshold","Mitigation doesn't create threshold in scale-free SIS","Zero threshold persists even with infected seclusion","Mitigation caps infected edge spread but not epidemic threshold"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000617,"raw_usage":{"total_tokens":2848,"prompt_tokens":911,"completion_tokens":1937,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":527,"completion_tokens_details":{"reasoning_tokens":1886}},"tokens_in":527,"tokens_out":1937,"duration_ms":15058,"temperature":1.0,"reasoning_tokens":1886,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-10T21:33:36.609056+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"On a finite Barabási-Albert network with $N$ vertices (maximum degree of order $\\sqrt{N}$), solve the stationary condition with the discrete sum instead of the integral over the unbounded power law: if the numerical solution shows a positive threshold $\\lambda_c>0$ below which only the absorbing state exists, then the unbounded continuous approximation, not the mitigation mechanism alone, is producing the claimed zero threshold.","supporting_citations":[],"review_version":1}