wanyu/IteraTeR_v2 huggingface dataset:
Original: It is known that many Twitter users are bots, which are created and controlled by computers.
Revised: It is known that many Twitter users are bots, which are accounts controlled and sometimes created by computers.
Edit intent: clarity
Original:  Here we report the discovery, retrieval, and analysis of the ' Star Wars' botnet on Twitter, which consists of more than 350,000 bots tweeting random quotations  from Star Wars novels.
Revised:  Here we report the discovery, retrieval, and analysis of the ` Star Wars' botnet on Twitter, which consists of more than 350,000 bots tweeting random quotations from Star Wars novels.
Edit intent: fluency
Original:  Here we report the discovery, retrieval, and analysis of the ' Star Wars' botnet on Twitter, which consists of more than 350,000 bots tweeting random quotations  from Star Wars novels.
Revised:  Here we report the discovery, retrieval, and analysis of the ' Star Wars' botnet in Twitter, which consists of more than 350,000 bots tweeting random quotations from Star Wars novels.
Edit intent: fluency
Original:  As of this writing, the Star Wars bots have not been blocked or deleted from Twitter.
Revised:  As of this writing, the Star Wars bots are still alive in Twitter.
Edit intent: clarity
Original:  They have been well hidden since their creation in 2013, despite the increasing number of efforts in recent years to detect and remove Twitter bots.
Revised:  They have survived since their creation in 2013, despite the increasing number of efforts in recent years to detect and remove Twitter bots.
Edit intent: clarity
Original:  They have been well hidden since their creation in 2013, despite the increasing number of efforts in recent years to detect and remove Twitter bots.
Revised:  They have been well hidden since their creation in 2013, despite the increasing efforts in recent years to detect and remove Twitter bots.
Edit intent: clarity
Original:  The monoid CA(G;A) itself is von Neumann regular if all its elements are von Neumann regular.
Revised:  The monoid CA(G;A) itself is regular if all its elements are von Neumann regular.
Edit intent: fluency
Original:  The monoid CA(G;A) itself is von Neumann regular if all its elements are von Neumann regular.
Revised:  The monoid CA(G;A) itself is von Neumann regular if all its elements are regular.
Edit intent: fluency
Original:  We establish that CA(G;A) is von Neumann regular if and only if |G | \vert \vert = 1 or |A | \leq \vert \vert  1, and we characterise all von Neumann regular elements in CA(G;A) when G and A are both finite.
Revised:  We establish that CA(G;A) is regular if and only if |G | \vert \vert = 1 or |A | \leq \vert \vert 1, and we characterise all von Neumann regular elements in CA(G;A) when G and A are both finite.
Edit intent: fluency
Original:  We establish that CA(G;A) is von Neumann regular if and only if |G | \vert \vert = 1 or |A | \leq \vert \vert  1, and we characterise all von Neumann regular elements in CA(G;A) when G and A are both finite.
Revised:  We establish that CA(G;A) is von Neumann regular if and only if \vert \vert = 1 or |A | \leq \vert \vert 1, and we characterise all von Neumann regular elements in CA(G;A) when G and A are both finite.
Edit intent: fluency
Original:  We establish that CA(G;A) is von Neumann regular if and only if |G | \vert \vert = 1 or |A | \leq \vert \vert  1, and we characterise all von Neumann regular elements in CA(G;A) when G and A are both finite.
Revised:  We establish that CA(G;A) is von Neumann regular if and only if |G | \vert \vert = 1 or \vert \vert 1, and we characterise all von Neumann regular elements in CA(G;A) when G and A are both finite.
Edit intent: clarity
Original:  We establish that CA(G;A) is von Neumann regular if and only if |G | \vert \vert = 1 or |A | \leq \vert \vert  1, and we characterise all von Neumann regular elements in CA(G;A) when G and A are both finite.
Revised:  We establish that CA(G;A) is von Neumann regular if and only if |G | \vert \vert = 1 or |A | \leq \vert \vert = 1, and we characterise all von Neumann regular elements in CA(G;A) when G and A are both finite.
Edit intent: fluency
Original:  We establish that CA(G;A) is von Neumann regular if and only if |G | \vert \vert = 1 or |A | \leq \vert \vert  1, and we characterise all von Neumann regular elements in CA(G;A) when G and A are both finite.
Revised:  We establish that CA(G;A) is von Neumann regular if and only if |G | \vert \vert = 1 or |A | \leq \vert \vert 1, and we characterise all regular elements in CA(G;A) when G and A are both finite.
Edit intent: fluency
Original:  Furthermore, we study von Neumann regular linear CA when G is an abelian group and A= \mathbb{F ;
Revised:  Furthermore, we study von Neumann regular linear CA when A= \mathbb{F ;
Edit intent: coherence
Original: We study the influence of the complex topology of scale-free graphs on the dynamics of anti-coordination games (  snowdrift games).
Revised: We study the influence of the complex topology of scale-free graphs on the dynamics of anti-coordination games ( e.g. snowdrift games).
Edit intent: clarity
Original:  These reference models are characterized by the coexistence (evolutionary stable mixed strategy) of two competing species, say "cooperators" and "defectors", and, in finite systems, by metastability and by large-fluctuation-driven fixation.
Revised:  These reference models are characterized by the coexistence (evolutionary stable mixed strategy) of two competing species, say "cooperators" and "defectors", and, in finite systems, by metastability and large-fluctuation-driven fixation.
Edit intent: fluency
Original:  For the voter update rule on scale-free graphs , we show that the  statistics of observables depend on the network's degree distribution , while with the link dynamics  we recover the same behavior as on complete graphs.
Revised:  For the voter update rule , we show that the statistics of observables depend on the network's degree distribution , while with the link dynamics we recover the same behavior as on complete graphs.
Edit intent: clarity
Original:  In this commentary we respond to a number of misrepresentations of our work and discuss a potential problems with Slotnick's own method.
Revised:  In this commentary we respond to a number of misrepresentations of our work and discuss potential problems with Slotnick's own method.
Edit intent: fluency
Original:  In this paper, we propose RUBER, a Referenced metric and Unreferenced metric Blended Evaluation Routine, which evaluates a reply by taking into consideration both a groundtruth reply and a query (previous user utterance).
Revised:  In this paper, we propose RUBER, a Referenced metric and Unreferenced metric Blended Evaluation Routine, which evaluates a reply by taking into consideration both a groundtruth reply and a query (previous user-issued utterance).
Edit intent: clarity
Original:  Experiments on both retrieval and generative dialog systems show that RUBER has  high correlation with human annotation.
Revised:  Experiments on both retrieval and generative dialog systems show that RUBER has a high correlation with human annotation.
Edit intent: fluency
Original:  We further apply our strategic model to a special pair of stocks, where the impacts of traded volumes and the cross-impacts of time lag are quantified with empirical data.
Revised:  We further apply our strategic model to a specific pair of stocks, where the impacts of traded volumes and the cross-impacts of time lag are quantified with empirical data.
Edit intent: clarity
Original: We extend the framework of trading strategy for single stocks from Gatheral [2010]  to a pair of stocks.
Revised: We extend the framework of trading strategies of Gatheral [2010] to a pair of stocks.
Edit intent: clarity
Original: We extend the framework of trading strategy for single stocks from Gatheral [2010]  to a pair of stocks.
Revised: We extend the framework of trading strategy for single stocks from Gatheral [2010] from single stocks to a pair of stocks.
Edit intent: fluency
Original:  By minimizing the potential cost arising from cross-impacts, i.e.  the price change of one stock due to the trades of another stock, we can find out an optimal strategy for executing a sequence of trades from different stocks.
Revised:  By minimizing the potential cost arising from cross-impacts, i.e. , the price change of one stock due to the trades of another stock, we can find out an optimal strategy for executing a sequence of trades from different stocks.
Edit intent: fluency
Original:  We further apply our strategic model to a specific pair of stocks, where the impacts of traded volumes and the cross-impacts of time lag are quantified with empirical data  .
Revised:  We further apply the model of the strategy to a specific pair of stocks, where the impacts of traded volumes and the cross-impacts of time lag are quantified with empirical data .
Edit intent: clarity
Original:  We further apply our strategic model to a specific pair of stocks, where the impacts of traded volumes and the cross-impacts of time lag are quantified with empirical data  .
Revised:  We further apply our strategic model to a specific case, where we quantify the cross-impacts of traded volumes and the cross-impacts of time lag are quantified with empirical data .
Edit intent: clarity
Original:  We further apply our strategic model to a specific pair of stocks, where the impacts of traded volumes and the cross-impacts of time lag are quantified with empirical data  .
Revised:  We further apply our strategic model to a specific pair of stocks, where the impacts of traded volumes and of time lag are quantified with empirical data .
Edit intent: clarity
Original:  We further apply our strategic model to a specific pair of stocks, where the impacts of traded volumes and the cross-impacts of time lag are quantified with empirical data  .
Revised:  We further apply our strategic model to a specific pair of stocks, where the impacts of traded volumes and the cross-impacts of time lag with empirical data .
Edit intent: clarity
Original:  We thus provide a view of how the cross-impact influences the trading strategy for a pair of stocks, although the trading strategy is to be improved by containing the cost of self-impact and to be extended to more than two stocks in a portfolio .
Revised:  We thus picture the influence of cross-impacts on the trading strategy is to be improved by containing the cost of self-impact and to be extended to more than two stocks in a portfolio .
Edit intent: clarity
Original:  We thus provide a view of how the cross-impact influences the trading strategy for a pair of stocks, although the trading strategy is to be improved by containing the cost of self-impact and to be extended to more than two stocks in a portfolio .
Revised:  We thus provide a view of how the cross-impact influences the trading strategy for a pair of stocks, although the trading strategy .
Edit intent: coherence
Original: The theoretical basis for the neuronal coding, associated with the short term degradation in synaptic transmission, is matter of debate in the literature.
Revised: The theoretical basis of neuronal coding, associated with the short term degradation in synaptic transmission, is matter of debate in the literature.
Edit intent: fluency
Original:  Thus, considering 1/f-model, as starting point for describing synaptic depletion, we adopt a paradigmatic q-differential equation  obtain a generalized formalism for investigation of nonextensivity in this specific type of synaptic plasticity.
Revised:  Thus, considering 1/f-model, as starting point for describing synaptic depletion, we adopt a paradigmatic q-differential equation to obtain a generalized formalism for investigation of nonextensivity in this specific type of synaptic plasticity.
Edit intent: fluency
Original:  On the other hand, the 1/f-model achieved a satisfatory agreement with data only at lower frequency stimulations.
Revised:  On the other hand, the 1/f-model achieved a satisfactory agreement with data only at lower frequency stimulations.
Edit intent: fluency
Original:  In resume , the present work presents a method to demonstrate that short term depression is ruled by a nonextensive behavior.
Revised:  Thus , the present work presents a method to demonstrate that short term depression is ruled by a nonextensive behavior.
Edit intent: fluency
Original: The theoretical basis of neuronal coding, associated with the short term degradation in synaptic transmission, is  matter of debate in the literature.
Revised: The theoretical basis of neuronal coding, associated with short term degradation in synaptic transmission, is matter of debate in the literature.
Edit intent: fluency
Original: The theoretical basis of neuronal coding, associated with the short term degradation in synaptic transmission, is  matter of debate in the literature.
Revised: The theoretical basis of neuronal coding, associated with the short term degradation in synaptic transmission, is a matter of debate in the literature.
Edit intent: fluency
Original:  In fact, electrophysiological signals are  characterized as inversely proportional to stimulus intensity.
Revised:  In fact, electrophysiological signals are commonly characterized as inversely proportional to stimulus intensity.
Edit intent: clarity
Original:  Among theoretical descriptions for this phenomenon, models based on 1/f-dependency are employed to investigate the biophysical properties of the short term synaptic depression.
Revised:  Among theoretical descriptions of this phenomenon, models based on 1/f-dependency are employed to investigate the biophysical properties of the short term synaptic depression.
Edit intent: fluency
Original:  Thus, considering 1/f-model, as starting point for describing synaptic depletion, we adopt a paradigmatic q-differential equation to obtain a generalized formalism  for investigation of nonextensivity in this specific type of synaptic plasticity.
Revised:  In this work we formulated a model based on a paradigmatic q-differential equation to obtain a generalized formalism for investigation of nonextensivity in this specific type of synaptic plasticity.
Edit intent: clarity
Original:  Thus, considering 1/f-model, as starting point for describing synaptic depletion, we adopt a paradigmatic q-differential equation to obtain a generalized formalism  for investigation of nonextensivity in this specific type of synaptic plasticity.
Revised:  Thus, considering 1/f-model, as starting point for describing synaptic depletion, we adopt a paradigmatic q-differential equation to obtain a generalized formalism useful for investigation of nonextensivity in this specific type of synaptic plasticity.
Edit intent: clarity
Original:  Our analysis reveal nonextensivity in data from electrophysiological recordings , also uncovering a statistical crossover in neurotransmission , which gives additional support to the hypothesis of heterogenous release probability of neurotransmitters.
Revised:  Our analysis reveals nonextensivity in data from electrophysiological recordings , also uncovering a statistical crossover in neurotransmission , which gives additional support to the hypothesis of heterogenous release probability of neurotransmitters.
Edit intent: fluency
Original:  Our analysis reveal nonextensivity in data from electrophysiological recordings , also uncovering a statistical crossover in neurotransmission , which gives additional support to the hypothesis of heterogenous release probability of neurotransmitters.
Revised:  Our analysis reveal nonextensivity in data from electrophysiological recordings and also a statistical crossover in neurotransmission , which gives additional support to the hypothesis of heterogenous release probability of neurotransmitters.
Edit intent: clarity
Original:  Our analysis reveal nonextensivity in data from electrophysiological recordings , also uncovering a statistical crossover in neurotransmission , which gives additional support to the hypothesis of heterogenous release probability of neurotransmitters.
Revised:  Our analysis reveal nonextensivity in data from electrophysiological recordings , also uncovering a statistical crossover in neurotransmission , which gives additional support to the hypothesis of heterogeneous release probability of neurotransmitters.
Edit intent: fluency
Original:  On the other hand, the 1/f-model achieved a satisfactory agreement with data only at lower frequency stimulations.
Revised:  On the other hand, the 1/f-model achieved a satisfactory agreement with data only at low frequency stimulations.
Edit intent: fluency
Original:  Thus, the present work presents a method to demonstrate that short term depression is ruled by a nonextensive behavior.
Revised:  Thus, the present work presents a method to demonstrate that short-term depression is not only governed by random mechanisms but also by a nonextensive behavior.
Edit intent: clarity
Original:  Our findings also better conciliate morphological and electrophysiological investigations in a coherent biophysical scenario.
Revised:  Our findings also conciliate morphological and electrophysiological investigations in a coherent biophysical scenario.
Edit intent: clarity
Original:  Our findings also better conciliate morphological and electrophysiological investigations in a coherent biophysical scenario.
Revised:  Our findings also better conciliate morphological and electrophysiological investigations into a coherent biophysical scenario.
Edit intent: fluency
Original:  We propose a simple strategy for automatically promoting terms with domain relevance and demoting these domain-specific stop words.
Revised:  We propose a simple strategy for automatically promoting terms with domain relevance and demotes domain-specific stop words.
Edit intent: clarity
Original:  Our approachis easily applied within any existing LDA framework and increases the amount of domain-relevant content and reduces the appearance of canonical and human-evaluated stopwords in three very different domains: Department of Labor accident reports, online health forum posts, and NIPS abstracts.
Revised:  We demonstrate this approach's effectiveness in three very different domains: Department of Labor accident reports, online health forum posts, and NIPS abstracts.
Edit intent: clarity
Original: This work proposes a machine-learning-based framework for estimating the error introduced by surrogate models of parameterized dynamical systems  .
Revised: A machine-learning-based framework for estimating the error introduced by surrogate models of parameterized dynamical systems .
Edit intent: clarity
Original: This work proposes a machine-learning-based framework for estimating the error introduced by surrogate models of parameterized dynamical systems  .
Revised: This work proposes a machine-learning-based framework for modeling the error introduced by surrogate models of parameterized dynamical systems .
Edit intent: clarity
Original:  The framework applies high-dimensional regression techniques (e.g., random forests, LASSO) to map a large set of inexpensively-computed ' error indicators' (i.e., features) produced by the surrogate model at a given time instance to a prediction of the surrogate-model error in a quantity of interest (QoI).
Revised:  The framework entails the use of high-dimensional regression techniques (e.g., random forests, LASSO) to map a large set of inexpensively-computed ' error indicators' (i.e., features) produced by the surrogate model at a given time instance to a prediction of the surrogate-model error in a quantity of interest (QoI).
Edit intent: clarity
Original:  The framework applies high-dimensional regression techniques (e.g., random forests, LASSO) to map a large set of inexpensively-computed ' error indicators' (i.e., features) produced by the surrogate model at a given time instance to a prediction of the surrogate-model error in a quantity of interest (QoI).
Revised:  The framework applies high-dimensional regression techniques (e.g., random forests, LASSO) to map a large set of inexpensively computed ` error indicators' (i.e., features) produced by the surrogate model at a given time instance to a prediction of the surrogate-model error in a quantity of interest (QoI).
Edit intent: fluency
Original:  Using these training data, the method first performs feature-space partitioning (via classification or clustering), and subsequently constructs a ' local' regression model to predict the time-instantaneous error within each identified region of feature space.
Revised:  Using these training data, the method first performs feature-space partitioning (via classification or clustering), and subsequently constructs a ` local' regression model to predict the time-instantaneous error within each identified region of feature space.
Edit intent: fluency
Original:  We apply the proposed framework to a nonlinear oil-water problem with time-varying well-control (bottom-hole pressure) parameters, and consider proper orthogonal decomposition applied with trajectory piecewise linearization (POD-TPWL) as the surrogate model .
Revised:  We apply the proposed framework to model errors in reduced-order models of nonlinear oil--water subsurface flow simulations. The reduced-order models used in this work entail application of trajectory piecewise linearization with proper orthogonal decomposition applied with trajectory piecewise linearization (POD-TPWL) as the surrogate model .
Edit intent: clarity
Original:  We apply the proposed framework to a nonlinear oil-water problem with time-varying well-control (bottom-hole pressure) parameters, and consider proper orthogonal decomposition applied with trajectory piecewise linearization (POD-TPWL) as the surrogate model .
Revised:  We apply the proposed framework to a nonlinear oil-water problem with time-varying well-control (bottom-hole pressure) parameters, and consider proper orthogonal decomposition .
Edit intent: clarity
Original:  When the first use of the method is considered, numerical experiments demonstrate that the method consistently improves accuracy in the time-instantaneous QoI prediction relative to the original surrogate model  across a large number of test cases.
Revised:  When the first use of the method is considered, numerical experiments demonstrate consistent improvement in accuracy in the time-instantaneous QoI prediction relative to the original surrogate model across a large number of test cases.
Edit intent: clarity
Original:  When the first use of the method is considered, numerical experiments demonstrate that the method consistently improves accuracy in the time-instantaneous QoI prediction relative to the original surrogate model  across a large number of test cases.
Revised:  When the first use of the method is considered, numerical experiments demonstrate that the method consistently improves accuracy in the time-instantaneous QoI prediction relative to the original surrogate model , across a large number of test cases.
Edit intent: fluency
Original:  When the second use is considered, numerical experiments show that the proposed method generates accurate , unbiased statistical predictions of the time- and well-averaged errors.
Revised:  When the second use is considered, results show that the proposed method generates accurate , unbiased statistical predictions of the time- and well-averaged errors.
Edit intent: clarity
Original:  When the second use is considered, numerical experiments show that the proposed method generates accurate , unbiased statistical predictions of the time- and well-averaged errors.
Revised:  When the second use is considered, numerical experiments show that the proposed method provides accurate statistical predictions of the time- and well-averaged errors.
Edit intent: clarity
Original: We investigate random search processes on complex networks and for the first time derive an exact expression for the partial cover time that quantifies the  time a walker needs to visit multiple targets.
Revised: We investigate multitarget search on complex networks and for the first time derive an exact expression for the partial cover time that quantifies the time a walker needs to visit multiple targets.
Edit intent: clarity