wanyu/IteraTeR_v2 huggingface dataset:
Original:  Here we develop an original framework for measuring how citation paths are influenced by two distinct factors: the scientific impact, measured by the citation count c _{i,p the reputation of its central author i, using his/her total citations C_{i . To estimate their relative strength , we perform a longitudinal analysis on the careers of 450 highly-cited scientists and find a citation crossover c_{\times} which makes the strength of the reputation effect distinguishable .
Revised:  Here we develop an original framework for measuring how citation paths are influenced by two distinct factors: the scientific impact, measured by the citation count c _{i,p the reputation of its central author i, using his/her total citations C_{i . To estimate their relative strength , we perform a longitudinal analysis on the careers of 450 highly-cited scientists and find a citation crossover c_{\times} which makes the strength of the reputation effect .
Edit intent: clarity
Original:  Hence, a new publication may gain a significant early advantage corresponding to roughly a 66 %DIFDELCMD < \\%%% %DIF < increase  in the citation rate for each tenfold increase increase in the reputation C_{i}.
Revised:  Hence, a new publication may gain a significant early advantage corresponding to roughly a 66 %DIFDELCMD < \\%%% %DIF < increase in the citation rate for each tenfold increase in C_{i}.
Edit intent: clarity
Original: In the field of population genetics measures of genetic differentiation are widely used to gather information on the structure and the amount of gene flow between populations.
Revised: In the field of population genetics measures of genetic differentiation are widely used to gather information on the structure and gene flow between populations.
Edit intent: clarity
Original:  These indirect measures are based on a number of simplifying assumptions, for instance equal population size and symmetric migration.
Revised:  These measures are based on a number of simplifying assumptions, for instance equal population size and symmetric migration.
Edit intent: clarity
Original:  Structured populations with asymmetric migration patterns, frequently occur in nature and information about directional gene flow would here be of great interest.
Revised:  However, asymmetric migration frequently occurs in nature and information about directional gene flow would here be of great interest.
Edit intent: clarity
Original:  Nevertheless current measures of genetic differentiation cannot be used in such systems without violating the assumptions.
Revised:  Nevertheless current measures of genetic differentiation cannot be used in such systems without violating their assumptions.
Edit intent: clarity
Original:  In such models a large number of parameters are estimated simultaneously and this involves complex optimization algorithms.
Edit intent: coherence
Original:  The procedure is demonstrated with a simulated data set with known migration pattern.
Revised:  Using a simulated dataset with known migration pattern.
Edit intent: clarity
Original: In the field of population genetics measures of genetic differentiation are widely used to gather information on the structure and gene flow between populations.
Revised: Understanding the population structure and patterns of gene flow within species is of fundamental importance to the study of evolution. In the fields of population and evolutionary genetics, measures of genetic differentiation are widely used to gather information on the structure and gene flow between populations.
Edit intent: clarity
Original: In the field of population genetics measures of genetic differentiation are widely used to gather information on the structure and gene flow between populations.
Revised: In the field of population genetics measures of genetic differentiation are commonly used to gather information on the structure and gene flow between populations.
Edit intent: clarity
Original:   However, asymmetric migration frequently occurs in natureand information about directional gene flow would here be of great interest.
Revised:  One potential caveat is that these measures assume gene flow to be symmetric. However, asymmetric migration frequently occurs in natureand information about directional gene flow would here be of great interest.
Edit intent: clarity
Original:  To get information on asymmetric migration patterns from genetic data rather complex models using maximum likelihood or Bayesian approaches generally need to be applied.
Revised:  To get information on asymmetric migration patterns from genetic data , complex models based on maximum likelihood or Bayesian approaches generally need to be applied.
Edit intent: clarity
Original:  Our approach makes it possible to calculate a directional component of genetic differentiation at low computational effort  using any of the classical  measures of genetic differentiation.
Revised:  Our approach makes it possible to calculate a directional component of genetic differentiation at low computational effort , using any of the classical measures of genetic differentiation.
Edit intent: fluency
Original:  The directional measures of genetic differentiation can further be used to calculate asymmetric migration . Using a simulated dataset with known migration, directional differentiation and migration are estimated to show that our method captures relevant properties of migration patterns even at low migration frequencies and with few marker loci .
Revised:  These directional measures of genetic differentiation can further be used to calculate asymmetric migration . Using a simulated dataset with known migration, directional differentiation and migration are estimated to show that our method captures relevant properties of migration patterns even at low migration frequencies and with few marker loci .
Edit intent: fluency
Original:  The directional measures of genetic differentiation can further be used to calculate asymmetric migration . Using a simulated dataset with known migration, directional differentiation and migration are estimated to show that our method captures relevant properties of migration patterns even at low migration frequencies and with few marker loci .
Revised:  The directional measures of genetic differentiation can further be used to calculate directional relative migration and to detect asymmetries in gene flow patterns. This can be done in a user-friendly web application called divMigrate-online introduced in this paper. Using simulated data sets with known gene flow regimes, we demonstrate that the method is capable of resolving complex migration patterns under a range of study designs .
Edit intent: clarity
Original:  As a by-product of our analysis we compute the law of the maximum at all the stopping times.
Revised:  In our analysis we compute the law of the maximum at all the stopping times.
Edit intent: clarity
Original:  Furthermore, this tree can be learned, with probability 1-\delta, using poly \poly (n, A ,1/\epsilon,\log(1/\delta)) membership queries.
Revised:  Furthermore, this tree can be learned, with probability 1-\delta, using \poly (n, A ,1/\epsilon,\log(1/\delta)) membership queries.
Edit intent: fluency
Original:  We consider a  network of cortical spiking neurons with axonal conduction delays and spike timing dependent plasticity (STDP), which is representative of a cortical column or hypercolumn  . Each neuron fires following a Hodgkin-Huxley like dynamics and it is interconnected randomly to another neurons.
Revised:  We consider a network of cortical spiking neurons with axonal conduction delays and spike timing dependent plasticity , representative of a cortical column or hypercolumn . Each neuron fires following a Hodgkin-Huxley like dynamics and it is interconnected randomly to another neurons.
Edit intent: clarity
Original:  This allow us to investigate the  fine temporal structure of complex neuronal signals not just by using the probability distributions associated with inter-spike intervals, but instead considering much more subtle measures accounting for its causal structure .
Revised:  This allow us to investigate the fine temporal ``structures'' of the complex neuronal signals not just by using the probability distributions associated with inter-spike intervals, but instead considering much more subtle measures accounting for its causal structure .
Edit intent: clarity
Original:  This allow us to investigate the  fine temporal structure of complex neuronal signals not just by using the probability distributions associated with inter-spike intervals, but instead considering much more subtle measures accounting for its causal structure .
Revised:  This allow us to investigate the fine temporal structure of complex neuronal signals not just by using the probability distributions associated to the inter spike intervals, but instead considering much more subtle measures accounting for its causal structure .
Edit intent: fluency
Original:  However the generality of this response across T. gondii strains and the underlying mechanism for this pathogenmediated behavioral change remain unknown.
Revised:  However the generality of this response across T. gondii strains and the underlying mechanism for this pathogen mediated behavioral change remain unknown.
Edit intent: fluency
Original:  We show that loss of innate aversion of cat urine is a general trait caused by infection with all three major clonal lineages of parasite.
Revised:  We show that loss of innate aversion of cat urine is a general trait caused by infection with any of the three major clonal lineages of parasite.
Edit intent: clarity
Original:  Surprisingly, we found that infection with an attenuated Type I parasite results in sustained loss of fear at times post infection when neither parasite nor ongoing brain inflammation were detectable.
Revised:  Surprisingly, we found that infection with the attenuated Type I parasite results in sustained loss of fear at times post infection when neither parasite nor ongoing brain inflammation were detectable.
Edit intent: fluency
Original:  Surprisingly, we found that infection with an attenuated Type I parasite results in sustained loss of fear at times post infection when neither parasite nor ongoing brain inflammation were detectable.
Revised:  Surprisingly, we found that infection with an attenuated Type I parasite results in sustained loss of aversion at times post infection when neither parasite nor ongoing brain inflammation were detectable.
Edit intent: clarity
Original:  This suggests that T. gondii-mediated interruption of mouse innate aversion of cats may occur during early acute infection in a permanent manner, not requiring persistence of parasite cysts or continuing brain inflammation.
Revised:  This suggests that T. gondii-mediated interruption of mouse innate aversion of cats may occur during early acute infection in a permanent manner, not requiring persistence of parasitecysts or continuing brain inflammation.
Edit intent: fluency
Original: Given a boolean n by n matrix A we consider arithmetic circuits for computing the transformation x - >Ax over different semirings.
Revised: Given a boolean n by n matrix A we consider arithmetic circuits for computing the transformation x- >Ax over different semirings.
Edit intent: fluency
Original:  Our focus is on separating these models in terms of their circuit complexities.
Revised:  Our focus is on separating these models in terms of their circuit complexities.
Edit intent: fluency
Original:  (2) There are matrices that admit OR-circuits of size O(n), but require SUM-circuits of size \Omega(n ^{3/2 /\log^2n).
Revised:  (2) We construct so-called matrices that admit OR-circuits of size O(n), but require SUM-circuits of size \Omega(n ^{3/2 /\log^2n).
Edit intent: clarity
Original:  (2) There are matrices that admit OR-circuits of size O(n), but require SUM-circuits of size \Omega(n ^{3/2 /\log^2n).
Revised:  (2) There are matrices that admit OR-circuits of size O(n), but require OR-circuits of size \Omega(n ^{3/2 /\log^2n).
Edit intent: fluency
Original:  (3) We consider the task of rewriting \emph{ a given OR-circuit as a XOR-circuit and prove that any subquadratic-time algorithm for this task violates the strong exponential time hypothesis.
Revised:  (3) We consider the task of \emph{ a given OR-circuit as a XOR-circuit and prove that any subquadratic-time algorithm for this task violates the strong exponential time hypothesis.
Edit intent: clarity
Original: The tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages is 2^{n-1 of the state complexity n  . The witness  for R-trivial regular languages is over a ternary alphabet while for J-trivial regular languages over an (n-1) -element alphabet .
Revised: The tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages of the state complexity n . The witness for R-trivial regular languages is over a ternary alphabet while for J-trivial regular languages over an (n-1) -element alphabet .
Edit intent: clarity
Original: The tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages is 2^{n-1 of the state complexity n  . The witness  for R-trivial regular languages is over a ternary alphabet while for J-trivial regular languages over an (n-1) -element alphabet .
Revised: The tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages is 2^{n-1 of the state complexity n . The witness for R-trivial regular languages and (n-1) -element alphabet .
Edit intent: clarity
Original: The tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages is 2^{n-1 of the state complexity n  . The witness  for R-trivial regular languages is over a ternary alphabet while for J-trivial regular languages over an (n-1) -element alphabet .
Revised: The tight upper bound on the state complexity of the reverse of R-trivial and J-trivial regular languages is 2^{n-1 of the state complexity n . The witness for R-trivial regular languages is over a ternary alphabet while for J-trivial regular languages over an (n-1) -ary for J-trivial regular languages .
Edit intent: clarity
Original:  In this paper, we prove that the size of the alphabets cannot be improved, that is, the bound can be met neither by a binary R-trivial regular language nor by a J-trivial regular language over an (n-2)-element alphabet.
Revised:  In this paper, we prove that the bound can be met neither by a binary R-trivial regular language nor by a J-trivial regular language over an (n-2)-element alphabet.
Edit intent: coherence
Original:  We also present tight bounds for binary R-trivial and (n-2)-element  J-trivial regular languages.
Revised:  We provide a characterization of tight bounds for binary R-trivial and (n-2)-element J-trivial regular languages.
Edit intent: clarity
Original:  We also present tight bounds for binary R-trivial and (n-2)-element  J-trivial regular languages.
Revised:  We also present tight bounds for R-trivial and (n-2)-element J-trivial regular languages.
Edit intent: clarity
Original:  Tight bounds for (n-k)-element J-trivial regular languages , for 2 <= k <= n-3, are open.
Revised:  The case of J-trivial regular languages over an (n-k)-element J-trivial regular languages , for 2 <= k <= n-3, are open.
Edit intent: clarity
Original:  Tight bounds for (n-k)-element J-trivial regular languages , for 2 <= k <= n-3, are open.
Revised:  Tight bounds for (n-k)-element J-trivial regular languages , for 2 <= k <= n-3, is open.
Edit intent: fluency
Original: The spectrum {\em  of a first-order logic sentence is the set of natural numbers that are cardinalities of its finite models.
Revised: The {\em of a first-order logic sentence is the set of natural numbers that are cardinalities of its finite models.
Edit intent: clarity
Original:  In particular, we show that they are semilinear.
Edit intent: coherence
Original:  StarPU is a C library that addresses this problem by providing users with ways to define "tasks" to be executed on CPUs or GPUs, along with the dependencies among them, and by automatically scheduling them over all the available processing units.
Revised:  StarPU is a C library to exploit such platforms. It provides users with ways to define "tasks" to be executed on CPUs or GPUs, along with the dependencies among them, and by automatically scheduling them over all the available processing units.
Edit intent: clarity
Original:  For functions f with small spectral norm: 1) there is always an affine subspace with co-dimension O(||\hat f||_1) on which f is a constant;
Revised:  For functions f with small spectral norm: 1) there is an affine subspace with co-dimension O(||\hat f||_1) on which f is a constant;
Edit intent: clarity
Original:  2) there is always a parity decision tree for f with depth O( d ||\hat f||_1 ) and size n^ O( ||\hat f|| _1 ).
Revised:  2) there is a parity decision tree for f with depth O( d ||\hat f||_1 ) and size n^ O( ||\hat f|| _1 ).
Edit intent: clarity
Original:  2) there is always a parity decision tree for f with depth O( d ||\hat f||_1 ) and size n^ O( ||\hat f|| _1 ).
Revised:  2) there is always a parity decision tree with depth O( d ||\hat f||_1 ) and size n^ O( ||\hat f|| _1 ).
Edit intent: clarity
Original:  Can linear programming still be efficiently solved if the returned violation is in another format ?
Revised:  Can linear programming still be efficiently solved if the returned violation is in other formats ?
Edit intent: fluency
Original:  We study this question in a trial-and-error setting : there is an oracle that, upon a proposed solution, returns the index of an arbitrary violated constraint (with the content of the constraint still hidden).
Revised:  We study this question in a trial-and-error framework : there is an oracle that, upon a proposed solution, returns the index of an arbitrary violated constraint (with the content of the constraint still hidden).
Edit intent: clarity
Original:  We study this question in a trial-and-error setting : there is an oracle that, upon a proposed solution, returns the index of an arbitrary violated constraint (with the content of the constraint still hidden).
Revised:  We study this question in a trial-and-error setting : there is an oracle that, upon a proposed solution, returns the index of a violated constraint (with the content of the constraint still hidden).
Edit intent: clarity
Original:  We give an algorithm with running time O(m^{poly(n) L), where m and n are the numbers of constraints and variables, respectively, and L is the input size of the linear program.
Revised:  L), where m and n are the numbers of constraints and variables, respectively, and L is the input size of the linear program.
Edit intent: clarity
Original:  Our proof, inspired by the Gauss-Bonnet Theorem in global differential geometry, is independent of the known and clearly reveals more insights into the problem and  bound.
Revised:  Our proof, inspired by the Gauss-Bonnet Theorem in global differential geometry, is independent of the known and reveals more clear insights into the problem and bound.
Edit intent: fluency
Original:  Our proof, inspired by the Gauss-Bonnet Theorem in global differential geometry, is independent of the known and clearly reveals more insights into the problem and  bound.
Revised:  Our proof, inspired by the Gauss-Bonnet Theorem in global differential geometry, is independent of the known and clearly reveals more insights into the problem and the bound.
Edit intent: fluency
Original:  On both sides the project reached clear successes and modified the state-of-the-art.
Edit intent: coherence
Original:   In this paper, we propose a new method for processing RNA-sequencing data that yields gene expression estimates that are much more similar to corresponding estimates from microarray data, hence greatly improving cross-platform comparability.
Revised:  In this paper, we propose a new method for processing RNA-seq data that yields gene expression estimates that are much more similar to corresponding estimates from microarray data, hence greatly improving cross-platform comparability.
Edit intent: fluency
Original:  The method we call PREBS is based on estimating the expression only from microarray probe regions, and processing these estimates with microarray summarisation algorithm RMA. This allows new ways of using RNA-sequencing data, such as expression estimation for microarray probe sets.
Revised:  The method we call PREBS is based on estimating the expression from RNA-seq reads overlapping the microarray probe regions, and processing these estimates with microarray summarisation algorithm RMA. This allows new ways of using RNA-sequencing data, such as expression estimation for microarray probe sets.
Edit intent: clarity
Original:  The method we call PREBS is based on estimating the expression only from microarray probe regions, and processing these estimates with microarray summarisation algorithm RMA. This allows new ways of using RNA-sequencing data, such as expression estimation for microarray probe sets.
Revised:  The method we call PREBS is based on estimating the expression only from microarray probe regions, and processing these estimates with microarray summarisation algorithm RMA. This allows new ways of using RNA-seq data, such as expression estimation for microarray probe sets.
Edit intent: clarity
Original:  Tidal stream generation is one of the key technologies for extracting and harnessing this potential.
Revised:  Tidal stream generators are one of the key technologies for extracting and harnessing this potential.
Edit intent: clarity
Original:  This naturally leads to the question of where these turbines should be placed within the array area to extract the maximum possible power: the positioning  of the turbines could significantly influence the extracted power, and hence is of major economic interest.
Revised:  This naturally leads to the question of how these turbines should be placed within the array area to extract the maximum possible power: the positioning of the turbines could significantly influence the extracted power, and hence is of major economic interest.
Edit intent: clarity
Original:  This naturally leads to the question of where these turbines should be placed within the array area to extract the maximum possible power: the positioning  of the turbines could significantly influence the extracted power, and hence is of major economic interest.
Revised:  This naturally leads to the question of where these turbines should be configured to extract the maximum possible power: the positioning of the turbines could significantly influence the extracted power, and hence is of major economic interest.
Edit intent: clarity
Original: In this chapter review measures of emergence, self-organization, complexity, homeostasis, and autopoiesis based on information theory.
Revised: This chapter reviews measures of emergence, self-organization, complexity, homeostasis, and autopoiesis based on information theory.
Edit intent: fluency
Original:  The proposed measures can be applied at multiple scales, which can be studied with multi-scale profiles.
Revised:  The proposed measures can be applied at different scales, which can be studied with multi-scale profiles.
Edit intent: clarity
Original:  Emergence is defined as the information produced by a system or process  . Self-organization is defined as the opposite of emergence, while complexity is defined as the balance between emergence and self-organization.
Revised:  Emergence is defined as the information a system or process . Self-organization is defined as the opposite of emergence, while complexity is defined as the balance between emergence and self-organization.
Edit intent: clarity
Original:  Emergence is defined as the information produced by a system or process  . Self-organization is defined as the opposite of emergence, while complexity is defined as the balance between emergence and self-organization.
Revised:  Emergence is defined as the information produced by a system or process produces . Self-organization is defined as the opposite of emergence, while complexity is defined as the balance between emergence and self-organization.
Edit intent: clarity