wanyu/IteraTeR_v2 huggingface dataset:
Original:  We found further that T^*_{\rm cr}\propto -{\rm SCD}, where SCD is a recently proposed "sequence charge decoration" parameter that is determined solely by sequence information.
Revised:  We found further that T^*_{\rm cr}\propto -{\rm SCD}, where SCD is a recently proposed "sequence charge decoration" parameter determined solely by sequence information.
Edit intent: clarity
Original:  Ramification of our findings for deciphering the sequence dependence of the phase separation of intrinsically disordered proteins are discussed.
Revised:  Ramifications of our findings for deciphering the sequence dependence of the phase separation of intrinsically disordered proteins are discussed.
Edit intent: fluency
Original:  Ramification of our findings for deciphering the sequence dependence of the phase separation of intrinsically disordered proteins are discussed.
Revised:  Ramification of our findings for deciphering the sequence dependence of IDP phase separation are discussed.
Edit intent: clarity
Original:  This apparently self-evident proposition, however, is derived under the assumption that genetic variation within a population is primarily supplied by mutation (i.e.  mutation-driven evolution).
Revised:  This apparently self-evident proposition, however, is derived under the assumption that genetic variation within a population is primarily supplied by mutation (i.e. \ mutation-driven evolution).
Edit intent: fluency
Original:  Here, we show that this proposition does not actually hold for recombination-driven evolution, i.e.  evolution in which genetic variation is primarily created by recombination rather than mutation.
Revised:  Here, we show that this proposition does not actually hold for recombination-driven evolution, i.e. \ evolution in which genetic variation is primarily created by recombination rather than mutation.
Edit intent: fluency
Original:  One the other hand, however, it tends to decrease the rate of evolution by decreasing the chance of recombination between immigrants and resident individuals.
Revised:  On the other hand, however, it tends to decrease the rate of evolution by decreasing the chance of recombination between immigrants and resident individuals.
Edit intent: fluency
Original:  One the other hand, however, it tends to decrease the rate of evolution by decreasing the chance of recombination between immigrants and resident individuals.
Revised:  One the other hand, natural selection tends to decrease the rate of evolution by decreasing the chance of recombination between immigrants and resident individuals.
Edit intent: clarity
Original:  This type of protocol allows for  integration of multiple datasets that may not be immediately comparable  due to diverse experimental variations or that represent different types of information about the same genes.
Revised:  This type of protocol allows for an integration of multiple datasets that may not be immediately comparable due to diverse experimental variations or that represent different types of information about the same genes.
Edit intent: fluency
Original:  This type of protocol allows for  integration of multiple datasets that may not be immediately comparable  due to diverse experimental variations or that represent different types of information about the same genes.
Revised:  This type of protocol allows for integration of multiple datasets that may not be immediately comparable , either due to diverse experimental variations or that represent different types of information about the same genes.
Edit intent: coherence
Original:  This type of protocol allows for  integration of multiple datasets that may not be immediately comparable  due to diverse experimental variations or that represent different types of information about the same genes.
Revised:  This type of protocol allows for integration of multiple datasets that may not be immediately comparable due to diverse experimental variations or because they represent different types of information about the same genes.
Edit intent: coherence
Original:  Unlike conventional risk management which exploits statistical correlations among financial instruments, here we focus our analysis on the notion of probabilistic causation, which is embodied by Suppes-Bayes Causal Networks (SBCNs) , SBCNs are probabilistic graphical models that have many attractive features in terms of more accurate causal analysis for generating financial stress scenarios.
Revised:  Unlike conventional risk management which exploits statistical correlations among financial instruments, here we focus our analysis on the notion of probabilistic causation, which is embodied by Suppes-Bayes Causal Networks (SBCNs) ; SBCNs are probabilistic graphical models that have many attractive features in terms of more accurate causal analysis for generating financial stress scenarios.
Edit intent: fluency
Original:  For the m,n function, any mutation rate between 2/n and m \ln(m/2) /n leads to a speed-up at least exponential in m compared to the standard choice.
Revised:  For the m,n function, any mutation rate between 2/n and m /n leads to a speed-up at least exponential in m compared to the standard choice.
Edit intent: clarity
Original:  All our results are proven for a class of WTSs without the image-finiteness restriction, a fact that makes this development general and robust.
Edit intent: coherence
Original:  We show that the logic enjoys the finite model property which allows us to prove the decidability of satisfiability and provide an algorithm for satisfiability checking . Last but not least, we identify a complete axiomatization for this logic .
Revised:  We show that the logic enjoys the finite model property and we identify a complete axiomatization for the logic . Last but not least, we identify a complete axiomatization for this logic .
Edit intent: coherence
Original:  We demonstrate that this approach leads to state-of-the-art performance on a few-shot image classification benchmark , produces good results on few-shot regression, and accelerates fine-tuning for policy gradient reinforcement learning with neural network policies.
Revised:  We demonstrate that this approach leads to state-of-the-art performance on two few-shot image classification benchmark , produces good results on few-shot regression, and accelerates fine-tuning for policy gradient reinforcement learning with neural network policies.
Edit intent: clarity
Original:  We demonstrate that this approach leads to state-of-the-art performance on a few-shot image classification benchmark , produces good results on few-shot regression, and accelerates fine-tuning for policy gradient reinforcement learning with neural network policies.
Revised:  We demonstrate that this approach leads to state-of-the-art performance on a few-shot image classification benchmarks , produces good results on few-shot regression, and accelerates fine-tuning for policy gradient reinforcement learning with neural network policies.
Edit intent: clarity
Original:  The forager is also greedy ---given a choice to move to an empty or to a food-containing site in its local neighborhood, the forager moves preferentially towards food.
Revised:  The forager is also ---given a choice to move to an empty or to a food-containing site in its local neighborhood, the forager moves preferentially towards food.
Edit intent: coherence
Original:  The forager is also greedy ---given a choice to move to an empty or to a food-containing site in its local neighborhood, the forager moves preferentially towards food.
Revised:  The forager is also greedy greedy---given a choice to move to an empty or to a food-containing site in its local neighborhood, the forager moves preferentially towards food.
Edit intent: clarity
Original:  Surprisingly, the forager lifetime varies non-monotonically with greed, with different senses of the non-monotonicity in one and two dimensions.
Revised:  Surprisingly, the forager lifetime varies non-monotonically with greed, with different senses of the non-monotonicity in one and two dimensions.
Edit intent: fluency
Original:  We also use a model of cultural transmission to extrapolate from our experimental data in order to predict the amount of regularization which would develop in each experimental condition if the artificial language was transmitted over several generations of learners.
Revised:  Using our experimental data and a model of cultural transmission to extrapolate from our experimental data in order to predict the amount of regularization which would develop in each experimental condition if the artificial language was transmitted over several generations of learners.
Edit intent: clarity
Original:  We also use a model of cultural transmission to extrapolate from our experimental data in order to predict the amount of regularization which would develop in each experimental condition if the artificial language was transmitted over several generations of learners.
Revised:  We also use a model of cultural transmission , we generate predictions for the amount of regularization which would develop in each experimental condition if the artificial language was transmitted over several generations of learners.
Edit intent: clarity
Original:  We also use a model of cultural transmission to extrapolate from our experimental data in order to predict the amount of regularization which would develop in each experimental condition if the artificial language was transmitted over several generations of learners.
Revised:  We also use a model of cultural transmission to extrapolate from our experimental data in order to predict the amount of regularity that would develop in each experimental condition if the artificial language was transmitted over several generations of learners.
Edit intent: clarity
Original:  We also use a model of cultural transmission to extrapolate from our experimental data in order to predict the amount of regularization which would develop in each experimental condition if the artificial language was transmitted over several generations of learners.
Revised:  We also use a model of cultural transmission to extrapolate from our experimental data in order to predict the amount of regularization which would develop in each experimental condition if the artificial language were transmitted over several generations of learners.
Edit intent: fluency
Original:  Here we find an interaction between cognitive load and linguistic domain, suggesting that the effect of cognitive constraints can become more complex when put into the context of cultural evolution: although learning biases certainly carry information about the course of language evolution, we should not expect a one-to-one correspondence between the micro-level processes that regularize linguistic datasets and the macro-level evolution of linguistic regularity.
Revised:  Here we find that the effect of cognitive constraints can become more complex when put into the context of cultural evolution: although learning biases certainly carry information about the course of language evolution, we should not expect a one-to-one correspondence between the micro-level processes that regularize linguistic datasets and the macro-level evolution of linguistic regularity.
Edit intent: clarity
Original:  Here we study a transformation of these complex networks into simplicial complexes, where cliques represent the simplicies of the complex.
Revised:  Here we study a transformation of these complex networks into simplicial complexes, where cliques represent the simplices of the complex.
Edit intent: fluency
Original:  We extend the concept of node centrality to that of simplicial centrality and study several mathematical properties of degree, clossenness , betweenness, eigenvector, Katz, and subgraph centrality for simplicial complexes.
Revised:  We extend the concept of node centrality to that of simplicial centrality and study several mathematical properties of degree, closeness , betweenness, eigenvector, Katz, and subgraph centrality for simplicial complexes.
Edit intent: fluency
Original: We answer the following question dating back to J.E. Littlewood ( 1885 - 1977 ): Can two lions catch a man in a bounded area with rectifiable lakes?
Revised: We study the following question dating back to J.E. Littlewood ( 1885 - 1977 ): Can two lions catch a man in a bounded area with rectifiable lakes?
Edit intent: clarity
Original: We answer the following question dating back to J.E. Littlewood ( 1885 - 1977 ): Can two lions catch a man in a bounded area with rectifiable lakes?
Revised: We answer the following question dating back to J.E. Littlewood ( 1885-1977 ): Can two lions catch a man in a bounded area with rectifiable lakes?
Edit intent: fluency
Original:  This requirement is  to avoid pathological examples where the man survives forever because any path to the lions is infinitely long.
Revised:  This requirement is necessary to avoid pathological examples where the man survives forever because any path to the lions is infinitely long.
Edit intent: coherence
Original:  We show that the answer to the question is not always " yes " by giving an example of a region R in the plane where the man has a strategy to survive forever.
Revised:  We show that the answer to the question is not always " yes " in the sense that there exists a region R in the plane where the man has a strategy to survive forever.
Edit intent: clarity
Original:  R is a polygonal region with holes and the exterior and interior boundaries are pairwise disjoint, simple polygons.
Revised:  We give a rigorous description of such a region R; a polygonal region with holes and the exterior and interior boundaries are pairwise disjoint, simple polygons.
Edit intent: clarity
Original:  R is a polygonal region with holes and the exterior and interior boundaries are pairwise disjoint, simple polygons.
Revised:  R is a polygonal region with holes whose exterior and interior boundaries are pairwise disjoint, simple polygons.
Edit intent: clarity
Original:  Next , we consider the following game played on the entire plane instead of a bounded area : There is any finite number of unit speed lions and one fast man who can run with speed 1+\varepsilon for some value \varepsilon>0.
Revised:  Next , we consider the following game played on the entire plane instead of a compact region : There is any finite number of unit speed lions and one fast man who can run with speed 1+\varepsilon for some value \varepsilon>0.
Edit intent: clarity
Original:  We answer the question in the affirmative for any constant \varepsilon>0. 
Revised:  We answer the question in the affirmative for any \varepsilon>0. 
Edit intent: clarity
Original: What characteristics distinguish liars from truth-tellers?
Revised: Which characteristics distinguish liars from truth-tellers?
Edit intent: fluency
Original:  Previous studies have led to mixed results about the effect of gender on deception, and they have largely neglected the role of other characteristics, such as age and level of education.
Revised:  Previous studies have found mixed results about the effect of gender on deception, and they have largely neglected the role of other characteristics, such as age and level of education.
Edit intent: clarity
Original:  (ii) males are  more likely than females to tell altruistic white lies  ;
Revised:  (ii) males are significantly more likely than females to tell altruistic white lies ;
Edit intent: clarity
Original:  (vii) educated subjects are  more likely than non-educated subjects to tell black lies;
Revised:  (vii) educated subjects are significantly more likely than non-educated subjects to tell black lies;
Edit intent: clarity
Original:  (ix) educated subjects are more likely than non-educated subjects to tell Pareto white lies.
Revised:  (ix) the level of education has a mixed effect on the decision to tell Pareto white lies.
Edit intent: clarity
Original:  Previous studies have found mixed results about the effect of gender on deception, and they have largely neglected the role of other characteristics, such as age and level of education .
Revised:  Previous studies have found mixed results .
Edit intent: clarity
Original:  To shed light on these questions , here I report a meta-analysis of 8,728 distinct observations, collected in 65 Sender-Receiver game treatments, by 14 research groups.
Revised:  To shed light on this topic , here I report a meta-analysis of 8,728 distinct observations, collected in 65 Sender-Receiver game treatments, by 14 research groups.
Edit intent: clarity
Original:  (ii) males are significantly more likely than females to tell altruistic white lies (lies that benefit another person at a cost for the liar , N=2,940);
Revised:  (ii) males are significantly more likely than females to tell altruistic white lies , that benefit another person at a cost for the liar , N=2,940);
Edit intent: clarity
Original:  (iii) males are marginally significantly more likely than females to tell Pareto white lies (lies that benefit both the liar and another person , N = 1 , 627);
Revised:  (iii) males are marginally significantly more likely than females to tell Pareto white lies , that benefit both the liar and another person , N = 1 , 627);
Edit intent: coherence
Original:  While our current work only supports linear queries, we show that our technique can successfully answer queries faster than sampling while introducing, on average, no more error than sampling and better distinguishing between rare and non-existant values.
Revised:  While our current work only supports linear queries, we show that our technique can successfully answer queries faster than sampling while introducing, on average, no more error than sampling and can better distinguish between rare and non-existant values.
Edit intent: clarity
Original:  While our current work only supports linear queries, we show that our technique can successfully answer queries faster than sampling while introducing, on average, no more error than sampling and better distinguishing between rare and non-existant values.
Revised:  While our current work only supports linear queries, we show that our technique can successfully answer queries faster than sampling while introducing, on average, no more error than sampling and better distinguishing between rare and nonexistent values.
Edit intent: clarity
Original:  Experiments on MuJoCo and Atari show that ES is a viable solution strategy that scales extremely well with the number of CPUs available: By using hundreds to thousands of parallel workers, ES can solve 3D humanoid walking in 10 minutes and obtain competitive results on most Atari games after one hour of training time .
Revised:  Experiments on MuJoCo and Atari show that ES is a viable solution strategy that scales extremely well with the number of CPUs available: By using hundreds to thousands of parallel workers, ES can solve 3D humanoid walking in 10 minutes and obtain competitive results on most Atari games after one hour of training .
Edit intent: clarity
Original:  This paper proposes an optimal channel allocation algorithm to achieve maximal throughputs in DCB WLANs. Specifically, we first adopt a continuous-time Markov Model (CTMC) model to analyze the equilibrium throughputs.
Revised:  This paper proposes an optimal channel allocation algorithm to achieve maximal throughputs in DCB WLANs. Specifically, we first adopt a continuous-time Markov Chain (CTMC) model to analyze the equilibrium throughputs.
Edit intent: clarity
Original:  We believe that our analysis on the optimal channel allocation schemes brings new insights into the design and optimization of future WLANs, especially for those adopting channel bonding technique.
Revised:  Our analysis on the optimal channel allocation schemes brings new insights into the design and optimization of future WLANs, especially for those adopting channel bonding technique.
Edit intent: coherence
Original: The contraction method is a procedure that allows to establish non-trivial relations between Lie algebras and have had succesful applications in both mathematics and theoretical physics.
Revised: The contraction method is a procedure that allows to establish non-trivial relations between Lie algebras and has had succesful applications in both mathematics and theoretical physics.
Edit intent: fluency
Original:  We overcome this barrier by employing and generalizing the computational model in the literature on Bernoulli Factories .
Revised:  We overcome this barrier by employing and generalizing the computational model in the literature on Bernoulli factories .
Edit intent: fluency
Original:  In a Bernoulli factory problem, one is given a function mapping the bias of an "input coin" to that of an "output coin", and the challenge is to efficiently simulate the output coin given  sample access to the input coin.
Revised:  In a Bernoulli factory problem, one is given a function mapping the bias of an "input coin" to that of an "output coin", and the challenge is to efficiently simulate the output coin given only sample access to the input coin.
Edit intent: clarity
Original:  Here we show using a generic birth-death model that despite being far from equilibrium, biochemical feedback near a bifurcation point exhibits the scaling exponents of the mean-field universality class .
Revised:  Here we show using a generic birth-death model that biochemical feedback near a bifurcation point exhibits the scaling exponents of the mean-field universality class .
Edit intent: clarity
Original:  The theory allows us to calculate an effective order parameter, temperature, external field, and heat capacity from T cell fluorescence data without fitting.
Revised:  The theory allows us to extract the order parameter, temperature, external field, and heat capacity from T cell fluorescence data without fitting.
Edit intent: clarity
Original:  The generality of the mapping allows us to extract the order parameter, effective temperature, magnetic field,  and heat capacity from T cell flow cytometry data without needing to know the underlying molecular details.
Revised:  The generality of the mapping allows us to extract the order parameter, effective temperature, magnetic field, and heat capacity . These effective thermodynamic quantities can be extracted from biological data without fitting or knowledge of the underlying molecular details.
Edit intent: clarity
Original:  We find that T cells obey critical scaling relations and exhibit critical slowing down, and that the heat capacity determines molecule number from fluorescence data.
Revised:  We demonstrate this procedure on fluorescence data from mouse T cells and interpret the findings. In the process, we discover an unanticipated result: the heat capacity determines molecule number from fluorescence data.
Edit intent: clarity
Original:  which is conjectured not to be solved by two-way quantum finite automata in polynomial time, can be solved by Las-Vegas affine finite automata in linear time . Lastly, we show that how a counter helps for affine finite automata by showing that the language MANYTWINS , which is conjectured not to be recognized by affine, quantum or classical finite state models in polynomial time, can be recognized by affine counter automata with one-sided bounded-error in realtime.
Revised:  which is conjectured not to be solved by two-way quantum finite automata in polynomial time, can be solved by Las Vegas affine finite automata in linear time . Lastly, we show that how a counter helps for affine finite automata by showing that the language MANYTWINS , which is conjectured not to be recognized by affine, quantum or classical finite state models in polynomial time, can be recognized by affine counter automata with one-sided bounded-error in realtime.
Edit intent: fluency