wanyu/IteraTeR_v2 huggingface dataset:
Original:  This goes along with a significant increased use of public broadcasting, newspapers and information provided by public organizations.
Revised:  This goes alongside a significant increased use of public broadcasting, newspapers and information provided by public organizations.
Edit intent: fluency
Original:  Second, the majority of 84\%  of the participants reported to be satisfied with the information supply during the Covid-19 crisis.
Revised:  Second, the majority ( 84\% of the participants reported to be satisfied with the information supply during the Covid-19 crisis.
Edit intent: clarity
Original:  Second, the majority of 84\%  of the participants reported to be satisfied with the information supply during the Covid-19 crisis.
Revised:  Second, the majority of 84\% ) of the participants reported to be satisfied with the information supply during the Covid-19 crisis.
Edit intent: fluency
Original:  Second, the majority of 84\%  of the participants reported to be satisfied with the information supply during the Covid-19 crisis.
Revised:  Second, the majority of 84\% of the participants reported being satisfied with the information supply during the Covid-19 crisis.
Edit intent: fluency
Original:  Participants that were less satisfied with the information supply during the Covid-19 crisis used  significantly less frequently reliable sources , specifically public television, national newspapers and information provided by public organizations.
Revised:  Participants who were less satisfied with the information supply during the Covid-19 crisis used significantly less frequently reliable sources , specifically public television, national newspapers and information provided by public organizations.
Edit intent: fluency
Original:  Participants that were less satisfied with the information supply during the Covid-19 crisis used  significantly less frequently reliable sources , specifically public television, national newspapers and information provided by public organizations.
Revised:  Participants that were less satisfied with the information supply during the Covid-19 crisis used reliable sources significantly less frequently reliable sources , specifically public television, national newspapers and information provided by public organizations.
Edit intent: fluency
Original:  Participants that were less satisfied with the information supply during the Covid-19 crisis used  significantly less frequently reliable sources , specifically public television, national newspapers and information provided by public organizations.
Revised:  Participants that were less satisfied with the information supply during the Covid-19 crisis used significantly less frequently , specifically public television, national newspapers and information provided by public organizations.
Edit intent: clarity
Original:  Third, the amount of Covid-19 related information during the peak of the crisis led for some participants to a feeling of information overload, which resulted in a reduction of information seeking and media use.
Revised:  Third, the amount of Covid-19-related information during the peak of the crisis led for some participants to a feeling of information overload, which resulted in a reduction of information seeking and media use.
Edit intent: fluency
Original:  Third, the amount of Covid-19 related information during the peak of the crisis led for some participants to a feeling of information overload, which resulted in a reduction of information seeking and media use.
Revised:  Third, the amount of Covid-19 related information during the peak of the crisis led some participants to a feeling of information overload, which resulted in a reduction of information seeking and media use.
Edit intent: clarity
Original:  Participants who were less satisfied with the information supply during the Covid-19 crisis used reliable sources significantly less frequently, specifically public television, national newspapers and information provided by public organizations.
Revised:  Participants who were less satisfied with the information supply used reliable sources significantly less frequently, specifically public television, national newspapers and information provided by public organizations.
Edit intent: clarity
Original:  Third, the amount of Covid-19-related information during the peak of the crisis led some participants to a feeling of information overload, which resulted in a reduction of information seeking and media use.
Revised:  Third, the amount of Covid-19-related information led some participants to a feeling of information overload, which resulted in a reduction of information seeking and media use.
Edit intent: clarity
Original:  We adopt the integral definition of the fractional Laplacian and establish the well-posedness of a fractional semilinear PDE;
Revised:  We establish the well-posedness of a fractional semilinear PDE;
Edit intent: coherence
Original:  We thus derive the existence of optimal solutions and first and second order optimality conditions for our optimal control problem;
Revised:  Within the setting of our optimal control problem, we derive the existence of optimal solutions and first and second order optimality conditions for our optimal control problem;
Edit intent: clarity
Original:  We thus derive the existence of optimal solutions and first and second order optimality conditions for our optimal control problem;
Revised:  We thus derive the existence of optimal solutions as well as first and second order optimality conditions for our optimal control problem;
Edit intent: clarity
Original:  the state and adjoint equations are discretized via piecewise linear finite elements.
Revised:  the state and adjoint equations are discretized with continuous piecewise linear finite elements.
Edit intent: clarity
Original:  We analyze convergence properties of discretizations and obtain a priori error estimates.
Revised:  We analyze convergence properties of discretizations and derive a priori error estimates.
Edit intent: fluency
Original:  We present a multi-stage user study focusing on 4 factors---distribution size of clusters, number of points, size of points, and opacity of points---that influence cluster identification in scatterplots.
Revised:  We present a multi-stage user study focusing on four factors---distribution size of clusters, number of points, size of points, and opacity of points---that influence cluster identification in scatterplots.
Edit intent: fluency
Original:  From these parameters, we have constructed 2 models, a distance-based model, and a density-based model, using the merge tree data structure from Topological Data Analysis.
Revised:  From these parameters, we have constructed two models, a distance-based model, and a density-based model, using the merge tree data structure from Topological Data Analysis.
Edit intent: fluency
Original: We introduce a new quadrature method for the discretization of boundary integral equations (BIEs) on closed smooth contours in the plane  .
Revised: A high-order accurate quadrature rule for the discretization of boundary integral equations (BIEs) on closed smooth contours in the plane .
Edit intent: clarity
Original:  A naive method for inferring functional connections is to stimulate each individual neuron multiple times and observe the responses of cells in the local network, but this approach scales poorly with the number of neurons.
Edit intent: coherence
Original: Lateral movement of advanced persistent threats (APTs) has posed a severe security challenge.
Revised: Lateral movement of advanced persistent threats has posed a severe security challenge.
Edit intent: clarity
Original:  Static segregation at separate times and spatial locations is not sufficient to protect valuable assets from stealthy and persistent attackers.
Revised:  Due to the stealthy and persistent attackers.
Edit intent: clarity
Original:  Defenders need to consider time and stages holistically to discover the latent attack path across a large time-scale and achieve long-term security for the target assets.
Revised:  Defenders need to consider time and spatial locations holistically to discover the latent attack path across a large time-scale and achieve long-term security for the target assets.
Edit intent: clarity
Original:  Defenders need to consider time and stages holistically to discover the latent attack path across a large time-scale and achieve long-term security for the target assets.
Revised:  Defenders need to consider time and stages holistically to discover latent attack paths across a large time-scale and achieve long-term security for the target assets.
Edit intent: fluency
Original:  In this work, we propose a random time-expanded  network to model the stochastic service requests in the enterprise network and the persistent lateral movementover stages .
Revised:  In this work, we propose a time-expanded network to model the stochastic service requests in the enterprise network and the persistent lateral movementover stages .
Edit intent: clarity
Original:  Based on the probability of service links and the likelihood of successful compromises, the defender can design the optimal honeypot policy that minimizes the long-term cyber risks of the target assetsand the probability of interference and roaming cost.
Revised:  Based on the probability of service links and the probability of interference and roaming cost.
Edit intent: clarity
Original:  It surprisingly turns out that one of such equivalent conditions applies the semidefinite programming (SDP) , which leads to a practical usefulness.
Revised:  Interestingly, one of such equivalent conditions applies the semidefinite programming (SDP) , which leads to a practical usefulness.
Edit intent: coherence
Original:  As a consequence, this certainly solves such SDC-problem for collections of real symmetric matrices listed in J-B . Hiriart-Urruty, Potpourri of conjectures and open questions in nonlinear analysis and optimization,SIAM Review 49 (  2) , 2007 . Corresponding algorithms and illustrating examples by hand/coding  are also presented.
Revised:  As a consequence, this certainly solves such SDC-problem for collections of real symmetric matrices listed in . Hiriart-Urruty, Potpourri of conjectures and open questions in nonlinear analysis and optimization,SIAM Review 49 ( 2) , 2007 . Corresponding algorithms and illustrating examples by hand/coding are also presented.
Edit intent: coherence
Original:  As a consequence, this certainly solves such SDC-problem for collections of real symmetric matrices listed in J-B . Hiriart-Urruty, Potpourri of conjectures and open questions in nonlinear analysis and optimization,SIAM Review 49 (  2) , 2007 . Corresponding algorithms and illustrating examples by hand/coding  are also presented.
Revised:  As a consequence, this certainly solves such SDC-problem for collections of real symmetric matrices listed in J-B . SIAM Review 49 ( 2) , 2007 . Corresponding algorithms and illustrating examples by hand/coding are also presented.
Edit intent: coherence
Original:  As a consequence, this certainly solves such SDC-problem for collections of real symmetric matrices listed in J-B . Hiriart-Urruty, Potpourri of conjectures and open questions in nonlinear analysis and optimization,SIAM Review 49 (  2) , 2007 . Corresponding algorithms and illustrating examples by hand/coding  are also presented.
Revised:  As a consequence, this certainly solves such SDC-problem for collections of real symmetric matrices listed in J-B . Hiriart-Urruty, Potpourri of conjectures and open questions in nonlinear analysis and optimization, 49 ( 2) , 2007 . Corresponding algorithms and illustrating examples by hand/coding are also presented.
Edit intent: coherence
Original:  As a consequence, this certainly solves such SDC-problem for collections of real symmetric matrices listed in J-B . Hiriart-Urruty, Potpourri of conjectures and open questions in nonlinear analysis and optimization,SIAM Review 49 (  2) , 2007 . Corresponding algorithms and illustrating examples by hand/coding  are also presented.
Revised:  As a consequence, this certainly solves such SDC-problem for collections of real symmetric matrices listed in J-B . Hiriart-Urruty, Potpourri of conjectures and open questions in nonlinear analysis and optimization,SIAM Review 49 ( 2) . Corresponding algorithms and illustrating examples by hand/coding are also presented.
Edit intent: coherence
Original:  As a consequence, this certainly solves such SDC-problem for collections of real symmetric matrices listed in J-B . Hiriart-Urruty, Potpourri of conjectures and open questions in nonlinear analysis and optimization,SIAM Review 49 (  2) , 2007 . Corresponding algorithms and illustrating examples by hand/coding  are also presented.
Revised:  As a consequence, this certainly solves such SDC-problem for collections of real symmetric matrices listed in J-B . Hiriart-Urruty, Potpourri of conjectures and open questions in nonlinear analysis and optimization,SIAM Review 49 ( 2) , 2007 . Corresponding algorithms and illustrating examples by hand/coding in are also presented.
Edit intent: fluency
Original: Scores based on Shapley values are currently widely used for providing explanations to classification results over machine learning models.
Revised: Scores based on Shapley values are widely used for providing explanations to classification results over machine learning models.
Edit intent: clarity
Original:  A prime example of this corresponds to the influential SHAP-score, a version of the Shapley value in which the contribution of a set S of features from a given entity e over a model M is defined as the expected value in M of the set of entities e' that coincide with e over all features in S . While in general computing Shapley values is a computationally intractable problem, it has recently been claimed that the SHAP-score can be computed in polynomial time over the class of decision trees.
Revised:  A prime example of this is the influential SHAP-score, a version of the Shapley value in which the contribution of a set S of features from a given entity e over a model M is defined as the expected value in M of the set of entities e' that coincide with e over all features in S . While in general computing Shapley values is a computationally intractable problem, it has recently been claimed that the SHAP-score can be computed in polynomial time over the class of decision trees.
Edit intent: clarity
Original:  A prime example of this corresponds to the influential SHAP-score, a version of the Shapley value in which the contribution of a set S of features from a given entity e over a model M is defined as the expected value in M of the set of entities e' that coincide with e over all features in S . While in general computing Shapley values is a computationally intractable problem, it has recently been claimed that the SHAP-score can be computed in polynomial time over the class of decision trees.
Revised:  A prime example of this corresponds to the influential SHAP-score, a version of the Shapley value that can help explain the result of a learned model on a specific entity by assigning a score to every feature . While in general computing Shapley values is a computationally intractable problem, it has recently been claimed that the SHAP-score can be computed in polynomial time over the class of decision trees.
Edit intent: clarity
Original:  In this paper, we provide a proof of a stronger result over Boolean models: the SHAP-score can be computed in polynomial time over deterministic and decomposable Boolean circuits  , also known as tractable probabilistic circuits.
Revised:  In this paper, we provide a proof of a stronger result over Boolean models: the SHAP-score can be computed in polynomial time over deterministic and decomposable Boolean circuits . Such circuits , also known as tractable probabilistic circuits.
Edit intent: clarity
Original:  Such circuits encompass a wide range of Boolean circuits and binary decision diagrams classes, including binary decision trees and Ordered Binary Decision Diagrams (OBDDs) . Moreover, we establish the computational limits of the notion of SHAP-score by showing that computing it over a class of Boolean models is always (polynomially ) as hard as the model counting problem for this class(under some mild condition) .
Revised:  Such circuits encompass a wide range of Boolean circuits and binary decision diagrams classes, including binary decision trees , Ordered Binary Decision Diagrams (OBDDs) . Moreover, we establish the computational limits of the notion of SHAP-score by showing that computing it over a class of Boolean models is always (polynomially ) as hard as the model counting problem for this class(under some mild condition) .
Edit intent: fluency
Original:  Such circuits encompass a wide range of Boolean circuits and binary decision diagrams classes, including binary decision trees and Ordered Binary Decision Diagrams (OBDDs) . Moreover, we establish the computational limits of the notion of SHAP-score by showing that computing it over a class of Boolean models is always (polynomially ) as hard as the model counting problem for this class(under some mild condition) .
Revised:  Such circuits encompass a wide range of Boolean circuits and binary decision diagrams classes, including binary decision trees and Ordered Binary Decision Diagrams (OBDDs) . Moreover, we establish the computational limits of the notion of SHAP-score by observing that, under a mild condition, computing it over a class of Boolean models is always (polynomially ) as hard as the model counting problem for this class(under some mild condition) .
Edit intent: clarity
Original:  Such circuits encompass a wide range of Boolean circuits and binary decision diagrams classes, including binary decision trees and Ordered Binary Decision Diagrams (OBDDs) . Moreover, we establish the computational limits of the notion of SHAP-score by showing that computing it over a class of Boolean models is always (polynomially ) as hard as the model counting problem for this class(under some mild condition) .
Revised:  Such circuits encompass a wide range of Boolean circuits and binary decision diagrams classes, including binary decision trees and Ordered Binary Decision Diagrams (OBDDs) . Moreover, we establish the computational limits of the notion of SHAP-score by showing that computing it over a class of Boolean models is always polynomially as hard as the model counting problem for this class(under some mild condition) .
Edit intent: fluency
Original: Fake news becomes a palpable potential risk to society because of the growing use of mobile devices and the immense increase in Internet access across the world .
Revised: Fake news can have a significant negative impact on society because of the growing use of mobile devices and the immense increase in Internet access across the world .
Edit intent: clarity
Original: Fake news becomes a palpable potential risk to society because of the growing use of mobile devices and the immense increase in Internet access across the world .
Revised: Fake news becomes a palpable potential risk to society because of the growing use of mobile devices and the worldwide increase in Internet access across the world .
Edit intent: clarity
Original: Fake news becomes a palpable potential risk to society because of the growing use of mobile devices and the immense increase in Internet access across the world .
Revised: Fake news becomes a palpable potential risk to society because of the growing use of mobile devices and the immense increase in Internet access .
Edit intent: clarity
Original:  It is  essential to develop a simple mathematical model to understand the mechanism of the online dissemination of fake news.
Revised:  It is therefore essential to develop a simple mathematical model to understand the mechanism of the online dissemination of fake news.
Edit intent: coherence
Original:  It is  essential to develop a simple mathematical model to understand the mechanism of the online dissemination of fake news.
Revised:  It is essential to develop a simple mathematical model to understand the online dissemination of fake news.
Edit intent: clarity
Original:  In this paper , we propose a point process model for predicting the spreading of the fake news on Twitter.
Revised:  In this study , we propose a point process model for predicting the spreading of the fake news on Twitter.
Edit intent: clarity
Original:  In this paper , we propose a point process model for predicting the spreading of the fake news on Twitter.
Revised:  In this paper , we propose a point process model of the spread of fake news on Twitter.
Edit intent: clarity
Original:  This model describes the cascade as a two-stage process: initially, a cascade spreads as an ordinary newsstory;
Revised:  The proposed model describes the cascade as a two-stage process: initially, a cascade spreads as an ordinary newsstory;
Edit intent: clarity
Original:  We validate this model through the collection of two datasets of fake news cascades from Twitter.
Revised:  We validate this model using two datasets of fake news cascades from Twitter.
Edit intent: clarity
Original:  We validate this model through the collection of two datasets of fake news cascades from Twitter.
Revised:  We validate this model through the collection of two datasets of fake news items spread on Twitter.
Edit intent: clarity
Original:  The proposed model contributes to understand the dynamics of fake news spread in social mediaand is potentially advantageous in extracting a compact representation of the temporal information of the cascades .
Revised:  The proposed model contributes to understanding the dynamics of fake news spread in social mediaand is potentially advantageous in extracting a compact representation of the temporal information of the cascades .
Edit intent: fluency
Original:  The proposed model contributes to understand the dynamics of fake news spread in social mediaand is potentially advantageous in extracting a compact representation of the temporal information of the cascades .
Revised:  The proposed model contributes to understand the dynamics of the spread of fake news on social media. Its ability to extract a compact representation of the temporal information of the cascades .
Edit intent: clarity
Original:  The proposed model contributes to understand the dynamics of fake news spread in social mediaand is potentially advantageous in extracting a compact representation of the temporal information of the cascades .
Revised:  The proposed model contributes to understand the dynamics of fake news spread in social mediaand is potentially advantageous in extracting a compact representation of the spreading pattern could be useful in the detection and mitigation of fake news .
Edit intent: clarity
Original: The main aim of this paper is to develop a new algorithm for computing Nonnegative Low Rank Tensor (NLRT) approximation for nonnegative tensors that arise in many multi-dimensional imaging applications.
Revised: The main aim of this paper is to develop a new algorithm for computing nonnegative low rank tensor approximation for nonnegative tensors that arise in many multi-dimensional imaging applications.
Edit intent: clarity
Original:  Nonnegativity is one of the important property as each pixel value refer to nonzero light intensity in image data acquisition.
Revised:  Nonnegativity is one of the important property as each pixel value refers to nonzero light intensity in image data acquisition.
Edit intent: fluency
Original:  We show the convergence of the alternating projection algorithm . Experimental results for synthetic data and multi-dimensional images are presented to demonstrate the performance of the proposed NLRT method is better than that of existing NTF methods.
Revised:  We show the convergence of the proposed manifold projection method is established . Experimental results for synthetic data and multi-dimensional images are presented to demonstrate the performance of the proposed NLRT method is better than that of existing NTF methods.
Edit intent: clarity