wanyu/IteraTeR_v2 huggingface dataset:
Original:  and b) aging can occur at different levels, however aging of the body takes place at least on the tissue level, but not necessarily on cellular / molecular level.
Revised:  and b) aging can occur at different levels, however aging of the body takes place at least on the tissue level, but not requiring the aging of cells / molecular level.
Edit intent: clarity
Original:  The Misrepair-accumulation theory introduced in the present paper gives explanations for the aging phenotypes, premature aging, and the difference of longevity in different species, and  is consistent with the point of view of physical theory of complex adaptive systems.
Revised:  This theory gives explanations for the aging phenotypes, premature aging, and the difference of longevity in different species, and is consistent with the point of view of physical theory of complex adaptive systems.
Edit intent: coherence
Original:  The Misrepair-accumulation theory introduced in the present paper gives explanations for the aging phenotypes, premature aging, and the difference of longevity in different species, and  is consistent with the point of view of physical theory of complex adaptive systems.
Revised:  The Misrepair-accumulation theory introduced in the present paper gives explanations for the aging phenotypes, premature aging, the difference of longevity in different species, and is consistent with the point of view of physical theory of complex adaptive systems.
Edit intent: fluency
Original:  The Misrepair-accumulation theory introduced in the present paper gives explanations for the aging phenotypes, premature aging, and the difference of longevity in different species, and  is consistent with the point of view of physical theory of complex adaptive systems.
Revised:  The Misrepair-accumulation theory introduced in the present paper gives explanations for the aging phenotypes, premature aging, and the difference of longevity in different species, and it is consistent with the point of view of physical theory of complex adaptive systems.
Edit intent: coherence
Original:  The Misrepair-accumulation theory introduced in the present paper gives explanations for the aging phenotypes, premature aging, and the difference of longevity in different species, and  is consistent with the point of view of physical theory of complex adaptive systems.
Revised:  The Misrepair-accumulation theory introduced in the present paper gives explanations for the aging phenotypes, premature aging, and the difference of longevity in different species, and is consistent with the physical view on complex systems.
Edit intent: clarity
Original: Glycosylation is a highly complex process to produce a diverse repertoire of cellular glycans that are frequently attached to proteins and lipids.
Revised: Glycosylation is a highly complex process to produce a diverse repertoire of cellular glycans that are attached to proteins and lipids.
Edit intent: clarity
Original:  Glycans participate in fundamental biological processes  including protein folding and clearance, cell proliferation and apoptosis, development, immune response , and pathogenesis.
Revised:  Glycans are involved in fundamental biological processes including protein folding and clearance, cell proliferation and apoptosis, development, immune response , and pathogenesis.
Edit intent: clarity
Original:  Glycans participate in fundamental biological processes  including protein folding and clearance, cell proliferation and apoptosis, development, immune response , and pathogenesis.
Revised:  Glycans participate in fundamental biological processes , including protein folding and clearance, cell proliferation and apoptosis, development, immune response , and pathogenesis.
Edit intent: fluency
Original:  Glycans participate in fundamental biological processes  including protein folding and clearance, cell proliferation and apoptosis, development, immune response , and pathogenesis.
Revised:  Glycans participate in fundamental biological processes including protein folding and clearance, cell proliferation and apoptosis, development, immune responses , and pathogenesis.
Edit intent: fluency
Original:  As one of the major types of glycans, N-linked glycans are formed by sequential attachments of monosaccharides into proteins with the help of a limited number of enzymes.
Revised:  One of the major types of glycans, N-linked glycans are formed by sequential attachments of monosaccharides into proteins with the help of a limited number of enzymes.
Edit intent: fluency
Original:  As one of the major types of glycans, N-linked glycans are formed by sequential attachments of monosaccharides into proteins with the help of a limited number of enzymes.
Revised:  As one of the major types of glycans, N-linked glycans , is formed by sequential attachments of monosaccharides into proteins with the help of a limited number of enzymes.
Edit intent: fluency
Original:  As one of the major types of glycans, N-linked glycans are formed by sequential attachments of monosaccharides into proteins with the help of a limited number of enzymes.
Revised:  As one of the major types of glycans, N-linked glycans are formed by sequential attachments of monosaccharides to proteins by a limited number of enzymes.
Edit intent: clarity
Original:  Many of these enzymes can accept multiple N-linked glycans as substrates, thus generating a large number of glycan intermediates and their intermingled pathways.
Revised:  Many of these enzymes can accept multiple N-linked glycans as substrates, thereby generating a large number of glycan intermediates and their intermingled pathways.
Edit intent: fluency
Original:  The N-linked glycosylation pathways were found to be extremely modular, while composed of cohesive topological modules all directly branched from the common upstream pathway of glycan synthesis.
Revised:  The N-linked glycosylation pathways are extremely modular, while composed of cohesive topological modules all directly branched from the common upstream pathway of glycan synthesis.
Edit intent: coherence
Original:  The N-linked glycosylation pathways were found to be extremely modular, while composed of cohesive topological modules all directly branched from the common upstream pathway of glycan synthesis.
Revised:  The N-linked glycosylation pathways were found to be extremely modular, and are composed of cohesive topological modules all directly branched from the common upstream pathway of glycan synthesis.
Edit intent: coherence
Original:  The N-linked glycosylation pathways were found to be extremely modular, while composed of cohesive topological modules all directly branched from the common upstream pathway of glycan synthesis.
Revised:  The N-linked glycosylation pathways were found to be extremely modular, while composed of cohesive topological modules that directly branch from a common upstream pathway of glycan synthesis.
Edit intent: clarity
Original:  This unique structural property allows the glycan production between modules to be controlled in that upstream region.
Revised:  This unique structural property allows the glycan production between modules to be controlled by the upstream region.
Edit intent: clarity
Original:  Our findings give the experimentally-testable predictions for glycosylation processes, and can be potentially applied to the engineering of therapeutic glycoproteins .
Revised:  Our findings give the experimentally-testable predictions for glycosylation processes, and may be applicable to therapeutic glycoprotein engineering .
Edit intent: clarity
Original:  Application of the thermodynamic formalism lead to the observation of a circadian cycle in the regulatory dynamics of cancer cell-lines.
Edit intent: coherence
Original:  In this paper , we develop a novel algorithm called ZEALOUS that for the first time enables publishing frequent keywords, queries , and clicks from a search log while achieving a very strong privacy guarantee called (e, d)-probabilistic differential privacy . ]  ]  An extensive experimental evaluation shows that search logs published with ZEALOUS can be used for research on both search quality and search efficiency with little loss in utility .
Revised:  In this paper we analyze algorithms to publish frequent keywords, queries , and clicks from a search log while achieving a very strong privacy guarantee called (e, d)-probabilistic differential privacy . ] ] An extensive experimental evaluation shows that search logs published with ZEALOUS can be used for research on both search quality and search efficiency with little loss in utility .
Edit intent: clarity
Original:  In this paper , we develop a novel algorithm called ZEALOUS that for the first time enables publishing frequent keywords, queries , and clicks from a search log while achieving a very strong privacy guarantee called (e, d)-probabilistic differential privacy . ]  ]  An extensive experimental evaluation shows that search logs published with ZEALOUS can be used for research on both search quality and search efficiency with little loss in utility .
Revised:  In this paper , we develop a novel algorithm called ZEALOUS that for the first time enables publishing frequent keywords, queries and clicks of a search log while achieving a very strong privacy guarantee called (e, d)-probabilistic differential privacy . ] ] An extensive experimental evaluation shows that search logs published with ZEALOUS can be used for research on both search quality and search efficiency with little loss in utility .
Edit intent: clarity
Original:  In this paper , we develop a novel algorithm called ZEALOUS that for the first time enables publishing frequent keywords, queries , and clicks from a search log while achieving a very strong privacy guarantee called (e, d)-probabilistic differential privacy . ]  ]  An extensive experimental evaluation shows that search logs published with ZEALOUS can be used for research on both search quality and search efficiency with little loss in utility .
Revised:  In this paper , we develop a novel algorithm called ZEALOUS that for the first time enables publishing frequent keywords, queries , and clicks from a search log while achieving a very strong privacy guarantee called (e, d)-probabilistic differential privacy . ] ] An extensive experimental evaluation compares the utility of the algorithms for two applications targeted at search quality and search efficiency with little loss in utility .
Edit intent: clarity
Original:  In this paper we analyze algorithms to publish frequent keywords, queries and clicks of a search log.
Revised:  In this paper we analyze algorithms for publishing frequent keywords, queries and clicks of a search log.
Edit intent: fluency
Original:  In particular, we show how proposals to achieve anonymity 1, 15, 27%DIFDELCMD < ] %%% can be attacked.
Revised:  In particular, we show how proposals to achieve anonymity %DIFDELCMD < ] %%% can be attacked.
Edit intent: coherence
Original:  While for one of them an algorithm has been previously proposed 20%DIFDELCMD < ] %%% we show how to guarantee the other strictly stronger relaxation.
Revised:  While for one of them an algorithm has been previously proposed %DIFDELCMD < ] %%% we show how to guarantee the other strictly stronger relaxation.
Edit intent: fluency
Original:  We find that our proposal to achieve a relaxation of differential privacy ]  yields comparable utility to a proposal that achieves anonymity while at the same time offering a much stronger guarantee .
Revised:  We find that our proposal to achieve a relaxation of differential privacy ] yields comparable utility to a proposal that achieves anonymity while at the same time achieving much stronger privacy guarantees .
Edit intent: clarity
Original:  After a brief presentation, this paperlooks at the relation between the P-NP question and the "Deterministic" versus "Non Deterministic" nature of a problem  .
Revised:  In this paper, we look at the link between the P - NP question and the "Deterministic" versus "Non Deterministic" nature of a problem .
Edit intent: clarity
Original:  Using the meta Mathematical argument that proofs should not have any reference to time , the paper shows that the "Pis not equal to NP " assertion is impossible to prove in the deterministic or time independent framework of Mathematics.
Revised:  Using the meta Mathematical argument that proofs should not have any reference to time , the paper shows that the P!=NP assertion is impossible to prove in the deterministic or time independent framework of Mathematics.
Edit intent: clarity
Original:  A similar argument based on randomness shows that the "Pis equal to NP " assertion is also impossible to prove, so that the P-NP problem turns to be undecidable in the framework of Mathematics .
Revised:  A similar argument based on randomness shows that the P=NP assertion is also impossible to prove, so that the P-NP problem turns to be undecidable in the framework of Mathematics .
Edit intent: clarity
Original:  A similar argument based on randomness shows that the P = NP assertion is also impossible to prove, so that the P - NP problem turns out to be "unprovable" in Mathematics.
Revised:  A similar argument based on randomness to show that the P = NP assertion is also impossible to prove, so that the P - NP problem turns out to be "unprovable" in Mathematics.
Edit intent: coherence
Original:  A similar argument based on randomness shows that the P = NP assertion is also impossible to prove, so that the P - NP problem turns out to be "unprovable" in Mathematics.
Revised:  A similar argument based on randomness shows that the P = NP assertion was also impossible to prove, so that the P - NP problem turns out to be "unprovable" in Mathematics.
Edit intent: fluency
Original: Polynomial time preprocessing to reduce instance size is one of the most commonly deployed heuristics to tackle computationally hard problems.
Edit intent: coherence
Original:  The problem is said to admit a polynomial kernel if, in polynomial time, we can reduce the size of the instance I to a polynomial in k, while preserving the answer.
Revised:  The problem is said to admit a polynomial kernel if, in polynomial time, one can reduce the size of the instance I to a polynomial in k, while preserving the answer.
Edit intent: clarity
Original:  In this paper, we show that all problems expressible in Counting Monadic Second Order Logic and satisfying a compactness property admit a polynomial kernel on graphs of bounded genus.
Revised:  In this paper, we show that all problems expressible in Counting Monadic Second Order Logic and satisfying a coverability property admit a polynomial kernel on graphs of bounded genus.
Edit intent: clarity
Original:  Our second result is that all problems that have finite integer index and satisfy a weaker compactness condition admit a linear kernel on graphs of bounded genus.
Revised:  Our second result is that all problems that have finite integer index and satisfy a weaker coverability property admit a linear kernel on graphs of bounded genus.
Edit intent: clarity
Original:  The study of kernels on planar graphs was initiated by a seminal paper of Alber, Fellows, and Niedermeier J. ACM, 2004%DIFDELCMD < ] %%% who showed that Planar Dominating Set admits a linear kernel.
Revised:  J. ACM, 2004%DIFDELCMD < ] %%% who showed that Planar Dominating Set admits a linear kernel.
Edit intent: coherence
Original:  The study of kernels on planar graphs was initiated by a seminal paper of Alber, Fellows, and Niedermeier J. ACM, 2004%DIFDELCMD < ] %%% who showed that Planar Dominating Set admits a linear kernel.
Revised:  The study of kernels on planar graphs was initiated by a seminal paper of Alber, Fellows, and Niedermeier %DIFDELCMD < ] %%% who showed that Planar Dominating Set admits a linear kernel.
Edit intent: coherence
Original:  Under the frequent conditions of small molecule numbers,  mass action theory becomes insufficient to describe the dynamics of such systems.
Revised:  Under conditions of small molecule numbers, mass action theory becomes insufficient to describe the dynamics of such systems.
Edit intent: clarity
Original:  Under the frequent conditions of small molecule numbers,  mass action theory becomes insufficient to describe the dynamics of such systems.
Revised:  Under the frequent conditions of small molecule numbers, mass action theory fails to describe the dynamics of such systems.
Edit intent: clarity
Original:  Instead, the biochemical reactions must be treated as stochastic processes , producing intrinsic concentration fluctuations of the chemicals.
Revised:  Instead, the biochemical reactions must be treated as stochastic processes that intrinsically generate concentration fluctuations of the chemicals.
Edit intent: clarity
Original:  We investigate the stochastic reaction kinetics of covalent modification cycles (CMCs) by analytical modelling and numerically exact Monte-Carlo simulation of the temporally fluctuating concentration.
Revised:  We investigate the stochastic reaction kinetics of covalent modification cycles (CMCs) by analytical modeling and numerically exact Monte-Carlo simulation of the temporally fluctuating concentration.
Edit intent: fluency
Original:  Depending on the parameter regime, we find for the probability density of the concentration qualitatively distinct classes of distribution functions, including powerlaw distributions with a fractional and tunable exponent.
Revised:  Depending on the parameter regime, we find for the probability density of the concentration qualitatively distinct classes of distribution functions, including power law distributions with a fractional and tunable exponent.
Edit intent: fluency
Original:  We do this by introducing the notion of composition of computers to AIT, which corresponds to the notion of composition of systems in normal statistical mechanics.
Revised:  We do this by introducing the notion of composition of computers into AIT, which corresponds to the notion of composition of systems in normal statistical mechanics.
Edit intent: fluency
Original: Motivation : If biology is modular then clusters, or communities, of proteins derived using only protein-protein interaction network structure might define protein modules with similar biological roles.
Revised: Background : If biology is modular then clusters, or communities, of proteins derived using only protein-protein interaction network structure might define protein modules with similar biological roles.
Edit intent: coherence
Original: Motivation : If biology is modular then clusters, or communities, of proteins derived using only protein-protein interaction network structure might define protein modules with similar biological roles.
Revised: Motivation : If biology is modular then clusters, or communities, of proteins derived using only protein interaction network structure might define protein modules with similar biological roles.
Edit intent: clarity
Original: Motivation : If biology is modular then clusters, or communities, of proteins derived using only protein-protein interaction network structure might define protein modules with similar biological roles.
Revised: Motivation : If biology is modular then clusters, or communities, of proteins derived using only protein-protein interaction network structure should define protein modules with similar biological roles.
Edit intent: clarity
Original:  We investigate the connection between biological modules and network communities in yeast and ask how the functional similarity of the communities that we find depends on the scales at which we probe the network.
Revised:  We investigate the link between biological modules and network communities in yeast and ask how the functional similarity of the communities that we find depends on the scales at which we probe the network.
Edit intent: fluency
Original:  We investigate the connection between biological modules and network communities in yeast and ask how the functional similarity of the communities that we find depends on the scales at which we probe the network.
Revised:  We investigate the connection between biological modules and network communities in yeast and its relationship to the scale at which we probe the network.
Edit intent: clarity
Original:  We show that  high mean clustering coefficient and low mean node betweenness centrality can be used to predict functionally homogeneouscommunities.
Revised:  We show that a high mean clustering coefficient and low mean node betweenness centrality can be used to predict functionally homogeneouscommunities.
Edit intent: fluency
Original:  We show that  high mean clustering coefficient and low mean node betweenness centrality can be used to predict functionally homogeneouscommunities.
Revised:  We show that high mean clustering coefficient of a community can be used to predict functionally homogeneouscommunities.
Edit intent: clarity
Original: We apply the quadratic hedging scheme developed by F\"ollmer , Schweizer, and Sondermann to European contingent products whose underlying asset is modeled using a GARCH process .
Revised: We apply a quadratic hedging scheme developed by F\"ollmer , Schweizer, and Sondermann to European contingent products whose underlying asset is modeled using a GARCH process .
Edit intent: fluency
Original: We apply the quadratic hedging scheme developed by F\"ollmer , Schweizer, and Sondermann to European contingent products whose underlying asset is modeled using a GARCH process .
Revised: We apply the quadratic hedging scheme developed by Foellmer , Schweizer, and Sondermann to European contingent products whose underlying asset is modeled using a GARCH process .
Edit intent: fluency
Original:  Regarding this subject, we focus on GARCH time series models with Gaussian and multinomial innovations and we provide specific conditions under which those martingale measures are appropriate in the context of quadratic hedging.
Revised:  Regarding this subject, we focus on GARCH time series models with Gaussian innovations and we provide specific conditions under which those martingale measures are appropriate in the context of quadratic hedging.
Edit intent: clarity
Original: Despite the apparent conceptual boundaries of scientific fields, a formal description for their evolution is lacking.
Revised: Despite the apparent cross-disciplinary interactions among scientific fields, a formal description for their evolution is lacking.
Edit intent: clarity
Original: Despite the apparent conceptual boundaries of scientific fields, a formal description for their evolution is lacking.
Revised: Despite the apparent conceptual boundaries of scientific fields, a formal description of their evolution is lacking.
Edit intent: fluency
Original:  We locate scientific fields using Cfinder, a community finding algorithm, and describe the time evolution of these fields using a community evolution method over the course of 1985-2006.
Revised:  We locate scientific fields using a community finding algorithm, and describe the time evolution of these fields using a community evolution method over the course of 1985-2006.
Edit intent: clarity
Original:  We locate scientific fields using Cfinder, a community finding algorithm, and describe the time evolution of these fields using a community evolution method over the course of 1985-2006.
Revised:  We locate scientific fields using Cfinder, a community finding algorithm, and describe the time evolution of these fields over the course of 1985-2006.
Edit intent: clarity
Original:  The communities we identify map to known scientific fields, and their age strongly depends on their size , impact and activity.
Revised:  The communities we identify map to known scientific fields, and their age strongly depends on their size and activity.
Edit intent: fluency
Original:  The described approach to quantify the evolution of ideas may be relevant in making predictions about the future of science and how to guide its development.
Revised:  The described approach to quantify the evolution of ideas to be relevant for making predictions about the future of science and how to guide its development.
Edit intent: clarity