wanyu/IteraTeR_full_sent huggingface dataset:
Original: This region belongs to the N-terminal unstructured region ( 1-123 ) of prion proteins , the structure of which has proved hard to determine using NMR spectroscopy or X-ray crystallography due to the insoluble and noncrystalline nature of the amyloid fibril . However, computer computational optimization can easily obtain a description of this peptide at a submicroscopic level. The hybrid methods presented in this paper will be applied to construct amyloid fibril molecular structures of the prion 113-120 region .
Revised: This region belongs to the N-terminal unstructured region ( 1-123 ) of prion proteins , the structure of which has proved hard to determine using NMR spectroscopy or X-ray crystallography due to the insoluble and noncrystalline nature of the amyloid fibril , little structural data on the AGAAAAGA is available. This paper introduces a simple optimization strategy approach to address the 3D atomic-resolution structure of prion AGAAAAGA amyloid fibrils. Atomic-resolution structures of prion AGAAAAGA amyloid fibrils got in this paper are useful for the drive to find treatments for prion diseases in the field of medicinal chemistry .
Edit intent: meaning-changed
Original:  The proposed method uses modified Kuiper and Kolmogorov- Smirnov (KS) distances to achieve low computational complexity and outperforms the state of the art methods based on cumulants and goodness-of-fit (GoF) tests.
Revised:  The proposed method uses modified Kuiper and Kolmogorov-Smirnov distances to achieve low computational complexity and outperforms the state of the art methods based on cumulants and goodness-of-fit (GoF) tests.
Edit intent: clarity
Original:  The proposed method uses modified Kuiper and Kolmogorov- Smirnov (KS) distances to achieve low computational complexity and outperforms the state of the art methods based on cumulants and goodness-of-fit (GoF) tests.
Revised:  The proposed method uses modified Kuiper and Kolmogorov- Smirnov (KS) distances to achieve low computational complexity and outperforms the state of the art methods based on cumulants and goodness-of-fit tests.
Edit intent: clarity
Original:  On the contrary, consideration of quantum circuits/protocols URLanic molecules as software and hardware of living systems that are co-optimized during evolution, may be useful to pass over the difficulties raised by biochemical complexity and to understand the physics of life.
Revised:  On the contrary, consideration of quantum circuits/protocols URLanic molecules as software and hardware of living systems that are co-optimized during evolution, may be useful to overcome the difficulties raised by biochemical complexity and to understand the physics of life.
Edit intent: clarity
Original:  In this sense, we model DNA replication with a reliable qubit representation of the nucleotides: 1) molecular recognition of a nucleotide is assumed to trigger an intrabase entanglement corresponding to a superposition of different tautomer forms and 2) pairing of complementary nucleotides is described by swapping intrabase entanglements with interbase entanglements.
Revised:  In this sense, we review quantum information-theoretic approaches to the process of DNA replication and propose a new model in which 1) molecular recognition of a nucleotide is assumed to trigger an intrabase entanglement corresponding to a superposition of different tautomer forms and 2) pairing of complementary nucleotides is described by swapping intrabase entanglements with interbase entanglements.
Edit intent: meaning-changed
Original:  In this sense, we model DNA replication with a reliable qubit representation of the nucleotides: 1) molecular recognition of a nucleotide is assumed to trigger an intrabase entanglement corresponding to a superposition of different tautomer forms and 2) pairing of complementary nucleotides is described by swapping intrabase entanglements with interbase entanglements.
Revised:  In this sense, we model DNA replication with a reliable qubit representation of the nucleotides: 1) molecular recognition of a nucleobase is assumed to trigger an intrabase entanglement corresponding to a superposition of different tautomer forms and 2) pairing of complementary nucleotides is described by swapping intrabase entanglements with interbase entanglements.
Edit intent: clarity
Original:  In this sense, we model DNA replication with a reliable qubit representation of the nucleotides: 1) molecular recognition of a nucleotide is assumed to trigger an intrabase entanglement corresponding to a superposition of different tautomer forms and 2) pairing of complementary nucleotides is described by swapping intrabase entanglements with interbase entanglements.
Revised:  In this sense, we model DNA replication with a reliable qubit representation of the nucleotides: 1) molecular recognition of a nucleotide is assumed to trigger an intrabase entanglement corresponding to a superposition of different tautomer forms and 2) pairing of complementary nucleobases is described by swapping intrabase entanglements with interbase entanglements.
Edit intent: fluency
Original: This paper  provides a proof of the Global Attractor Conjecture in the setting where the underlying reaction diagram consists of a single linkage class . The method of partitioning a set of vectors along a sequence is introduced and acts as one of the main analytical tools  .
Revised: This paper provides a proof of the Global Attractor Conjecture in the setting where the underlying reaction diagram consists of a single linkage class , or connected component. The conjecture dates back to the early 1970s and is the most well known and important open problem in the field of chemical reaction network theory. The resolution of the conjecture has important biological and mathematical implications in both the deterministic and stochastic settings. The method of partitioning a set of vectors along a sequence is introduced and acts as one of the main analytical tools .
Edit intent: meaning-changed
Original:  The method of partitioning a set of vectors along a sequence is introduced and acts as one of the main analytical tools throughout .
Revised:  One of our main analytical tools, which is introduced here, will be a method for partitioning the relevant monomials of the dynamical system along sequences of trajectory points into classes with comparable growths. This will allow us to conclude that if a trajectory converges to the boundary, then a whole family of Lyapunov functions decrease along the trajectory, a fact that will allow us to overcome the fact that the usual Lyapunov function used in this setting does not diverge to infinity as trajectories converge to the boundary, which has been the technical sticking point to a proof of the Global Attractor Conjecture over the years .
Edit intent: meaning-changed
Original:  This will allow us to conclude that if a trajectory converges to the boundary, then a whole family of Lyapunov functions decrease along the trajectory , a fact that will allow us to overcome the fact that the usual Lyapunov function used in this setting does not diverge to infinity as trajectories converge to the boundary , which has been the technical sticking point to a proof of the Global Attractor Conjecture over the years .
Revised:  We will use this method to conclude that if a trajectory converges to the boundary, then a whole family of Lyapunov functions decrease along the trajectory , a fact that will allow us to overcome the fact that the usual Lyapunov function used in this setting does not diverge to infinity as trajectories converge to the boundary , which has been the technical sticking point to a proof of the Global Attractor Conjecture over the years .
Edit intent: clarity
Original:  This will allow us to conclude that if a trajectory converges to the boundary, then a whole family of Lyapunov functions decrease along the trajectory , a fact that will allow us to overcome the fact that the usual Lyapunov function used in this setting does not diverge to infinity as trajectories converge to the boundary , which has been the technical sticking point to a proof of the Global Attractor Conjecture over the years .
Revised:  This will allow us to conclude that if a trajectory converges to the boundary, then a whole family of Lyapunov functions decrease along the trajectory . This will allow us to overcome the fact that the usual Lyapunov function used in this setting does not diverge to infinity as trajectories converge to the boundary , which has been the technical sticking point to a proof of the Global Attractor Conjecture over the years .
Edit intent: coherence
Original:  This will allow us to conclude that if a trajectory converges to the boundary, then a whole family of Lyapunov functions decrease along the trajectory , a fact that will allow us to overcome the fact that the usual Lyapunov function used in this setting does not diverge to infinity as trajectories converge to the boundary , which has been the technical sticking point to a proof of the Global Attractor Conjecture over the years .
Revised:  This will allow us to conclude that if a trajectory converges to the boundary, then a whole family of Lyapunov functions decrease along the trajectory , a fact that will allow us to overcome the fact that the usual Lyapunov functions of chemical reaction network theory are bounded on the boundary of the positive orthant , which has been the technical sticking point to a proof of the Global Attractor Conjecture over the years .
Edit intent: meaning-changed
Original:  This will allow us to conclude that if a trajectory converges to the boundary, then a whole family of Lyapunov functions decrease along the trajectory , a fact that will allow us to overcome the fact that the usual Lyapunov function used in this setting does not diverge to infinity as trajectories converge to the boundary , which has been the technical sticking point to a proof of the Global Attractor Conjecture over the years .
Revised:  This will allow us to conclude that if a trajectory converges to the boundary, then a whole family of Lyapunov functions decrease along the trajectory , a fact that will allow us to overcome the fact that the usual Lyapunov function used in this setting does not diverge to infinity as trajectories converge to the boundary , which has been the technical sticking point to a proof of the Global Attractor Conjecture in the past .
Edit intent: clarity
Original:  Diffusion models with several assets and a single state variable lead to the classic turnpike , in which optimal portfolios converge under the physical probability , and to the explicit turnpike , which identifies the limit of optimal portfolios in terms of the solution of an ergodic HJB equation.
Revised:  In diffusion models with several assets and a single state variable lead to the classic turnpike , in which optimal portfolios converge under the physical probability , and to the explicit turnpike , which identifies the limit of optimal portfolios in terms of the solution of an ergodic HJB equation.
Edit intent: fluency
Original:  Diffusion models with several assets and a single state variable lead to the classic turnpike , in which optimal portfolios converge under the physical probability , and to the explicit turnpike , which identifies the limit of optimal portfolios in terms of the solution of an ergodic HJB equation.
Revised:  Diffusion models with several assets and a single state variable , the classic turnpike , in which optimal portfolios converge under the physical probability , and to the explicit turnpike , which identifies the limit of optimal portfolios in terms of the solution of an ergodic HJB equation.
Edit intent: coherence
Original:  Diffusion models with several assets and a single state variable lead to the classic turnpike , in which optimal portfolios converge under the physical probability , and to the explicit turnpike , which identifies the limit of optimal portfolios in terms of the solution of an ergodic HJB equation.
Revised:  Diffusion models with several assets and a single state variable lead to the classic turnpike demonstrates that optimal portfolios converge under the physical probability , and to the explicit turnpike , which identifies the limit of optimal portfolios in terms of the solution of an ergodic HJB equation.
Edit intent: clarity
Original:  Diffusion models with several assets and a single state variable lead to the classic turnpike , in which optimal portfolios converge under the physical probability , and to the explicit turnpike , which identifies the limit of optimal portfolios in terms of the solution of an ergodic HJB equation.
Revised:  Diffusion models with several assets and a single state variable lead to the classic turnpike , in which optimal portfolios converge under the physical probability ; meanwhile the explicit turnpike , which identifies the limit of optimal portfolios in terms of the solution of an ergodic HJB equation.
Edit intent: coherence
Original:  Diffusion models with several assets and a single state variable lead to the classic turnpike , in which optimal portfolios converge under the physical probability , and to the explicit turnpike , which identifies the limit of optimal portfolios in terms of the solution of an ergodic HJB equation.
Revised:  Diffusion models with several assets and a single state variable lead to the classic turnpike , in which optimal portfolios converge under the physical probability , and to the explicit turnpike identifies the limit of optimal portfolios in terms of the solution of an ergodic HJB equation.
Edit intent: coherence
Original:  Diffusion models with several assets and a single state variable lead to the classic turnpike , in which optimal portfolios converge under the physical probability , and to the explicit turnpike , which identifies the limit of optimal portfolios in terms of the solution of an ergodic HJB equation.
Revised:  Diffusion models with several assets and a single state variable lead to the classic turnpike , in which optimal portfolios converge under the physical probability , and to the explicit turnpike , which identifies the limit of finite-horizon optimal portfolios as a long-run myopic portfolio defined in terms of the solution of an ergodic HJB equation.
Edit intent: meaning-changed
Original:  Here we investigate the microscopic symmetriesunderlying this process in large non-sarcomeric bundles with long actin filaments. We prove that contractile behavior requires non-identical motors that generate large enough forces to probe the nonlinear elastic behavior of F-actin.
Revised:  To narrow down the search for possible contraction mechanisms in these systems, we investigate their microscopic symmetries. We show that contractile behavior requires non-identical motors that generate large enough forces to probe the nonlinear elastic behavior of F-actin.
Edit intent: clarity
Original: Countries differ in the diversification of their exports and products differ in the number of countries that export them -their ubiquity.We document a new stylized fact in the global pattern of exports: a relationship between the diversification of a country 's exports and the ubiquity of its products.
Revised: Much of the analysis of economic growth has focused on the study of aggregate output. Here, we deviate from this tradition and look instead at the structure of output embodied in the network connecting countries to the products that they export.We characterize this network using four structural features: the negative relationship between the diversification of a country 's exports and the ubiquity of its products.
Edit intent: meaning-changed
Original: We document a new stylized fact in the global pattern of exports: a relationship between the diversification of a country 's exports and the ubiquity of its products. We argue that this is not implied by current theories of international trade and show that it is not a consequence of the heterogeneity in the level of diversification of countries or of the heterogeneity in the ubiquityof products. We account for this by constructing a model that assumes that each product requires a large number of non-tradable inputs, or capabilities, and that a country can only make the products for which it has all the requisite capabilities.
Revised: We document a new stylized fact in the global pattern of exports: a relationship between the diversification of a country 's exports and the ubiquity of its exports, and the non-normal distributions for product ubiquity, country diversification and product co-export. We model the structure of the network by assuming that products require a large number of non-tradable inputs, or capabilities, and that a country can only make the products for which it has all the requisite capabilities.
Edit intent: clarity
Original:  We account for this by constructing a model that assumes that each product requires a large number of non-tradable inputs, or capabilities, and that a country can only make the products for which it has all the requisite capabilities. Products differ in the number and specific nature of the capabilities they require, as countries differ in the number/nature of the capabilities they have.
Revised:  We account for this by constructing a model that assumes that each product requires a large number of non-tradable inputs, or capabilities, and that countries differ in the number/nature of the capabilities they have.
Edit intent: clarity
Original:  Products that require more capabilities are accessible to fewer countries (are less ubiquitous), while countries that have more capabilities have what is required to make more products (are more diversified). Our model implies that the return to the accumulation of new capabilities increases exponentially with the number of capabilities that a country has and that this convexity increases when either the total number of capabilities that exist in the world increases or the average complexity of products (the number of capabilities they require) increases.
Revised:  We solve the model assuming that the probability that a country has and that this convexity increases when either the total number of capabilities that exist in the world increases or the average complexity of products (the number of capabilities they require) increases.
Edit intent: clarity
Original:  Our model implies that the return to the accumulation of new capabilities increases exponentially with the number of capabilities that a country has and that this convexity increases when either the total number of capabilities that exist in the world increases or the average complexity of products (the number of capabilities they require) increases. This defines a "quiescence trap" in which countries with few capabilities have negligible returns to the accumulation of new capabilities , while countrieswith many capabilities experience large returns to the accumulation of additional capabilities . We calibrate the model to three different sets and show that it reproduces the empirically observed distributions. We conclude that in our world the quiescence trap is strong .
Revised:  Our model implies that the return to the accumulation of new capabilities increases exponentially with the number of capabilities that a country has a capability and that a product requires a capability are constant and calibrate it to the data to find that it accounts well for all of the network features except for the heterogeneity in the distribution of country diversification. In the light of the model, this is evidence of a large heterogeneity in the distribution of capabilities across countries. Finally, we show that the model implies that the increase in diversification that is expected from the accumulation of a small number of capabilities is small for countries that have a few of them and large for those with many. This implies that the forces that help drive divergence in product diversity increase with the complexity of the global economy when capabilities travel poorly .
Edit intent: meaning-changed
Original: Due to the vast space of possible networks and the relatively small amount of data available, inferring genetic networks from gene expression data is one of the most challenging work in the post-genomic era  .
Revised: Due to the vast space of possible networks and the relatively small amount of data available, inferring genetic networks from gene expression data is one of the most challenging work in the post-genomic era , partly due to the vast space of possible networks and the relatively small amount of data available .
Edit intent: coherence
Original:  In the stochastic setting of the Black-Scholes complete market it turns out that the consumption and investment strategies have to satisfy a consistency condition (PDE) if they  come from a classical utility maximisation problem.
Revised:  In the stochastic setting of the Black-Scholes complete market it turns out that the consumption and investment strategies have to satisfy a consistency condition (PDE) if they are to come from a classical utility maximisation problem.
Edit intent: clarity
Original: This paper focuses on designing and analyzing throughput-optimal scheduling policies that avoid the use of per-flow  information, maintain one single data queue for each link, exploit only local information, and potentially improve the delay performance, for multi-hop wireless networks under general interference constraints.
Revised: This paper focuses on designing throughput-optimal scheduling policies that avoid the use of per-flow information, maintain one single data queue for each link, exploit only local information, and potentially improve the delay performance, for multi-hop wireless networks under general interference constraints.
Edit intent: clarity
Original: This paper focuses on designing and analyzing throughput-optimal scheduling policies that avoid the use of per-flow  information, maintain one single data queue for each link, exploit only local information, and potentially improve the delay performance, for multi-hop wireless networks under general interference constraints.
Revised: This paper focuses on designing and analyzing throughput-optimal scheduling policies that avoid using per-flow information, maintain one single data queue for each link, exploit only local information, and potentially improve the delay performance, for multi-hop wireless networks under general interference constraints.
Edit intent: fluency
Original: This paper focuses on designing and analyzing throughput-optimal scheduling policies that avoid the use of per-flow  information, maintain one single data queue for each link, exploit only local information, and potentially improve the delay performance, for multi-hop wireless networks under general interference constraints.
Revised: This paper focuses on designing and analyzing throughput-optimal scheduling policies that avoid the use of per-flow or per-destination information, maintain one single data queue for each link, exploit only local information, and potentially improve the delay performance, for multi-hop wireless networks under general interference constraints.
Edit intent: meaning-changed
Original: This paper focuses on designing and analyzing throughput-optimal scheduling policies that avoid the use of per-flow  information, maintain one single data queue for each link, exploit only local information, and potentially improve the delay performance, for multi-hop wireless networks under general interference constraints.
Revised: This paper focuses on designing and analyzing throughput-optimal scheduling policies that avoid the use of per-flow information, maintain a single data queue for each link, exploit only local information, and potentially improve the delay performance, for multi-hop wireless networks under general interference constraints.
Edit intent: fluency