wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Thus, these results elucidate intrinsic network properties of cancer and support the view that the observed increased robustness of cancer cells to perturbation and therapy may be due to an increase in the dynamical network entropy allowing cells to adapt to extracellular stresses .
Revised:  Thus, these results elucidate intrinsic network properties of cancer and support the view that the observed increased robustness of cancer cells to perturbation and therapy may be due to an increase in the dynamic network entropy that allows cells to adapt to extracellular stresses .
Edit intent: clarity
Original:  Thus, these results elucidate intrinsic network properties of cancer and support the view that the observed increased robustness of cancer cells to perturbation and therapy may be due to an increase in the dynamical network entropy allowing cells to adapt to extracellular stresses .
Revised:  Thus, these results elucidate intrinsic network properties of cancer and support the view that the observed increased robustness of cancer cells to perturbation and therapy may be due to an increase in the dynamical network entropy allowing cells to adapt to the new cellular stresses. Conversely, genes that exhibit local flux entropy decreases in cancer may render cancer cells more susceptible to targeted intervention and may therefore represent promising drug targets .
Edit intent: meaning-changed
Original:  Our approach embraces and extends much previous work on multistationarity, such as work in relation to chemical reaction networks with dynamics defined by mass-action or non-catalytic kinetics, and also work based on the graphical analysis of the interaction graph associated to the system. 
Revised:  Our approach embraces and extends previous work on multistationarity, such as work in relation to chemical reaction networks with dynamics defined by mass-action or non-catalytic kinetics, and also work based on the graphical analysis of the interaction graph associated to the system. 
Edit intent: clarity
Original:  Our approach embraces and extends much previous work on multistationarity, such as work in relation to chemical reaction networks with dynamics defined by mass-action or non-catalytic kinetics, and also work based on the graphical analysis of the interaction graph associated to the system. 
Revised:  Our approach embraces and extends much previous work on multistationarity, such as work in relation to chemical reaction networks with dynamics defined by mass-action or non-catalytic kinetics, and also work based on graphical analysis of the interaction graph associated to the system. 
Edit intent: fluency
Original:  Our approach embraces and extends much previous work on multistationarity, such as work in relation to chemical reaction networks with dynamics defined by mass-action or non-catalytic kinetics, and also work based on the graphical analysis of the interaction graph associated to the system. 
Revised:  Our approach embraces and extends much previous work on multistationarity, such as work in relation to chemical reaction networks with dynamics defined by mass-action or non-catalytic kinetics, and also work based on the graphical analysis of the interaction graph associated to the system. Further, we interpret the criteria in terms of circuits in the so-called DSR-graph
Edit intent: meaning-changed
Original:  Here, we study by molecular dynamic simulations the competitive protein adsorption on a surface ( Vroman-like effect), i.e. the non-monotonic behavior of the amount of protein adsorbed on a surface in contact with plasma as a function of contact time and plasma concentration  .
Revised:  Here, we study by molecular dynamic simulations the competitive protein adsorption on a surface ( Vroman effect), i.e. the non-monotonic behavior of the amount of protein adsorbed on a surface in contact with plasma as a function of contact time and plasma concentration .
Edit intent: clarity
Original:  Here, we study by molecular dynamic simulations the competitive protein adsorption on a surface ( Vroman-like effect), i.e. the non-monotonic behavior of the amount of protein adsorbed on a surface in contact with plasma as a function of contact time and plasma concentration  .
Revised:  Here, we study by molecular dynamic simulations the competitive protein adsorption on a surface ( Vroman-like effect), i.e. the non-monotonic behavior of the amount of protein adsorbed on a surface in contact with plasma as a function of contact time and plasma concentration . We find a complex behavior, with regimes during which small and large proteins are not necessarily competing between them, but are both competing with others in solution .
Edit intent: meaning-changed
Original:  It is shown that as the position size approaches infinity, all utility functions with the same rate of decay for large negative wealths yield the same price. Practically, this means an investor should price like an exponential investor.
Revised:  It is shown that as the position size approaches infinity, all utility functions with the same rate of decay for large negative wealths is the primary driver of prices. For utilities with exponential decay, one may price like an exponential investor.
Edit intent: clarity
Original:  In a sizeable class of diffusion models, the large position limit is seen to arise naturally in conjunction with the limit of a complete model and hence approximations are most appropriate in this setting .
Revised:  For utilities with a power decay, one may price like a power investor after a suitable adjustment to the rate at which the position size becomes large. In a sizable class of diffusion models, the large position limit is seen to arise naturally in conjunction with the limit of a complete model and hence approximations are most appropriate in this setting .
Edit intent: meaning-changed
Original:  In a sizeable class of diffusion models, the large position limit is seen to arise naturally in conjunction with the limit of a complete model and hence approximations are most appropriate in this setting .
Revised:  In a sizeable class of diffusion models, limiting indifference prices are explicitly computed for an exponential investor. Furthermore, the large claim limit is seen to arise naturally in conjunction with the limit of a complete model and hence approximations are most appropriate in this setting .
Edit intent: meaning-changed
Original: Decision making of agents who are members of a society is analyzed from the point of view of quantum decision theory. This generalizes the approach, developed earlier by the authors for separate individuals , to decision making under the influence of social interactions .
Revised: Decision making of agents who are members of a society , is analyzed within the mathematical framework based on the use of quantum probabilities. The introduction of social interactions, which influence the decisions of individual agents, leads to a generalization of the quantum decision theory developed earlier by the authors for separate individuals , to decision making under the influence of social interactions .
Edit intent: meaning-changed
Original:  The generalized approach not only avoids paradoxes , typical of classical decision making based on utility theory, but also explains the error-attenuation effects observed for the paradoxes occurring when decision makers, who are members of a society, consult with each other  increasing in this way the available mutual information  .
Revised:  The generalized approach is free of the standard paradoxes of classical decision making based on utility theory, but also explains the error-attenuation effects observed for the paradoxes occurring when decision makers, who are members of a society, consult with each other increasing in this way the available mutual information .
Edit intent: clarity
Original:  The generalized approach not only avoids paradoxes , typical of classical decision making based on utility theory, but also explains the error-attenuation effects observed for the paradoxes occurring when decision makers, who are members of a society, consult with each other  increasing in this way the available mutual information  .
Revised:  The generalized approach not only avoids paradoxes , typical of classical decision theory. This approach also explains the error-attenuation effects observed for the paradoxes occurring when decision makers, who are members of a society, consult with each other increasing in this way the available mutual information .
Edit intent: clarity
Original:  The generalized approach not only avoids paradoxes , typical of classical decision making based on utility theory, but also explains the error-attenuation effects observed for the paradoxes occurring when decision makers, who are members of a society, consult with each other  increasing in this way the available mutual information  .
Revised:  The generalized approach not only avoids paradoxes , typical of classical decision making based on utility theory, but also explains the error-attenuation effects observed for the paradoxes occurring when decision makers, who are members of a society, consult with each other , increasing in this way the available mutual information .
Edit intent: fluency
Original:  The generalized approach not only avoids paradoxes , typical of classical decision making based on utility theory, but also explains the error-attenuation effects observed for the paradoxes occurring when decision makers, who are members of a society, consult with each other  increasing in this way the available mutual information  .
Revised:  The generalized approach not only avoids paradoxes , typical of classical decision making based on utility theory, but also explains the error-attenuation effects observed for the paradoxes occurring when decision makers, who are members of a society, consult with each other increasing in this way the available mutual information . A precise correspondence between quantum decision theory and classical utility theory is formulated via the introduction of an intermediate probabilistic version of utility theory of a novel form, which obeys the requirement that zero-utility prospects should have zero probability weights .
Edit intent: meaning-changed
Original:  in the former the shape of flux is constrained completely by deformed toric ideal constraints, and in the latter, it is shown the deformed toric ideal constrains the  parameters of flux at least partially  .
Revised:  in the former the flux and the concentrations are constrained completely by deformed toric ideal constraints, and in the latter, it is shown the deformed toric ideal constrains the parameters of flux at least partially .
Edit intent: meaning-changed
Original:  in the former the shape of flux is constrained completely by deformed toric ideal constraints, and in the latter, it is shown the deformed toric ideal constrains the  parameters of flux at least partially  .
Revised:  in the former the shape of flux is constrained completely by deformed toric ideal constraints, and in the latter, it is shown the deformed toric ideal constrains the linear combination parameters of flux at least partially .
Edit intent: meaning-changed
Original:  in the former the shape of flux is constrained completely by deformed toric ideal constraints, and in the latter, it is shown the deformed toric ideal constrains the  parameters of flux at least partially  .
Revised:  in the former the shape of flux is constrained completely by deformed toric ideal constraints, and in the latter, it is shown the deformed toric ideal constrains the parameters of flux at least partially . Even in the latter case, the flux and the concentrations are constrained completely with the additional constraint that the total amount of enzyme is constant .
Edit intent: meaning-changed
Original:  Using concepts from information theory  we show that  a signaling pathway transmits more information if 1) the noise of one input is correlated with that of the other, and 2) the input signals are not chosen independently.
Revised:  Using concepts from information theory , we show that a signaling pathway transmits more information if 1) the noise of one input is correlated with that of the other, and 2) the input signals are not chosen independently.
Edit intent: fluency
Original:  Using concepts from information theory  we show that  a signaling pathway transmits more information if 1) the noise of one input is correlated with that of the other, and 2) the input signals are not chosen independently.
Revised:  Using concepts from information theory we show that in general a signaling pathway transmits more information if 1) the noise of one input is correlated with that of the other, and 2) the input signals are not chosen independently.
Edit intent: meaning-changed
Original:  Using concepts from information theory  we show that  a signaling pathway transmits more information if 1) the noise of one input is correlated with that of the other, and 2) the input signals are not chosen independently.
Revised:  Using concepts from information theory we show that a signaling pathway transmits more information if 1) noise of one input is correlated with that of the other, and 2) the input signals are not chosen independently.
Edit intent: fluency
Original:  Using concepts from information theory  we show that  a signaling pathway transmits more information if 1) the noise of one input is correlated with that of the other, and 2) the input signals are not chosen independently.
Revised:  Using concepts from information theory we show that a signaling pathway transmits more information if 1) the noise of one input is correlated with that of the other, 2) the input signals are not chosen independently.
Edit intent: coherence
Original:  Using concepts from information theory  we show that  a signaling pathway transmits more information if 1) the noise of one input is correlated with that of the other, and 2) the input signals are not chosen independently.
Revised:  Using concepts from information theory we show that a signaling pathway transmits more information if 1) the noise of one input is correlated with that of the other, and 2) input signals are not chosen independently.
Edit intent: coherence
Original:  We explicitly demonstrate these ideas for the toy model of two TFs competing for the same binding site. We suggest that this mechanism potentially explains the motif of a coherent feed-forward loop terminating in overlapping binding sites commonly found in developmental networks , and discuss three specific examples.
Revised:  We explicitly demonstrate these ideas for competing TFs and feed-forward loop terminating in overlapping binding sites commonly found in developmental networks , and discuss three specific examples.
Edit intent: clarity
Original:  We suggest that this mechanism potentially explains the motif of a coherent feed-forward loop terminating in overlapping binding sites commonly found in developmental networks , and discuss three specific examples. The systematic method proposed herein can be used to shed light on TF cross-regulation networks either from direct measurements of binding noise, or bioinformatic analysis of overlapping binding sites .
Revised:  We suggest that this mechanism potentially explains the motif of a coherent feed-forward loop terminating in overlapping binding sites commonly found in developmental networks , and discuss generalizations to other signaling pathways. Our results challenge the conventional approach of treating biological noise as uncorrelated fluctuations, and present a systematic method for understanding TF cross-regulation networks either from direct measurements of binding noise, or bioinformatic analysis of overlapping binding sites .
Edit intent: meaning-changed
Original: In this paper, the market extension of set-valued risk measures for models with proportional transaction costs is linked with set-valued risk minimization problems. As a particular example, the set-valued average value at risk (AV@R) is defined and its market extension and corresponding risk minimization problems are studied.
Revised: New versions of the set-valued average value at risk (AV@R) is defined and its market extension and corresponding risk minimization problems are studied.
Edit intent: clarity
Original:  As a particular example, the set-valued average value at risk (AV@R) is defined and its market extension and corresponding risk minimization problems are studied. We show that for a finite probability space the calculation of the values of AV@R reduces to linear vector optimization problems which can be solved using known algorithms.
Revised:  As a particular example, the set-valued average value at risk for multivariate risks are introduced by generalizing the well-known certainty equivalent representation to the set-valued case. The first "regulator" version is independent from any market model whereas the second version, called the market extension, takes trading opportunities into account. Essential properties of both versions are proven and an algorithmic approach is provided which admits to compute the values of AV@R reduces to linear vector optimization problems which can be solved using known algorithms.
Edit intent: meaning-changed
Original:  We show that for a finite probability space the calculation of the values of AV@R reduces to linear vector optimization problems which can be solved using known algorithms. The formulation of AV@R as a linear vector optimization problem is an extension of the corresponding scalar result by Rockafellar and Uryasev .
Revised:  We show that for a finite probability space the calculation of the values of both version over finite probability spaces. Several examples illustrate various features of the theoretical constructions .
Edit intent: meaning-changed
Original:  We discuss the  implementation of the spectral estimation procedures for L\'evy models of finite jump activity as well as for self-decomposable L\'evy models and improve these methods. Confidence intervals are constructed for the estimators in the finite activity case.
Revised:  We discuss the implementation of the spectral estimation procedures for L\'evy models of finite jump activity as well as for self-decomposable L\'evy models . Based on finite sample variances, confidence intervals are constructed for the estimators in the finite activity case.
Edit intent: clarity
Original:  The new pricing operator guarantees put-call parity to hold  and the value of a forward contract to match the buy-and-hold strategy, even if the underlying follows strict local martingale dynamics.
Revised:  The new pricing operator guarantees put-call parity to hold for model prices and the value of a forward contract to match the buy-and-hold strategy, even if the underlying follows strict local martingale dynamics.
Edit intent: meaning-changed
Original:  Within this context, we interpret the non-martingality of an exchange-rate as a reflection of the possibility that the num\'eraire currency may devalue completely against the asset currency (hyperinflation).
Revised:  Within this context, we interpret the lack of the martingale property of an exchange-rate as a reflection of the possibility that the num\'eraire currency may devalue completely against the asset currency (hyperinflation).
Edit intent: clarity
Original: In this paper, we report on very efficient algorithms for the spherical harmonic transform (SHT) that can be used in numerical simulations of partial differential equations . Explicitly vectorized variations of the Gauss-Legendre algorithm are discussed and implemented in the open-source library SHTns which includes scalar and vector transforms.
Revised: In this paper, we report on very efficient algorithms for the spherical harmonic transform (SHT) . Explicitly vectorized variations of the Gauss-Legendre algorithm are discussed and implemented in the open-source library SHTns which includes scalar and vector transforms.
Edit intent: clarity
Original: In this paper, we report on very efficient algorithms for the spherical harmonic transform (SHT) that can be used in numerical simulations of partial differential equations . Explicitly vectorized variations of the Gauss-Legendre algorithm are discussed and implemented in the open-source library SHTns which includes scalar and vector transforms.
Revised: In this paper, we report on very efficient algorithms for the spherical harmonic transform (SHT) that can be used in numerical simulations of partial differential equations . Explicitly vectorized variations of the algorithm based on the Gauss-Legendre quadrature are discussed and implemented in the open-source library SHTns which includes scalar and vector transforms.
Edit intent: meaning-changed
Original: In this paper, we report on very efficient algorithms for the spherical harmonic transform (SHT) that can be used in numerical simulations of partial differential equations . Explicitly vectorized variations of the Gauss-Legendre algorithm are discussed and implemented in the open-source library SHTns which includes scalar and vector transforms.
Revised: In this paper, we report on very efficient algorithms for the spherical harmonic transform (SHT) that can be used in numerical simulations of partial differential equations . Explicitly vectorized variations of the Gauss-Legendre algorithm are discussed and implemented in the SHTns library which includes scalar and vector transforms.
Edit intent: clarity
Original:  This library is especially suitable for direct numerical simulations of non-linear partial differential equations in spherical geometry, like the Navier-Stokes equation. The performance of our algorithms is compared to third party SHT implementations, including fast algorithms .
Revised:  The main breakthrough is to achieve very efficient on-the-fly computations of the Legendre associated functions, even for very high resolutions, by taking advantage of the specific properties of the SHT and the advanced capabilities of current and future computers. This allows us to simultaneously and significantly reduce memory usage and computation time of the SHT. We measure the performance and accuracy of our algorithms is compared to third party SHT implementations, including fast algorithms .
Edit intent: meaning-changed
Original:  Even though the complexity of the algorithms implemented in SHTns are of order O(N^3) (where N is the maximum harmonic degree of the transform), they perform much better than the available implementations of asymptotically fast algorithms, even for a truncation as high as N=1023.
Revised:  Even though the complexity of the algorithms implemented in SHTns are in O(N^3) (where N is the maximum harmonic degree of the transform), they perform much better than the available implementations of asymptotically fast algorithms, even for a truncation as high as N=1023.
Edit intent: clarity
Original:  Even though the complexity of the algorithms implemented in SHTns are of order O(N^3) (where N is the maximum harmonic degree of the transform), they perform much better than the available implementations of asymptotically fast algorithms, even for a truncation as high as N=1023.
Revised:  Even though the complexity of the algorithms implemented in SHTns are of order O(N^3) (where N is the maximum harmonic degree of the transform), they perform much better than any third party implementation, including lower complexity algorithms, even for a truncation as high as N=1023.
Edit intent: meaning-changed
Original:  Even though the complexity of the algorithms implemented in SHTns are of order O(N^3) (where N is the maximum harmonic degree of the transform), they perform much better than the available implementations of asymptotically fast algorithms, even for a truncation as high as N=1023.
Revised:  Even though the complexity of the algorithms implemented in SHTns are of order O(N^3) (where N is the maximum harmonic degree of the transform), they perform much better than the available implementations of asymptotically fast algorithms, even for truncations as high as N=1023.
Edit intent: fluency