wanyu/IteraTeR_v2 huggingface dataset:
Original:  Neutral networksfor RNA structures with n bonds are typically fragmented into at least 2^n different neutral componentsthat cannot be connected by single point mutations.
Revised:  Neutral networksfor RNA structures with n bonds typically fragments into at least 2^n different neutral componentsthat cannot be connected by single point mutations.
Edit intent: fluency
Original:  Although they generate the same phenotype, components of a single neutral network are heterogeneous, showing wide variations in their robustness and their evolvability.
Revised:  Although they generate the same phenotype, they show important variations in their robustness and their evolvability.
Edit intent: clarity
Original: We study network loss tomography based on observing average loss rates over a set of paths forming a tree -- an ill-conditioned linear problem for the  link loss probabilities.
Revised: We study network loss tomography based on observing average loss rates over a set of paths forming a tree -- a severely underdetermined linear problem for the link loss probabilities.
Edit intent: clarity
Original:  By considering the placement of lossy links within the tree , we show that sparse solutions remain unique much more often than is commonly supposed.
Revised:  By considering the placement of lossy links within trees , we show that sparse solutions remain unique much more often than is commonly supposed.
Edit intent: fluency
Original:  By considering the placement of lossy links within the tree , we show that sparse solutions remain unique much more often than is commonly supposed.
Revised:  By considering the placement of lossy links within the tree , we show that sparse solutions remain unique more often than is commonly supposed.
Edit intent: clarity
Original:  The switching is achieved by "precode-and-forward ".
Revised:  The switching is achieved by "precode-and-forward ."
Edit intent: fluency
Original:  In particular, the relay precodes the received vector signal by either a zero-forcing matrix or a network-coded matrix.
Revised:  In particular, the relay precodes the received vector signal by either a certain matrix.
Edit intent: clarity
Original:  The switching is achieved by "precode-and-forward . " In particular, the relay precodes the received vector signal by either a certain matrix .
Revised:  The switching is achieved by "precode-and-forward . 
Edit intent: coherence
Original:  With the network-coded precoder, on the other hand, each station receives not only its desired signal with noisebut also self-interference, which can be perfectly canceled.
Revised:  With the network-coded precoder, each station receives not only its desired signal with noisebut also self-interference, which can be perfectly canceled.
Edit intent: coherence
Original:  With the network-coded precoder, on the other hand, each station receives not only its desired signal with noisebut also self-interference, which can be perfectly canceled.
Revised:  With the network-coded precoder, on the other hand, each station receives not only its desired signal and noise, but possibly also self-interference, which can be perfectly canceled.
Edit intent: clarity
Original:  Assuming full channel state information is available at the switch, the design of both precoders for maximizing the minimum received signal-to-noise ratio is investigated.
Revised:  Precoder design for optimizing the received signal-to-noise ratio is investigated.
Edit intent: clarity
Original:  Assuming full channel state information is available at the switch, the design of both precoders for maximizing the minimum received signal-to-noise ratio is investigated.
Revised:  Assuming full channel state information is available at the switch, the design of both precoders for maximizing the minimum received signal-to-noise ratios at the destinations is investigated.
Edit intent: clarity
Original: Equity order flow is persistent in the sense that buy orders tend to be followed by buy orders and sellorders tend to be followed by sell orders.
Revised: Order flow in equity markets is remarkably persistent in the sense that buy orders tend to be followed by buy orders and sellorders tend to be followed by sell orders.
Edit intent: clarity
Original:  We develop a method to decompose the autocorrelation function into splitting and herding components and apply this to order flow data from the London Stock Exchange containing exchange membership identifiers.
Revised:  We develop a method to decompose the autocorrelation function into splitting and herding components and apply this to order flow data from the London Stock Exchange for which we have membership identifiers.
Edit intent: clarity
Original:  needed to solve computational problems---leads to new perspectives on the nature of mathematical knowledge, the strong AI debate, computationalism, the problem of logical omniscience, Hume's problem of induction and Goodman's grue riddle, the foundations of quantum mechanics, economic rationality, closed timelike curves, and several other topics of philosophical interest.
Revised:  needed to solve computational problems---leads to new perspectives on the nature of mathematical knowledge, the strong AI debate, computationalism, the problem of logical omniscience, Hume's problem of induction , Goodman's grue riddle, the foundations of quantum mechanics, economic rationality, closed timelike curves, and several other topics of philosophical interest.
Edit intent: coherence
Original:  The former  yields, at leading order, a SIR model for the hosts, but with a modified incidence rate.
Revised:  The former regime yields, at leading order, a SIR model for the hosts, but with a modified incidence rate.
Edit intent: clarity
Original:  The former  yields, at leading order, a SIR model for the hosts, but with a modified incidence rate.
Revised:  The former yields, at leading order, a SIR model for the hosts, but with a rational incidence rate.
Edit intent: clarity
Original:  Thus , the vector disappears from the model, and the dynamics is similar to a directly contagious disease.
Revised:  In this case , the vector disappears from the model, and the dynamics is similar to a directly contagious disease.
Edit intent: coherence
Original:  In the sequel, we take a different view and we argue that vectors and hosts can have very distinctive intrinsic time-scales, and that such distinctiveness can be extended to the disease dynamics.
Revised:  In the sequel, we take a different view and we argue that vectors and hosts can have very distinctive intrinsic time-scales, and that such distinctiveness extends to the disease dynamics.
Edit intent: fluency
Original:  given by Beigi, QIC '10%DIFDELCMD < ]%%% , which was achieved using a (balanced) 2-out-of-4 instance with constant soundness gap . 2) We give a tight soundness analysis of the protocol of [Chen and Drucker, ArXiV '10], thereby improving their result from a monolithic protocol where Theta(sqrt(N)) provers are needed in order to have any soundness gap, to a protocol with a smooth trade-off between the number of provers k and a soundness gap Omega(k^2/N), as long as k>=Omega(log N).
Revised:  given by %DIFDELCMD < ]%%% , which was achieved using a (balanced) 2-out-of-4 instance with constant soundness gap . 2) We give a tight soundness analysis of the protocol of [Chen and Drucker, ArXiV '10], thereby improving their result from a monolithic protocol where Theta(sqrt(N)) provers are needed in order to have any soundness gap, to a protocol with a smooth trade-off between the number of provers k and a soundness gap Omega(k^2/N), as long as k>=Omega(log N).
Edit intent: clarity
Original:  given by Beigi, QIC '10%DIFDELCMD < ]%%% , which was achieved using a (balanced) 2-out-of-4 instance with constant soundness gap . 2) We give a tight soundness analysis of the protocol of [Chen and Drucker, ArXiV '10], thereby improving their result from a monolithic protocol where Theta(sqrt(N)) provers are needed in order to have any soundness gap, to a protocol with a smooth trade-off between the number of provers k and a soundness gap Omega(k^2/N), as long as k>=Omega(log N).
Revised:  given by Beigi, QIC '10%DIFDELCMD < ]%%% . 2) We give a tight soundness analysis of the protocol of [Chen and Drucker, ArXiV '10], thereby improving their result from a monolithic protocol where Theta(sqrt(N)) provers are needed in order to have any soundness gap, to a protocol with a smooth trade-off between the number of provers k and a soundness gap Omega(k^2/N), as long as k>=Omega(log N).
Edit intent: coherence
Original:  regime, implying that new protocols are needed for any sublinear constant-prover LOCC QMA protocol with an inverse-polynomial soundness gap. 3) We make partial progress towards an open question of [Aaronson et al., ToC '09] about what kinds of NP-complete problems are amenable to sublinear multiple-prover QMA protocols, by observing that a large class of such examples can easily be derived from results already in the PCP literature -
Revised:  regime, implying that new protocols are needed for any sublinear constant-prover LOCC QMA protocol with an inverse-polynomial soundness gap. 3) We make progress towards an open question of [Aaronson et al., ToC '09] about what kinds of NP-complete problems are amenable to sublinear multiple-prover QMA protocols, by observing that a large class of such examples can easily be derived from results already in the PCP literature -
Edit intent: clarity
Original: We study the lattice Green's functions of the face-centered cubic lattice (fcc) in up to six dimensions.
Revised: We study the face-centered cubic lattice (fcc) in up to six dimensions.
Edit intent: clarity
Original: In emissions trading, the initial permit allocation is an intractable issue because it needs to be essentially fair to the participating countries.
Revised: In emissions trading, the initial allocation of permits is an intractable issue because it needs to be essentially fair to the participating countries.
Edit intent: clarity
Original:  There are many ways to distribute a given total amount of emissions permits among countries, but the existing distribution methods  such as auctioning and grandfathering  have been debated.
Revised:  There are many ways to distribute a given total amount of emissions permits among countries, but the existing distribution methods , such as auctioning and grandfathering have been debated.
Edit intent: fluency
Original:  There are many ways to distribute a given total amount of emissions permits among countries, but the existing distribution methods  such as auctioning and grandfathering  have been debated.
Revised:  There are many ways to distribute a given total amount of emissions permits among countries, but the existing distribution methods such as auctioning and grandfathering , have been debated.
Edit intent: fluency
Original:  Here we describe a new model for permit allocation in emissions trading using the Boltzmann distribution.
Revised:  In this paper we describe a new model for permit allocation in emissions trading using the Boltzmann distribution.
Edit intent: clarity
Original:  Here we describe a new model for permit allocation in emissions trading using the Boltzmann distribution.
Revised:  Here we describe a new method for allocating permits in emissions trading using the Boltzmann distribution.
Edit intent: clarity
Original:  The Boltzmann distribution is introduced to permit allocation by combining it with concepts in emissions trading.
Revised:  We introduce the Boltzmann distribution to permit allocation by combining it with concepts in emissions trading.
Edit intent: coherence
Original:  A price determination mechanism for emission permits is then developed in relation to the \beta%DIFDELCMD < } %%% value in the Boltzmann distribution.
Revised:  \beta%DIFDELCMD < } %%% value in the Boltzmann distribution.
Edit intent: clarity
Original:  A price determination mechanism for emission permits is then developed in relation to the \beta%DIFDELCMD < } %%% value in the Boltzmann distribution.
Revised:  A price determination mechanism for emission permits is then developed in relation to the %DIFDELCMD < } %%% value in the Boltzmann distribution.
Edit intent: style
Original:  Finally, it is demonstrated how emissions permits can be practically allocated among participating countries in empirical results .
Revised:  Finally, it is demonstrated how emissions permits can be allocated in practice among participating countries in empirical results .
Edit intent: clarity
Original:  Finally, it is demonstrated how emissions permits can be practically allocated among participating countries in empirical results .
Revised:  Finally, it is demonstrated how emissions permits can be practically allocated among participating countries .
Edit intent: clarity
Original:  The new allocation model using the Boltzmann distribution describes a most probable, natural, and unbiased distribution of emissions permits among multiple countries.
Revised:  The new allocation method using the Boltzmann distribution describes a most probable, natural, and unbiased distribution of emissions permits among multiple countries.
Edit intent: clarity
Original:  The new allocation model using the Boltzmann distribution describes a most probable, natural, and unbiased distribution of emissions permits among multiple countries.
Revised:  The new allocation model using the Boltzmann distribution describes the most probable, natural, and unbiased distribution of emissions permits among multiple countries.
Edit intent: fluency
Original:  Based on its simplicity and versatility, the model using the Boltzmann distribution has potential for various economic and environmental studies .
Revised:  Simple and versatile, this new method holds potential for many economic and environmental studies .
Edit intent: clarity
Original:  Based on its simplicity and versatility, the model using the Boltzmann distribution has potential for various economic and environmental studies .
Revised:  Based on its simplicity and versatility, the model using the Boltzmann distribution has potential for various economic and environmental applications .
Edit intent: clarity
Original: In the many transitions from foraging to agropastoralism it is debated whether innovation in technology or increase of populationis the primary driver .
Revised: In the many transitions from foraging to agropastoralism it is debated whether the primary drivers are innovations in technology or increase of populationis the primary driver .
Edit intent: clarity
Original: In the many transitions from foraging to agropastoralism it is debated whether innovation in technology or increase of populationis the primary driver .
Revised: In the many transitions from foraging to agropastoralism it is debated whether innovation in technology or increases of population .
Edit intent: clarity
Original:  I present a numerical model of the transition to agriculture and discuss this model in the light of the population versus technology debate and in Boserup's analytical frame- work in development theory.
Revised:  I present a numerical model of the transitions to agriculture and discuss this model in the light of the population versus technology debate and in Boserup's analytical frame- work in development theory.
Edit intent: fluency
Original:  I present a numerical model of the transition to agriculture and discuss this model in the light of the population versus technology debate and in Boserup's analytical frame- work in development theory.
Revised:  I present a numerical model of the transition to agriculture and discuss this model in the light of the population versus technology debate and in Boserup's analytical framework in development theory.
Edit intent: fluency
Original:  Although my model is based on ecological-Neomalthusian- principles, the coevolutionary positive feedback relationship between technology and population results in apparent Boserupian behaviour : innovation is greatest when population pressure is highest.
Revised:  Although my model is based on ecological -Neomalthusian- principles, the coevolutionary positive feedback relationship between technology and population results in apparent Boserupian behaviour : innovation is greatest when population pressure is highest.
Edit intent: fluency
Original:  Although my model is based on ecological-Neomalthusian- principles, the coevolutionary positive feedback relationship between technology and population results in apparent Boserupian behaviour : innovation is greatest when population pressure is highest.
Revised:  Although my model is based on ecological-Neomalthusian- principles, the coevolutionary positive feedback relationship between technology and population results in a seemingly Boserupian response : innovation is greatest when population pressure is highest.
Edit intent: clarity
Original:  This outcome is not only visible in the theory-driven reduced model, but is also present in a corresponding "real world" simulator which was tested against archaeological data, and which thus demonstrates the relevance and validity of the coevolutionary model.
Revised:  This outcome is not only visible in the theory-driven reduced model, but is also present in a corresponding "real world" simulator which was tested against archaeological data, demonstrating the relevance and validity of the coevolutionary model.
Edit intent: coherence
Original: We examine the minimum amounts of useful memory for real-time, as opposed to one-way, computation using several different machine models.
Revised: We examine the minimum amount of memory for real-time, as opposed to one-way, computation using several different machine models.
Edit intent: clarity
Original:  In most cases, we are able to show that the lower bounds established using arguments about one-way machines remain tight in the real-time case  .
Revised:  In most cases, we are able to show that the lower bounds for one-way machines remain tight in the real-time case .
Edit intent: clarity
Original: We present new and improved approximation and FPT algorithms for computing rooted and unrooted maximum agreement forests (MAFs) of pairs of  phylogenetic trees.
Revised: We present new and improved fixed-parameter algorithms for computing rooted and unrooted maximum agreement forests (MAFs) of pairs of phylogenetic trees.
Edit intent: clarity
Original: We present new and improved approximation and FPT algorithms for computing rooted and unrooted maximum agreement forests (MAFs) of pairs of  phylogenetic trees.
Revised: We present new and improved approximation and FPT algorithms for computing maximum agreement forests (MAFs) of pairs of phylogenetic trees.
Edit intent: clarity
Original:  These distance metrics are essential tools for understanding reticulate evolution  .
Revised:  These distance measures are essential tools for understanding reticulate evolution .
Edit intent: fluency
Original:  It is speculated below that neural networks can simulate certain quantum computations and, although less potent than quantized particles , they nevertheless are shown to significantly exceed the capabilities of classical deterministic circuits.
Revised:  It is speculated below that neural networks can simulate certain quantum computations and, although less potent than the qubits of quantum physics , they nevertheless are shown to significantly exceed the capabilities of classical deterministic circuits.
Edit intent: clarity
Original: Recurrent neurons, or mock qubits, can store simultaneous true and false with probabilistic behaviors usually reserved for the qubits of quantum physics.
Revised: Recurrent neurons, or "simulated" qubits, can store simultaneous true and false with probabilistic behaviors usually reserved for the qubits of quantum physics.
Edit intent: clarity
Original:  Although possible to construct artificially, mock qubits are intended to explain biological mysteries.
Revised:  Although possible to construct artificially, simulated qubits are intended to explain biological mysteries.
Edit intent: fluency
Original:  Many attempts to solve these problems in the literature work by solving, fixed-size problems and then apply the solution recursively.
Revised:  Many attempts to solve this problems in the literature work by solving, fixed-size problems and then apply the solution recursively.
Edit intent: fluency
Original:  Common phenomena, notably variations in mutation rates across genomes and incongruences between gene lineage histories, often make it necessary to model molecular data as originating from a mixtureof phylogenies.
Revised:  Common phenomena, notably variations in mutation rates across genomes and incongruences between gene lineage histories, often make it necessary to model molecular data as originating from a mixture of phylogenies.
Edit intent: fluency
Original:  The considered multi-agent system with a simple randomized iterating rule achieves an almost sure consensus meanwhile solving the optimization problem z\in \mathds{R^d}\ i=1^n f_i(z), in which the optimal solution set of objective function f_i corresponding to agent i can only be observed by agent i itself.
Revised:  The considered multi-agent system with a simple randomized iterating rule achieves an almost sure consensus meanwhile solving the optimization problem z\in \mathds{R^d}\ i=1^n f_i(z), in which the optimal solution set of objective function f_i can only be observed by agent i itself.
Edit intent: clarity
Original: The paper investigates consensus problem for continuous-time multi-agent systems with time-varying communication graphs when disturbance and uncertainty are considered in the agent dynamics . Borrowing the ideas from input-to-state stability (ISS) and integral input-to-state stability (iISS), robust consensus and integral robust consensus are defined with respect to L_\infty and L_1 norms of the disturbance functions, respectively.
Revised: The paper investigates consensus problem for continuous-time multi-agent systems with time-varying communication graphs subject to process noises . Borrowing the ideas from input-to-state stability (ISS) and integral input-to-state stability (iISS), robust consensus and integral robust consensus are defined with respect to L_\infty and L_1 norms of the disturbance functions, respectively.
Edit intent: clarity
Original:  Several sufficient and necessary connectivity conditions are obtained for the system to reach robust consensus or integral robust consensus, based on which we reach a clear answer to the following basic questionon multi-agent studies : how much communication capacity is required for a multi-agent network to deal with certain amount of disturbance.
Revised:  Sufficient and/or necessary connectivity conditions are obtained for the system to reach robust consensus or integral robust consensus, based on which we reach a clear answer to the following basic questionon multi-agent studies : how much communication capacity is required for a multi-agent network to deal with certain amount of disturbance.
Edit intent: clarity
Original:  Several sufficient and necessary connectivity conditions are obtained for the system to reach robust consensus or integral robust consensus, based on which we reach a clear answer to the following basic questionon multi-agent studies : how much communication capacity is required for a multi-agent network to deal with certain amount of disturbance.
Revised:  Several sufficient and necessary connectivity conditions are obtained for the system to reach robust consensus or integral robust consensus, which answer the question : how much communication capacity is required for a multi-agent network to deal with certain amount of disturbance.
Edit intent: clarity