wanyu/IteraTeR_v2 huggingface dataset:
Original: We consider the continuous time presentation of the strand symmetric phylogenetic substitution model (in which rate matrices are unchanged under  Watson-Crick base conjugation).
Revised: We consider the continuous time presentation of the strand symmetric phylogenetic substitution model (in which rate parameters are unchanged under Watson-Crick base conjugation).
Edit intent: clarity
Original:  Analysis of the model's underlying structure as a matrix group leads to a presentation of the rate generator matrix in an appropriate basis in terms of a two-part block decomposition.
Revised:  Algebraic analysis of the model's underlying structure as a matrix group leads to a presentation of the rate generator matrix in an appropriate basis in terms of a two-part block decomposition.
Edit intent: clarity
Original:  Analysis of the model's underlying structure as a matrix group leads to a presentation of the rate generator matrix in an appropriate basis in terms of a two-part block decomposition.
Revised:  Analysis of the model's underlying structure as a matrix group leads to a change of basis where the rate generator matrix in an appropriate basis in terms of a two-part block decomposition.
Edit intent: clarity
Original:  Analysis of the model's underlying structure as a matrix group leads to a presentation of the rate generator matrix in an appropriate basis in terms of a two-part block decomposition.
Revised:  Analysis of the model's underlying structure as a matrix group leads to a presentation of the rate generator matrix is given by a two-part block decomposition.
Edit intent: clarity
Original:  Two of these Markov invariants are zero, and hence are concurrently phylogenetic invariants, while the other two invariants provide independent estimates of the total of substitution rates within Watson-Crick conjugate pairs, and the total of remaining substitution rates across conjugate base pairs.
Revised:  Two of these Markov invariants are zero, and hence are concurrently phylogenetic invariants, while the other two invariants provide independent estimates of phylogenetic distances based on (i) substitution rates within Watson-Crick conjugate pairs, and the total of remaining substitution rates across conjugate base pairs.
Edit intent: clarity
Original:  Two of these Markov invariants are zero, and hence are concurrently phylogenetic invariants, while the other two invariants provide independent estimates of the total of substitution rates within Watson-Crick conjugate pairs, and the total of remaining substitution rates across conjugate base pairs.
Revised:  Two of these Markov invariants are zero, and hence are concurrently phylogenetic invariants, while the other two invariants provide independent estimates of the total of substitution rates within Watson-Crick conjugate pairs, and (ii) substitution rates across conjugate base pairs.
Edit intent: clarity
Original: The most notable hallmark of collective behaviour in biological systems is the emergence of  order: individuals polarize their state , giving the stunning impression that the group behaves as one.
Revised: Collective behaviour is a widespread phenomenon in biology, cutting through a huge span of scales, from cell colonies up to bird flocks and fish schools. The most prominent trait of collective behaviour in biological systems is the emergence of order: individuals polarize their state , giving the stunning impression that the group behaves as one.
Edit intent: clarity
Original: The most notable hallmark of collective behaviour in biological systems is the emergence of  order: individuals polarize their state , giving the stunning impression that the group behaves as one.
Revised: The most notable hallmark of collective behaviour is the emergence of order: individuals polarize their state , giving the stunning impression that the group behaves as one.
Edit intent: clarity
Original:  Mating swarms of mosquitoes and midges, however, do not display global order and it is therefore unclear whether swarms are a true instance of collective behaviour or a mere epiphenomenon of the independent response of each insect to an environmental stimulus.
Revised:  In many biological systems, though, it is unclear whether global order is present. A paradigmatic case is that of insect swarms, whose erratic movements seem to suggest that group formation is a mere epiphenomenon of the independent response of each insect to an environmental stimulus.
Edit intent: clarity
Original:  Mating swarms of mosquitoes and midges, however, do not display global order and it is therefore unclear whether swarms are a true instance of collective behaviour or a mere epiphenomenon of the independent response of each insect to an environmental stimulus.
Revised:  Mating swarms of mosquitoes and midges, however, do not display global order and it is therefore unclear whether swarms are a true instance of collective behaviour or a mere epiphenomenon of the independent interaction of each individual with an external landmark. In these cases, whether or not the group behaves truly collectively is debated.
Edit intent: clarity
Original:  Here, we experimentally study wild swarms of midges by measuring their susceptibility, namely the capability to collectively respond to an external perturbation.
Revised:  Here, we experimentally study swarms of midges by measuring their susceptibility, namely the capability to collectively respond to an external perturbation.
Edit intent: clarity
Original:  Math., 1994) , and Godsil (Lin. Alg. and its App., 1997) established a tight correspondence between colour refinement and fractional automorphisms of a graph .
Revised:  Math., 1994) and Godsil (Lin. Alg. and its App., 1997) established a tight correspondence between colour refinement and fractional automorphisms of a graph .
Edit intent: fluency
Original:  We introduce versions of colour refinement for weighted directed graphs, for matrices , and for linear programs and extend existing quasilinear algorithms for computing the colour classes.
Revised:  We introduce a version of colour refinement for weighted directed graphs, for matrices , and for linear programs and extend existing quasilinear algorithms for computing the colour classes.
Edit intent: fluency
Original:  We introduce versions of colour refinement for weighted directed graphs, for matrices , and for linear programs and extend existing quasilinear algorithms for computing the colour classes.
Revised:  We introduce versions of colour refinement for matrices and extend existing quasilinear algorithms for computing the colour classes.
Edit intent: clarity
Original:  We apply these results to reduce the dimensions linear programs.
Revised:  We apply our results to reduce the dimensions linear programs.
Edit intent: clarity
Original:  We apply these results to reduce the dimensions linear programs.
Revised:  We apply these results to reduce the dimensions of systems of linear equations and linear programs.
Edit intent: clarity
Original:  Specifically, we show that any given linear program L can efficiently be transformed into a (potentially)
Revised:  Specifically, we show that any given LP L can efficiently be transformed into a (potentially)
Edit intent: clarity
Original:  smaller linear program L' whose number of variables and constraints is the number of colour classes of the colour refinement algorithm . (When applied to a linear program, colour refinement yields partitions both of the constraints and of the variables. ) The transformation is such that we can easily (by a linear mapping) transform both feasible and optimal solutions back and forth between the two LPs.
Revised:  smaller LP L' whose number of variables and constraints is the number of colour classes of the colour refinement algorithm . (When applied to a linear program, colour refinement yields partitions both of the constraints and of the variables. ) The transformation is such that we can easily (by a linear mapping) transform both feasible and optimal solutions back and forth between the two LPs.
Edit intent: clarity
Original:  smaller linear program L' whose number of variables and constraints is the number of colour classes of the colour refinement algorithm . (When applied to a linear program, colour refinement yields partitions both of the constraints and of the variables. ) The transformation is such that we can easily (by a linear mapping) transform both feasible and optimal solutions back and forth between the two LPs.
Revised:  smaller linear program L' whose number of variables and constraints is the number of colour classes of the colour refinement algorithm , applied to a linear program, colour refinement yields partitions both of the constraints and of the variables. ) The transformation is such that we can easily (by a linear mapping) transform both feasible and optimal solutions back and forth between the two LPs.
Edit intent: coherence
Original:  smaller linear program L' whose number of variables and constraints is the number of colour classes of the colour refinement algorithm . (When applied to a linear program, colour refinement yields partitions both of the constraints and of the variables. ) The transformation is such that we can easily (by a linear mapping) transform both feasible and optimal solutions back and forth between the two LPs.
Revised:  smaller linear program L' whose number of variables and constraints is the number of colour classes of the colour refinement algorithm . (When applied to a matrix associated with the LP. The transformation is such that we can easily (by a linear mapping) transform both feasible and optimal solutions back and forth between the two LPs.
Edit intent: clarity
Original:  smaller linear program L' whose number of variables and constraints is the number of colour classes of the colour refinement algorithm . (When applied to a linear program, colour refinement yields partitions both of the constraints and of the variables. ) The transformation is such that we can easily (by a linear mapping) transform both feasible and optimal solutions back and forth between the two LPs.
Revised:  smaller linear program L' whose number of variables and constraints is the number of colour classes of the colour refinement algorithm . (When applied to a linear program, colour refinement yields partitions both of the constraints and of the variables. ) The transformation is such that we can easily (by a linear mapping) map both feasible and optimal solutions back and forth between the two LPs.
Edit intent: clarity
Original:  We demonstrate empirically that colour refinement can indeed greatly reduce the cost of solving linear programs . A precusor of the method proposed here has been applied successfully by the second and third author (jointly with Ahmadi) to MAP inference problems in machine learning (AISTATS 2012) .
Revised:  We demonstrate empirically that colour refinement can indeed greatly reduce the cost of solving linear programs .
Edit intent: coherence
Original: Many types of neurons exhibit spike rate adaptation, mediated by intrinsic slow K+ currents , which effectively inhibit neuronal responses.
Revised: Many types of neurons exhibit spike rate adaptation, mediated by intrinsic slow \mathrm{K , which effectively inhibit neuronal responses.
Edit intent: clarity
Original:  Furthermore, we show how the biophysical parameters of slow K+ conductances contribute to the two different types of adaptation currents and find that Ca++ activated K+ currents are effectively captured by a simple spike-dependent description, while muscarine-sensitive or Na+ activated K+ currents show a dominant subthreshold component.
Revised:  Furthermore, we show how the biophysical parameters of slow \mathrm{K contribute to the two different types of adaptation currents and find that Ca++ activated K+ currents are effectively captured by a simple spike-dependent description, while muscarine-sensitive or Na+ activated K+ currents show a dominant subthreshold component.
Edit intent: clarity
Original:  With the exception of Y_5, it is known for all Yao graphs  whether or not they are geometric spanners.
Revised:  It is known for all Yao graphs whether or not they are geometric spanners.
Edit intent: clarity
Original:  We also give a lower bound of 2.87 on the } spanning ratio of all the Yao graphs for odd k > 5. Finally, we revisit the Y_6 graph, which plays a particularly important role as the transition between the graphs (k > 6) for which simple inductive proofs are known, and the graphs (k \le 6) whose best spanning ratios are established by complex arguments.
Revised:  We also give a lower bound of 2.87 on the } spanning ratio of all the Yao graphs for odd k > 5. Finally, we revisit the Y_6 graph, which plays a particularly important role as the transition between the graphs (k > 6) for which simple inductive proofs are known, and the graphs (k \le 6) whose best spanning ratios have been established by complex arguments.
Edit intent: clarity
Original: For the interpretation of neuronal data obtained during functional neurosurgery from alert human patients with Parkinsons disease, it is important to know to what extent the behavior of single neurons in the Basal ganglia (BG) depends on the level of consciousness, and to what degree on chronic dopamine depletion.
Revised: For the interpretation of neuronal data obtained during functional neurosurgery from alert human patients with Parkinsons disease, it is important to know to what extent the behavior of single neurons in the Basal Ganglia depends on the level of consciousness, and to what degree on chronic dopamine depletion.
Edit intent: clarity
Original: For the interpretation of neuronal data obtained during functional neurosurgery from alert human patients with Parkinsons disease, it is important to know to what extent the behavior of single neurons in the Basal Ganglia depends on the level of consciousness, and to what degree on chronic dopamine depletion.
Revised: Parkinson's disease is an ongoing challenge to theoretical neuroscience and to medical treatment. During the evolution of the disease, neurodegeneration leads to physiological and anatomical changes that affect the neuronal discharge of the Basal Ganglia depends on the level of consciousness, and to what degree on chronic dopamine depletion.
Edit intent: coherence
Original:  Behaviour change programmes in themselves are unlikely to have a significant impact on overall transmission but may play a critical role in supporting early treatment through helping to avoid stigma and discrimination, ensuring the acceptability of testing and early treatment as well as of compliance.
Revised:  Behaviour change programmes in themselves are unlikely to have a significant impact on overall transmission but may play a critical role in supporting early treatment through helping to avoid stigma and discrimination, ensuring the acceptability of testing and early treatment as well as compliance.
Edit intent: fluency
Original: The outbreak of novel avian influenza (H7N9) in east China attracted much attention in the spring of 2013.
Revised: The attack of novel avian influenza (H7N9) in east China attracted much attention in the spring of 2013.
Edit intent: clarity
Original:  In this paper, we empirically analyze the statistical outbreak patterns of the novel avian influenza and observed several spatial and temporal properties that are similar to the infective diseases.
Revised:  In this paper, we empirically analyze the statistical outbreak patterns of the novel avian influenza and observed several spatial and temporal properties that are similar to other infective diseases.
Edit intent: clarity
Original:  More deeply, using the empirical analysis and modeling studies, we find that the spatio-temporal network that connects the cities with human cases along the order of outbreak timing emerges two-section-power-law edge-length distribution, indicating the picture that several islands with higher and heterogeneous risk straggle in east China.
Revised:  More deeply, using the empirical analysis and modeling studies, we find that the spatio-temporal network that connects the cities with human cases along the order of outbreak timing emerges two-section power-law edge-length distribution, indicating the picture that several islands with higher and heterogeneous risk straggle in east China.
Edit intent: fluency
Original: The attack of novel avian influenza (H7N9) in east China caused  serious health crisis and public panic.
Revised: The attack of novel avian influenza (H7N9) in east China caused a serious health crisis and public panic.
Edit intent: fluency
Original:  In this paper, we empirically analyze the statistical onset patterns of human cases of the novel avian influenza and observed several spatial and temporal properties that are similar to other infective diseases.
Revised:  In this paper, we empirically analyze the onset patterns of human cases of the novel avian influenza and observed several spatial and temporal properties that are similar to other infective diseases.
Edit intent: clarity
Original:  In this paper, we empirically analyze the statistical onset patterns of human cases of the novel avian influenza and observed several spatial and temporal properties that are similar to other infective diseases.
Revised:  In this paper, we empirically analyze the statistical onset patterns of human cases of the novel avian influenza and observe several spatial and temporal properties that are similar to other infective diseases.
Edit intent: fluency
Original:  More deeply, using the empirical analysis and modeling studies, we find that the spatio-temporal network that connects the cities with human cases along the order of outbreak timing emerges two-section power-law edge-length distribution, indicating the picture that several islands with higher and heterogeneous risk straggle in east China.
Revised:  More deeply, using the empirical analysis and modeling studies, we find that the spatio-temporal network that connects the cities with human cases along the order of outbreak timing emerges two-section-power-law edge-length distribution, indicating the picture that several islands with higher and heterogeneous risk straggle in east China.
Edit intent: fluency
Original:  We discuss the advantages of SELL-C-sigma compared to established formats like Compressed Row Storage (CRS) and ELLPACK , and show its suitability on a variety of hardware platforms (Intel Sandy Bridge, Intel Xeon Phi and Nvidia Tesla K20) for a wide range of test matrices from different application areas.
Revised:  We discuss the advantages of SELL-C-sigma compared to established formats like Compressed Row Storage (CRS) and ELLPACK and show its suitability on a variety of hardware platforms (Intel Sandy Bridge, Intel Xeon Phi and Nvidia Tesla K20) for a wide range of test matrices from different application areas.
Edit intent: fluency
Original:  However, run-time monitoring and enforcement of contracts imposes significant and unpredictable overhead and delays the discovery of faulty components to run-time.
Revised:  However, run-time monitoring and enforcement of contracts imposes significant overhead and delays the discovery of faulty components to run-time.
Edit intent: clarity
Original:  However, run-time monitoring and enforcement of contracts imposes significant and unpredictable overhead and delays the discovery of faulty components to run-time.
Revised:  However, run-time monitoring and enforcement of contracts imposes significant and unpredictable overhead and delays discovery of faulty components to run-time.
Edit intent: fluency
Original:  We contribute a lightweight semantic approach to static contract checking of components written in higher-order scripting languages.
Revised:  We contribute a lightweight semantic approach to static contract checking of components written in higher-order dynamic languages.
Edit intent: clarity
Original:  The approach is able to analyze first-class contracts as values , recursive data structures, unknown behavioral values , and control-flow-sensitive reasoning about types that is idiomatic in dynamic languages.
Revised:  The approach is able to analyze first-class contracts , recursive data structures, unknown behavioral values , and control-flow-sensitive reasoning about types that is idiomatic in dynamic languages.
Edit intent: clarity
Original:  The approach is able to analyze first-class contracts as values , recursive data structures, unknown behavioral values , and control-flow-sensitive reasoning about types that is idiomatic in dynamic languages.
Revised:  The approach is able to analyze first-class contracts as values , recursive data structures, unknown functions , and control-flow-sensitive reasoning about types that is idiomatic in dynamic languages.
Edit intent: clarity
Original:  The approach is able to analyze first-class contracts as values , recursive data structures, unknown behavioral values , and control-flow-sensitive reasoning about types that is idiomatic in dynamic languages.
Revised:  The approach is able to analyze first-class contracts as values , recursive data structures, unknown behavioral values , and control-flow-sensitive reasoning about values, which are all idiomatic in dynamic languages.
Edit intent: clarity
Original:  In this paper, we tackle the problem of soft contract verification, which aims to statically prove either complete or partial contract correctness of components, written in an untyped, higher-order language with first-class contracts.
Revised:  To overcome these issues, we present soft contract verification, which aims to statically prove either complete or partial contract correctness of components, written in an untyped, higher-order language with first-class contracts.
Edit intent: clarity
Original:  Our approach uses higher-order symbolic execution that leverages contracts as a rich source of symbolic values , including unknown behavioral values, and employs an updatable heap of contract invariants to reason about flow-sensitive facts.
Revised:  Our approach uses higher-order symbolic execution , leveraging contracts as a rich source of symbolic values , including unknown behavioral values, and employs an updatable heap of contract invariants to reason about flow-sensitive facts.
Edit intent: coherence
Original:  Our approach uses higher-order symbolic execution that leverages contracts as a rich source of symbolic values , including unknown behavioral values, and employs an updatable heap of contract invariants to reason about flow-sensitive facts.
Revised:  Our approach uses higher-order symbolic execution that leverages contracts as a source of symbolic values , including unknown behavioral values, and employs an updatable heap of contract invariants to reason about flow-sensitive facts.
Edit intent: clarity
Original:  Our approach uses higher-order symbolic execution that leverages contracts as a rich source of symbolic values , including unknown behavioral values, and employs an updatable heap of contract invariants to reason about flow-sensitive facts.
Revised:  Our approach uses higher-order symbolic execution that leverages contracts as a rich source of symbolic values including unknown behavioral values, and employs an updatable heap of contract invariants to reason about flow-sensitive facts.
Edit intent: fluency
Original:   The approach is able to analyze first-class contracts, recursive data structures, unknown functions, and control-flow-sensitive reasoning about values, which are all idiomatic in dynamic languages.
Revised:  The approach is able to analyze first-class contracts, recursive data structures, unknown functions, and control-flow-sensitive refinements of values, which are all idiomatic in dynamic languages.
Edit intent: clarity
Original: This study examines the notion of inconsistency .
Revised: We examine the notion of inconsistency .
Edit intent: clarity