wanyu/IteraTeR_full_sent huggingface dataset:
Original:  This methodology is performed following five steps, from the biogeographical bipartite network construction, to the identification of biogeographical regions under the form of spatial network communities , the analysis of their interactions and the identification of clusters of plant species based on the species contribution to the biogeographical regions.
Revised:  This methodology is performed following five steps, from the biogeographical bipartite network construction, to the identification of biogeographical regions under the form of spatial network communities , the analysis of their interactions and the identification of groups of plant species based on the species contribution to the biogeographical regions.
Edit intent: clarity
Original: Aim. We analysed the spatial distribution patterns of plant species, in order to characterize the biogeographical structure of the French Mediterranean flora. Location. South of France (Languedoc-Roussillon and Provence-Alpes-C\^ote d'Azur) .
Revised: Aim. We analysed the spatial distribution patterns of plants in south of France (Languedoc-Roussillon and Provence-Alpes-C\^ote d'Azur) .
Edit intent: clarity
Original:  Location. South of France (Languedoc-Roussillon and Provence-Alpes-C\^ote d'Azur) . Taxon. Vascular plants. Methods. We used a network approach to identify and characterize bioregions in southern France , based on a large database consisting in millions of geolocalized plant samples corresponding to more than 3,500 plant species.
Revised:  Location. South of France (Languedoc-Roussillon and Provence-Alpes-C\^ote d'Azur) to analyze the biogeographical structure of the French Mediterranean flora at different scales. We used a network approach to identify and characterize bioregions in southern France , based on a large database consisting in millions of geolocalized plant samples corresponding to more than 3,500 plant species.
Edit intent: meaning-changed
Original:  Methods. We used a network approach to identify and characterize bioregions in southern France , based on a large database consisting in millions of geolocalized plant samples corresponding to more than 3,500 plant species.
Revised:  Methods. We used a network approach to identify and characterize biogeographical regions , based on a large database consisting in millions of geolocalized plant samples corresponding to more than 3,500 plant species.
Edit intent: clarity
Original:  Methods. We used a network approach to identify and characterize bioregions in southern France , based on a large database consisting in millions of geolocalized plant samples corresponding to more than 3,500 plant species.
Revised:  Methods. We used a network approach to identify and characterize bioregions in southern France , based on a large database containing 2.5 million of geolocalized plant samples corresponding to more than 3,500 plant species.
Edit intent: meaning-changed
Original:  Methods. We used a network approach to identify and characterize bioregions in southern France , based on a large database consisting in millions of geolocalized plant samples corresponding to more than 3,500 plant species.
Revised:  Methods. We used a network approach to identify and characterize bioregions in southern France , based on a large database consisting in millions of geolocalized plant records corresponding to more than 3,500 plant species.
Edit intent: clarity
Original:  Methods. We used a network approach to identify and characterize bioregions in southern France , based on a large database consisting in millions of geolocalized plant samples corresponding to more than 3,500 plant species.
Revised:  Methods. We used a network approach to identify and characterize bioregions in southern France , based on a large database consisting in millions of geolocalized plant samples corresponding to more than 3500 plant species.
Edit intent: meaning-changed
Original:  This methodology is performed following five steps, from the biogeographical bipartite network construction, to the identification of bioregions under the form of spatial network clusters , the analysis of their interactions and the identification of groups of plant species based on the species contribution to the biogeographical regions.
Revised:  This methodology is performed following five steps, from the biogeographical bipartite network construction, to the identification of biogeographical regions under the form of spatial network clusters , the analysis of their interactions and the identification of groups of plant species based on the species contribution to the biogeographical regions.
Edit intent: fluency
Original:  This methodology is performed following five steps, from the biogeographical bipartite network construction, to the identification of bioregions under the form of spatial network clusters , the analysis of their interactions and the identification of groups of plant species based on the species contribution to the biogeographical regions.
Revised:  This methodology is performed following five steps, from the biogeographical bipartite network construction, to the identification of bioregions under the form of spatial network communities , the analysis of their interactions and the identification of groups of plant species based on the species contribution to the biogeographical regions.
Edit intent: clarity
Original:  This methodology is performed following five steps, from the biogeographical bipartite network construction, to the identification of bioregions under the form of spatial network clusters , the analysis of their interactions and the identification of groups of plant species based on the species contribution to the biogeographical regions.
Revised:  This methodology is performed following five steps, from the biogeographical bipartite network construction, to the identification of bioregions under the form of spatial network clusters , the analysis of their interactions and the identification of clusters of plant species based on the species contribution to the biogeographical regions.
Edit intent: clarity
Original:  Results. The French Mediterranean area is divided into eight statistically significant biogeographical regions that are highly connected spatially . Mediterranean and temperate sub-networks can be distinguished. The three mediterranean bioregions are share an important pool of species, and present a high spatial coherence. The limit formed closely matches the mesomediterranean thermoclimatic belt. The transition area between Mediterranean and temperate systems is represented by the bioregion "mediterranean border" whose northern limit fit the limit of the Mediterranean biome. Main conclusions. The proposed network approach provides a characterization of the biogeographical structure which confirms some previously recognized floristic regions in southern France, while providing more precise insights into the relationships between them .
Revised:  Results. The French Mediterranean area is divided into eight statistically significant bioregions that present a complex spatial structure. Some of them are spatially well delimited, and match with particular geological entities. On the other hand fuzzy transitions arise between adjacent bioregions that share a common geological setting, but are spread along a climatic gradient. The proposed network approach provides a characterization of the biogeographical structure which confirms some previously recognized floristic regions in southern France, while providing more precise insights into the relationships between them .
Edit intent: clarity
Original:  This approach sheds light on the historical and ecological mechanisms shaping the distribution of Mediterranean biota , and exemplify why fragmented distributions are common in the Mediterranean region  .
Revised:  This approach sheds light on the historical and ecological mechanisms shaping the distribution of Mediterranean biota : the interplay between a climatic gradient and geological substrate shapes biodiversity patterns. Finally this work exemplifies why fragmented distributions are common in the Mediterranean region .
Edit intent: meaning-changed
Original: While risk adjustment is pervasive in the health care system, relatively little attention has been devoted to studying the fairness of these formulas for individuals who may be harmed by them. In practice, risk adjustment algorithms are often built with respect to statistical fit, as measured by p-values or R2 statistics.
Revised: Stepwise regression building procedures are commonly used applied statistical tools, despite their well-known drawbacks. While many of their limitations have been widely discussed in the literature, other aspects of the use of individual statistical fit measures, especially in high-dimensional stepwise regression settings, have not. Giving primacy to individual fit, as measured by p-values or R2 statistics.
Edit intent: coherence
Original:  In practice, risk adjustment algorithms are often built with respect to statistical fit, as measured by p-values or R2 statistics.
Revised:  In practice, risk adjustment algorithms are often built with respect to statistical fit, as measured by p-values and R^2, when group fit may be the larger concern, can lead to misguided decision making. One of the most consequential uses of stepwise regression is in health care, where these tools allocate hundreds of billions of dollars to health plans enrolling individuals with different predicted health care costs.
Edit intent: meaning-changed
Original:  The main goal of a health plan payment risk adjustment system is to convey incentives to health plans such that they provide health care services efficiently , a component of which is not to discriminate in access or care for persons or groups likely to be expensive.
Revised:  The main goal of this "risk adjustment" system is to convey incentives to health plans such that they provide health care services efficiently , a component of which is not to discriminate in access or care for persons or groups likely to be expensive.
Edit intent: clarity
Original:  The main goal of a health plan payment risk adjustment system is to convey incentives to health plans such that they provide health care services efficiently , a component of which is not to discriminate in access or care for persons or groups likely to be expensive.
Revised:  The main goal of a health plan payment risk adjustment system is to convey incentives to health plans such that they provide health care services fairly , a component of which is not to discriminate in access or care for persons or groups likely to be expensive.
Edit intent: clarity
Original:  In an attempt to accomplish this, risk adjustment formulas include indicators for the presence of health conditions associated with higher costs. The salient issue is that incentives mainly operate at a group level, not an individual level; plans can discriminate at the group level in ways they cannot at the person level. Because health plans providing sparse care for certain illnesses is a key policy concern, group-level fit is arguably one of the most important metrics for formula evaluation. Giving primacy on the basis of individual fit when group fit may be the larger concern can lead to harmful decision making. We therefore discuss the role of p-values and statistical fit for this policy problem while considering the fairness of the risk adjustment algorithm for vulnerable groups.
Revised:  We address some specific limitations of p-values and statistical fit for this policy problem while considering the fairness of the risk adjustment algorithm for vulnerable groups.
Edit intent: clarity
Original:  We therefore discuss the role of p-values and statistical fit for this policy problem while considering the fairness of the risk adjustment algorithm for vulnerable groups. Enrollees with mental health and substance use disorders have been found to be subject to the adverse incentives noted above. We apply our ideas to this vulnerable group with a group-level net compensation metricof the incentives to health plans to underprovide services .
Revised:  We therefore discuss the role of p-values and statistical fit for this policy problem through an illustrated example by additionally considering a group-level net compensation metricof the incentives to health plans to underprovide services .
Edit intent: meaning-changed
Original:  Colonies of aligned pusher particles are shown to elongate in the direction of particle orientation and undergo a cascade of transverse concentration instabilities . Colonies of aligned puller particles instead are found to elongate in the direction opposite the particle orientation and exhibit dramatic splay as the group moves into the bulk. A linear stability analysis of concentrated line distributions of particles is performed and growth rates are found, using an active slender-body approximation, to match the results of numerical simulations. Thin concentrated bands of aligned pusher particles are always unstable, while bands of aligned puller particles can either be stable (immotile particles)  or unstable (motile particles) with a growth rate which is non-monotonic in the force dipole strength.
Revised:  Colonies of aligned pusher particles are shown to elongate in the direction of particle orientation and undergo a cascade of transverse concentration instabilities , governed at small times by an equation which also describes the Saffman-Taylor instability in a Hele-Shaw cell, or Rayleigh-Taylor instability in two-dimensional flow through a porous medium. Thin sheets of aligned pusher particles are always unstable, while bands of aligned puller particles can either be stable (immotile particles) or unstable (motile particles) with a growth rate which is non-monotonic in the force dipole strength.
Edit intent: meaning-changed
Original:  Thin concentrated bands of aligned pusher particles are always unstable, while bands of aligned puller particles can either be stable (immotile particles)  or unstable (motile particles) with a growth rate which is non-monotonic in the force dipole strength.
Revised:  Thin concentrated bands of aligned pusher particles are always unstable, while sheets of aligned puller particles can either be stable (immotile particles) or unstable (motile particles) with a growth rate which is non-monotonic in the force dipole strength.
Edit intent: clarity
Original:  Thin concentrated bands of aligned pusher particles are always unstable, while bands of aligned puller particles can either be stable (immotile particles)  or unstable (motile particles) with a growth rate which is non-monotonic in the force dipole strength.
Revised:  Thin concentrated bands of aligned pusher particles are always unstable, while bands of aligned puller particles can either be stable (immotile particles) , or unstable (motile particles) with a growth rate which is non-monotonic in the force dipole strength.
Edit intent: fluency
Original: We show that the problem of guarding an x-monotone terrain from an altitude line and the problem of guarding a uni-monotone polygon are equivalent. We present a polynomial time algorithm for both problems, and show that the cardinality of a minimum guard set and the cardinality of a maximum witness set coincide.
Revised: We present an optimal, linear-time algorithm for the following version of terrain guarding: given a 1.5D terrain and a horizontal line, place the minimum number of guards on the line to see all of the terrain. We prove that the cardinality of a minimum guard set and the cardinality of a maximum witness set coincide.
Edit intent: meaning-changed
Original:  We present a polynomial time algorithm for both problems, and show that the cardinality of a minimum guard set and the cardinality of a maximum witness set coincide.Thus, uni-monotone polygons are perfect; this result also extends to monotone mountains .
Revised:  We present a polynomial time algorithm for both problems, and show that the cardinality of a minimum guard set and the cardinality of a maximum number of ``witnesses'', i.e., terrain points, no two of which can be seen by a single guard. We show that our results also apply to the Art Gallery problem in ``monotone mountains'', i.e., x-monotone polygons with a single edge as one of the boundary chains. This means that any monotone mountain is ``perfect'' (its guarding number is the same as its witness number); we thus establish the first non-trivial class of perfect polygons .
Edit intent: meaning-changed
Original:  Surprisingly, for simple and widely used objects such as rectangles, the problem is NP-hard even when all the rectangles are "anchored" at a  line with slope -1.
Revised:  Surprisingly, for simple and widely used objects such as rectangles, no sub-logarithmic approximation is known for the problem and (perhaps surprisingly) the problem is NP-hard even when all the rectangles are "anchored" at a line with slope -1.
Edit intent: meaning-changed
Original:  Surprisingly, for simple and widely used objects such as rectangles, the problem is NP-hard even when all the rectangles are "anchored" at a  line with slope -1. It is easy to see that for the anchored rectangles , the problem reduces to one with even simpler objects: L-frames .
Revised:  Surprisingly, for simple and widely used objects such as rectangles, the problem is NP-hard even when all the rectangles are "anchored" at a line with slope -1 (Pandit, CCCG 2017). In this paper, we first show that for any \epsilon>0, there exists a (2+\epsilon)-approximation algorithm for the MDS problem on "diagonal-anchored" rectangles, providing the first O(1)-approximation for the problem on a non-trivial subclass of rectangles. It is not hard to see that for the anchored rectangles , the problem reduces to one with even simpler objects: L-frames .
Edit intent: meaning-changed
Original:  It is easy to see that for the anchored rectangles , the problem reduces to one with even simpler objects: L-frames . An L-frame is the union of a vertical and a horizontal  segment that share one endpoint(corner of the L-frame).
Revised:  It is easy to see that for the anchored rectangles , the problem reduces to one with even simpler objects: L-frames : the union of a vertical and a horizontal segment that share one endpoint(corner of the L-frame).
Edit intent: clarity
Original:  An L-frame is the union of a vertical and a horizontal  segment that share one endpoint(corner of the L-frame). In light of the above discussion, we consider DS on the intersection graphs of L-frames. In this paper, we consider three restricted versions of the problem. First, we consider the version in which the corners of all input L-frames are anchored at a line with slope -1, and obtain a polynomial-time (2+\epsilon)-approximation .
Revised:  An L-frame is the union of a vertical and a horizontal segment that share an endpoint. As such, we also obtain a (2+\epsilon)-approximation .
Edit intent: clarity
Original:  First, we consider the version in which the corners of all input L-frames are anchored at a line with slope -1, and obtain a polynomial-time (2+\epsilon)-approximation . Furthermore, we obtain a PTAS in case all the input L-frames are anchored at the diagonalfrom one side.
Revised:  First, we consider the version in which the corners of all input L-frames are anchored at a line with slope -1, and obtain a polynomial-time (2+\epsilon)-approximation for the problem with "diagonal-anchored" L-frames. On the other hand, we show that the problem is APX-hard in case the input L-frames are anchored at the diagonalfrom one side.
Edit intent: meaning-changed
Original:  Furthermore, we obtain a PTAS in case all the input L-frames are anchored at the diagonalfrom one side. Next, we consider the version, where all input L-frames intersect a vertical line , and prove APX-hardness of this version.
Revised:  Furthermore, we obtain a PTAS in case all the input L-frames intersect the diagonal, or the horizontal segments of the L-frames intersect a vertical line , and prove APX-hardness of this version.
Edit intent: meaning-changed
Original:  Next, we consider the version, where all input L-frames intersect a vertical line , and prove APX-hardness of this version. Moreover, we prove NP-hardness of this version even in case the horizontal and vertical segments of each L-frame have the same length.
Revised:  Next, we consider the version, where all input L-frames intersect a vertical line . However, as we show, the problem is linear-time solvable in case the horizontal and vertical segments of each L-frame have the same length.
Edit intent: meaning-changed
Original:  Moreover, we prove NP-hardness of this version even in case the horizontal and vertical segments of each L-frame have the same length. Finally, we consider the version, where every L-frame intersects a vertical and a horizontal line , and show that this version is linear-time solvable.
Revised:  Moreover, we prove NP-hardness of this version even in case the L-frames intersect a vertical as well as a horizontal line , and show that this version is linear-time solvable.
Edit intent: clarity
Original:  Finally, we consider the version, where every L-frame intersects a vertical and a horizontal line , and show that this version is linear-time solvable. We also consider these versions of the problem in the so-called "edge intersection model" , and obtain several interesting results.
Revised:  Finally, we consider the version, where every L-frame intersects a vertical and a horizontal line . Finally, we consider the MDS problem in the so-called "edge intersection model" , and obtain several interesting results.
Edit intent: clarity
Original:  We also consider these versions of the problem in the so-called "edge intersection model" , and obtain several interesting results. One of the resultsis an NP-hardness proof of the third version which answers a question posed by Mehrabi (WAOA 2017).
Revised:  We also consider these versions of the problem in the so-called "edge intersection model" and obtain a number of results, answering two questions posed by Mehrabi (WAOA 2017).
Edit intent: meaning-changed
Original:  All of our algorithms can be used to approximate the hyperbolicity of a geodesic metric space  .
Revised:  All of our algorithms can be used to approximate the hyperbolicity of a geodesic metric space . We also show that a similar characterization of hyperbolicity holds for all geodesic metric spaces endowed with a geodesic spanning tree. Along the way, we prove that any complete geodesic metric space (X,d) has such a geodesic spanning tree. We hope that this fundamental result can be useful in other contexts .
Edit intent: meaning-changed
Original:   Second, in the case of a general cost field, we especially give sufficient conditions such that spatial risk measures associated with expectation, variance, Value-at-Risk as well as expected shortfall and induced by this cost field satisfy the axioms of asymptotic spatial homogeneity of order 0, -2, -1 and -1, respectively.
Revised:  We also explain the usefulness of this theory for the actuarial practice. Second, in the case of a general cost field, we especially give sufficient conditions such that spatial risk measures associated with expectation, variance, Value-at-Risk as well as expected shortfall and induced by this cost field satisfy the axioms of asymptotic spatial homogeneity of order 0, -2, -1 and -1, respectively.
Edit intent: meaning-changed
Original:  Second, in the case of a general cost field, we especially give sufficient conditions such that spatial risk measures associated with expectation, variance, Value-at-Risk as well as expected shortfall and induced by this cost field satisfy the axioms of asymptotic spatial homogeneity of order 0, -2, -1 and -1, respectively.
Revised:  Second, in the case of a general cost field, we give sufficient conditions such that spatial risk measures associated with expectation, variance, Value-at-Risk as well as expected shortfall and induced by this cost field satisfy the axioms of asymptotic spatial homogeneity of order 0, -2, -1 and -1, respectively.
Edit intent: coherence