wanyu/IteraTeR_v2 huggingface dataset:
Original:  Recent work  advances our understanding of popularity, but one important gap remains: to precisely quantify the relationship between the popularity of an online item and the external promotions it receives.
Revised:  Recent work advances our understanding of popularity, but one important gap remains: To precisely quantify the relationship between the popularity of an online item and the external promotions it receives.
Edit intent: fluency
Original:  This work supplies the missing link between exogenous inputs from public social media platforms (Twitter) and endogenous responses within video content platforms (Youtube), by studying a 6-months feed of 1.06 billion tweets about 81.9 million YouTubevideos.
Revised:  This work supplies the missing link between exogenous inputs from public social media platforms , such as Twitter, and endogenous responses within video content platforms (Youtube), by studying a 6-months feed of 1.06 billion tweets about 81.9 million YouTubevideos.
Edit intent: clarity
Original:  This is done via a novel mathematical model, the Hawkes intensity process, which is able to explain the complex popularity history of each video according to its  content, network  , and sensitivity to promotion.
Revised:  This is done via a novel mathematical model, the Hawkes intensity process, which can explain the complex popularity history of each video according to its content, network , and sensitivity to promotion.
Edit intent: clarity
Original:  This model supplies a prototypical description of videos, called an endo-exo map , which allows us to explain popularity as the joint effect of two intrinsic measures and the amount of discussion from the outside world .
Revised:  Our model supplies a prototypical description of videos, called an endo-exo map , which allows us to explain popularity as the joint effect of two intrinsic measures and the amount of discussion from the outside world .
Edit intent: fluency
Original:  This model supplies a prototypical description of videos, called an endo-exo map , which allows us to explain popularity as the joint effect of two intrinsic measures and the amount of discussion from the outside world .
Revised:  This model supplies a prototypical description of videos, called an endo-exo map . This map explains popularity as the joint effect of two intrinsic measures and the amount of discussion from the outside world .
Edit intent: coherence
Original:  This model supplies a prototypical description of videos, called an endo-exo map , which allows us to explain popularity as the joint effect of two intrinsic measures and the amount of discussion from the outside world .
Revised:  This model supplies a prototypical description of videos, called an endo-exo map , which allows us to explain popularity as the result of an extrinsic factor -- the amount of discussion from the outside world .
Edit intent: clarity
Original:  This model supplies a prototypical description of videos, called an endo-exo map , which allows us to explain popularity as the joint effect of two intrinsic measures and the amount of discussion from the outside world .
Revised:  This model supplies a prototypical description of videos, called an endo-exo map , which allows us to explain popularity as the joint effect of two intrinsic measures and the amount of promotions from the outside world .
Edit intent: clarity
Original:  This model also allows us to forecast the effects of future promotions more accurately than approaches based on popularity history alone, and to identify videos that have a high potential to become viral, or those for which promotions will have hardly any effect.
Revised:  This model also allows us to forecast the effects of future promotions more accurately than approaches based on popularity history . Finally, we can identify videos that have a high potential to become viral, or those for which promotions will have hardly any effect.
Edit intent: coherence
Original:  This model also allows us to forecast the effects of future promotions more accurately than approaches based on popularity history alone, and to identify videos that have a high potential to become viral, or those for which promotions will have hardly any effect.
Revised:  This model also allows us to forecast the effects of future promotions more accurately than approaches based on popularity history alone, and to identify videos that have a high potential to become viral, as well as those for which promotions will have hardly any effect.
Edit intent: clarity
Original:  This map explains popularity as the result of an extrinsic factor -- the amount of promotions from the outside world that the video receives, acting upon two intrinsic factors -- sensitivity to promotion, and inherent virality.
Revised:  This map explains popularity as the result of an extrinsic factor - the amount of promotions from the outside world that the video receives, acting upon two intrinsic factors -- sensitivity to promotion, and inherent virality.
Edit intent: fluency
Original:  This map explains popularity as the result of an extrinsic factor -- the amount of promotions from the outside world that the video receives, acting upon two intrinsic factors -- sensitivity to promotion, and inherent virality.
Revised:  This map explains popularity as the result of an extrinsic factor -- the amount of promotions from the outside world that the video receives, acting upon two intrinsic factors - sensitivity to promotion, and inherent virality.
Edit intent: fluency
Original:  This provides some previously unknown information on the limit measures of various deterministic and probabilistic cellular automata: 3 and 4-cyclic cellular automata (introduced in [Fis90b]), one-sided captive cellular automata (introduced in [The04]), N. Fat\`es } ' candidate to solve the density classification problem [Fat13], self stabilization process toward a discrete line [RR15]...
Revised:  This provides some previously unknown information on the limit measures of various deterministic and probabilistic cellular automata: 3 and 4-cyclic cellular automata (introduced in [Fis90b]), one-sided captive cellular automata (introduced in [The04]), N. Fat } ' candidate to solve the density classification problem [Fat13], self stabilization process toward a discrete line [RR15]...
Edit intent: clarity
Original:  This provides some previously unknown information on the limit measures of various deterministic and probabilistic cellular automata: 3 and 4-cyclic cellular automata (introduced in [Fis90b]), one-sided captive cellular automata (introduced in [The04]), N. Fat\`es } ' candidate to solve the density classification problem [Fat13], self stabilization process toward a discrete line [RR15]...
Revised:  This provides some previously unknown information on the limit measures of various deterministic and probabilistic cellular automata: 3 and 4-cyclic cellular automata (introduced in [Fis90b]), one-sided captive cellular automata (introduced in [The04]), N. Fat\`es \`e} ' candidate to solve the density classification problem [Fat13], self stabilization process toward a discrete line [RR15]...
Edit intent: fluency
Original:  This provides some previously unknown information on the limit measures of various deterministic and probabilistic cellular automata: 3 and 4-cyclic cellular automata (introduced in [Fis90b]), one-sided captive cellular automata (introduced in [The04]), N. Fat\`es } ' candidate to solve the density classification problem [Fat13], self stabilization process toward a discrete line [RR15]...
Revised:  This provides some previously unknown information on the limit measures of various deterministic and probabilistic cellular automata: 3 and 4-cyclic cellular automata (introduced in [Fis90b]), one-sided captive cellular automata (introduced in [The04]), N. Fat\`es }s ' candidate to solve the density classification problem [Fat13], self stabilization process toward a discrete line [RR15]...
Edit intent: clarity
Original: We characterise the diffculty of computing topological entropy of one-dimensional subshifts under various dynamical restrictions.
Revised: We study the difficulty of computing topological entropy of one-dimensional subshifts under various dynamical restrictions.
Edit intent: clarity
Original:  A sequence of edges is chosen starting from a given %DIFDELCMD < {\em %%% root vertex such that each edge is adjacent to a previously chosen edge.
Revised:  A sequence of edges is chosen starting from a given %DIFDELCMD < {\em %%% root vertex such that each edge is adjacent to a previously chosen edge.
Edit intent: fluency
Original:  This search paradigm, known as %DIFDELCMD < {\em %%% expanding search was recently introduced   for modeling problems such as coal mining in which the cost of re-exploration is negligible.
Revised:  This search paradigm, known as %DIFDELCMD < {\em %%% expanding search was recently introduced for modeling problems such as coal mining in which the cost of re-exploration is negligible.
Edit intent: fluency
Original:   We define the %DIFDELCMD < {\em %%% search ratio of an expanding search as the maximum over all vertices of the ratio of the time taken to reach the vertex and the shortest-path cost to it from the root.
Revised:  We define the %DIFDELCMD < {\em %%% search ratio of an expanding search as the maximum over all vertices of the ratio of the time taken to reach the vertex and the shortest-path cost to it from the root.
Edit intent: fluency
Original:  Our main results focus on the problem of finding the %DIFDELCMD < {\em %%% randomized expanding search with minimum%DIFDELCMD < {\em %%%  expected search ratio , which is equivalent to solving a zero-sum game between a %DIFDELCMD < {\em %%% Searcher and a%DIFDELCMD < {\em %%% Hider .
Revised:  Our main results focus on the problem of finding the %DIFDELCMD < {\em %%% randomized expanding search %DIFDELCMD < {\em %%% expected search ratio , which is equivalent to solving a zero-sum game between a %DIFDELCMD < {\em %%% Searcher and a%DIFDELCMD < {\em %%% Hider .
Edit intent: clarity
Original:  Our main results focus on the problem of finding the %DIFDELCMD < {\em %%% randomized expanding search with minimum%DIFDELCMD < {\em %%%  expected search ratio , which is equivalent to solving a zero-sum game between a %DIFDELCMD < {\em %%% Searcher and a%DIFDELCMD < {\em %%% Hider .
Revised:  Our main results focus on the problem of finding the %DIFDELCMD < {\em %%% randomized expanding search with minimum%DIFDELCMD < {\em %%% with minimum expected search ratio , which is equivalent to solving a zero-sum game between a %DIFDELCMD < {\em %%% Searcher and a%DIFDELCMD < {\em %%% Hider .
Edit intent: coherence
Original:  Our main results focus on the problem of finding the %DIFDELCMD < {\em %%% randomized expanding search with minimum%DIFDELCMD < {\em %%%  expected search ratio , which is equivalent to solving a zero-sum game between a %DIFDELCMD < {\em %%% Searcher and a%DIFDELCMD < {\em %%% Hider .
Revised:  Our main results focus on the problem of finding the %DIFDELCMD < {\em %%% randomized expanding search with minimum%DIFDELCMD < {\em %%% expected search ratio , which is equivalent to solving a zero-sum game between a %DIFDELCMD < {\em %%% and a%DIFDELCMD < {\em %%% Hider .
Edit intent: clarity
Original:  Our main results focus on the problem of finding the %DIFDELCMD < {\em %%% randomized expanding search with minimum%DIFDELCMD < {\em %%%  expected search ratio , which is equivalent to solving a zero-sum game between a %DIFDELCMD < {\em %%% Searcher and a%DIFDELCMD < {\em %%% Hider .
Revised:  Our main results focus on the problem of finding the %DIFDELCMD < {\em %%% randomized expanding search with minimum%DIFDELCMD < {\em %%% expected search ratio , which is equivalent to solving a zero-sum game between a %DIFDELCMD < {\em %%% Searcher %DIFDELCMD < {\em %%% Hider .
Edit intent: fluency
Original:  Our main results focus on the problem of finding the %DIFDELCMD < {\em %%% randomized expanding search with minimum%DIFDELCMD < {\em %%%  expected search ratio , which is equivalent to solving a zero-sum game between a %DIFDELCMD < {\em %%% Searcher and a%DIFDELCMD < {\em %%% Hider .
Revised:  Our main results focus on the problem of finding the %DIFDELCMD < {\em %%% randomized expanding search with minimum%DIFDELCMD < {\em %%% expected search ratio , which is equivalent to solving a zero-sum game between a %DIFDELCMD < {\em %%% Searcher and a%DIFDELCMD < {\em %%% Searcher and a Hider .
Edit intent: fluency
Original:  Switching interaction partners can be an effective control strategy.
Revised:  Adjusting interacting partners is an effective individualized control strategy.
Edit intent: clarity
Original:  Intuitively, it can be done either by shortening the interaction time between susceptible and infected individuals or by increasing the opportunities for contact between susceptibles .
Revised:  Intuitively, it is done either by shortening the interaction time between susceptible and infected individuals or by increasing the opportunities for contact between susceptibles .
Edit intent: clarity
Original:  Intuitively, it can be done either by shortening the interaction time between susceptible and infected individuals or by increasing the opportunities for contact between susceptibles .
Revised:  Intuitively, it can be done either by shortening the interaction time between susceptible and infected individuals or by increasing the opportunities for contact between susceptible individuals .
Edit intent: clarity
Original: A graph with n vertices is 1-planar  if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of 4n-8 edges.
Revised: A graph with n vertices is 1-planar if it can be drawn in the plane with at most one crossing per edge and is optimal if it has the maximum of 4n-8 edges.
Edit intent: clarity
Original:  In addition, we prove that every optimal 1-planar graph G , which is non-irreducible, can be reduced to every extended wheel graph whose size is in a range from the minimum extended wheel graph to some upper bound .
Revised:  In addition, we prove that every optimal 1-planar graph G can be reduced to every extended wheel graph whose size is in a range from the minimum extended wheel graph to some upper bound .
Edit intent: clarity
Original:  Moreover, we show that the optimal 1-planar graphs constitute a single equivalence class for the reductions and their inverse with the minimum extended wheel graph as a representative, and that the equivalence problem is decidable in linear time.
Revised:  Nevertheless, reductions can be computed in linear time.
Edit intent: coherence
Original:  In contrast to  other co-simulation algorithms, this method is non-iterative and only requires knowledge of the coupling variable values . Consequently, it allows for significant speed ups and the protection of sensitive information contained within simulator models.
Revised:  In contrast to most other co-simulation algorithms, this method is non-iterative and only requires knowledge of the coupling variable values . Consequently, it allows for significant speed ups and the protection of sensitive information contained within simulator models.
Edit intent: clarity
Original:  In contrast to  other co-simulation algorithms, this method is non-iterative and only requires knowledge of the coupling variable values . Consequently, it allows for significant speed ups and the protection of sensitive information contained within simulator models.
Revised:  In contrast to other co-simulation algorithms, this method is non-iterative and only requires knowledge of the current coupling data . Consequently, it allows for significant speed ups and the protection of sensitive information contained within simulator models.
Edit intent: clarity
Original:  A quarter car model with linear and nonlinear damping serves as a co-simulation benchmark and demonstrates the capabilities of the energy residual concept  .
Revised:  A quarter car model with linear and nonlinear damping serves as a co-simulation benchmark and verifies the capabilities of the energy residual concept .
Edit intent: clarity
Original: One of the greatest effort of computational scientists is to translate the mathematical model describing a class of physical phenomena into large and complex codes.
Revised: One of the greatest efforts of computational scientists is to translate the mathematical model describing a class of physical phenomena into large and complex codes.
Edit intent: fluency
Original:  Legacy codes suffers from the additional curse of rigid design choices based on outdated performance metrics (e.g. minimization of memory footprint).
Revised:  Legacy codes suffer from the additional curse of rigid design choices based on outdated performance metrics (e.g. minimization of memory footprint).
Edit intent: fluency
Original: Cyber-physical systems are critical infrastructures crucial to the reliable delivery of energy and other resources , and to the stable functioning of automatic and control architectures.
Revised: Cyber-physical systems are critical infrastructures that are crucial both to the reliable delivery of energy and other resources , and to the stable functioning of automatic and control architectures.
Edit intent: clarity
Original: Cyber-physical systems are critical infrastructures crucial to the reliable delivery of energy and other resources , and to the stable functioning of automatic and control architectures.
Revised: Cyber-physical systems are critical infrastructures crucial to the reliable delivery of resources such as energy , and to the stable functioning of automatic and control architectures.
Edit intent: clarity
Original:  A key challenge in cyber-physical defense is a fast online detection and localization of faults and intrusions without a prior knowledge of the failure type.
Revised:  A key challenge in cyber-physical defense is a fast online detection and localization of faults and intrusions without prior knowledge of the failure type.
Edit intent: fluency
Original:  We describe a set of techniques for an efficient identification of faults from correlations in physical signals, assuming that the minimal amount of information on the system is available .
Revised:  We describe a set of techniques for the efficient identification of faults from correlations in physical signals, assuming that the minimal amount of information on the system is available .
Edit intent: fluency
Original:  We describe a set of techniques for an efficient identification of faults from correlations in physical signals, assuming that the minimal amount of information on the system is available .
Revised:  We describe a set of techniques for an efficient identification of faults from correlations in physical signals, assuming only a minimal amount of information on the system is available .
Edit intent: clarity
Original:  We describe a set of techniques for an efficient identification of faults from correlations in physical signals, assuming that the minimal amount of information on the system is available .
Revised:  We describe a set of techniques for an efficient identification of faults from correlations in physical signals, assuming that the minimal amount of available system information .
Edit intent: clarity
Original:  The performance of  detection method is illustrated on data collected from a large building automation system.
Revised:  The performance of our detection method is illustrated on data collected from a large building automation system.
Edit intent: fluency
Original:  The proposed minimum trajectory error training criterion minimises overall output trajectory error across an utterance, rather than minimising the error per frame independently, and thus takes into account the interaction between static and dynamic features.
Revised:  The minimum generation error training criterion minimises overall output trajectory error across an utterance, rather than minimising the error per frame independently, and thus takes into account the interaction between static and dynamic features.
Edit intent: clarity
Original: Collective sensing is an emergent phenomenon that enables individuals to estimate an invisible property of the environment through the observation of social interactions.
Revised: Collective sensing is an emergent phenomenon which enables individuals to estimate an invisible property of the environment through the observation of social interactions.
Edit intent: fluency
Original: Collective sensing is an emergent phenomenon that enables individuals to estimate an invisible property of the environment through the observation of social interactions.
Revised: Collective sensing is an emergent phenomenon that enables individuals to estimate a hidden property of the environment through the observation of social interactions.
Edit intent: fluency
Original:  It has been shown in Nature that individuals in animal groups develop the capacity to perceive this signal and the social interactions between them produce complex group behavior e.g. schooling fish.
Edit intent: coherence
Original:  Previous work on collective sensing shows that gregarious individuals obtain an evolutionary advantage  when competing against solitary individuals.
Revised:  Previous work on collective sensing shows that gregarious individuals obtain an evolutionary advantage by exploiting collective sensing when competing against solitary individuals.
Edit intent: clarity
Original:  The behavior of agents is determined by a model-free neural network, which is randomly initialized.
Revised:  The behavior of agents is determined by a neural network, which is randomly initialized.
Edit intent: clarity
Original:  The latter prescribes a Skorokhod reflection of the optimally controlled state process at a certain state and price dependent threshold.
Revised:  We show that the latter prescribes a Skorokhod reflection of the optimally controlled state process at a certain state and price dependent threshold.
Edit intent: coherence
Original: This paper studies an optimal irreversible extraction problem of an exhaustible commodity in presence of regime shifts .
Revised: This paper studies an optimal irreversible extraction problem of an exhaustible commodity .
Edit intent: clarity
Original:  We show that the latter prescribes a Skorokhod reflection of the optimally controlled state process at a certain state and price dependent threshold.
Revised:  We show that the latter prescribes a Skorokhod reflection of the (optimally) controlled state process at a certain state and price dependent threshold.
Edit intent: coherence
Original:  On the other hand, in presence of a concave running cost function it is optimal to instantaneously deplet the reserve at the time at which the commodity's price exceeds an endogenously determined critical level.
Revised:  On the other hand, in presence of a concave running cost function it is optimal to instantaneously deplete the reserve at the time at which the commodity's price exceeds an endogenously determined critical level.
Edit intent: fluency
Original:  Our model is inspired by Trypanosoma cruzi, a parasite transmitted by trophic and vectorial mechanisms.
Revised:  Our model is inspired by T. cruzi, a parasite transmitted by trophic and vectorial mechanisms.
Edit intent: clarity
Original:  In our ecological multiplex network , nodes represent species populations interacting through a food web and a vectorial contaminative layer at the same time.
Revised:  Our ecological network model is represented by a multiplex in which nodes represent species populations interacting through a food web and a vectorial contaminative layer at the same time.
Edit intent: clarity
Original:  Our simulations in both scenarios show that the infection is more widespread when both transmission mechanisms are considered at the same time and it is maximised when they have similar importance .
Revised:  Our simulations in both scenarios show that the infection is more widespread when both the trophic and the contaminative interactions are considered with equal rates .
Edit intent: clarity