wanyu/IteraTeR_full_sent huggingface dataset:
Original:   In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Revised:  In this paper, we provide a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Edit intent: clarity
Original:   In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Revised:  In this paper, we present a simple algorithm that has the exact same characteristics and, given an n-vertex rooted tree T, it outputs a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Edit intent: meaning-changed
Original:   In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Revised:  In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing of T that fits on a n \times n grid. For unrooted ordered trees, we present an algorithms that produces monotone drawings that respect the ordering and fit in an (n+1) \times (\frac{n size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Edit intent: meaning-changed
Original:   In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Revised:  In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Edit intent: clarity
Original:   In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Revised:  In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor \frac{3{4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Edit intent: meaning-changed
Original:   In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Revised:  In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(n+2\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Edit intent: meaning-changed
Original:   In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Revised:  In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \times\left\lfloor {4} }\left(\right)\right\rfloor .
Edit intent: fluency
Original:   In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Revised:  In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor \frac{3{4} }\left(\right)\right\rfloor .
Edit intent: meaning-changed
Original:   In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Revised:  In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(n+2\right)\right\rfloor .
Edit intent: meaning-changed
Original: We introduce PVSC-DTM , a highly parallel and SIMD-vectorized library and code generator based on a domain-specific language tailored to implement the specific stencil-like algorithms that can describe Dirac and topological materials such as graphene and topological insulators in a matrix-free way.
Revised: We introduce PVSC-DTM (Parallel Vectorized Stencil Code for Dirac and Topological Materials), a library and code generator based on a domain-specific language tailored to implement the specific stencil-like algorithms that can describe Dirac and topological materials such as graphene and topological insulators in a matrix-free way.
Edit intent: clarity
Original:  The generated hybrid-parallel (MPI+OpenMP) code is  significantly faster than matrix-based approaches on the node level and performs in accordance with the Roofline model.
Revised:  The generated hybrid-parallel (MPI+OpenMP) code is fully vectorized using Single Instruction Multiple Data (SIMD) extensions. It is significantly faster than matrix-based approaches on the node level and performs in accordance with the Roofline model.
Edit intent: meaning-changed
Original:  As an application, we analyze the unique dataset of Finnish shareholders throughout 2004-2009 . We find that households play a central role in investor networks, having the most synchronized trading.
Revised:  We use transaction bootstrapping to capture the properties of the actual data generation process and to have a more robust statistical testing procedure. Investor categorization allows for inferring constant size networks and more observations for each node, which is important especially for less liquid securities. We apply this procedure by analyzing a unique data set of Finnish shareholders throughout 2004-2009 . We find that households play a central role in investor networks, having the most synchronized trading.
Edit intent: meaning-changed
Original:  We would like to note that the use of our proposed aggregation framework is not limited to the field of investor trading networks . It can be used for different non-financial applications, with both observable and inferred relationships, that span over a number of different information layers.
Revised:  We would like to note that the use of our proposed aggregation framework is not limited to the field of investor trading networks ; in fact, it can be used for different non-financial applications, with both observable and inferred relationships, that span over a number of different information layers.
Edit intent: coherence
Original: The improved Fr\'echet--Hoeffding bounds are ad-hoc estimates on the Fr\'echet class of probability distributions with given marginals and prescribed values on a subset of R d . Using an optimal transport approach, we first provide an alternative derivation of the improved upper bound.
Revised: Motivated by applications in model-free finance and quantitative risk management, we consider Fr\'echet class of probability distributions with given marginals and prescribed values on a subset of R d . Using an optimal transport approach, we first provide an alternative derivation of the improved upper bound.
Edit intent: meaning-changed
Original: The improved Fr\'echet--Hoeffding bounds are ad-hoc estimates on the Fr\'echet class of probability distributions with given marginals and prescribed values on a subset of R d . Using an optimal transport approach, we first provide an alternative derivation of the improved upper bound. To this end, we establish a dual representation of a constrained transport problem over distributions in the aforementioned Fr\'echet class and show that the improved upper Fr\'echet--Hoeffding bound belongs to the class of admissible functions for the dual optimization problem.
Revised: The improved Fr\'echet--Hoeffding bounds are ad-hoc estimates on the Fr\'echet classes of multivariate distribution functions where additional information on the joint distribution is assumed, while uncertainty in the marginals is also possible. We derive optimal transport duality results for these Fr\'echet class and show that the improved upper Fr\'echet--Hoeffding bound belongs to the class of admissible functions for the dual optimization problem.
Edit intent: clarity
Original:  To this end, we establish a dual representation of a constrained transport problem over distributions in the aforementioned Fr\'echet class and show that the improved upper Fr\'echet--Hoeffding bound belongs to the class of admissible functions for the dual optimization problem. The proof of strong duality is based on a general representation result for increasing convex functionals and the explicit computation of the conjugates.
Revised:  To this end, we establish a dual representation of a constrained transport problem over distributions in the aforementioned Fr\'echet classes that extend previous results in the related literature. These proofs are based on representation results for increasing convex functionals and the explicit computation of the conjugates.
Edit intent: meaning-changed
Original:  We show further that the improved upper Fr\'echet--Hoeffding bound is not the dual optimizer of this transport problem .
Revised:  We show that the dual transport problem admits an explicit solution for the function f=1_B, where B is a rectangular subset of \mathbb R^d, and provide an intuitive geometric interpretation of this result. The improved Fr\'echet--Hoeffding bound is not the dual optimizer of this transport problem .
Edit intent: meaning-changed
Original:  We show further that the improved upper Fr\'echet--Hoeffding bound is not the dual optimizer of this transport problem . In turn we prove that the improved upper bound is the dual optimizer of a relaxed version of the initial transport problem, thus proving sharpness of the improved upper Fr\'echet--Hoeffding bound for the relaxed Fr\'echet class.
Revised:  We show further that the improved upper Fr\'echet--Hoeffding bounds provide ad-hoc upper bounds for these Fr\'echet class.
Edit intent: clarity
Original:  In turn we prove that the improved upper bound is the dual optimizer of a relaxed version of the initial transport problem, thus proving sharpness of the improved upper Fr\'echet--Hoeffding bound for the relaxed Fr\'echet class. This is achieved by direct construction of the dual optimizers for a certain class of objective functions. ] 
Revised:  In turn we prove that the improved upper bound is the dual optimizer of a relaxed version of the initial transport problem, thus proving sharpness of the improved upper Fr\'echet--Hoeffding bound for the relaxed Fr\'echet classes. We show that the improved Fr\'echet--Hoeffding bounds are pointwise sharp for these classes in the presence of uncertainty in the marginals, while a counterexample yields that they are not pointwise sharp in the absence of uncertainty in the marginals, even in dimension 2. The latter result sheds new light on the improved Fr\'echet--Hoeffding bounds, since Tankov ] 
Edit intent: meaning-changed
Original: We propose two new signalling-game refinements that are microfounded in a model of patient Bayesian learning . Agents are born into player roles and play the signalling game against a random opponent each period.
Revised: We show how to add the assumption that players know their opponents' payoff functions to the theory of learning in games, and use it to derive restrictions on signaling-game play in the spirit of divine equilibrium. In our learning model, agents are born into player roles and play the signalling game against a random opponent each period.
Edit intent: meaning-changed
Original:  Inexperienced agents know their opponents' payoff functions but not the prevailing distribution of opponents' play . One refinement corresponds to an upper bound on the set of possible learning outcomes while the other provides a lower bound .
Revised:  Inexperienced agents know their opponents' payoff functions but not the prevailing distribution of opponents' play , and update their beliefs based on their observations. Long-lived and patient senders experiment with every signal that they think might yield an improvement over their myopically best play. We show that divine equilibrium (Banks and Sobel, 1987) is nested between "rationality-compatible" equilibrium, which corresponds to an upper bound on the set of possible learning outcomes while the other provides a lower bound .
Edit intent: meaning-changed
Original: We show how to add the assumption that players know their opponents' payoff functions to the theory of learning in games, and use it to derive restrictions on signaling-game play in the spirit of divine equilibrium. In our learning model, agents are born into player roles and play the game against a random opponent each period.
Revised: We show how to add the assumption that players know their opponents' payoff functions and rationality to a model of non-equilibrium learning in signaling games. Agents are born into player roles and play the game against a random opponent each period.
Edit intent: clarity
Original:  Inexperienced agents are uncertain about the prevailing distribution of opponents' play, and update their beliefs based on their observations. Long-lived and patient senders experiment with every signal that they think might yield an improvement over their myopically best play .
Revised:  Inexperienced agents are uncertain about the prevailing distribution of opponents' play, and update their beliefs based on personal observations. Payoff information can refine or expand learning predictions, since patient young senders' experimentation incentives depend on which receiver responses they deem plausible .
Edit intent: meaning-changed
Original:  We show that divine equilibrium (Banks and Sobel, 1987) is nested between "rationality-compatible" equilibrium, which corresponds to an upper bound on the set of possible learning outcomes, and "uniform rationality-compatible" equilibrium, which provides a lower bound .
Revised:  We show that with payoff knowledge, the limiting set of long-run learning outcomes is bounded above by rationality-compatible equilibria (RCE), and bounded below by uniform RCE. RCE refine the Intuitive Criterion (Cho and Kreps, 1987) and include all divine equilibria (Banks and Sobel, 1987) is nested between "rationality-compatible" equilibrium, which corresponds to an upper bound on the set of possible learning outcomes, and "uniform rationality-compatible" equilibrium, which provides a lower bound .
Edit intent: meaning-changed
Original:  We show that divine equilibrium (Banks and Sobel, 1987) is nested between "rationality-compatible" equilibrium, which corresponds to an upper bound on the set of possible learning outcomes, and "uniform rationality-compatible" equilibrium, which provides a lower bound .
Revised:  We show that divine equilibrium (Banks and Sobel, 1987) . Uniform RCE sometimes but not always exists, and implies universally divine equilibrium .
Edit intent: meaning-changed
Original:  In the spirit of compressed sensing, the dimension reduction is determined by the Gaussian width of a structure associated to the data set, rather than its size . The Gaussian width also turns out to be useful for studying the complexity of other methods for approximating persistent homology  .
Revised:  In the spirit of compressed sensing, the dimension reduction is determined by the Gaussian width of a structure associated to the data set, rather than its size , and such a reduction can be computed efficiently. We further relate the Gaussian width to the doubling dimension of a finite metric space, which appears in the study of the complexity of other methods for approximating persistent homology .
Edit intent: meaning-changed
Original:  On the contrary , GBM-targeted perturbations destabilise the epigenetic landscape . Strikingly, we show that GBM can explain the full distribution of Polycomb marks in a whole Drosophila chromosome.
Revised:  In contrast , GBM-targeted perturbations destabilise the epigenetic landscape . Strikingly, we show that GBM can explain the full distribution of Polycomb marks in a whole Drosophila chromosome.
Edit intent: coherence
Original:  On the contrary , GBM-targeted perturbations destabilise the epigenetic landscape . Strikingly, we show that GBM can explain the full distribution of Polycomb marks in a whole Drosophila chromosome.
Revised:  On the contrary , GBM-targeted perturbations destabilise the epigenetic patterns . Strikingly, we show that GBM can explain the full distribution of Polycomb marks in a whole Drosophila chromosome.
Edit intent: clarity
Original:  On the contrary , GBM-targeted perturbations destabilise the epigenetic landscape . Strikingly, we show that GBM can explain the full distribution of Polycomb marks in a whole Drosophila chromosome.
Revised:  On the contrary , GBM-targeted perturbations destabilise the epigenetic landscape . Strikingly, we demonstrate that GBM alone can explain the full distribution of Polycomb marks in a whole Drosophila chromosome.
Edit intent: meaning-changed
Original:  Using this simple concept combined with monotonicity of Expected Shortfall with respect to its target confidence level , one can provide an unconditional coverage backtesting framework for Expected Shortfall that is a natural extension of the current Value-at-Risk regulatory traffic-light approach  .
Revised:  Using this simple concept combined with monotonicity of Expected Shortfall with respect to its target confidence level we introduce a natural and efficient backtesting framework. Our test statistics is given by the biggest number of worst realisations for the secured position that add up to a negative total. Surprisingly, this simple quantity could be used to construct an efficient backtesting framework for Expected Shortfall that is a natural extension of the current Value-at-Risk regulatory traffic-light approach .
Edit intent: meaning-changed
Original:  Using this simple concept combined with monotonicity of Expected Shortfall with respect to its target confidence level , one can provide an unconditional coverage backtesting framework for Expected Shortfall that is a natural extension of the current Value-at-Risk regulatory traffic-light approach  .
Revised:  Using this simple concept combined with monotonicity of Expected Shortfall with respect to its target confidence level , one can provide an unconditional coverage backtesting framework for unconditional coverage of Expected Shortfall in a natural extension of the current Value-at-Risk regulatory traffic-light approach .
Edit intent: coherence
Original:  Using this simple concept combined with monotonicity of Expected Shortfall with respect to its target confidence level , one can provide an unconditional coverage backtesting framework for Expected Shortfall that is a natural extension of the current Value-at-Risk regulatory traffic-light approach  .
Revised:  Using this simple concept combined with monotonicity of Expected Shortfall with respect to its target confidence level , one can provide an unconditional coverage backtesting framework for Expected Shortfall that is a natural extension of the regulatory traffic-light approach .
Edit intent: clarity
Original:  Using this simple concept combined with monotonicity of Expected Shortfall with respect to its target confidence level , one can provide an unconditional coverage backtesting framework for Expected Shortfall that is a natural extension of the current Value-at-Risk regulatory traffic-light approach  .
Revised:  Using this simple concept combined with monotonicity of Expected Shortfall with respect to its target confidence level , one can provide an unconditional coverage backtesting framework for Expected Shortfall that is a natural extension of the current Value-at-Risk regulatory traffic-light approach for Value-at-Risk. While being easy to calculate, the test statistic is based on the underlying duality between coherent risk measures and scale-invariant performance measures .
Edit intent: meaning-changed
Original: It is well known that the folding time of a protein correlates with the contact order, a simple measure of the URLanization of a protein. This is related to the average length of the main chain loops formed by amino acids which are in contact in the native state .
Revised: It is well known that the folding time of a protein correlates with the contact order, a simple measure of the URLanisation of the native state of the protein. Contact order is related to the average length of the main chain loops formed by amino acids which are in contact in the native state .
Edit intent: coherence
Original: Recent experiments where ferrets were exposed to two influenza strains within a short time have provided insight into the timing and contribution of each immune component to cross-protection.
Revised: Laboratory models are often used to understand the interaction of related pathogens via host immunity. For example, recent experiments where ferrets were exposed to two influenza strains within a short time have provided insight into the timing and contribution of each immune component to cross-protection.
Edit intent: meaning-changed
Original: Recent experiments where ferrets were exposed to two influenza strains within a short time have provided insight into the timing and contribution of each immune component to cross-protection. While mathematical models which capture the novel observations have been developed and analysed, they have many parameters and it is unclear whether the contributions of each immune component to cross-protection can be recovered from the data .
Revised: Recent experiments where ferrets were exposed to two influenza strains within a short period of time have shown how the effects of cross-immunity vary with the time between exposures and the specific strains used. On the other hand, studies of the workings of different arms of the immune response, and their relative importance, typically use experiments involving a single infection. However, inferring the relative importance of different immune components from this type of data is challenging. Using simulations and mathematical modelling, here we investigate whether the sequential infection experiment design can be used not only to determine immune components contributing to cross-protection can be recovered from the data .
Edit intent: meaning-changed
Original:  While mathematical models which capture the novel observations have been developed and analysed, they have many parameters and it is unclear whether the contributions of each immune component to cross-protection can be recovered from the data .
Revised:  While mathematical models which capture the novel observations have been developed and analysed, they have many parameters and it is unclear whether the contributions of each immune component to cross-protection , but also to gain insight into the immune response during a single infection .
Edit intent: meaning-changed