wanyu/IteraTeR_v2 huggingface dataset:
Original:  The investors can trade continuously on a finite time interval in a money market account as well as a risky security.
Revised:  The investors can trade continuously on a finite time-interval in a money market account as well as a risky security.
Edit intent: fluency
Original:  The investors can trade continuously on a finite time interval in a money market account as well as a risky security.
Revised:  The investors can trade continuously on a finite time interval in a money market account and a single risky security.
Edit intent: clarity
Original:  Besides establishing the existence of an equilibrium, our main result shows that the resulting equilibrium can display a lower risk-free rate and a higher risk premium relative to the usual Pareto efficient equilibrium in complete markets.
Revised:  Besides establishing the existence of an equilibrium, our main result shows that the resulting equilibrium can display both lower interest rates and higher risk premia compared to the Pareto efficient equilibrium in complete markets.
Edit intent: clarity
Original: Yeast glycolysis is considered the prototype of dissipative biochemical oscillator .
Revised: Yeast glycolysis is considered the prototype of dissipative biochemical oscillators .
Edit intent: fluency
Original:  In cellular conditions, under sinusoidal source of glucose, the activity of  enzymes can display either periodic, quasi-periodic or chaotic behavior.
Revised:  In cellular conditions, under sinusoidal source of glucose, the activity of enzymes can display either periodic, quasiperiodic or chaotic behavior.
Edit intent: clarity
Original:  The results of this analysis are three-fold: first, the information flow between the enzymes is not always the same but varies depending on the substrate fluxes and the dynamic characteristics emerging in the system;
Revised:  The results of the analysis are three-fold: first, the information flow between the enzymes is not always the same but varies depending on the substrate fluxes and the dynamic characteristics emerging in the system;
Edit intent: coherence
Original:  and finally, similar to what was previously thought, our analysis reveals in a quantitative manner that the enzyme phosphofructokinase is the key-core of glycolysis , behaving for all conditions as the main source of causality flow .
Revised:  and finally, similar to what was previously thought, our analysis reveals in a quantitative manner that the enzyme phosphofructokinase is the key-core of the metabolic system , behaving for all conditions as the main source of causality flow .
Edit intent: clarity
Original: Phylogenomics approaches developed so far were either too time-consume or don't have a solid evolutionary basis , moreover, no phylogenomics approaches could constructed tree using raw sequencing data straightway .
Revised: Phylogenomic approaches developed thus far are either too time-consuming or lack a solid evolutionary basis , moreover, no phylogenomics approaches could constructed tree using raw sequencing data straightway .
Edit intent: clarity
Original: Phylogenomics approaches developed so far were either too time-consume or don't have a solid evolutionary basis , moreover, no phylogenomics approaches could constructed tree using raw sequencing data straightway .
Revised: Phylogenomics approaches developed so far were either too time-consume or don't have a solid evolutionary basis . Moreover, no phylogenomic approach is capable of constructing a tree directly from unassembled raw sequencing data straightway .
Edit intent: clarity
Original: Phylogenomics approaches developed so far were either too time-consume or don't have a solid evolutionary basis , moreover, no phylogenomics approaches could constructed tree using raw sequencing data straightway .
Revised: Phylogenomics approaches developed so far were either too time-consume or don't have a solid evolutionary basis , moreover, no phylogenomics approaches could constructed tree using raw sequencing data .
Edit intent: coherence
Original:  A new phylogenomics methodHashtree was developed to fix these flaws.
Revised:  A new phylogenomic method, Hashtree, was developed to fix these flaws.
Edit intent: fluency
Original:  A new phylogenomics methodHashtree was developed to fix these flaws.
Revised:  A new phylogenomics methodHashtree was developed to alleviate these flaws.
Edit intent: clarity
Original:  Hashtree represented a species using a hash table , every key in hash table was a K nucleotides long substring ( Kmer) that got from the genomeor reads , the corresponding value was the nucleotide following the Kmer .
Revised:  Hashtree build a hash table for each genome and every key in hash table was a K nucleotides long substring ( Kmer) that got from the genomeor reads , the corresponding value was the nucleotide following the Kmer .
Edit intent: clarity
Original:  Hashtree represented a species using a hash table , every key in hash table was a K nucleotides long substring ( Kmer) that got from the genomeor reads , the corresponding value was the nucleotide following the Kmer .
Revised:  Hashtree represented a species using a hash table , every key in the hash table is a K nucleotide long substring ( Kmer) that got from the genomeor reads , the corresponding value was the nucleotide following the Kmer .
Edit intent: fluency
Original:  Hashtree represented a species using a hash table , every key in hash table was a K nucleotides long substring ( Kmer) that got from the genomeor reads , the corresponding value was the nucleotide following the Kmer .
Revised:  Hashtree represented a species using a hash table , every key in hash table was a K nucleotides long substring ( K-mer) of the genome. For every position of the genome , the corresponding value was the nucleotide following the Kmer .
Edit intent: clarity
Original:  Hashtree represented a species using a hash table , every key in hash table was a K nucleotides long substring ( Kmer) that got from the genomeor reads , the corresponding value was the nucleotide following the Kmer .
Revised:  Hashtree represented a species using a hash table , every key in hash table was a K nucleotides long substring ( Kmer) that got from the genomeor reads , the corresponding value of the key is the nucleotide following the Kmer .
Edit intent: clarity
Original:  Hashtree represented a species using a hash table , every key in hash table was a K nucleotides long substring ( Kmer) that got from the genomeor reads , the corresponding value was the nucleotide following the Kmer .
Revised:  Hashtree represented a species using a hash table , every key in hash table was a K nucleotides long substring ( Kmer) that got from the genomeor reads , the corresponding value was the nucleotide following the K-mer .
Edit intent: fluency
Original:  The distance of two species measured as the proportion of common keys with different value in total common keyswhich intrinsically equal to the single nucleotide substitution probability.
Revised:  The distance between two genomes is measured as the proportion of common keys with different value in total common keyswhich intrinsically equal to the single nucleotide substitution probability.
Edit intent: clarity
Original:  The distance of two species measured as the proportion of common keys with different value in total common keyswhich intrinsically equal to the single nucleotide substitution probability.
Revised:  The distance of two species measured as the proportion of shared keys with different value in total common keyswhich intrinsically equal to the single nucleotide substitution probability.
Edit intent: fluency
Original:  The distance of two species measured as the proportion of common keys with different value in total common keyswhich intrinsically equal to the single nucleotide substitution probability.
Revised:  The distance of two species measured as the proportion of common keys with different values of the total shared keys; the distance is approximately equal to the single nucleotide substitution probability.
Edit intent: clarity
Original:  Hashtree had generated high resolution and high accurate tree using completed genome data and simulated next-generation sequencing data , the trees we constructed was highly confirmed in both topology and branch length with those trees constructed using traditional maximal parsimony and maximal-likehood .
Revised:  Hashtree had generated high resolution and high accurate tree using complete genome data or simulated next-generation sequencing data , the trees we constructed was highly confirmed in both topology and branch length with those trees constructed using traditional maximal parsimony and maximal-likehood .
Edit intent: fluency
Original:  Hashtree had generated high resolution and high accurate tree using completed genome data and simulated next-generation sequencing data , the trees we constructed was highly confirmed in both topology and branch length with those trees constructed using traditional maximal parsimony and maximal-likehood .
Revised:  Hashtree had generated high resolution and high accurate tree using completed genome data and simulated next-generation sequencing data . The trees we constructed was highly confirmed in both topology and branch length with those trees constructed using traditional maximal parsimony and maximal-likehood .
Edit intent: fluency
Original:  Hashtree had generated high resolution and high accurate tree using completed genome data and simulated next-generation sequencing data , the trees we constructed was highly confirmed in both topology and branch length with those trees constructed using traditional maximal parsimony and maximal-likehood .
Revised:  Hashtree had generated high resolution and high accurate tree using completed genome data and simulated next-generation sequencing data , the trees we constructed were highly concordant in both topology and branch length with those trees constructed using traditional maximal parsimony and maximal-likehood .
Edit intent: clarity
Original:  Hashtree had generated high resolution and high accurate tree using completed genome data and simulated next-generation sequencing data , the trees we constructed was highly confirmed in both topology and branch length with those trees constructed using traditional maximal parsimony and maximal-likehood .
Revised:  Hashtree had generated high resolution and high accurate tree using completed genome data and simulated next-generation sequencing data , the trees we constructed was highly confirmed in both topology and branch length with those trees constructed using traditional methods .
Edit intent: clarity
Original:  Hashtree can generate a high-resolution , highly accurate tree using complete genome data or simulated next-generation sequencing data .
Revised:  Hashtree can generate a high-resolution and highly accurate tree using complete genome data or simulated next-generation sequencing data .
Edit intent: fluency
Original: Many models of secure multiparty computation supply each participant with a private random oracle Yao82, Sha79,GMW87,Csi08%DIFDELCMD < ]%%% . If one participant does not have access to a private random oracle, perhaps the other participants may work together to simulate one .
Revised:  Yao82, Sha79,GMW87,Csi08%DIFDELCMD < ]%%% . If one participant does not have access to a private random oracle, perhaps the other participants may work together to simulate one .
Edit intent: clarity
Original:  Our results improve on those laid out by Yao, who asserts one direction of the q = p-1 case in his seminal paper [Yao82]  .
Revised:  Our results improve on those laid out by Yao, who asserts one direction of the q = 1 case in his seminal paper [Yao82] .
Edit intent: clarity
Original:  We also provide a quantitative variant and a three-color variant of the Motzkin-Rabin theorem(which is a colored version of the Sylvester-Gallai theorem ).
Revised:  We also provide a quantitative variant and a three-color variant of the Motzkin-Rabin Theorem ).
Edit intent: coherence
Original:  We then design two scheme that are practically realisable, decentralised approximations of this optimal scheme and operate with different amounts of sensing information.
Revised:  We then design two that are practically realisable, decentralised approximations of this optimal scheme and operate with different amounts of sensing information.
Edit intent: fluency
Original: In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes.
Revised: In this paper we ask which properties of a distributed network can be computed from a little amount of local information provided by its nodes.
Edit intent: clarity
Original:  Each of these n nodes - which only knows its own ID and the IDs of its neighbors - is allowed to send a message of O(log n) bits to some central entity, called the referee.
Revised:  Each of these n nodes -which only knows its own ID and the IDs of its neighbors - is allowed to send a message of O(log n) bits to some central entity, called the referee.
Edit intent: fluency
Original:  Each of these n nodes - which only knows its own ID and the IDs of its neighbors - is allowed to send a message of O(log n) bits to some central entity, called the referee.
Revised:  Each of these n nodes - which only knows its own ID and the IDs of its neighbors- is allowed to send a message of O(log n) bits to some central entity, called the referee.
Edit intent: fluency
Original:  Is it possible for the referee to decide some basic structural properties of the network topology G? We show that simple questions like  "does G contain a triangle (resp., a square) ?"  cannot be solved in general.
Revised:  Is it possible for the referee to decide some basic structural properties of the network topology G? We show that simple questions like , "does G contain a triangle (resp., a square) ?" cannot be solved in general.
Edit intent: fluency
Original:  Is it possible for the referee to decide some basic structural properties of the network topology G? We show that simple questions like  "does G contain a triangle (resp., a square) ?"  cannot be solved in general.
Revised:  Is it possible for the referee to decide some basic structural properties of the network topology G? We show that simple questions like "does G contain a square?", "does G contain a triangle ?" cannot be solved in general.
Edit intent: coherence
Original:  We leave open questions related to the connectivity and the diameter ( of arbitrary graphs ) .
Revised:  We leave open questions related to the connectivity and the diameter ( of arbitrary graphs .
Edit intent: fluency
Original: The demand for Internet services that require frequent updates through small messages, also known as microblogging, has tremendously grown in the past few years.
Revised: The demand for Internet services that require frequent updates through small messages, such as microblogging, has tremendously grown in the past few years.
Edit intent: clarity
Original: The Naming Game (NG) describes the agreement dynamics of a population of agents that interact locally in a pairwise fashion .
Revised: The naming game (NG) describes the agreement dynamics of a population of agents that interact locally in a pairwise fashion .
Edit intent: fluency
Original:  In recent years , statistical physics tools and techniques have greatly contributed to shed light on its rich phenomenology , pointing out the connection between the microscopic rules and the observed global dynamics .
Revised:  In recent years , statistical physics tools and techniques have greatly contributed to shed light on its rich phenomenology .
Edit intent: clarity
Original: We consider rational power series over an alphabet \Sigma with coefficients in a ordered commutative semiring K and characterize them as the free ordered semialgebras in various classes defined by the least pre-fixed point rule and  its dual.
Revised: We consider rational power series over an alphabet \Sigma with coefficients in a ordered commutative semiring K and characterize them as the free ordered K-semialgebras in various classes defined by the least pre-fixed point rule and its dual.
Edit intent: clarity
Original: We consider rational power series over an alphabet \Sigma with coefficients in a ordered commutative semiring K and characterize them as the free ordered semialgebras in various classes defined by the least pre-fixed point rule and  its dual.
Revised: We consider rational power series over an alphabet \Sigma with coefficients in a ordered commutative semiring K and characterize them as the free ordered semialgebras in various classes defined by the least pre-fixed point rule and /or its dual.
Edit intent: fluency
Original:  The number of all subfunctions with non-trivial arity gap of a symmetric function f\in G_{n,k^n with f(0,\ldots,0)\neq 0 is found}  .
Revised:  The number of all subfunctions with non-trivial arity gap ^n with f(0,\ldots,0)\neq 0 is found} .
Edit intent: clarity
Original:  The class G_{p,k 2\leq gap(f) is explicitly determined by the authors and R. Willard in \mbox{ s2,sl2,ros0pt .
Revised:  The class G_{p,k 2\leq gap(f) 0pt .
Edit intent: clarity
Original: In this paper, we provide a novel matrix-analytic approach for studying doubly exponential solution of randomized load balancing models (also known as the supermarket models) with Markovian arrival processes (MAPs) and PH service times.
Revised: In this paper, we provide a novel matrix-analytic approach for studying doubly exponential solutions of randomized load balancing models (also known as the supermarket models) with Markovian arrival processes (MAPs) and PH service times.
Edit intent: fluency
Original: In this paper, we provide a novel matrix-analytic approach for studying doubly exponential solution of randomized load balancing models (also known as the supermarket models) with Markovian arrival processes (MAPs) and PH service times.
Revised: In this paper, we provide a novel matrix-analytic approach for studying doubly exponential solution of randomized load balancing models (also known as supermarket models) with Markovian arrival processes (MAPs) and PH service times.
Edit intent: clarity
Original: In this paper, we provide a novel matrix-analytic approach for studying doubly exponential solution of randomized load balancing models (also known as the supermarket models) with Markovian arrival processes (MAPs) and PH service times.
Revised: In this paper, we provide a novel matrix-analytic approach for studying doubly exponential solution of randomized load balancing models (also known as the supermarket models) with Markovian arrival processes (MAPs) and phase-type (PH) service times.
Edit intent: clarity
Original:  We describe the supermarket model as a system of differential vector equations  , and obtain a close-form solution : doubly exponential structure , for the fixed point of the system of differential vector equations.
Revised:  We describe the supermarket model as a system of differential vector equations , and obtain a closed-form solution with a doubly exponential structure , for the fixed point of the system of differential vector equations.
Edit intent: fluency
Original:  We describe the supermarket model as a system of differential vector equations  , and obtain a close-form solution : doubly exponential structure , for the fixed point of the system of differential vector equations.
Revised:  We describe the supermarket model as a system of differential vector equations , and obtain a close-form solution : doubly exponential structure to the fixed point of the system of differential vector equations.
Edit intent: coherence
Original:  Based on this, we show that the fixed point is decomposited into two groups of information under a product form: the arrival information and the service information, and indicate that the doubly exponential solution to the fixed point is not always unique for more general supermarket models.
Revised:  Based on this, we show that the fixed point can be decomposed into the product of two factors inflecting arrival information and the service information, and indicate that the doubly exponential solution to the fixed point is not always unique for more general supermarket models.
Edit intent: clarity
Original:  Based on this, we show that the fixed point is decomposited into two groups of information under a product form: the arrival information and the service information, and indicate that the doubly exponential solution to the fixed point is not always unique for more general supermarket models.
Revised:  Based on this, we show that the fixed point is decomposited into two groups of information under a product form: the arrival information and service information, and indicate that the doubly exponential solution to the fixed point is not always unique for more general supermarket models.
Edit intent: fluency
Original:  Based on this, we show that the fixed point is decomposited into two groups of information under a product form: the arrival information and the service information, and indicate that the doubly exponential solution to the fixed point is not always unique for more general supermarket models.
Revised:  Based on this, we show that the fixed point is decomposited into two groups of information under a product form: the arrival information and the service information, and further find that the doubly exponential solution to the fixed point is not always unique for more general supermarket models.
Edit intent: clarity
Original:  This paper gains a new understanding how the workload probing can help in load balancing jobs with non-Poisson arrivals and non-exponential service times.
Revised:  This paper gains a new understanding of how workload probing can help in load balancing jobs with non-Poisson arrivals and non-exponential service times.
Edit intent: clarity
Original:  This extends some similar previous results (Mozes'90, Goodmann-Strauss '98) in a much shorter presentation.
Revised:  This extends some similar previous results (Mozes'90, Goodman-Strauss '98) in a much shorter presentation.
Edit intent: fluency
Original:  This paper explores one aspect of data models--the meaning of foreign key relationships--and proposes an alternative representation for the purpose of data modeling .
Revised:  This paper explores one aspect of data models--the meaning of foreign key relationships--and proposes an alternative representation .
Edit intent: clarity
Original:  This paper explores one aspect of data models--the meaning of foreign key relationships--and proposes an alternative representation .
Revised:  This paper explores one aspect of relational data models, the meaning of foreign key relationships--and proposes an alternative representation .
Edit intent: clarity
Original:  This paper explores one aspect of data models--the meaning of foreign key relationships--and proposes an alternative representation .
Revised:  This paper explores one aspect of data models--the meaning of foreign key relationships .
Edit intent: clarity
Original:  We observe that a foreign key produces a table relationship that generally references either (1) an entity or (2) repeating attributes.
Revised:  We observe that a foreign key produces a table relationship that generally references either an entity or (2) repeating attributes.
Edit intent: fluency
Original:  We observe that a foreign key produces a table relationship that generally references either (1) an entity or (2) repeating attributes.
Revised:  We observe that a foreign key produces a table relationship that generally references either (1) an entity or repeating attributes.
Edit intent: clarity
Original:  These two cases also correspond to the creation of new tables in the process of database normalization.
Edit intent: coherence
Original:  This paper proposes the use of abstract attributes that capture these table relationships , and suggests that this approach leads to intuitive data models and encourages normalization.
Revised:  This paper proposes the use of abstract attributes that capture these table relationships , and suggests that the method promotes intuitive data modeling and normalization.
Edit intent: clarity