wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Inspired by some recent ground-breaking work by Gatheral, Jaisson and Rosenbaum, who showed that fractional Brownian motion with short memory allows for a better calibration of the volatility surface (as opposed to the classical econometric approach of long memory of volatility) , we provide a characterisation of the short- and long-maturity asymptotics of the implied volatility smile.
Revised:  Inspired by some recent ground-breaking work on rough volatility, which showed that models with volatility driven by fractional Brownian motion with short memory allows for a better calibration of the volatility surface (as opposed to the classical econometric approach of long memory of volatility) , we provide a characterisation of the short- and long-maturity asymptotics of the implied volatility smile.
Edit intent: meaning-changed
Original:  Inspired by some recent ground-breaking work by Gatheral, Jaisson and Rosenbaum, who showed that fractional Brownian motion with short memory allows for a better calibration of the volatility surface (as opposed to the classical econometric approach of long memory of volatility) , we provide a characterisation of the short- and long-maturity asymptotics of the implied volatility smile.
Revised:  Inspired by some recent ground-breaking work by Gatheral, Jaisson and Rosenbaum, who showed that fractional Brownian motion with short memory allows for better calibration of the volatility surface (as opposed to the classical econometric approach of long memory of volatility) , we provide a characterisation of the short- and long-maturity asymptotics of the implied volatility smile.
Edit intent: fluency
Original:  Inspired by some recent ground-breaking work by Gatheral, Jaisson and Rosenbaum, who showed that fractional Brownian motion with short memory allows for a better calibration of the volatility surface (as opposed to the classical econometric approach of long memory of volatility) , we provide a characterisation of the short- and long-maturity asymptotics of the implied volatility smile.
Revised:  Inspired by some recent ground-breaking work by Gatheral, Jaisson and Rosenbaum, who showed that fractional Brownian motion with short memory allows for a better calibration of the volatility surface and more robust estimation of time series of historical volatility , we provide a characterisation of the short- and long-maturity asymptotics of the implied volatility smile.
Edit intent: meaning-changed
Original:  Our analysis reveals that the short-memory property precisely provides a jump-type behaviour of the smile for short maturities, thereby fixing the well-known standard inability of classical stochastic volatility models to fit the short-end of the volatility skew .
Revised:  Our analysis reveals that the short-memory property precisely provides a jump-type behaviour of the smile for short maturities, thereby fixing the well-known standard inability of classical stochastic volatility models to fit the short-end of the volatility smile .
Edit intent: clarity
Original: We introduce and study three classes of over-the-counter markets specified by systems of Ordinary Differential Equations (ODE's), in the spirit of Duffie-G\^{a rleanu-Pedersen , Over-the-Counter markets, Econometrica, 73 (2005) .
Revised: We introduce and study a class of over-the-counter markets specified by systems of Ordinary Differential Equations (ODE's), in the spirit of Duffie-G\^{a rleanu-Pedersen , Over-the-Counter markets, Econometrica, 73 (2005) .
Edit intent: clarity
Original: We introduce and study three classes of over-the-counter markets specified by systems of Ordinary Differential Equations (ODE's), in the spirit of Duffie-G\^{a rleanu-Pedersen , Over-the-Counter markets, Econometrica, 73 (2005) .
Revised: We introduce and study three classes of over-the-counter market models specified by systems of Ordinary Differential Equations (ODE's), in the spirit of Duffie-G\^{a rleanu-Pedersen , Over-the-Counter markets, Econometrica, 73 (2005) .
Edit intent: clarity
Original: We introduce and study three classes of over-the-counter markets specified by systems of Ordinary Differential Equations (ODE's), in the spirit of Duffie-G\^{a rleanu-Pedersen , Over-the-Counter markets, Econometrica, 73 (2005) .
Revised: We introduce and study three classes of over-the-counter markets specified by systems of Ordinary Differential Equations (ODE's), in the spirit of Duffie- G^a rleanu-Pedersen , Over-the-Counter markets, Econometrica, 73 (2005) .
Edit intent: fluency
Original: We introduce and study three classes of over-the-counter markets specified by systems of Ordinary Differential Equations (ODE's), in the spirit of Duffie-G\^{a rleanu-Pedersen , Over-the-Counter markets, Econometrica, 73 (2005) .
Revised: We introduce and study three classes of over-the-counter markets specified by systems of Ordinary Differential Equations (ODE's), in the spirit of Duffie-G\^{a rleanu-Pedersen 6 .
Edit intent: meaning-changed
Original: Asset prices contain information about the probability distribution of future states and the stochastic discounting of these states . Without additional assumptions, probabilities and stochastic discounting cannot be separately identified. To understand this identification challenge , we extract a positive martingale component from the stochastic discount factor process using Perron-Frobenius Theory.
Revised: Asset prices contain information about the probability distribution of future states and the stochastic discounting of those states as used by investors. To better understand the challenge in distinguishing investors' beliefs from risk-adjusted discounting, we use Perron-Frobenius Theory to isolate a positive martingale component from the stochastic discount factor process using Perron-Frobenius Theory.
Edit intent: clarity
Original:   When the martingale component is not trivial, using this same approach recovers a probability measure, but not the one that is used by investors. We refer to this outcome as "misspecified recovery." We show that the resulting misspecified probability measure absorbs long-term risk adjustments. Many structural models of asset prices have stochastic discount factors with martingale components.
Revised:  When the martingale is not degenerate, surmising that this recovered probability captures investors' beliefs distorts inference about risk-return tradeoffs. Stochastic discount factors in many structural models of asset prices have stochastic discount factors with martingale components.
Edit intent: clarity
Original:  Many structural models of asset prices have stochastic discount factors with martingale components. Also empirical evidence on asset prices suggests that the recovered measure differs from the actual probability distribution. While this probability measure is of substantive interest, interpreting it as the true probability distribution may bias our inference about investor aversion to risk as reflected in risk-return tradeoffs .
Revised:  Many structural models of asset prices have empirically relevant martingale components .
Edit intent: clarity
Original: The analysis of dynamical systems that attempts to model chemical reaction , gene-regulatory, population, and ecosystem networks all rely on models having interacting components. When the details of these interactions are unknown for biological systems of interest, one effective approach is to study the dynamical properties of an ensemble of models determined by evolutionary constraints that may apply to all such systems. One such constraint is that of dynamical robustness. Despite previous investigations, the relationship between dynamical robustness-an important functional characteristic of many biological systems-and network structure is poorly understood .
Revised: The analysis of dynamical systems that attempts to model chemical reaction , gene-regulatory, and ecosystem network architecures .
Edit intent: clarity
Original:  Here we analyze the stability and robustness of a large class of dynamical systems and demonstrate that the most hierarchical network structures, those equivalent to the total ordering, are the most robust. In particular, we determine the probability distribution of robustness over system connectivity and show that robustness is maximized by maximizing the number of links between strongly connected components of the graph representing the underlying system connectivity.
Revised:  Here we analyze the stability and robustness of a large class of dynamics on such networks. We determine the probability distribution of robustness over system connectivity and show that robustness is maximized by maximizing the number of links between strongly connected components of the graph representing the underlying system connectivity.
Edit intent: clarity
Original:  In particular, we determine the probability distribution of robustness over system connectivity and show that robustness is maximized by maximizing the number of links between strongly connected components of the graph representing the underlying system connectivity.
Revised:  In particular, we determine the probability distribution of robustness as a function of network topology and show that robustness is maximized by maximizing the number of links between strongly connected components of the graph representing the underlying system connectivity.
Edit intent: meaning-changed
Original:  In particular, we determine the probability distribution of robustness over system connectivity and show that robustness is maximized by maximizing the number of links between strongly connected components of the graph representing the underlying system connectivity. We demonstrate that this can be understood in terms of the fact that permutation of strongly connected components is a fundamental symmetry of dynamical robustness , which applies to networks of any number of components and is independent of the distribution from which the strengths of interconnection among components are sampled.
Revised:  In particular, we determine the probability distribution of robustness over system connectivity and show that robustness is maximized by maximizing the number of links between modules of the network. We also demonstrate that permutation of these modules is a fundamental symmetry of dynamical robustness , which applies to networks of any number of components and is independent of the distribution from which the strengths of interconnection among components are sampled.
Edit intent: clarity
Original:  We demonstrate that this can be understood in terms of the fact that permutation of strongly connected components is a fundamental symmetry of dynamical robustness , which applies to networks of any number of components and is independent of the distribution from which the strengths of interconnection among components are sampled. The classification of dynamical robustness based upon a purely topological property provides a URLanizing principle that can be used in the context of experimental validation to select among models that break or preserve network hierarchy. This result contributes to an explanation for the observation of hierarchical modularity in biological networks at all scales .
Revised:  We demonstrate that this can be understood in terms of the fact that permutation of strongly connected components is a fundamental symmetry of dynamical robustness . Analysis of these findings leads to the conclusion that the most robust systems have the most hierarchical structure. This relationship provides a means by which evolutionary selection for a purely dynamical phenomenon may shape network architectures across scales of the biological hierarchy .
Edit intent: clarity
Original:  We have been lead to the study of this theoretical pricing/hedging problem, by the economic significance of this type of mechanism which allows a better management of all the defaultable contract risks  respect to the standard mitigation mechanisms .
Revised:  We have been lead to the study of this theoretical pricing/hedging problem, by the economic significance of this type of mechanism which allows a greater flexibility in managing all the defaultable contract risks respect to the standard mitigation mechanisms .
Edit intent: clarity
Original:  We have been lead to the study of this theoretical pricing/hedging problem, by the economic significance of this type of mechanism which allows a better management of all the defaultable contract risks  respect to the standard mitigation mechanisms .
Revised:  We have been lead to the study of this theoretical pricing/hedging problem, by the economic significance of this type of mechanism which allows a better management of all the defaultable contract risks with respect to the standard mitigation mechanisms .
Edit intent: coherence
Original:  We have been lead to the study of this theoretical pricing/hedging problem, by the economic significance of this type of mechanism which allows a better management of all the defaultable contract risks  respect to the standard mitigation mechanisms .
Revised:  We have been lead to the study of this theoretical pricing/hedging problem, by the economic significance of this type of mechanism which allows a better management of all the defaultable contract risks respect to the "standard" non contingent mitigation mechanisms (as full or partial collateralization) .
Edit intent: meaning-changed
Original:  In particular, our approach through hedging strategy decomposition of the claim and its solution representation through system of nonlinear reflected BSDE (theorem 3.2.4) are the main contribution of the work.
Revised:  In particular, our approach through hedging strategy decomposition of the claim (proposition 2.2.5) and its price-hedge representation through system of nonlinear reflected BSDE (theorem 3.2.4) are the main contribution of the work.
Edit intent: meaning-changed
Original:  Implementing a permutation test we detect conformational changes between closed and open forms of the maltose-binding protein, a large biomolecule consisting of 370 amino acid residues  .
Revised:  Implementing a permutation test we detect conformational changes between closed and open forms of the maltose-binding protein, a large biomolecule consisting of 370 amino acid residues . Furthermore, persistence landscapes can be applied to machine learning methods. A hyperplane from a support vector machine shows the clear separation between the closed and open proteins conformations .
Edit intent: meaning-changed
Original: We propose the use of local search to investigate protein residue networks ( PRN) . In a local search , clustering is inversely related to average path length. The opposite holds for a global search such as the commonly used breadth first strategy (BFS). The inverse relationship better fits the notion that amino acids get closer to each other as a protein becomes more compact. We use a greedy local search algorithm (EDS) that is Euclidean distance based and allows backtracking. While there are preferable differences between BFS and EDS paths in terms of variation in path length , search cost and link usage, there are also similarities in terms of centrality and hierarchy . EDS identifies a set of short-cut edges for each PRN . Short-cut edges are enriched with short-range links, and the short-cut network (SCN) they form spans most of a PRN's nodes, is adjacent to most of a PRN's edges and is strongly transitive.
Revised: We propose the use of local search to investigate protein residue networks ( PRN) . In a local search perspective to understand why PRNs are highly clustered when having short paths is important for protein functionality. We found that by adopting a local search cost and link usage, there are also similarities in terms of centrality and hierarchy . EDS identifies a set of short-cut edges for each PRN . Short-cut edges are enriched with short-range links, and the short-cut network (SCN) they form spans most of a PRN's nodes, is adjacent to most of a PRN's edges and is strongly transitive.
Edit intent: coherence
Original:  While there are preferable differences between BFS and EDS paths in terms of variation in path length , search cost and link usage, there are also similarities in terms of centrality and hierarchy . EDS identifies a set of short-cut edges for each PRN . Short-cut edges are enriched with short-range links, and the short-cut network (SCN) they form spans most of a PRN's nodes, is adjacent to most of a PRN's edges and is strongly transitive.
Revised:  While there are preferable differences between BFS and EDS paths in terms of variation in path length , search perspective, this conflict between form and function is resolved as increased clustering actually helps to reduce path length in PRNs. Further, the paths found via our EDS local search algorithm are more congruent with the characteristics of intra-protein communication . EDS identifies a set of short-cut edges for each PRN . Short-cut edges are enriched with short-range links, and the short-cut network (SCN) they form spans most of a PRN's nodes, is adjacent to most of a PRN's edges and is strongly transitive.
Edit intent: meaning-changed
Original:  While there are preferable differences between BFS and EDS paths in terms of variation in path length , search cost and link usage, there are also similarities in terms of centrality and hierarchy . EDS identifies a set of short-cut edges for each PRN . Short-cut edges are enriched with short-range links, and the short-cut network (SCN) they form spans most of a PRN's nodes, is adjacent to most of a PRN's edges and is strongly transitive.
Revised:  While there are preferable differences between BFS and EDS paths in terms of variation in path length , search cost and link usage, there are also similarities in terms of centrality and hierarchy . EDS identifies a subset of PRN edges called short-cuts that are distinct, have high usage, impacts EDS path length, diversity and stretch, and are dominated by short-range links, and the short-cut network (SCN) they form spans most of a PRN's nodes, is adjacent to most of a PRN's edges and is strongly transitive.
Edit intent: meaning-changed
Original:  While there are preferable differences between BFS and EDS paths in terms of variation in path length , search cost and link usage, there are also similarities in terms of centrality and hierarchy . EDS identifies a set of short-cut edges for each PRN . Short-cut edges are enriched with short-range links, and the short-cut network (SCN) they form spans most of a PRN's nodes, is adjacent to most of a PRN's edges and is strongly transitive.
Revised:  While there are preferable differences between BFS and EDS paths in terms of variation in path length , search cost and link usage, there are also similarities in terms of centrality and hierarchy . EDS identifies a set of short-cut edges for each PRN . Short-cut edges are enriched with short-range contacts. The short-cuts form a network (SCN) they form spans most of a PRN's nodes, is adjacent to most of a PRN's edges and is strongly transitive.
Edit intent: coherence
Original:  While there are preferable differences between BFS and EDS paths in terms of variation in path length , search cost and link usage, there are also similarities in terms of centrality and hierarchy . EDS identifies a set of short-cut edges for each PRN . Short-cut edges are enriched with short-range links, and the short-cut network (SCN) they form spans most of a PRN's nodes, is adjacent to most of a PRN's edges and is strongly transitive. The short-cuts influence average EDS path length by reducing the difference in length or stretch between path-pairs. A consequence of this role is short-cut sets are more volatile, i.e. they undergo significantly more additions and deletions from step to step in a molecular dynamics (MD ) simulation than non-short-cut edge sets. Despite their volatility, about 79\% of SCN edge deletions have replacements (a deleted short-cut is replaced when an added short-cut is found in the edge cut-set of the deleted short-cut), and about 88\% of added short-cuts are replacement edges. This high edge replacement rate helps with the growth of the largest connected component of a SCN . More work is needed to understand the structure and formation of SCNs, in particular to identify the conditions under which short-cuts get deleted and how their replacements are selected .
Revised:  While there are preferable differences between BFS and EDS paths in terms of variation in path length , search cost and link usage, there are also similarities in terms of centrality and hierarchy . EDS identifies a set of short-cut edges for each PRN . Short-cut edges are enriched with short-range links, and the short-cut network (SCN) that increases in size and transitivity as a protein folds. The structure of a SCN supports its function and formation, and the function of a SCN influences its formation. Several significant differences in terms of SCN structure, function and formation is found between successful and unsuccessful MD trajectories. We hypothesize that strong SCN transitivity is a hallmark of well-formed SCNs, and suggest the possibility of using SCN transitivity as a folding coordinate for proteins whose native state is not known a priori. By connecting the static and the dynamic aspects of PRNs, the protein folding process becomes a problem of graph formation with the purpose of forming suitable pathways within proteins .
Edit intent: meaning-changed
Original:  We extend our previous work, Bayraktar et al. 2014a, Section 3.1, in two important ways: (1) we assume that the individual consumes from her investment account, and (2) we add a risky asset to the financial market.
Revised:  We extend Bayraktar and Young (2015) by allowing the individual to purchase term life insurance to reach her bequest goal. The premium rate for life insurance, h, serves as a parameter to connect two seemingly unrelated problems. As the premium rate approaches 0, covering the bequest goal becomes costless, so the individual simply wants to avoid ruin that might result from her consumption. Thus, as h approaches 0, the problem in this paper becomes equivalent to minimizing the probability of lifetime ruin, which is solved in Young (2004). On the other hand, as the premium rate becomes arbitrarily large, the financial market.
Edit intent: meaning-changed
Original:  We extend our previous work, Bayraktar et al. 2014a, Section 3.1, in two important ways: (1) we assume that the individual consumes from her investment account, and (2) we add a risky asset to the financial market. We learn that if the rate of consumption is largeenough, then the individual will purchase term life insurance at any level of wealth, a surprising result.
Revised:  We extend our previous work, Bayraktar et al. 2014a, Section 3.1, in two important ways: (1) we assume that the individual consumes from her investment account, and (2) we add a risky asset to the individual will purchase term life insurance at any level of wealth, a surprising result.
Edit intent: clarity
Original:  We learn that if the rate of consumption is largeenough, then the individual will purchase term life insurance at any level of wealth, a surprising result. We also determine when the individual optimally invests more in the risky asset than her current wealth, so-called leveraging .
Revised:  We learn that if the rate of consumption is largeenough, then the individual will not buy life insurance to reach her bequest goal. Thus, as h approaches infinity, the problem in this paper becomes equivalent to maximizing the probability of reaching the bequest goal when life insurance is not available in the market, which is solved in Bayraktar and Young (2015) .
Edit intent: meaning-changed