wanyu/IteraTeR_v2 huggingface dataset:
Original:  We show that if the binary representation of alpha consists of \Theta(n) blocks of zeros and ones, then addition by alpha causes a constant fraction of low Hamming weight integers to become high Hamming weight integers.
Revised:  We show that if the binary representation of \alpha consists of \Theta(n) blocks of zeros and ones, then addition by alpha causes a constant fraction of low Hamming weight integers to become high Hamming weight integers.
Edit intent: fluency
Original:  We show that if the binary representation of alpha consists of \Theta(n) blocks of zeros and ones, then addition by alpha causes a constant fraction of low Hamming weight integers to become high Hamming weight integers.
Revised:  We show that if the binary representation of alpha consists of \Theta(n) blocks of zeros and ones, then addition by \alpha causes a constant fraction of low Hamming weight integers to become high Hamming weight integers.
Edit intent: fluency
Original:  We then identify networks of amino acids with correlated motions and side chain conformations to reveal the mechanism by which effects of TR binding span the protein.
Revised:  We then identify networks of amino acids with correlated motions to reveal the mechanism by which effects of TR binding span the protein.
Edit intent: clarity
Original:  Usually, such a modular structure is uncovered by the optimisation of some quality function.
Revised:  Usually, such a modular structure is uncovered by the optimization of some quality function.
Edit intent: fluency
Original:  Although flawed, Modularity remains one of the most popular quality functions.
Revised:  Although flawed, modularity remains one of the most popular quality functions.
Edit intent: fluency
Original:  The Louvain algorithm was originally developed for optimising Modularity , but has been applied to a variety of methods.
Revised:  The Louvain algorithm was originally developed for optimizing modularity , but has been applied to a variety of methods.
Edit intent: fluency
Original:  We here suggest to consider moving nodes to the community of a random neighbour , instead of the best neighbouring community.
Revised:  We here suggest to consider moving nodes to a random neighbor community , instead of the best neighbouring community.
Edit intent: clarity
Original:  We here suggest to consider moving nodes to the community of a random neighbour , instead of the best neighbouring community.
Revised:  We here suggest to consider moving nodes to the community of a random neighbour , instead of the best neighbor community.
Edit intent: fluency
Original:  Although incredibly simple, it reduces the theoretical runtime complexity from O (m) to O (n \log <k > \langle \rangle ) in networks with a clear community structure.
Revised:  Although incredibly simple, it reduces the theoretical runtime complexity from O (m) to O (n \log \langle \rangle ) in networks with a clear community structure.
Edit intent: clarity
Original:  In benchmark networks, resembling real networks more closely, it speeds up the algorithm roughly 2-3 times .
Revised:  In benchmark networks, it speeds up the algorithm roughly 2-3 times .
Edit intent: clarity
Original:  This is due to two factors: (1) a random neighbour is likely to be in a "good" community;
Revised:  This is due to two factors: (1) a random neighbor is likely to be in a "good" community;
Edit intent: fluency
Original:  and (2) random neighbours are likely to be hubs, helping the convergence.
Revised:  and (2) random neighbors are likely to be hubs, helping the convergence.
Edit intent: fluency
Original:  Finally, the performance gain only slightly diminishes the quality, thus providing an excellent quality-performance ratio.
Revised:  Finally, the performance gain only slightly diminishes the quality, especially for modularity, thus providing a good quality-performance ratio.
Edit intent: clarity
Original:  However, these gains do not seem to hold up when detecting small communities in large graphs .
Revised:  However, these gains are less pronounced, or even disappear, for some other measures such as significance or surprise .
Edit intent: coherence
Original: We first show, for general l_p-norms, the equivalence between d-flattenability of G and the convexity of d-dimensional, inherent Cayley configuration spaces for all subgraphs of G ( for the l_2 norm , one direction was proven before).
Revised: We consider a generalization of the concept of d-flattenability of G and the convexity of d-dimensional, inherent Cayley configuration spaces for all subgraphs of G ( for the l_2 norm , one direction was proven before).
Edit intent: clarity
Original: We first show, for general l_p-norms, the equivalence between d-flattenability of G and the convexity of d-dimensional, inherent Cayley configuration spaces for all subgraphs of G ( for the l_2 norm , one direction was proven before).
Revised: We first show, for general l_p-norms, the equivalence between d-flattenability of graphs - introduced for the l_2 norm , one direction was proven before).
Edit intent: clarity
Original:  As a corollary, it follows that both properties are minor-closed for general l_p norms . Using the natural\le  notions of genericity and rigidity matrices introduced by Kitson for frameworks in l_p, we show that: d-flattenability is not a generic property of frameworks (in arbitrary dimension) , and neither is the convexity of Cayley configuration spaces over specified non-edges of the d-dimensional framework ;
Revised:  As a corollary, it follows that both properties are minor-closed for general l_p norms . Using the natural\le notions of genericity , rigidity, and generic d-dimensional rigidity matroid introduced by Kitson for frameworks in l_p, we show that: d-flattenability is not a generic property of frameworks (in arbitrary dimension) , and neither is the convexity of Cayley configuration spaces over specified non-edges of the d-dimensional framework ;
Edit intent: clarity
Original:  As a corollary, it follows that both properties are minor-closed for general l_p norms . Using the natural\le  notions of genericity and rigidity matrices introduced by Kitson for frameworks in l_p, we show that: d-flattenability is not a generic property of frameworks (in arbitrary dimension) , and neither is the convexity of Cayley configuration spaces over specified non-edges of the d-dimensional framework ;
Revised:  As a corollary, it follows that both properties are minor-closed for general l_p norms . Using the natural\le notions of genericity and rigidity matrices introduced by Kitson for frameworks in l_p, we show that: d-flattenability is not a generic property of frameworks (in arbitrary dimension) , and neither is the convexity of Cayley configuration spaces over specified non-edges of a d-dimensional framework ;
Edit intent: fluency
Original:  existence of one , however is equivalent to  independence of the rows of its rigidity matrix -- a generic property of frameworks -- in d-dimensions;
Revised:  existence of one , however is equivalent to the independence of the rows of its rigidity matrix -- a generic property of frameworks -- in d-dimensions;
Edit intent: fluency
Original:  and rank of G in the d-dimensional rigidity matroid is equal to the dimension of the projection of the d-dimensional stratum of the l_p^p cone on the edges of G. Finally, we give stronger results for specific norms for d = 2: we show that  2-flattenable graphs for the l_1-norm (and l_\infty-norm) are a larger class than 2-flattenable graphs for Euclidean l_2-norm case ;
Revised:  and rank of G equals the dimension of the projection of the d-dimensional stratum of the l_p^p cone on the edges of G. Finally, we give stronger results for specific norms for d = 2: we show that 2-flattenable graphs for the l_1-norm (and l_\infty-norm) are a larger class than 2-flattenable graphs for Euclidean l_2-norm case ;
Edit intent: clarity
Original:  and rank of G in the d-dimensional rigidity matroid is equal to the dimension of the projection of the d-dimensional stratum of the l_p^p cone on the edges of G. Finally, we give stronger results for specific norms for d = 2: we show that  2-flattenable graphs for the l_1-norm (and l_\infty-norm) are a larger class than 2-flattenable graphs for Euclidean l_2-norm case ;
Revised:  and rank of G in the d-dimensional rigidity matroid is equal to the dimension of the projection of the d-dimensional stratum of the l_p^p distance cone. We give stronger results for specific norms for d = 2: we show that 2-flattenable graphs for the l_1-norm (and l_\infty-norm) are a larger class than 2-flattenable graphs for Euclidean l_2-norm case ;
Edit intent: clarity
Original:  This is equivalent to asking whether every hereditary class of unbounded clique-width has a labelled infinite antichain.
Revised:  This is equivalent to asking whether every hereditary class of unbounded clique-width must contain a labelled infinite antichain.
Edit intent: clarity
Original:  We believe the answer to this question is positive and propose a stronger conjecture stating that every minimal hereditary class of graphs  of unbounded clique-width has a canonical labelled infinite antichain .
Revised:  We believe the answer to this question is positive and propose a stronger conjecture : that every hereditary class of graphs of unbounded clique-width has a canonical labelled infinite antichain .
Edit intent: clarity
Original:  We believe the answer to this question is positive and propose a stronger conjecture stating that every minimal hereditary class of graphs  of unbounded clique-width has a canonical labelled infinite antichain .
Revised:  We believe the answer to this question is positive and propose a stronger conjecture stating that every minimal hereditary class of graphs of unbounded clique-width contains a canonical labelled infinite antichain .
Edit intent: clarity
Original:  We also prove that certain dynamic interval coloring problems are equivalent to the above question.
Edit intent: coherence
Original:  We show that treating \lambda = 1 as a critical point predicts the \lambda-dependence of the extinction probability also for more moderate \lambda-values.
Revised:  We show that treating \lambda = 1 as a critical point predicts the \lambda-dependence of the survival probability also for more moderate \lambda-values.
Edit intent: clarity
Original:  The critical exponent, however, depends on the underlying network.
Revised:  The exponent, however, depends on the underlying network.
Edit intent: clarity
Original: Adaptation of asexual populations is driven by beneficial mutations and therefore , its dynamics depend on the distribution of beneficial fitness effects.
Revised: Adaptation of asexual populations is driven by beneficial mutations and therefore the dynamics of this process, besides other factors, depend on the distribution of beneficial fitness effects.
Edit intent: clarity
Original:  This distribution, when the fitnesses are uncorrelated , can only be of three types .
Revised:  It is known that on uncorrelated fitness landscapes, this distribution can only be of three types .
Edit intent: clarity
Original:  The former quantity decreases or is a constant or increases depending on whether the fitness distribution of beneficial fitnesses is truncated or decays as an exponential or decays as a power law , respectively.
Revised:  The former quantity decreases or is a constant or increases depending on whether the fitness distribution decays as a power law , respectively.
Edit intent: clarity
Original:  We also find that the rate of adaptation shows a strong dependence on the number of mutants produced when the fitness distribution decays as a power law, but is affected weakly otherwise.
Revised:  We also find that the rate of change of fitness with time also shows quantitatively different behaviour for different beneficial fitness distributions. The patterns displayed by the two aforementioned quantities are found to hold for both low and high mutation rates.
Edit intent: clarity
Original:  We discuss how these qualitatively different trends can be exploited to determine the distribution of beneficial fitness effects in  experiments.
Revised:  We discuss how these patterns can be exploited to determine the distribution of beneficial fitness effects in experiments.
Edit intent: clarity
Original: Humanitarian and public institutions are increasingly relying on data from social media sites to measure public attitude , and provide timely public engagement.
Revised: Public institutions are increasingly relying on data from social media sites to measure public attitude , and provide timely public engagement.
Edit intent: clarity
Original: Humanitarian and public institutions are increasingly relying on data from social media sites to measure public attitude , and provide timely public engagement.
Revised: Humanitarian and public institutions are increasingly reliant on data from social media sites to measure public attitude , and provide timely public engagement.
Edit intent: fluency
Original: Humanitarian and public institutions are increasingly relying on data from social media sites to measure public attitude , and provide timely public engagement.
Revised: Humanitarian and public institutions are increasingly relying on data from social media sites to measure public attitude and provide timely public engagement.
Edit intent: fluency
Original:  Such engagement supports the exploration of public views on important social issues such as gender-based violence (GBV).
Revised:  Such reliance includes the exploration of public views on important social issues such as gender-based violence (GBV).
Edit intent: clarity
Original:  In this study, we examine Big (Social) Data consisting of nearly fourteen million tweets collected from the Twitter platform over a period of ten months to analyze public opinion regarding GBV, highlighting the nature of tweeting practices by geographical location and gender.
Revised:  In this study, we examine big (social) data consisting of nearly fourteen million tweets collected from the Twitter platform over a period of ten months to analyze public opinion regarding GBV, highlighting the nature of tweeting practices by geographical location and gender.
Edit intent: fluency
Original:  In this study, we examine Big (Social) Data consisting of nearly fourteen million tweets collected from the Twitter platform over a period of ten months to analyze public opinion regarding GBV, highlighting the nature of tweeting practices by geographical location and gender.
Revised:  In this study, we examine Big (Social) Data consisting of nearly fourteen million tweets collected from Twitter over a period of ten months to analyze public opinion regarding GBV, highlighting the nature of tweeting practices by geographical location and gender.
Edit intent: clarity
Original:  The exploitation of Big Data requires the techniques of Computational Social Science to mine insight from the corpus while accounting for the influence of both transient events and sociocultural factors.
Revised:  We demonstrate the utility of Computational Social Science to mine insight from the corpus while accounting for the influence of both transient events and sociocultural factors.
Edit intent: clarity
Original: We present a Bayesian approach to adapting parameters of a well-trained context-dependent  deep-neural-network hid-den Markov models (CD-DNN-HMMs ) to improve automatic speech recognition performance.
Revised: We present a Bayesian approach to adapting parameters of a well-trained context-dependent , deep-neural-network hid-den Markov models (CD-DNN-HMMs ) to improve automatic speech recognition performance.
Edit intent: fluency
Original: We present a Bayesian approach to adapting parameters of a well-trained context-dependent  deep-neural-network hid-den Markov models (CD-DNN-HMMs ) to improve automatic speech recognition performance.
Revised: We present a Bayesian approach to adapting parameters of a well-trained context-dependent deep-neural-network , hidden Markov model (CD-DNN-HMM ) to improve automatic speech recognition performance.
Edit intent: fluency
Original:  Due to an abundance of DNN parameters but with only a limited amount of adaptation data, the posterior probabilities of unseen CD states (senones) are often pushed towards zero during adaptation, and consequently the ability to model these senones can be degraded .
Revised:  Given an abundance of DNN parameters but with only a limited amount of adaptation data, the posterior probabilities of unseen CD states (senones) are often pushed towards zero during adaptation, and consequently the ability to model these senones can be degraded .
Edit intent: fluency
Original:  Due to an abundance of DNN parameters but with only a limited amount of adaptation data, the posterior probabilities of unseen CD states (senones) are often pushed towards zero during adaptation, and consequently the ability to model these senones can be degraded .
Revised:  Due to an abundance of DNN parameters but with only a limited amount of data, the posterior probabilities of unseen CD states (senones) are often pushed towards zero during adaptation, and consequently the ability to model these senones can be degraded .
Edit intent: fluency
Original:  Due to an abundance of DNN parameters but with only a limited amount of adaptation data, the posterior probabilities of unseen CD states (senones) are often pushed towards zero during adaptation, and consequently the ability to model these senones can be degraded .
Revised:  Due to an abundance of DNN parameters but with only a limited amount of adaptation data, the effectiveness of the adapted DNN model can often be compromised .
Edit intent: clarity
Original:  We formulate maximum a posteriori (MAP) adaptation of parameters of a specially designed CD-DNN-HMM with an augmented linear hidden networks connected to the output senones and compare it to the feature space maximum a posteriori linear regression previously proposed.
Revised:  We formulate maximum a posteriori (MAP) adaptation of parameters of a specially designed CD-DNN-HMM with an augmented linear hidden networks connected to the output tied states, or senones, and compare it to the feature space maximum a posteriori linear regression previously proposed.
Edit intent: clarity
Original:  We formulate maximum a posteriori (MAP) adaptation of parameters of a specially designed CD-DNN-HMM with an augmented linear hidden networks connected to the output senones and compare it to the feature space maximum a posteriori linear regression previously proposed.
Revised:  We formulate maximum a posteriori (MAP) adaptation of parameters of a specially designed CD-DNN-HMM with an augmented linear hidden networks connected to the output senones and compare it to feature space MAP linear regression previously proposed.
Edit intent: clarity
Original:  In supervised adaptation, the proposed MAP adaptation  provides more than 10\% relative error reduction and consistently outperforms the conventional transformation based methods.
Revised:  In supervised adaptation, the proposed MAP adaptation approach provides more than 10\% relative error reduction and consistently outperforms the conventional transformation based methods.
Edit intent: clarity
Original:  We introduce three new image datasets from Reddit  and define a virality score using Reddit metadata.
Revised:  We introduce three new image datasets from Reddit , and define a virality score using Reddit metadata.
Edit intent: fluency
Original:  Finally, we study how human prediction of image virality varies with different ' contexts' in which the images are viewed, such as the influence of neighbouring images, images recently viewed, as well as the image title or caption.
Revised:  Finally, we study how human prediction of image virality varies with different ` contexts' in which the images are viewed, such as the influence of neighbouring images, images recently viewed, as well as the image title or caption.
Edit intent: fluency
Original:  This work is a first step in understanding the complex but important phenomenon of relative image virality.
Revised:  This work is a first step in understanding the complex but important phenomenon of image virality.
Edit intent: clarity
Original:  We also theoretically prove the superiority of the aggregated system in terms of average system delay.
Edit intent: coherence
Original: Network maps of technology fields extracted from patent databases are useful to aid in technology forecasting and road mapping . Constructing such a  network requires a  measure of the relatedness between pairs of technology fields . Despite the existence of various relatedness measures in the literature, it is unclear how to consistently assess and compare them, and which ones to select for constructing  technology network maps.
Revised: Network maps of technology fields , which aim to aid in technology forecasting and road mapping . Constructing such a network requires a measure of the relatedness between pairs of technology fields . Despite the existence of various relatedness measures in the literature, it is unclear how to consistently assess and compare them, and which ones to select for constructing technology network maps.
Edit intent: clarity
Original: Network maps of technology fields extracted from patent databases are useful to aid in technology forecasting and road mapping . Constructing such a  network requires a  measure of the relatedness between pairs of technology fields . Despite the existence of various relatedness measures in the literature, it is unclear how to consistently assess and compare them, and which ones to select for constructing  technology network maps.
Revised: Network maps of technology fields extracted from patent databases are useful to aid in technology forecasting and road mapping . Constructing such a patent network requires a measure of the relatedness between pairs of technology fields . Despite the existence of various relatedness measures in the literature, it is unclear how to consistently assess and compare them, and which ones to select for constructing technology network maps.
Edit intent: fluency
Original: Network maps of technology fields extracted from patent databases are useful to aid in technology forecasting and road mapping . Constructing such a  network requires a  measure of the relatedness between pairs of technology fields . Despite the existence of various relatedness measures in the literature, it is unclear how to consistently assess and compare them, and which ones to select for constructing  technology network maps.
Revised: Network maps of technology fields extracted from patent databases are useful to aid in technology forecasting and road mapping . Constructing such a network requires a proper measure of the relatedness between pairs of technology fields . Despite the existence of various relatedness measures in the literature, it is unclear how to consistently assess and compare them, and which ones to select for constructing technology network maps.
Edit intent: clarity
Original: Network maps of technology fields extracted from patent databases are useful to aid in technology forecasting and road mapping . Constructing such a  network requires a  measure of the relatedness between pairs of technology fields . Despite the existence of various relatedness measures in the literature, it is unclear how to consistently assess and compare them, and which ones to select for constructing  technology network maps.
Revised: Network maps of technology fields extracted from patent databases are useful to aid in technology forecasting and road mapping . Constructing such a network requires a measure of the relatedness between pairs of technology fields . Despite the existence of various relatedness measures in the literature, it is unclear how to consistently assess and compare them, and which ones to select for constructing patent technology network maps.
Edit intent: fluency