wanyu/IteraTeR_v2 huggingface dataset:
Original:  We collect hundreds of million comments and images from alt-right Web communities like 4chan's Politically Incorrect board (/pol/) and the Twitter clone, Gab. Using scientifically grounded methods, we quantify the escalation and spread of antisemitic memes and rhetoric across the Web.
Revised:  We collect hundreds of million posts and images from alt-right Web communities like 4chan's Politically Incorrect board (/pol/) and the Twitter clone, Gab. Using scientifically grounded methods, we quantify the escalation and spread of antisemitic memes and rhetoric across the Web.
Edit intent: clarity
Original:  We collect hundreds of million comments and images from alt-right Web communities like 4chan's Politically Incorrect board (/pol/) and the Twitter clone, Gab. Using scientifically grounded methods, we quantify the escalation and spread of antisemitic memes and rhetoric across the Web.
Revised:  We collect hundreds of million comments and images from alt-right Web communities like 4chan's Politically Incorrect board (/pol/) and Gab. Using scientifically grounded methods, we quantify the escalation and spread of antisemitic memes and rhetoric across the Web.
Edit intent: coherence
Original:  Furthermore, this antisemitism appears in tandem with sharp increases in white ethnic nationalist content on the same communities.
Edit intent: coherence
Original:  We additionally examine the prevalence and spread of the antisemitic "Happy Merchant" meme, and in particular how these fringe communities influence its propagation to more mainstream services like Twitter and Reddit.
Revised:  We additionally examine the prevalence and spread of the antisemitic "Happy Merchant" meme, and in particular how these fringe communities influence its propagation to more mainstream communities like Twitter and Reddit.
Edit intent: clarity
Original:  Our open and scientifically grounded methods serve as a framework to augment current qualitative efforts by anti-hate groups, providing new insights into the growth and spread of antisemitism online.
Revised:  Our methods serve as a framework to augment current qualitative efforts by anti-hate groups, providing new insights into the growth and spread of antisemitism online.
Edit intent: clarity
Original:  Our open and scientifically grounded methods serve as a framework to augment current qualitative efforts by anti-hate groups, providing new insights into the growth and spread of antisemitism online.
Revised:  Our open and scientifically grounded methods serve as a framework to augment current qualitative efforts by anti-hate groups, providing new insights into the growth and spread of hate online.
Edit intent: clarity
Original:  Our proposed HyperBPR not only outperforms their Euclidean counterparts, but also achieves state-of-the-art performance on multiple benchmark datasets, demonstrating the effectiveness of personalized recommendation in Hyperbolic space .
Revised:  Our proposed HyperBPR not only outperforms their Euclidean counterparts, but also achieves state-of-the-art performance on multiple benchmark datasets, demonstrating the effectiveness of personalized recommendation in hyperbolic geometry .
Edit intent: clarity
Original: Objective: Calibration is one of the most important initial steps in any signal acquisition and experiment.
Revised: Object:
Edit intent: clarity
Original:  Result: We identify a novel constant oscillatory pattern in the PTT signal and identify this pattern as the sawtooth artifact.
Revised:  Main Results: We report a novel constant oscillatory pattern in the PTT signal and identify this pattern as the sawtooth artifact.
Edit intent: clarity
Original:  Result: We identify a novel constant oscillatory pattern in the PTT signal and identify this pattern as the sawtooth artifact.
Revised:  Result: We identify a novel constant oscillatory pattern in the PTT signal and identify this pattern as a sawtooth artifact.
Edit intent: fluency
Original:  We propose an approach based on the de-shape method to visualize, quantify and validate this sawtooth artifact.
Revised:  We apply an approach based on the de-shape method to visualize, quantify and validate this sawtooth artifact.
Edit intent: clarity
Original:  Conclusion: The PTT and ECG signals not designed for the PTT evaluation may contain unwanted artifacts.
Revised:  Significance: The PPG and ECG signals not designed for the PTT evaluation may contain unwanted artifacts.
Edit intent: clarity
Original:  On the one hand, UAVs can be connected to cellular networks as new types of user equipment, therefore generating significant revenues for the operators that  guarantee their stringent service requirements.
Revised:  On the one hand, UAVs can be connected to cellular networks as new types of user equipment, therefore generating significant revenues for the operators that can guarantee their stringent service requirements.
Edit intent: clarity
Original:  On the other hand, UAVs offer the unprecedented opportunity to realize UAV-mounted flying base stations that can dynamically reposition themselves to boost coverage, spectral efficiency  and user quality of experience.
Revised:  On the other hand, UAVs offer the unprecedented opportunity to realize UAV-mounted flying base stations that can dynamically reposition themselves to boost coverage, spectral efficiency , and user quality of experience.
Edit intent: fluency
Original:  Indeed, the standards bodies are currently exploring possibilities for serving commercial UAVs with cellular networks.
Revised:  Indeed, the standardization bodies are currently exploring possibilities for serving commercial UAVs with cellular networks.
Edit intent: clarity
Original:  Industries are beginning to trial early prototypes of flying base stations or user equipments, while academia is in full swing researching mathematical and algorithmic solutions to many interesting new problems arising from flying nodes in cellular networks.
Revised:  Industries are beginning to trial early prototypes of flying base stations or user equipments, while academia is in full swing researching mathematical and algorithmic solutions to address interesting new problems arising from flying nodes in cellular networks.
Edit intent: clarity
Original:  In this article, we provide a comprehensive survey of all of these developments promoting smooth integration of UAVs in cellular networks.
Revised:  In this article, we provide a comprehensive survey of all of these developments promoting smooth integration of UAVs into cellular networks.
Edit intent: fluency
Original:   the interference issues and potential solutions addressed by standardization bodies for serving aerial users with  existing terrestrial base stations,  the challenges and opportunities for assisting cellular communications with UAV-based flying relays and base stations,  the ongoing prototyping and test bed activities,  the new regulations being developed to manage the commercial use of UAVs, and  the cyber-physical security of UAV-assisted cellular communications.
Revised:  (ii) the interference issues and potential solutions addressed by standardization bodies for serving aerial users with existing terrestrial base stations, the challenges and opportunities for assisting cellular communications with UAV-based flying relays and base stations, the ongoing prototyping and test bed activities, the new regulations being developed to manage the commercial use of UAVs, and the cyber-physical security of UAV-assisted cellular communications.
Edit intent: coherence
Original:   the interference issues and potential solutions addressed by standardization bodies for serving aerial users with  existing terrestrial base stations,  the challenges and opportunities for assisting cellular communications with UAV-based flying relays and base stations,  the ongoing prototyping and test bed activities,  the new regulations being developed to manage the commercial use of UAVs, and  the cyber-physical security of UAV-assisted cellular communications.
Revised:  the interference issues and potential solutions addressed by standardization bodies for serving aerial users with the existing terrestrial base stations, the challenges and opportunities for assisting cellular communications with UAV-based flying relays and base stations, the ongoing prototyping and test bed activities, the new regulations being developed to manage the commercial use of UAVs, and the cyber-physical security of UAV-assisted cellular communications.
Edit intent: fluency
Original:   the interference issues and potential solutions addressed by standardization bodies for serving aerial users with  existing terrestrial base stations,  the challenges and opportunities for assisting cellular communications with UAV-based flying relays and base stations,  the ongoing prototyping and test bed activities,  the new regulations being developed to manage the commercial use of UAVs, and  the cyber-physical security of UAV-assisted cellular communications.
Revised:  the interference issues and potential solutions addressed by standardization bodies for serving aerial users with existing terrestrial base stations, the challenges and opportunities for assisting cellular communications with UAV-based flying relays and base stations, the ongoing prototyping and test bed activities, (v) the new regulations being developed to manage the commercial use of UAVs, and the cyber-physical security of UAV-assisted cellular communications.
Edit intent: coherence
Original:   the interference issues and potential solutions addressed by standardization bodies for serving aerial users with  existing terrestrial base stations,  the challenges and opportunities for assisting cellular communications with UAV-based flying relays and base stations,  the ongoing prototyping and test bed activities,  the new regulations being developed to manage the commercial use of UAVs, and  the cyber-physical security of UAV-assisted cellular communications.
Revised:  the interference issues and potential solutions addressed by standardization bodies for serving aerial users with existing terrestrial base stations, the challenges and opportunities for assisting cellular communications with UAV-based flying relays and base stations, the ongoing prototyping and test bed activities, the new regulations being developed to manage the commercial use of UAVs, and (vi) the cyber-physical security of UAV-assisted cellular communications.
Edit intent: coherence
Original:  Here, we provide the first wide-reaching mathematical treatment which bridges mitochondrial network and genetic states.
Revised:  Here, we provide the first wide-reaching theoretical framework which bridges mitochondrial network and genetic states.
Edit intent: clarity
Original:  This paper discusses Iteratively Relaxed Scheduling , a framework that uses scheduling constraints in order to simplify the verification problem and enable automated verification of programs which could not be handled with fully non-deterministic scheduling.
Revised:  This paper discusses Iteratively Relaxed Scheduling , a framework that uses scheduling constraints in order to simplify the verification problem and enable automated verification of programs which could not be handled with fully non-deterministic scheduling.
Edit intent: fluency
Original:  Theoretical studies have shown that the updating rules chosen to model individual decision making can dramatically modify the evolutionary outcome of the population as a whole.
Revised:  Theoretical studies have shown that the update rules chosen to model individual decision making can dramatically modify the evolutionary outcome of the population as a whole.
Edit intent: fluency
Original:  This hints at the complexities of considering the personality of individuals in the population, where each one uses its own rule.
Revised:  This hints at the complexities of considering the personality of individuals in a population, where each one uses its own rule.
Edit intent: fluency
Original:  Here, we investigate whether and how the heterogeneity in the rules of behavior update alters the evolutionary outcome.
Revised:  Here, we investigate whether and how heterogeneity in the rules of behavior update alters the evolutionary outcome.
Edit intent: fluency
Original:  Under weak selection, we analytically reveal a simple property that holds for any two-strategy multi-player games  : the evolutionary outcome in a population with heterogeneous updating rules is the weighted average of the outcomes in the corresponding homogeneous populations, and the associated weights are the frequencies of each updating rule in the heterogeneous population.
Revised:  Under weak selection, we analytically reveal a simple property that holds for any two-strategy multi-player games : the evolutionary outcome in a population with heterogeneous update rules is the weighted average of the outcomes in the corresponding homogeneous populations, and the associated weights are the frequencies of each updating rule in the heterogeneous population.
Edit intent: fluency
Original:  Under weak selection, we analytically reveal a simple property that holds for any two-strategy multi-player games  : the evolutionary outcome in a population with heterogeneous updating rules is the weighted average of the outcomes in the corresponding homogeneous populations, and the associated weights are the frequencies of each updating rule in the heterogeneous population.
Revised:  Under weak selection, we analytically reveal a simple property that holds for any two-strategy multi-player games : the evolutionary outcome in a population with heterogeneous updating rules is the weighted average of the outcomes in the corresponding homogeneous populations, and the associated weights are the frequencies of each update rule in the heterogeneous population.
Edit intent: fluency
Original:  Our work thus provides an efficient method to calculate evolutionary outcomes under heterogeneous updating rules.
Revised:  Our work thus provides an efficient method to calculate evolutionary outcomes under heterogeneous update rules.
Edit intent: fluency
Original:  Under a mild additional assumption on the model parameters we show that the viscosity solution is in fact a \pi-strong solution to the HJB equation and can hence be compactly approximated by smooth functions .
Revised:  Continuity of the viscosity solution is in fact a \pi-strong solution to the HJB equation and can hence be compactly approximated by smooth functions .
Edit intent: clarity
Original:  Under a mild additional assumption on the model parameters we show that the viscosity solution is in fact a \pi-strong solution to the HJB equation and can hence be compactly approximated by smooth functions .
Revised:  Under a mild additional assumption on the model parameters we show that the viscosity solution is enough to carry out the verification argument .
Edit intent: clarity
Original:  The decision maker seeks to maximize the expected number of items that she includes in the knapsack while satisfying a capacity constraint, and while making terminal decisions as soon as each item weight is revealed.
Revised:  The decision maker seeks to maximize the expected total reward of the items that she includes in the knapsack while satisfying a capacity constraint, and while making terminal decisions as soon as each item weight is revealed.
Edit intent: clarity
Original:  The decision maker seeks to maximize the expected total reward of the items that she includes in the knapsack while satisfying a capacity constraint , and while making terminal decisions as soon as each item weight is revealed.
Revised:  The decision maker seeks to maximize the expected total reward of the items that she includes in the knapsack while satisfying a capacity constraint and while making terminal decisions as soon as each item weight is revealed.
Edit intent: fluency
Original:  We devise a re-optimized heuristic that achieves this regret bound.
Revised:  We devise a reoptimized heuristic that achieves this regret bound.
Edit intent: fluency
Original:  This paper summarizes five lessons we learned from experimenting with state-of-the-art deep learning recommenders at the leading Norwegian marketplace FINN.no .
Revised:  This paper summarizes five lessons we learned from experimenting with state-of-the-art deep learning recommenders at the leading Norwegian marketplace .
Edit intent: clarity
Original:  This system is currently running with around 20 %DIFDELCMD < \\%%% %DIF < click-through-rate in production atFINN.no and serves over one million visitors everyday.
Revised:  This system is currently running with around 20 %DIFDELCMD < \\%%% %DIF < click-through-rate in FINN.no and serves over one million visitors everyday.
Edit intent: clarity
Original:  Here, we reveal how evolutionary pressure has shaped protein sequences  to deal with backbone self-entanglement.
Revised:  Here, we reveal how evolutionary pressure has shaped protein sequences and structures to deal with backbone self-entanglement.
Edit intent: clarity
Original:  A likely picture is that entangled loops are formed only toward the end of the folding process to avoid kinetic traps.
Revised:  A possible picture is that entangled loops are formed only toward the end of the folding process to avoid kinetic traps.
Edit intent: clarity
Original:  Here, we reveal how evolutionary pressure has shaped protein sequences and structures to deal with backbone self-entanglement.
Revised:  Here, we reveal the existence of specific patterns adopted by protein sequences and structures to deal with backbone self-entanglement.
Edit intent: clarity
Original:  Consistently, these loops are on average located closer to the end of the protein that is translated later at the ribosome.
Revised:  Consistently, these loops are more frequently found to be wrapped around a portion of the chain on their N-terminal side, the one translated earlier at the ribosome.
Edit intent: clarity
Original:  This improves on the bound of O(Q(f) \cdot n) that follows by treating each conjunction independently, and  is tight for worst-case choices of f. Using completely different techniques, we prove a similar tight composition theorem for the approximate degree of f. By recursively applying our composition theorems, we obtain a nearly optimal O(n^{1-2^{-d}}) upper bound on the quantum query complexity and approximate degree of linear-size depth-d AC^0 circuits.
Revised:  This improves on the bound of O(Q(f) \cdot n) that follows by treating each conjunction independently, and our bound is tight for worst-case choices of f. Using completely different techniques, we prove a similar tight composition theorem for the approximate degree of f. By recursively applying our composition theorems, we obtain a nearly optimal O(n^{1-2^{-d}}) upper bound on the quantum query complexity and approximate degree of linear-size depth-d AC^0 circuits.
Edit intent: clarity
Original:  To tackle this challenge, in this paper, an edge2vec model is proposed to represent nodes in ways that incorporate edge semanticsrepresented as different edge-types in heterogeneous networks .
Revised:  To tackle this challenge, in this paper, an edge2vec model , which represents graphs considering edge semantics .
Edit intent: clarity
Original:  An edge-type transition matrix is optimized from an Expectation-Maximization (EM) framework as an extra criterion of a biased node random walk on networks , and a biased skip-gram model is leveraged to learn node embeddings based on the random walks afterwards . edge2vec is validated and evaluated using three medical domain problems on an ensemble of complex medical networks (more than 10 node- \& edge- types):
Revised:  An edge-type transition matrix is trained by an Expectation-Maximization (EM) framework as an extra criterion of a biased node random walk on networks , and a biased skip-gram model is leveraged to learn node embeddings based on the random walks afterwards . edge2vec is validated and evaluated using three medical domain problems on an ensemble of complex medical networks (more than 10 node- \& edge- types):
Edit intent: clarity
Original:  An edge-type transition matrix is optimized from an Expectation-Maximization (EM) framework as an extra criterion of a biased node random walk on networks , and a biased skip-gram model is leveraged to learn node embeddings based on the random walks afterwards . edge2vec is validated and evaluated using three medical domain problems on an ensemble of complex medical networks (more than 10 node- \& edge- types):
Revised:  An edge-type transition matrix is optimized from an Expectation-Maximization approach , and a biased skip-gram model is leveraged to learn node embeddings based on the random walks afterwards . edge2vec is validated and evaluated using three medical domain problems on an ensemble of complex medical networks (more than 10 node- \& edge- types):
Edit intent: clarity
Original:  An edge-type transition matrix is optimized from an Expectation-Maximization (EM) framework as an extra criterion of a biased node random walk on networks , and a biased skip-gram model is leveraged to learn node embeddings based on the random walks afterwards . edge2vec is validated and evaluated using three medical domain problems on an ensemble of complex medical networks (more than 10 node- \& edge- types):
Revised:  An edge-type transition matrix is optimized from an Expectation-Maximization (EM) framework as an extra criterion of a biased node random walk on networks , and a stochastic gradient descent model is employed to learn node embeddings based on the random walks afterwards . edge2vec is validated and evaluated using three medical domain problems on an ensemble of complex medical networks (more than 10 node- \& edge- types):
Edit intent: clarity
Original:  An edge-type transition matrix is optimized from an Expectation-Maximization (EM) framework as an extra criterion of a biased node random walk on networks , and a biased skip-gram model is leveraged to learn node embeddings based on the random walks afterwards . edge2vec is validated and evaluated using three medical domain problems on an ensemble of complex medical networks (more than 10 node- \& edge- types):
Revised:  An edge-type transition matrix is optimized from an Expectation-Maximization (EM) framework as an extra criterion of a biased node random walk on networks , and a biased skip-gram model is leveraged to learn node embedding on a heterogeneous graph via the trained transition matrix . edge2vec is validated and evaluated using three medical domain problems on an ensemble of complex medical networks (more than 10 node- \& edge- types):
Edit intent: clarity
Original:  medical entity classification, compound-gene binding prediction, and medical information searching cost . Results show that by considering edge semantics, edge2vec significantly outperforms other state-of-art models on all three tasks  .
Revised:  medical entity classification, compound-gene binding prediction, and biomedical information retrieval . Results show that by considering edge semantics, edge2vec significantly outperforms other state-of-art models on all three tasks .
Edit intent: clarity
Original:   First, we prove (quasi-) polynomial smoothed complexity when the underlying game graph is an (arbitrary) complete graph, and every player has constantly many strategies.
Revised:  First, we prove (quasi-) polynomial smoothed complexity when the underlying game graph is a complete (resp. arbitrary) graph, and every player has constantly many strategies.
Edit intent: clarity
Original:  To the best of our knowledge, ours is the first smoothed efficient algorithm for a Nash equilibrium problem that is hard in the worst case.
Edit intent: coherence
Original:  We note that the complete graph case is reminiscent of perturbing all parameters, a common assumption in almost all known smoothed efficient analysis .
Revised:  We note that the complete graph case is reminiscent of perturbing all parameters, a common assumption in most known smoothed analysis results .
Edit intent: clarity