wanyu/IteraTeR_v2 huggingface dataset:
Original:  The validity of this theorem has been argued in philosphical terms for over 2,500 years , but it has not previously been approachable through experimental investigation .
Revised:  The validity of this conjecture has been argued in philosphical terms for over 2,500 years , but it has not previously been approachable through experimental investigation .
Edit intent: clarity
Original:  The validity of this theorem has been argued in philosphical terms for over 2,500 years , but it has not previously been approachable through experimental investigation .
Revised:  The validity of this theorem has been argued in philosophical terms for over 2,500 years , but it has not previously been approachable through experimental investigation .
Edit intent: fluency
Original:  To address the question of whether the mind supervenes on the brain through empirical means, here we frame a supervenience hypothesis in rigorous mathematical terms and propose a modified version of supervenience (called epsilon-supervenience) that is amenable to scientific methods and statistical analysis.
Revised:  To address the question of whether the mind supervenes on the brain , we here frame a supervenience hypothesis in rigorous mathematical terms and propose a modified version of supervenience (called epsilon-supervenience) that is amenable to scientific methods and statistical analysis.
Edit intent: clarity
Original:  To address the question of whether the mind supervenes on the brain through empirical means, here we frame a supervenience hypothesis in rigorous mathematical terms and propose a modified version of supervenience (called epsilon-supervenience) that is amenable to scientific methods and statistical analysis.
Revised:  To address the question of whether the mind supervenes on the brain through empirical means, here we frame a supervenience hypothesis in rigorous mathematical terms . Specifically, we propose a modified version of supervenience (called epsilon-supervenience) that is amenable to scientific methods and statistical analysis.
Edit intent: coherence
Original:  To address the question of whether the mind supervenes on the brain through empirical means, here we frame a supervenience hypothesis in rigorous mathematical terms and propose a modified version of supervenience (called epsilon-supervenience) that is amenable to scientific methods and statistical analysis.
Revised:  To address the question of whether the mind supervenes on the brain through empirical means, here we frame a supervenience hypothesis in rigorous mathematical terms and propose a modified version of supervenience (called epsilon-supervenience) that is amenable to experimental investigation and statistical analysis.
Edit intent: clarity
Original:  To elucidate this approach, we posit a thought experiment that illustrates how the probabilistic theory of pattern recognition can be used to make a one-sided determination of epsilon-supervenience.
Revised:  To illustrate this approach, we posit a thought experiment that illustrates how the probabilistic theory of pattern recognition can be used to make a one-sided determination of epsilon-supervenience.
Edit intent: fluency
Original:  To elucidate this approach, we posit a thought experiment that illustrates how the probabilistic theory of pattern recognition can be used to make a one-sided determination of epsilon-supervenience.
Revised:  To elucidate this approach, we perform a thought experiment that illustrates how the probabilistic theory of pattern recognition can be used to make a one-sided determination of epsilon-supervenience.
Edit intent: clarity
Original:  The physical property of the brain employed in this analysis is the graph describing brain connectivity (i.e., the connectome), and epsilon-supervenience allows us to determine whether a particular mental property can be inferred from one's connectome to within any given misclassification rate epsilon > 0, regardless of the relationship between the two.
Revised:  The physical property of the brain employed in this analysis is the graph describing brain connectivity (i.e., the brain-graph or connectome). Epsilon-supervenience allows us to determine whether a particular mental property can be inferred from one's connectome to within any given misclassification rate epsilon > 0, regardless of the relationship between the two.
Edit intent: clarity
Original:  The physical property of the brain employed in this analysis is the graph describing brain connectivity (i.e., the connectome), and epsilon-supervenience allows us to determine whether a particular mental property can be inferred from one's connectome to within any given misclassification rate epsilon > 0, regardless of the relationship between the two.
Revised:  The physical property of the brain employed in this analysis is the graph describing brain connectivity (i.e., the connectome), and epsilon-supervenience allows us to determine whether a particular mental property can be inferred from one's connectome to within any given misclassification rate > 0, regardless of the relationship between the two.
Edit intent: fluency
Original: The "mind-brain supervenience" conjecture suggests that all mental properties (e.g. consciousness, intelligence, personality, etc.) are derived from the physical properties of the brain.
Revised: The "mind-brain supervenience" conjecture suggests that all mental properties are derived from the physical properties of the brain.
Edit intent: clarity
Original:  To address the question of whether the mind supervenes on the brain, we here frame a supervenience hypothesis in rigorous mathematical terms.
Revised:  To address the question of whether the mind supervenes on the brain, we frame a supervenience hypothesis in rigorous mathematical terms.
Edit intent: coherence
Original:  To address the question of whether the mind supervenes on the brain, we here frame a supervenience hypothesis in rigorous mathematical terms.
Revised:  To address the question of whether the mind supervenes on the brain, we here frame a supervenience hypothesis in rigorous statistical terms.
Edit intent: clarity
Original:  Epsilon-supervenience allows us to determine whether a particular mental property can be inferred from one's connectome to within any given misclassification rate > 0 , regardless of the relationship between the two.
Revised:  epsilon-supervenience allows us to determine whether a particular mental property can be inferred from one's connectome to within any given misclassification rate > 0 , regardless of the relationship between the two.
Edit intent: fluency
Original:  This should provide further motivation for cross-disciplinary research between neuroscientists and statistical graphtheoreticians .
Revised:  This should provide further motivation for cross-disciplinary research between neuroscientists and statisticians .
Edit intent: clarity
Original:  In this article, we introduce necessary conditions for a cellular automaton to be ?universal?
Revised:  In this article, we introduce necessary conditions for a cellular automaton to be "universal"
Edit intent: fluency
Original: The fluctuation-dissipation theory is invoked to shed light on input-output industrial correlations at a macroscopic level ;
Revised: In this study, the fluctuation-dissipation theory is invoked to shed light on input-output industrial correlations at a macroscopic level ;
Edit intent: clarity
Original: The fluctuation-dissipation theory is invoked to shed light on input-output industrial correlations at a macroscopic level ;
Revised: The fluctuation-dissipation theory is invoked to shed light on input-output interindustrial relations at a macroscopic level ;
Edit intent: clarity
Original:  Our previous paper has demonstrated that the noise elimination procedure was successful in identifying existence of intrinsic business cycles.
Revised:  Our previous study successfully used these two modes to demonstrate the existence of intrinsic business cycles.
Edit intent: clarity
Original:  Also we observe distinctive external stimuli on the Japanese economy exerted by the current global economic crisis.
Revised:  Also we observe distinctive external stimuli for the Japanese economy exerted by the current global economic crisis.
Edit intent: fluency
Original:  Those stimuli are derived from residual of moving-averaged fluctuations of the IIP left over after subtracting the long-period components due to the business cycles .
Revised:  These stimuli are derived from residual of moving-averaged fluctuations of the IIP left over after subtracting the long-period components due to the business cycles .
Edit intent: fluency
Original:  Those stimuli are derived from residual of moving-averaged fluctuations of the IIP left over after subtracting the long-period components due to the business cycles .
Revised:  Those stimuli are derived from residuals of moving average fluctuations of the IIP left over after subtracting the long-period components due to the business cycles .
Edit intent: fluency
Original:  Those stimuli are derived from residual of moving-averaged fluctuations of the IIP left over after subtracting the long-period components due to the business cycles .
Revised:  Those stimuli are derived from residual of moving-averaged fluctuations of the IIP remaining after subtracting the long-period components due to the business cycles .
Edit intent: clarity
Original:  Natl. Acad.
Revised:  \ Natl.\ Acad.\
Edit intent: fluency
Original:  Sci., 104(50) : 19926 - 19930 (2007)].
Revised:  Sci., : 19926 - 19930 (2007)].
Edit intent: coherence
Original: In this paper, we identify a fundamental algorithmic problem that we term space-constrained dynamic covering ( SCDC ), arising in many modern-day web applications, including ad-serving and online recommendation systems in eBay and Netflix.
Revised: In this paper, we identify a fundamental algorithmic problem that we term space-constrained dynamic covering ( SDC ), arising in many modern-day web applications, including ad-serving and online recommendation systems in eBay and Netflix.
Edit intent: fluency
Original:  Roughly speaking, SCDC applies two restrictions to the well-studied Max-Coverage problem: Given an integer k, X={1,2,...,n} and I={S_1, ..., S_m}, S_i a subset of X, find a subset J of I, such that |J| <= k and the union of S in J is as large as possible.
Revised:  Roughly speaking, SDC applies two restrictions to the well-studied Max-Coverage problem: Given an integer k, X={1,2,...,n} and I={S_1, ..., S_m}, S_i a subset of X, find a subset J of I, such that |J| <= k and the union of S in J is as large as possible.
Edit intent: fluency
Original:  The two restrictions applied by SCDC are: (1) Dynamic: At query-time, we are given a query Q, a subset of X, and our goal is to find J such that the intersection of Q with the union of S in J is as large as possible;
Revised:  The two restrictions applied by SDC are: (1) Dynamic: At query-time, we are given a query Q, a subset of X, and our goal is to find J such that the intersection of Q with the union of S in J is as large as possible;
Edit intent: fluency
Original:  specifically, we have o(mn), sometimes even as little as O((m+n)polylog(mn)) space.
Revised:  specifically, we have o(mn), and maybe as little as O((m+n)polylog(mn)) space.
Edit intent: clarity
Original:  The goal of SCDC is to maintain a small data structure so as to answer most dynamic queries with high accuracy.
Revised:  The goal of SDC is to maintain a small data structure so as to answer most dynamic queries with high accuracy.
Edit intent: fluency
Original:  We  present algorithms and complexity results for SCDC . We present deterministic and probabilistic near-tight upper and lower bounds on the approximation ratio of SCDC as a function of the amount of space available  .
Revised:  We present algorithms and complexity results for SCDC . We present deterministic and probabilistic near-tight upper and lower bounds on the approximation ratio of SDC as a function of the amount of space available .
Edit intent: fluency
Original:  We  present algorithms and complexity results for SCDC . We present deterministic and probabilistic near-tight upper and lower bounds on the approximation ratio of SCDC as a function of the amount of space available  .
Revised:  We present algorithms and complexity results for SCDC . We present deterministic and probabilistic near-tight upper and lower bounds on the approximation ratio of SCDC as a function of the amount of space available to the oracle .
Edit intent: clarity
Original: In equity and foreign exchange markets the risk-neutral dynamics of the underlying asset are commonly represented by a stochastic volatility model with jumps.
Revised: In equity and foreign exchange markets the risk-neutral dynamics of the underlying asset are commonly represented by stochastic volatility models with jumps.
Edit intent: fluency
Original:  We provide closed form formulae for the Fourier transforms of vanilla and forward starting options as well as the formula for the slope of the implied volatility smile for large strikes.
Revised:  We provide closed form formulae for the Fourier transforms of vanilla and forward starting option prices as well as the formula for the slope of the implied volatility smile for large strikes.
Edit intent: clarity
Original:  We provide closed form formulae for the Fourier transforms of vanilla and forward starting options as well as the formula for the slope of the implied volatility smile for large strikes.
Revised:  We provide closed form formulae for the Fourier transforms of vanilla and forward starting options as well as a formula for the slope of the implied volatility smile for large strikes.
Edit intent: fluency
Original:  The prices of the volatility swaps and other volatility derivatives are given as a one-dimensional integral of an explicit function.
Revised:  The prices of volatility swaps and other volatility derivatives are given as a one-dimensional integral of an explicit function.
Edit intent: fluency
Original:  The proof of the latter results is based on a novel complex matrix Wiener-Hopf factorization .
Revised:  The proof of the latter formulae is based on a novel complex matrix Wiener-Hopf factorization .
Edit intent: clarity
Original: The resultant of  a square system of homogeneous polynomials is a polynomial in their coefficients which vanishes whenever the system has a solution.
Revised: The resultant of a polynomial in their coefficients which vanishes whenever the system has a solution.
Edit intent: clarity
Original: The resultant of  a square system of homogeneous polynomials is a polynomial in their coefficients which vanishes whenever the system has a solution.
Revised: The resultant of a square system of homogeneous polynomials is a polynomial in the system's coefficients which vanishes whenever the system has a solution.
Edit intent: fluency
Original:  We investigate the complexity of the associated decision problem and give a hardness result : Testing the resultant for zero lies in the class Arthur-Merlin and is NP-hard .
Revised:  We investigate the complexity of the associated decision problem and give a hardness result : Testing the resultant for zero is NP-hard .
Edit intent: coherence
Original:  Such programs can exist only if the screen view is organized not according with the predetermined scenario, written by the developers, but if any screen object can be moved, resized, reconfigured, and rotated by any user at any moment.
Revised:  Such programs can exist only if the screen view is organized not according with the predetermined scenario, written by the developers, but if any screen object can be moved, resized, and reconfigured by any user at any moment.
Edit intent: clarity
Original:  For controls, different types of groups are analysed and the arbitrary grouping of controls is considered 
Revised:  For controls, different types of groups are analysed and the arbitrary grouping of controls is considered .
Edit intent: fluency
Original: Unfortunately, this paperfind that the modified version still can be broken with the same breaking method .
Revised: Unfortunately, this paperfind that the modified scheme is still insecure against the same known/chosen-plaintext attack .
Edit intent: clarity
Original:  The exponential disparity between the two rates reflects fragility of the extinction rate in the population dynamics without turnover.
Revised:  The exponentially large disparity between the two rates reflects fragility of the extinction rate in the population dynamics without turnover.
Edit intent: clarity
Original:  The phase transition reveals a resonant frequency at which  input is most effective at suppressing chaos even though the power spectrum of the spontaneous activity peaks at zero and falls exponentially.
Revised:  The phase transition reveals a resonant frequency at which the input is most effective at suppressing chaos even though the power spectrum of the spontaneous activity peaks at zero and falls exponentially.
Edit intent: fluency
Original:  In the spatial domain, inputs suppress chaos most effectively when they match the spatial pattern of the leading principal component vectors of the spontaneous network activity .
Revised:  A prediction of our analysis is that the variance of neural responses should be most strongly suppressed at frequencies matching the range over which many sensory systems operate .
Edit intent: clarity
Original:  The conditional expectations are taken with respect to a filtration generated by a set of ``information processes'' .
Revised:  The conditional expectations are taken with respect to a filtration generated by a set of "information processes" .
Edit intent: fluency
Original: Recent proposals explore non-traditional computing based on nature's ability to find ground states in atomic-scale systems.
Revised: Recent proposals explore non-traditional computing as a way to harness the nature's ability to find ground states in atomic-scale systems.
Edit intent: clarity
Original:  We use this computational tool as a simulator to study the significance of hyper-couplings in  recently implemented adiabatic quantum computers.
Revised:  We use this computational tool as a simulator to study the significance of hyper-couplings in the context of recently implemented adiabatic quantum computers.
Edit intent: clarity
Original: Let A_1,A_2, \ldots ,A_n be the vertices of a polygon with unit perimeter, that is i=1^n |A_i A_{i+1}|=1.
Revised: Let A_1,A_2, ... ,A_n be the vertices of a polygon with unit perimeter, that is i=1^n |A_i A_{i+1}|=1.
Edit intent: coherence
Original:  Such estimates on these sums in the literature were known only for convex polygons.
Revised:  In most cases such estimates on these sums in the literature were known only for convex polygons.
Edit intent: clarity
Original:  We also sharpen a previous lower bound on the minimum sum of pairwise squared distances for convex polygons due to Novotn\'y.
Edit intent: coherence
Original:  ~ AHM09b, who gave an exact formula.
Revised:  AHM09b, who gave an exact formula.
Edit intent: fluency
Original:  The problem was recently solved by Audet et al.
Revised:  The problem was solved by Audet et al.
Edit intent: clarity
Original:  Due to these considerations, Michaelis-Menten kinetics can even be inappropriate to apply at the population level.
Revised:  Because of these considerations, Michaelis-Menten kinetics can even be inappropriate to apply at the population level.
Edit intent: fluency
Original: We consider the problem of routing traffic in a network whose users try to minimise their delays by adhering to a simple learning scheme inspired by the replicator dynamics of evolutionary game theory.
Revised: We study the distribution of traffic in networks whose users try to minimise their delays by adhering to a simple learning scheme inspired by the replicator dynamics of evolutionary game theory.
Edit intent: clarity
Original:  Such users indeed converge to Wardrop equilibrium if their information is accurate, but a key part in the process is played by the redundancy of the network(a new concept which measures the "linear dependence" of the users' paths).
Revised:  The stable steady states of these dynamics coincide with the network's Wardrop equilibria and form a convex polytope whose dimension is determined by the network's redundancy (an important concept which measures the "linear dependence" of the users' paths).
Edit intent: clarity
Original:   On the other hand, a major challenge occurs when the users' delays fluctuate unpredictably due to (random ) external factors.
Revised:  On the other hand, a major challenge occurs when the users' delays fluctuate unpredictably due to random external factors.
Edit intent: fluency
Original:  In fact, if the network has no redundancy and the learning rate of the users is sufficiently slow , we show that the long-term average of the users' traffic distribution converges to the vicinity of an equilibrium and estimate the corresponding stationary distribution .
Revised:  In fact, if the network has no redundancy and the users are patient enough , we show that the long-term average of the users' traffic distribution converges to the vicinity of an equilibrium and estimate the corresponding stationary distribution .
Edit intent: clarity
Original:  In fact, if the network has no redundancy and the learning rate of the users is sufficiently slow , we show that the long-term average of the users' traffic distribution converges to the vicinity of an equilibrium and estimate the corresponding stationary distribution .
Revised:  In fact, if the network has no redundancy and the learning rate of the users is sufficiently slow , we show that the long-term averages of the users' traffic distribution converges to the vicinity of an equilibrium and estimate the corresponding stationary distribution .
Edit intent: fluency
Original:  In fact, if the network has no redundancy and the learning rate of the users is sufficiently slow , we show that the long-term average of the users' traffic distribution converges to the vicinity of an equilibrium and estimate the corresponding stationary distribution .
Revised:  In fact, if the network has no redundancy and the learning rate of the users is sufficiently slow , we show that the long-term average of the users' traffic flows converge to the vicinity of an equilibrium and estimate the corresponding stationary distribution .
Edit intent: clarity
Original:  In fact, if the network has no redundancy and the learning rate of the users is sufficiently slow , we show that the long-term average of the users' traffic distribution converges to the vicinity of an equilibrium and estimate the corresponding stationary distribution .
Revised:  In fact, if the network has no redundancy and the learning rate of the users is sufficiently slow , we show that the long-term average of the users' traffic distribution converges to the vicinity of an equilibrium , and we also estimate the corresponding stationary distribution .
Edit intent: coherence
Original:  In fact, if the network has no redundancy and the learning rate of the users is sufficiently slow , we show that the long-term average of the users' traffic distribution converges to the vicinity of an equilibrium and estimate the corresponding stationary distribution .
Revised:  In fact, if the network has no redundancy and the learning rate of the users is sufficiently slow , we show that the long-term average of the users' traffic distribution converges to the vicinity of an equilibrium and estimate the corresponding invariant measure .
Edit intent: clarity
Original:  In this paper, we study the skewness of the distribution of citations to journals and conference papers published in computer science venues .
Revised:  In this paper, we study the skewness of the distribution of citations to papers published in computer science venues .
Edit intent: clarity
Original:  In this paper, we study the skewness of the distribution of citations to journals and conference papers published in computer science venues .
Revised:  In this paper, we study the skewness of the distribution of citations to journals and conference papers published in computer science publication venues (journals and conferences) .
Edit intent: clarity