wanyu/IteraTeR_v2 huggingface dataset:
Original:  These are characterized by the fact that the unrest has respectively a negative or positive feedback on the social tension (though no monotonicity condition is assumed).
Revised:  These are characterized by respectively a negative or positive feedback on the social tension (though no monotonicity condition is assumed).
Edit intent: clarity
Original:  The new results we derive in the present paper concern the behavior of the solution far from the propagating edge, that is, we give a description of the new regime of the system following the initial surge of activity.
Revised:  The new results we derive in the present paper concern the behavior of the system following an initial surge of activity.
Edit intent: clarity
Original:  Answering this problem accurately and efficiently is essential to  applications, such as density estimation, outlier detection, query optimization, and data integration.
Revised:  Answering this problem accurately and efficiently is essential to many applications, such as density estimation, outlier detection, query optimization, and data integration.
Edit intent: clarity
Original:  The estimation problem is especially challenging for large-scale high-dimensional data due to the curse of dimensionality, the  need to make the estimator consistent (i.e., the selectivity is non-decreasing w.r.t. the threshold) , and the large variance of selectivity across different queries .
Revised:  The estimation problem is especially challenging for large-scale high-dimensional data due to the curse of dimensionality, the large variance of selectivity across different queries, and the need to make the estimator consistent (i.e., the selectivity is non-decreasing w.r.t. the threshold) , and the large variance of selectivity across different queries .
Edit intent: fluency
Original:  The estimation problem is especially challenging for large-scale high-dimensional data due to the curse of dimensionality, the  need to make the estimator consistent (i.e., the selectivity is non-decreasing w.r.t. the threshold) , and the large variance of selectivity across different queries .
Revised:  The estimation problem is especially challenging for large-scale high-dimensional data due to the curse of dimensionality, the need to make the estimator consistent (i.e., the selectivity is non-decreasing in the threshold) , and the large variance of selectivity across different queries .
Edit intent: clarity
Original:  The estimation problem is especially challenging for large-scale high-dimensional data due to the curse of dimensionality, the  need to make the estimator consistent (i.e., the selectivity is non-decreasing w.r.t. the threshold) , and the large variance of selectivity across different queries .
Revised:  The estimation problem is especially challenging for large-scale high-dimensional data due to the curse of dimensionality, the need to make the estimator consistent (i.e., the selectivity is non-decreasing w.r.t. the threshold) .
Edit intent: coherence
Original:  We propose a new deep learning-based model that learns a query dependent piece-wise linear function as the estimator.
Revised:  We propose a new deep learning-based model that learns a query-dependent piecewise linear function as the estimator.
Edit intent: fluency
Original:  To improve the accuracy for large datasets, we propose to divide the dataset into multiple disjoint partitions and build a local model on each of them.
Revised:  To improve the accuracy for large datasets, we propose to partition the dataset into multiple disjoint partitions and build a local model on each of them.
Edit intent: clarity
Original:  To improve the accuracy for large datasets, we propose to divide the dataset into multiple disjoint partitions and build a local model on each of them.
Revised:  To improve the accuracy for large datasets, we propose to divide the dataset into multiple disjoint subsets and build a local model on each of them.
Edit intent: clarity
Original:  We perform experiments on real datasets and show that the proposed model guarantees the consistency and significantly outperforms state-of-the-art models in terms of both accuracy and efficiency.
Revised:  We perform experiments on real datasets and show that the proposed model significantly outperforms state-of-the-art models in terms of both accuracy and efficiency.
Edit intent: clarity
Original:  We perform experiments on real datasets and show that the proposed model significantly outperforms state-of-the-art models in accuracy and is competitive in efficiency .
Revised:  We perform experiments on real datasets and show that the proposed model significantly outperforms state-of-the-art models in accuracy in an efficient way and is useful for real applications .
Edit intent: clarity
Original:  The speed-ups are achieved by reducing the core of the underlying computational problems of the decoders to one common tool: computing left and right approximant bases of matrices over skew polynomial rings.
Revised:  The speed-ups are achieved by new algorithms that reduce the cores of the underlying computational problems of the decoders to one common tool: computing left and right approximant bases of matrices over skew polynomial rings.
Edit intent: clarity
Original:  To accomplish this, we describe a skew-analogue of the existing PM-Basis algorithm for matrices over usual polynomials.
Revised:  To accomplish this, we describe a skew-analogue of the existing PM-Basis algorithm for matrices over ordinary polynomials.
Edit intent: clarity
Original:  The new faster algorithms for the various decoding-related computational problems are interesting in their own and have further applications, in particular parts of decoders of several other codes and foundational problems related to the remainder-evaluation of skew polynomials.
Revised:  The new algorithms for the various decoding-related computational problems are interesting in their own and have further applications, in particular parts of decoders of several other codes and foundational problems related to the remainder-evaluation of skew polynomials.
Edit intent: clarity
Original: Balance theory explains the forces behind the structure of social systems  commonly modeled as static undirected signed networks.
Revised: Balance theory explains the forces behind the structure of social systems , which are commonly modeled as static undirected signed networks.
Edit intent: coherence
Original:  We expand the modeling to incorporate directionality of the edges and consider three levels of analysis: triads, subgroups, and the whole network.
Revised:  We expand this modeling approach to incorporate directionality of the edges and consider three levels of analysis: triads, subgroups, and the whole network.
Edit intent: clarity
Original:  We expand the modeling to incorporate directionality of the edges and consider three levels of analysis: triads, subgroups, and the whole network.
Revised:  We expand the modeling to incorporate directionality of edges, and consider three levels of analysis: triads, subgroups, and the whole network.
Edit intent: fluency
Original:  For network-level balance, we use the normalized line index which relies on the proportion of edges whose position suits balance.
Revised:  For network-level balance, we re-purpose the normalized line index which relies on the proportion of edges whose position suits balance.
Edit intent: clarity
Original:  Through extensive computational analysis, we document frequently repeated patterns of social structure in triads, subgroups, and the whole network across a range of social settings from college students and Wikipedia users to philosophers and Bitcoin traders.
Revised:  Through extensive computational analysis, we quantify and analyze patterns of social structure in triads, subgroups, and the whole network across a range of social settings from college students and Wikipedia users to philosophers and Bitcoin traders.
Edit intent: clarity
Original:  We then apply our multilevel framework  to examine balance in temporal and multilayer networks  which demonstrates the generalizability of our approach  and leads to new observations on balance with respect to time and layer dimensions.
Revised:  We then apply our multilevel framework of analysis to examine balance in temporal and multilayer networks which demonstrates the generalizability of our approach and leads to new observations on balance with respect to time and layer dimensions.
Edit intent: clarity
Original:  We then apply our multilevel framework  to examine balance in temporal and multilayer networks  which demonstrates the generalizability of our approach  and leads to new observations on balance with respect to time and layer dimensions.
Revised:  We then apply our multilevel framework to examine balance in temporal and multilayer networks , which demonstrates the generalizability of our approach and leads to new observations on balance with respect to time and layer dimensions.
Edit intent: fluency
Original:  Our complementary findings on a variety of social networks highlight the need to evaluate balance at different levels for which we propose a comprehensive yet parsimonious approach  .
Revised:  Our complementary findings on a variety of social networks highlight the need to evaluate balance at different levels . We propose a comprehensive yet parsimonious approach .
Edit intent: coherence
Original:  Our complementary findings on a variety of social networks highlight the need to evaluate balance at different levels for which we propose a comprehensive yet parsimonious approach  .
Revised:  Our complementary findings on a variety of social networks highlight the need to evaluate balance at different levels for which we propose a comprehensive yet parsimonious approach to address this need .
Edit intent: clarity
Original:  We argue that psychology and statistics theory would facilitate the development and adoption of valid and reliable instruments to assess these constructs.
Revised:  We argue that psychology and statistics theory can facilitate the development and adoption of valid and reliable instruments to assess these constructs.
Edit intent: clarity
Original:  We conducted a field survey of the psychology literature, including journal articles, textbooks, and society standards, framed by the Standards for Educational and Psychological Testing (American Educational Research Association et al  , 2014).
Revised:  We conducted a comprehensive review of the psychology literature, including journal articles, textbooks, and society standards, framed by the Standards for Educational and Psychological Testing (American Educational Research Association et al , 2014).
Edit intent: clarity
Original:  We conducted a field survey of the psychology literature, including journal articles, textbooks, and society standards, framed by the Standards for Educational and Psychological Testing (American Educational Research Association et al  , 2014).
Revised:  We conducted a field survey of the psychology literature, including journal articles, textbooks, and society standards, framed by the Standards for Educational and Psychological Testing (American Educational Research Association et al . , 2014).
Edit intent: fluency
Original:  To improve the quality of behavioral research  , we believe that studies focusing on introducing and psychometrically validating measurement instruments need to be more common.
Revised:  To improve the quality of behavioral research , we believe that studies focusing on introducing , validation, and then using psychometric instruments need to be more common.
Edit intent: clarity
Original: Humans are what constitutes the most complex and complicated, yet fascinating, component of a software engineering endeavor.
Edit intent: coherence
Original:  We argue that psychology and statistics theory can facilitate the development and adoption of valid and reliable instruments to assess these constructs.
Revised:  We argue that psychology and statistics theory can facilitate the systematic and sound development as well as the adoption of instruments (e.g., psychological tests, questionnaires) to assess these constructs.
Edit intent: clarity
Original:  In particular, to ensure high quality, the psychometric properties of measurement instruments need evaluation.
Revised:  In particular, to ensure high quality, the psychometric properties of instruments need evaluation.
Edit intent: clarity
Original:  In this paper, we provide an introduction to psychometric theory for the evaluation of measurement instruments (e.g., psychological tests and questionnaires) for software engineering researchers.
Revised:  In this paper, we provide an introduction to psychometric theory for the evaluation of measurement instruments for SE researchers.
Edit intent: clarity
Original:  We conducted a comprehensive review of the psychology literature , including journal articles, textbooks, and society standards, framed by the Standards for Educational and Psychological Testing (American Educational Research Association et al. , 2014).
Revised:  We conducted a comprehensive review of the psychology literature framed by the Standards for Educational and Psychological Testing (American Educational Research Association et al. , 2014).
Edit intent: coherence
Original:  We conducted a comprehensive review of the psychology literature , including journal articles, textbooks, and society standards, framed by the Standards for Educational and Psychological Testing (American Educational Research Association et al. , 2014).
Revised:  We conducted a comprehensive review of the psychology literature , including journal articles, textbooks, and society standards, framed by the Standards for Educational and Psychological Testing .
Edit intent: coherence
Original:  With this paper, we hope to encourage a culture change in software engineering research towards the adoption of established methods from social science .
Revised:  With this paper, we hope to encourage a culture change in SE research towards the adoption of established methods from social science .
Edit intent: clarity
Original:  To improve the quality of behavioral research in software engineering, we believe that studies focusing on introducing, validation , and then using psychometric instruments need to be more common .
Revised:  To improve the quality of behavioral research in SE, studies focusing on introducing, validation , and then using psychometric instruments need to be more common .
Edit intent: clarity
Original:  To improve the quality of behavioral research in software engineering, we believe that studies focusing on introducing, validation , and then using psychometric instruments need to be more common .
Revised:  To improve the quality of behavioral research in software engineering, we believe that studies focusing on introducing, validating , and then using psychometric instruments need to be more common .
Edit intent: fluency
Original:  Non-homogeneities in the basic parameters are easily included by integration for arbitrary distributions  of incubation and removal times , recovering the classical SEIR model under the assumption of exponential distributions .
Revised:  Non-homogeneities in the basic parameters are easily included by integration for arbitrary distributions of incubation and removal times .
Edit intent: clarity
Original:  We find good agreement in both cases with the uSEIR solution .
Revised:  We find good agreement in both cases .
Edit intent: clarity
Original:  A notable exception is recent work by Ubaru, Chen, and Saad on trace estimates for a matrix function f(A) with Rademacher random vectors.
Edit intent: coherence
Original: Conjunctive queries are one of the most common classes of queries used in database systems, and the best studied in the literature.
Revised: Conjunctive queries are one of the most common class of queries used in database systems, and the best studied in the literature.
Edit intent: fluency
Original:  As a corollary, it follows that a class of conjunctive queries over graphs admits an FPRAS if  and only if it has bounded treewidth (unless BPP%DIFDELCMD < \neqP%%% ) \neq P)}} . In fact, our FPRAS is more general, and also applies to conjunctive queries with bounded hypertree width, as well as unions of such queries.
Revised:  As a corollary, it follows that a class of conjunctive queries over graphs admits an FPRAS if , and only if it has bounded treewidth (unless BPP%DIFDELCMD < \neqP%%% ) \neq P)}} . In fact, our FPRAS is more general, and also applies to conjunctive queries with bounded hypertree width, as well as unions of such queries.
Edit intent: fluency
Original:  As a corollary, it follows that a class of conjunctive queries over graphs admits an FPRAS if  and only if it has bounded treewidth (unless BPP%DIFDELCMD < \neqP%%% ) \neq P)}} . In fact, our FPRAS is more general, and also applies to conjunctive queries with bounded hypertree width, as well as unions of such queries.
Revised:  As a corollary, it follows that a class of conjunctive queries over graphs admits an FPRAS if and only if it has bounded treewidth (unless %DIFDELCMD < \neqP%%% ) \neq P)}} . In fact, our FPRAS is more general, and also applies to conjunctive queries with bounded hypertree width, as well as unions of such queries.
Edit intent: clarity
Original:  We design optimal data-sharing schemes both for when they compete only with each other, and for when they additionally compete with an Amazon---a company with more, better data.
Revised:  We design optimal data-sharing schemes both for when they compete only with each other, and for when they additionally compete with an Amazon -- a company with more, better data.
Edit intent: fluency
Original: There has been limited success applying the Nash Bargaining Solution (NBS) in assigning intellectual property damages due to the difficulty of applying it to the specific facts of the case.
Revised: There has been limited success applying the Nash Bargaining Solution (NBS) in assigning intellectual property damages due to the difficulty of relating it to the specific facts of the case.
Edit intent: clarity
Original:  The intent of this paper is to bring clarity to the NBS so it can be applied to the facts of a case.
Revised:  This paper intends to bring clarity to the NBS so it can be applied to the facts of a case.
Edit intent: clarity
Original:  Several examples are shown demonstrating the use of this normalized form, and a nomograph is added for computational ease.
Revised:  Several examples demonstrate this normalized form, and a nomograph is added for computational ease.
Edit intent: clarity
Original:  Our contribution is to assess if there are scientific evidences that suggest a contact tracing app , using present technologies, could be effective to slow down the spread of the virus  .
Revised:  Our contribution is to assess if there are scientific evidences that suggest a contact tracing app in slowing down the spread of the virus .
Edit intent: clarity
Original:  Our conclusion is that such evidences are lacking, and we should re-think the introduction of such a privacy-invasive measure.
Revised:  Our conclusion is that such evidence is lacking, and we should re-think the introduction of such a privacy-invasive measure.
Edit intent: fluency
Original: Despite the great empirical success of adversarial training to defend deep learning models against adversarial perturbations, so far, it still remains rather unclear what the principles are behind the existence of adversarial perturbations, and what adversarial training does to the neural network to remove them.
Revised: Despite the empirical success of adversarial training to defend deep learning models against adversarial perturbations, so far, it still remains rather unclear what the principles are behind the existence of adversarial perturbations, and what adversarial training does to the neural network to remove them.
Edit intent: clarity
Original: Despite the great empirical success of adversarial training to defend deep learning models against adversarial perturbations, so far, it still remains rather unclear what the principles are behind the existence of adversarial perturbations, and what adversarial training does to the neural network to remove them.
Revised: Despite the great empirical success of using Adversarial Training to defend deep learning models against adversarial perturbations, so far, it still remains rather unclear what the principles are behind the existence of adversarial perturbations, and what adversarial training does to the neural network to remove them.
Edit intent: clarity
Original:  In this paper, we present a principle that we call "feature purification" , where we show the existence of adversarial examples are due to the accumulation of certain "dense mixtures " in the hidden weights during the training process of a neural network;
Revised:  In this paper, we present a principle that we call Feature Purification , where we show the existence of adversarial examples are due to the accumulation of certain "dense mixtures " in the hidden weights during the training process of a neural network;
Edit intent: fluency
Original:  In this paper, we present a principle that we call "feature purification" , where we show the existence of adversarial examples are due to the accumulation of certain "dense mixtures " in the hidden weights during the training process of a neural network;
Revised:  In this paper, we present a principle that we call "feature purification" , where we show the existence of adversarial examples is the accumulation of certain "dense mixtures " in the hidden weights during the training process of a neural network;
Edit intent: coherence
Original:  and more importantly, one of the goals of adversarial training is to remove such mixtures to "purify " hidden weights.
Revised:  and more importantly, one of the goals of adversarial training is to remove such mixtures to purify hidden weights.
Edit intent: fluency
Original:  We present both experiments on the CIFAR-10 dataset to illustrate this principle, and a Theoretical Result proving that for certain natural classification tasks, training a two-layer neural network with ReLU activation using randomly initialized gradient descent indeed satisfies this principle.
Revised:  We present both experiments on the CIFAR-10 dataset to illustrate this principle, and a theoretical result proving that for certain natural classification tasks, training a two-layer neural network with ReLU activation using randomly initialized gradient descent indeed satisfies this principle.
Edit intent: fluency
Original:  For example, two of the most widely used algorithms, the k-cores decomposition and the classic two-block model of Borgatti and Everett, extract fundamentally different structures: the former partitions a network into a binary hub-and-spoke layout, while the latter divides it into a layered hierarchy.
Revised:  For example, two of the most widely used algorithms, the k-cores decomposition and the classic two-block model of Borgatti and Everett, extract fundamentally different structures: the latter partitions a network into a binary hub-and-spoke layout, while the latter divides it into a layered hierarchy.
Edit intent: clarity
Original:  For example, two of the most widely used algorithms, the k-cores decomposition and the classic two-block model of Borgatti and Everett, extract fundamentally different structures: the former partitions a network into a binary hub-and-spoke layout, while the latter divides it into a layered hierarchy.
Revised:  For example, two of the most widely used algorithms, the k-cores decomposition and the classic two-block model of Borgatti and Everett, extract fundamentally different structures: the former partitions a network into a binary hub-and-spoke layout, while the former divides it into a layered hierarchy.
Edit intent: fluency
Original: Well known to the machine learning community, the random feature model , originally introduced by Rahimi and Recht in 2008, is a parametric approximation to kernel interpolation or regression methods.
Revised: Well known to the machine learning community, the random feature model is a parametric approximation to kernel interpolation or regression methods.
Edit intent: coherence