wanyu/IteraTeR_v2 huggingface dataset:
Original:  The emergence of mainstream social networks like Twitter and Facebook makes it easier for misleading, false, and agenda driven information to quickly and seamlessly spread online, deceiving people or influencing their opinions.
Revised:  The emergence of mainstream social networks like Twitter and Facebook makes it easier for misleading, false, or agenda-driven information can quickly and seamlessly spread online, deceiving people or influencing their opinions.
Edit intent: clarity
Original:  Moreover , the increased engagement of tightly knit communities, such as Reddit and 4chan,  compounds the problem  as their users initiate and propagate alternative information  not only within their own communities, but also to other communities and social mediaplatforms across the Web.
Revised:  Also , the increased engagement of tightly knit communities, such as Reddit and 4chan, compounds the problem as their users initiate and propagate alternative information not only within their own communities, but also to other communities and social mediaplatforms across the Web.
Edit intent: fluency
Original:  Moreover , the increased engagement of tightly knit communities, such as Reddit and 4chan,  compounds the problem  as their users initiate and propagate alternative information  not only within their own communities, but also to other communities and social mediaplatforms across the Web.
Revised:  Moreover , the increased engagement of tightly knit communities, such as Reddit and 4chan, further compounds the problem as their users initiate and propagate alternative information not only within their own communities, but also to other communities and social mediaplatforms across the Web.
Edit intent: fluency
Original:  Moreover , the increased engagement of tightly knit communities, such as Reddit and 4chan,  compounds the problem  as their users initiate and propagate alternative information  not only within their own communities, but also to other communities and social mediaplatforms across the Web.
Revised:  Moreover , the increased engagement of tightly knit communities, such as Reddit and 4chan, compounds the problem , as their users initiate and propagate alternative information not only within their own communities, but also to other communities and social mediaplatforms across the Web.
Edit intent: fluency
Original:  Moreover , the increased engagement of tightly knit communities, such as Reddit and 4chan,  compounds the problem  as their users initiate and propagate alternative information  not only within their own communities, but also to other communities and social mediaplatforms across the Web.
Revised:  Moreover , the increased engagement of tightly knit communities, such as Reddit and 4chan, compounds the problem as their users initiate and propagate alternative information , not only within their own communities, but also to other communities and social mediaplatforms across the Web.
Edit intent: fluency
Original:  These platforms thus constitute an important piece of the modern information ecosystem which , alas, has not been studied as a whole.
Revised:  These platforms thus constitute an important piece of the modern information ecosystem , which, thus far , alas, has not been studied as a whole.
Edit intent: clarity
Original:  These platforms thus constitute an important piece of the modern information ecosystem which , alas, has not been studied as a whole.
Revised:  These platforms thus constitute an important piece of the modern information ecosystem which , has not been studied as a whole.
Edit intent: clarity
Original:  By analyzing millions of posts around a variety of axes, we measure how mainstream and alternative news flow between these platforms.
Revised:  By analyzing millions of posts around several axes, we measure how mainstream and alternative news flow between these platforms.
Edit intent: clarity
Original:  By analyzing millions of posts around a variety of axes, we measure how mainstream and alternative news flow between these platforms.
Revised:  By analyzing millions of posts around a variety of axes, we measure how mainstream and alternative news flows between these platforms.
Edit intent: fluency
Original:  Our results indicate that alt-right communities within 4chan and Reddit can have a surprising level of influence on Twitter, providing evidence that "fringe" communities may often be succeeding in spreading these alternative news sources to mainstream social networks and the greater Web.
Revised:  Our results indicate that alt-right communities within 4chan and Reddit can have a surprising level of influence on Twitter, providing evidence that "fringe" communities often succeed in spreading alternative news to mainstream social networks and the greater Web.
Edit intent: clarity
Original:  We present the overall design and architecture, and describe the key components needed for the secure collection, anonymization , and processing of compensation data, focusing on the unique challenges associated with anonymity, privacy , and security.
Revised:  We present the overall design and architecture, and describe the key components needed for the secure collection, anonymization , and processing of compensation data, focusing on the unique challenges associated with privacy and security.
Edit intent: fluency
Original:  We show the effectiveness of our approach for cross-modality retrieval on three datasets, surpassing both Deep CCA and a multi-view network using freely learned projections optimized by a pairwise ranking loss, especially when few training data is available .
Revised:  We show the effectiveness of our approach for cross-modality retrieval on three datasets, surpassing both Deep CCA and a multi-view network using freely learned projections optimized by a pairwise ranking loss, especially when little training data is available .
Edit intent: fluency
Original:   In the present paper  we will argue that  the L^2 condition number is a proper measure of the conditioning of the basis.
Revised:  In the present paper , we will argue that the L^2 condition number is a proper measure of the conditioning of the basis.
Edit intent: fluency
Original:  This condition number is independent of elliptic problems to be solved, and reflects a balance between desired properties of the stiffness matrix and the preconditioner .
Revised:  This condition number is independent of elliptic problems to be solved, as a measure of the conditioning of the basis .
Edit intent: clarity
Original:  A key tool to obtain this result is the properties of the bubble transform, introduced previously in Falk%DIFDELCMD < & %%% Winther 2013 .
Revised:  A key tool to obtain this result is the properties of the bubble transform, introduced previously in %DIFDELCMD < & %%% Winther 2013 .
Edit intent: fluency
Original:  A key tool to obtain this result is the properties of the bubble transform, introduced previously in Falk%DIFDELCMD < & %%% Winther 2013 .
Revised:  A key tool to obtain this result is the properties of the bubble transform, introduced previously in Falk%DIFDELCMD < & %%% .
Edit intent: coherence
Original:  For high order methods the conditioning of the basis is likely to be important.
Revised:  When computing with high order piecewise polynomials the conditioning of the basis is likely to be important.
Edit intent: clarity
Original:  The main tools we will use for the construction is the bubble transform, introduced previously by Falk and Winther ( Found Comput Math (2016) 16: 297 ) , and properties of Jacobi polynomials on simplexes in higher dimensions.
Revised:  The main tools we will use for the construction is the bubble transform, introduced previously in Falk and Winther ( Found Comput Math (2016) 16: 297 ) , and properties of Jacobi polynomials on simplexes in higher dimensions.
Edit intent: clarity
Original:  The main tools we will use for the construction is the bubble transform, introduced previously by Falk and Winther ( Found Comput Math (2016) 16: 297 ) , and properties of Jacobi polynomials on simplexes in higher dimensions.
Revised:  The main tools we will use for the construction is the bubble transform, introduced previously by Falk and Winther , Found Comput Math (2016) 16: 297 ) , and properties of Jacobi polynomials on simplexes in higher dimensions.
Edit intent: fluency
Original:  The main tools we will use for the construction is the bubble transform, introduced previously by Falk and Winther ( Found Comput Math (2016) 16: 297 ) , and properties of Jacobi polynomials on simplexes in higher dimensions.
Revised:  The main tools we will use for the construction is the bubble transform, introduced previously by Falk and Winther ( Found Comput Math (2016) 16: 297 , and properties of Jacobi polynomials on simplexes in higher dimensions.
Edit intent: fluency
Original:  In this note, we present a method to analyse the spatiotemporal dynamics of seizures.
Edit intent: coherence
Original:  Spatiotemporal dynamics are modelled using a partial differential equation - in contrast to the ordinary differential equation used in our previous work on temporal estimation of seizure dynamics (Coorayet al 2015) .
Revised:  Spatiotemporal dynamics are modelled using a partial differential equation -- in contrast to the ordinary differential equation used in our previous work on temporal estimation of seizure dynamics (Coorayet al 2015) .
Edit intent: fluency
Original: We propose a rigorous characterization of what it means for a programming language to be memory safe, capturing the intuition that memory safety supports local reasoning about state.
Revised: We give a rigorous characterization of what it means for a programming language to be memory safe, capturing the intuition that memory safety supports local reasoning about state.
Edit intent: clarity
Original:  We formalize this principle in two different ways.
Revised:  We formalize this principle in two ways.
Edit intent: clarity
Original:  First, we show how a small memory-safe imperative language validates a noninterference property: parts of the state that are not reachable from a given part of the program can neither affect nor be affected by its execution .
Revised:  First, we show how a small memory-safe language validates a noninterference property: parts of the state that are not reachable from a given part of the program can neither affect nor be affected by its execution .
Edit intent: clarity
Original:  First, we show how a small memory-safe imperative language validates a noninterference property: parts of the state that are not reachable from a given part of the program can neither affect nor be affected by its execution .
Revised:  First, we show how a small memory-safe imperative language validates a noninterference property: a program can neither affect nor be affected by its execution .
Edit intent: clarity
Original:  First, we show how a small memory-safe imperative language validates a noninterference property: parts of the state that are not reachable from a given part of the program can neither affect nor be affected by its execution .
Revised:  First, we show how a small memory-safe imperative language validates a noninterference property: parts of the state that are not reachable from a given part of the program can neither affect nor be affected by unreachable parts of the state .
Edit intent: clarity
Original:  Second, we show how to take advantage of memory safety to extend separation logic, a framework for reasoning about heap-manipulating programs, with a  variant of its frame rule.
Revised:  Second, we extend separation logic, a framework for reasoning about heap-manipulating programs, with a variant of its frame rule.
Edit intent: clarity
Original:  Second, we show how to take advantage of memory safety to extend separation logic, a framework for reasoning about heap-manipulating programs, with a  variant of its frame rule.
Revised:  Second, we show how to take advantage of memory safety to extend separation logic, a proof system for heap-manipulating programs, with a variant of its frame rule.
Edit intent: clarity
Original:  Second, we show how to take advantage of memory safety to extend separation logic, a framework for reasoning about heap-manipulating programs, with a  variant of its frame rule.
Revised:  Second, we show how to take advantage of memory safety to extend separation logic, a framework for reasoning about heap-manipulating programs, with a memory-safe variant of its frame rule.
Edit intent: clarity
Original:  Our new rule is stronger because it applies even when parts of the program are buggy or malicious, but also weaker because it requires a stricter form of separation between parts of the program state.
Revised:  The new rule is stronger because it applies even when parts of the program are buggy or malicious, but also weaker because it requires a stricter form of separation between parts of the program state.
Edit intent: fluency
Original:  Our new rule is stronger because it applies even when parts of the program are buggy or malicious, but also weaker because it requires a stricter form of separation between parts of the program state.
Revised:  Our new rule is stronger because it applies even when parts of the program are buggy or malicious, but also weaker because it demands a stricter form of separation between parts of the program state.
Edit intent: fluency
Original:  We also consider a number of pragmatically motivated variations of memory safety and the reasoning principles they support.
Revised:  We also consider a number of pragmatically motivated variations on memory safety and the reasoning principles they support.
Edit intent: fluency
Original: We consider the problem of finding the spectrum of an operator taking the form of a low-rank (rank one or two) non-normal perturbation of a self-adjoint operator, motivated by a number of problems of applied interest which take this form.
Revised: We consider the problem of finding the spectrum of an operator taking the form of a low-rank (rank one or two) non-normal perturbation of a well-understood operator, motivated by a number of problems of applied interest which take this form.
Edit intent: clarity
Original:  We use the fact that the system is a low rank perturbation of a symmetric problem, together with a simple idea of classical differential geometry (the envelope of a family of curves) to completely analyze the spectrum of this type of operator .
Revised:  We use the fact that the system is a low rank perturbation of a solved problem, together with a simple idea of classical differential geometry (the envelope of a family of curves) to completely analyze the spectrum of this type of operator .
Edit intent: clarity
Original:  We use the fact that the system is a low rank perturbation of a symmetric problem, together with a simple idea of classical differential geometry (the envelope of a family of curves) to completely analyze the spectrum of this type of operator .
Revised:  We use the fact that the system is a low rank perturbation of a symmetric problem, together with a simple idea of classical differential geometry (the envelope of a family of curves) to completely analyze the spectrum .
Edit intent: clarity
Original:  In this paper, we focus on two high level features, the object and the background, and assume that the semantic information of images is a good cue for emotion prediction .
Revised:  In this paper, we focus on two high level features, the object and the background, and assume that the semantic information of images is a good cue for predicting emotion .
Edit intent: fluency
Original: Given a set V of n elements on m attributes, we want to find a partition of V on the minimum number of clusters such that the associated R-squared ratio is at least a given threshold.
Revised: Given a set V of n elements on m attributes, we want to find a partition of V on the minimum number of clusters such that the associated R-squared ratio is at least a given threshold.
Edit intent: fluency
Original:  We denote this problem as Goal Clustering (GC).
Revised:  We denote this problem as Goal Clustering (GC).
Edit intent: fluency
Original:  In effect, while in the k -means we set the number of clusters in advance and then test the associated R-squared ratio;
Revised:  In effect, while in the -means we set the number of clusters in advance and then test the associated R-squared ratio;
Edit intent: clarity
Original:  In effect, while in the k -means we set the number of clusters in advance and then test the associated R-squared ratio;
Revised:  In effect, while in the k k-means we set the number of clusters in advance and then test the associated R-squared ratio;
Edit intent: fluency
Original:  In effect, while in the k -means we set the number of clusters in advance and then test the associated R-squared ratio;
Revised:  In effect, while in the k -means we set the number of clusters in advance and then test the associated R-squared ratio;
Edit intent: fluency
Original:  in the GC we set an R-squared threshold lower limit in advance and minimize k.
Revised:  in the GC we set an R-squared threshold lower limit in advance and minimize k.
Edit intent: fluency
Original:  One is based on the Ward's construction and the other one resorts to the k -means method.
Revised:  One is based on the Ward's construction and the other one resorts to the -means method.
Edit intent: fluency
Original:  One is based on the Ward's construction and the other one resorts to the k -means method.
Revised:  One is based on the Ward's construction and the other one resorts to the k k-means method.
Edit intent: fluency
Original:  Finally, we discuss the consequences of our results for Colouring and Graph Isomorphism .
Revised:  Finally, we discuss the consequences of our results for the Colouring problem .
Edit intent: clarity
Original:  The main contribution of this work is a new criterion to aggressively prune useless branches in the exhaustive search, thus leading to the computation of new optimal formulae, in particular for the short product modulo X^5 and the circulant product modulo (X^5 -1 ).
Revised:  The main contribution of this work is a new criterion to aggressively prune useless branches in the exhaustive search, thus leading to the computation of new optimal formulae, in particular for the short product modulo X^5 and the circulant product modulo (X^5 - 1 ).
Edit intent: fluency
Original:  The main contribution of this work is a new criterion to aggressively prune useless branches in the exhaustive search, thus leading to the computation of new optimal formulae, in particular for the short product modulo X ^5 and the circulant product modulo (X ^5 - 1).
Revised:  The main contribution of this work is a new criterion to aggressively prune useless branches in the exhaustive search, thus leading to the computation of new optimal formulae, in particular for the short product modulo X 5 and the circulant product modulo (X ^5 - 1).
Edit intent: clarity
Original:  Moreover , we are able to prove that there is essentially only one optimal decomposition of the product of 3 \times 2 by 2 \times 3 matrices up to the action of some group of automorphisms.
Revised:  Moreover , we are able to prove that there is essentially only one optimal decomposition of the product of 3 x 2 by 2 \times 3 matrices up to the action of some group of automorphisms.
Edit intent: clarity
Original:  Moreover , we are able to prove that there is essentially only one optimal decomposition of the product of 3 \times 2 by 2 \times 3 matrices up to the action of some group of automorphisms.
Revised:  Moreover , we are able to prove that there is essentially only one optimal decomposition of the product of 3 \times 2 by 2 x 3 matrices up to the action of some group of automorphisms.
Edit intent: coherence
Original: Near repeat (NR) is a well known phenomenon in crime analysis assuming that crime events exhibit cor- relations within a given time and space frame.
Revised: Near repeat (NR) is a well known phenomenon in crime analysis assuming that crime events exhibit correlations within a given time and space frame.
Edit intent: fluency
Original:  Cohesive subgraph approaches are applied to identify the event chains. k-clique, k-truss, k- core plus DBSCAN algorithms are implemented in sequence with respect to their varied range of ability to find cohesive subgraphs.
Revised:  Cohesive subgraph approaches are applied to identify the event chains. k-clique, k-truss, k-core plus DBSCAN algorithms are implemented in sequence with respect to their varied range of ability to find cohesive subgraphs.
Edit intent: fluency
Original:  Therefore, this paper aims at helping readers interested in learning the basic concepts of QoE-oriented wireless resources scheduling, as well as getting in touch with the present time research frontier.
Revised:  Therefore, this paper aims at helping readers interested in learning the basic concepts of QoE-oriented wireless resources scheduling, as well as getting in touch with its current research frontier.
Edit intent: clarity
Original: Essential genes constitute the core of genes which cannot be mutated too much nor lost along the adaptive evolutionary history of a species.
Revised: Essential genes constitute the core of genes which cannot be mutated too much nor lost along the evolutionary history of a species.
Edit intent: clarity
Original:  Confirming previous results on E- Coli , we show the existence of a universal exponential correlation between gene essentiality and conservation in bacteria.
Revised:  Confirming previous results on E. coli , we show the existence of a universal exponential correlation between gene essentiality and conservation in bacteria.
Edit intent: fluency
Original:  Confirming previous results on E- Coli , we show the existence of a universal exponential correlation between gene essentiality and conservation in bacteria.
Revised:  Confirming previous results on E- Coli , we show the existence of a universal exponential relation between gene essentiality and conservation in bacteria.
Edit intent: clarity
Original:  Moreover , we show that, within each bacterial genome, there are at least two groups of functionally distinct genes, characterised by different levels of conservation and codon bias: i) a core of essential genes, mainly related to cellular information processing;
Revised:  Moreover we show that, within each bacterial genome, there are at least two groups of functionally distinct genes, characterised by different levels of conservation and codon bias: i) a core of essential genes, mainly related to cellular information processing;
Edit intent: fluency
Original:  The genes in the first group are more retained among species, are subject to a relatively purifying conservative selection and display a more selected choice of synonymous codons.
Revised:  In particular, the genes in the first group are more retained among species, are subject to a relatively purifying conservative selection and display a more selected choice of synonymous codons.
Edit intent: coherence
Original:  The genes in the first group are more retained among species, are subject to a relatively purifying conservative selection and display a more selected choice of synonymous codons.
Revised:  The genes in the first group are more retained among species, are subject to a stronger purifying conservative selection and display a more selected choice of synonymous codons.
Edit intent: clarity
Original:  The genes in the first group are more retained among species, are subject to a relatively purifying conservative selection and display a more selected choice of synonymous codons.
Revised:  The genes in the first group are more retained among species, are subject to a relatively purifying conservative selection and display a more limited repertoire of synonymous codons.
Edit intent: clarity