wanyu/IteraTeR_v2 huggingface dataset:
Original: Adversarial SAT (AdSAT) is a generalization of the satisfiability (SAT) problem in which two players try to make a binary expression true (resp. false) by controlling their respective sets of variables.
Revised: Adversarial SAT (AdSAT) is a generalization of the satisfiability (SAT) problem in which two players try to make a boolean formula true (resp. false) by controlling their respective sets of variables.
Edit intent: clarity
Original:  We investigate the structural difference with the no-mass-at-zero case, showing how one can-a priori-distinguish between mass at the origin and a heavy-left-tailed distribution.
Revised:  We investigate the structural difference with the no-mass-at-zero case, showing how one can--a priori--distinguish between mass at the origin and a heavy-left-tailed distribution.
Edit intent: fluency
Original:  Exploiting our recent results on resistance of snarks, we provide upper bounds on the circumference ratio c(G)/|V(G)| for classes of cyclically 4-, 5- and 6-edge-connected cubic graphs .
Revised:  By exploiting our recent results on resistance of snarks, we provide upper bounds on the circumference ratio c(G)/|V(G)| for classes of cyclically 4-, 5- and 6-edge-connected cubic graphs .
Edit intent: fluency
Original:  In addition, we construct snarks with large girth and large circumference  , solving Problem 1 proposed in [J. H\"agglund and K. Markstr\"om, On stable cycles and cycle double covers of graphs with large circumference, Disc.
Revised:  In addition, we construct snarks with large girth and large circumference deficit , solving Problem 1 proposed in [J. H\"agglund and K. Markstr\"om, On stable cycles and cycle double covers of graphs with large circumference, Disc.
Edit intent: fluency
Original: Recently there has been growing interest in using time series genetic variation data , either from experimental evolution studies or ancient DNA samples , to make inference about evolutionary processes.
Revised: The increased availability of time series genetic variation data , either from experimental evolution studies or ancient DNA samples , to make inference about evolutionary processes.
Edit intent: clarity
Original: Recently there has been growing interest in using time series genetic variation data , either from experimental evolution studies or ancient DNA samples , to make inference about evolutionary processes.
Revised: Recently there has been growing interest in using time series genetic variation data from experimental evolution studies or ancient DNA samples , to make inference about evolutionary processes.
Edit intent: coherence
Original: Recently there has been growing interest in using time series genetic variation data , either from experimental evolution studies or ancient DNA samples , to make inference about evolutionary processes.
Revised: Recently there has been growing interest in using time series genetic variation data , either from experimental evolution studies and ancient DNA samples , to make inference about evolutionary processes.
Edit intent: fluency
Original:  While such temporal data can facilitate identifying genomic regions under selective pressure and estimating associated fitness parameters  , it is a challenging problem to compute the likelihood of the underlying selection model given DNA samples obtained at several time points .
Revised:  While such temporal data can facilitate identifying genomic regions under selective pressure and to estimate their associated fitness parameters , it is a challenging problem to compute the likelihood of the underlying selection model given DNA samples obtained at several time points .
Edit intent: clarity
Original:  While such temporal data can facilitate identifying genomic regions under selective pressure and estimating associated fitness parameters  , it is a challenging problem to compute the likelihood of the underlying selection model given DNA samples obtained at several time points .
Revised:  While such temporal data can facilitate identifying genomic regions under selective pressure and estimating associated fitness parameters . However , it is a challenging problem to compute the likelihood of the underlying selection model given DNA samples obtained at several time points .
Edit intent: coherence
Original:  The key methodological advance in our work is the development of a novel spectral method to analytically and efficiently integrate over all trajectories of the population allele frequency between consecutive time points.
Revised:  The key methodological advance in our work is the development of a novel spectral algorithm to analytically and efficiently integrate over all trajectories of the population allele frequency between consecutive time points.
Edit intent: clarity
Original:  The key methodological advance in our work is the development of a novel spectral method to analytically and efficiently integrate over all trajectories of the population allele frequency between consecutive time points.
Revised:  The key methodological advance in our work is the development of a novel spectral method to analytically and efficiently integrate over all possible frequency trajectories between consecutive time points.
Edit intent: clarity
Original:  This advance circumvents the limitations of existing methods which require fine-tuning the discretization of the  allele frequency space to approximate certain integralsusing numerical schemes .
Revised:  This advance circumvents the limitations of existing methods which require fine-tuning the discretization of the allele frequency space when numerically approximating requisite integrals .
Edit intent: clarity
Original:  We demonstrate the utility of our method on simulated data and apply the method to analyze time series ancient DNA data from genetic loci (ASIP and MC1R) associated with coat coloration in horses.
Revised:  We demonstrate the utility of our method on simulated data and also apply it to analyze ancient DNA data from genetic loci (ASIP and MC1R) associated with coat coloration in horses.
Edit intent: clarity
Original:  We demonstrate the utility of our method on simulated data and apply the method to analyze time series ancient DNA data from genetic loci (ASIP and MC1R) associated with coat coloration in horses.
Revised:  We demonstrate the utility of our method on simulated data and apply the method to analyze time series ancient DNA data from genetic loci associated with coat coloration in horses.
Edit intent: coherence
Original:  In contrast to the conclusions of previous studieswhich considered only a few special selection schemes , our exploration of the full fitness parameter space reveals that balancing selection (in the form of heterozygote advantage ) may have been acting on these loci.
Revised:  In contrast to previous studies , our exploration of the full fitness parameter space reveals that balancing selection (in the form of heterozygote advantage ) may have been acting on these loci.
Edit intent: clarity
Original:  In contrast to the conclusions of previous studieswhich considered only a few special selection schemes , our exploration of the full fitness parameter space reveals that balancing selection (in the form of heterozygote advantage ) may have been acting on these loci.
Revised:  In contrast to the conclusions of previous studieswhich considered only a few special selection schemes , our exploration of the full fitness parameter space reveals that a heterozygote advantage form of balancing selection may have been acting on these loci.
Edit intent: clarity
Original:  This poster describe the results of our analysis of the surveys and predicts the winner of the NY City Mayoral Election.
Revised:  This poster describes the results of our analysis of the surveys and predicts the winner of the NY City Mayoral Election.
Edit intent: fluency
Original:  Herein, we prove that any quasi-left-continuous process satisfying NUPBR, will preserve the NUPBR when one stops it at any random horizon or when one incorporates a%DIFDELCMD < {\it %%% specific honest time.
Revised:  %DIFDELCMD < {\it %%% specific honest time.
Edit intent: coherence
Original:  The second type of results consists of giving necessary and sufficient conditions on the random time for which the non-arbitrage is preserved for any process.
Revised:  The second main result characterises the random time for which the non-arbitrage is preserved for any process.
Edit intent: clarity
Original:  We give tight worst case bounds of \Theta%DIFDELCMD < }%%% (nlogn) on the flip distance between edge-labelled triangulations of a convex polygon, and edge-labelled combinatorial triangulations, in contrast to the \Theta (n) bounds for the unlabelled case.
Revised:  We give tight worst case bounds of %DIFDELCMD < }%%% (nlogn) on the flip distance between edge-labelled triangulations of a convex polygon, and edge-labelled combinatorial triangulations, in contrast to the \Theta (n) bounds for the unlabelled case.
Edit intent: fluency
Original:  We give tight worst case bounds of \Theta%DIFDELCMD < }%%% (nlogn) on the flip distance between edge-labelled triangulations of a convex polygon, and edge-labelled combinatorial triangulations, in contrast to the \Theta (n) bounds for the unlabelled case.
Revised:  We give tight worst case bounds of \Theta%DIFDELCMD < }%%% triangulations of a convex polygon, and edge-labelled combinatorial triangulations, in contrast to the \Theta (n) bounds for the unlabelled case.
Edit intent: clarity
Original:  We give tight worst case bounds of \Theta%DIFDELCMD < }%%% (nlogn) on the flip distance between edge-labelled triangulations of a convex polygon, and edge-labelled combinatorial triangulations, in contrast to the \Theta (n) bounds for the unlabelled case.
Revised:  We give tight worst case bounds of \Theta%DIFDELCMD < }%%% (nlogn) on the flip distance between edge-labelled triangulations of a convex polygon, and edge-labelled combinatorial triangulations, \Theta (n) bounds for the unlabelled case.
Edit intent: coherence
Original:  We prove an O(log2 n) upper bound and an \Omega%DIFDELCMD < }%%% (logn) lower bound on the worst case number of simultaneous flips, in contrast with the tight bound of \Theta%DIFDELCMD < }%%% (log n) for the unlabelled case proved in SODA '06.
Revised:  We prove an O(log2 n) upper bound and an %DIFDELCMD < }%%% (logn) lower bound on the worst case number of simultaneous flips, in contrast with the tight bound of \Theta%DIFDELCMD < }%%% (log n) for the unlabelled case proved in SODA '06.
Edit intent: clarity
Original:  We prove an O(log2 n) upper bound and an \Omega%DIFDELCMD < }%%% (logn) lower bound on the worst case number of simultaneous flips, in contrast with the tight bound of \Theta%DIFDELCMD < }%%% (log n) for the unlabelled case proved in SODA '06.
Revised:  We prove an O(log2 n) upper bound and an \Omega%DIFDELCMD < }%%% \Theta%DIFDELCMD < }%%% (log n) for the unlabelled case proved in SODA '06.
Edit intent: clarity
Original:  We prove an O(log2 n) upper bound and an \Omega%DIFDELCMD < }%%% (logn) lower bound on the worst case number of simultaneous flips, in contrast with the tight bound of \Theta%DIFDELCMD < }%%% (log n) for the unlabelled case proved in SODA '06.
Revised:  We prove an O(log2 n) upper bound and an \Omega%DIFDELCMD < }%%% (logn) lower bound on the worst case number of simultaneous flips, in contrast with the tight bound of %DIFDELCMD < }%%% (log n) for the unlabelled case proved in SODA '06.
Edit intent: clarity
Original: In this work we consider a periodically forced generic integrate-and-fire model with a unique attracting equilibrium in the subthreshold dynamics and study the dependence of the firing rate on the frequency of the drive.
Revised: In this work we consider a periodically forced generic integrate-and-fire model with a unique attracting equilibrium in the subthreshold dynamics and study the dependence of the firing-rate on the frequency of the drive.
Edit intent: fluency
Original:  In this work we rigorously study how these bifurcation structures behave upon frequency variation .
Revised:  In this work we study how these bifurcation structures behave upon frequency variation .
Edit intent: clarity
Original:  In this work we rigorously study how these bifurcation structures behave upon frequency variation .
Revised:  In this work we rigorously study how these bifurcation structures behave upon variation of the frequency of the input .
Edit intent: clarity
Original:  This allows us to show that the dependence of the firing rate on frequency of the drive follows a devil's staircase with non-monotonic steps and that there is an optimal response in the whole frequency domain.
Revised:  This allows us to show that the dependence of the firing-rate on frequency of the drive follows a devil's staircase with non-monotonic steps and that there is an optimal response in the whole frequency domain.
Edit intent: fluency
Original:  We also characterize certain bounded frequency windows in which the firing rate exhibits a bell-shaped envelope with a global maximum.
Revised:  We also characterize certain bounded frequency windows in which the firing-rate exhibits a bell-shaped envelope with a global maximum.
Edit intent: fluency
Original:  Our linear-nonlinear dynamical model incorporates long range connectivity patterns that enforce context dependence present in the visual field.
Revised:  Our linear-nonlinear dynamical model with long range connectivity patterns that enforce context dependence present in the visual field.
Edit intent: clarity
Original:  Our linear-nonlinear dynamical model incorporates long range connectivity patterns that enforce context dependence present in the visual field.
Revised:  Our linear-nonlinear dynamical model incorporates long range connectivity patterns to enforce long-range statistical context present in the visual field.
Edit intent: clarity
Original:  I.e. "swords get sharper, so shields get thicker, so swords get sharper still" 1%DIFDELCMD < ]%%% . One potential outcome of such directional selection is increased complexity 2-4%DIFDELCMD < ]%%% . However, phenotypes of equivalent behavioral complexity can carry different fitness effects: a grey moth with a preference for perching on grey trees is likely safer, but no more behaviorally complex, than a grey moth with a preference for perching on black trees.
Revised:  I.e. "swords get sharper, so shields get thicker, so swords get sharper still" %DIFDELCMD < ]%%% . One potential outcome of such directional selection is increased complexity 2-4%DIFDELCMD < ]%%% . However, phenotypes of equivalent behavioral complexity can carry different fitness effects: a grey moth with a preference for perching on grey trees is likely safer, but no more behaviorally complex, than a grey moth with a preference for perching on black trees.
Edit intent: coherence
Original:  I.e. "swords get sharper, so shields get thicker, so swords get sharper still" 1%DIFDELCMD < ]%%% . One potential outcome of such directional selection is increased complexity 2-4%DIFDELCMD < ]%%% . However, phenotypes of equivalent behavioral complexity can carry different fitness effects: a grey moth with a preference for perching on grey trees is likely safer, but no more behaviorally complex, than a grey moth with a preference for perching on black trees.
Revised:  I.e. "swords get sharper, so shields get thicker, so swords get sharper still" 1%DIFDELCMD < ]%%% 2-4%DIFDELCMD < ]%%% . However, phenotypes of equivalent behavioral complexity can carry different fitness effects: a grey moth with a preference for perching on grey trees is likely safer, but no more behaviorally complex, than a grey moth with a preference for perching on black trees.
Edit intent: clarity
Original:  Given the large number of potential behavioral responses, it is unclear whether antagonistic interactions should lead to the evolution of increasingly complex behaviors or to evolutionary " chases " through behavioral strategies of comparable complexity.
Revised:  Given the large number of potential behavioral responses, it is unclear whether antagonistic interactions should lead to the evolution of increasingly complex behaviors or to evolutionary " strategy chases, " through behavioral strategies of comparable complexity.
Edit intent: clarity
Original:  Thus we show that while the escalation inherent to arms races can produce complex traits, including basic intelligence, further significant evolutionary advancements arise from concurrent non-escalating chases through options in behavioral space .
Revised:  Thus we show that while the escalation inherent to arms races can produce complex traits, including basic intelligence, further significant evolutionary advancements , including increasingly intelligent behavioral strategies .
Edit intent: clarity
Original: Before a cell divides into two daughter cells, the chromosomes are replicated resulting in two sister chromosomes embracing each other.
Revised: Before a cell divides into two daughter cells, chromosomes are replicated resulting in two sister chromosomes embracing each other.
Edit intent: clarity
Original: We study  an optimal high frequency trading problem within a market microstructure model aiming at a good compromise between accuracy and tractability.
Revised: We study a an optimal high frequency trading problem within a market microstructure model aiming at a good compromise between accuracy and tractability.
Edit intent: fluency
Original: We study  an optimal high frequency trading problem within a market microstructure model aiming at a good compromise between accuracy and tractability.
Revised: We study an optimal high frequency trading problem within a market microstructure model designed to be a good compromise between accuracy and tractability.
Edit intent: clarity
Original:  The stock price is modeled by a Markov Renewal Process (MRP), while market orders arrive in the limit order book via a point process correlated with the stock price , and taking into account the adverse selection risk .
Revised:  The stock price is driven by a Markov Renewal Process (MRP), while market orders arrive in the limit order book via a point process correlated with the stock price , and taking into account the adverse selection risk .
Edit intent: clarity
Original:  In contrast to previous models, the change in fitness induced by the driver mutation depends on the genetic background of the cell, in our case on the number of passenger mutations.
Revised:  In contrast to previous models, the change in fitness induced by the driver mutation depends on the genetic context of the cell, in our case on the number of passenger mutations.
Edit intent: clarity
Original:  This approach is motivated by the Burkitt Lymphoma, where the hallmark mutation , a translocation between the MYC gene and an immunoglobulin gene, alters the rate of apoptosis, but also the proliferation rate of cells.
Revised:  While our model is not designed as a specific model for a particular cancer, the underlying idea is motivated by clinical and experimental observations in Burkitt Lymphoma. In this tumor, the hallmark mutation , a translocation between the MYC gene and an immunoglobulin gene, alters the rate of apoptosis, but also the proliferation rate of cells.
Edit intent: coherence
Original:  This model shows a very interesting dynamical behavior  . Since the driver mutation is deleterious on a background with only a few passenger mutations, there is a long period of stasis in the number of cells until a clone of cells has evolved with enough passenger mutations  .
Revised:  This model shows a very interesting dynamical behavior . Since the driver mutation is deleterious to a cell with only a few passenger mutations, there is a long period of stasis in the number of cells until a clone of cells has evolved with enough passenger mutations .
Edit intent: clarity
Original:  This model shows a very interesting dynamical behavior  . Since the driver mutation is deleterious on a background with only a few passenger mutations, there is a long period of stasis in the number of cells until a clone of cells has evolved with enough passenger mutations  .
Revised:  This model shows a very interesting dynamical behavior . Since the driver mutation is deleterious on a background with only a few passenger mutations, there is a period of stasis in the number of cells until a clone of cells has evolved with enough passenger mutations .
Edit intent: clarity
Original:  This model shows a very interesting dynamical behavior  . Since the driver mutation is deleterious on a background with only a few passenger mutations, there is a long period of stasis in the number of cells until a clone of cells has evolved with enough passenger mutations  .
Revised:  This model shows a very interesting dynamical behavior . Since the driver mutation is deleterious on a background with only a few passenger mutations, there is a long period of stasis in the number of cells until a clone of cells with enough passenger mutations .
Edit intent: clarity
Original:  This model shows a very interesting dynamical behavior  . Since the driver mutation is deleterious on a background with only a few passenger mutations, there is a long period of stasis in the number of cells until a clone of cells has evolved with enough passenger mutations  .
Revised:  This model shows a very interesting dynamical behavior . Since the driver mutation is deleterious on a background with only a few passenger mutations, there is a long period of stasis in the number of cells until a clone of cells has evolved with enough passenger mutations emerges .
Edit intent: clarity
Original:  Only when the driver mutation occurs in one of those cells, the cell population starts to grow exponentially .
Revised:  Only when the driver mutation occurs in one of those cells, the cell population starts to grow rapidly .
Edit intent: clarity
Original:  In this work, we generalize the concept of multiplex networks considering that only a fraction  of the nodes are shared by the layers enabling to generate a more realistic scenario.
Revised:  In this work, we use a generalized multiplex networks considering that only a fraction of the nodes are shared by the layers enabling to generate a more realistic scenario.
Edit intent: clarity
Original:  In this work, we generalize the concept of multiplex networks considering that only a fraction  of the nodes are shared by the layers enabling to generate a more realistic scenario.
Revised:  In this work, we generalize the concept of multiplex networks considering that only a fraction q of the nodes are shared by the layers enabling to generate a more realistic scenario.
Edit intent: fluency
Original:  Surprisingly, this effect is preserved even in the limit of very small overlapping fraction q%DIFDELCMD < \to %DIFDELCMD < %%% 0. This means that if an isolated network starts sharing a few nodes with another network that has a greater spreading capability, it will change discontinuously its own threshold by the one of the  other network .
Revised:  %DIFDELCMD < \to %DIFDELCMD < %%% 0. This means that if an isolated network starts sharing a few nodes with another network that has a greater spreading capability, it will change discontinuously its own threshold by the one of the other network .
Edit intent: clarity
Original:  Surprisingly, this effect is preserved even in the limit of very small overlapping fraction q%DIFDELCMD < \to %DIFDELCMD < %%% 0. This means that if an isolated network starts sharing a few nodes with another network that has a greater spreading capability, it will change discontinuously its own threshold by the one of the  other network .
Revised:  Surprisingly, this effect is preserved even in the limit of very small overlapping fraction q%DIFDELCMD < \to %DIFDELCMD < %%% This means that if an isolated network starts sharing a few nodes with another network that has a greater spreading capability, it will change discontinuously its own threshold by the one of the other network .
Edit intent: coherence
Original: Many real networks show a layered structure where links on each layer exhibit the function of nodes on different environments.
Revised: Many real networks exhibit a layered structure where links on each layer exhibit the function of nodes on different environments.
Edit intent: fluency