wanyu/IteraTeR_v2 huggingface dataset:
Original:  As an immediate application of our new protocol, we show a new error correcting code that is efficient even for very large numbers of (adversarial) edit errors.
Revised:  As an immediate application of our new protocol, we show a new error correcting code that is efficient even for large numbers of (adversarial) edit errors.
Edit intent: clarity
Original:   We show that the minimal finite deterministic automaton of a regular language can be arbitrary far away from a finite deterministic automaton realizing the minimal genus and computing the same language  both in terms of the difference of genera and in terms of the difference in size.
Revised:  We show that the minimal finite deterministic automaton of a regular language can be arbitrary far away from a finite deterministic automaton realizing the minimal genus and computing the same language , both in terms of the difference of genera and in terms of the difference in size.
Edit intent: fluency
Original: In this short note, we consider the optimization variant of the realizability problem for specifications in Prompt Linear Temporal Logic (Prompt-LTL), which extends Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by a parametric bound .
Revised: We consider the optimization variant of the realizability problem for specifications in Prompt Linear Temporal Logic (Prompt-LTL), which extends Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by a parametric bound .
Edit intent: coherence
Original: In this short note, we consider the optimization variant of the realizability problem for specifications in Prompt Linear Temporal Logic (Prompt-LTL), which extends Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by a parametric bound .
Revised: In this short note, we consider the optimization variant of the realizability problem for Prompt Linear Temporal Logic (Prompt-LTL), which extends Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by a parametric bound .
Edit intent: clarity
Original: In this short note, we consider the optimization variant of the realizability problem for specifications in Prompt Linear Temporal Logic (Prompt-LTL), which extends Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by a parametric bound .
Revised: In this short note, we consider the optimization variant of the realizability problem for specifications in Prompt Linear Temporal Logic , an extension of Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by a parametric bound .
Edit intent: clarity
Original: In this short note, we consider the optimization variant of the realizability problem for specifications in Prompt Linear Temporal Logic (Prompt-LTL), which extends Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by a parametric bound .
Revised: In this short note, we consider the optimization variant of the realizability problem for specifications in Prompt Linear Temporal Logic (Prompt-LTL), which extends Linear Temporal Logic (LTL) by the prompt eventually operator whose scope is bounded by some parameter .
Edit intent: clarity
Original:  We take a step towards resolving this problem by showing that the optimum can be approximated within a factor of 2 in doubly-exponential time  .
Revised:  We take a step towards resolving this problem by showing that the optimum can be approximated within a factor of two in doubly-exponential time .
Edit intent: fluency
Original:  The notion of frequency and filters traditionally defined for signals supported on regular domains such as discrete time and image grids has been recently generalized to irregular graph domains, and defines brain graph frequency associated with different levels of spatial smoothness across the brain regions.
Revised:  The notion of frequency and filters traditionally defined for signals supported on regular domains such as discrete time and image grids has been recently generalized to irregular graph domains, and defines brain graph frequencies associated with different levels of spatial smoothness across the brain regions.
Edit intent: fluency
Original:  Brain network frequency also enables the decomposition of brain signals into pieces corresponding to smooth or vibrant variations.
Revised:  Brain network frequency also enables the decomposition of brain signals into pieces corresponding to smooth or rapid variations.
Edit intent: clarity
Original:  Further, we notice the strong association between graph spectral property of brain networks with the level of exposure to tasks performed, and recognize the most contributing and important frequency signatures at different task familiarity.
Revised:  Further, we notice a strong association between graph spectral property of brain networks with the level of exposure to tasks performed, and recognize the most contributing and important frequency signatures at different task familiarity.
Edit intent: fluency
Original:  Further, we notice the strong association between graph spectral property of brain networks with the level of exposure to tasks performed, and recognize the most contributing and important frequency signatures at different task familiarity.
Revised:  Further, we notice the strong association between graph spectral properties of brain networks with the level of exposure to tasks performed, and recognize the most contributing and important frequency signatures at different task familiarity.
Edit intent: fluency
Original:  Further, we notice the strong association between graph spectral property of brain networks with the level of exposure to tasks performed, and recognize the most contributing and important frequency signatures at different task familiarity.
Revised:  Further, we notice the strong association between graph spectral property of brain networks and the level of exposure to tasks performed, and recognize the most contributing and important frequency signatures at different task familiarity.
Edit intent: fluency
Original:  Existing declarative process mining approaches either su?er performance issues with real-life event logs or limit their expressiveness to a specifi?c set of constaint types.
Revised:  Existing declarative process mining approaches either suffer performance issues with real-life event logs or limit their expressiveness to a specifi?c set of constaint types.
Edit intent: fluency
Original:  Existing declarative process mining approaches either su?er performance issues with real-life event logs or limit their expressiveness to a specifi?c set of constaint types.
Revised:  Existing declarative process mining approaches either su?er performance issues with real-life event logs or limit their expressiveness to a specific set of constaint types.
Edit intent: fluency
Original: A fundamental result in metabolic pathway analysis states that every element of the flux cone can be written as a sum of elementary modes.
Revised: A fundamental result in metabolic pathway analysis states that every flux mode can be decomposed into a sum of elementary modes.
Edit intent: clarity
Original:  In general, elementary vectors need not be support-minimal ;
Revised:  We note that, in general, elementary vectors need not be support-minimal ;
Edit intent: clarity
Original:  In general, elementary vectors need not be support-minimal ;
Revised:  In general, elementary vectors need not be support-minimal ,
Edit intent: fluency
Original:  As a result, redundant new metrics are proposed frequently, and privacy studies are often incomparable.
Revised:  As a result, instead of using existing metrics, new metrics are proposed frequently, and privacy studies are often incomparable.
Edit intent: clarity
Original:  For this we explain and discuss a selection of over eighty privacy metrics and introduce a categorization based on the aspect of privacy they measure, their required inputs, and the type of data that needs protection.
Revised:  To this end, we explain and discuss a selection of over eighty privacy metrics and introduce a categorization based on the aspect of privacy they measure, their required inputs, and the type of data that needs protection.
Edit intent: clarity
Original:  For this we explain and discuss a selection of over eighty privacy metrics and introduce a categorization based on the aspect of privacy they measure, their required inputs, and the type of data that needs protection.
Revised:  For this we explain and discuss a selection of over eighty privacy metrics and introduce categorizations based on the aspect of privacy they measure, their required inputs, and the type of data that needs protection.
Edit intent: fluency
Original:  The models are denoted SIR-w and SEIR-w , and we focus attention on the early stages of an outbreak, where we derive expression for the basic reproduction number R0 and the expected degree of the infectious nodes E(D_I) using two different approximation approaches.
Revised:  The models are denoted SIR-w and SEIR-w , and we focus attention on the early stages of an outbreak, where we derive expression for the basic reproduction number R_0 and the expected degree of the infectious nodes E(D_I) using two different approximation approaches.
Edit intent: fluency
Original:  For SIR-w, and the SEIR-w case without rewiring of exposed nodes, both approaches predict the same epidemic threshold and the same E(D_I)  , the latter being very close to the observed mean degree in simulated epidemics over Poisson networks.
Revised:  Without rewiring of exposed nodes, both approaches predict the same epidemic threshold and the same E(D_I) , the latter being very close to the observed mean degree in simulated epidemics over Poisson networks.
Edit intent: coherence
Original:  For SIR-w, and the SEIR-w case without rewiring of exposed nodes, both approaches predict the same epidemic threshold and the same E(D_I)  , the latter being very close to the observed mean degree in simulated epidemics over Poisson networks.
Revised:  For SIR-w, and the SEIR-w case without rewiring of exposed nodes, the two approaches predict the same epidemic threshold and the same E(D_I) , the latter being very close to the observed mean degree in simulated epidemics over Poisson networks.
Edit intent: clarity
Original:  For SIR-w, and the SEIR-w case without rewiring of exposed nodes, both approaches predict the same epidemic threshold and the same E(D_I)  , the latter being very close to the observed mean degree in simulated epidemics over Poisson networks.
Revised:  For SIR-w, and the SEIR-w case without rewiring of exposed nodes, both approaches predict the same epidemic threshold and the same E(D_I) , the latter being very close to the mean degree obtained from simulated epidemics over Poisson networks.
Edit intent: clarity
Original:  Above the epidemic threshold, pairwise models overestimate the value of R0 obtained from the simulations, which turns out to be very close to the one predicted by the branching process approximation.
Revised:  Above the epidemic threshold, pairwise models overestimate the value of R_0 computed from simulations, which turns out to be very close to the one predicted by the branching process approximation.
Edit intent: clarity
Original:  For SEIR-w where exposed individuals also rewire  (perhaps unaware of being infected), the two approaches give different epidemic thresholds, with the branching process approximation being more in agreement with simulations.
Revised:  When exposed individuals also rewire (perhaps unaware of being infected), the two approaches give different epidemic thresholds, with the branching process approximation being more in agreement with simulations.
Edit intent: clarity
Original: This paper is concerned with stochastic SIR and SEIR epidemic models on random networks in which individuals may rewire away from infected neighbors at some rate \omega (and reconnect to susceptible individuals with probability \alpha or else simply drop the edge if \alpha=0), so-called preventive rewiring.
Revised: This paper is concerned with stochastic SIR and SEIR epidemic models on random networks in which individuals may rewire away from infected neighbors at some rate \omega (and reconnect to non-infectious individuals with probability \alpha or else simply drop the edge if \alpha=0), so-called preventive rewiring.
Edit intent: clarity
Original:  As a consequence, we deduce that the number of\emph{pairwise non-overlapping cycles , namely, cycles whose xy-projections do not overlap, is O(n^{3/2\mathrm{polylog} n);
Revised:  \emph{pairwise non-overlapping cycles , namely, cycles whose xy-projections do not overlap, is O(n^{3/2\mathrm{polylog} n);
Edit intent: clarity
Original:  } Previous results on this topic could only handle restricted cases of the problem (such as handling only triangular cycles, by Aronov, Koltun, and Sharir  , or only cycles in grid-like patterns, by Chazelle et al.  ), and the bounds were considerably weaker---much closer to quadratic .
Revised:  } Previous results on this topic could only handle restricted cases of the problem (such as handling only triangular cycles, by Aronov, Koltun, and Sharir , or only cycles in grid-like patterns, by Chazelle et al. ), and the bounds were considerably weaker---much closer to the trivial quadratic bound .
Edit intent: clarity
Original:  Our technique extends to eliminating all cycles in the depth relation among segments, and of constant-degree algebraic arcs.
Revised:  Our technique can be extended to eliminating all cycles in the depth relation among segments, and of constant-degree algebraic arcs.
Edit intent: clarity
Original:  Our technique extends to eliminating all cycles in the depth relation among segments, and of constant-degree algebraic arcs.
Revised:  Our technique extends to eliminating all cycles in the depth relation among segments, and among constant-degree algebraic arcs.
Edit intent: clarity
Original:  We hope that a suitable extension of this technique could be used to handle the ( much more difficult ) case of pairwise-disjoint triangles.
Revised:  We hope that a suitable extension of this technique could be used to handle the much more difficult ) case of pairwise-disjoint triangles.
Edit intent: fluency
Original:  We hope that a suitable extension of this technique could be used to handle the ( much more difficult ) case of pairwise-disjoint triangles.
Revised:  We hope that a suitable extension of this technique could be used to handle the ( much more difficult case of pairwise-disjoint triangles.
Edit intent: fluency
Original:   Our results almost completely settle a long-standing (35 years old) open problem in computational geometry, motivated by hidden-surface removal in computer graphics.
Revised:  Our results almost completely settle a 35-year-old open problem in computational geometry, motivated by hidden-surface removal in computer graphics.
Edit intent: coherence
Original:  In particular the game nicely illustrate that cyclic interactions allow multiple strategies to coexist for long time intervals.
Revised:  In particular the game nicely illustrates that cyclic interactions allow multiple strategies to coexist for long time intervals.
Edit intent: fluency
Original:  When formulated in terms of a one dimensional cellular automata, the spatial distribution of strategies exhibits coarsening with algebraically growing domain size over time, while the two-dimensional version allows domains to break and thereby opens for long-time coexistence.
Revised:  When formulated in terms of a one-dimensional cellular automata, the spatial distribution of strategies exhibits coarsening with algebraically growing domain size over time, while the two-dimensional version allows domains to break and thereby opens for long-time coexistence.
Edit intent: fluency
Original:  We find that increasing the complexity from two to three parallel lines allows a transition from complete coarsening to a steady state activity where the domain sizes stays finite.
Revised:  We find that increasing the complexity from two to three parallel subsystems allows a transition from complete coarsening to a steady state activity where the domain sizes stays finite.
Edit intent: clarity
Original:  We find that increasing the complexity from two to three parallel lines allows a transition from complete coarsening to a steady state activity where the domain sizes stays finite.
Revised:  We find that increasing the complexity from two to three parallel lines allows a transition from complete coarsening to an active steady state where the domain sizes stays finite.
Edit intent: clarity
Original:  We find that increasing the complexity from two to three parallel lines allows a transition from complete coarsening to a steady state activity where the domain sizes stays finite.
Revised:  We find that increasing the complexity from two to three parallel lines allows a transition from complete coarsening to a steady state activity where the domain size stays finite.
Edit intent: fluency
Original:  We further find that this transition happens irrespective of whether the updating is done in parallel for all sites simultaneously, or done randomly in sequential order.
Revised:  We further find that this transition happens irrespective of whether the update is done in parallel for all sites simultaneously, or done randomly in sequential order.
Edit intent: clarity
Original:  In both cases the active state is characterized by localized burst of dislocations, followed by longer periods of coarsening.
Revised:  In both cases the active state is characterized by localized bursts of dislocations, followed by longer periods of coarsening.
Edit intent: fluency
Original:  In the case of the parallel dynamics, we find that there is another phase transition between the active steady state and the coarsening state within  three-line system when the invasion rate between the lines is varied.
Revised:  In the case of the parallel dynamics, we find that there is another phase transition between the active steady state and the coarsening state within the three-line system when the invasion rate between the lines is varied.
Edit intent: fluency
Original:  In the case of the parallel dynamics, we find that there is another phase transition between the active steady state and the coarsening state within  three-line system when the invasion rate between the lines is varied.
Revised:  In the case of the parallel dynamics, we find that there is another phase transition between the active steady state and the coarsening state within three-line system when the invasion rate between the subsystems is varied.
Edit intent: clarity
Original:  We identify the critical parameter for this transition in the parallel dynamics case , and show that the density of active boundary have critical exponents that are consistent with the directed percolation universality class.
Revised:  We identify the critical parameter for this transition in the parallel dynamics case , and show that the density of active boundaries have critical exponents that are consistent with the directed percolation universality class.
Edit intent: fluency
Original:  On the contrary, numerical simulation with the random sequential dynamics suggests that the system may exhibit an active steady state as long as the invasion rate is finite.
Revised:  On the other hand, numerical simulations with the random sequential dynamics suggests that the system may exhibit an active steady state as long as the invasion rate is finite.
Edit intent: coherence
Original:  On the contrary, numerical simulation with the random sequential dynamics suggests that the system may exhibit an active steady state as long as the invasion rate is finite.
Revised:  On the contrary, numerical simulation with the random sequential dynamics suggest that the system may exhibit an active steady state as long as the invasion rate is finite.
Edit intent: fluency
Original:  We argue that while the random effects analysis implemented by the t-test does provide population inference if applied to activation differences, it fails to do so in the case of classification accuracy or other 'information-like' measures, because the true value of such measures can never be below chance level.
Revised:  We argue that while the random-effects analysis implemented by the t-test does provide population inference if applied to activation differences, it fails to do so in the case of classification accuracy or other 'information-like' measures, because the true value of such measures can never be below chance level.
Edit intent: fluency
Original: Early programming languages for Software-Defined Networking (SDN) were built on top of the simple match-action paradigm offered by OpenFlow 1.0.
Revised: Early programming languages for software-defined networking (SDN) were built on top of the simple match-action paradigm offered by OpenFlow 1.0.
Edit intent: fluency
Original:  However, emerging switches and middleboxes offer much more sophisticated support for persistent state in the data plane, without involving a central controller.
Revised:  However, emerging hardware and software switches offer much more sophisticated support for persistent state in the data plane, without involving a central controller.
Edit intent: clarity
Original:  We have implemented a prototype compiler , applied it to a range of programs and topologies , and measured our techniques' scalability.
Revised:  We have implemented a prototype compiler and applied it to a range of programs and topologies , and measured our techniques' scalability.
Edit intent: coherence
Original:  One approach successfully applies network theory to simplify and highlight the underlying structure in species distributions data .
Revised:  One approach successfully applies network theory to simplify and highlight the underlying structure in species distributions .
Edit intent: clarity
Original:  However, there are no tools that make this methodology simple and efficient to use .
Revised:  However, this method lacks tools for simple and efficient to use .
Edit intent: clarity
Original:  However, there are no tools that make this methodology simple and efficient to use .
Revised:  However, there are no tools that make this methodology simple and efficient analysis .
Edit intent: clarity
Original:  Potential applicationsinclude ancestral range reconstructions in historical biogeography and identification of indicator species for targeted conservation.
Revised:  As examples of applications, researchers can reconstruct ancestral ranges in historical biogeography and identification of indicator species for targeted conservation.
Edit intent: clarity
Original:  Potential applicationsinclude ancestral range reconstructions in historical biogeography and identification of indicator species for targeted conservation.
Revised:  Potential applicationsinclude ancestral range reconstructions in historical biogeography or identify indicator species for targeted conservation.
Edit intent: fluency
Original:  Symmetric threshold-linear networks thus appear to be well-suited for pattern completion, since the dynamics are guaranteed not to get "stuck" in a subset or superset of a stored pattern.
Revised:  Symmetric threshold-linear networks thus appear to be well suited for pattern completion, since the dynamics are guaranteed not to get "stuck" in a subset or superset of a stored pattern.
Edit intent: fluency
Original:  The influx of Na  is often taken as a proxy for energy consumption .
Revised:  The influx of Na + is often taken as a proxy for energy consumption .
Edit intent: fluency
Original: We proposed Neural Enquirer as a neural network architecture to execute a SQL-like query on a knowledge-base (KB) for answers.
Revised: We proposed Neural Enquirer as a neural network architecture to execute a natural language (NL) query on a knowledge-base (KB) for answers.
Edit intent: clarity