wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our model network is made of only non-aging components - the functionality of gene interactions decrease with a constant mortality rate.
Revised:  Our network model is made of only non-aging components - the functionality of gene interactions decrease with a constant mortality rate.
Edit intent: clarity
Original:  Our model network is made of only non-aging components - the functionality of gene interactions decrease with a constant mortality rate.
Revised:  Our model network is made of only non-aging components - the biological functions of gene interactions decrease with a constant mortality rate.
Edit intent: clarity
Original:  Interactions among genes are modeled to be inherently stochastic due to limited numbers of functional molecules of gene products .
Revised:  Gene interactions are stochastic based on a binomial distribution .
Edit intent: clarity
Original:  We show that characteristics of biological aging, the exponential increase of mortality rate over time, can arise from this gene network model  .
Revised:  We show that the defining characteristic of biological aging, the exponential increase of mortality rate over time, can arise from this gene network model .
Edit intent: clarity
Original:  This theoretic framework offers a mechanistic foundation for the pleiotropic nature of aging and can provide insights on interpretation of experimental data .
Revised:  This theoretic framework offers a mechanistic foundation for the pleiotropic nature of aging and can provide insights on cellular aging .
Edit intent: clarity
Original:  They are rigid enough to resist large internal pressures, but also surprisingly plastic to grow under a wide range of external forces and geometric constraints.
Revised:  They are rigid to resist large internal pressures, but also surprisingly plastic to grow under a wide range of external forces and geometric constraints.
Edit intent: clarity
Original:  They are rigid enough to resist large internal pressures, but also surprisingly plastic to grow under a wide range of external forces and geometric constraints.
Revised:  They are rigid enough to resist large internal pressures, but remarkably plastic to adapt to a wide range of external forces and geometric constraints.
Edit intent: clarity
Original:  Our experimental results are in a good quantitative agreement with the predictions of  dislocation-mediated cell-wall growth.
Revised:  Our experimental results are in quantitative agreement with the predictions of dislocation-mediated cell-wall growth.
Edit intent: clarity
Original:  These findings provide insight into how bacteria use the material properties of cell walls to robustly maintain their shape under varying physical environments.
Revised:  These findings provide insight into how living cells robustly maintain their shape under varying physical environments.
Edit intent: clarity
Original:  It is known that a point sequence in R^d that is order-type homogeneous , forms the vertex set of a convex polytope that is combinatorially equivalent to a cyclic polytope in R^d.
Revised:  It is known that a point sequence in R^d that is order-type homogeneous forms the vertex set of a convex polytope that is combinatorially equivalent to a cyclic polytope in R^d.
Edit intent: fluency
Original:  Two famous theorems of Erdos and Szekeres from 1935 , imply that OT _{1 (n) = \Theta (n^2) and OT_2(n) = 2 ^{\Theta(n) . For d \geq 3, we give new bounds for OT_d(n).
Revised:  Two famous theorems of Erdos and Szekeres from 1935 imply that OT _{1 (n) = \Theta (n^2) and OT_2(n) = 2 ^{\Theta(n) . For d \geq 3, we give new bounds for OT_d(n).
Edit intent: fluency
Original:  Two famous theorems of Erdos and Szekeres from 1935 , imply that OT _{1 (n) = \Theta (n^2) and OT_2(n) = 2 ^{\Theta(n) . For d \geq 3, we give new bounds for OT_d(n).
Revised:  Two famous theorems of Erdos and Szekeres from 1935 , imply that OT _1 (n) = \Theta (n^2) and OT_2(n) = 2 ^{\Theta(n) . For d \geq 3, we give new bounds for OT_d(n).
Edit intent: fluency
Original:  Two famous theorems of Erdos and Szekeres from 1935 , imply that OT _{1 (n) = \Theta (n^2) and OT_2(n) = 2 ^{\Theta(n) . For d \geq 3, we give new bounds for OT_d(n).
Revised:  Two famous theorems of Erdos and Szekeres from 1935 , imply that OT _{1 (n) = Theta (n^2) and OT_2(n) = 2 ^{\Theta(n) . For d \geq 3, we give new bounds for OT_d(n).
Edit intent: fluency
Original:  Two famous theorems of Erdos and Szekeres from 1935 , imply that OT _{1 (n) = \Theta (n^2) and OT_2(n) = 2 ^{\Theta(n) . For d \geq 3, we give new bounds for OT_d(n).
Revised:  Two famous theorems of Erdos and Szekeres from 1935 , imply that OT _{1 (n) = \Theta (n^2) and OT_2(n) = 2 ^(Theta(n)) . For d \geq 3, we give new bounds for OT_d(n).
Edit intent: fluency
Original:  12 (2007), 808-847), we characterise this distribution via the fixation probability of the offspring of all individuals of favourable type (regardless of the offsprings' types).
Revised:  12 (2007), 808-847), we characterise this distribution via the fixation probability of the offspring of all individuals of favourable type (regardless of the offspring's types).
Edit intent: fluency
Original: This Letter studies the computational complexity of quantum discord -- a measure of quantum correlation beyond quantum entanglement , and proves the NP-completeness of computing quantum discord .
Revised: This paper studies the computational complexity of quantum discord -- a measure of quantum correlation beyond quantum entanglement , and proves the NP-completeness of computing quantum discord .
Edit intent: fluency
Original: This Letter studies the computational complexity of quantum discord -- a measure of quantum correlation beyond quantum entanglement , and proves the NP-completeness of computing quantum discord .
Revised: This Letter studies the computational complexity of quantum discord ( a measure of quantum correlation beyond quantum entanglement , and proves the NP-completeness of computing quantum discord .
Edit intent: fluency
Original: This Letter studies the computational complexity of quantum discord -- a measure of quantum correlation beyond quantum entanglement , and proves the NP-completeness of computing quantum discord .
Revised: This Letter studies the computational complexity of quantum discord -- a measure of quantum correlation beyond entanglement) , and proves the NP-completeness of computing quantum discord .
Edit intent: fluency
Original:  Therefore quantum discord is commonly believed computationally intractable in the sense that the running time of any algorithm for quantum discord scales at least exponentially with the dimension of the Hilbert space, which imposes serious fundamental limitations on the future development of quantum discord.
Revised:  Therefore quantum discord is computationally intractable in the sense that the running time of any algorithm for quantum discord scales at least exponentially with the dimension of the Hilbert space, which imposes serious fundamental limitations on the future development of quantum discord.
Edit intent: clarity
Original:  Therefore quantum discord is commonly believed computationally intractable in the sense that the running time of any algorithm for quantum discord scales at least exponentially with the dimension of the Hilbert space, which imposes serious fundamental limitations on the future development of quantum discord.
Revised:  Therefore quantum discord is commonly believed computationally intractable in the sense that the running time of any algorithm for quantum discord is believed to scale exponentially with the dimension of the Hilbert space, which imposes serious fundamental limitations on the future development of quantum discord.
Edit intent: clarity
Original:  Therefore quantum discord is commonly believed computationally intractable in the sense that the running time of any algorithm for quantum discord scales at least exponentially with the dimension of the Hilbert space, which imposes serious fundamental limitations on the future development of quantum discord.
Revised:  Therefore quantum discord is commonly believed computationally intractable in the sense that the running time of any algorithm for quantum discord scales at least exponentially with the dimension of the Hilbert space, which imposes serious fundamental limitations on quantum discord.
Edit intent: clarity
Original:  As by-products several entanglement measures, namely entanglement cost, entanglement of formation, relative entropy of entanglement, and squashed entanglement are NP-hard (or NP-complete) to compute .
Revised:  As by-products several entanglement measures, namely entanglement cost, entanglement of formation, relative entropy of entanglement, and squashed entanglement are NP-hard (or NP-complete) .
Edit intent: clarity
Original:  In addition, I prove the NP-completeness of two relevant problems  : linear optimization over classical states and determining whether there are classical states in a given convex set of states, providing strong evidence that working with classical states is generically computationally intractable.
Revised:  Moreover, the NP-completeness of two relevant problems : linear optimization over classical states and determining whether there are classical states in a given convex set of states, providing strong evidence that working with classical states is generically computationally intractable.
Edit intent: coherence
Original:  In addition, I prove the NP-completeness of two relevant problems  : linear optimization over classical states and determining whether there are classical states in a given convex set of states, providing strong evidence that working with classical states is generically computationally intractable.
Revised:  In addition, I prove the NP-completeness of two relevant problems is proved : linear optimization over classical states and determining whether there are classical states in a given convex set of states, providing strong evidence that working with classical states is generically computationally intractable.
Edit intent: coherence
Original:  In addition, I prove the NP-completeness of two relevant problems  : linear optimization over classical states and determining whether there are classical states in a given convex set of states, providing strong evidence that working with classical states is generically computationally intractable.
Revised:  In addition, I prove the NP-completeness of two relevant problems : linear optimization over classical states and detecting classical states in a given convex set of states, providing strong evidence that working with classical states is generically computationally intractable.
Edit intent: clarity
Original:  In addition, I prove the NP-completeness of two relevant problems  : linear optimization over classical states and determining whether there are classical states in a given convex set of states, providing strong evidence that working with classical states is generically computationally intractable.
Revised:  In addition, I prove the NP-completeness of two relevant problems : linear optimization over classical states and determining whether there are classical states in a given convex set , providing evidences that working with classical states is generically computationally intractable.
Edit intent: clarity
Original: This paper studies the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and proves that quantum discord is NP-complete.
Revised: We study the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and proves that quantum discord is NP-complete.
Edit intent: clarity
Original: This paper studies the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and proves that quantum discord is NP-complete.
Revised: This paper studies the computational complexity of quantum discord (a measure of quantum correlation beyond entanglement), and prove that computing quantum discord is NP-complete.
Edit intent: clarity
Original:  Therefore, quantum discord is computationally intractable in the sense that the running time of any algorithm for  quantum discord is believed to scale exponentially with the dimension of the Hilbert space , which imposes serious fundamental limitations on quantum discord .
Revised:  Therefore, quantum discord is computationally intractable : the running time of any algorithm for quantum discord is believed to scale exponentially with the dimension of the Hilbert space , which imposes serious fundamental limitations on quantum discord .
Edit intent: coherence
Original:  Therefore, quantum discord is computationally intractable in the sense that the running time of any algorithm for  quantum discord is believed to scale exponentially with the dimension of the Hilbert space , which imposes serious fundamental limitations on quantum discord .
Revised:  Therefore, quantum discord is computationally intractable in the sense that the running time of any algorithm for computing quantum discord is believed to scale exponentially with the dimension of the Hilbert space , which imposes serious fundamental limitations on quantum discord .
Edit intent: clarity
Original:  Therefore, quantum discord is computationally intractable in the sense that the running time of any algorithm for  quantum discord is believed to scale exponentially with the dimension of the Hilbert space , which imposes serious fundamental limitations on quantum discord .
Revised:  Therefore, quantum discord is computationally intractable in the sense that the running time of any algorithm for quantum discord is believed to grow exponentially with the dimension of the Hilbert space , which imposes serious fundamental limitations on quantum discord .
Edit intent: clarity
Original:  As by-products several entanglement measures , namely entanglement cost, entanglement of formation, relative entropy of entanglement, and squashed entanglement are NP-hard (or NP-complete ) .
Revised:  As by-products , some entanglement measures ( namely entanglement cost, entanglement of formation, relative entropy of entanglement, and squashed entanglement are NP-hard (or NP-complete ) .
Edit intent: clarity
Original:  As by-products several entanglement measures , namely entanglement cost, entanglement of formation, relative entropy of entanglement, and squashed entanglement are NP-hard (or NP-complete ) .
Revised:  As by-products several entanglement measures , namely entanglement cost, entanglement of formation, relative entropy of entanglement, and squashed entanglement are NP-hard / NP-complete ) .
Edit intent: coherence
Original:  As by-products several entanglement measures , namely entanglement cost, entanglement of formation, relative entropy of entanglement, and squashed entanglement are NP-hard (or NP-complete ) .
Revised:  As by-products several entanglement measures , namely entanglement cost, entanglement of formation, relative entropy of entanglement, and squashed entanglement are NP-hard (or NP-complete to compute .
Edit intent: clarity
Original:  Moreover,  the NP-completeness of two relevant problemsis proved : linear optimization over classical states and detecting classical states in a given convex set, providing evidences that working with classical states is generically computationally intractable.
Revised:  Moreover, we prove the NP-completeness of two relevant problemsis proved : linear optimization over classical states and detecting classical states in a given convex set, providing evidences that working with classical states is generically computationally intractable.
Edit intent: clarity
Original:  Moreover,  the NP-completeness of two relevant problemsis proved : linear optimization over classical states and detecting classical states in a given convex set, providing evidences that working with classical states is generically computationally intractable.
Revised:  Moreover, the NP-completeness of two typical problems : linear optimization over classical states and detecting classical states in a given convex set, providing evidences that working with classical states is generically computationally intractable.
Edit intent: clarity
Original:  Moreover,  the NP-completeness of two relevant problemsis proved : linear optimization over classical states and detecting classical states in a given convex set, providing evidences that working with classical states is generically computationally intractable.
Revised:  Moreover, the NP-completeness of two relevant problemsis proved : linear optimization over classical states and detecting classical states in a convex set, providing evidences that working with classical states is generically computationally intractable.
Edit intent: clarity
Original:  Moreover,  the NP-completeness of two relevant problemsis proved : linear optimization over classical states and detecting classical states in a given convex set, providing evidences that working with classical states is generically computationally intractable.
Revised:  Moreover, the NP-completeness of two relevant problemsis proved : linear optimization over classical states and detecting classical states in a given convex set, providing evidence that working with classical states is generically computationally intractable.
Edit intent: fluency
Original: In this article , we consider European options of type h(X^1_T, X^2_T,\ldots, X^n_T) depending on many underlying assets.
Revised: In this note , we consider European options of type h(X^1_T, X^2_T,\ldots, X^n_T) depending on many underlying assets.
Edit intent: clarity
Original: In this article , we consider European options of type h(X^1_T, X^2_T,\ldots, X^n_T) depending on many underlying assets.
Revised: In this article , we consider European options of type h(X^1_T, X^2_T,\ldots, X^n_T) depending on several underlying assets.
Edit intent: clarity
Original:  Our focus is on estimating coalescent parameters introduced by certain Lambda-coalescents for datasets to large for full likelihood methods  .
Revised:  Estimating coalescent parameters introduced by certain Lambda-coalescents for datasets to large for full likelihood methods .
Edit intent: clarity
Original:  Our focus is on estimating coalescent parameters introduced by certain Lambda-coalescents for datasets to large for full likelihood methods  .
Revised:  Our focus is on estimating coalescent parameters introduced by certain Lambda-coalescents for datasets too large for full likelihood methods .
Edit intent: fluency
Original:  Our focus is on estimating coalescent parameters introduced by certain Lambda-coalescents for datasets to large for full likelihood methods  .
Revised:  Our focus is on estimating coalescent parameters introduced by certain Lambda-coalescents for datasets to large for full likelihood methods is our focus .
Edit intent: clarity
Original:  The properties of the pseudo-likelihood approach are investigated on real and simulated datasets .
Revised:  The properties of the pseudo-likelihood approach are investigated on real and simulated datasets) .
Edit intent: fluency
Original:  In addition, our results yield further support for multiple merger coalescents as an appropriate `null' model at the mitochondrial DNA level for high-fecundity Atlantic cod (Gadus morhua ) .
Revised:  In addition, our results yield further support for multiple merger coalescents as an appropriate `null' model at the mitochondrial DNA level for high-fecundity Atlantic cod ( ) .
Edit intent: clarity
Original: Adding I/O to logic programming is an essential task.
Revised: Adding versatile interactions to goals and queries in logic programming is an essential task.
Edit intent: clarity
Original:  Unfortunately, none of the existing logic languages can model bounded inputs.
Revised:  Unfortunately, existing logic languages can model bounded inputs.
Edit intent: clarity
Original:  We illustrate our idea via \muprolog, an extension of Prolog with bounded inputs .
Revised:  We illustrate our idea via \muprolog, an extension of Prolog with bounded choice goals .
Edit intent: clarity
Original: A graph G is k-degenerated if it can be deleted by subsequent removals of vertices of degree k or less.
Revised: A graph G is k-degenerate if it can be deleted by subsequent removals of vertices of degree k or less.
Edit intent: fluency
Original:  We prove that every planar graph of\ge  order n has a 4-degenerated induced subgraph of order at least 8/9 \cdot n.
Revised:  We prove that every planar graph of\ge order n has a 4-degenerate induced subgraph of order at least 8/9 \cdot n.
Edit intent: fluency
Original:  Several authors have used fitness estimates based on extreme value theory in their work on adaptation.
Revised:  Several authors have used arguments based on extreme value theory in their work on adaptation.
Edit intent: clarity
Original:  Probabilities of mutational trajectories have been determined from such fitness estimates.
Edit intent: clarity
Original:  There are complications with these approaches if fitness is additiv (meaning that fitness effects of mutations sum), or whenever there is more additivity than what one would expect in an uncorrelated fitness landscapes .
Revised:  There are complications with these approaches if fitness is additive (meaning that fitness effects of mutations sum), or whenever there is more additivity than what one would expect in an uncorrelated fitness landscapes .
Edit intent: fluency
Original:  There are complications with these approaches if fitness is additiv (meaning that fitness effects of mutations sum), or whenever there is more additivity than what one would expect in an uncorrelated fitness landscapes .
Revised:  There are complications with these approaches if fitness is additiv (meaning that fitness effects of mutations sum), or whenever there is more additivity than what one would expect in an uncorrelated fitness landscape .
Edit intent: fluency
Original:  However, these approaches have been used in published work, even in situations with substantial amounts of additivity.
Revised:  However, the approaches have been used in published work, even in situations with substantial amounts of additivity.
Edit intent: fluency
Original:   Additivity may cause errors in the estimates of the probabilities of some mutational trajectories by a factor 20 even for rather small examples.
Revised:  Additivity may cause errors in estimates of the probabilities of some mutational trajectories by a factor 20 even for rather small examples.
Edit intent: fluency
Original:  This result holds under the standard assumptions for the estimates under consideration, except for the complication with additivity.
Edit intent: coherence
Original:  As a result  , evolution may appear more predictable than it is  .
Revised:  As a result of this bias , evolution may appear more predictable than it is .
Edit intent: clarity
Original:  Let x be a set of n differential variables, f a finite family of differential polynomials in the ring %DIFDELCMD < \C%%%  \{x\} and f\in %DIFDELCMD < \C%%%  \{x\} another polynomial which vanishes at every solution of the differential equation system f=0 in any differentially closed field containing %DIFDELCMD < \C%%%  . Let d:=\max\{\deg(f), \deg(f)\} and \epsilon:=\max\{2,{ord}(f), {ord}(f)\}.
Revised:  Let x be a set of n differential variables, f a finite family of differential polynomials in the ring %DIFDELCMD < \C%%% K \{x\} and f\in %DIFDELCMD < \C%%% \{x\} another polynomial which vanishes at every solution of the differential equation system f=0 in any differentially closed field containing %DIFDELCMD < \C%%% . Let d:=\max\{\deg(f), \deg(f)\} and \epsilon:=\max\{2,{ord}(f), {ord}(f)\}.
Edit intent: clarity