wanyu/IteraTeR_v2 huggingface dataset:
Original:  Indeed, while Canonne , Ron, and Servedio established a poly \log( n)-query upper bound for equivalence testing, very recently brought down to \tilde O(\log\log n) by Falahatgar et al.  , whether a dependence on the domain size n is necessary was still open, and explicitly posed by Fischer at the Bertinoro Workshop on Sublinear Algorithms .
Revised:  Indeed, while Canonne , Ron, and Servedio established a poly (\log n)-query upper bound for equivalence testing, very recently brought down to \tilde O(\log\log n) by Falahatgar et al. , whether a dependence on the domain size n is necessary was still open, and explicitly posed by Fischer at the Bertinoro Workshop on Sublinear Algorithms .
Edit intent: fluency
Original:  Interestingly, this demonstrates an intrinsic qualitative gap between identity and equivalence testing, absent in the standard sampling model (where both problems have sampling complexity n^{\Theta(1)}).
Revised:  This demonstrates a gap between identity and equivalence testing, absent in the standard sampling model (where both problems have sampling complexity n^{\Theta(1)}).
Edit intent: clarity
Original:  This latter result carries on to the related problem of  non-adaptive uniformity testing, an exponential improvement over previous results that resolves an open question of Chakraborty et al(\log\log n) and \mathrm{poly}(\log n), respectively} .
Revised:  This latter result carries on to the related problem of non-adaptive algorithms, with query complexities \mathrm{poly(\log\log n) and \mathrm{poly}(\log n), respectively} .
Edit intent: clarity
Original:  More then ever before, hiring, promotion, and funding decisions rely on a variety of impact metrics that cannot disentangle quality from productivity , and are biased by factors such as discipline and academic age.
Revised:  More then ever before, hiring, promotion, and funding decisions rely on a variety of impact metrics that cannot disentangle quality from quantity of scientific output , and are biased by factors such as discipline and academic age.
Edit intent: clarity
Original:  By decoupling productivity and impact, our method can determine whether a certain level of impact can be explained by productivity alone, or additional ingredients of scientific excellence are necessary .
Revised:  By decoupling productivity and impact, our method can determine whether a certain level of impact is achieved .
Edit intent: clarity
Original:  We further apply our methodology to almost a million scholars and over six thousand journals to quantify the impact required to demonstrate scientific excellence for a given level of productivity .
Revised:  We further apply our methodology to almost a million scholars and over six thousand journals to measure the impact that cannot be explained by the volume of publications alone .
Edit intent: clarity
Original:  We show that this model can describe candidate vote distributions, spatial vote correlations, and slow opinion consensus with sensible parameter values.
Revised:  We show that this model can describe candidate vote distributions, spatial vote correlations, and a slow approach to opinion consensus with sensible parameter values.
Edit intent: clarity
Original:  This may suggest that all these distinct behaviors , previously understood using distinct models, may be different aspects of  a more unified model of human behavior introduced in this paper.
Revised:  This may suggest that all these distinct behaviors , previously understood using distinct models, may be different aspects of human behavior that can be captured by a more unified model of human behavior introduced in this paper.
Edit intent: clarity
Original:  This may suggest that all these distinct behaviors , previously understood using distinct models, may be different aspects of  a more unified model of human behavior introduced in this paper.
Revised:  This may suggest that all these distinct behaviors , previously understood using distinct models, may be different aspects of a more unified model , such as the one introduced in this paper.
Edit intent: clarity
Original:  These empirical properties of large groups , previously understood using distinct models, may be different aspects of human behavior that can be captured by a more unified model, such as the one introduced in this paper.
Revised:  These empirical properties of large group dynamics , previously understood using distinct models, may be different aspects of human behavior that can be captured by a more unified model, such as the one introduced in this paper.
Edit intent: clarity
Original: This article shows an extended work of [Kleinberg and Oren 2014] .
Revised: This article shows an extended work of [Kleinberg Oren 2014] .
Edit intent: fluency
Original:  It gives more properties of the graph time-inconsistency model raised in Kleinberg and Oren 2014 by solving three open problems proposed in [Kleinberg and Oren 2014].
Revised:  It gives more properties of the graph time-inconsistency model raised in Kleinberg and Oren by solving three open problems proposed in [Kleinberg and Oren 2014].
Edit intent: fluency
Original:  It gives more properties of the graph time-inconsistency model raised in Kleinberg and Oren 2014 by solving three open problems proposed in [Kleinberg and Oren 2014].
Revised:  It gives more properties of the graph time-inconsistency model raised in Kleinberg and Oren 2014 by solving three open problems in [Kleinberg and Oren 2014].
Edit intent: clarity
Original:  It gives more properties of the graph time-inconsistency model raised in Kleinberg and Oren 2014 by solving three open problems proposed in [Kleinberg and Oren 2014].
Revised:  It gives more properties of the graph time-inconsistency model raised in Kleinberg and Oren 2014 by solving three open problems proposed in [Kleinberg Oren 2014].
Edit intent: fluency
Original:  Generally speaking, it gives a tight upper bound for the ratio of actual cost due to time-inconsistency to minimum theoretic cost, and shows the hardness of motivating agent.
Revised:  First, we show a tight upper bound for the ratio of actual cost due to time-inconsistency to minimum theoretic cost, and shows the hardness of motivating agent.
Edit intent: coherence
Original:  The empirical results suggest that the approximation is effective .
Revised:  The empirical results suggest that the approximation is reasonably good for liquidly--traded stocks in certain time periods .
Edit intent: clarity
Original: The assessment of fundamental properties for economic and financial systems, such as systemic risk, is systematically hindered by privacy issues-that put severe limitations on the available information .
Revised: The assessment of fundamental properties for economic and financial networks, privacy issues severely limit the information that can be accessed and, as a consequence, the possibility of correctly estimating the resilience of these systems to events such as financial shocks, crises and cascade failures .
Edit intent: clarity
Original:  Here we introduce a novel method to reconstruct  partially-accessible networked systemsof this kind.
Revised:  Here we present an innovative method to reconstruct partially-accessible networked systemsof this kind.
Edit intent: clarity
Original:  Here we introduce a novel method to reconstruct  partially-accessible networked systemsof this kind.
Revised:  Here we introduce a novel method to reconstruct the structure of such partially-accessible networked systemsof this kind.
Edit intent: clarity
Original:  The method is based on the knowledge of the fitnesses, i.e., intrinsic node-specific properties , and of the number of connections of only a limited subset of nodes.
Revised:  The method is based on the knowledge of intrinsic node-specific properties , and of the number of connections of only a limited subset of nodes.
Edit intent: coherence
Original:  The method is based on the knowledge of the fitnesses, i.e., intrinsic node-specific properties , and of the number of connections of only a limited subset of nodes.
Revised:  The method is based on the knowledge of the fitnesses, i.e., intrinsic node-specific properties and of the number of connections of only a limited subset of nodes.
Edit intent: fluency
Original:  Here we propose a statistical model of spontaneous activity which is very flexible and remains tractable .
Revised:  Here we propose a novel single neuron model that characterizes the statistical properties of in vivo recordings .
Edit intent: clarity
Original:  More specifically, we propose a doubly stochastic process where the subthreshold membrane potential follows a Gaussian process and the spike emission intensity depends nonlinearly on the membrane potential as well as the previous spiking history.
Revised:  More specifically, we propose a stochastic process where the subthreshold membrane potential follows a Gaussian process and the spike emission intensity depends nonlinearly on the membrane potential as well as the previous spiking history.
Edit intent: clarity
Original:  We first show that the model has a rich dynamical repertoire since it can capture arbitrary subthreshold autocovariances, firing- rate adaptations as well as arbitrary shapes of the action potential.
Revised:  We first show that the model has a rich dynamical repertoire since it can capture arbitrary subthreshold autocovariance functions, firing-rate adaptations as well as arbitrary shapes of the action potential.
Edit intent: clarity
Original:  We finally show that this model can be used to characterize and therefore precisely compare a wide range of intracellular in vivo recordings from various animals and recording conditions.
Revised:  We finally show that this model can be used to characterize and therefore precisely compare various intracellular in vivo recordings from various animals and recording conditions.
Edit intent: clarity
Original:  We finally show that this model can be used to characterize and therefore precisely compare a wide range of intracellular in vivo recordings from various animals and recording conditions.
Revised:  We finally show that this model can be used to characterize and therefore precisely compare a wide range of intracellular in vivo recordings from different animals and recording conditions.
Edit intent: fluency
Original:  Those types of model have been extensively fitted to in vitro data where the input current is controlled.
Revised:  Those types of models have been extensively fitted to in vitro data where the input current is controlled.
Edit intent: fluency
Original:  More specifically, we propose a stochastic process where the subthreshold membrane potential follows a Gaussian process and the spike emission intensity depends nonlinearly on the membrane potential as well as the previous spiking history.
Revised:  More specifically, we propose a stochastic process where the subthreshold membrane potential follows a Gaussian process and the spike emission intensity depends nonlinearly on the membrane potential as well as the spiking history.
Edit intent: clarity
Original:  We then show that this model can be efficiently learned without overfitting.
Revised:  We then show that this model can be efficiently fitted to data without overfitting.
Edit intent: clarity
Original:  We finally show that this model can be used to characterize and therefore precisely compare various intracellular in vivo recordings from different animals and recording conditions.
Revised:  Finally, we show that this model can be used to characterize and therefore precisely compare various intracellular in vivo recordings from different animals and recording conditions.
Edit intent: coherence
Original:  We finally show that this model can be used to characterize and therefore precisely compare various intracellular in vivo recordings from different animals and recording conditions.
Revised:  We finally show that this model can be used to characterize and therefore precisely compare various intracellular in vivo recordings from different animals and experimental conditions.
Edit intent: clarity
Original: We consider here the fractional version of the Heston model originally proposed by Comte, Coutin and Renault.
Revised: We consider the fractional Heston model originally proposed by Comte, Coutin and Renault.
Edit intent: clarity
Original:  In this paper we present a protection scheme based on precomputed backup paths and inspired by MPLS "crankback " routing, that guarantees instantaneous recovery times and aims at zero packet-loss after failure detection, regardless of controller reachability, even when OpenFlow's "fast-failover" feature cannot be used.
Revised:  In this paper we present a protection scheme based on precomputed backup paths and inspired by MPLS crankback routing, that guarantees instantaneous recovery times and aims at zero packet-loss after failure detection, regardless of controller reachability, even when OpenFlow's "fast-failover" feature cannot be used.
Edit intent: fluency
Original:  Whereas autoencoders are analogous to latent variable models with a single layer of stochastic variables, the proposed network is analogous to hierarchical latent variables models.
Revised:  While standard autoencoders are analogous to latent variable models with a single layer of stochastic variables, the proposed network is analogous to hierarchical latent variables models.
Edit intent: clarity
Original:  As in previous work, ] we generalize the block FOM method to generate well-defined approximations in the case that block FOM would normally break down, and these generalized solutions are used in our analysis.
Revised:  Following from ] we generalize the block FOM method to generate well-defined approximations in the case that block FOM would normally break down, and these generalized solutions are used in our analysis.
Edit intent: coherence
Original:  As in previous work, ] we generalize the block FOM method to generate well-defined approximations in the case that block FOM would normally break down, and these generalized solutions are used in our analysis.
Revised:  As in previous work, ], we generalize the block FOM method to generate well-defined approximations in the case that block FOM would normally break down, and these generalized solutions are used in our analysis.
Edit intent: fluency
Original:  Two toy numerical examples are given to illustrate what we have proven  and we also apply both block methods to a small application problem to demonstrate the validity of the analysis in  non-pathological cases .
Revised:  Two toy numerical examples are given to illustrate what we have proven , and we also apply both block methods to a small application problem to demonstrate the validity of the analysis in non-pathological cases .
Edit intent: fluency
Original:  Two toy numerical examples are given to illustrate what we have proven  and we also apply both block methods to a small application problem to demonstrate the validity of the analysis in  non-pathological cases .
Revised:  Two toy numerical examples are given to illustrate what we have proven and we also apply both block methods to a small application problem to demonstrate the validity of the analysis in a non-pathological cases .
Edit intent: fluency
Original:  Two toy numerical examples are given to illustrate what we have proven  and we also apply both block methods to a small application problem to demonstrate the validity of the analysis in  non-pathological cases .
Revised:  Two toy numerical examples are given to illustrate what we have proven and we also apply both block methods to a small application problem to demonstrate the validity of the analysis in non-pathological case .
Edit intent: fluency
Original: We examine the the convergence behavior of block GMRES and block FOM and characterize the phenomenon of stagnation in block GMRES.
Revised: We analyze the the convergence behavior of block GMRES and block FOM and characterize the phenomenon of stagnation in block GMRES.
Edit intent: fluency
Original: We examine the the convergence behavior of block GMRES and block FOM and characterize the phenomenon of stagnation in block GMRES.
Revised: We examine the the convergence behavior of block GMRES and characterize the phenomenon of stagnation in block GMRES.
Edit intent: clarity
Original:  Following from Brown, SIAM J. Sci. Statist.
Revised:  Brown, SIAM J. Sci. Statist.
Edit intent: clarity
Original:  Comput., '91%DIFDELCMD < ]%%% , we generalize the block FOM method to generate well-defined approximations in the case that block FOM would normally break down, and these generalized solutions are used in our analysis.
Revised:  Comput., '91%DIFDELCMD < ]%%% We generalize the block FOM method to generate well-defined approximations in the case that block FOM would normally break down, and these generalized solutions are used in our analysis.
Edit intent: fluency
Original:  Two toy numerical examples are given to illustrate what we have proven, and we also apply both block methods to a small application problem to demonstrate the validity of the analysis in a less non-pathological case.
Revised:  Two toy numerical examples are given to illustrate what we have proven, including a small application problem to demonstrate the validity of the analysis in a less non-pathological case.
Edit intent: clarity
Original:  Two toy numerical examples are given to illustrate what we have proven, and we also apply both block methods to a small application problem to demonstrate the validity of the analysis in a less non-pathological case.
Revised:  Two toy numerical examples are given to illustrate what we have proven, and we also apply both block methods to a small application problem to demonstrate the validity of the analysis in a less pathological case.
Edit intent: fluency
Original: We study the computational complexity of candidate control in elections with few voters ( that is, we take the number of voters as a parameter ) .
Revised: We study the computational complexity of candidate control in elections with few voters , that is, we take the number of voters as a parameter ) .
Edit intent: fluency
Original: We study the computational complexity of candidate control in elections with few voters ( that is, we take the number of voters as a parameter ) .
Revised: We study the computational complexity of candidate control in elections with few voters ( that is, we take the number of voters as a parameter .
Edit intent: fluency
Original:  We consider both the standard scenario of adding and deleting candidates, where one asks if a given candidate can become a winner (or, in the destructive case, can be precluded from winning) by adding /deleting some candidates, and a combinatorial scenario where adding/deleting a candidate automatically means adding / deleting a whole group of candidates.
Revised:  We consider both the standard scenario of adding and deleting candidates, where one asks whether a given candidate can become a winner (or, in the destructive case, can be precluded from winning) by adding /deleting some candidates, and a combinatorial scenario where adding/deleting a candidate automatically means adding / deleting a whole group of candidates.
Edit intent: fluency
Original:  We consider both the standard scenario of adding and deleting candidates, where one asks if a given candidate can become a winner (or, in the destructive case, can be precluded from winning) by adding /deleting some candidates, and a combinatorial scenario where adding/deleting a candidate automatically means adding / deleting a whole group of candidates.
Revised:  We consider both the standard scenario of adding and deleting candidates, where one asks if a given candidate can become a winner (or, in the destructive case, can be precluded from winning) by adding /deleting some candidates, and a combinatorial scenario where adding/deleting a candidate automatically means adding or deleting a whole group of candidates.
Edit intent: fluency
Original:  Our results show that the parameterized complexity of candidate control ( with the number of voters as the parameter ) is much more varied than in the setting with many voters.
Revised:  Our results show that the parameterized complexity of candidate control , with the number of voters as the parameter ) is much more varied than in the setting with many voters.
Edit intent: fluency
Original:  Our results show that the parameterized complexity of candidate control ( with the number of voters as the parameter ) is much more varied than in the setting with many voters.
Revised:  Our results show that the parameterized complexity of candidate control ( with the number of voters as the parameter , is much more varied than in the setting with many voters.
Edit intent: fluency
Original: Teramoto et al. defined a new measure of uniformity of point distribution called thegap ratio that measures the uniformity of a finite point set sampled from \cal S, a bounded subset of R^2.
Revised: Teramoto et al. defined a new measure gap ratio that measures the uniformity of a finite point set sampled from \cal S, a bounded subset of R^2.
Edit intent: clarity
Original: Teramoto et al. defined a new measure of uniformity of point distribution called thegap ratio that measures the uniformity of a finite point set sampled from \cal S, a bounded subset of R^2.
Revised: Teramoto et al. defined a new measure of uniformity of point distribution called thecalled the gap ratio that measures the uniformity of a finite point set sampled from \cal S, a bounded subset of R^2.
Edit intent: fluency
Original:  We attempt to generalize the definition of this measure over all metric spaces .
Revised:  We generalize this definition of measure over all metric spaces .
Edit intent: clarity
Original:  the uniformity is measured using gap ratio.
Revised:  the uniformity being measured using gap ratio.
Edit intent: clarity
Original:  We give lower boundsfor specific as well as general instances , prove hardness results on specific metric spaces, and a general approximation algorithm framework giving different approximation ratios for different metric spaces \left( \right) .
Revised:  We give lower boundsfor specific as well as general instances , prove hardness results on specific metric spaces, and a general approximation algorithm framework gives different approximation ratios for different metric spaces \left( \right) .
Edit intent: fluency
Original:  The growing accessibility to ICT information obtained from portable digital media has recently opened the possibility of going beyond such fixed pictures, exploring human behavior at high spatio-temporal resolutions.
Revised:  The growing accessibility to ICT information from portable digital media has recently opened the possibility of going beyond such fixed pictures, exploring human behavior at high spatio-temporal resolutions.
Edit intent: clarity
Original:  The growing accessibility to ICT information obtained from portable digital media has recently opened the possibility of going beyond such fixed pictures, exploring human behavior at high spatio-temporal resolutions.
Revised:  The growing accessibility to ICT information obtained from portable digital media has recently opened the possibility of exploring human behavior at high spatio-temporal resolutions.
Edit intent: clarity
Original:  Mobile phone records, geolocated tweets, check-ins from Foursquare or geotagged photos, have contributed to this purpose at different scales  from cities to countries and in different areas of the world .
Revised:  Mobile phone records, geolocated tweets, check-ins from Foursquare or geotagged photos, have contributed to this purpose at different scales , from cities to countries and in different areas of the world .
Edit intent: fluency