wanyu/IteraTeR_v2 huggingface dataset:
Original:  Using data for a number of historic and contemporary disease outbreaks, we demonstrate that the effective reproduction number for epidemics with early sub-exponential growth exhibits a declining trend that approaches unity over time , in the absence of any interventions, or any other mechanisms diminishing the risk of transmission.
Revised:  Using data for a number of historic and contemporary disease outbreaks, we demonstrate that the effective reproduction number for epidemics characterized by early sub-exponential growth exhibits a declining trend that approaches unity over time , in the absence of any interventions, or any other mechanisms diminishing the risk of transmission.
Edit intent: clarity
Original:  Using data for a number of historic and contemporary disease outbreaks, we demonstrate that the effective reproduction number for epidemics with early sub-exponential growth exhibits a declining trend that approaches unity over time , in the absence of any interventions, or any other mechanisms diminishing the risk of transmission.
Revised:  Using data for a number of historic and contemporary disease outbreaks, we demonstrate that the effective reproduction number for epidemics with early sub-exponential growth exhibits a natural downward trend over time approaching unity, even in the absence of any interventions, or any other mechanisms diminishing the risk of transmission.
Edit intent: clarity
Original:  Using data for a number of historic and contemporary disease outbreaks, we demonstrate that the effective reproduction number for epidemics with early sub-exponential growth exhibits a declining trend that approaches unity over time , in the absence of any interventions, or any other mechanisms diminishing the risk of transmission.
Revised:  Using data for a number of historic and contemporary disease outbreaks, we demonstrate that the effective reproduction number for epidemics with early sub-exponential growth exhibits a declining trend that approaches unity over time , in the absence of control interventions, or any other mechanisms diminishing the risk of transmission.
Edit intent: clarity
Original:  The findings provide a compelling argument for understanding the early extinction of some emerging disease outbreaks with a declining trend in the reproduction number due to initial sub-exponential growth.
Revised:  The findings provide a compelling argument for understanding the early extinction of some emerging disease outbreaks during the early ascending phase of sub-exponential growth.
Edit intent: clarity
Original:  A reliable data-driven characterization of the early epidemic phase is crucial for estimating the reproduction number, forecasting disease dynamics, and informing the most effective public health intervention strategies and timelines for their implementation .
Revised:  A reliable data-driven characterization of the early epidemic phase is crucial for estimating the reproduction number, forecasting disease dynamics, and guiding public health intervention strategies and timelines for their implementation .
Edit intent: clarity
Original:  A reliable data-driven characterization of the early epidemic phase is crucial for estimating the reproduction number, forecasting disease dynamics, and informing the most effective public health intervention strategies and timelines for their implementation .
Revised:  A reliable data-driven characterization of the early epidemic phase is crucial for estimating the reproduction number, forecasting disease dynamics, and informing the most effective public health intervention strategies .
Edit intent: clarity
Original: The reproduction number is a central parameter in epidemiology used to quantify the average number of secondary cases generated by a primary infectious individual during the early epidemic growth phase . Existing methods to estimate the reproduction number generally assume early exponential epidemic growth , but do not account for the possibility of early sub-exponential (i.e., polynomial) growth  .
Revised: Early estimates of the transmission potential of emerging and re-emerging infections are increasingly used to inform public health authorities on the level of risk posed by outbreaks . Existing methods to estimate the reproduction number generally assume early exponential epidemic growth , but do not account for the possibility of early sub-exponential (i.e., polynomial) growth .
Edit intent: clarity
Original:  Here, we introduce a novel method for estimating the reproduction number without making explicit assumptions about the early epidemic growthprofile .
Revised:  Here, we introduce a novel method for estimating the reproduction number without making explicit assumptions about the shape of epidemic growth .
Edit intent: clarity
Original:  We demonstrate our methods using both synthetic and real epidemic datasets.
Revised:  We demonstrate this phenomenologic approach using analytical results and simulations from mechanistic models, and provide validation against a range of empirical disease datasets.
Edit intent: clarity
Original:  Our results indicate that the effective reproduction number for epidemics characterized by early sub-exponential growth exhibits a natural downward trend over time approaching unity, even in the absence of control interventions, or depletion of susceptibles.
Revised:  Our results suggest that sub-exponential growth exhibits a natural downward trend over time approaching unity, even in the absence of control interventions, or depletion of susceptibles.
Edit intent: clarity
Original:  A reliable data-driven characterization of the early epidemic phase is crucial for estimating the reproduction number , forecasting disease dynamics, and guiding public health intervention strategies .
Revised:  A reliable data-driven characterization of the early epidemic phase , which is important for accurate estimation of the reproduction number , forecasting disease dynamics, and guiding public health intervention strategies .
Edit intent: clarity
Original:  A reliable data-driven characterization of the early epidemic phase is crucial for estimating the reproduction number , forecasting disease dynamics, and guiding public health intervention strategies .
Revised:  A reliable data-driven characterization of the early epidemic phase is crucial for estimating the reproduction number and prediction of disease impact .
Edit intent: clarity
Original:  We investigate the CPU requirements of WhatsApp and IMO under different scenarios.
Revised:  We investigate the CPU usage of WhatsApp and IMO under different scenarios.
Edit intent: clarity
Original: We study a parallel service queueing system with servers of types s_1,\ldots,s_J, customers of types c_1,\ldots,c_I, bipartite compatibility graph G, where arc (c_i, s_j)
Revised: We study a parallel queueing system with servers of types s_1,\ldots,s_J, customers of types c_1,\ldots,c_I, bipartite compatibility graph G, where arc (c_i, s_j)
Edit intent: clarity
Original:  indicates that server type s_j can serve customer type c_i, and service policy of firstcome first served FCFS, assign longest idle server ALIS . For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated , in particular the calculation of matching rates r_{c_i,s_j , the fraction of services of customers of typec_i by servers of type s_j , is intractable.
Revised:  indicates that server type s_j can serve customer type c_i, and service policy of firstcome first served FCFS, assign longest idle server ALIS . For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated . In particular, the calculation of matching rates r_{c_i,s_j , the fraction of services of customers of typec_i by servers of type s_j , is intractable.
Edit intent: fluency
Original:  indicates that server type s_j can serve customer type c_i, and service policy of firstcome first served FCFS, assign longest idle server ALIS . For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated , in particular the calculation of matching rates r_{c_i,s_j , the fraction of services of customers of typec_i by servers of type s_j , is intractable.
Revised:  indicates that server type s_j can serve customer type c_i, and service policy of firstcome first served FCFS, assign longest idle server ALIS . For a general renewal stream of arriving customers and general service time distributions, the behavior of such systems is very complicated , in particular the calculation of matching rates r_{c_i,s_j , the fraction of services of customer-server type , is intractable.
Edit intent: clarity
Original:  We suggest through a heuristic argument that if the number of servers becomes large, the matching rates are well approximated by matching rates calculated from the tractable FCFS bipartite infinite matching model.
Revised:  We suggest through a heuristic argument that if the number of servers becomes large, the matching rates are well approximated by matching rates calculated from the tractable bipartite infinite matching model.
Edit intent: clarity
Original:  We present simulation evidence to support this heuristic argument, and show how this can be used to design systems for given performance requirements.
Revised:  We present simulation evidence to support this heuristic argument, and show how this can be used to design systems with desired performance requirements.
Edit intent: clarity
Original:  Especially, in heterogeneous networks, if the vaccination cost is low  the behavior is more promoted than the case without social impact.
Revised:  Especially, in heterogeneous networks, if the vaccination cost is low , the behavior is more promoted than the case without social impact.
Edit intent: fluency
Original: We present a randomized misfit approach as a data reduction method for large-scale inverse problems via a novel randomization of the objective function.
Revised: A randomized misfit approach as a data reduction method for large-scale inverse problems via a novel randomization of the objective function.
Edit intent: coherence
Original: We present a randomized misfit approach as a data reduction method for large-scale inverse problems via a novel randomization of the objective function.
Revised: We present a randomized misfit approach is presented for the efficient solution of large-scale inverse problems via a novel randomization of the objective function.
Edit intent: clarity
Original:  The purpose of this paper is to develop a systematic framework for the application of random projections in the context of ill-posed inverse problems with large data sets and give theoretical insight into the efficacy.
Revised:  The purpose of this paper is to offer a theory-based framework for random projections in the context of ill-posed inverse problems with large data sets and give theoretical insight into the efficacy.
Edit intent: clarity
Original:  Numerical verification of theoretical findings are presented for model problems of estimating a distributed parameter in an elliptic partial differential equation.
Revised:  Numerical verification of the developed theory is presented for model problems of estimating a distributed parameter in an elliptic partial differential equation.
Edit intent: clarity
Original: Leadership is an important aspect of social organization that affects the processes of group formation, coordination , and decision-making in human societies , as well as in the social system of many other animal species.
Revised: Leadership is an important aspect of social organization that affects the processes of group formation, dynamics , and decision-making in human societies , as well as in the social system of many other animal species.
Edit intent: clarity
Original: Leadership is an important aspect of social organization that affects the processes of group formation, coordination , and decision-making in human societies , as well as in the social system of many other animal species.
Revised: Leadership is an important aspect of social organization that affects the processes of group formation, coordination , and decision-making in human societies and other social animal species.
Edit intent: clarity
Original:  In this paper, we propose a simple yet powerful leadership inference framework extracting group coordination periods and determining leadership based on the activity of individuals within a group .
Revised:  In this paper, we propose a simple yet powerful framework for extracting periods of coordinated activity and determining individuals who initiated this coordination, based solely on the activity of individuals within a group .
Edit intent: clarity
Original:  The proposed approach automatically (1) identifies periods of coordinated group activity, (2) determines the identities of leaders , and (3) classifies the likely mechanism by which the group coordination occurred  .
Revised:  The proposed approach automatically (1) identifies times of coordinated group activity, (2) determines the identities of leaders , and (3) classifies the likely mechanism by which the group coordination occurred .
Edit intent: clarity
Original:  The proposed approach automatically (1) identifies periods of coordinated group activity, (2) determines the identities of leaders , and (3) classifies the likely mechanism by which the group coordination occurred  .
Revised:  The proposed approach automatically (1) identifies periods of coordinated group activity, (2) determines the identities of initiators of those activities , and (3) classifies the likely mechanism by which the group coordination occurred .
Edit intent: clarity
Original:  We demonstrate our framework on both simulated and real-world data: GPS tracks of a baboon troop and video-tracking of fish schools, as well as stock market closing price dataof the NASDAQ index.
Revised:  We demonstrate our framework on both simulated and real-world data: trajectories tracking of animals as well as stock market closing price dataof the NASDAQ index.
Edit intent: clarity
Original:  Our approach is easily generalizable to any coordinated activity data from interacting entities.
Revised:  Our method is easily generalizable to any coordinated activity data from interacting entities.
Edit intent: clarity
Original:  Our approach is easily generalizable to any coordinated activity data from interacting entities.
Revised:  Our approach is easily generalizable to any coordinated time-series data from interacting entities.
Edit intent: clarity
Original: The generation of reversible circuits from high-level code is in important problem in several application domains, including low-power electronics and quantum computing.
Revised: The generation of reversible circuits from high-level code is an important problem in several application domains, including low-power electronics and quantum computing.
Edit intent: fluency
Original: Dynamical structural correlationsare essential for proteins to realize allostery.
Revised: Protein allostery requires dynamical structural correlations. Physical origin of which, however, remain elusive despite intensive studies during last two decades.
Edit intent: coherence
Original: One of the foremost challenges in modulation scheme for molecular communication is positivity of the transmission signal (only a positive concentration of molecules can be released in the environment).
Revised: An important challenge in design of modulation schemes for molecular communication is positivity of the transmission signal (only a positive concentration of molecules can be released in the environment).
Edit intent: clarity
Original:  For deterministic dynamics, neural networks of randomly coupled units display a transition to chaos at a critical coupling strength.
Revised:  For deterministic dynamics, randomly coupled neural networks display a transition to chaos at a critical coupling strength.
Edit intent: clarity
Original:  Here, we investigate the effect of additive white noise on the transition .
Revised:  Here, we investigate the effect of additive white noise on the onset of chaos .
Edit intent: clarity
Original:  A closed form expression determines the transition from the regular to the chaotic regime .
Revised:  A closed form expression determines the transition from stable to chaotic dynamics .
Edit intent: clarity
Original:  The decay time of the autocorrelation function does not diverge at the transition, but peaks slightly above the critical coupling strength.
Revised:  A regime emerges, where expansive dynamics and stable long-term behavior coexist. Furthermore, the time scale of the temporal correlations does not diverge at the transition, but peaks slightly above the critical coupling strength.
Edit intent: clarity
Original:  Here, we investigate the effect of additive white noise on the onset of chaos .
Revised:  We here investigate the effect of additive white noise on the onset of chaos .
Edit intent: clarity
Original:  Here, we investigate the effect of additive white noise on the onset of chaos .
Revised:  Here, we investigate the effect of a time-varying input on the onset of chaos .
Edit intent: clarity
Original:  We develop the dynamical mean-field theory yielding the statistics of the activity and the maximum Lyapunov exponent .
Revised:  We develop the dynamical mean-field theory yields the statistics of the activity and the maximum Lyapunov exponent .
Edit intent: fluency
Original:  We develop the dynamical mean-field theory yielding the statistics of the activity and the maximum Lyapunov exponent .
Revised:  We develop the dynamical mean-field theory yielding the statistics of the activity , the maximum Lyapunov exponent .
Edit intent: coherence
Original: This paper studies a cooperative card game called Hanabi from an algorithmic combinatorial game theory viewpoint.
Revised: In this paper we study a cooperative card game called Hanabi from an algorithmic combinatorial game theory viewpoint.
Edit intent: fluency
Original: This paper studies a cooperative card game called Hanabi from an algorithmic combinatorial game theory viewpoint.
Revised: This paper studies a cooperative card game called Hanabi from the viewpoint of algorithmic combinatorial game theory viewpoint.
Edit intent: clarity
Original:  Drawn cards are either immediately played, discarded or stored for future use (overall each player can store up to h cards ) . We introduce a simplified mathematical model of a single-player version of the game, and show several complexity results: the game is intractable in a general setting, but becomes tractable (and even linear) in some interesting restricted cases (i. e., for small values of h and c) .
Revised:  Drawn cards are either immediately played, discarded or stored for future use (overall each player can store up to h cards ) . We introduce a single-player version of the game, and show several complexity results: the game is intractable in a general setting, but becomes tractable (and even linear) in some interesting restricted cases (i. e., for small values of h and c) .
Edit intent: clarity
Original:  Drawn cards are either immediately played, discarded or stored for future use (overall each player can store up to h cards ) . We introduce a simplified mathematical model of a single-player version of the game, and show several complexity results: the game is intractable in a general setting, but becomes tractable (and even linear) in some interesting restricted cases (i. e., for small values of h and c) .
Revised:  Drawn cards are either immediately played, discarded or stored for future use (overall each player can store up to h cards ) . We introduce a simplified mathematical model of a single-player , perfect-information model and show that the game is intractable in a general setting, but becomes tractable (and even linear) in some interesting restricted cases (i. e., for small values of h and c) .
Edit intent: clarity
Original: This paper presents a novel latent variable recurrent neural network architecture for jointly modeling sequences of words and (possibly latent) discourse relations that link adjacent sentences.
Revised: This paper presents a novel latent variable recurrent neural network architecture for jointly modeling sequences of words and (possibly latent) discourse relations between adjacent sentences.
Edit intent: clarity
Original:  The resulting model  outperforms state-of-the-art alternatives for  implicit discourse relation classification in the Penn Discourse Treebank, and for dialog act classification in the Switchboard corpus.
Revised:  The resulting model outperforms state-of-the-art alternatives for implicit discourse relation classification in the Penn Discourse Treebank, and dialog act classification in the Switchboard corpus.
Edit intent: fluency
Original:  By marginalizing over latent discourse relations , it also yields a language model that improves on a strong recurrent neural network baseline.
Revised:  Furthermore, by marginalizing over latent discourse relations , it also yields a language model that improves on a strong recurrent neural network baseline.
Edit intent: coherence
Original:  By marginalizing over latent discourse relations , it also yields a language model that improves on a strong recurrent neural network baseline.
Revised:  By marginalizing over latent discourse relations at test time, we obtain a discourse informed language model, which improves over a strong LSTM baseline.
Edit intent: clarity
Original: Given  a positive integer k and a directed graph with real edge cost , the negative k-cycle problem (kNCP) is to determine whether there exists a negative  cycle with at least k edges .
Revised: Given a positive integer k and a directed graph with a length and a cost on each edge, k is to determine whether there exists a negative cycle with at least k edges .
Edit intent: clarity
Original: Given  a positive integer k and a directed graph with real edge cost , the negative k-cycle problem (kNCP) is to determine whether there exists a negative  cycle with at least k edges .
Revised: Given a positive integer k and a directed graph with real edge cost , the negative k-cycle problem (kNCP) is to determine whether there exists a negative cost cycle with at least k edges .
Edit intent: fluency
Original:  This paper proves the%DIFDELCMD < {\cal %%% NP -completeness of kNCP for any fixed k%DIFDELCMD < \geq3 %%% by giving aFPkLNCC is {\cal  \emph{ }\emph{  \emph{ \emph{  reduction from the 3 occurrence 3-Satisfiability (\emph{3O3SAT}) problem . Compared to the fact that the negative cycle detection problem is polynomial solvable and the k-cycle problem is fixed-parameter tractable with respect to k, the hardness result for kNCP seems interesting\emph{ \emph{  }\hspace{0pt} whether k}\emph{  .
Revised:  This paper %DIFDELCMD < {\cal %%% NP -completeness of kNCP for any fixed k%DIFDELCMD < \geq3 %%% by giving aFPkLNCC is {\cal \emph{ }\emph{ \emph{ \emph{ reduction from the 3 occurrence 3-Satisfiability (\emph{3O3SAT}) problem . Compared to the fact that the negative cycle detection problem is polynomial solvable and the k-cycle problem is fixed-parameter tractable with respect to k, the hardness result for kNCP seems interesting\emph{ \emph{ }\hspace{0pt} whether k}\emph{ .
Edit intent: coherence