wanyu/IteraTeR_v2 huggingface dataset:
Original: The so-called great divergence in the income per capita is described in the Unified Growth Theory as one of the mind-boggling and unresolved mysteries about the growth process.
Revised: The so-called great divergence in the income per capita is described in the Unified Growth Theory as one of the mind-boggling and unresolved mystery about the growth process.
Edit intent: fluency
Original:  Unified Growth Theory is not only scientifically unacceptablebut also potentially dangerous because by promoting erroneous conceptsit diverts attention from the urgent need to control the fast-increasing growth of income per capita .
Revised:  Unified Growth Theory is shown yet again to be incorrect and scientifically unacceptable. It promotes incorrect and even potentially dangerous concepts .
Edit intent: clarity
Original:  In this paper, we propose a generic inverted index  on the GPU (called GENIE), which can support similarity search of multiple queries on various data types.
Revised:  In this paper, we propose a generic inverted index framework on the GPU (called GENIE), which can support similarity search of multiple queries on various data types.
Edit intent: clarity
Original:  In this paper, we propose a generic inverted index  on the GPU (called GENIE), which can support similarity search of multiple queries on various data types.
Revised:  In this paper, we propose a generic inverted index on the GPU (called GENIE), which can support similarity search of different data types.
Edit intent: clarity
Original: Mapping the connectome through non-invasive imaging tools allows to study the wiring diagram of the brain in-vivo.
Revised: In many biological systems, the network of interactions between the elements can only be inferred from experimental measurements. In neuroscience, non-invasive imaging tools allows to study the wiring diagram of the brain in-vivo.
Edit intent: clarity
Original:  The informative value of the resulting brain network depends on how much of the estimated connectivity is retained.
Revised:  The informative value of the resulting network depend on how much of the estimated connectivity is retained.
Edit intent: clarity
Original:  We present a method , the efficiency cost optimization (ECO), to filter connectivity based on the optimization of the trade-off between the efficiency of a network and its wiring cost.
Revised:  We present a method , the efficiency cost optimization (ECO), to select a threshold based on the optimization of the trade-off between the efficiency of a network and its wiring cost.
Edit intent: clarity
Original:  As a result, we find an optimal connection density threshold that emphasizes the intrinsic properties of a given network, while preserving its sparsity.
Revised:  We prove analytically and we confirm through numerical simulations that the connection density maximizing this trade-off emphasizes the intrinsic properties of a given network, while preserving its sparsity.
Edit intent: clarity
Original:  Such threshold can be determined a-priori, since the number of connections to retain only depends on the network size  .
Revised:  Such threshold can be determined a-priori, since the number of connections to filter only depends on the network size .
Edit intent: clarity
Original:  Cascading information transmissions --- phone calls, text messages, social media posts --- may be understood as a realization of a diffusion process operating on the network, and its branching path can be represented by a directed tree.
Revised:  Cascading information transmissions (e.g. phone calls, text messages, social media posts --- may be understood as a realization of a diffusion process operating on the network, and its branching path can be represented by a directed tree.
Edit intent: coherence
Original:  Cascading information transmissions --- phone calls, text messages, social media posts --- may be understood as a realization of a diffusion process operating on the network, and its branching path can be represented by a directed tree.
Revised:  Cascading information transmissions --- phone calls, text messages, social media posts ) may be understood as a realization of a diffusion process operating on the network, and its branching path can be represented by a directed tree.
Edit intent: fluency
Original:  In this paper, we focus on the network reconstruction problem for a broad class of real-world diffusion processes, exemplified by a network diffusion scheme called respondent-driven sampling (RDS) that is widely used in epidemiology .
Revised:  In this paper, we focus on the network reconstruction problem for a broad class of real-world diffusion processes, exemplified by a network diffusion scheme called respondent-driven sampling (RDS) .
Edit intent: clarity
Original:  We prove that under a reasonable model of network diffusion, the likelihood of an observed RDS realization is a Bayesian log-submodular model.
Revised:  We prove that under a reasonable model of network diffusion, the posterior distribution of an observed RDS realization is a Bayesian log-submodular model.
Edit intent: clarity
Original: We propose a novel, accurate, and computationally efficient variational inference algorithm  for the network reconstruction problem under this model.
Revised: We propose a novel, accurate, and computationally efficient variational inference algorithm , for the network reconstruction problem under this model.
Edit intent: fluency
Original: Mainstream object-oriented programming (OOP) languages such as Java, C#, C++ and Scala are all almost entirely nominally-typed.
Revised: Mainstream object-oriented programming languages such as Java, C#, C++ and Scala are all almost entirely nominally-typed.
Edit intent: clarity
Original:  NOOP is a recently developed domain-theoretic model of OOP that was designed to fully include nominal information found in nominally-typed OOP.
Revised:  NOOP is a recently developed domain-theoretic model of OOP that was designed to include full nominal information found in nominally-typed OOP.
Edit intent: fluency
Original:  The comparison provides a mathematical account for the relation between nominal and structural OO languages and nominal and structural OO type systems.
Revised:  The comparison provides a mathematical account for the relation between nominal and structural OO type systems.
Edit intent: clarity
Original:  Specifically, we are able to obtain new strong bounds on the round complexity of the weak symmetry breaking task , which were previously conjectured by the author .
Revised:  Specifically, we are able to obtain new strong bounds on the round complexity of the weak symmetry breaking task .
Edit intent: clarity
Original: In this paper we show that all binomial identities are orderable.
Revised: The main result of this paper is to show that all binomial identities are orderable.
Edit intent: clarity
Original:  This is a natural statement from the combinatorial theory of finite sets which additionally has applications in distributed computing .
Revised:  This is a natural statement in the combinatorial theory of finite sets which additionally has applications in distributed computing .
Edit intent: fluency
Original:  This is a natural statement from the combinatorial theory of finite sets which additionally has applications in distributed computing .
Revised:  This is a natural statement from the combinatorial theory of finite sets , which can also be applied in distributed computing .
Edit intent: clarity
Original: We present an experimental setup and procedure for benchmarking numerical optimization algorithms in a black-box scenario.
Revised: We present an experimental setup and procedure for benchmarking numericaloptimization algorithms in a black-box scenario.
Edit intent: fluency
Original:  We describe initialization of and input to the algorithm and touch upon the relevance of termination and restarts .
Revised:  We describe initialization of and input to the algorithm and touch upon therelevance of termination and restarts .
Edit intent: fluency
Original:  In this paper, we describe an exact algorithm for the small parsimony problem that combines both approaches.
Revised:  In this paper, we describe an exact algorithm for the Small Parsimony Problem that combines both approaches.
Edit intent: fluency
Original:  We propose a Fixed-Parameter Tractable algorithm based on the Sankoff-Rousseau dynamic programming algorithm , that also allows to sample co-optimal solutions  .
Revised:  We propose a Fixed-Parameter Tractable algorithm based on the Sankoff-Rousseau dynamic programming algorithm that also allows to sample co-optimal solutions .
Edit intent: fluency
Original:  It turns out that such an equilibrium is only possible if the finaly payoff is Bernoulli distributed as in BB.
Revised:  It turns out that such an equilibrium is only possible if the final payoff is Bernoulli distributed as in BB.
Edit intent: fluency
Original:  While Kyle's lambda is a potential, i.e. converges to 0, for the Bernoulli distribured final payoff, its limit in general is different than 0. Also, differently from \mbox{ BB
Revised:  While Kyle's lambda is a potential, i.e. converges to 0, for the Bernoulli distribured final payoff, its limit in general is different than 0. 
Edit intent: coherence
Original:  While Kyle's lambda is a potential, i.e. converges to 0, for the Bernoulli distribured final payoff, its limit in general is different than 0.
Revised:  While Kyle's lambda is a potential, i.e. converges to 0, for the Bernoulli distributed final payoff, its limit in general is different than 0.
Edit intent: fluency
Original: This article consists on the presentation of the While language, a simple imperative programming language based on the language with the same name .
Revised: This article presents a formalisation of a simple imperative programming language based on the language with the same name .
Edit intent: clarity
Original: This article consists on the presentation of the While language, a simple imperative programming language based on the language with the same name .
Revised: This article consists on the presentation of the While language, a simple imperative programming language .
Edit intent: clarity
Original:  The objective is to study and develop "hands-on" a formal specification of a programming language, namely its syntax, operational semantics and type system.
Revised:  The objective is to study and develop "hands-on" a formal specifcation of a programming language, namely its syntax, operational semantics and type system.
Edit intent: fluency
Original: The most well known and ubiquitous clustering problem encountered in nearly every branch of science is undoubtedly k-means: given a set of data points and a parameter k, select k centres and partition the data points into k clusters around these centres so that the sum of squares of distances of the points to their cluster centre \% (called the cost of the solution) is minimized.
Revised: The most well known and ubiquitous clustering problem encountered in nearly every branch of science is undoubtedly k-means: given a set of data points and a parameter k, select k centres and partition the data points into k clusters around these centres so that the sum of squares of distances of the points to their cluster centre is minimized.
Edit intent: clarity
Original:  Typically these data points lie in Euclidean space R^d for some d\geq 2.
Revised:  Typically these data points lie R^d for some d\geq 2.
Edit intent: clarity
Original:   The most commonly used algorithm in practice is known as Lloyd-Forgy, which is also referred to as "the" k-means algorithm, and various extensions of it often work very well in practice.
Revised:  The most commonly used algorithm is known as Lloyd-Forgy, which is also referred to as "the" k-means algorithm, and various extensions of it often work very well in practice.
Edit intent: coherence
Original:  [2004] analyzed a very simple local search heuristic to get a polynomial-time algorithm with approximation ratio 9+\epsilon for any fixed \epsilon>0 for k-means in Euclidean space.
Revised:  [2004] analyzed a simple local search heuristic to get a polynomial-time algorithm with approximation ratio 9+\epsilon for any fixed \epsilon>0 for k-means in Euclidean space.
Edit intent: clarity
Original:  Finding an algorithm with a better worst-case approximation guarantee has remained one of the biggest open questions in this area, in particular whether one can get a true PTAS for fixed dimension Euclidean space.
Revised:  Finding an algorithm with a better approximation guarantee has remained one of the biggest open questions in this area, in particular whether one can get a true PTAS for fixed dimension Euclidean space.
Edit intent: clarity
Original:  We settle this problem by showing that a simple local search algorithm provides a PTAS for k-means for R^d for any fixed d.
Revised:  We settle this problem by showing that a simple local search algorithm provides a PTAS for k-means in R^d for any fixed d.
Edit intent: clarity
Original:  More precisely, for any error parameter \epsilon>0, the local search algorithm that considers swaps of up to \rho=d^{O(d)}\epsilon^{-O(d/\epsilon)} centres will produce a solution whose cost is at most  1+\epsilon times greater than the optimum cost.
Revised:  More precisely, for any error parameter \epsilon>0, the local search algorithm that considers swaps of up to \rho=d^{O(d)}\epsilon^{-O(d/\epsilon)} centres will produce a solution whose cost is at most a ( 1+\epsilon times greater than the optimum cost.
Edit intent: fluency
Original:  More precisely, for any error parameter \epsilon>0, the local search algorithm that considers swaps of up to \rho=d^{O(d)}\epsilon^{-O(d/\epsilon)} centres will produce a solution whose cost is at most  1+\epsilon times greater than the optimum cost.
Revised:  More precisely, for any error parameter \epsilon>0, the local search algorithm that considers swaps of up to \rho=d^{O(d)}\epsilon^{-O(d/\epsilon)} centres will produce a solution whose cost is at most 1+\epsilon )-factor greater than the optimum cost.
Edit intent: clarity
Original:  Authoring even two body collisions in  real world can be difficult  as one has to get timing and the object trajectories to be correctly synchronized.
Revised:  Authoring even two body collisions in the real world can be difficult as one has to get timing and the object trajectories to be correctly synchronized.
Edit intent: fluency
Original:  Authoring even two body collisions in  real world can be difficult  as one has to get timing and the object trajectories to be correctly synchronized.
Revised:  Authoring even two body collisions in real world can be difficult , as one has to get timing and the object trajectories to be correctly synchronized.
Edit intent: fluency
Original:  After  trial-and-error iterations, when objects can actually be made to collide, then they are difficult to acquire in 3D.
Revised:  After tedious trial-and-error iterations, when objects can actually be made to collide, then they are difficult to acquire in 3D.
Edit intent: clarity
Original:  After  trial-and-error iterations, when objects can actually be made to collide, then they are difficult to acquire in 3D.
Revised:  After trial-and-error iterations, when objects can actually be made to collide, then they are difficult to capture in 3D.
Edit intent: clarity
Original:  We present SMASH to directly `read off ' appropriate collision parameters simply based on input video recordings.
Revised:  We present SMASH to directly read off appropriate collision parameters simply based on input video recordings.
Edit intent: fluency
Original:  We present SMASH to directly `read off ' appropriate collision parameters simply based on input video recordings.
Revised:  We present SMASH to directly `read off ' appropriate collision parameters directly from raw input video recordings.
Edit intent: clarity
Original:  Specifically, we describe how to use laws of rigid body collision to regularize the problem of lifting 2D annotated poses to 3D reconstruction of collision sequences .
Revised:  Technically we enable this by utilizing laws of rigid body collision to regularize the problem of lifting 2D annotated poses to 3D reconstruction of collision sequences .
Edit intent: clarity
Original:  Specifically, we describe how to use laws of rigid body collision to regularize the problem of lifting 2D annotated poses to 3D reconstruction of collision sequences .
Revised:  Specifically, we describe how to use laws of rigid body collision to regularize the problem of lifting 2D trajectories to a physically valid 3D reconstruction of collision sequences .
Edit intent: clarity
Original:  Specifically, we describe how to use laws of rigid body collision to regularize the problem of lifting 2D annotated poses to 3D reconstruction of collision sequences .
Revised:  Specifically, we describe how to use laws of rigid body collision to regularize the problem of lifting 2D annotated poses to 3D reconstruction of the collision .
Edit intent: clarity
Original:  Recently there has been much work on modeling the dynamics in information diffusion, but few work has integrated these models into a systematic control framework .
Revised:  Recently there has been much work on modeling information diffusion, but few work has integrated these models into a systematic control framework .
Edit intent: clarity
Original:  Recently there has been much work on modeling the dynamics in information diffusion, but few work has integrated these models into a systematic control framework .
Revised:  Recently there has been much work on modeling the dynamics in information diffusion, but few has integrated these models into a systematic control framework .
Edit intent: clarity
Original:  In this paper , we propose a unified multivariate jump diffusion process framework for modeling opinion dynamics over networks and determining the control over such networks.
Revised:  In this paper , we propose a unified multivariate jump diffusion process framework for modeling information diffusion over networks and determining the control over such networks.
Edit intent: clarity
Original:  Our method can handle noisy and partially observed data, and over networks with time-varying  and node birth processes.
Revised:  Our method can handle noisy data, networks with time-varying and node birth processes.
Edit intent: clarity
Original:  Using  synthetic and real world networks, we showed that our framework is robust, able to control both stable and unstable dynamics systems with fast convergencespeed , less variance and low control cost .
Revised:  Using both synthetic and real world networks, we showed that our framework is robust, able to control both stable and unstable dynamics systems with fast convergencespeed , less variance and low control cost .
Edit intent: fluency
Original:  Using  synthetic and real world networks, we showed that our framework is robust, able to control both stable and unstable dynamics systems with fast convergencespeed , less variance and low control cost .
Revised:  Using synthetic and real world networks, we showed that our framework is robust, able to steer both stable and unstable dynamics systems with fast convergencespeed , less variance and low control cost .
Edit intent: clarity
Original:  Recently there has been much work on modeling information diffusion, but few has integrated these models for online decision making.
Revised:  Recently there have been many works on modeling information diffusion, but few has integrated these models for online decision making.
Edit intent: fluency
Original:  Recently there has been much work on modeling information diffusion, but few has integrated these models for online decision making.
Revised:  Recently there has been much work on modeling information diffusion, but few have integrated these models for online decision making.
Edit intent: fluency
Original:  Here, we propose an unified stochastic differential equation framework for modeling information diffusion over networks and designing the control policy to guide such diffusion.
Revised:  Here, we propose a unified stochastic differential equation framework for modeling information diffusion over networks and designing the control policy to guide such diffusion.
Edit intent: fluency
Original: Recently, there is a surge of interest in using point processes to model continuous-time online user activities.
Revised: Recently, there is a surge of interest in using point processes to model continuous-time user activities.
Edit intent: clarity
Original:  This framework has resulted in many novel models , new algorithms and improved performance in diverse applications such as information diffusion, timely recommendation and network evolution .
Revised:  This framework has resulted in novel models and improved performance in diverse applications such as information diffusion, timely recommendation and network evolution .
Edit intent: clarity
Original:  This framework has resulted in many novel models , new algorithms and improved performance in diverse applications such as information diffusion, timely recommendation and network evolution .
Revised:  This framework has resulted in many novel models , new algorithms and improved performance in diverse applications .
Edit intent: clarity
Original:  However, most previous work has focused on the "open loop" setting where learned models are used mainly for predictive task.
Revised:  However, most previous works focus on the "open loop" setting where learned models are used mainly for predictive task.
Edit intent: coherence
Original:  Very often we are interested in the "closed loop" setting where a policy needs to be learned to take into account online user feedbacks and guide user activities to a desirable target state .
Revised:  Very often we are interested in the "closed loop" setting where a policy needs to be learned to incorporate user feedbacks and guide user activities to a desirable target state .
Edit intent: clarity
Original:  Very often we are interested in the "closed loop" setting where a policy needs to be learned to take into account online user feedbacks and guide user activities to a desirable target state .
Revised:  Very often we are interested in the "closed loop" setting where a policy needs to be learned to take into account online user feedbacks and guide user activities to desirable states .
Edit intent: clarity
Original:  Although point process based method has led to good predictive performance, it is not clear how we can use them for the more challenging closed loop activity guiding task.
Revised:  Although point processes have good predictive performance, it is not clear how we can use them for the more challenging closed loop activity guiding task.
Edit intent: clarity
Original:  Although point process based method has led to good predictive performance, it is not clear how we can use them for the more challenging closed loop activity guiding task.
Revised:  Although point process based method has led to good predictive performance, it is not clear how to use them for the more challenging closed loop activity guiding task.
Edit intent: coherence
Original:  Although point process based method has led to good predictive performance, it is not clear how we can use them for the more challenging closed loop activity guiding task.
Revised:  Although point process based method has led to good predictive performance, it is not clear how we can use them for the challenging closed loop activity guiding task.
Edit intent: clarity
Original:  In this paper, we propose a framework to reformulate many point process based models into stochastic differential equations, which allows us to use and extend methods from stochastic control and reinforcement learning to address the user activity guiding problem.
Revised:  In this paper, we propose a framework to reformulate point processes into stochastic differential equations, which allows us to use and extend methods from stochastic control and reinforcement learning to address the user activity guiding problem.
Edit intent: clarity