wanyu/IteraTeR_full_sent huggingface dataset:
Original:  For higher levels of inaccessibility,  vaccination strategies are not expected to contain the epidemic even though they help lower incidence levels, which saves lives, makes the epidemic easier to contain and reduces spread to other communities.
Revised:  For higher levels of inaccessibility, even the combined ring and community vaccination strategies are not expected to contain the epidemic even though they help lower incidence levels, which saves lives, makes the epidemic easier to contain and reduces spread to other communities.
Edit intent: meaning-changed
Original:  This qualitative change occurs for both types of vaccination strategies: ring vaccination is effective for containing an outbreak until the levels of inaccessibility exceeds approximately 10\%, a combined ring and community vaccination strategy is effective until the levels of inaccessibility exceeds approximately 50\%.
Revised:  We found that ring vaccination is effective for containing an outbreak until the levels of inaccessibility exceeds approximately 10\%, a combined ring and community vaccination strategy is effective until the levels of inaccessibility exceeds approximately 50\%.
Edit intent: coherence
Original: Fuzzy regression discontinuity (FRD) designs occur frequently in many areas of applied economics. We argue that the confidence intervals based on nonparametric local linear regression that are commonly reported in empirical FRD studies can have poor finite sample coverage properties for reasons related to their general construction based on the delta method, and to how they account for smoothing bias.
Revised: The confidence intervals (CIs) commonly reported in empirical FRD studies can have poor finite sample coverage properties for reasons related to their general construction based on the delta method, and to how they account for smoothing bias.
Edit intent: clarity
Original:  We argue that the confidence intervals based on nonparametric local linear regression that are commonly reported in empirical FRD studies can have poor finite sample coverage properties for reasons related to their general construction based on the delta method, and to how they account for smoothing bias. We therefore propose new confidence sets , which are based on an Anderson-Rubin-type construction .
Revised:  We argue that the confidence intervals based on nonparametric local linear regression that are commonly reported in empirical fuzzy regression discontinuity studies are justified by theoretical arguments which assume that the running variable is continuously distributed with positive density around the cutoff, and that the jump in treatment probabilities at the cutoff is "large". In this paper, we provide new confidence sets , which are based on an Anderson-Rubin-type construction .
Edit intent: meaning-changed
Original:  We therefore propose new confidence sets , which are based on an Anderson-Rubin-type construction . These confidence sets are bias-aware, in the sense that they explicitly take into account the exact smoothing bias of the local linear estimators on which they are based .
Revised:  We therefore propose new confidence sets (CSs) that do not rely on such assumptions. Their construction is analogous to that of Anderson-Rubin CSs in the literature on instrumental variable models. Our CSs are based on local linear regression, and are bias-aware, in the sense that they explicitly take into account the exact smoothing bias of the local linear estimators on which they are based .
Edit intent: meaning-changed
Original:  They are simple to compute, highly efficient, have excellent coverage properties in finite samples. They are also valid under weak identification (that is, if the jump in treatment probabilities at the threshold is small) and irrespective of whether the distribution of the running variableis continuous, discrete, or of some intermediate form .
Revised:  They are valid under a wide range of empirically relevant conditions in which existing CIs generally fail. These conditions include discrete running variables, donut designs, and weak identification. But our CS also perform favorably relative to existing CIs in the canonical setting with a continuous running variable, and can thus be used in all fuzzy regression discontinuity applications .
Edit intent: meaning-changed
Original: The confidence intervals (CIs) commonly reported in empirical fuzzy regression discontinuity studies are justified by theoretical arguments which assume that the running variable is continuously distributed with positive density around the cutoff, and that the jump in treatment probabilities at the cutoff is "large". In this paper, we provide new confidence sets (CSs) that do not rely on such assumptions.
Revised: We propose new confidence sets (CSs) that do not rely on such assumptions.
Edit intent: coherence
Original:  They are valid under a wide range of empirically relevant conditions in which existing CIs generally fail.
Revised:  Their construction shares similarities with that of Anderson-Rubin CSs in exactly identified instrumental variable models, and thereby avoids issues with "delta method" approximations that underlie most commonly used existing inference methods for fuzzy regression discontinuity analysis. Our CSs compare favorably in terms of both theoretical and practical performance to existing procedures in canonical settings with strong identification and a continuous running variable. However, due to their particular construction they are also valid under a wide range of empirically relevant conditions in which existing CIs generally fail.
Edit intent: meaning-changed
Original:  Additionally, we demonstrate the scalability of our method by applying the RRW to study the correlation between mammalian adult body mass and litter size in a phylogenetic tree with 2306 tips.
Revised:  Additionally, we demonstrate the scalability of our method by applying the RRW to study the correlation between mammalian adult body mass and litter size in a phylogenetic tree with 3650 tips.
Edit intent: meaning-changed
Original: In this work, we have developed a Coxian distributed SEIR model in incorporating an empirical incubation period since Coxian distribution approximately converges to any distribution. A basic reproduction number is found from the model .
Revised: In this work, we have developed a Coxian distributed SEIR model in incorporating an empirical incubation period . We show that the global dynamics are completely determined by a basic reproduction number is found from the model .
Edit intent: meaning-changed
Original:  Simulations were conducted from in vivo studies  involving children and adolescents evaluating maximum trunk muscle strength (MTMS), lumbar disc compressibility (LDC), intradiscal pressure (IDP) and trunk muscle activity (MA).
Revised:  Simulations were conducted from in vivo studies reported in the literature involving children and adolescents evaluating maximum trunk muscle strength (MTMS), lumbar disc compressibility (LDC), intradiscal pressure (IDP) and trunk muscle activity (MA).
Edit intent: meaning-changed
Original:  MA: r>=0.90, p<0.001), indicating suitability for the reasonably accurate prediction of maximal trunk extensor strength, segmental loading and trunk muscle activity in children and adolescents.
Revised:  MA: r>=0.90, p<0.001), indicating suitability for the reasonably accurate prediction of maximal trunk muscle strength, segmental loading and trunk muscle activity in children and adolescents.
Edit intent: clarity
Original:  When aiming at investigating children or adolescents with pathologies such as idiopathic scoliosis, our models can serve as a basis for the creation of deformed spine models as well as for comparative purposes.
Revised:  When aiming at investigating children or adolescents with pathologies such as idiopathic scoliosis, our models can serve as a basis for the creation of deformed spine models and for comparative purposes.
Edit intent: coherence
Original: A recent data visualization literacy study shows that most people cannot read networks that use hierarchical cluster representations such as "super-noding" and "edge bundling." Other studies that compare standard node-link representations with map-like visualizations show that map-like visualizations are superior in terms of task performance, memorization and engagement  .
Revised: Human subject studies that map-like visualizations show that map-like visualizations are superior in terms of task performance, memorization and engagement .
Edit intent: clarity
Original:  With this in mind, we propose the Zoomable Multilevel Tree (ZMLT) algorithm for  map-like visualization of large graphs that is representative, real, persistent, overlap-free labeled, planar, and compact.
Revised:  With this in mind, we propose the Zoomable Multi-Level Tree (ZMLT) algorithm for map-like visualization of large graphs that is representative, real, persistent, overlap-free labeled, planar, and compact.
Edit intent: clarity
Original:  With this in mind, we propose the Zoomable Multilevel Tree (ZMLT) algorithm for  map-like visualization of large graphs that is representative, real, persistent, overlap-free labeled, planar, and compact.
Revised:  With this in mind, we propose the Zoomable Multilevel Tree (ZMLT) algorithm for multi-level tree-based, map-like visualization of large graphs that is representative, real, persistent, overlap-free labeled, planar, and compact.
Edit intent: meaning-changed
Original:  With this in mind, we propose the Zoomable Multilevel Tree (ZMLT) algorithm for  map-like visualization of large graphs that is representative, real, persistent, overlap-free labeled, planar, and compact. These six desirable properties are formalized with the following guarantees: (1) The abstract and embedded trees represent the underlying graph appropriately at different level of details (in terms of the structure of the graph as well as the embedding thereof);
Revised:  With this in mind, we propose the Zoomable Multilevel Tree (ZMLT) algorithm for map-like visualization of large graphs . We propose seven desirable properties that such visualization should maintain and an algorithm that accomplishes them. (1) The abstract and embedded trees represent the underlying graph appropriately at different level of details (in terms of the structure of the graph as well as the embedding thereof);
Edit intent: meaning-changed
Original:  These six desirable properties are formalized with the following guarantees: (1) The abstract and embedded trees represent the underlying graph appropriately at different level of details (in terms of the structure of the graph as well as the embedding thereof);
Revised:  These six desirable properties are formalized with the following guarantees: (1) The abstract trees represent the underlying graph appropriately at different level of details (in terms of the structure of the graph as well as the embedding thereof);
Edit intent: clarity
Original:  These six desirable properties are formalized with the following guarantees: (1) The abstract and embedded trees represent the underlying graph appropriately at different level of details (in terms of the structure of the graph as well as the embedding thereof); ( 2  ) At every level of detail we show real vertices and real paths from the underlying graph;
Revised:  These six desirable properties are formalized with the following guarantees: (1) The abstract and embedded trees represent the underlying graph appropriately at different level of details ; ( 2 ) At every level of detail we show real vertices and real paths from the underlying graph;
Edit intent: coherence
Original:  Nowadays such datasets are available over time, and hence there is a need for (a) treemapping algorithms that can handle time-dependent data, and (b) corresponding quality criteria and evaluations .
Revised:  Nowadays such datasets are available over time, and hence there is a need for (a) treemapping algorithms that can handle time-dependent data, and (b) corresponding quality criteria that cover both a treemap's visual quality and its stability over time .
Edit intent: clarity
Original:  We aim to provide insights to allow researchers and practitioners to  make an informed choice when selecting a treemapping algorithm for their specific application and their data. For this , we perform an extensive quantitative evaluation of rectangular treemapping algorithms for time-dependent data.
Revised:  We aim to provide insights to allow researchers and practitioners to make an informed choice when selecting a treemapping algorithm for specific applications and data. To this end , we perform an extensive quantitative evaluation of rectangular treemapping algorithms for time-dependent data.
Edit intent: clarity
Original:  As part of this evaluation we propose a novel classification scheme for time-dependent tree datasets. We approximate the infinite problem space of all such datasets by a low-dimensional feature space spanned by measurable characteristics (features) of the problem instances. We propose four such features to characterize time-dependent hierarchical datasets and classify all datasets used in our experiments accordingly.
Revised:  As part of this evaluation we propose a novel classification scheme for time-dependent datasets. Specifically, we observe that the performance of treemapping algorithms depends on the characteristics of the datasets used. We identify four potential representative features that characterize time-dependent hierarchical datasets and classify all datasets used in our experiments accordingly.
Edit intent: meaning-changed
Original:  Moreover, we introduce a new method to measure the stability of time-dependent treemaps which explicitly incorporates the change in the input data. We analyze and visually summarize the results with respect to both visual quality and stability  .
Revised:  We experimentally test the validity of this classification on more than 2000 datasets, and analyze the relative performance of 14 state-of-the-art rectangular treemapping algorithms across varying features. Finally, we visually summarize our results with respect to both visual quality and stability .
Edit intent: meaning-changed
Original: Evolutionary events like hybridization and horizontal gene transfer cannot be represented by a tree but require a phylogenetic network instead. Nonetheless, it has been argued that evolution is fundamentally tree-like , in the sense that it can be modeled by a tree with additional arcs.
Revised: Tree-based networks are a class of phylogenetic networks that attempt to formally capture what is meant by `` tree-like , in the sense that it can be modeled by a tree with additional arcs.
Edit intent: clarity
Original:  Nonetheless, it has been argued that evolution is fundamentally tree-like , in the sense that it can be modeled by a tree with additional arcs. Phylogenetic networks with this property are called tree-based, and this concept has recently attracted significant attention in evolutionary research. But classifying networks into tree-based and non-tree-based ones is usually not sufficient for biological purposes, because sometimes tree-basedness is missed merely due to incomplete sampling.
Revised:  Nonetheless, it has been argued that evolution is fundamentally tree-like '' evolution. A given non-tree-based ones is usually not sufficient for biological purposes, because sometimes tree-basedness is missed merely due to incomplete sampling.
Edit intent: clarity
Original:  But classifying networks into tree-based and non-tree-based ones is usually not sufficient for biological purposes, because sometimes tree-basedness is missed merely due to incomplete sampling. Therefore, measures are needed to quantify how close a non-tree-based network is to being tree-based .
Revised:  But classifying networks into tree-based and non-tree-based phylogenetic network, however, might appear to be very close to being tree-based .
Edit intent: meaning-changed
Original:  Therefore, measures are needed to quantify how close a non-tree-based network is to being tree-based . Such measuresnaturally also lead to characterizations of tree-based networks, and some measures for this purpose have recently been introduced both for binary and non-binary rooted phylogenetic networks .
Revised:  Therefore, measures are needed to quantify how close a non-tree-based network is to being tree-based , or very far. In this paper, we formalise the notion of proximity to tree-based networks, and some measures for this purpose have recently been introduced both for binary and non-binary rooted phylogenetic networks .
Edit intent: meaning-changed
Original:  Such measuresnaturally also lead to characterizations of tree-based networks, and some measures for this purpose have recently been introduced both for binary and non-binary rooted phylogenetic networks .
Revised:  Such measuresnaturally also lead to characterizations of tree-based for unrooted phylogenetic networks, with a range of proximity measures. These measures also provide characterisations of tree-based networks. One measure in particular, related to the nearest neighbour interchange operation, allows us to define the notion of ``tree-based rank''. This provides a subclassification within the tree-based networks themselves, identifying those networks that are ``very'' tree-based. Finally, we prove results relating tree-based networks in the settings of rooted and unrooted phylogenetic networks, showing effectively that an unrooted network is tree-based if and only if it can be made a rooted tree-based network by rooting it and orienting the edges appropriately .
Edit intent: meaning-changed
Original:  One measure in particular, related to the nearest neighbour interchange operation, allows us to define the notion of `` tree-based rank '' . This provides a subclassification within the tree-based networks themselves, identifying those networks that are ``very'' tree-based.
Revised:  One measure in particular, related to the nearest neighbour interchange operation, allows us to define the notion of " tree-based rank '' . This provides a subclassification within the tree-based networks themselves, identifying those networks that are ``very'' tree-based.
Edit intent: fluency
Original:  One measure in particular, related to the nearest neighbour interchange operation, allows us to define the notion of `` tree-based rank '' . This provides a subclassification within the tree-based networks themselves, identifying those networks that are ``very'' tree-based.
Revised:  One measure in particular, related to the nearest neighbour interchange operation, allows us to define the notion of `` tree-based rank " . This provides a subclassification within the tree-based networks themselves, identifying those networks that are ``very'' tree-based.
Edit intent: fluency
Original:  One measure in particular, related to the nearest neighbour interchange operation, allows us to define the notion of `` tree-based rank '' . This provides a subclassification within the tree-based networks themselves, identifying those networks that are ``very'' tree-based.
Revised:  One measure in particular, related to the nearest neighbour interchange operation, allows us to define the notion of `` tree-based rank '' . This provides a subclassification within the tree-based networks themselves, identifying those networks that are "very" tree-based.
Edit intent: fluency
Original:  While no single theory can explain all scales , which appear to evolve according to different selection pressures, the simplest harmonicity-based, imperfect-fifths packing model best fits the empirical data.
Revised:  While no single theory can explain all scales , which appear to evolve according to various selection pressures, the simplest harmonicity-based, imperfect-fifths packing model best fits the empirical data.
Edit intent: fluency
Original:  We establish two robustness properties of posterior average effects under misspecification of the assumed distribution of unobservables : they are optimal in terms of local worst-case bias, and their global bias is at most twice the minimum worst-case bias within a large class of estimators .
Revised:  We show that PAE have minimum worst-case bias under local misspecification of the assumed distribution of unobservables : they are optimal in terms of local worst-case bias, and their global bias is at most twice the minimum worst-case bias within a large class of estimators .
Edit intent: clarity
Original:  We establish two robustness properties of posterior average effects under misspecification of the assumed distribution of unobservables : they are optimal in terms of local worst-case bias, and their global bias is at most twice the minimum worst-case bias within a large class of estimators .
Revised:  We establish two robustness properties of posterior average effects under misspecification of the parametric distribution of unobservables : they are optimal in terms of local worst-case bias, and their global bias is at most twice the minimum worst-case bias within a large class of estimators .
Edit intent: clarity
Original:  We establish two robustness properties of posterior average effects under misspecification of the assumed distribution of unobservables : they are optimal in terms of local worst-case bias, and their global bias is at most twice the minimum worst-case bias within a large class of estimators . We establish related robustness results for posterior predictors. In addition, we suggest a simple measure of the information contained in the posterior conditioning. Lastly, we present two empirical illustrations, to estimate the distributions of neighborhood effects in the US, and of permanent and transitory components in a model of income dynamics.
Revised:  We establish two robustness properties of posterior average effects under misspecification of the assumed distribution of unobservables . This provides a rationale for reporting these estimators in applications. We introduce a measure of informativeness of the posterior conditioning, which quantifies the bias of PAE relative to parametric model-based estimators, and we study other robustness properties of PAE for estimation and prediction. As illustrations, we report PAE estimates of distributions of neighborhood effects in the US, and of permanent and transitory components in a model of income dynamics.
Edit intent: coherence
Original: Economists are often interested in estimating averages with respect to distributions of unobservables . Examples are moments of individual fixed-effects,  average partial effects in discrete choice models , and counterfactual simulations in structural models .
Revised: Economists are often interested in estimating averages with respect to distributions of unobservables , such as moments of individual fixed-effects, average partial effects in discrete choice models , and counterfactual simulations in structural models .
Edit intent: clarity
Original: Economists are often interested in estimating averages with respect to distributions of unobservables . Examples are moments of individual fixed-effects,  average partial effects in discrete choice models , and counterfactual simulations in structural models .
Revised: Economists are often interested in estimating averages with respect to distributions of unobservables . Examples are moments of individual fixed-effects, or average partial effects in discrete choice models , and counterfactual simulations in structural models .
Edit intent: clarity
Original:  This provides a rationale for reporting these estimators in applications. We introduce a measure of informativeness of the posterior conditioning, which quantifies the bias of PAE relative to parametric model-based estimators , and we study other robustness properties of PAE for estimation and prediction .
Revised:  In addition, we introduce a measure of informativeness of the posterior conditioning, which quantifies the bias of PAE relative to parametric model-based estimators , and we study other robustness properties of PAE for estimation and prediction .
Edit intent: clarity