wanyu/IteraTeR_v2 huggingface dataset:
Original:  We find that , compared to normal users, posts from Like Farms' accounts often consist of re-shared content, have fewer words and poor vocabulary, are targeted to a limited number of topics and generate more  comments and likes . Profiles used by Like Farms are also more likely to be tagged or tag their friends and their likes are concentrated toward specific pages.
Revised:  We find that like farm accounts tend to more often re-share content, use fewer words and poor vocabulary, are targeted to a limited number of topics and generate more comments and likes . Profiles used by Like Farms are also more likely to be tagged or tag their friends and their likes are concentrated toward specific pages.
Edit intent: clarity
Original:  We find that , compared to normal users, posts from Like Farms' accounts often consist of re-shared content, have fewer words and poor vocabulary, are targeted to a limited number of topics and generate more  comments and likes . Profiles used by Like Farms are also more likely to be tagged or tag their friends and their likes are concentrated toward specific pages.
Revised:  We find that , compared to normal users, posts from Like Farms' accounts often consist of re-shared content, have fewer words and poorer vocabulary, target fewer topics, and generate more comments and likes . Profiles used by Like Farms are also more likely to be tagged or tag their friends and their likes are concentrated toward specific pages.
Edit intent: clarity
Original: As businesses increasingly rely on social networking sites to engage with their customers, it is crucial to understand and counter reputation manipulation activities, including fraudulently boosting the number of Facebook page likes using so-called like farms.
Revised: As businesses increasingly rely on social networking sites to engage with their customers, it is crucial to understand and counter reputation manipulation activities, including fraudulently boosting the number of Facebook page likes using like farms.
Edit intent: clarity
Original:  Thus, social network operators have started to deploy various fraud detection algorithms such as graph clustering methods, however, with limited efficacy.
Revised:  To this end, several fraud detection algorithms such as graph clustering methods, however, with limited efficacy.
Edit intent: clarity
Original:  Next, we  analyze a wide range of features extracted from users' timeline posts, which we group into two main classes: lexical and interaction-based.
Revised:  Next, we analyze a wide range of features extracted from timeline posts, which we group into two main classes: lexical and interaction-based.
Edit intent: clarity
Original:  We find that like farm accounts tend to more often re-share content, use fewer words and poorer vocabulary, target fewer topics, and generate more (often duplicate) comments and likes compared to normal users.
Revised:  We find that like farm accounts tend to often re-share content, use fewer words and poorer vocabulary, target fewer topics, and generate more (often duplicate) comments and likes compared to normal users.
Edit intent: clarity
Original:  We find that like farm accounts tend to more often re-share content, use fewer words and poorer vocabulary, target fewer topics, and generate more (often duplicate) comments and likes compared to normal users.
Revised:  We find that like farm accounts tend to more often re-share content, use fewer words and poorer vocabulary, and more often generate duplicate comments and likes compared to normal users.
Edit intent: clarity
Original:  Using these timeline-based features , we experiment with machine learning algorithms to detect like farms accounts, obtaining appreciably high accuracy(as high as 99\% precision and 97\% recall) .
Revised:  We extract relevant lexical and non-lexical features and and use them to build a classifier to detect like farms accounts, obtaining appreciably high accuracy(as high as 99\% precision and 97\% recall) .
Edit intent: clarity
Original:  For example, in multilayer networks with a single "aspect" (i.e., type of layering), permuting vertex labels, layer labels, and both of types of layers each yield a different type of isomorphism .
Revised:  For example, in multilayer networks with a single aspect, permuting vertex labels, layer labels, and both of types of layers each yield a different type of isomorphism .
Edit intent: clarity
Original:  This thereby yields isomorphisms for multiplex networks, temporal networks, networks with both such features, and more.
Revised:  This thereby yields isomorphisms for multiplex networks, temporal networks, networks with both of these features, and more.
Edit intent: clarity
Original:  Multilayer network isomorphisms lead naturally to defining isomorphisms in any of the numerous types of network that can be represented as a multilayer network, and we thereby obtain isomorphisms for multiplex networks, temporal networks, networks with both of these features, and more.
Revised:  Multilayer network isomorphisms lead naturally to defining isomorphisms in any of the numerous types of networks that can be represented as a multilayer network, and we thereby obtain isomorphisms for multiplex networks, temporal networks, networks with both of these features, and more.
Edit intent: fluency
Original:  We reduce each of the multilayer network isomorphism problems to a graph isomorphism problem such that the size of the graph isomorphism problem grows linearly with the size of the multilayer network isomorphism problem.
Revised:  We reduce each of the multilayer network isomorphism problems to a graph isomorphism problem , where the size of the graph isomorphism problem grows linearly with the size of the multilayer network isomorphism problem.
Edit intent: clarity
Original:  Our theory lays a foundation for extending many network analysis methods such as motifs, graphlets, structural roles, and network alignment  to any multilayer network.
Revised:  Our theory lays a foundation for extending many network analysis methods --- including motifs, graphlets, structural roles, and network alignment to any multilayer network.
Edit intent: clarity
Original:  Our theory lays a foundation for extending many network analysis methods such as motifs, graphlets, structural roles, and network alignment  to any multilayer network.
Revised:  Our theory lays a foundation for extending many network analysis methods such as motifs, graphlets, structural roles, and network alignment --- to any multilayer network.
Edit intent: fluency
Original:  We demonstrate the extreme usefulness of this contribution by using it to obtain very simple solutions to ( nonlinear) PDEs .
Revised:  We demonstrate the usefulness of this contribution by using it to obtain very simple solutions to ( nonlinear) PDEs .
Edit intent: clarity
Original: Background : The fraction nonconforming is a key quality measure used in statistical quality control design in clinical laboratory medicine.
Revised:  The fraction nonconforming is a key quality measure used in statistical quality control design in clinical laboratory medicine.
Edit intent: coherence
Original:  Methods: The confidence bounds of normal populations of measurements for the fraction nonconforming each of the lower and upper quality specification limits when both the random and the systematic error are unknown can be calculated using the noncentral t-distribution, as it is described in detail and illustrated with examples . Results :
Revised:  The confidence bounds of normal populations of measurements for the fraction nonconforming each of the lower and upper quality specification limits when both the random and the systematic error are unknown can be calculated using the noncentral t-distribution, as it is described in detail and illustrated with examples . Results :
Edit intent: coherence
Original:  Focusing on three different languages (English, Chinese  and Japanese), this research analyses Weibo and Twitter accounts of major embassies and news agencies.
Revised:  Focusing on three different languages (English, Chinese , and Japanese), this research analyses Weibo and Twitter accounts of major embassies and news agencies.
Edit intent: fluency
Original: While recent advances in spatial and temporal networks have enabled researchers to more-accurately describe many real-world systems , existing models do not capture the combined constraint that space and time impose on the relationships and interactions present in a spatio-temporal complex network.
Revised: Recent advances in spatial and temporal networks have enabled researchers to more-accurately describe many real-world systems , existing models do not capture the combined constraint that space and time impose on the relationships and interactions present in a spatio-temporal complex network.
Edit intent: coherence
Original:  In this paper, we study the response of  spatio-temporal complex networks to random error and systematic attack .
Revised:  In this paper, we study the response of spatio-temporal networks to random error and systematic attack .
Edit intent: clarity
Original:  This model captures the property that,  in many real-world systems, interaction between nodes is non-instantaneous and governed by the space in which they are embedded.
Revised:  This model captures the property that, as in many real-world systems, interaction between nodes is non-instantaneous and governed by the space in which they are embedded.
Edit intent: coherence
Original:  Secondly, using numerical experiments on four empirical examples of such systems, we study the effect of node failure on a network's topological, temporal , and spatial structure.
Revised:  Through numerical experiments on four empirical examples of such systems, we study the effect of node failure on a network's topological, temporal , and spatial structure.
Edit intent: coherence
Original:  Secondly, using numerical experiments on four empirical examples of such systems, we study the effect of node failure on a network's topological, temporal , and spatial structure.
Revised:  Secondly, using numerical experiments on four empirical examples of such systems, we study the effect of node failure on a network's topological, temporal and spatial structure.
Edit intent: fluency
Original:  Finally, to identify weaknesses specific to the behaviour of a spatio-temporal system, we introduce centrality measures that evaluate the importance of a node as a structural bridge and its role in supporting temporally efficient flow through the network.
Revised:  Finally, to identify weaknesses specific to the behaviour of a spatio-temporal system, we introduce centrality measures that evaluate the importance of a node as a structural bridge and its role in supporting spatio-temporally efficient flows through the network.
Edit intent: fluency
Original:  We explore the disruption to each system caused by attack strategies based on each of these centrality measures.
Edit intent: clarity
Original:  This exposes the complex nature of fragility in a spatio-temporal system, showing that there is a variety of failure modes when a network is subject to systematic attack .
Revised:  This exposes the complex nature of fragility in a spatio-temporal system, showing that there is a variety of failure modes when a network is subject to systematic attacks .
Edit intent: fluency
Original:  We show that concentration can be restored if we regularize the degrees of such vertices, and one can do this is various ways.
Revised:  We show that concentration can be restored if we regularize the degrees of such vertices, and one can do this in various ways.
Edit intent: fluency
Original:  As an example, let us reweight or remove enough edges to make all degrees bounded above by O(d) where d=\max pn _{ij}.
Revised:  As an example, let us reweight or remove enough edges to make all degrees bounded above by O(d) where d=\max np _{ij}.
Edit intent: fluency
Original: M. xanthus cells self-organize into clusters, aligned cell groups, at various stages of its lifecycle.
Revised: Myxococcus xanthus cells self-organize into clusters, aligned cell groups, at various stages of its lifecycle.
Edit intent: clarity
Original: M. xanthus cells self-organize into clusters, aligned cell groups, at various stages of its lifecycle.
Revised: M. xanthus cells self-organize into aligned groups, clusters, at various stages of its lifecycle.
Edit intent: clarity
Original: M. xanthus cells self-organize into clusters, aligned cell groups, at various stages of its lifecycle.
Revised: M. xanthus cells self-organize into clusters, aligned cell groups, at various stages of their lifecycle.
Edit intent: fluency
Original:  Formation of these clusters is crucial for  complex dynamic multi-cellular behavior of these bacteria.
Revised:  Formation of these clusters is crucial for the complex dynamic multi-cellular behavior of these bacteria.
Edit intent: fluency
Original:  However  the mechanism underlying the cell alignment and clustering is not fully understood.
Revised:  However , the mechanism underlying the cell alignment and clustering is not fully understood.
Edit intent: coherence
Original:  We test this hypothesis using an agent-based simulation framework where each agent is based on  biophysical model of  individual M. xanthus cell.
Revised:  We test this hypothesis using an agent-based simulation framework in which each agent is based on biophysical model of individual M. xanthus cell.
Edit intent: fluency
Original:  We test this hypothesis using an agent-based simulation framework where each agent is based on  biophysical model of  individual M. xanthus cell.
Revised:  We test this hypothesis using an agent-based simulation framework where each agent is based on the biophysical model of individual M. xanthus cell.
Edit intent: fluency
Original:  We test this hypothesis using an agent-based simulation framework where each agent is based on  biophysical model of  individual M. xanthus cell.
Revised:  We test this hypothesis using an agent-based simulation framework where each agent is based on biophysical model of an individual M. xanthus cell.
Edit intent: fluency
Original:  However, by extending our model to introduce  observed ability of cells to lay and follow slime trails, we show that effective trail following leads to clusters in reversing cells.
Revised:  However, by extending our model to introduce the observed ability of cells to lay and follow slime trails, we show that effective trail following leads to clusters in reversing cells.
Edit intent: fluency
Original:  However, by extending our model to introduce  observed ability of cells to lay and follow slime trails, we show that effective trail following leads to clusters in reversing cells.
Revised:  However, by extending our model to introduce observed ability of cells to lay and follow slime trails, we show that effective trail-following leads to clusters in reversing cells.
Edit intent: clarity
Original:  Furthermore, we conclude that mechanical cell alignment combined with slime trail following by cells is sufficient to explain the distinct cell clustering behavior observed for wild-type and non-reversing M. xanthus mutants in recent experiments.
Revised:  Furthermore, we conclude that mechanical cell alignment combined with slime-trail-following is sufficient to explain the distinct cell clustering behavior observed for wild-type and non-reversing M. xanthus mutants in recent experiments.
Edit intent: clarity
Original:  Furthermore, we conclude that mechanical cell alignment combined with slime trail following by cells is sufficient to explain the distinct cell clustering behavior observed for wild-type and non-reversing M. xanthus mutants in recent experiments.
Revised:  Furthermore, we conclude that mechanical cell alignment combined with slime trail following by cells is sufficient to explain the distinct clustering behaviors observed for wild-type and non-reversing M. xanthus mutants in recent experiments.
Edit intent: fluency
Original:  Our results are robust to variation in model parameters, match with the experimentally observed trends and can be applicable to understand surface motility patterns of other bacterial species.
Revised:  Our results are robust to variation in model parameters, match the experimentally observed trends and can be applicable to understand surface motility patterns of other bacterial species.
Edit intent: fluency
Original:  Our results are robust to variation in model parameters, match with the experimentally observed trends and can be applicable to understand surface motility patterns of other bacterial species.
Revised:  Our results are robust to variation in model parameters, match with the experimentally observed trends and can be applied to understand surface motility patterns of other bacterial species.
Edit intent: fluency
Original: The Continuous Skolem Problem asks whether a real-valued function satisfying an ordinary linear differential equation has a zero in a given interval of real numbers.
Revised: The Continuous Skolem Problem asks whether a real-valued function satisfying a linear differential equation has a zero in a given interval of real numbers.
Edit intent: clarity
Original:  This is a fundamental reachability problem arising in the analysis of continuous linear dynamical systems, including linear hybrid automata and continuous-time Markov chains.
Revised:  This is a fundamental reachability problem for continuous linear dynamical systems, including linear hybrid automata and continuous-time Markov chains.
Edit intent: clarity
Original:  This is a fundamental reachability problem arising in the analysis of continuous linear dynamical systems, including linear hybrid automata and continuous-time Markov chains.
Revised:  This is a fundamental reachability problem arising in the analysis of continuous linear dynamical systems, such as linear hybrid automata and continuous-time Markov chains.
Edit intent: fluency
Original:  Not only is decidability of this problem open, but decidability is open even for the sub-problem in which a zero is sought in a bounded interval.
Revised:  Decidability of the problem is currently open---indeed decidability is open even for the sub-problem in which a zero is sought in a bounded interval.
Edit intent: clarity
Original:  In this paper we show decidability of the bounded problem subject to Schanuel's conjecture, a central conjecture in transcendental number theory.
Revised:  In this paper we show decidability of the bounded problem subject to Schanuel's Conjecture, a unifying conjecture in transcendental number theory.
Edit intent: clarity
Original: A navigational query on a graph database returns binary relations over the nodes of the graph.
Revised: Navigational graph queries are an important class of queries that can extract implicit binary relations over the nodes of the graph.
Edit intent: clarity
Original: Navigational graph queries are an important class of queries that can extract implicit binary relations over the nodes of input graphs.
Revised: Navigational graph queries are an important class of queries that canextract implicit binary relations over the nodes of input graphs.
Edit intent: fluency
Original:  for instance, some natural queries, like same generations-queries , are not expressible with regular expressions.
Revised:  for instance, some natural queries, like same generation-queries , are not expressible with regular expressions.
Edit intent: fluency
Original:  The cfSPARQL language is strictly more expressive than property paths and nested expressions.
Revised:  The cfSPARQL language is strictly more expressive than property paths and nested expressions.
Edit intent: fluency
Original:  However, because of homophily and selective exposure, users tend to connect with like-minded people and  read agreeable information only .
Revised:  However, because of homophily and selective exposure, users tend to connect with like-minded people and only read agreeable information only .
Edit intent: coherence
Original:  However, because of homophily and selective exposure, users tend to connect with like-minded people and  read agreeable information only .
Revised:  However, because of homophily and selective exposure, users tend to connect with like-minded people and read agreeable information .
Edit intent: clarity
Original: The first polynomial time delay algorithm for the Maximal Clique Listing (MCL) problem was given by Tsukiyama %DIFDELCMD < \etal %%%  in 1977.
Revised: The first polynomial time delay algorithm for the Maximal Clique Listing problem was given by Tsukiyama %DIFDELCMD < \etal %%% in 1977.
Edit intent: clarity
Original:  As any algorithm based on the Reverse Search paradigm, it performs a DFS visit of a directed tree (the RS-tree ) having the objects to be listed (\ie maximal cliques) as its nodes.
Revised:  As any algorithm based on the Reverse Search paradigm, it performs a DFS visit of a directed tree (the RS-tree ) having the objects to be listed (\ie maximal cliques) as its nodes.
Edit intent: fluency
Original:  The time delay is given by the cost of generating the next (or the first) child of a node and it is O(mn).
Revised:  The time delay is given by the cost of generating the next child of a node and it is O(mn).
Edit intent: clarity
Original:  With this, Tsukiyama's algorithm solves the%DIFDELCMD < {\mainproblem} %%% problem in O(Nmn) total time, where N is the number of maximal cliques.
Revised:  %DIFDELCMD < {\mainproblem} %%% problem in O(Nmn) total time, where N is the number of maximal cliques.
Edit intent: clarity
Original:  With this, Tsukiyama's algorithm solves the%DIFDELCMD < {\mainproblem} %%% problem in O(Nmn) total time, where N is the number of maximal cliques.
Revised:  With this, Tsukiyama's algorithm solves the%DIFDELCMD < {\mainproblem} %%% 
Edit intent: coherence
Original:  In this way, they reduced the cost for exploring the very same RS-tree down to O( Nn^{\omega .
Revised:  In this way, they reduced the cost for exploring the very same RS-tree down to O( n^{\omega .
Edit intent: fluency
Original:  In 2004, Makino and Uno sharpened the time delay to O(n^{\omega}) by fast matrix multiplication.
Revised:  In 2004, Makino and Uno sharpened the time delay to O(n^{\omega}) with fast matrix multiplication.
Edit intent: fluency
Original:  As any algorithm based on the Reverse Search paradigm, it performs a DFS visit of a directed tree (the RS-tree) having the objects to be listed ( %DIFDELCMD < \ie %%%  maximal cliques) as its nodes.
Revised:  As any algorithm falling within the Reverse Search paradigm, it performs a DFS visit of a directed tree (the RS-tree) having the objects to be listed ( %DIFDELCMD < \ie %%% maximal cliques) as its nodes.
Edit intent: clarity
Original:  As any algorithm based on the Reverse Search paradigm, it performs a DFS visit of a directed tree (the RS-tree) having the objects to be listed ( %DIFDELCMD < \ie %%%  maximal cliques) as its nodes.
Revised:  As any algorithm based on the Reverse Search paradigm, it performs a DFS visit of a directed tree (the RS-tree) having the objects to be listed ( %DIFDELCMD < \ie %%% i.e. maximal cliques) as its nodes.
Edit intent: coherence
Original:  In 2004, Makino and Uno sharpened the time delay to O(n^{\omega}) with fast matrix multiplication.
Revised:  In 2004, Makino and Uno sharpened the time delay to O(n^{\omega}) withsquare fast matrix multiplication.
Edit intent: clarity
Original:  According to the current upper bounds on fast matrix multiplication, with this the time delay goes from O(n^{2.3728639}) to O(n^{2.093362}).
Revised:  According to the current upper bounds on fast matrix multiplication, with this the time delay improves from O(n^{2.3728639}) to O(n^{2.093362}).
Edit intent: clarity
Original:  We illustrate that dynamical arrest in a highly confined space as a discriminating marker for genome organization, by modeling chromosome inside a nucleus as a self-avoiding homopolymer confined to a sphere of varying sizes.
Revised:  We illustrate dynamical arrest in a highly confined space as a discriminating marker for genome organization, by modeling chromosome inside a nucleus as a self-avoiding homopolymer confined to a sphere of varying sizes.
Edit intent: fluency