wanyu/IteraTeR_v2 huggingface dataset:
Original:  We study the scaling of average fluctuations across temporal scales and determine an universal law characterized by critical exponents \alpha, \tau and 1/{\mu}.
Revised:  We study the scaling of average fluctuations across temporal scales and determine a universal law characterized by critical exponents \alpha, \tau and 1/{\mu}.
Edit intent: fluency
Original:  Results are highly reminiscent of the universality described for the average shape of avalanches in systems exhibiting cracking noise.
Revised:  Results are highly reminiscent of the universality described for the average shape of avalanches in systems exhibiting crackling noise.
Edit intent: fluency
Original:  Earlier work in model organisms had shown that wiring rules based on geometric relationships (distance) cannot account for all topological features.
Revised:  Earlier work in model organisms has suggested that wiring rules based on geometric relationships (distance) cannot account for all topological features.
Edit intent: clarity
Original:  Earlier work in model organisms had shown that wiring rules based on geometric relationships (distance) cannot account for all topological features.
Revised:  Earlier work in model organisms had shown that wiring rules based on geometric relationships (distance) can account for many but likely not all topological features.
Edit intent: clarity
Original: The slower is faster (SIF) effect occurs when a system performs worse when its components try to be better.
Revised: The slower is faster (SIF) effect occurs when a system performs worse as its components try to be better.
Edit intent: clarity
Original: The slower is faster (SIF) effect occurs when a system performs worse when its components try to be better.
Revised: The slower is faster (SIF) effect occurs when a system performs worse when its components try to do better.
Edit intent: clarity
Original:  Drawing on these examples  we generalize common features of the SIF effect and suggest possible future lines of research.
Revised:  Drawing on these examples , we generalize common features of the SIF effect and suggest possible future lines of research.
Edit intent: fluency
Original:  In ecology, the Jacobian matrix evalufated at an equilibrium point is known as the community matrix, which represents the population dynamics of interacting species.
Revised:  In ecology, the Jacobian matrix evaluated at an equilibrium point is known as the community matrix, which represents the population dynamics of interacting species.
Edit intent: fluency
Original:  In ecology, the Jacobian matrix evalufated at an equilibrium point is known as the community matrix, which represents the population dynamics of interacting species.
Revised:  In ecology, the Jacobian matrix evalufated at an equilibrium point is known as the community matrix, which describes the population dynamics of interacting species.
Edit intent: clarity
Original:  The system's asymptotic short- and long-term behaviour can be determined from eigenvalues derived from the community matrix.
Revised:  A system's asymptotic short- and long-term behaviour can be determined from eigenvalues derived from the community matrix.
Edit intent: fluency
Original:  We show that the transition from stable to unstable dynamics includes a region of transient instability , where the effect of a small perturbation is amplified before ultimately decaying.
Revised:  We show that the transition from stable to unstable dynamics includes a region of `transient instability' , where the effect of a small perturbation is amplified before ultimately decaying.
Edit intent: fluency
Original:  The shift from stability to transient instability depends on the magnitude of a perturbation, and we show how to determine lower and upper bounds to the maximum amplitude of perturbations  .
Revised:  Then we show that the shift from stability to transient instability depends on the magnitude of a perturbation, and we show how to determine lower and upper bounds to the maximum amplitude of perturbations .
Edit intent: coherence
Original:  Of five different types of community matrix, we find that amplification is least severe with predator-prey interactions  .
Revised:  Of five different types of community matrix, we find that amplification is least severe when predator-prey interactions .
Edit intent: clarity
Original:  Of five different types of community matrix, we find that amplification is least severe with predator-prey interactions  .
Revised:  Of five different types of community matrix, we find that amplification is least severe with predator-prey interactions dominate .
Edit intent: clarity
Original:  Through understanding transient instability, we can learn under what conditions multiple perturbations - multiple external shocks - will irrecoverably break stability.
Revised:  Our results will lead to improved understanding of how multiple perturbations to a complex system may irrecoverably break stability.
Edit intent: clarity
Original: The Wright-Fisher family of diffusion processes is a  class of evolutionary models widely used in population genetics, with applications also in finance and Bayesian statistics.
Revised: The Wright-Fisher family of diffusion processes is a widely used class of evolutionary models widely used in population genetics, with applications also in finance and Bayesian statistics.
Edit intent: coherence
Original:  Our key idea is to exploit an eigenfunction expansion representation of the transition function .
Revised:  Our key idea is to exploit an eigenfunction expansion of the transition function .
Edit intent: clarity
Original:  This approach also yields methods for exact simulation from several processes related to the Wright-Fisher diffusion: (i) its moment dual , the ancestral process of an infinite-leaf Kingman coalescent tree ;
Revised:  This approach also yields methods for exact simulation of the moment dual of the Wright-Fisher diffusion: (i) its moment dual , the ancestral process of an infinite-leaf Kingman coalescent tree ;
Edit intent: clarity
Original:  This approach also yields methods for exact simulation from several processes related to the Wright-Fisher diffusion: (i) its moment dual , the ancestral process of an infinite-leaf Kingman coalescent tree ;
Revised:  This approach also yields methods for exact simulation from several processes related to the Wright-Fisher diffusion , the ancestral process of an infinite-leaf Kingman coalescent tree ;
Edit intent: coherence
Original:  In this paper, we define two centrality measures of a temporal vertex by the proportion of (normal) vertex pairs, the quickest routes between which can (or should) use the temporal vertex.
Revised:  In this paper, we define two centrality measures of a temporal vertex based on the fastest temporal paths which use the temporal vertex.
Edit intent: clarity
Original:  However, the simple match/action abstraction of OpenFlow switches constraints the evolution of the forwarding rules to be fully managed by the controller.
Revised:  However, the simple match/action abstraction of OpenFlow switches constrains the evolution of the forwarding rules to be fully managed by the controller.
Edit intent: fluency
Original: Elicitation is the study of statistics or properties which are computable via empirical risk minimization.
Revised: A property, or statistical functional, is said to be elicitable if it minimizes expected loss for some loss function. The study of which properties are elicitable sheds light on the capabilities and limits of empirical risk minimization.
Edit intent: clarity
Original:  While several recent papers have asked which properties are elicitable, we instead advocate for a more nuanced question: how many dimensions are required to indirectly elicit a given property?
Revised:  While recent work asks which properties are elicitable, we instead advocate for a more nuanced question: how many dimensions are required to indirectly elicit a given property?
Edit intent: clarity
Original:  We apply these results by proving tight complexity bounds, with respect to identifiable properties , for variance, financial risk measures, entropy, norms, and new properties of interest.
Revised:  We apply these results to several properties of interest, including variance, entropy, norms, and new properties of interest.
Edit intent: clarity
Original: We study the tradeoff between the statistical error and communication cost for distributed statistical estimation problems in high dimensions.
Revised: We study the tradeoff between the statistical error and communication cost of distributed statistical estimation problems in high dimensions.
Edit intent: fluency
Original:  This directly leads to a lower bound for the distributed sparse linear regression problem: to achieve the statistical minimax error, the total communication is at least \Omega(\min\{n,d\}m), where n is the number of observations that each machine receives and d is the ambient dimension.
Revised:  This directly leads to a lower bound for the distributed sparse linear regression problem: to achieve the statistical minimax error, the total communication is at least \Omega(\min\{n,d\}m), where n is the number of observations that each machine receives and d is the ambient dimension.
Edit intent: fluency
Original:   As our main technique, we prove a distributed data processing inequality , as a generalization of usual data processing inequalities, which might be of independent interest .
Revised:  As our main technique, we prove a distributed data processing inequality , as a generalization of usual data processing inequalities, which might be of independent interest .
Edit intent: fluency
Original:  As our main technique, we prove a distributed data processing inequality \textit{ , as a generalization of usual data processing inequalities, which might be of independent interest and useful for other problems.
Revised:  As our main technique, we prove a \textit{ , as a generalization of usual data processing inequalities, which might be of independent interest and useful for other problems.
Edit intent: clarity
Original:  Specifically, we keep the recovery rates the same for all nodes and study the influence of the moments of the independently identically distributed (i.i.d.) infection rates on the average fraction y_\infty of infected nodes in the meta-stable state, which indicates the severity of the overall infection.
Revised:  Specifically, we keep the recovery rates the same for all nodes and study the influence of the independently identically distributed (i.i.d.) infection rates on the average fraction y_\infty of infected nodes in the meta-stable state, which indicates the severity of the overall infection.
Edit intent: clarity
Original:  Specifically, we keep the recovery rates the same for all nodes and study the influence of the moments of the independently identically distributed (i.i.d.) infection rates on the average fraction y_\infty of infected nodes in the meta-stable state, which indicates the severity of the overall infection.
Revised:  Specifically, we keep the recovery rates the same for all nodes and study the influence of the moments of the independently identically distributed infection rates on the average fraction y_\infty of infected nodes in the meta-stable state, which indicates the severity of the overall infection.
Edit intent: clarity
Original:  Specifically, we keep the recovery rates the same for all nodes and study the influence of the moments of the independently identically distributed (i.i.d.) infection rates on the average fraction y_\infty of infected nodes in the meta-stable state, which indicates the severity of the overall infection.
Revised:  Specifically, we keep the recovery rates the same for all nodes and study the influence of the moments of the independently identically distributed (i.i.d.) infection rates on the average fraction of infected nodes in the meta-stable state, which indicates the severity of the overall infection.
Edit intent: clarity
Original:  By continuous-time simulations on several types of networks, theoretical proofs and physical interpretations, we conclude that : 1) the heterogeneity of infection rates on average retards the virus spread , and 2) a larger even-order moment of the infection rates leads to a smaller average fraction of infected nodes, but the odd-order moments contribute in the opposite way .
Revised:  By continuous-time simulations on several types of networks, theoretical proofs and physical interpretations, we conclude that : 1) the heterogeneity of infection rates on average retards the virus spreading , and 2) a larger even-order moment of the infection rates leads to a smaller average fraction of infected nodes, but the odd-order moments contribute in the opposite way .
Edit intent: fluency
Original:  Our results suggest that, in reality , the epidemic spread may not be so severe as the classic homogeneous SIS model indicates  .
Revised:  Our results suggest that, in reality the epidemic spread may not be so severe as the classic homogeneous SIS model indicates .
Edit intent: fluency
Original:  Our results suggest that, in reality , the epidemic spread may not be so severe as the classic homogeneous SIS model indicates  .
Revised:  Our results suggest that, in reality , the epidemic spread may not be so severe as the classic SIS model indicates .
Edit intent: clarity
Original:  Directly applied forces change a system with respect to a fixed frame of reference.
Revised:  Directly applied forces change the probabilities assigned to members of the population when holding constant the metrical values of the members---a fixed metrical frame of reference.
Edit intent: clarity
Original: It has been observed in a variety of contexts that gradient descent methods have great success in solving low-rank matrix-factorization problems, despite the relevant problem formulation being non-convex.
Revised: It has been observed in a variety of contexts that gradient descent methods have great success in solving low-rank matrix factorization problems, despite the relevant problem formulation being non-convex.
Edit intent: fluency
Original:  We test this claim by identifying the 250 most heavily used journals in each of 26 research fields (4,721 journals, 19.4M articles in total) indexed by the Scopus database, and modeling whether topic, academic status, and accessibility make articles from these journals more or less likely to be referenced on Wikipedia.
Revised:  We test this claim by identifying the 250 most heavily used journals in each of 26 research fields (4,721 journals, 19.4M articles in total) indexed by the Scopus database, and test whether topic, academic status, and accessibility make articles from these journals more or less likely to be referenced on Wikipedia.
Edit intent: clarity
Original:  Among the implications of this study is that the chief effect of open access policies may be to significantly amplify the diffusion of science, through an intermediary like Wikipedia, to a broad public audience.
Revised:  Among the implications of this study is that a major consequence of open access policies may be to significantly amplify the diffusion of science, through an intermediary like Wikipedia, to a broad public audience.
Edit intent: clarity
Original:  Among the implications of this study is that the chief effect of open access policies may be to significantly amplify the diffusion of science, through an intermediary like Wikipedia, to a broad public audience.
Revised:  Among the implications of this study is that the chief effect of open access policies is to significantly amplify the diffusion of science, through an intermediary like Wikipedia, to a broad public audience.
Edit intent: clarity
Original:  Among the implications of this study is that the chief effect of open access policies may be to significantly amplify the diffusion of science, through an intermediary like Wikipedia, to a broad public audience.
Revised:  Among the implications of this study is that the chief effect of open access policies may be to significantly amplify the diffusion of science, through an intermediary like Wikipedia, to a broad audience.
Edit intent: clarity
Original:  To complete missing values and detect column corruptions, existing robust Matrix Completion (MC) methods mostly concentrate on recovering a low-rank matrix from few corrupted coefficients w.r.t. the standard basis, which, however, does not apply to more general basis, e.g., the Fourier basis.
Revised:  To complete missing values and detect column corruptions, existing robust Matrix Completion (MC) methods mostly concentrate on recovering a low-rank matrix from few corrupted coefficients w.r.t. standard basis, which, however, does not apply to more general basis, e.g., the Fourier basis.
Edit intent: fluency
Original:  To complete missing values and detect column corruptions, existing robust Matrix Completion (MC) methods mostly concentrate on recovering a low-rank matrix from few corrupted coefficients w.r.t. the standard basis, which, however, does not apply to more general basis, e.g., the Fourier basis.
Revised:  To complete missing values and detect column corruptions, existing robust Matrix Completion (MC) methods mostly concentrate on recovering a low-rank matrix from few corrupted coefficients w.r.t. the standard basis, which, however, does not apply to more general basis, e.g., Fourier basis.
Edit intent: fluency
Original:  In this paper, we prove that the range space of an m\times n matrix with rank r can be exactly recovered from few coefficients w.r.t. general basis, though the rank r and the number of corrupted samples are both as high as O(\min\{m,n\}/\log^3 (m+n)).
Revised:  In this paper, we prove that the range space of an m\times n matrix with rank r can be exactly recovered from few coefficients w.r.t. general basis, though r and the number of corrupted samples are both as high as O(\min\{m,n\}/\log^3 (m+n)).
Edit intent: fluency
Original:  Thus our results cover previous work as special cases, and robust MC can recover the intrinsic matrix with a higher rank.
Revised:  Our model covers previous ones as special cases, and robust MC can recover the intrinsic matrix with a higher rank.
Edit intent: clarity
Original:  As an application, we also find that the solutions to extended robust Low-Rank Representation and to our extended robust MC are mutually expressible, so both our theory and algorithm can be immediately applied to the subspace clustering problem with missing values  . Experiments verify our theories.
Revised:  As an application, we also find that the solutions to extended robust Low-Rank Representation and to our extended robust MC are mutually expressible, so both our theory and algorithm can be applied to the subspace clustering problem with missing values . Experiments verify our theories.
Edit intent: clarity
Original:  As an application, we also find that the solutions to extended robust Low-Rank Representation and to our extended robust MC are mutually expressible, so both our theory and algorithm can be immediately applied to the subspace clustering problem with missing values  . Experiments verify our theories.
Revised:  As an application, we also find that the solutions to extended robust Low-Rank Representation and to our extended robust MC are mutually expressible, so both our theory and algorithm can be immediately applied to the subspace clustering problem with missing values under certain conditions . Experiments verify our theories.
Edit intent: clarity
Original:  As a solution to this problem, so called Reactive congestion control algorithm is proposed .
Revised:  As a solution to the congestion issue .
Edit intent: clarity
Original:  We give a natural LP relaxation of MIVC and show that the integrality gap of this LP is upper bounded by \frac{1{2} + \epsilon for bipartite graphs, where \epsilon is any number greater than 0.
Revised:  We give a natural LP relaxation of MIVC and show that the integrality gap of {2} + \epsilon for bipartite graphs, where \epsilon is any number greater than 0.
Edit intent: clarity
Original:  Our result is the first constant-ratio approximation for a class of planar convex bodies of arbitrary size and arbitrarily overlaps .
Revised:  Our result is the first constant-ratio approximation for a class of planar convex bodies of arbitrary size and arbitrary intersections .
Edit intent: clarity
Original:  In order to achieve a O(1)-approximation, we reduce the traveling salesman problem with with disks, up to constant factors, to a minimum weight hitting set problem in a geometric hypergraph.
Revised:  In order to achieve a O(1)-approximation, we reduce the traveling salesman problem with disks, up to constant factors, to a minimum weight hitting set problem in a geometric hypergraph.
Edit intent: fluency
Original: We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constant-ratio approximation for disks in the plane: Given a set of n disks in the plane, a TSP tour whose length is at most O(1) times the optimal with high probability can be computed in time that is polynomial in n.
Revised: We revisit the traveling salesman problem with neighborhoods (TSPN) and present the first constant-ratio approximation for disks in the plane: Given a set of n disks in the plane, a TSP tour whose length is at most O(1) times the optimal can be computed in time that is polynomial in n.
Edit intent: clarity
Original: Theory and empirical evidence clearly indicate that phylogenies (trees) of different genes (loci) should not display precisely matched topologies.
Revised: Summary: Both theory and empirical evidence clearly indicate that phylogenies (trees) of different genes (loci) should not display precisely matched topologies.
Edit intent: coherence
Original: Theory and empirical evidence clearly indicate that phylogenies (trees) of different genes (loci) should not display precisely matched topologies.
Revised: Theory and empirical evidence indicate that phylogenies (trees) of different genes (loci) should not display precisely matched topologies.
Edit intent: clarity
Original: Theory and empirical evidence clearly indicate that phylogenies (trees) of different genes (loci) should not display precisely matched topologies.
Revised: Theory and empirical evidence clearly indicate that phylogenies (trees) of different genes (loci) do not display precisely matched topologies.
Edit intent: clarity
Original:  The main reason for such phylogenetic incongruence is  reticulated evolutionary history of most species due to meiotic sexual recombination in eukaryotes, orhorizontal transfers of genetic materials in prokaryotes.
Revised:  This phylogenetic incongruence is reticulated evolutionary history of most species due to meiotic sexual recombination in eukaryotes, orhorizontal transfers of genetic materials in prokaryotes.
Edit intent: coherence
Original:  The main reason for such phylogenetic incongruence is  reticulated evolutionary history of most species due to meiotic sexual recombination in eukaryotes, orhorizontal transfers of genetic materials in prokaryotes.
Revised:  The main reason for such phylogenetic incongruence is attributed to the reticulated evolutionary history of most species due to meiotic sexual recombination in eukaryotes, orhorizontal transfers of genetic materials in prokaryotes.
Edit intent: clarity
Original:  The main reason for such phylogenetic incongruence is  reticulated evolutionary history of most species due to meiotic sexual recombination in eukaryotes, orhorizontal transfers of genetic materials in prokaryotes.
Revised:  The main reason for such phylogenetic incongruence is reticulated evolutionary history of most species due to meiotic sexual recombination in eukaryotes, or horizontal transfers of genetic materials in prokaryotes.
Edit intent: fluency
Original:  Nevertheless , most genes should display topologically related phylogenies , and should group into one or more (for genetic hybrids) clustersin the "tree space.
Revised:  Nonetheless , most genes should display topologically related phylogenies , and should group into one or more (for genetic hybrids) clustersin the "tree space.
Edit intent: fluency