wanyu/IteraTeR_full_sent huggingface dataset:
Original:  We consider both classical topological descriptors, such as the modularity and statistics of the shortest paths, and different interpretations in terms of diffusion provided by the well-known discrete heat kernel  . A principal component analysis shows high discrimination among the network types, either by considering the topological and heat kernel based  characterizations.
Revised:  We consider both classical topological descriptors, such as the modularity and statistics of the shortest paths, and different interpretations in terms of diffusion provided by the discrete heat kernel . A principal component analysis shows high discrimination among the network types, either by considering the topological and heat kernel based characterizations.
Edit intent: clarity
Original:  We consider both classical topological descriptors, such as the modularity and statistics of the shortest paths, and different interpretations in terms of diffusion provided by the well-known discrete heat kernel  . A principal component analysis shows high discrimination among the network types, either by considering the topological and heat kernel based  characterizations.
Revised:  We consider both classical topological descriptors, such as the modularity and statistics of the shortest paths, and different interpretations in terms of diffusion provided by the well-known discrete heat kernel , which is elaborated from the normalized graph Laplacians . A principal component analysis shows high discrimination among the network types, either by considering the topological and heat kernel based characterizations.
Edit intent: meaning-changed
Original:  We consider both classical topological descriptors, such as the modularity and statistics of the shortest paths, and different interpretations in terms of diffusion provided by the well-known discrete heat kernel  . A principal component analysis shows high discrimination among the network types, either by considering the topological and heat kernel based  characterizations.
Revised:  We consider both classical topological descriptors, such as the modularity and statistics of the shortest paths, and different interpretations in terms of diffusion provided by the well-known discrete heat kernel . A principal component analysis shows high discrimination among the network types, either by considering the topological and heat kernel based vector characterizations.
Edit intent: meaning-changed
Original:  Finally, and most importantly, the focused analysis of the heat kernel provides a way to yield insights on the fact that proteins have to satisfy specific structural design constraints that the other considered biochemical networks do not need to obey.
Revised:  Finally, and most importantly, the focused analysis of the heat kernel provides a way to yield insights on the fact that proteins have to satisfy specific structural design constraints that the other considered networks do not need to obey.
Edit intent: clarity
Original: We investigate the credit risk model previously introduced by Hatchett and K\"uhn  under more general assumptions . We show that the model is exactly solvable in the N\rightarrow \infty limit and  that the exact solution is described by a message-passing approach outlined by Karrer and Newman, generalized to include heterogeneous agents and couplings.
Revised: We investigate the credit risk model previously introduced by Hatchett and K\"uhn under more general assumptions , in particular using a general degree distribution for sparse graphs. Expanding upon earlier results, we show that the model is exactly solvable in the N\rightarrow \infty limit and that the exact solution is described by a message-passing approach outlined by Karrer and Newman, generalized to include heterogeneous agents and couplings.
Edit intent: meaning-changed
Original:  We show that the model is exactly solvable in the N\rightarrow \infty limit and  that the exact solution is described by a message-passing approach outlined by Karrer and Newman, generalized to include heterogeneous agents and couplings.
Revised:  We show that the model is exactly solvable in the N\rightarrow \infty limit and demonstrate that the exact solution is described by a message-passing approach outlined by Karrer and Newman, generalized to include heterogeneous agents and couplings.
Edit intent: fluency
Original:  We show that the model is exactly solvable in the N\rightarrow \infty limit and  that the exact solution is described by a message-passing approach outlined by Karrer and Newman, generalized to include heterogeneous agents and couplings.
Revised:  We show that the model is exactly solvable in the N\rightarrow \infty limit and that the exact solution is described by the message-passing approach outlined by Karrer and Newman, generalized to include heterogeneous agents and couplings.
Edit intent: fluency
Original:  Contrarily, here we confront optimal growth solutions to the whole set of feasible flux phenotypes (FFP), which provides a reference map that helps us to assess the likelihood of extreme and high-growth states and their extent of conformity with experimental results.
Revised:  Here we confront optimal growth solutions to the whole set of feasible flux phenotypes (FFP), which provides a reference map that helps us to assess the likelihood of extreme and high-growth states and their extent of conformity with experimental results.
Edit intent: coherence
Original:  Contrarily, here we confront optimal growth solutions to the whole set of feasible flux phenotypes (FFP), which provides a reference map that helps us to assess the likelihood of extreme and high-growth states and their extent of conformity with experimental results.
Revised:  Contrarily, here we confront optimal growth solutions to the whole set of feasible flux phenotypes (FFP), which provides a bechmark to assess the likelihood of extreme and high-growth states and their extent of conformity with experimental results.
Edit intent: clarity
Original:  Contrarily, here we confront optimal growth solutions to the whole set of feasible flux phenotypes (FFP), which provides a reference map that helps us to assess the likelihood of extreme and high-growth states and their extent of conformity with experimental results.
Revised:  Contrarily, here we confront optimal growth solutions to the whole set of feasible flux phenotypes (FFP), which provides a reference map that helps us to assess the likelihood of optimal and high-growth states and their extent of conformity with experimental results.
Edit intent: clarity
Original:  Contrarily, here we confront optimal growth solutions to the whole set of feasible flux phenotypes (FFP), which provides a reference map that helps us to assess the likelihood of extreme and high-growth states and their extent of conformity with experimental results.
Revised:  Contrarily, here we confront optimal growth solutions to the whole set of feasible flux phenotypes (FFP), which provides a reference map that helps us to assess the likelihood of extreme and high-growth states and their agreement with experimental results.
Edit intent: clarity
Original:  In addition, FFP maps are able to uncover metabolic behaviors, such as aerobic glycolysis in high-growth minimal medium with unlimited oxygen uptake , that are unreachable using  models based on optimality principles.
Revised:  In addition, FFP maps are able to uncover metabolic behaviors, such as aerobic fermentation accompanying exponential growth on sugars at nutrient excess conditions , that are unreachable using models based on optimality principles.
Edit intent: meaning-changed
Original:  In addition, FFP maps are able to uncover metabolic behaviors, such as aerobic glycolysis in high-growth minimal medium with unlimited oxygen uptake , that are unreachable using  models based on optimality principles.
Revised:  In addition, FFP maps are able to uncover metabolic behaviors, such as aerobic glycolysis in high-growth minimal medium with unlimited oxygen uptake , that are unreachable using standard models based on optimality principles.
Edit intent: meaning-changed
Original:  The information content of the full FFP space of metabolic states provides us with an entire map to explore and evaluate metabolic behavior and capabilities, and so it opens new avenues for biotechnological and biomedical applications.
Revised:  The information content of the full FFP space provides us with an entire map to explore and evaluate metabolic behavior and capabilities, and so it opens new avenues for biotechnological and biomedical applications.
Edit intent: clarity
Original:  The information content of the full FFP space of metabolic states provides us with an entire map to explore and evaluate metabolic behavior and capabilities, and so it opens new avenues for biotechnological and biomedical applications.
Revised:  The information content of the full FFP space of metabolic states provides us with a map to explore and evaluate metabolic behavior and capabilities, and so it opens new avenues for biotechnological and biomedical applications.
Edit intent: clarity
Original:  The latter are used first as fitness to estimate the unknown node degrees through a standard configuration model ; then, degrees and strengths are employed to calibrate an enhanced configuration model in order to generate ensembles of networks intended to represent the real system.
Revised:  The latter are used first as fitness to estimate the unknown node degrees through a standard configuration model . Then, these estimated degrees and the strengths are used to calibrate an enhanced configuration model in order to generate ensembles of networks intended to represent the real system.
Edit intent: clarity
Original:  The method, which is tested on the World Trade Web , while drastically reducing the amount of information needed to infer network properties, turns out to be remarkably effective-thus representing a valuable tool for gaining insights on privacy-protected socioeconomic networks .
Revised:  The method, which is tested on real economic and financial networks , while drastically reducing the amount of information needed to infer network properties, turns out to be remarkably effective-thus representing a valuable tool for gaining insights on privacy-protected socioeconomic networks .
Edit intent: meaning-changed
Original:  The method, which is tested on the World Trade Web , while drastically reducing the amount of information needed to infer network properties, turns out to be remarkably effective-thus representing a valuable tool for gaining insights on privacy-protected socioeconomic networks .
Revised:  The method, which is tested on the World Trade Web , while drastically reducing the amount of information needed to infer network properties, turns out to be remarkably effective-thus representing a valuable tool for gaining insights on privacy-protected socioeconomic systems .
Edit intent: clarity
Original:  The rebalancing techniques are applied to a fleet sizing example using taxi data in three neighborhoods of Manhattan, which suggests that the optimal vehicle-to-driver ratio in a MoD system is between 3 and 5. Lastly, we formulate a real-time closed loop rebalancing policy for drivers and demonstrate its stability (in terms of customer waiting times) for typical system loads.
Revised:  The rebalancing techniques are applied to a system sizing example using taxi data in three neighborhoods of Manhattan, which suggests that the optimal vehicle-to-driver ratio in a MoD system is between 3 and 5. Lastly, we formulate a real-time closed loop rebalancing policy for drivers and demonstrate its stability (in terms of customer waiting times) for typical system loads.
Edit intent: clarity
Original:  The rebalancing techniques are applied to a fleet sizing example using taxi data in three neighborhoods of Manhattan, which suggests that the optimal vehicle-to-driver ratio in a MoD system is between 3 and 5. Lastly, we formulate a real-time closed loop rebalancing policy for drivers and demonstrate its stability (in terms of customer waiting times) for typical system loads.
Revised:  The rebalancing techniques are applied to a fleet sizing example using taxi data in three neighborhoods of Manhattan, which suggests that the optimal vehicle-to-driver ratio in a MoD system is between 3 and 5. Lastly, we formulate a real-time closed-loop rebalancing policy for drivers and demonstrate its stability (in terms of customer waiting times) for typical system loads.
Edit intent: fluency
Original:  The rebalancing techniques are applied to a fleet sizing example using taxi data in three neighborhoods of Manhattan, which suggests that the optimal vehicle-to-driver ratio in a MoD system is between 3 and 5. Lastly, we formulate a real-time closed loop rebalancing policy for drivers and demonstrate its stability (in terms of customer waiting times) for typical system loads.
Revised:  The rebalancing techniques are applied to a fleet sizing example using taxi data in three neighborhoods of Manhattan, which suggests that the optimal vehicle-to-driver ratio in a MoD system is between 3 and 5. Lastly, we formulate a real-time closed loop rebalancing policy for drivers and demonstrate its stability (in terms of customer wait times) for typical system loads.
Edit intent: fluency
Original:  The proposed framework  integrates existing forms of time consistency . In ]  our approach the time consistency is studied for a large class of maps that are postulated to satisfy only two properties -- monotonicity and locality.
Revised:  The proposed framework integrates existing forms of time consistency , but also provides a comprehensive toolbox for analysis and synthesis of the concept of time consistency in decision making. In particular, it allows for in depth comparative analysis of (most of) the existing types of time consistency -- a feat that has not be possible before and which is done in the companion paper ] our approach the time consistency is studied for a large class of maps that are postulated to satisfy only two properties -- monotonicity and locality.
Edit intent: meaning-changed
Original:  We introduce a new, intuitive definition of skewness and elicit a linear relation between the Sharpe ratio of various risk premium strategies (Equity, Fama-French, FX Carry, Short Vol, Bonds, Credit) and their negative skewness.
Revised:  We introduce a new, intuitive definition of skewness and elicit an approximately linear relation between the Sharpe ratio of various risk premium strategies (Equity, Fama-French, FX Carry, Short Vol, Bonds, Credit) and their negative skewness.
Edit intent: clarity
Original:  We find a clear exception to this rule: trend following (and perhaps the Fama-French "High minus Low"), that has positive skewness and positive excess returns , suggesting that some strategies are not risk premia but genuine market anomalies.
Revised:  We find a clear exception to this rule: trend following has both positive skewness and positive excess returns , suggesting that some strategies are not risk premia but genuine market anomalies.
Edit intent: meaning-changed
Original:  We find a clear exception to this rule: trend following (and perhaps the Fama-French "High minus Low"), that has positive skewness and positive excess returns , suggesting that some strategies are not risk premia but genuine market anomalies.
Revised:  We find a clear exception to this rule: trend following (and perhaps the Fama-French "High minus Low"), that has positive skewness and positive excess returns . This is also true, albeit less markedly, of the Fama-French ``Value'' factor and of the ``Low Volatility'' strategy. This suggests that some strategies are not risk premia but genuine market anomalies.
Edit intent: meaning-changed
Original:  We concentrate on sequences of semi-complete markets where for each n the claim h _n admits the decomposition h _n = D_n+Y_n where D_n is replicable and Y_n is completely unhedgeable in that the indifference price of Y_n for an exponential investor is its certainty equivalent.
Revised:  We concentrate on sequences of semi-complete markets where for each n the claim B _n admits the decomposition h _n = D_n+Y_n where D_n is replicable and Y_n is completely unhedgeable in that the indifference price of Y_n for an exponential investor is its certainty equivalent.
Edit intent: meaning-changed
Original:  We concentrate on sequences of semi-complete markets where for each n the claim h _n admits the decomposition h _n = D_n+Y_n where D_n is replicable and Y_n is completely unhedgeable in that the indifference price of Y_n for an exponential investor is its certainty equivalent.
Revised:  We concentrate on sequences of semi-complete markets where for each n the claim h _n admits the decomposition B _n = D_n+Y_n where D_n is replicable and Y_n is completely unhedgeable in that the indifference price of Y_n for an exponential investor is its certainty equivalent.
Edit intent: meaning-changed
Original: We study utility indifference prices and optimal purchasing quantities for a non-traded contingent claim in an incomplete semi-martingale market with vanishing hedging errors , making connections with the theory of large deviations.
Revised: We study utility indifference prices and optimal purchasing quantities for a non-traded contingent claim in an incomplete semi-martingale market with vanishing hedging errors . We make connections with the theory of large deviations.
Edit intent: fluency
Original:  We concentrate on sequences of semi-complete markets where for each n the claim B_n admits the decomposition B_n = D_n+Y_n where D_n is replicable and Y_n is completely unhedgeable in that the indifference price of Y_n for an exponential investor is its certainty equivalent .
Revised:  We concentrate on sequences of semi-complete markets where in the n^{th the claim B_n admits the decomposition B_n = D_n+Y_n where D_n is replicable and Y_n is completely unhedgeable in that the indifference price of Y_n for an exponential investor is its certainty equivalent .
Edit intent: meaning-changed
Original:  We concentrate on sequences of semi-complete markets where for each n the claim B_n admits the decomposition B_n = D_n+Y_n where D_n is replicable and Y_n is completely unhedgeable in that the indifference price of Y_n for an exponential investor is its certainty equivalent .
Revised:  We concentrate on sequences of semi-complete markets where for each n the claim B_n admits the decomposition B_n = D_n+Y_n . Here, D_n is replicable and Y_n is completely unhedgeable in that the indifference price of Y_n for an exponential investor is its certainty equivalent .
Edit intent: coherence
Original:  We concentrate on sequences of semi-complete markets where for each n the claim B_n admits the decomposition B_n = D_n+Y_n where D_n is replicable and Y_n is completely unhedgeable in that the indifference price of Y_n for an exponential investor is its certainty equivalent .
Revised:  We concentrate on sequences of semi-complete markets where for each n the claim B_n admits the decomposition B_n = D_n+Y_n where D_n is replicable by trading in the underlying assets S_n, but Y_n is independent of S_n .
Edit intent: meaning-changed
Original:  In this setting, we identify limiting indifference prices as the position size becomes large, and show the prices typically are not the unique arbitrage free price in the limiting market .
Revised:  In this setting, we identify limiting indifference prices as the position size becomes large, and show the limit of the average indifference price p_n(q_n), for q_n units of B_n, as n\rightarrow \infty. We show that if |q_n|\rightarrow\infty, the limiting price typically differs from the price obtained by assuming bounded positions \sup_n|q_n|<\infty, and the difference is explicitly identifiable using large deviations theory .
Edit intent: meaning-changed
Original: This paper introduces a new global analytical model of the heat dissipation process that occurs in passively-cooled embedded systems , and explicits under what circumstances the folklore assumption that exponential cooling laws apply in such context is valid.
Revised: A new global analytical model of the heat dissipation process that occurs in passively-cooled embedded systems , and explicits under what circumstances the folklore assumption that exponential cooling laws apply in such context is valid.
Edit intent: clarity
Original: This paper introduces a new global analytical model of the heat dissipation process that occurs in passively-cooled embedded systems , and explicits under what circumstances the folklore assumption that exponential cooling laws apply in such context is valid.
Revised: This paper introduces a new global analytical model of the heat dissipation process that occurs in passively-cooled embedded systems is introduced, and we explicit under what circumstances the folklore assumption that exponential cooling laws apply in such context is valid.
Edit intent: coherence
Original: This paper introduces a new global analytical model of the heat dissipation process that occurs in passively-cooled embedded systems , and explicits under what circumstances the folklore assumption that exponential cooling laws apply in such context is valid.
Revised: This paper introduces a new global analytical model of the heat dissipation process that occurs in passively-cooled embedded systems , and explicits under what circumstances the traditional assumption that exponential cooling laws apply in such context is valid.
Edit intent: fluency
Original:  Since the power consumption and reliability of microprocessors are highly dependent on temperature, both designers and, later on, run-time temperature management units must be able rely upon accurate heating and cooling modelsto handle heat generation and peak temperature. If exponential cooling models are justified for actively-cooled microprocessors, e.g., by forced air or water cooling, for passively cooled processors however, as frequently found in embedded systemssuch as mobile phones, an exponential law may not be theoretically justified .
Revised:  Since the power consumption and reliability of microprocessors are highly dependent on temperature, management units need accurate thermal models. Exponential cooling models are justified for actively-cooled microprocessors, e.g., by forced air or water cooling, for passively cooled processors however, as frequently found in embedded systemssuch as mobile phones, an exponential law may not be theoretically justified .
Edit intent: clarity
Original:  We show that the differences between the exact solution and the exponential cooling law are not significant, and even negligible, for small surfaces of the order 10cm^2 . However, for larger surface sizes, the radiative cooling component may become comparable to the convective cooling component.
Revised:  We show that , for quasi isothermal cooling surfaces of the order 10cm^2 . However, for larger surface sizes, the radiative cooling component may become comparable to the convective cooling component.
Edit intent: meaning-changed
Original:  We show that the differences between the exact solution and the exponential cooling law are not significant, and even negligible, for small surfaces of the order 10cm^2 . However, for larger surface sizes, the radiative cooling component may become comparable to the convective cooling component.
Revised:  We show that the differences between the exact solution and the exponential cooling law are not significant, and even negligible, for small surfaces of the order of 1\,dm^2 or greater, the radiative cooling component may become comparable to the convective cooling component.
Edit intent: meaning-changed