wanyu/IteraTeR_v2 huggingface dataset:
Original:  We apply our new de Finetti theorem to the problems considered in Brandao and Harrow, arXiv:1210.6367%DIFDELCMD < ]%%% , and obtain several new or improved results.
Revised:  We apply our new de Finetti theorem to the problems considered in %DIFDELCMD < ]%%% , and obtain several new or improved results.
Edit intent: clarity
Original:  Of particular interest are (i) a quasipolynomial-time algorithm which distinguishes multipartite density matrices with entanglement larger than a small constant amount (measured with a variant of the relative entropy of entanglement) from separable , and (ii) a proof that in quantum Merlin-Arthur proof systems, polynomially many provers are not more powerful than a single prover when the verifier is restricted to one-way LOCC operations.
Revised:  Of particular interest are (i) a quasipolynomial-time algorithm which detects multipartite entanglement with amount larger than an arbitrarily small constant (measured with a variant of the relative entropy of entanglement) from separable , and (ii) a proof that in quantum Merlin-Arthur proof systems, polynomially many provers are not more powerful than a single prover when the verifier is restricted to one-way LOCC operations.
Edit intent: clarity
Original:  Of particular interest are (i) a quasipolynomial-time algorithm which distinguishes multipartite density matrices with entanglement larger than a small constant amount (measured with a variant of the relative entropy of entanglement) from separable , and (ii) a proof that in quantum Merlin-Arthur proof systems, polynomially many provers are not more powerful than a single prover when the verifier is restricted to one-way LOCC operations.
Revised:  Of particular interest are (i) a quasipolynomial-time algorithm which distinguishes multipartite density matrices with entanglement larger than a small constant amount (measured with a variant of the relative entropy of entanglement) , and (ii) a proof that in quantum Merlin-Arthur proof systems, polynomially many provers are not more powerful than a single prover when the verifier is restricted to one-way LOCC operations.
Edit intent: clarity
Original: We present a general theoretical model to realize a bilayer perceptron for hardware neural networks with applications in pattern recognition.
Revised: A general scheme to realize a bilayer perceptron for hardware neural networks with applications in pattern recognition.
Edit intent: clarity
Original: We present a general theoretical model to realize a bilayer perceptron for hardware neural networks with applications in pattern recognition.
Revised: We present a general theoretical model to realize a perceptron for hardware neural networks with applications in pattern recognition.
Edit intent: clarity
Original:  The studied scenarios represent a common practice in the steppes of Argentine Patagonia, where livestock are raised in a semi-wild state, either on the open range or enclosed, coexisting with competitors and predators.
Revised:  The studied situations represent a common practice in the steppes of Argentine Patagonia, where livestock are raised in a semi-wild state, either on the open range or enclosed, coexisting with competitors and predators.
Edit intent: clarity
Original:   We perform numerical simulations of  metapopulations assemblages of the system, which allow  to incorporate the effects of habitat heterogeneity and destruction.
Revised:  We perform numerical simulations of metapopulations assemblages of the system, which allow us to incorporate the effects of habitat heterogeneity and destruction.
Edit intent: fluency
Original: This paper investigates the adoption level of a network servicewhere the net utility perceived by each user incorporates three key features , namely, user service affinity heterogeneity,  a network externality, and  a subscription cost.
Revised: This paper investigates the adoption level of a network servicewhere the net utility perceived by each user incorporates three key features : i) user service affinity heterogeneity, a network externality, and a subscription cost.
Edit intent: coherence
Original:  Services with network externality face a "chicken and egg" adoption problem in that the service requires customers in order to attract  customers.
Revised:  Services with network externality face a "chicken and egg" adoption problem in that the service requires an established customer base in order to attract customers.
Edit intent: clarity
Original:  Services with network externality face a "chicken and egg" adoption problem in that the service requires customers in order to attract  customers.
Revised:  Services with network externality face a "chicken and egg" adoption problem in that the service requires customers in order to attract new customers.
Edit intent: clarity
Original:  We are given a graph G=(V,E), a weight function w: V \rightarrow R^+, a budget function b: V \rightarrow Z^+, and a positive integer B.  A k-budgeted independent set in G is a subset of vertices  such that no pair of vertices in that subset are adjacent and the sum of the budgets of the vertices in that subset is at most k.
Revised:  We are given a graph G=(V,E), a weight function w: V \rightarrow R^+, a budget function b: V \rightarrow Z^+, and a positive integer B. A k-budgeted independent set in G is a subset of vertices , such that no pair of vertices in that subset are adjacent and the sum of the budgets of the vertices in that subset is at most k.
Edit intent: fluency
Original:  We are given a graph G=(V,E), a weight function w: V \rightarrow R^+, a budget function b: V \rightarrow Z^+, and a positive integer B.  A k-budgeted independent set in G is a subset of vertices  such that no pair of vertices in that subset are adjacent and the sum of the budgets of the vertices in that subset is at most k.
Revised:  We are given a graph G=(V,E), a weight function w: V \rightarrow R^+, a budget function b: V \rightarrow Z^+, and a positive integer B. A k-budgeted independent set in G is a subset of vertices such that no pair of vertices in that subset are adjacent , and the budget of the subset is at most k.
Edit intent: clarity
Original:  Numerical results show that our proposed method has higher accuracy compared to the traditional SDP approach and other prevalent objective functions which are used such as least squares.
Revised:  Simulation results show that our proposed method has higher accuracy compared to the traditional SDP approach and other prevalent objective functions which are used such as least squares.
Edit intent: clarity
Original:  To illustrate our methodology, we conduct experiments with real-world networks for community detection, and compare with many other classic methods . Experimental results demonstrate that OHELPA achieves excellent performance .
Revised:  To illustrate our methodology, we conduct experiments with real-world networks . Experimental results demonstrate that OHELPA achieves excellent performance .
Edit intent: coherence
Original:  To illustrate our methodology, we conduct experiments with real-world networks for community detection, and compare with many other classic methods . Experimental results demonstrate that OHELPA achieves excellent performance .
Revised:  To illustrate our methodology, we conduct experiments with real-world networks for community detection, and compare with many other classic methods . Experimental results demonstrate that the algorithm outperforms several state-of-the-art methods .
Edit intent: clarity
Original:  On the one hand, Socolar showed in 1990 that the n-fold planar tilings do admit weak local rules when n is not divisible by 4 (the n= 5 case corresponds to the Penrose tilings and is known since 1974).
Revised:  On the one hand, Socolar showed in 1990 that the n-fold planar tilings admit weak local rules when n is not divisible by 4 (the n= 5 case corresponds to the Penrose tilings and is known since 1974).
Edit intent: clarity
Original:  we functionally explain multiple empirical findings , including task-dependent correlations between neuronal responses, between responses and behavior, and between stimulus and behavior, that have been hard to account for by the traditional feedforward model of sensory processing .
Revised:  we can explain multiple empirical findings , including task-dependent correlations between neuronal responses, between responses and behavior, and between stimulus and behavior, that have been hard to account for by the traditional feedforward model of sensory processing .
Edit intent: clarity
Original:  we functionally explain multiple empirical findings , including task-dependent correlations between neuronal responses, between responses and behavior, and between stimulus and behavior, that have been hard to account for by the traditional feedforward model of sensory processing .
Revised:  we functionally explain multiple empirical findings that have been hard to account for by the traditional feedforward model of sensory processing .
Edit intent: clarity
Original:  Our model makes a number of new predictions and characterizes correlated variability as reflecting task-related information rather than performance-degrading noise.
Revised:  Our model makes a number of new predictions and , importantly, characterizes a component of correlated variability that represents task-related information rather than performance-degrading noise.
Edit intent: clarity
Original: An st-path in a drawing of a graph is self-approaching if during a traversal of the corresponding curve from s to any point t' on the curve the distance to t' is non-increasing.
Revised: An st-path in a drawing of a graph is self-approaching if during the traversal of the corresponding curve from s to any point t' on the curve the distance to t' is non-increasing.
Edit intent: fluency
Original:   ] Moreover, we give a binary cactus that does not admit a self-approaching drawing.
Revised:  ]. Moreover, we give a binary cactus that does not admit a self-approaching drawing.
Edit intent: fluency
Original:   ] Moreover, we give a binary cactus that does not admit a self-approaching drawing.
Revised:  ] Moreover, we provide a binary cactus that does not admit a self-approaching drawing.
Edit intent: fluency
Original: In this paper, we present a methodology and prototype for creating knowledge domain visualizations based on readership statistics recorded in the social reference management system Mendeley.
Revised: In this paper, we analyze the adequacy and applicability of readership statistics recorded in the social reference management system Mendeley.
Edit intent: clarity
Original: In this paper, we present a methodology and prototype for creating knowledge domain visualizations based on readership statistics recorded in the social reference management system Mendeley.
Revised: In this paper, we present a methodology and prototype for creating knowledge domain visualizations based on readership statistics recorded in social reference management system Mendeley.
Edit intent: fluency
Original:  The resulting visualization  , based on the most read publications in this field on Mendeley, reveals 13 subject areas of educational technology research.
Revised:  The resulting visualization , based on the most read publications in this field on Mendeley, reveals 13 topic areas of educational technology research.
Edit intent: clarity
Original:  Sharing  data and models often requires extra effort , and this is currently seen as a significant overhead that may not be worth the time investment.
Revised:  Sharing data and models often requires extra effort ; this is currently seen as a significant overhead that may not be worth the time investment.
Edit intent: coherence
Original:  We show how to use QuickCheck, a property-based random-testing tool, to guide the design of increasingly complex information-flow abstract machines, leading up to a sophisticated register machine with a novel and highly permissive flow-sensitive dynamic enforcement mechanism that supports public first-class  labels.
Revised:  We show how to use QuickCheck, a property-based random-testing tool, to guide the design of increasingly complex information-flow abstract machines, leading up to a sophisticated register machine with a novel and highly permissive flow-sensitive dynamic enforcement mechanism that is sound in the presence of first-class labels.
Edit intent: clarity
Original:  Moreover, we show how testing guides the discovery of the sophisticated invariants needed for a potential noninterference proof of our most complex machine.
Revised:  Moreover, we show how testing guides the discovery of the sophisticated invariants needed for the noninterference proof of our most complex machine.
Edit intent: clarity
Original: In this paper we investigate the computational complexity of solving ordinary differential equations (ODEs) y^{\prime}= f (y) over \emph{unbounded %DIFDELCMD < \MBLOCKRIGHTBRACE %%%  domains  . Contrarily to the bounded  case, this problem has not been well-studied, apparently due to the " conventional wisdom " that it can always be reduced to the bounded case by using rescaling techniques.
Revised: In this paper we investigate the computational complexity of solving ordinary differential equations (ODEs) y^{\prime}= f (y) over \emph{unbounded %DIFDELCMD < \MBLOCKRIGHTBRACE %%% time domains . Contrarily to the bounded case, this problem has not been well-studied, apparently due to the " conventional wisdom " that it can always be reduced to the bounded case by using rescaling techniques.
Edit intent: fluency
Original: In this paper we investigate the computational complexity of solving ordinary differential equations (ODEs) y^{\prime}= f (y) over \emph{unbounded %DIFDELCMD < \MBLOCKRIGHTBRACE %%%  domains  . Contrarily to the bounded  case, this problem has not been well-studied, apparently due to the " conventional wisdom " that it can always be reduced to the bounded case by using rescaling techniques.
Revised: In this paper we investigate the computational complexity of solving ordinary differential equations (ODEs) y^{\prime}= f (y) over \emph{unbounded %DIFDELCMD < \MBLOCKRIGHTBRACE %%% domains . Contrarily to the bounded case, this problem has not been well-studied, apparently due to the " intuition " that it can always be reduced to the bounded case by using rescaling techniques.
Edit intent: clarity
Original:  Instead, we take another approach and study ODEs of the form y^{\prime We present algorithms which numerically solve these ODEs over unbounded  domains.
Revised:  We present algorithms which numerically solve these ODEs over unbounded domains.
Edit intent: coherence
Original:  These algorithms have guaranteed precision, i.e. ~ given some arbitrarily large time T and error bound \varepsilon as input, they will output a value Y which satisfies \|y( T)-Y \|\leq\varepsilon.
Revised:  These algorithms have guaranteed precision, i.e. given some arbitrarily large time T and error bound \varepsilon as input, they will output a value Y which satisfies \|y( T)-Y \|\leq\varepsilon.
Edit intent: coherence
Original:  These algorithms have guaranteed precision, i.e. ~ given some arbitrarily large time T and error bound \varepsilon as input, they will output a value Y which satisfies \|y( T)-Y \|\leq\varepsilon.
Revised:  These algorithms have guaranteed precision, i.e. ~ given some arbitrarily large time t and error bound \varepsilon as input, they will output a value Y which satisfies \|y( T)-Y \|\leq\varepsilon.
Edit intent: fluency
Original:  These algorithms have guaranteed precision, i.e. ~ given some arbitrarily large time T and error bound \varepsilon as input, they will output a value Y which satisfies \|y( T)-Y \|\leq\varepsilon.
Revised:  These algorithms have guaranteed precision, i.e. ~ given some arbitrarily large time T and error bound \varepsilon as input, they will output a value which satisfies \|y( T)-Y \|\leq\varepsilon.
Edit intent: fluency
Original:  These algorithms have guaranteed precision, i.e. ~ given some arbitrarily large time T and error bound \varepsilon as input, they will output a value Y which satisfies \|y( T)-Y \|\leq\varepsilon.
Revised:  These algorithms have guaranteed precision, i.e. ~ given some arbitrarily large time T and error bound \varepsilon as input, they will output a value Y which satisfies \|y( t)- \|\leq\varepsilon.
Edit intent: clarity
Original:  We analyze the complexity of solving these algorithms and show that they compute Y in time polynomial in several quantities like the time T or the precision of the output \varepsilon  .
Revised:  We analyze the complexity of these algorithms and show that they compute Y in time polynomial in several quantities like the time T or the precision of the output \varepsilon .
Edit intent: clarity
Original:  We analyze the complexity of solving these algorithms and show that they compute Y in time polynomial in several quantities like the time T or the precision of the output \varepsilon  .
Revised:  We analyze the complexity of solving these algorithms and show that they compute in time polynomial in several quantities like the time T or the precision of the output \varepsilon .
Edit intent: clarity
Original:  We analyze the complexity of solving these algorithms and show that they compute Y in time polynomial in several quantities like the time T or the precision of the output \varepsilon  .
Revised:  We analyze the complexity of solving these algorithms and show that they compute Y in time polynomial in several quantities including the time t, the precision of the output \varepsilon .
Edit intent: clarity
Original:  These algorithms have guaranteed precision , i.e. given some arbitrarily large time t and error bound \varepsilon as input, they will output a value y which satisfies \|y(t)-y\|\leq\varepsilon.
Revised:  These algorithms have guaranteed accuracy , i.e. given some arbitrarily large time t and error bound \varepsilon as input, they will output a value y which satisfies \|y(t)-y\|\leq\varepsilon.
Edit intent: clarity
Original:  We analyze the complexity of these algorithms and show that they compute y in time polynomial in several quantities including the time t, the precision of the output \varepsilon and the length of the curve y from 0 to t, assuming it exists until time t.
Revised:  We analyze the complexity of these algorithms and show that they compute y in time polynomial in several quantities including the time t, the accuracy of the output \varepsilon and the length of the curve y from 0 to t, assuming it exists until time t.
Edit intent: clarity
Original: For a finite word w of length n and a class of finite automata \mathcal A, we study the Kolmogorov structure function h_w for automatic complexity restricted to \mathcal A.
Revised: For a finite word w we define and study the Kolmogorov structure function h_w for automatic complexity restricted to \mathcal A.
Edit intent: clarity
Original:  We propose an approach to computational statistics based on the minimum p-value of h_w(m) over 0%DIFDELCMD < \le %%% m%DIFDELCMD < \le %%% n. When \mathcal A is the class of all finite automata we give some upper bounds for h_w . When \mathcal A consists of automata that detect several success runs in w, we give efficient algorithms to compute h_w.
Revised:  We propose an approach to computational statistics based on the minimum p-value of h_w(m) over 0%DIFDELCMD < \le %%% %DIFDELCMD < \le %%% n. When \mathcal A is the class of all finite automata we give some upper bounds for h_w . When \mathcal A consists of automata that detect several success runs in w, we give efficient algorithms to compute h_w.
Edit intent: clarity
Original:  Besides interest in its own right, this construction allows a transparent derivation of the series coefficients of h(x) and gives them a probabilistic meaning.
Revised:  Besides being interesting in its own right, this construction allows a transparent derivation of the series coefficients of h(x) and gives them a probabilistic meaning.
Edit intent: coherence
Original:  A basic analysis in terms of this physics reveals a dramatic reduction in the solution space available for the hearing sensor, such that the apparent cochlear apomorphies between the amniotic lineages can be recast into a scaleable and a non-scaleable arrangement of small signal amplifiers .
Revised:  A basic analysis in terms of this physics reveals a dramatic reduction in the solution space available for the hearing sensor, such that the apparent cochlear apomorphies between the amniotic lineages can be recast into a scaleable and a non-scaleable arrangement of nonlinear sound detectors .
Edit intent: clarity
Original:  The scalable solution employed in mammals  as the most advanced design, provides a natural context that demands the  characterization of complex sounds through pitch.
Revised:  The scalable solution employed in mammals , as the most advanced design, provides a natural context that demands the characterization of complex sounds through pitch.
Edit intent: fluency
Original:  The scalable solution employed in mammals  as the most advanced design, provides a natural context that demands the  characterization of complex sounds through pitch.
Revised:  The scalable solution employed in mammals as the most advanced design, provides a natural context that demands the ultimate characterization of complex sounds through pitch.
Edit intent: clarity
Original: In this paper we propose a continuous time stochastic inventory model for a traded commodity whose supply purchase in the spot market  is affected by price and demand uncertainty.
Revised: In this paper we study a continuous time stochastic inventory model for a traded commodity whose supply purchase in the spot market is affected by price and demand uncertainty.
Edit intent: clarity
Original: In this paper we propose a continuous time stochastic inventory model for a traded commodity whose supply purchase in the spot market  is affected by price and demand uncertainty.
Revised: In this paper we propose a continuous time stochastic inventory model for a commodity traded in the spot market is affected by price and demand uncertainty.
Edit intent: clarity
Original:  We assume a general exponential L\'evy process for the commodity's spot price, contrary to the common use of a Brownian setting, and we model the holding cost by a general convex function .
Revised:  We assume a general exponential L\'evy process for the commodity's spot price, rather than the commonly used geometric Brownian motion, and general convex holding costs .
Edit intent: clarity
Original:  We obtain sufficient and necessary first order conditions for optimality and we provide the optimal procurement policy in terms of a "base inventory" process;
Revised:  We obtain necessary and sufficient first order conditions for optimality and we provide the optimal procurement policy in terms of a "base inventory" process;
Edit intent: fluency
Original:  In  the case of linear holding costs and exponentially distributed random demand, we are able to provide an explicit analytic solution .
Revised:  In particular, in the case of linear holding costs and exponentially distributed random demand, we are able to provide an explicit analytic solution .
Edit intent: coherence
Original:  In  the case of linear holding costs and exponentially distributed random demand, we are able to provide an explicit analytic solution .
Revised:  In the case of linear holding costs and exponentially distributed demand, we are able to provide an explicit analytic solution .
Edit intent: clarity
Original: Neuroscientific studies of execution of the drawing-like movements usually analyze neural representation of either geometric (eg. direction, shape) or temporal (eg. speed) features of trajectories rather than trajectory's representation as a whole.
Revised: Neuroscientific studies of the drawing-like movements usually analyze neural representation of either geometric (eg. direction, shape) or temporal (eg. speed) features of trajectories rather than trajectory's representation as a whole.
Edit intent: clarity