wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this paper we consider applying knowledge distillation approaches (Bucila et al  , 2006;
Revised:  In this paper we consider applying knowledge distillation approaches (Bucila et al . , 2006;
Edit intent: fluency
Original:  Our best student model runs 10 times faster than its state-of-the-art teacher with only a decrease of 0.2 BLEU .
Revised:  Our best student model runs 10 times faster than its state-of-the-art teacher with little loss in performance .
Edit intent: clarity
Original:  The absence of complete information about the time evolution of an epidemic gives rise to a complicated latent variable problem in which the state space size of the unobserved epidemic grows large as the population size increases.
Revised:  The absence of complete information about the time evolution of an epidemic gives rise to a complicated latent variable problem in which the state space size of the epidemic grows large as the population size increases.
Edit intent: clarity
Original:  We present a data-augmentation Markov chain Monte Carlo (MCMC) framework for Bayesian estimation of stochastic epidemic model parameters, in which measurements are augmented with subject-level trajectories .
Revised:  We present a data augmentation Markov chain Monte Carlo (MCMC) framework for Bayesian estimation of stochastic epidemic model parameters, in which measurements are augmented with subject-level trajectories .
Edit intent: fluency
Original:  We present a data-augmentation Markov chain Monte Carlo (MCMC) framework for Bayesian estimation of stochastic epidemic model parameters, in which measurements are augmented with subject-level trajectories .
Revised:  We present a data-augmentation Markov chain Monte Carlo (MCMC) framework for Bayesian estimation of stochastic epidemic model parameters, in which measurements are augmented with subject-level disease histories .
Edit intent: clarity
Original:  This board interlock leads to the emergence of an elite group with privileged network positions.
Revised:  This board interlocking leads to the emergence of an elite group with privileged network positions.
Edit intent: fluency
Original:  While the presence of government officials on non-profit boards is widespread, state officials are much less common in a subgroup of foundations that control just over half of all revenue in the network.
Revised:  While the presence of government officials on non-profit boards is widespread, government officials are much less common in a subgroup of foundations that control just over half of all revenue in the network.
Edit intent: clarity
Original:  This subgroup, associated with business elites, not only enjoys higher levels of within-elite links, but even preferentially excludes government officials from the nodes with higher degree.
Revised:  This subgroup, associated with business elites, not only enjoys higher levels of within-elite links, but even preferentially excludes government officials from the NGOs with higher degree.
Edit intent: clarity
Original: We propose a framework for  visualization of directed networks relying on the eigenfunctions of the magnetic Laplacian, called here Magnetic Eigenmaps.
Revised: We propose a framework for the visualization of directed networks relying on the eigenfunctions of the magnetic Laplacian, called here Magnetic Eigenmaps.
Edit intent: fluency
Original:  Illustrations of our method are given for both artificial and real-life networks.
Revised:  Illustrations of our method are given for both artificial and real networks.
Edit intent: clarity
Original:  Additionally, we show that an out-of- sample extension framework based on the proposed algorithm outperforms the state of the art in eye-gaze estimation.
Revised:  Additionally, we show that an out-of-sample extension framework based on the proposed algorithm outperforms the state of the art in eye-gaze estimation.
Edit intent: fluency
Original:  These results underscore the crucial quantitative importance of spatio-temporal correlations in binary reaction kinetics in SPR cell geometries, and demonstrate the failure of a mean-field analysis of SPR cells in the regime of high association rates , where the spatio-temporal correlations due to diffusive transport and ligand-receptor rebinding events dominate the dynamics of SPR system .
Revised:  These results underscore the crucial quantitative importance of spatio-temporal correlations in binary reaction kinetics in SPR cell geometries, and demonstrate the failure of a mean-field analysis of SPR cells in the regime of high association rates , where the spatio-temporal correlations due to diffusive transport and ligand-receptor rebinding events dominate the dynamics of SPR systems .
Edit intent: fluency
Original:  We investigate true lies and other types of interaction between announced formulas, their preconditions and their postconditions, in the setting  Gerbrandy's logic of believed announcements, wherein agents may have or obtain incorrect beliefs.
Revised:  We investigate true lies and other types of interaction between announced formulas, their preconditions and their postconditions, in the setting of Gerbrandy's logic of believed announcements, wherein agents may have or obtain incorrect beliefs.
Edit intent: fluency
Original: We consider interior penalty discontinuous Galerkin finite element  (dGFEM) method for variable coefficient diffusion-convection-reaction equation to discretize the Heston PDE for the numerical pricing of European options.
Revised: We apply interior penalty discontinuous Galerkin finite element (dGFEM) method for variable coefficient diffusion-convection-reaction equation to discretize the Heston PDE for the numerical pricing of European options.
Edit intent: coherence
Original: We consider interior penalty discontinuous Galerkin finite element  (dGFEM) method for variable coefficient diffusion-convection-reaction equation to discretize the Heston PDE for the numerical pricing of European options.
Revised: We consider interior penalty discontinuous Galerkin finite element method (dGFEM) method for variable coefficient diffusion-convection-reaction equation to discretize the Heston PDE for the numerical pricing of European options.
Edit intent: fluency
Original: We consider interior penalty discontinuous Galerkin finite element  (dGFEM) method for variable coefficient diffusion-convection-reaction equation to discretize the Heston PDE for the numerical pricing of European options.
Revised: We consider interior penalty discontinuous Galerkin finite element (dGFEM) for pricing of European options.
Edit intent: coherence
Original:  The advantages of dGFEM space discretization and Crank-Nicolson method with Rannacher smoothing as time integrator for Heston model with non-smooth initial and boundary conditions are illustrated in several numerical examples for European call, butterfly spread and digital options.
Revised:  The advantages of dGFEM space discretization with Rannacher smoothing as time integrator for Heston model with non-smooth initial and boundary conditions are illustrated in several numerical examples for European call, butterfly spread and digital options.
Edit intent: coherence
Original:  The advantages of dGFEM space discretization and Crank-Nicolson method with Rannacher smoothing as time integrator for Heston model with non-smooth initial and boundary conditions are illustrated in several numerical examples for European call, butterfly spread and digital options.
Revised:  The advantages of dGFEM space discretization and Crank-Nicolson method with Rannacher smoothing as time integrator with non-smooth initial and boundary conditions are illustrated in several numerical examples for European call, butterfly spread and digital options.
Edit intent: clarity
Original:   Numerical experiments illustrate that dGFEM is highly accurate and very efficient for pricing financial options.
Revised:  Numerical experiments illustrate that dGFEM is an accurate and efficient method for pricing options.
Edit intent: clarity
Original: We apply interior penalty discontinuous Galerkin finite element method (dGFEM) for pricing of European and American options for Heston PDE .
Revised: We apply interior penalty discontinuous Galerkin finite element method (dGFEM) .
Edit intent: clarity
Original:  The advantages of dGFEM space discretization with Rannacher smoothing as time integrator with non-smooth initial and boundary conditions are illustrated in several numerical examples for European call, as well as butterfly spread, digital call and American put options.
Revised:  The advantages of dGFEM space discretization with Rannacher smoothing as time integrator with nonsmooth initial and boundary conditions are illustrated in several numerical examples for European call, as well as butterfly spread, digital call and American put options.
Edit intent: fluency
Original:  The convection dominated Heston PDE for vanishing volatility is efficiently solved utilizing the adaptive dGFEM algorithm.
Revised:  The convection dominated Heston model for vanishing volatility is efficiently solved utilizing the adaptive dGFEM algorithm.
Edit intent: clarity
Original:  The linear complementary problem for the American option is solved using the norm preconditioned projected successive over relaxation (PSOR) method .
Revised:  The linear complementary problem of the American options, a projected successive over relaxation (PSOR) method .
Edit intent: clarity
Original: We analyze some enumerative and asymptotic properties of lattice paths below a line of rational slope.
Revised: We analyse some enumerative and asymptotic properties of lattice paths below a line of rational slope.
Edit intent: fluency
Original:  This answers Knuth's problem \# 4 from his "Flajolet lecture" during the conference "Analysis of Algorithms" (AofA'2014) in Paris in June 2014.
Revised:  This answers Knuth's problem 4 from his "Flajolet lecture" during the conference "Analysis of Algorithms" (AofA'2014) in Paris in June 2014.
Edit intent: clarity
Original:  An interesting case are e.g.
Revised:  An interesting case is e.g.
Edit intent: fluency
Original:  Dyck paths below the slope 2/3 (this corresponds to the so called Duchon's club model), for which we solve a conjecture related to the asymptotics of the area below such lattice paths.
Revised:  Dyck paths below the slope 2/3 (this corresponds to the so-called Duchon's club model), for which we solve a conjecture related to the asymptotics of the area below such lattice paths.
Edit intent: fluency
Original: Although viral spreading processes taking place in networks are commonly analyzed using Markovian models in which both the transmission times and the recovery times follow exponential distributions, empirical studies show that, in most real scenarios, the distribution of these times are far from exponential.
Revised: Although viral spreading processes taking place in networks are commonly analyzed using Markovian models in which both the transmission and the recovery times follow exponential distributions, empirical studies show that, in most real scenarios, the distribution of these times are far from exponential.
Edit intent: fluency
Original:  To overcome this limitation, we first introduce a generalized spreading model that allows for transmission and recovery times to follow arbitrary distributions within an arbitrary accuracy.
Revised:  To overcome this limitation, we first introduce a generalized spreading model that allows transmission and recovery times to follow arbitrary distributions within an arbitrary accuracy.
Edit intent: fluency
Original:  To overcome this limitation, we first introduce a generalized spreading model that allows for transmission and recovery times to follow arbitrary distributions within an arbitrary accuracy.
Revised:  To overcome this limitation, we first introduce a generalized spreading model that allows for transmission and recovery times to follow arbitrary distributions within a given accuracy.
Edit intent: clarity
Original:  Based on our results, we illustrate how the particular shape of the transmission/recovery distribution heavily influences the boundary of the stability region of the spread, as well as the decay rateinside this region .
Revised:  Based on our results, we illustrate how the particular shape of the transmission/recovery distribution heavily influences the convergence rate .
Edit intent: clarity
Original:  Therefore, modeling non-exponential transmission/recovery times observed in realistic spreading processes via exponential distributions can induce significant errors in the stability analysis of the  dynamics.
Revised:  Therefore, modeling non-exponential transmission/recovery times observed in realistic spreading processes via exponential distributions can induce significant errors in the stability analysis of the spreading dynamics.
Edit intent: fluency
Original: Although viral spreading processes taking place in networks are commonly analyzed using Markovian models in which both the transmission and the recovery times follow exponential distributions, empirical studies show that, in most real scenarios, the distribution of these times are far from exponential.
Revised: Although viral spreading processes taking place in networks are often analyzed using Markovian models in which both the transmission and the recovery times follow exponential distributions, empirical studies show that, in most real scenarios, the distribution of these times are far from exponential.
Edit intent: clarity
Original: Although viral spreading processes taking place in networks are commonly analyzed using Markovian models in which both the transmission and the recovery times follow exponential distributions, empirical studies show that, in most real scenarios, the distribution of these times are far from exponential.
Revised: Although viral spreading processes taking place in networks are commonly analyzed using Markovian models in which both the transmission and the recovery times follow exponential distributions, empirical studies show that, in many real scenarios, the distribution of these times are far from exponential.
Edit intent: clarity
Original: Although viral spreading processes taking place in networks are commonly analyzed using Markovian models in which both the transmission and the recovery times follow exponential distributions, empirical studies show that, in most real scenarios, the distribution of these times are far from exponential.
Revised: Although viral spreading processes taking place in networks are commonly analyzed using Markovian models in which both the transmission and the recovery times follow exponential distributions, empirical studies show that, in most real scenarios, the distribution of these times are not necessarily exponential.
Edit intent: clarity
Original:  In this context, we derive conditions for the generalized spreading model to converge exponentially fast towards the infection-free equilibrium with a given rate (in other words, to eradicate the viral spread) without relying on mean-field approximations.
Revised:  In this context, we derive a lower bound on the exponential decay rate towards the infection-free equilibrium with a given rate (in other words, to eradicate the viral spread) without relying on mean-field approximations.
Edit intent: clarity
Original:  In this context, we derive conditions for the generalized spreading model to converge exponentially fast towards the infection-free equilibrium with a given rate (in other words, to eradicate the viral spread) without relying on mean-field approximations.
Revised:  In this context, we derive conditions for the generalized spreading model to converge exponentially fast towards the infection-free equilibrium of the spreading model without relying on mean-field approximations.
Edit intent: clarity
Original: We consider the model of parametrized asynchronous shared-memory pushdown systems, as introduced by Hague  .
Revised: We consider the model of parametrized asynchronous shared-memory pushdown systems, as introduced in .
Edit intent: clarity
Original:  In a series of recent papers it has been shown that reachability in this model is PSPACE-complete [ Hague'11 Esparza, Ganty, Majumdar'13] and that liveness is decidable in NEXPTIME [Durand-Gasselin, Esparza, Ganty, Majumdar'15].
Revised:  In a series of recent papers it has been shown that reachability in this model is PSPACE-complete [ Esparza, Ganty, Majumdar'13] and that liveness is decidable in NEXPTIME [Durand-Gasselin, Esparza, Ganty, Majumdar'15].
Edit intent: coherence
Original:  Finally, using these results, we prove that the verification of regular properties of traces  , satisfying some stuttering closure , is also NEXPTIME-complete in this model.
Revised:  Finally, using these results, we prove that the verifying regular properties of traces , satisfying some stuttering closure , is also NEXPTIME-complete in this model.
Edit intent: clarity
Original:  Finally, using these results, we prove that the verification of regular properties of traces  , satisfying some stuttering closure , is also NEXPTIME-complete in this model.
Revised:  Finally, using these results, we prove that the verification of regular properties of traces , satisfying some stuttering condition , is also NEXPTIME-complete in this model.
Edit intent: clarity
Original: The proper sorting of membrane components by regulated exchange between cellular organelles is crucial to intra-cellular organization .
Revised: The proper sorting of membrane components by regulated exchange between cellular organelles is crucial to intra-cellular organisation .
Edit intent: fluency
Original:  Low ratio values leads to fast sorting, but results in a broad size distribution of sorted compartments dominated by small entities.
Revised:  Low ratio values lead to fast sorting, but results in a broad size distribution of sorted compartments dominated by small entities.
Edit intent: fluency
Original:  Our results suggests an optimal balance between vesicle budding and fusion for the rapid and efficient sorting of membrane components, and highlight the importance of stochastic effects for the steady-state organization of intra-cellular compartments.
Revised:  Our results suggest an optimal balance between vesicle budding and fusion for the rapid and efficient sorting of membrane components, and highlight the importance of stochastic effects for the steady-state organization of intra-cellular compartments.
Edit intent: fluency
Original:  Our results suggests an optimal balance between vesicle budding and fusion for the rapid and efficient sorting of membrane components, and highlight the importance of stochastic effects for the steady-state organization of intra-cellular compartments.
Revised:  Our results suggests an optimal balance between vesicle budding and fusion for the rapid and efficient sorting of membrane components, and highlight the importance of stochastic effects for the steady-state organisation of intra-cellular compartments.
Edit intent: fluency
Original:  This study looks specifically at the effect degree-correlation has on the efficiency of several immunization strategies in scale-free networks.
Revised:  This study looks specifically at the effect degree-correlation has on robustness and vulnerability in scale-free networks.
Edit intent: clarity
Original:  Importantly , we found that in networks with positive degree correlation, immunization strategies that utilize knowledge of initial popularity actually perform worse on average than random immunization strategies .
Revised:  Importantly , we found that networks with positive degree correlation, immunization strategies that utilize knowledge of initial popularity actually perform worse on average than random immunization strategies .
Edit intent: clarity
Original: Defined on Birman--Ko--Lee monoids, the rotating normal form has strong connections with the Dehornoy's braid ordering.
Revised: Defined on Birman-Ko-Lee monoids, the rotating normal form has strong connections with the Dehornoy's braid ordering.
Edit intent: fluency
Original:  It can be seen as a process for selecting between all the representative words of a Birman--Ko--Lee braid a particular one, called rotating word.
Revised:  It can be seen as a process for selecting between all the representative words of a Birman-Ko-Lee braid a particular one, called rotating word.
Edit intent: fluency
Original:  In this paper we construct, for all n 1, a finite state automata which recognize the rotating words on n strands.
Revised:  In this paper we construct, for all n 1, a finite state automaton which recognizes the rotating words on n strands.
Edit intent: clarity
Original:  In this paper we construct, for all n \textgreater{ automaton which recognizes the rotating words on n strands  .
Revised:  In this paper we construct, for all n \textgreater{ automaton which recognizes rotating words on n strands .
Edit intent: fluency
Original:  We retrieve scaling laws for growth rate fluctuations and time response with respect to the distance from the maximum growth rate suggesting that suboptimal populations can be faster in maintaining homeostasis .
Revised:  We retrieve scaling laws for growth rate fluctuations and time response with respect to the distance from the maximum growth rate suggesting that suboptimal populations can have a faster response to perturbations .
Edit intent: clarity
Original: In the last decade  network science has shed new light on the anatomical connectivity and on correlations in the activity of different areas of the human brain.
Revised: In the last decade , network science has shed new light on the anatomical connectivity and on correlations in the activity of different areas of the human brain.
Edit intent: fluency
Original: In the last decade  network science has shed new light on the anatomical connectivity and on correlations in the activity of different areas of the human brain.
Revised: In the last decade network science has shed new light both on the structural (anatomical) and on the functional ( correlations in the activity of different areas of the human brain.
Edit intent: clarity
Original: In the last decade  network science has shed new light on the anatomical connectivity and on correlations in the activity of different areas of the human brain.
Revised: In the last decade network science has shed new light on the anatomical connectivity and on correlations in the activity ) connectivity among the different areas of the human brain.
Edit intent: clarity
Original:  The study of brain networks has made possible in fact to detect the central areas of a neural system, and to identify its building blocks by looking at overabundant small subgraphs, known as motifs.
Revised:  The analysis of brain networks has made possible in fact to detect the central areas of a neural system, and to identify its building blocks by looking at overabundant small subgraphs, known as motifs.
Edit intent: clarity
Original:  The study of brain networks has made possible in fact to detect the central areas of a neural system, and to identify its building blocks by looking at overabundant small subgraphs, known as motifs.
Revised:  The study of brain networks has made possible to detect the central areas of a neural system, and to identify its building blocks by looking at overabundant small subgraphs, known as motifs.
Edit intent: coherence
Original:  The recently developed mathematical framework of multi-layer networks allows to perform a multiplex analysis of the human brain where the structural and functional layers are considered at the same time .
Revised:  The recently developed mathematical framework of multi-layer networks allows to perform an analysis of the human brain where the structural and functional layers are considered at the same time .
Edit intent: clarity
Original:  The recently developed mathematical framework of multi-layer networks allows to perform a multiplex analysis of the human brain where the structural and functional layers are considered at the same time .
Revised:  The recently developed mathematical framework of multi-layer networks allows to perform a multiplex analysis of the human brain where the structural and functional layers are considered together .
Edit intent: clarity