wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Several interesting results are reported, including the identification  of linearity in the transfer functions , as well as the identification of regions in the parameter space characterized by sharper transfer functions  .
Revised:  Several interesting results are reported, including the identification of linearity in the transfer functions , as well as the identification of regions in the parameter space characterized by sharper transfer functions . These properties can be used to facilitate simulations under certain circumstances and to validate the model by comparison with biological results .
Edit intent: meaning-changed
Original:  Using state-of-the-art statistical approaches, we also provided new evidence to settle a previously stated controversy that raised the possibility of complete biological networks being random . Therefore, attributing the observed scale-free properties to an artifact emerging from the sampling process during network discovery.
Revised:  Using state-of-the-art statistical approaches, we also provided new evidence to settle a previously stated controversy that raised the possibility of complete biological networks being random and therefore attributing the observed scale-free properties to an artifact emerging from the sampling process during network discovery.
Edit intent: coherence
Original:  Human behaviour plays a fundamental role in the spreading dynamics and can be used to stop a disease from spreading or to reduce its burden, as individuals aware of the presence of a disease can take measures to reduce their exposure to contagion.
Revised:  Human behavior plays a fundamental role in the spreading dynamics and can be used to stop a disease from spreading or to reduce its burden, as individuals aware of the presence of a disease can take measures to reduce their exposure to contagion.
Edit intent: fluency
Original:  We also show that a reduction in the fraction of unaware individuals does not always imply a decrease of the prevalence, as the relative time scale between disease and awareness spreadings plays a crucial role in the systems' dynamics  .
Revised:  We also show that a reduction in the fraction of unaware individuals does not always imply a decrease of the prevalence, as the relative timescale between disease and awareness spreadings plays a crucial role in the systems' dynamics .
Edit intent: fluency
Original:  We also show that a reduction in the fraction of unaware individuals does not always imply a decrease of the prevalence, as the relative time scale between disease and awareness spreadings plays a crucial role in the systems' dynamics  .
Revised:  We also show that a reduction in the fraction of unaware individuals does not always imply a decrease of the prevalence, as the relative time scale between disease and awareness spreading plays a crucial role in the systems' dynamics .
Edit intent: fluency
Original:  We also show that a reduction in the fraction of unaware individuals does not always imply a decrease of the prevalence, as the relative time scale between disease and awareness spreadings plays a crucial role in the systems' dynamics  .
Revised:  We also show that a reduction in the fraction of unaware individuals does not always imply a decrease of the prevalence, as the relative time scale between disease and awareness spreadings plays a crucial role in the systems' dynamics . This result is shown to be independent of the network topology. We finally calculate the epidemic threshold of our model, and show that it does not depend on the relative timescale .
Edit intent: meaning-changed
Original:   Also in higher dimensions, wheel sets turn out to be a suitable model to approach the problem of computing the simplicial depth of a point ~ w in a set ~ H, i.e., the number of simplices spanned by~H that contain~w.
Revised:  In particular, we rediscover an already known formula for w-embracing triangles spanned by H. Also in higher dimensions, wheel sets turn out to be a suitable model to approach the problem of computing the simplicial depth of a point ~ w in a set ~ H, i.e., the number of simplices spanned by~H that contain~w.
Edit intent: meaning-changed
Original:   Also in higher dimensions, wheel sets turn out to be a suitable model to approach the problem of computing the simplicial depth of a point ~ w in a set ~ H, i.e., the number of simplices spanned by~H that contain~w.
Revised:  Also in higher dimensions, wheel sets turn out to be a suitable model to approach the problem of computing the simplicial depth of a point ~ w in a set ~ H, i.e., the number of simplices spanned by~H that contain~w.
Edit intent: fluency
Original:   Also in higher dimensions, wheel sets turn out to be a suitable model to approach the problem of computing the simplicial depth of a point ~ w in a set ~ H, i.e., the number of simplices spanned by~H that contain~w.
Revised:  Also in higher dimensions, wheel sets turn out to be a suitable model to approach the problem of computing the simplicial depth of a point w in a set ~ H, i.e., the number of simplices spanned by~H that contain~w.
Edit intent: fluency
Original:   Also in higher dimensions, wheel sets turn out to be a suitable model to approach the problem of computing the simplicial depth of a point ~ w in a set ~ H, i.e., the number of simplices spanned by~H that contain~w.
Revised:  Also in higher dimensions, wheel sets turn out to be a suitable model to approach the problem of computing the simplicial depth of a point ~ w in a set H, i.e., the number of simplices spanned by~H that contain~w.
Edit intent: fluency
Original:   Also in higher dimensions, wheel sets turn out to be a suitable model to approach the problem of computing the simplicial depth of a point ~ w in a set ~ H, i.e., the number of simplices spanned by~H that contain~w. While the concept of frequency vectors does not generalize easily, we show how to apply similar methods in higher dimensions .
Revised:  Also in higher dimensions, wheel sets turn out to be a suitable model to approach the problem of computing the simplicial depth of a point ~ w in a set ~ H, i.e., the number of w-embracing simplices. While our previous arguments in the plane do not generalize easily, we show how to apply similar methods in higher dimensions .
Edit intent: meaning-changed
Original:  The result is an O(n^{d-1}) time algorithm for computing the simplicial depth of a point w in a set H of n d-dimensional points, improving on the previously best bound of O(n^d\log n).
Revised:  The result is an O(n^{d-1}) time algorithm for computing the simplicial depth of a point w in a set H of n points, improving on the previously best bound of O(n^d\log n).
Edit intent: clarity
Original:  Configurations equivalent to wheel sets have already been used by Perles for counting the faces of high-dimensional polytopes with few vertices via the Gale dual. Based on that we can compute the number of facets of the convex hull of n=d+k points in general position in \mathbb{R}^d in time O(n^{\max\{\omega,k-2\}}) where \omega \approx 2.373, even though the asymptotic number of facets may be as large as n^k.
Revised:  Based on our result about simplicial depth, we can compute the number of facets of the convex hull of n=d+k points in general position in \mathbb{R}^d in time O(n^{\max\{\omega,k-2\}}) where \omega \approx 2.373, even though the asymptotic number of facets may be as large as n^k.
Edit intent: meaning-changed
Original:  In addition, our proposed methodology accommodates linear and nonlinear specifications, allows for treatment effect heterogeneity, and can be applied with either panel or repeated cross section data . We establish the asymptotic distribution of our proposed doubly robust estimators , and propose a computationally simple bootstrap procedure to conduct asymptotically valid inference. Our inference procedures directly account for multiple testing, and are therefore suitable in situations where researchers are interested in the effect of a given policy on many different outcomes. We demonstrate the relevance of our proposed policy evaluation tools in two different applications .
Revised:  In addition, our proposed methodology accommodates linear and nonlinear specifications, allows for treatment effect heterogeneity, and can be applied with either panel or repeated cross-section data are available, and show that our proposed estimators attain the semiparametric efficiency bound when the working models are correctly specified. Finally, by paying particular attention to the estimation method used to estimate the nuisance parameters, we show that one can sometimes construct doubly robust DID estimators for the ATT that are also doubly robust for inference. Simulation studies and an empirical application illustrate the desirable finite-sample performance of the proposed estimators. Open-source software for implementing the proposed policy evaluation tools in two different applications .
Edit intent: meaning-changed
Original:   Finally, by paying particular attention to the estimation method used to estimate the nuisance parameters, we show that one can sometimes construct doubly robust DID estimators for the ATT that are also doubly robust for inference.
Revised:  Furthermore, we quantify the potential efficiency gains of having access to panel data instead of repeated cross-section data. Finally, by paying particular attention to the estimation method used to estimate the nuisance parameters, we show that one can sometimes construct doubly robust DID estimators for the ATT that are also doubly robust for inference.
Edit intent: meaning-changed
Original:   Finally, by paying particular attention to the estimation method used to estimate the nuisance parameters, we show that one can sometimes construct doubly robust DID estimators for the ATT that are also doubly robust for inference.
Revised:  Finally, by paying articular attention to the estimation method used to estimate the nuisance parameters, we show that one can sometimes construct doubly robust DID estimators for the ATT that are also doubly robust for inference.
Edit intent: fluency
Original: The estimation of the mortality rate function for a stage-structured population is obtained starting from time-series field data on the abundance of the species.
Revised: The estimation of the mortality rate function for a stage-structured population requires the knowledge of the biodemographic functions characterizing the species, namely development, mortality and fecundity. In general, development and fecundity can satisfactorily be estimated starting from literature data. Unfortunately, this is often not the case of the mortality function, because of the lack of experimental data. To overcome this problem we estimate the mortality rate function from field data on the abundance of the species.
Edit intent: meaning-changed
Original:  The method is based on the formulation of the mortality as a combination of cubic splines and it is applied to the  case of Lobesia botrana, the main pest in the European vineyards, with  data collected in a location in the North of Italy .
Revised:  The mortality is expressed as a linear combination of cubic splines and it is applied to the case of Lobesia botrana, the main pest in the European vineyards, with data collected in a location in the North of Italy .
Edit intent: clarity
Original:  The method is based on the formulation of the mortality as a combination of cubic splines and it is applied to the  case of Lobesia botrana, the main pest in the European vineyards, with  data collected in a location in the North of Italy .
Revised:  The method is based on the formulation of the mortality as a combination of cubic splines and the estimation method allows to determine its coefficients taking into account the observations measurement error. Moreover, the variability in the estimate is quantified by means of the confidence bands for both mortality and dynamics. The presented method allows to obtain a more flexible shape for the mortality rate functions compared with previous methods applied to the case of Lobesia botrana, the main pest in the European vineyards, with data collected in a location in the North of Italy .
Edit intent: meaning-changed
Original:  The method is based on the formulation of the mortality as a combination of cubic splines and it is applied to the  case of Lobesia botrana, the main pest in the European vineyards, with  data collected in a location in the North of Italy .
Revised:  The method is based on the formulation of the mortality as a combination of cubic splines and it is applied to the same pest. The method is applied to the case of Lobesia botrana, the main pest in the European vineyards, with data collected in a location in the North of Italy .
Edit intent: meaning-changed
Original:  The method is based on the formulation of the mortality as a combination of cubic splines and it is applied to the  case of Lobesia botrana, the main pest in the European vineyards, with  data collected in a location in the North of Italy .
Revised:  The method is based on the formulation of the mortality as a combination of cubic splines and it is applied to the case of Lobesia botrana, the main pest in the European vineyards, with abundance data collected in a location in the North of Italy .
Edit intent: coherence
Original:  The method is based on the formulation of the mortality as a combination of cubic splines and it is applied to the  case of Lobesia botrana, the main pest in the European vineyards, with  data collected in a location in the North of Italy . Mortality estimates are based on 3 years of data and are used to obtain the dynamics for two different years.
Revised:  The method is based on the formulation of the mortality as a combination of cubic splines and it is applied to the case of Lobesia botrana, the main pest in the European vineyards, with data collected in a location in the North of Italy for five consecutive years. Data collected over three years are used to obtain the dynamics for two different years.
Edit intent: meaning-changed
Original:  Mortality estimates are based on 3 years of data and are used to obtain the dynamics for two different years. These dynamics give a satisfactory fit of the phenology of the pest. The method presented allows to obtain more flexible shape for the mortality rate functions compared with previously methods applied for the same pest .
Revised:  Mortality estimates are based on 3 years of data and are used to estimate the mortality and to analyze the variability in the estimate and its effects on the population dynamics. Other two datasets are used to validate the model simulating the dynamics using the estimated mortality .
Edit intent: meaning-changed
Original:  We revisit two strands of the empirical literature on persuasion to show that the persuasive effect is highly heterogeneous and studies based on binary instruments provide limited information about the average persuasion rate in a heterogeneous population.
Revised:  We revisit the empirical literature on persuasion to show that the persuasive effect is highly heterogeneous and studies based on binary instruments provide limited information about the average persuasion rate in a heterogeneous population.
Edit intent: clarity
Original:  We revisit two strands of the empirical literature on persuasion to show that the persuasive effect is highly heterogeneous and studies based on binary instruments provide limited information about the average persuasion rate in a heterogeneous population.
Revised:  We revisit two strands of the empirical literature on persuasion to show that the persuasive effect is highly heterogeneous . We also show that the existence of a continuous instrument opens up the possibility of point identification for the policy-relevant population.
Edit intent: meaning-changed
Original:  This paper introduces an approach to solve the Capacitated Vehicle Routing Problem with Time Windows  for a high number of nodes by splitting the problem into smaller sub-problems with lower number of nodes.
Revised:  This paper introduces an approach to solve the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) solvers for a high number of nodes by splitting the problem into smaller sub-problems with lower number of nodes.
Edit intent: meaning-changed
Original:  This paper introduces an approach to solve the Capacitated Vehicle Routing Problem with Time Windows  for a high number of nodes by splitting the problem into smaller sub-problems with lower number of nodes. It introduces an approach based on clustering nodes together using Recursive-DBSCAN - a method that recursively applies DBSCAN until clusters below the preset maximum number of nodes per cluster are obtained.
Revised:  This paper introduces an approach to solve the Capacitated Vehicle Routing Problem with Time Windows for a high number of nodes . It proposes to cluster nodes together using Recursive-DBSCAN - a method that recursively applies DBSCAN until clusters below the preset maximum number of nodes per cluster are obtained.
Edit intent: clarity
Original:  That approach leads to improvement in runtimes of the CVRPTW solver as benchmarked against Google Optimization Tools, while the difference in quality of found solutions, as measured in terms of total distance and number of vehicles used , is below 7\%.
Revised:  That approach leads to 61\% decrease in runtimes of the CVRPTW solver as benchmarked against Google Optimization Tools, while the difference in quality of found solutions, as measured in terms of total distance and number of vehicles used , is below 7\%.
Edit intent: meaning-changed
Original:  That approach leads to improvement in runtimes of the CVRPTW solver as benchmarked against Google Optimization Tools, while the difference in quality of found solutions, as measured in terms of total distance and number of vehicles used , is below 7\%.
Revised:  That approach leads to improvement in runtimes of the CVRPTW solver as benchmarked against Google Optimization Tools, while the difference of total distance and number of vehicles used , is below 7\%.
Edit intent: clarity
Original:  That approach leads to improvement in runtimes of the CVRPTW solver as benchmarked against Google Optimization Tools, while the difference in quality of found solutions, as measured in terms of total distance and number of vehicles used , is below 7\%.
Revised:  That approach leads to improvement in runtimes of the CVRPTW solver as benchmarked against Google Optimization Tools, while the difference in quality of found solutions, as measured in terms of total distance and number of vehicles used by found solutions is below 7\%.
Edit intent: clarity
Original:  The improvement of runtimes with the Recursive-DBSCAN method is because of splitting the node-set into constituent clusters, which limits and decreases the number of possible solutions checked by the optimiser, consequently driving down the runtime .
Revised:  The improvement of runtimes with the Recursive-DBSCAN method is because of splitting the node-set into constituent clusters, which limits the number of possible solutions checked by the optimiser, consequently driving down the runtime .
Edit intent: clarity
Original:  The improvement of runtimes with the Recursive-DBSCAN method is because of splitting the node-set into constituent clusters, which limits and decreases the number of possible solutions checked by the optimiser, consequently driving down the runtime .
Revised:  The improvement of runtimes with the Recursive-DBSCAN method is because of splitting the node-set into constituent clusters, which limits and decreases the number of solutions checked by the optimiser, consequently driving down the runtime .
Edit intent: clarity
Original:  The improvement of runtimes with the Recursive-DBSCAN method is because of splitting the node-set into constituent clusters, which limits and decreases the number of possible solutions checked by the optimiser, consequently driving down the runtime .
Revised:  The improvement of runtimes with the Recursive-DBSCAN method is because of splitting the node-set into constituent clusters, which limits and decreases the number of possible solutions checked by the solver, consequently reducing the runtime. The proposed method consumes less memory and is able to find solutions for problems up to 5000 nodes, while the baseline Google Optimisation Tools solves problems up to 2000 nodes .
Edit intent: meaning-changed
Original:  We perform our simulations with the SABCEMM (Simulator for Agent-Based Computational Economic Market Models) tool recently introduced by the authors (Trimborn et al. 2018a). The SABCEMM simulator is implemented in C++ and is well suited for large scale computations. Thanks to its object-oriented software design, the SABCEMM tool enables the creation of new models by plugging together novel and existing agent and market designs as easily as plugging together pieces of a puzzle. We present new ABCEM models created by recombining existing models and study them with respect to stylized facts as well.
Revised:  We perform our simulations with the SABCEMM (Simulator for Agent-Based Computational Economic Market Models) tool recently introduced by the authors (Trimborn et al. 2019). Furthermore, we present novel ABCEM models created by recombining existing models and study them with respect to stylized facts as well.
Edit intent: clarity
Original:  The proposed procedure applies a dimensionality reduction technique via principal component analysis to the point cloud of the Takens' embedding from the observed time series and then evaluates the persistence landscape and silhouettes based on the corresponding Rips complex .
Revised:  Our algorithm provides a simple, efficient way to successfully harness topological features of the attractor of the underlying dynamical system for an observed time series and then evaluates the persistence landscape and silhouettes based on the corresponding Rips complex .
Edit intent: clarity
Original:  The proposed procedure applies a dimensionality reduction technique via principal component analysis to the point cloud of the Takens' embedding from the observed time series and then evaluates the persistence landscape and silhouettes based on the corresponding Rips complex . We define a new notion of Rips distance function that is especially suited for persistence homologies built on Rips complexes and prove stability theorems for it. We use these results to demonstrate in turn some stability properties of the topological features extracted using our procedure with respect to additive noise and sampling .
Revised:  The proposed procedure applies a dimensionality reduction technique via principal component analysis to the point cloud of the Takens' embedding from the observed time series . The proposed methodology relies on the persistent landscapes and silhouette of the Rips complex obtained after a de-noising step based on principal components applied to a time-delayed embedding of a noisy, discrete time series sample. We analyze the stability properties of the topological features extracted using our procedure with respect to additive noise and sampling .
Edit intent: clarity
Original: A Vietoris--Rips complex is a way to thicken a (possibly discrete) metric space into a larger space containing more topological information. We prove that if C is a convex closed differentiable curve in the plane such that the convex hull of C contains the evolute of C, then the homotopy type of a Vietoris--Rips complex of a subset of n points from C can be computed in time O(n  \log n) .
Revised: We give an O(n \log n) .
Edit intent: meaning-changed
Original:  We prove that if C is a convex closed differentiable curve in the plane such that the convex hull of C contains the evolute of C, then the homotopy type of a Vietoris--Rips complex of a subset of n points from C can be computed in time O(n  \log n) .
Revised:  We prove that if C is a convex closed differentiable curve in the plane such that the convex hull of C contains the evolute of C, then the homotopy type of a Vietoris--Rips complex of a subset of n points from C can be computed in time O(n ^2(k+ \log n) .
Edit intent: meaning-changed