wanyu/IteraTeR_v2 huggingface dataset:
Original: As graph representations of data emerge in multiple domains, data analysts need to be able to  select among a magnitude of different graph inputs based on the effects they induce when a variety of operators are applied to them.
Revised: As graph representations of data emerge in multiple domains, data analysts need to be able to intelligently select among a magnitude of different graph inputs based on the effects they induce when a variety of operators are applied to them.
Edit intent: clarity
Original: As graph representations of data emerge in multiple domains, data analysts need to be able to  select among a magnitude of different graph inputs based on the effects they induce when a variety of operators are applied to them.
Revised: As graph representations of data emerge in multiple domains, data analysts need to be able to select among a magnitude of different data graphs based on the effects they induce when a variety of operators are applied to them.
Edit intent: clarity
Original: As graph representations of data emerge in multiple domains, data analysts need to be able to  select among a magnitude of different graph inputs based on the effects they induce when a variety of operators are applied to them.
Revised: As graph representations of data emerge in multiple domains, data analysts need to be able to select among a magnitude of different graph inputs based on the effects different graph operators have on them.
Edit intent: clarity
Original:  Exhaustive execution of an operator over the bulk of the available data sources is impractical due to the massive resources it requires.
Revised:  Exhaustive execution of an operator over the bulk of available data sources is impractical due to the massive resources it requires.
Edit intent: fluency
Original:  Our novel approach focuses on the inputs themselves, utilizing graph similarity to infer knowledge about multiple input graphs.
Revised:  Our novel approach focuses on the inputs themselves, utilizing graph similarity to infer knowledge about input graphs.
Edit intent: clarity
Original:  We also propose a family of similarity metrics based on the degree distribution that prove capable of producing high quality estimations, comparable or even surpassing a much more costly, state-of-the-art similarity metric .
Revised:  We also propose a family of similarity measures based on the degree distribution that prove capable of producing high quality estimations, comparable or even surpassing a much more costly, state-of-the-art similarity metric .
Edit intent: fluency
Original:  We also propose a family of similarity metrics based on the degree distribution that prove capable of producing high quality estimations, comparable or even surpassing a much more costly, state-of-the-art similarity metric .
Revised:  We also propose a family of similarity metrics based on the degree distribution that prove capable of producing high quality estimations, comparable or even surpassing other much more costly, state-of-the-art similarity metric .
Edit intent: clarity
Original:  We also propose a family of similarity metrics based on the degree distribution that prove capable of producing high quality estimations, comparable or even surpassing a much more costly, state-of-the-art similarity metric .
Revised:  We also propose a family of similarity metrics based on the degree distribution that prove capable of producing high quality estimations, comparable or even surpassing a much more costly, state-of-the-art similarity measures .
Edit intent: fluency
Original:  Basic experiments show SGA is competitive with recently proposed algorithms for finding local Nash equilibria in GANs -- whilst at the same time being applicable to -- and having guarantees in -- much more general games.
Revised:  Basic experiments show SGA is competitive with recently proposed algorithms for finding stable fixed points in GANs -- whilst at the same time being applicable to -- and having guarantees in -- much more general games.
Edit intent: clarity
Original: Old and novel finite difference schemes, using Backward Differentiation Formula (BDF), are studied for the approximation of one-dimensional non-linear diffusion equations with an obstacle term, of the form %DIFDELCMD < \[\min(v_t - a(t,x) %DIFDELCMD < v_{xx} + b(t,x) v_x + r(t,x) v, v- \varphi(t,x))= f(t,x).
Revised: Finite difference schemes, using Backward Differentiation Formula (BDF), are studied for the approximation of one-dimensional non-linear diffusion equations with an obstacle term, of the form %DIFDELCMD < \[\min(v_t - a(t,x) %DIFDELCMD < v_{xx} + b(t,x) v_x + r(t,x) v, v- \varphi(t,x))= f(t,x).
Edit intent: coherence
Original: Old and novel finite difference schemes, using Backward Differentiation Formula (BDF), are studied for the approximation of one-dimensional non-linear diffusion equations with an obstacle term, of the form %DIFDELCMD < \[\min(v_t - a(t,x) %DIFDELCMD < v_{xx} + b(t,x) v_x + r(t,x) v, v- \varphi(t,x))= f(t,x).
Revised: Old and novel finite difference schemes, using Backward Differentiation Formula (BDF), are studied for the approximation of one-dimensional diffusion equations with an obstacle term, of the form %DIFDELCMD < \[\min(v_t - a(t,x) %DIFDELCMD < v_{xx} + b(t,x) v_x + r(t,x) v, v- \varphi(t,x))= f(t,x).
Edit intent: clarity
Original:  Numerical examples show second order convergence  in both space and time, unconditionally on the ratio of the mesh steps.
Revised:  Numerical examples show second order convergence , in both space and time, unconditionally on the ratio of the mesh steps.
Edit intent: fluency
Original:  An L^2 error estimate of order 1{2 In the analysis, an equivalence of the obstacle equation with a Hamilton-Jacobi-Bellman equation is also mentionedin the case when there is no time dependency in the coefficients.
Revised:  In the analysis, an equivalence of the obstacle equation with a Hamilton-Jacobi-Bellman equation is also mentionedin the case when there is no time dependency in the coefficients.
Edit intent: coherence
Original:  For the scheme building on  BDF2  , we discuss unconditional stability, prove an L^2-error estimate and show numerically second order convergence, in both space and time, unconditionally on the ratio of the mesh steps.
Revised:  For the scheme building on BDF2 ) , we discuss unconditional stability, prove an L^2-error estimate and show numerically second order convergence, in both space and time, unconditionally on the ratio of the mesh steps.
Edit intent: fluency
Original: We analyze the tailored coupled-cluster  (TCC) method, which is a multi-reference formalism that combines the single-reference coupled-cluster (CC) approach with a full configuration interaction (FCI)solution covering the ]  static correlation.
Revised: We analyze the tailored coupled-cluster method (TCC) method, which is a multi-reference formalism that combines the single-reference coupled-cluster (CC) approach with a full configuration interaction (FCI)solution covering the ] static correlation.
Edit intent: fluency
Original:  Using the Aubin-Nitsche-duality methodwe derive a quadratic (Newton type) error bound valid for the linear-tensor-network TCC scheme DMRG-TCC and other TNS-TCC methods  .
Revised:  Using the Aubin-Nitsche-duality methodwe derive a quadratic (Newton type) error bound valid for TNS-TCC methods .
Edit intent: clarity
Original:  However , by revisiting the polar clasps, we cannot confirm this very important intersheet hydrogen bond;
Revised:  In addition , by revisiting the polar clasps, we cannot confirm this very important intersheet hydrogen bond;
Edit intent: coherence
Original:  instead we found another hydrogen bond ( Asn171 :H-Gln172: OE1  between the strand  of one sheet and the opposing strand  of the mating sheet ) to replace it .
Revised:  instead we found another hydrogen bond ( Asn171 :H-Gln172: OE1 between the strand of one sheet and the opposing strand of the mating sheet .
Edit intent: coherence
Original:  These effects produce a range of ecological phenomena: an unlimited number of strains can coexist , potentially with a single keystone strain stabilizing the community ;
Revised:  These effects produce a range of ecological phenomena: an unlimited number of strains can coexist , potentially with a single keystone strain ;
Edit intent: clarity
Original:  This occurs with competition for only a single finite resource and no other interactions.
Edit intent: coherence
Original:  Since variation in multiple growth traits is ubiquitous in microbial populations due to pleiotropy and non-genetic variation,  these higher-order effects may also be widespread, especially in laboratory ecology and evolution experiments .
Revised:  Since variation in multiple growth traits is ubiquitous in microbial populations due to pleiotropy and non-genetic variation, our results indicate these higher-order effects may also be widespread, especially in laboratory ecology and evolution experiments .
Edit intent: clarity
Original: The Split Packing algorithm \mbox{ splitpacking_ws, splitpacking is an offline algorithm that packs a set of circles into shapes ( triangles and squares ) at an optimal packing density.
Revised: The Split Packing algorithm \mbox{ splitpacking_ws, splitpacking is an offline algorithm that packs a set of circles into triangles and squares ) at an optimal packing density.
Edit intent: clarity
Original: The Split Packing algorithm \mbox{ splitpacking_ws, splitpacking is an offline algorithm that packs a set of circles into shapes ( triangles and squares ) at an optimal packing density.
Revised: The Split Packing algorithm \mbox{ splitpacking_ws, splitpacking is an offline algorithm that packs a set of circles into shapes ( triangles and squares up to critical density.
Edit intent: clarity
Original:  In particular, if edges can be grouped into classes that must be assigned the same time, then our problem is hard even on  directed acyclic graphs when both the reachability target and the classes of edges are of constant size, as well as on an extremely restrictive class of trees.
Revised:  In particular, if edges can be grouped into classes that must be assigned the same time, then our problem is hard even on trees and directed acyclic graphs when both the reachability target and the classes of edges are of constant size, as well as on an extremely restrictive class of trees.
Edit intent: clarity
Original:  They are of particular relevance when considering spreading processes on graphs, for example the spread of a disease or the dissemination of sensitive information.
Revised:  They are of particular relevance when considering spreading processes on graphs, e.g. the spread of a disease or the dissemination of sensitive information.
Edit intent: coherence
Original:  In this work we introduce a new type of modification for temporal graphs , in which edges cannot be deleted but we can control the times at which they are active;
Revised:  In this work we introduce a new type of modification for temporal graphs : the number of active times for each edge is fixed, but we can control the times at which they are active;
Edit intent: clarity
Original:  we investigate the problem of determining an assignment of times to the edges so as to minimise the maximum number of vertices reachable from any single starting vertex  .
Revised:  we investigate the problem of determining an ordering of edges that minimises the maximum number of vertices reachable from any single starting vertex .
Edit intent: clarity
Original:  We study two versions of this problem, both of which we show to be NP-hard (the more general is hard even on trees and directed acyclic graphs) , and identify a few cases in which the problem can be solved or approximated efficiently.
Revised:  We study two versions of this problem, both of which we show to be NP-hard , and identify a few cases in which the problem can be solved or approximated efficiently.
Edit intent: coherence
Original:  We study two versions of this problem, both of which we show to be NP-hard (the more general is hard even on trees and directed acyclic graphs) , and identify a few cases in which the problem can be solved or approximated efficiently.
Revised:  We study two versions of this problem, both of which we show to be NP-hard (the more general is hard even on trees and directed acyclic graphs) , and identify cases in which the problem can be solved or approximated efficiently.
Edit intent: clarity
Original: Temporal graphs (in which edges are active at specified times) are of particular relevance for spreading processes on graphs, e.g.  the spread of disease or dissemination of information.
Revised: Temporal graphs (in which edges are active at specified times) are of particular relevance for spreading processes on graphs, e.g. ~ the spread of disease or dissemination of information.
Edit intent: fluency
Original:  We study two versions of this problem, both of which we show to be NP-hard \NP , and identify cases in which the problem can be solved or approximated efficiently.
Revised:  We study two versions of this problem, both of which we show to be \NP , and identify cases in which the problem can be solved or approximated efficiently.
Edit intent: clarity
Original: This study analyzes how  accumulation of knowledge takes place in para-scientific areas, focusing on the case of Analytic Philosophy.
Revised: This study analyzes how the accumulation of knowledge takes place in para-scientific areas, focusing on the case of Analytic Philosophy.
Edit intent: fluency
Original:  A sample of 60 papers published in leading Analytic Philosophy journals between 1950 and 2009 is analyzed, and a proper classificatory scheme is developed to classify citations according to their epistemological function.
Revised:  A sample of 60 papers published in leading Analytic Philosophy journals between 1950 and 2009 is analyzed, and a specific classsificatory scheme is developed to classify citations according to their epistemological function.
Edit intent: clarity
Original:  Compared to previous studies of citation context, this paper includes the temporal dimension into the analysis of citation context, in order to shed light on the process of knowledge accumulation.
Revised:  Compared to previous studies of citation context, this paper includes the temporal dimension into the analysis of citation context, in order to gain insights into the process of knowledge accumulation.
Edit intent: clarity
Original:  Main results show that Analytic Philosophy started to accumulate after Second World War, but in a peculiar way.
Revised:  Interestingly, the results show that Analytic Philosophy started to accumulate after Second World War, but in a peculiar way.
Edit intent: coherence
Original:  Main results show that Analytic Philosophy started to accumulate after Second World War, but in a peculiar way.
Revised:  Main results show that Analytic Philosophy started accumulating after Second World War, but in a peculiar way.
Edit intent: fluency
Original:  Accumulation was not matched by a corresponding raising consensus.
Revised:  The accumulation was not matched by a corresponding raising consensus.
Edit intent: fluency
Original:  Accumulation was not matched by a corresponding raising consensus.
Revised:  Accumulation was not matched by a corresponding rising consensus.
Edit intent: fluency
Original:  This is explained by the hypothesis that AP underwent a process of fragmentation in sub-fields during the second half of the century.
Revised:  This can be explained by the hypothesis that AP underwent a process of fragmentation in sub-fields during the second half of the century.
Edit intent: clarity
Original:  This domain mapping method is quite efficient for theory and practice, since only a single domain discretization is needed.
Revised:  While this domain mapping method is quite efficient for theory and practice, since only a single domain discretization is needed.
Edit intent: coherence
Original:  In this article, we verify the required regularity  with respect to the random perturbation field , derive the coupling formulation, and show by numerical results that the approach is feasible.
Revised:  In this article, we verify the required regularity of the solution with respect to the random perturbation field , derive the coupling formulation, and show by numerical results that the approach is feasible.
Edit intent: clarity
Original: Given a set \mathcal{O of k orientations in the plane, two points inside a simple polygon P \mathcal{O  if there is an O -staircase contained in P that connects them .
Revised: Let \mathcal{O of k orientations in the plane, two points inside a simple polygon P \mathcal{O if there is an O -staircase contained in P that connects them .
Edit intent: clarity
Original: Given a set \mathcal{O of k orientations in the plane, two points inside a simple polygon P \mathcal{O  if there is an O -staircase contained in P that connects them .
Revised: Given a set \mathcal{O of k orientations in the plane, two points inside a simple polygon P \mathcal{O if there is an O -staircasestaircase contained in P that connects them .
Edit intent: fluency
Original:  The O -kernel of P{\rm  -}{\rm   is the subset of points which \mathcal{O}-see all the other points in P.
Revised:  The O -{\rm -}{\rm is the subset of points which \mathcal{O}-see all the other points in P.
Edit intent: clarity
Original:  The O -kernel of P{\rm  -}{\rm   is the subset of points which \mathcal{O}-see all the other points in P.
Revised:  The O -kernel of P{\rm Kernel -}{\rm is the subset of points which \mathcal{O}-see all the other points in P.
Edit intent: fluency
Original:  For the stochastic block model , the non-recoverability condition depends on the probabilities of having edges inside a community, and between different communities.
Revised:  For the Stochastic Block Model , the non-recoverability condition depends on the probabilities of having edges inside a community, and between different communities.
Edit intent: fluency
Original:  For the latent space model , the non-recoverability condition depends on the dimension of the latent space, and how far and spread are the communities in the latent space.
Revised:  For the Latent Space Model , the non-recoverability condition depends on the dimension of the latent space, and how far and spread are the communities in the latent space.
Edit intent: fluency
Original:  We apply CRL in a multi-agent game-theoretic task in which coordination must be achieved in order to find an optimal solution.
Revised:  We test our model in a multi-agent game-theoretic task in which coordination must be achieved in order to find an optimal solution.
Edit intent: clarity
Original:  We apply CRL in a multi-agent game-theoretic task in which coordination must be achieved in order to find an optimal solution.
Revised:  We apply CRL in a multi-agent game-theoretic task in which coordination must be achieved to find an optimal solution.
Edit intent: fluency
Original: What is the role of real-time control and learning on the formation of social conventions?
Revised: What is the role of real-time control and learning in the formation of social conventions?
Edit intent: fluency
Original:  However, detecting social influence from observational data is challenging , due to confounds like homophily and practical issues like missing data.
Revised:  However, detecting social influence from observational data is challenging due to confounds like homophily and practical issues like missing data.
Edit intent: fluency
Original:  In this work, we propose a novel discriminative method to detect influence from observational data.
Revised:  We propose a simple discriminative method to detect influence from observational data.
Edit intent: clarity
Original:  Using synthetically generated data , we provide empirical evidence that this method correctly identifies influence in the presence of confounds, and is robust to both missing data and misspecification --- unlike popular alternatives.
Revised:  We analyze synthetically generated data , we provide empirical evidence that this method correctly identifies influence in the presence of confounds, and is robust to both missing data and misspecification --- unlike popular alternatives.
Edit intent: clarity
Original:  Using synthetically generated data , we provide empirical evidence that this method correctly identifies influence in the presence of confounds, and is robust to both missing data and misspecification --- unlike popular alternatives.
Revised:  Using synthetically generated data to show that this method correctly identifies influence in the presence of confounds, and is robust to both missing data and misspecification --- unlike popular alternatives.
Edit intent: clarity
Original:  Using synthetically generated data , we provide empirical evidence that this method correctly identifies influence in the presence of confounds, and is robust to both missing data and misspecification --- unlike popular alternatives.
Revised:  Using synthetically generated data , we provide empirical evidence that this method correctly identifies influence in the presence of confounds, and is robust to both missing data and misspecification --- unlike well-known alternatives.
Edit intent: clarity
Original:  We also apply the method to two real-world datasets: (1) cascades of co-sponsorship of legislation in the U.S. House of Representatives , on a social network of shared campaign donors;
Revised:  We apply the method to two real-world datasets: (1) cascades of co-sponsorship of legislation in the U.S. House of Representatives , on a social network of shared campaign donors;
Edit intent: clarity
Original:  We also apply the method to two real-world datasets: (1) cascades of co-sponsorship of legislation in the U.S. House of Representatives , on a social network of shared campaign donors;
Revised:  We also apply the method to two real-world datasets: (1) the co-sponsorship of legislation in the U.S. House of Representatives , on a social network of shared campaign donors;
Edit intent: clarity
Original:  We also apply the method to two real-world datasets: (1) cascades of co-sponsorship of legislation in the U.S. House of Representatives , on a social network of shared campaign donors;
Revised:  We also apply the method to two real-world datasets: (1) cascades of co-sponsorship of legislation in the U.S. House of Representatives on a social network of shared campaign donors;
Edit intent: fluency
Original:  (2) rumors about the Higgs boson discovery , on a follower network of 10^5 Twitter accounts.
Revised:  (2) rumors about the Higgs boson discovery on a follower network of 10^5 Twitter accounts.
Edit intent: fluency
Original:  Our model identifies the role of peer influence in these scenarios , and uses it to make more accurate predictions about the future trajectory of cascades.
Revised:  Our model identifies the role of social influence in these scenarios , and uses it to make more accurate predictions about the future trajectory of cascades.
Edit intent: clarity
Original:  Our model identifies the role of peer influence in these scenarios , and uses it to make more accurate predictions about the future trajectory of cascades.
Revised:  Our model identifies the role of peer influence in these scenarios and uses it to make more accurate predictions about the future trajectory of cascades.
Edit intent: fluency
Original:  We demonstrate the power of our method on the recombination hotspot testing problem, outperforming the state-of-the-art.
Revised:  We demonstrate the power of our approach on the recombination hotspot testing problem, outperforming the state-of-the-art.
Edit intent: clarity
Original:  We present a method using transfer entropy to extract this flow of information between brain regions from spike-train data commonly taken in neurological experiments.
Revised:  We present a method using transfer entropy to extract this flow of information between brain regions from spike-train data commonly obtained in neurological experiments.
Edit intent: clarity