{"id":"ba33b44a-38f3-40c4-be75-262fca1bfc28","arxiv_id":"1908.06147","paper_version":3,"verdict":"ACCEPT","confidence":"HIGH","novelty_score":6.0,"correctness_risk":"low","formal_verification":"none","parameter_count":0,"one_line_summary":"Shortening only distant contacts stops an SIR epidemic whenever the density of close contacts is below f1 < Tc/β.","lead":"This paper models a disease spreading through a population in which some contacts are long (close) and others short (distant), and studies what happens when public health policy shortens only the distant contacts. It derives a simple rule: if the fraction of close contacts is below a threshold set by the network and the disease, this targeted strategy can always push the outbreak below the epidemic threshold.","discovery_kind":"extension","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The headline threshold f̃1=Tc/β is derived for tr=1; for tr>1 the correct a1=0 condition is f1 < Tc/[1-(1-β)^{tr}], so the abstract overstates controllability.","rationale":"The reader's weakest assumption concerns the locally tree-like, degree-uncorrelated network approximation. That is a valid limitation but not the most load-bearing issue on the paper's own terms. The sharper problem is that the headline threshold f̃1=Tc/β is only derived for tr=1, while the abstract and conclusions present it without qualification, and the paper itself extends the analysis to tr>1 in Fig. 5. For tr>1, the close-contact transmissibility at a1=0 is 1-(1-β)^{tr}, which exceeds β, so the true existence condition for ã2 is f1 < Tc/[1-(1-β)^{tr}], a strictly smaller bound. This is a concrete, checkable overgeneralization of the central claim. The core mathematics for tr=1 appears correct, so the paper should be accepted only after the threshold is restated with its tr=1 qualifier and, ideally, with the correct tr-dependent expression for the generalized case.","tokens_in":10246,"tokens_out":14075,"duration_ms":138877,"concrete_test":"Re-derive the a1=0 threshold for tr=5 using T0(tr)=1-(1-β)^{tr} in place of β, for the ER network of Fig. 5(b) (⟨k⟩=4, β=0.5, Tc=0.25). If f1=0.4 yields no positive solution for a2 in the corrected equation, while f1=0.4 lies below the published Tc/β=0.5, the abstract's unqualified threshold is false for tr=5. Optionally confirm by SIR simulation: fix f1=0.4, a1=0, tr=5 and scan a2; the epidemic size should remain above the outbreak cutoff for all a2, contradicting the unqualified claim.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central cutoff f̃1=Tc/β comes from Eq. (4), which is explicitly derived for tr=1. For general recovery time, the a1=0 (maximal close-contact) transmissibility is T0(tr)=1-(1-β)^{tr}, not β. Replacing β in Eq. (4) by T0(tr) gives existence of ã2 only when f1 < Tc/T0(tr), which is strictly smaller than Tc/β because T0(tr)>β for tr>1. The abstract and Sec. V state f̃1=Tc/β without this qualifier, and Fig. 5 extends results to tr=5. Concretely, for an ER network with ⟨k⟩=4, β=0.5 and tr=5, Tc=0.25, so Tc/β=0.5 while Tc/T0(5)=0.25/0.96875≈0.258. Thus for f1=0.4 the abstract's criterion predicts that making close contacts maximally long can still be compensated by shortening distant contacts, but no finite a2 solves the corresponding equation because f1T0(5) already exceeds Tc. This is an internal overgeneralization of the paper's own headline result, not merely a robustness issue.","agreement_with_reader":"disagree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript studies an SIR epidemic model on configuration-model networks in which edges carry one of two disorder classes: close contacts (fraction f1, disorder intensity a1) and distant contacts (fraction 1-f1, intensity a2 > a1). Contact-time disorder enters through per-link transmission weights beta*omega with omega drawn from P(omega)=1/(a omega). The authors propose mitigating epidemics by increasing a2, i.e., shortening distant contacts, and use the transmissibility-based mapping to bond percolation to derive a critical a2^c(a1). For tr=1 they show that as a1 tends to 0 the critical curve approaches a finite a2_tilde, which exists iff f1 < Tc/beta = f1_tilde; hence if close contacts are sufficiently rare, shortening distant contacts can move the system to the non-epidemic phase even when close contacts have maximal duration. They illustrate the phase boundary on the (a1,a2) plane for ER and SF networks, compare tr=1 and tr=5, and consider an empirically motivated P'(omega) proportional to omega^{-1.6} distribution for close contacts.","tokens_in":10502,"tokens_out":7158,"duration_ms":68107,"significance":"If correct within its stated locally tree-like, uncorrelated-network assumptions, the paper provides a simple and falsifiable design rule for social-distancing interventions: in the tr=1 case explicitly derived, only the density of unmodifiable close contacts, not their duration, determines whether shortening distant contacts can eliminate an epidemic. The derivation is parameter-free in the sense that the threshold is expressed in terms of the percolation critical point Tc and the virulence beta, and the simulation-theory agreement in Fig. 2 supports the percolation mapping. The paper is appropriately careful about its modeling assumptions: it restricts the theoretical analysis to configuration-model, locally tree-like networks in the thermodynamic limit, so the numerical threshold is a model prediction rather than a universal constant. The main weakness is that the headline threshold is stated without the tr=1 qualification and is then used in a context where the paper itself extends to tr=5.","major_comments":[{"comment":"The headline threshold f1_tilde = Tc/beta is derived under the explicit assumption tr=1, but the abstract and conclusions state it without this qualification, and Fig. 5 extends the analysis to tr=5. For tr>1, the transmissibility of an a1=0 close contact is T0(tr)=1-(1-beta)^tr, not beta. Replacing beta by T0(tr) in Eq. (4) gives existence of a2_tilde only when f1 < Tc/T0(tr). Since T0(tr)>beta for tr>1, the stated threshold overestimates the allowable density of close contacts. For example, for an ER network with <k>=4 (kappa=5, Tc=0.25), beta=0.5, and tr=5, Tc/beta=0.5 while Tc/T0(5)=0.25/0.96875 approximately 0.258. For f1=0.4 the abstract's criterion predicts controllability, yet no finite a2 satisfies the a1=0 critical equation because f1*T0(5) already exceeds Tc. Equation (5) has the same issue. The paper should state that f1_tilde = Tc/beta applies to tr=1 and, if the general case is to be covered, derive the general condition f1 < Tc/[1-(1-beta)^tr].","section":"Abstract; Sec. III, Eq. (4); Sec. V; Fig. 5"}],"minor_comments":[{"comment":"The simulation points in Fig. 2 have no error bars, and only one ER network case is reported despite the text describing 'extensive simulations'; adding error bars and at least one SF-network simulation would strengthen the empirical support.","section":"Sec. II, Fig. 2"},{"comment":"The phase diagrams in Figs. 3 and 5 are theoretical curves; no direct simulation of the phase boundary is reported, so the text should state explicitly that the phase boundaries are predictions of the percolation mapping rather than direct simulation results.","section":"Sec. III, Figs. 3 and 5"},{"comment":"Equation (2) is imported from Ref. [34] without derivation; since it is central to the critical-condition analysis, a short derivation or an appendix would make the paper self-contained.","section":"Sec. II, Eq. (2)"},{"comment":"The notation T_{a_i} in Eq. (2) does not show the dependence on beta and tr; writing T_{a_i}(beta, tr) would make the tr=1 restriction in Eqs. (3)-(5) and the tr=5 generalization in Fig. 5 easier to follow.","section":"Sec. III, Eq. (4)"}],"recommendation":"major_revision","confidential_remarks":"The central transmissibility formula Eq. (2) comes from Ref. [34], which shares authors with this manuscript. I do not view this as a problem because the formula is consistent with the Reed-Frost limit, but the tr>1 overgeneralization of the threshold is a genuine internal inconsistency that should be corrected before publication."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Colleague, here's my read. The paper gives a clean branching-theory result for the SIR model on configuration networks with two classes of contacts (close and distant). For tr=1 it derives a simple condition f1 < Tc/β under which shortening only distant contacts can push the system to the non-epidemic phase, even when close contacts are maximally transmissible. That condition is correct for tr=1, and the single simulation comparison (Fig. 2) matches the percolation prediction well. The two-disorder model itself is new relative to the authors' earlier single-disorder work, and the Sec. IV comparison with the ω^{-1.6} distribution is a nice touch.\n\nThe problem is the generalization to tr>1. Eq. (3) is explicitly for tr=1, and in the a1→0 limit the close-contact transmissibility is β for tr=1 but T0(tr)=1-(1-β)^tr for general tr. So the actual threshold for tr>1 is f1 < Tc/T0(tr), not Tc/β. The abstract and Sec. V state f̃1=Tc/β without any tr qualifier, and Fig. 5 shows tr=5 phase diagrams. For an ER network with ⟨k⟩=4, β=0.5, tr=5, Tc=0.25, Tc/β=0.5 while Tc/T0(5)≈0.258. A population with f1=0.4 would be declared controllable under the paper's headline criterion, but actually the close contacts alone already put the system past the epidemic threshold, so no amount of shortening distant contacts helps. This is not a robustness nit; it's an overstatement of the paper's main practical message.\n\nMinor issues: the phase diagrams in Figs. 3 and 5 are theoretical only, with no direct simulation, and Fig. 2 has no error bars. These are acceptable in a theory paper. The locally tree-like assumption is standard and acknowledged.\n\nBottom line: the tr=1 result is worth publishing, and the paper deserves a serious referee. But the abstract and conclusions need correction to the tr-dependent threshold before I'd sign off. The authors should either state the general formula or restrict the f̃1 claim to tr=1.","headline":"The central mitigation threshold f̃1=Tc/β is derived and correct for tr=1, but the abstract and conclusions overgeneralize it to tr>1, where the correct bound is Tc/[1-(1-β)^tr]; the paper needs that correction.","tokens_in":11035,"tokens_out":4225,"would_cite":true,"duration_ms":37794,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":["92D30","05C82"],"pacs":["89.75.Fb","87.19.Xx"],"model":"deepseek-v4-flash","headline":"This paper shows that in the two-disorder SIR model on locally tree-like networks, shortening distant contacts can move an epidemic to the non-epidemic phase whenever the density $f_1$ of close contacts is below $T_c/\\beta$, even if close…","keywords":["complex networks","epidemic modeling","percolation","SIR model","disorder","social distancing","contact times","critical threshold"],"falsifier":"Run the same two-disorder SIR dynamics on a configuration-model network modified to include a measured level of clustering (for example, by adding triangles or household structure) and check whether increasing $a_2$ still suppresses the epidemic when $f_1 < T_c/\\beta$. If clustering raises the effective threshold enough that epidemics survive, the locally tree-like percolation mapping is the load-bearing assumption that would need modification.","tokens_in":10066,"feed_emoji":"🦠","tokens_out":8429,"duration_ms":73881,"temperature":0.7,"pith_summary":"This paper studies the SIR epidemic model on networks where every contact carries a duration-dependent infection probability, divided into close contacts (long average duration) and distant contacts (short average duration). It asks whether a mitigation strategy that only shortens distant contacts, leaving close contacts untouched, can push a disease below the epidemic threshold. Using branching theory and link percolation, supported by simulations on random and scale-free networks, the authors find a density threshold $\\tilde f_1 = T_c/\\beta$: when the fraction $f_1$ of close contacts is below it, shortening distant contacts can always be chosen to reach an epidemic-free phase, even in the extreme case where close contacts transmit with probability $\\beta$. This makes the strategy most useful precisely when the number of unavoidable close relationships is small.","feed_headline":"Shortening distant contacts can halt epidemics below a density threshold","feed_subtitle":"A branching-theory threshold shows when cutting brief interactions alone pushes the SIR model into the epidemic-free phase.","key_machinery":"The machinery is the mapping of the SIR model onto link percolation: the average transmissibility of the disordered network is identified with the bond-occupation probability $p$, and the epidemic threshold is the percolation threshold $p_c = T_c = 1/(\\kappa-1)$ on locally tree-like networks. The branching-process equations $f_\\infty = 1 - G_1(1-p f_\\infty)$ and $P_\\infty = 1 - G_0(1-p f_\\infty)$ then give the final epidemic size. Disorder enters through the weighted average $T = f_1 T_{a_1} + (1-f_1) T_{a_2}$, where $T_{a_i}$ is the single-disorder transmissibility of Eq. (2). Solving the threshold equation (3) for $a_{2c}$ produces the phase diagram, and its limit $a_1\\to 0$ yields Eq. (4), whose solvability is the condition for the mitigation strategy to exist.","core_discovery":"The central discovery is a critical condition for epidemic control in a network with two classes of contact duration. With average transmissibility $T = f_1 T_{a_1} + (1-f_1) T_{a_2}$ and epidemic threshold $T_c = 1/(\\kappa-1)$, increasing the disorder intensity $a_2$ of distant contacts brings the system into the non-epidemic phase if and only if $f_1 < T_c/\\beta$. In that regime Eq. (4), $T_c = f_1\\beta + (1-f_1)\\beta (1-e^{-\\tilde a_2})/\\tilde a_2$, has a finite solution $\\tilde a_2$ even at $a_1=0$, so the strategy works no matter how long close contacts last. For $f_1 > T_c/\\beta$, the strategy works only when close contacts are already sufficiently short; otherwise there is a minimum close-contact intensity $a_{1m}$ below which no finite shortening of distant contacts prevents an epidemic. The phase diagram is verified by simulations on homogeneous random networks and truncated scale-free networks, and the qualitative conclusions survive for recovery times $t_r>1$ and for the experimentally motivated distribution $P'(\\omega)\\propto \\omega^{-1.6}$.","pith_inferences":["Beyond the paper, the threshold $\\tilde f_1 = T_c/\\beta$ suggests an actionable planning rule: estimate $T_c$ from the contact network and $\\beta$ from the pathogen, measure the close-contact fraction $f_1$, and only then commit to a distant-contact shortening policy.","The comparison with $P'(\\omega)\\propto \\omega^{-1.6}$ implies that in populations with strongly right-skewed contact durations, suppression may be easier than the uniform power-law model predicts; individual-level contact data could be used to test which distribution governs the strategy's critical line.","Because the argument is just a weighted-transmissibility substitution in the percolation mapping, the same threshold logic should transfer to other spreading processes that share the bond-percolation representation, such as information or computer-virus propagation on weighted networks, provided transmissibility is duration-dependent.","Interventions that reduce the effective virulence $\\beta$ (masks, ventilation, vaccination) would raise the permissible close-contact density $\\tilde f_1$, so combining them with distant-contact shortening should widen the non-epidemic region more than either measure alone."],"forward_implications":["If $f_1 < \\tilde f_1 = T_c/\\beta$, shortening distant contacts alone can move the system from any epidemic point in the $(a_1,a_2)$ plane to the non-epidemic phase, including the limit $a_1=0$ where close contacts have maximal transmissibility.","The required shortening of distant contacts shrinks as the density of close contacts decreases, so the strategy is most efficient in populations where unavoidable close ties are a minority.","For $f_1 > \\tilde f_1$, the strategy has a limitation: it works only when close-contact durations are already below a minimum value $a_{1m}$; otherwise no reduction of distant contacts suffices.","Longer recovery times widen the epidemic phase, meaning the same strategy demands stronger reductions in distant-contact duration for diseases with longer infectious periods, although the qualitative phase structure is unchanged.","Heterogeneous scale-free networks require larger reductions of distant contacts than homogeneous random networks, because hubs accelerate transmission once infected."],"supporting_citations":[{"why":"Provides the SIR-to-link-percolation mapping and the epidemic threshold $T_c = 1/(\\kappa-1)$ used throughout the theory.","marker":"[10]"},{"why":"Introduces the power-law contact-time distribution $P(\\omega)=1/(a\\omega)$ and the disorder-intensity parameter used to model close and distant contacts.","marker":"[27]"},{"why":"Supplies the single-disorder transmissibility formula $T_{a_i}$, Eq. (2), from which the two-class average transmissibility is built.","marker":"[34]"},{"why":"Supplies the configuration-model construction used to generate the random and scale-free networks for the simulations.","marker":"[35]"},{"why":"Provides empirical face-to-face contact data that motivate the heterogeneous two-type interaction assumption and the $\\omega^{-1.6}$ distribution.","marker":"[31]"},{"why":"Provides the branching-process percolation framework used to derive the theoretical phase boundary and final epidemic size.","marker":"[15]"}],"fun_headline_variants":["Cut distant contacts alone to stop epidemics below a density threshold","Distant-contact shortening stifles epidemics when close contacts are rare","Cutting distant interactions alone stops outbreaks below a close-contact threshold","When close contacts are sparse, shortening distant ones stops epidemics","Epidemic-free phase via distant-contact cuts below a close-contact density threshold"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The phase boundary is computed by identifying the average transmissibility with the percolation probability and using the threshold $T_c=1/(\\kappa-1)$, which is exact only for locally tree-like, degree-uncorrelated configuration-model networks in the thermodynamic limit; real contact networks with clustering and household structure could shift this number.","fun_headline_variants_meta":{"raw":{"variants":["Cut distant contacts alone to stop epidemics below a density threshold","Distant-contact shortening stifles epidemics when close contacts are rare","Cutting distant interactions alone stops outbreaks below a close-contact threshold","When close contacts are sparse, shortening distant ones stops epidemics","Epidemic-free phase via distant-contact cuts below a close-contact density threshold"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.001204,"raw_usage":{"total_tokens":4980,"prompt_tokens":983,"completion_tokens":3997,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":599,"completion_tokens_details":{"reasoning_tokens":3910}},"tokens_in":599,"tokens_out":3997,"duration_ms":25176,"temperature":1.0,"reasoning_tokens":3910,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T12:54:47.331102+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run the same two-disorder SIR dynamics on a configuration-model network modified to include a measured level of clustering (for example, by adding triangles or household structure) and check whether increasing $a_2$ still suppresses the epidemic when $f_1 < T_c/\\beta$. If clustering raises the effective threshold enough that epidemics survive, the locally tree-like percolation mapping is the load-bearing assumption that would need modification.","supporting_citations":[{"cited_title":"Greger, Crit","cited_arxiv_id":null,"evidence_quote":"Provides the SIR-to-link-percolation mapping and the epidemic threshold $T_c = 1/(\\kappa-1)$ used throughout the theory."},{"cited_title":"Lagorio, M","cited_arxiv_id":null,"evidence_quote":"Introduces the power-law contact-time distribution $P(\\omega)=1/(a\\omega)$ and the disorder-intensity parameter used to model close and distant contacts."},{"cited_title":"Stehle´ e, A","cited_arxiv_id":null,"evidence_quote":"Supplies the single-disorder transmissibility formula $T_{a_i}$, Eq. (2), from which the two-class average transmissibility is built."},{"cited_title":null,"cited_arxiv_id":null,"evidence_quote":"Supplies the configuration-model construction used to generate the random and scale-free networks for the simulations."},{"cited_title":"Eastwood, D","cited_arxiv_id":null,"evidence_quote":"Provides empirical face-to-face contact data that motivate the heterogeneous two-type interaction assumption and the $\\omega^{-1.6}$ distribution."}],"review_version":1}