Pith.

Statistical Mechanics · arXiv:2611.16325 v1 · submitted 12 Nov 2026 · 22 references

Optimal staircase structure for bacterial adaptation in antibiotic landscapes

Kento Matsukawa, Shin-ichi Sasa, Namiko Mitarai

The paper says

“Spatial heterogeneity in antibiotic environments drives the evolution of bacterial resistance. However, how the discrete structure of these environments controls the time required for adaptation of bacteria remains unclear.”

more of the abstract

We study this question using a stochastic model on a two-dimensional lattice whose axes represent physical space and phenotype space, comparing different numbers of steps while holding the overall spatial and concentration ranges fixed and scaling the migration and mutation rates by their end-to-end first-passage times. We find that increasing the number of steps accelerates the search for the next adapted state but increases the cumulative cost of repeated population saturation; this competition can produce an optimum at an intermediate number of steps. Direct Gillespie simulations reproduce the predicted dependence of the adaptation time on the number of steps, providing testable predictions for how discrete environmental structure shapes the timescale of evolutionary adaptation.

from the abstract

Pith says

Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person

It can be wrong. Challenge this review or reply to it.

Holds up, with conditions. Solid theoretical extension of the staircase model with a clear trade-off and scaling law; the simulation validation is narrower than the claims warrant. This line is wrong

4 major objections · 10 minor

How often objections from reviews like this one are right: not yet measured

Are you an author? What you can do.

Not checked: figures, code, what the 22 references say.

The paper says, at §IV D 1, Fig. 4

The review did not quote this passage.

Pith says: Objection 1 of 4 · major

The validation of the analytical FAT expression against Gillespie simulations is limited to six parameter sets with k ≤ 10. The paper's central claim—the existence and scaling of an optimal k*—relies on the analytical expression (Eq. 18) for larger k (k* can exceed 10, as seen in Fig. 5).

more of objection 1

The simulations do not probe the regime where the optimum is predicted (e.g., k* > 10, large K0, small μ, v). The authors acknowledge this implicitly by using the analytical expression for the scaling plot (Fig. 5) and the speedup map (Fig. 3), but the lack of direct simulation support for the optimum at larger k is a significant gap. The paper should either provide simulation evidence for at least one parameter set where k* > 10, or explicitly discuss why the analytical expression is expected to remain reliable in that regime despite the approximations (constant N, Laplace approximation, neglect of clonal interference).

The paper says, at §III A, Eq. (13); §IV D 1, Fig. 4

The review did not quote this passage.

Pith says: Objection 2 of 4 · major

The Laplace approximation used to derive T_adapt (Eq. 13) assumes a ≫ 1, where a = μ_k N / (r' - μ_k). The paper notes that at k=1 for the parameter sets in Figs. 4(a)–(c), a ≃ 4.5, which is marginal.

more of objection 2

While the discrepancy between the numerical and approximate T_adapt is only 5.4% in those cases, the approximation is used to derive the scaling law (Eq. 24) and the speedup map (Fig. 3). The paper should quantify how the error in T_adapt propagates to the predicted k* and the scaling exponent, especially for parameter sets where a is not large (e.g., a ~ 10). A sensitivity analysis or a bound on the error would strengthen the claim.

The paper says, at §III B, Appendix C

The review did not quote this passage.

Pith says: Objection 3 of 4 · major

The derivation of T_sat (Eq. 16) neglects paths where the population size decreases (Appendix C, Eq. C6). The authors state that this approximation is not uniformly valid for i ∼ N but claim the effect on T'_sat is small based on numerical checks.

more of objection 3

However, no numerical evidence is provided in the manuscript. Given that T_sat contributes significantly to FAT for larger k (the saturation term grows as k ln(K0/k)), the accuracy of this approximation should be tested, at least for a representative parameter set. The paper should include a comparison of the approximate T_sat with the exact numerical solution of the birth–death process (or with simulation) for a few cases.

The paper says, at §IV A, Eq. (20); §IV B, Eq. (24)

The review did not quote this passage.

Pith says: Objection 4 of 4 · major

The asymptotic criterion for an interior optimum (Eq. 20) and the scaling law (Eq. 24) are derived under the assumption v k^2 ≪ d and d ≪ r. The paper then uses these to produce Fig. 5, which shows agreement between the numerical minimization of Eq.

more of objection 4

(18) and the 1/3 power law. However, the parameter sets in Fig. 5 are filtered to satisfy k* < 0.9 k_max, which ensures v (k*)^2 ≪ d is not necessarily satisfied for all points (since k_max ~ sqrt(2d/v), so k* < 0.9 sqrt(2d/v) implies v (k*)^2 < 1.62 d, not necessarily ≪ d). The paper should clarify the range of validity of the scaling and discuss whether deviations from the 1/3 slope are expected when v (k*)^2 is not negligible compared to d.

10 minor objections

The paper says, at §II, Eq. (1) and (2)

Pith says: minor objection 1 of 10

The scaling relations v_k = k(k+1) v / 2 and μ_k = k(k+1) μ / 2 are derived from the first-passage time of a single bacterium. It would be helpful to note explicitly that this scaling assumes symmetric nearest-neighbor transitions and that the end-to-end first-passage time is τ_k = k(k+1)/(2 v_k). The derivation in Appendix B is clear, but a brief comment in the main text would improve readability.

The paper says, at §III A, Eq. (8)

Pith says: minor objection 2 of 10

The master equation (8) uses r' = d + 2 v_k and δ = d + 2 v_k + μ_k. The notation is a bit confusing: r' is not a division rate but a loss rate. Consider renaming to avoid confusion with the division rate r.

show 8 more

The paper says, at §III B, Eq. (17)

Pith says: minor objection 3 of 10

The expression for T_sat includes a term C T_adapt, where C is defined in Eq. (D11). The constant C is derived in the limit K0 → ∞. The paper should note that for finite K0, C may differ, and quantify the error if possible.

The paper says, at §IV D 1, Fig. 4

Pith says: minor objection 4 of 10

The figure caption says the blue solid curve is the result of computing Eq. (18) with Eqs. (12) and (14) evaluated by numerical integration. But Eq. (18) already includes the Laplace approximation; the numerical integration replaces the Laplace approximation for T_adapt and T_readapt.

more of objection 4

The description is slightly ambiguous. Clarify that the blue curve uses numerical integration of the exact survival probability (Eq. 9) to compute T_adapt and T_readapt, while the orange curve uses the approximate closed forms (Eqs. 13 and 15).

The paper says, at §IV D 2, Fig. 5

Pith says: minor objection 5 of 10

The figure shows the scaling of k*+1 vs r^2/(μ v K0) with a fitted line of slope 1/3. The intercept is not given; providing the fitted constant A in Eq. (24) would be useful for reproducibility. Also, the parameter range for Fig. 5 is K0 ∈ (10^9, 10^10), which is larger than the K0 used in the simulations (10^6–10^8). This is fine, but the paper should note that the scaling is tested only in the regime of very large K0.

The paper says, at §V A, Appendix F

Pith says: minor objection 6 of 10

The discussion of the geometric mean in Appendix F is helpful. However, the AND circuit model assumes that the intermediate state is reached before the goal, which corresponds to the sequential mutation–migration process. The paper should note that this is an idealization; in the actual model, mutation and migration can occur in any order, but the dominant path is mutation first then migration (as argued in Ref. [5]).

The paper says, at General

Pith says: minor objection 7 of 10

The paper uses the term 'FAT' for first-arrival time. This is fine, but it might be confused with 'fitness-associated trait' in some contexts. Consider spelling out 'first-arrival time' at first use and using 'FAT' thereafter.

The paper says, at §II, Fig. 1

Pith says: minor objection 8 of 10

Figure 1 is a schematic of the staircase model. It would be helpful to label the axes more clearly (e.g., 'Patch i' and 'Phenotype p') and to indicate the direction of increasing antibiotic concentration.

The paper says, at §IV D 1, Fig. 4

Pith says: minor objection 9 of 10

The error bars for the Gillespie simulations are said to be mostly smaller than the plotting symbols. It would be useful to report the standard deviation or coefficient of variation of the FAT across trials, as the standard error of the mean can be small due to 300 trials even if the distribution is broad.

The paper says, at §V B

Pith says: minor objection 10 of 10

The limitations section is thorough. One additional limitation worth mentioning is the assumption of symmetric mutation and migration rates; the paper does mention this. Also, the assumption that the population at each step reaches local saturation before the next adaptation occurs (sequential adaptation) is central and is stated, but the paper could briefly discuss the conditions under which this assumption might break down (e.g., high mutation supply, clonal interference) and how the results would change.

What would settle it

Perform Gillespie simulations for at least three parameter sets where the analytical expression predicts a clear interior optimum with k* > 10 (e.g., from the regime of Fig. 5, with r=1, d=0.1, K0=10^9, μ=10^{-9}, v=10^{-6}, giving r^2/(μvK0) ~ 10^6, predicted k*+1 ~ 100). For each set, simulate FAT(k) for k = 1, 5, 10, 20, 50, 100, 200 (or up to kmax) with at least 300 independent trials per k. Compare the simulated FAT values to the analytical Eq. (18) and to the numerically evaluated theory (blue curve in Fig. 4). If the simulated minimum occurs at a k that differs from the analytical prediction by more than a factor of 2, or if no minimum is observed, then the analytical derivation is not reliable in the regime where the scaling law is claimed to hold.

from the skeptic's reading

How the review went

4 readings by deepseek-v4-flash · 13 Nov 2026

  1. Reader holds up, with conditions confidence high
  2. Skeptic partly agrees 12 s · 20,344 tokens read, 1,104 written
  3. Editor wrote the verdict above 10 s · 21,365 tokens read, 646 written
  4. Referee major revision: 4 major objections, 10 minor 20 s · 20,766 tokens read, 2,426 written

Not run on this paper: the simulated authors' defence.

Pith did not check this review's objections against the paper.

The review in full

The review in brief, machine-written

This paper extends the Hermsen et al. staircase model by treating the number of steps k as a control parameter, holding the overall spatial and concentration ranges fixed, and scaling migration and mutation rates to keep end-to-end first-passage times constant. The central result is that the mean first-arrival time (FAT) can be minimized at an intermediate k, with a scaling law k*+1 ~ (r2/(μ v K0))1/3. This is a clean theoretical extension and the trade-off between search time (which decreases with k) and saturation cost (which increases with k) is physically intuitive.

The paper does several things well. The analytical derivation is laid out in detail, with appendices covering the first-passage time calculations, the saturation time, and the Laplace approximation. The authors are upfront about their assumptions: sequential adaptation, strong-selection weak-mutation regime, constant population size approximation, and the regime conditions r > d+2vk and d > vk >> μk. They also discuss limitations—fitness costs, asymmetric rates, well-mixed patch assumption—in a dedicated section. The scaling analysis is internally consistent: the numerical minimization of the analytical expression (Eq. 18) over a broad parameter range yields points that fall on the predicted 1/3 slope (Fig. 5).

The soft spots are in the validation. The Gillespie simulations cover only six parameter sets with k up to 10, and the analytical expression overestimates FAT by up to 50% in those tests. The scaling law for k* is derived from and compared to the same approximate analytical expression, not to independent simulations or data. The paper acknowledges that the Laplace approximation parameter a is only ~4.5 at k=1 for some parameter sets, which is marginal for a >> 1. The stress-test note about the constant-population approximation not being tested in the regime where the optimum is predicted (k* > 10, large K0, small μ, v) is a fair concern. The paper does not provide a sensitivity analysis or error bounds on Eq. 18.

Who is this for? Researchers in evolutionary dynamics who work on spatial structure and antibiotic resistance. The paper is a solid theoretical contribution within an established program. It deserves a serious referee—the math is careful, the assumptions are stated, and the result is nontrivial. But the referee should push for more extensive simulation validation, especially in the regime where the optimum is predicted, and for a discussion of how the approximations might affect the predicted scaling.

Recommendation: send to peer review. The paper is not ready as is—the simulation support is too thin—but the theoretical core is worth engaging with.

The strongest objection

The central result—the existence and scaling of an optimal number of steps k*—rests on the analytical expression for FAT(k), Eq. (18). This expression is derived under several approximations: (i) the population at each step is treated as constant at its saturated size N (Eq. (5)), neglecting demographic fluctuations; (ii) the Laplace approximation (a ≫ 1) is used to evaluate the adaptation time T_adapt; (iii) the saturation time T_sat is derived from a birth–death process that neglects mutation and approximates the inverse generator by keeping only the leading term (Appendix C, Eq. (C6)). The paper tests Eq. (18) against Gillespie simulations for only six parameter sets, with k ≤ 10 and a limited range of parameters (Figs. 4a–f). In these tests, the approximate analytical expression systematically overestimates FAT by up to 50% (ratio 1.0–1.5). More importantly, the scaling law for k* (Eq. (24)) and the speedup map (Fig. 3) are derived entirely from Eq. (18) and are not validated by simulations in the regime where the optimum is predicted (e.g., k* > 10, large K0, small μ, v). The paper acknowledges that the Laplace approximation parameter a is only ~4.5 at k=1 for the parameter sets in Figs. 4(a)–(c), which is marginal for a ≫ 1. The paper also notes that the saturation time approximation neglects paths where the population size decreases (Appendix C), and that this approximation is not uniformly valid for i ∼ N. These approximations are load-bearing because the existence and location of the optimum depend on the balance between the search time (∼ k^{-1/2}) and the saturation time (∼ k ln(K0/k)). If the approximations systematically bias either term, the predicted optimum could shift or disappear. The paper does not provide a sensitivity analysis or error bounds on Eq. (18).

The reader's verdict is CONDITIONAL with high confidence, citing the limited simulation test (six parameter sets, k ≤ 10) and the reliance on approximations. The reader's weakest_assumption is the sequential-adaptation assumption (no clonal interference). While that is a valid concern, the paper explicitly acknowledges this regime and states it is not considered. My stress-test focuses on a different, more concrete load-bearing concern: the analytical derivation itself is tested only in a narrow parameter range, and the approximations (constant population, Laplace method, saturation time) are not validated in the regime where the scaling law for k* is predicted. The paper's own Fig. 4 shows that the approximate analytical expression (orange dashed) systematically overestimates FAT compared to the numerically evaluated theory (blue solid) and the Gillespie simulations, with discrepancies up to 50%. The paper attributes this to the Laplace approximation being marginal (a ~ 4.5) for some parameter sets. However, the scaling law (Fig. 5) and the speedup map (Fig. 3) are based entirely on the approximate analytical expression, not on the numerically evaluated theory or simulations. The paper does not test whether the approximations affect the location of the minimum. The concrete test I propose would directly check whether the predicted optimum exists and scales as predicted in the regime where the theory is claimed to apply. This is a concrete, feasible computational test that would settle whether the central claim is robust. I partially agree with the reader because the reader's weakest_assumption (sequential adaptation) is a different concern, but my concern is more specific and testable. The verdict should remain CONDITIONAL because the paper's central claim is not yet fully validated, but the condition is more specific: the analytical derivation needs to be tested in the regime where the scaling law is predicted, not just in the limited simulation range shown.

The referee's report

The paper addresses a timely question in evolutionary dynamics: how the discretization of a spatial antibiotic gradient affects the speed of resistance evolution. The central idea—that an intermediate number of steps can optimize adaptation time—is novel and potentially testable. The analytical derivation is detailed and self-contained, with careful treatment of the scaling of rates to keep end-to-end first-passage times fixed. The paper provides a falsifiable scaling prediction (Eq. 24) and identifies the key dimensionless parameter controlling the optimum. If the result holds under more realistic conditions (fitness costs, asymmetric rates, spatial structure), it could inform the design of antibiotic landscapes to slow resistance evolution. The authors are transparent about limitations and assumptions.

Pith's reading of the paper (a machine's summary, not the authors')

This paper studies how the number of discrete steps in a spatial antibiotic gradient affects the time it takes for a bacterial population to evolve full resistance. The authors extend a known staircase model to treat the number of steps as a control parameter, while holding the total spatial extent and concentration range fixed. They derive an approximate analytical expression for the mean first-arrival time at the fully resistant state, decomposing it into a search time for each new adapted mutant and a saturation time for the population to fill each patch. The competition between these two contributions—faster per-step search when steps are many, but more saturation events—produces an optimal intermediate number of steps that minimizes the total adaptation time. The optimum scales as k*+1 ~ ($r^{2}$/(μ v K0))^{1/3}, where r is the division rate, μ and v are mutation and migration rates, and K0 is the total carrying capacity. Direct Gillespie simulations support the predicted dependence, including the location of the optimum.

What carries the argument. The central object is the staircase model on a two-dimensional lattice (physical patch i, resistance phenotype p), where bacteria migrate along the physical axis and mutate along the phenotype axis, with division possible only when i ≤ p. The key machinery is the decomposition of the adaptation time into per-step search time (first-passage time for a mutant to appear and migrate) and per-step saturation time (time for the population to grow to carrying capacity), and the scaling relations v_k = k(k+1)v/2 and μ_k = k(k+1)μ/2 that keep the mean single-bacterium first-passage times independent of k when the number of steps k is varied. The competition between the search time (which decreases as $k^{{-1/2}}$) and the saturation time (which increases as k ln(K0/k)) yields the optimum.

Core claim. The paper claims that the mean first-arrival time (FAT) for a bacterial population to evolve full resistance across a discretized antibiotic gradient can be minimized at an intermediate number of steps k*, and this optimum scales as k*+1 ~ ($r^{2}$/(μ v K0))^{1/3} in the asymptotic regime where v $k^{2}$ << d and d << r. The discovery is that the competition between faster per-step search (due to increased mutation and migration rates when the gradient is more finely resolved) and the cumulative cost of repeated population saturation can produce a non-monotonic FAT, with a minimum at an intermediate resolution. This is an extension of the staircase model, which previously treated the number of steps as given, to treat k as a control parameter, revealing an optimal discretization.

The premise it rests on. The population must reach local saturation at each step before the next adaptation occurs (sequential adaptation), which requires that mutations are rare compared to migration and that clonal interference is absent; the paper states that this regime, known as strong-selection weak-mutation, is assumed and that clonal interference is not considered.

If the paper is right (Pith's inferences, not the authors')

If the optimal staircase exists, then antibiotic gradients with an intermediate number of discrete concentration steps should produce faster resistance evolution than either a single step (sharp boundary) or a very finely resolved gradient.

The scaling law k*+1 ~ (r^2/(μ v K0))^{1/3} provides a testable prediction: the optimal number of steps decreases when the product μ v K0 is large (fast adaptation) and increases when the intrinsic growth rate r is large.

The analytical expression for FAT at k=1 can be used to estimate the effective mutation rate μ from experimentally measured adaptation times, if the other parameters are independently known.

The model predicts that the speedup ratio FAT(1)/FAT(k*) can be substantial (up to ~5 in the explored parameter range), implying that staircase design could be relevant for understanding and possibly controlling resistance evolution in spatially structured environments.

The result suggests that in natural or clinical antibiotic gradients, the spatial discretization (e.g., patchiness of drug concentration) could be an underappreciated factor controlling the speed of resistance evolution. If the gradient is too fine-grained, the repeated population saturation cost dominates; if too coarse, the search for the next mutant is slow.

The scaling law might be testable in microfluidic devices where the number of discrete concentration steps can be engineered, providing a direct experimental test of the trade-off between search and saturation.

The assumption that the population saturates locally before the next adaptation step (strong-selection weak-mutation regime) is the load-bearing premise; if clonal interference or multiple mutations arise, the decomposition fails and the optimum may shift or disappear.

Check this review

Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.

How often reviews like this one are right

Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.

How often objections from reviews like this one are right: not yet measured

Every value above, in the review's public record (JSON)

Reviews by people

This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.

Request a human review

How Pith checks papers · The full audit of this paper

The paper

Abstract

Spatial heterogeneity in antibiotic environments drives the evolution of bacterial resistance. However, how the discrete structure of these environments controls the time required for adaptation of bacteria remains unclear. We study this question using a stochastic model on a two-dimensional lattice whose axes represent physical space and phenotype space, comparing different numbers of steps while holding the overall spatial and concentration ranges fixed and scaling the migration and mutation rates by their end-to-end first-passage times. We find that increasing the number of steps accelerates the search for the next adapted state but increases the cumulative cost of repeated population saturation; this competition can produce an optimum at an intermediate number of steps. Direct Gillespie simulations reproduce the predicted dependence of the adaptation time on the number of steps, providing testable predictions for how discrete environmental structure shapes the timescale of evolutionary adaptation.

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.

abstract compiled · 2026-11-13

The authors' main claim, as the classifier picked it out 1.00

“We find that increasing the number of steps accelerates the search for the next adapted state but increases the cumulative cost of repeated population saturation; this competition can produce an optimum at an intermediate number of steps.”

How the main claim is stated: asserted 0.92

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.21 · human participants 0.01 · controlled comparison 0.21 · randomized assignment 0.01 · states quantitative result 0.08 · compares with prior results 0.18 · mentions code or data availability 0.02

The abstract, sentence by sentence

This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.

SentenceRoleThe authors' own workStates the main conclusionStrength
Spatial heterogeneity in antibiotic environments drives the evolution of bacterial resistance. background 1.00 0.06 0.03 asserted 1.00
However, how the discrete structure of these environments controls the time required for adaptation of bacteria remains unclear. gap 1.00 0.04 0.02 asserted 0.57
We study this question using a stochastic model on a two-dimensional lattice whose axes represent physical space and phenotype space, comparing different numbers of steps while holding the overall spatial and concentration ranges fixed and scaling the migration and mutation rates by their end-to-end first-passage times. method 0.94 0.95 0.04 asserted 0.74
We find that increasing the number of steps accelerates the search for the next adapted state but increases the cumulative cost of repeated population saturation; this competition can produce an optimum at an intermediate number of steps. result 0.99 0.97 0.89 asserted 0.92
Direct Gillespie simulations reproduce the predicted dependence of the adaptation time on the number of steps, providing testable predictions for how discrete environmental structure shapes the timescale of evolutionary adaptation. result 0.44 0.94 0.15 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 0.55 · evidence from simulation or computation 1.00

What was examined, and what was not

Sources read

  • arXiv listing abstract v1

Not examined

  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers

Levels run

  • P abstract

Not run

  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

How the labels were made

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 4,285 input tokens.

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON

Figures (5)
Figure 1 of the paper
Figure 1. FIG. 1. Overview of the system. The horizontal axis is the
Figure 3 of the paper
Figure 3. FIG. 3. Speedup ratio FAT(1)
Figure 4 of the paper
Figure 4. FIG. 4. Mean first-arrival time as a function of the number of
Figure 5 of the paper
Figure 5. FIG. 5. Scaling of the optimum obtained by numerical min

Showing 4 of the paper's 5 figures. Figures are the authors', reproduced from the paper.

References (22)
  1. [1] Antimicrobial Resistance Collaborators, Global burden of bacterial antimicrobial resistance in 2019: a systematic analysis,Lancet399, 629 (2022) on Pith
  2. [2] Q. Zhang, G. Lambert, D. Liao, H. Kim, K. Robin, C.- K. Tung, N. Pourmand, and R. H. Austin, Acceleration of emergence of bacterial antibiotic resistance in connected microenvironments,Science333, 1764 (2011) on Pith
  3. [3] M. Baym, T. D. Lieberman, E. D. Kelsic, R. Chait, R. Gross, I. Yelin, and R. Kishony, Spatiotemporal mi- crobial evolution on antibiotic landscapes,Science353, 1147 (2016) on Pith
  4. [4] A. M. Leale and R. Kassen, The emergence, maintenance, and demise of diversity in a spatially variable antibiotic regime,Evol. Lett.2, 134 (2018) on Pith
  5. [5] R. Hermsen and T. Hwa, Sources and sinks: a stochastic model of evolution in heterogeneous environments,Phys. Rev. Lett.105, 248104 (2010) on Pith
  6. [6] R. Hermsen, J. B. Deris, and T. Hwa, On the rapidity of antibiotic resistance evolution facilitated by a concentra- tion gradient,Proc. Natl. Acad. Sci. U.S.A.109, 10775 (2012) on Pith
  7. [7] R. Hermsen, The adaptation rate of a quantitative trait in an environmental gradient,Phys. Biol.13, 065003 (2016) on Pith
  8. [8] P. Greulich, B. Wac law, and R. J. Allen, Mutational pathway determines whether drug gradients accelerate evolution of drug-resistant cells,Phys. Rev. Lett.109, 088101 (2012) on Pith
  9. [9] V. Piskovsky and N. M. Oliveira, Bacterial motility can govern the dynamics of antibiotic resistance evolution, Nat. Commun.14, 5584 (2023) on Pith
  10. [10] J. H. Gillespie, Some properties of finite populations ex- periencing strong selection and weak mutation,Am. Nat. 121, 691 (1983) on Pith
  11. [11] J. H. Gillespie, Molecular evolution over the mutational landscape,Evolution38, 1116 (1984) on Pith
  12. [12] K. C. Atwood, L. K. Schneider, and F. J. Ryan, Peri- odic selection inEscherichia coli,Proc. Natl. Acad. Sci. U.S.A.37, 146 (1951) on Pith
  13. [13] P. D. Sniegowski and P. J. Gerrish, Beneficial mutations and the dynamics of adaptation in asexual populations, Philos. Trans. R. Soc. B365, 1255 (2010) on Pith
  14. [14] M. M. Desai and D. S. Fisher, Beneficial mutation– selection balance and the effect of linkage on positive selection,Genetics176, 1759 (2007) on Pith
  15. [15] K. Sekimoto, Derivation of the first passage time dis- tribution for Markovian process on discrete network, arXiv:2110.02216 on PithPith's reviewarXiv
  16. [16] G. Sezonov, D. Joseleau-Petit, and R. D’Ari,Escherichia coliphysiology in Luria–Bertani broth,J. Bacteriol.189, 8746 (2007) on Pith
  17. [17] C. Kurzthaler et al., Characterization and control of the run-and-tumble dynamics ofEscherichia coli,Phys. Rev. Lett.132, 038302 (2024) on Pith
  18. [18] H. Lee, E. Popodi, H. Tang, and P. L. Foster, Rate and molecular spectrum of spontaneous mutations in the bac- teriumEscherichia colias determined by whole-genome sequencing,Proc. Natl. Acad. Sci. U.S.A.109, E2774 (2012) on Pith
  19. [19] R. R. Regoes, C. Wiuff, R. M. Zappala, K. N. Garner, F. Baquero, and B. R. Levin, Pharmacodynamic func- tions: a multiparameter approach to the design of antibi- otic treatment regimens,Antimicrob. Agents Chemother. 48, 3670 (2004) on Pith
  20. [20] L. Sandegren, A. Lindqvist, G. Kahlmeter, and D. I. An- dersson, Nitrofurantoin resistance mechanism and fitness cost inEscherichia coli,J. Antimicrob. Chemother.62, 495 (2008) on Pith
show 2 more
  1. [21] D. I. Andersson and D. Hughes, Antibiotic resistance and its cost: is it possible to reverse resistance?,Nat. Rev. Microbiol.8, 260–271 (2010) on Pith
  2. [22] S. J. Schrag, V. Perrot, and B. R. Levin, Adaptation to the fitness costs of antibiotic resistance inEscherichia coli,Proc. R. Soc. Lond. B264, 1287 (1997) on Pith

Challenges and discussion

Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.

No comments yet.

Sign in to comment