wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our paper follows recent results on the same question for the preferential attachment model , and introduces several new open problems .
Revised:  Our paper follows recent results on the same question for the preferential attachment model .
Edit intent: clarity
Original:  Applied to "Europhysics Letters" (EPL ) papers, we find that the journal is characterised by fast accumulation of downloads during the first couple of months after publication, followed by a slower rate thereafter.
Revised:  Applied to "Europhysics Letters" (EPL ) papers, we find that the journal is characterised by fast accumulations of downloads during the first couple of months after publication, followed by a slower rate thereafter.
Edit intent: fluency
Original:  Approximately 17 \% have strong interest initially, waning in time ("flashes in the pan") . A further 19 \% exhibit "delayed recognition" with relatively late spurs in download activity  .
Revised:  Approximately 18 \% have strong interest initially, waning in time ("flashes in the pan") . A further 19 \% exhibit "delayed recognition" with relatively late spurs in download activity .
Edit intent: fluency
Original:  Approximately 17 \% have strong interest initially, waning in time ("flashes in the pan") . A further 19 \% exhibit "delayed recognition" with relatively late spurs in download activity  .
Revised:  Approximately 17 \% have strong interest initially, waning in time . A further 19 \% exhibit "delayed recognition" with relatively late spurs in download activity .
Edit intent: clarity
Original:  We find this feature  to be universal for a broad selection of institutions irrespective of the average number of citations per article.
Revised:  We find this feature seem to be universal for a broad selection of institutions irrespective of the average number of citations per article.
Edit intent: clarity
Original: Given Markov chains and Markov decision processes (MDPs) whose transitions are labelled with non-negative integer costs, we study the  probability of paths whose accumulated cost satisfy a Boolean combination of inequalities .
Revised: Given Markov chains and Markov decision processes (MDPs) whose transitions are labelled with non-negative integer costs, we study the probability of paths whose accumulated cost satisfies a Boolean combination of inequalities .
Edit intent: fluency
Original:  For acyclic Markov chains, we show that this problem is PP-complete, whereas it is hard for the PosSLP problem and in PSpace for general Markov chains.
Revised:  For acyclic Markov chains, we show that this problem is PP-complete, whereas it is hard for the PosSLP problem and in PSPACE for general Markov chains.
Edit intent: fluency
Original:  Moreover  for acyclic and general MDPs, we prove PSpace- and EXPTime-completeness , respectively.
Revised:  Moreover , for acyclic and general MDPs, we prove PSpace- and EXPTime-completeness , respectively.
Edit intent: fluency
Original:  Our results significantly improve the state of the art of the complexity of computing reward quantiles in succinctly represented stochastic systems.
Revised:  Our results have direct implications on the complexity of computing reward quantiles in succinctly represented stochastic systems.
Edit intent: clarity
Original: There have been many studies on malicious targeting of network nodes using degree, betweenness etc.
Edit intent: coherence
Original:  We propose a new network metric, edge proximity, {\cal P}_e, which demonstrates the importance of specific edges in a network, hitherto not captured by existing network metrics.
Revised:  We propose a network metric, edge proximity, {\cal P}_e, which demonstrates the importance of specific edges in a network, hitherto not captured by existing network metrics.
Edit intent: clarity
Original:  Effects of removing edges with high {\cal P}_e might initially seem inconspicuous but is eventually shown to be very harmful for the network.
Revised:  The effects of removing edges with high {\cal P}_e might initially seem inconspicuous but is eventually shown to be very harmful for the network.
Edit intent: fluency
Original:  Effects of removing edges with high {\cal P}_e might initially seem inconspicuous but is eventually shown to be very harmful for the network.
Revised:  Effects of removing edges with high {\cal P}_e might initially seem inconspicuous but are eventually shown to be very harmful for the network.
Edit intent: fluency
Original:  When compared to existing strategies,  removal of edges by {\cal P}_e , leads to remarkable increase of diameter and average  path length in  real and random networks till the first disconnection and  beyond.
Revised:  When compared to existing strategies, the removal of edges by {\cal P}_e , leads to remarkable increase of diameter and average path length in real and random networks till the first disconnection and beyond.
Edit intent: fluency
Original:  When compared to existing strategies,  removal of edges by {\cal P}_e , leads to remarkable increase of diameter and average  path length in  real and random networks till the first disconnection and  beyond.
Revised:  When compared to existing strategies, removal of edges by {\cal P}_e leads to a remarkable increase in the diameter and average path length in real and random networks till the first disconnection and beyond.
Edit intent: clarity
Original:  When compared to existing strategies,  removal of edges by {\cal P}_e , leads to remarkable increase of diameter and average  path length in  real and random networks till the first disconnection and  beyond.
Revised:  When compared to existing strategies, removal of edges by {\cal P}_e , leads to remarkable increase of diameter and average path length in real and random networks till the first disconnection and well beyond.
Edit intent: clarity
Original:  Targeting by {\cal P}_e causes notable efficiency loss in US and European power grid  . {\cal P}_e identifies proteins with essential cellular functions in protein-protein interaction networks.
Revised:  Targeting by {\cal P}_e causes notable efficiency loss in U.S. and European power grid . {\cal P}_e identifies proteins with essential cellular functions in protein-protein interaction networks.
Edit intent: fluency
Original:  Targeting by {\cal P}_e causes notable efficiency loss in US and European power grid  . {\cal P}_e identifies proteins with essential cellular functions in protein-protein interaction networks.
Revised:  Targeting by {\cal P}_e causes notable efficiency loss in US and European power grid networks . {\cal P}_e identifies proteins with essential cellular functions in protein-protein interaction networks.
Edit intent: fluency
Original:  It pinpoints regulatory neural connections and important portions of the neural and brain networks  respectively.
Revised:  It pinpoints regulatory neural connections and important portions of the neural and brain networks , respectively.
Edit intent: fluency
Original:  The only access to these functions is via stochastic gradient oracles, each of which is only available at a different node, and a limited number of gradient oracle calls is allowed at each node.
Revised:  The only access to these functions is through stochastic gradient oracles, each of which is only available at a different node, and a limited number of gradient oracle calls is allowed at each node.
Edit intent: fluency
Original:  In this framework, we introduce a strongly convex optimization algorithm based on the stochastic gradient descent (SGD) updates.
Revised:  In this framework, we introduce a convex optimization algorithm based on the stochastic gradient descent (SGD) updates.
Edit intent: clarity
Original:  Particularly, we use a certain time-dependant weighted averaging of the SGD iterates, which yields an optimal convergence rate of O (\frac{N\sqrt{N \left(}{T}}\right) after T gradient updates for each node on a network of N nodes.
Revised:  Particularly, we use a carefully designed time-dependent weighted averaging of the SGD iterates, which yields an optimal convergence rate of O (\frac{N\sqrt{N \left(}{T}}\right) after T gradient updates for each node on a network of N nodes.
Edit intent: clarity
Original:  Particularly, we use a certain time-dependant weighted averaging of the SGD iterates, which yields an optimal convergence rate of O (\frac{N\sqrt{N \left(}{T}}\right) after T gradient updates for each node on a network of N nodes.
Revised:  Particularly, we use a certain time-dependant weighted averaging of the SGD iterates, which yields a convergence rate of O (\frac{N\sqrt{N \left(}{T}}\right) after T gradient updates for each node on a network of N nodes.
Edit intent: clarity
Original:  We then show that after T gradient oracle calls, the SGD iterates at each node achieve a mean square deviation (MSD) of O (\frac{\sqrt{N \left(}{T}}\right) illustrate the merits of the proposed algorithm with respect to the state-of-the-art methods in the literature .
Revised:  We then show that after T gradient oracle calls, the average SGD iterate achieves a mean square deviation (MSD) of O (\frac{\sqrt{N \left(}{T}}\right) illustrate the merits of the proposed algorithm with respect to the state-of-the-art methods in the literature .
Edit intent: clarity
Original:  We then show that after T gradient oracle calls, the SGD iterates at each node achieve a mean square deviation (MSD) of O (\frac{\sqrt{N \left(}{T}}\right) illustrate the merits of the proposed algorithm with respect to the state-of-the-art methods in the literature .
Revised:  We then show that after T gradient oracle calls, the SGD iterates at each node achieve a mean square deviation (MSD) of O (\frac{\sqrt{N \left(}{T}}\right) illustrate the merits of the algorithm with respect to the state-of-the-art methods in the literature .
Edit intent: clarity
Original:  We then show that after T gradient oracle calls, the SGD iterates at each node achieve a mean square deviation (MSD) of O (\frac{\sqrt{N \left(}{T}}\right) illustrate the merits of the proposed algorithm with respect to the state-of-the-art methods in the literature .
Revised:  We then show that after T gradient oracle calls, the SGD iterates at each node achieve a mean square deviation (MSD) of O (\frac{\sqrt{N \left(}{T}}\right) illustrate the merits of the proposed algorithm with respect to the state-of-art methods over benchmark real life data sets and widely studied network topologies .
Edit intent: clarity
Original:  Fortunately, depth-image-based rendering (DIBR)  allows each mobile client to synthesize the desired view from a nearby left view and right view, so that not all viewsof a video are necessary to be transmitted.
Revised:  Fortunately, depth-image-based rendering (DIBR) , which allows each mobile client to synthesize the desired view from a nearby left view and right view, so that not all viewsof a video are necessary to be transmitted.
Edit intent: coherence
Original:  Moreover, due to collisions, channel errors, or different network conditions, for example, multirate and multichannel, the transmitted views may be lost and each client may suffer different loss probability.
Revised:  Moreover, due to varied channel conditions, each client may suffer different loss probability.
Edit intent: clarity
Original:  We further demonstrate the superior performance of our approach when simulated annealing (SA) with uniform as well as nonuniform grids is employed for the initialization of GEM in low SNR regions.
Revised:  We further demonstrate the superior performance of our approach when simulated annealing (SA) with uniform as well as nonuniform grids is employed for initialization of GEM in low SNR regions.
Edit intent: fluency
Original:  We provide simulation results to show the  efficiency and effectiveness of the proposed algorithm.
Revised:  We provide simulation results to show the computational efficiency and effectiveness of the proposed algorithm.
Edit intent: clarity
Original: We consider the Minimum Feasible Tileset problem: Given a set of symbols and subsets of these symbols (scenarios), find a smallest possible number of pairs of symbols (tiles) such that each scenario can be formed by selecting at most one symbol from each tile.
Revised: We introduce and study the Minimum Feasible Tileset problem: Given a set of symbols and subsets of these symbols (scenarios), find a smallest possible number of pairs of symbols (tiles) such that each scenario can be formed by selecting at most one symbol from each tile.
Edit intent: clarity
Original: A topos theoretic generalisation of the category of sets permits ideas as for sets varying according to time intervals.
Revised: A topos theoretic generalisation of the category of sets allows for modelling spaces which vary according to time intervals.
Edit intent: clarity
Original:  Persistent homology is a central tool in topological data analysis, which examines the structure of data through topological structure .
Revised:  Persistent homology is a central tool in topological data analysis, which examines the structure of data through topology .
Edit intent: clarity
Original:  The basic technique is extended in many different directions, permuting the encoding of topological features by barcodes and correspondent persistence diagrams.
Revised:  The basic techniques have been extended in several different directions, permuting the encoding of topological features by barcodes and correspondent persistence diagrams.
Edit intent: clarity
Original:  The basic technique is extended in many different directions, permuting the encoding of topological features by barcodes and correspondent persistence diagrams.
Revised:  The basic technique is extended in many different directions, permuting the encoding of topological features by so called barcodes or equivalently persistence diagrams.
Edit intent: clarity
Original:  The set of points of all such diagrams determines a complete Heyting algebra that can explain aspects of the relations between correspondent persistence bars through the algebraic properties of its underlying lattice structure.
Revised:  The set of points of all such diagrams determines a complete Heyting algebra that can explain aspects of the relations between persistent bars through the algebraic properties of its underlying lattice structure.
Edit intent: clarity
Original:  In this paper we shall look at the topos of sheaves over such algebra,  discuss its construction and potential for a generalised simplicial homology over it.
Revised:  In this paper , we investigate the topos of sheaves over such algebra, discuss its construction and potential for a generalised simplicial homology over it.
Edit intent: clarity
Original:  In this paper we shall look at the topos of sheaves over such algebra,  discuss its construction and potential for a generalised simplicial homology over it.
Revised:  In this paper we shall look at the topos of sheaves over such algebra, as well as discuss its construction and potential for a generalised simplicial homology over it.
Edit intent: coherence
Original:  In particular we are interested in establishing a topos theoretic unifying theory for the various flavours of persistent homology that have emerged so far, providing a global perspective over the algebraic foundations of applied and computational algebraic topology.
Revised:  In particular we are interested in establishing a topos theoretic unifying theory for the various flavours of persistent homology that have emerged so far, providing a global perspective over the algebraic foundations of applied and computational topology.
Edit intent: fluency
Original: %DIFDELCMD < \noindent %%% We present an algorithm to 3-colour a graph G without triangles or induced paths on seven vertices in ] O(|V(G)| ^7)time.
Revised: %DIFDELCMD < \noindent %%% We present an algorithm to color a graph G without triangles or induced paths on seven vertices in ] O(|V(G)| ^7)time.
Edit intent: clarity
Original: An emerging area of research is to automatically compute reasonably precise upper bounds on numerical errors including roundoffs . Previous approaches for this task are limited in their precision and scalability, especially in the presence of branches and loops.
Revised: An emerging area of research is to automatically compute reasonably accurate upper bounds on numerical errors including roundoffs . Previous approaches for this task are limited in their precision and scalability, especially in the presence of branches and loops.
Edit intent: clarity
Original: An emerging area of research is to automatically compute reasonably precise upper bounds on numerical errors including roundoffs . Previous approaches for this task are limited in their precision and scalability, especially in the presence of branches and loops.
Revised: An emerging area of research is to automatically compute reasonably precise upper bounds on numerical errors including roundoffs . Previous approaches for this task are limited in their accuracy and scalability, especially in the presence of branches and loops.
Edit intent: fluency
Original:  We evaluate our system on a number of benchmarks from embedded systems and scientific computation, showing substantial improvements in precision and scalability over the state of the art.
Revised:  We evaluate our system on a number of benchmarks from embedded systems and scientific computation, showing substantial improvements in accuracy and scalability over the state of the art.
Edit intent: clarity
Original:  We evaluate our system on a number of benchmarks from  embedded systems and scientific computation, showing substantial improvements in accuracy and scalability over the state of the art .
Revised:  We evaluate Rosa on a number of benchmarks from embedded systems and scientific computation, showing substantial improvements in accuracy and scalability over the state of the art .
Edit intent: clarity
Original:  We evaluate our system on a number of benchmarks from  embedded systems and scientific computation, showing substantial improvements in accuracy and scalability over the state of the art .
Revised:  We evaluate our system on a number of benchmarks from scientific computing and embedded systems and scientific computation, showing substantial improvements in accuracy and scalability over the state of the art .
Edit intent: clarity
Original: The market values of harvested species rise as they become depleted due to falling supply, rarity value, or both.
Revised: As a harvested species is depleted, its harvest price often rises due to falling supply, rarity value, or both.
Edit intent: clarity
Original:  High price flexibility in response to depletion can cause profits to be stable or increase as a harvested population declinestoward extinction.
Revised:  There is concern that high price flexibility can cause extinction by buffering harvest profits against abundance declines. However, harvest costs also tend to increase as a harvested population declinestoward extinction.
Edit intent: clarity
Original:  Extinction requires the value of harvest to rise faster than the costs of harvest, which also likely increase as a population declines.
Revised:  Extinction requires the value of harvest to rise faster than costs as a population declines.
Edit intent: clarity
Original:  Drawing on evidence from bluefin tunas, sturgeons, whales, abalones, and other marine species, here I argue that increasing or stable profits as a population declines are likely to be driven to a greater extent by catch rates that are robust to abundance declines, termed 'hyperstable', usually as a result of range contraction , which buffer harvest costs, than by price flexibility.
Revised:  Drawing on evidence from bluefin tunas, sturgeons, whales, abalones, and other marine species, I find that conditions leading costs to be insensitive to abundance declines - particularly catch rates insensitive to abundance declines, termed 'hyperstable', usually as a result of range contraction , which buffer harvest costs, than by price flexibility.
Edit intent: clarity
Original:  My analysis also suggests a possible synergy between threats of habitat destruction, which imposes range contraction , and overharvesting .
Revised:  My analysis suggests that factors potentially causing coincident range contraction as a population declines - including herding or schooling behavior and habitat destruction - may be important but underappreciated factors contributing to price-related extinction threats .
Edit intent: clarity
Original:  My analysis suggests that factors potentially causing coincident range contraction as a population declines - including herding or schooling behavior and habitat destruction - may be important but underappreciated factors contributing to price-related extinction threats .
Revised:  My analysis suggests that factors potentially causing coincident range contraction as abundance declines may pose unexpectedly large extinction risks to harvested species .
Edit intent: clarity
Original:  Furthermore, we show that optimal purchase quantities occur at the large deviations scaling, and hence large positions endogenously arise in this setting.
Revised:  Furthermore, we show that optimal purchase quantities occur at the large deviations scaling, and hence large positions arise endogenously in this setting.
Edit intent: fluency
Original: We consider the problem of unconstrained minimization of a smooth function in the derivative-free setting  .
Revised: We consider the problem of unconstrained minimization of a smooth function in the derivative-free setting using .
Edit intent: clarity
Original:  Despite relevant research activity  spanning several decades, until recently no complexity guarantees---bounds on the number of function evaluations needed to find a satisfying point---for methods of this type were established . Moreover, existing complexity results require long proofs and the resulting bounds have a complicated form.
Revised:  Despite relevant research activity spanning several decades, complexity guarantees---bounds on the number of function evaluations needed to find a satisfying point---for methods of this type were established . Moreover, existing complexity results require long proofs and the resulting bounds have a complicated form.
Edit intent: coherence
Original:  Despite relevant research activity  spanning several decades, until recently no complexity guarantees---bounds on the number of function evaluations needed to find a satisfying point---for methods of this type were established . Moreover, existing complexity results require long proofs and the resulting bounds have a complicated form.
Revised:  Despite relevant research activity spanning several decades, until recently no complexity guarantees---bounds on the number of function evaluations needed to find an approximate solution---were not established until very recently.
Edit intent: clarity
Original:  In this paper we give a very brief and insightful analysis of pattern search for nonconvex, convex and strongly convex objective function, based on the observation that what is in the literature called an "unsuccessful step", is in fact a step that can drive the analysis .
Revised:  In this paper we give a very brief and insightful analysis of pattern search for nonconvex, convex and strongly convex functions .
Edit intent: clarity
Original:  We match the existing results in their dependence on the problem dimension (n) and error tolerance (\epsilon), but the overall complexity bounds are much simpler, easier to interpret, and have better dependence on other problem parameters.
Revised:  We match the existing results in their dependence on the problem dimension (n) and error tolerance (\epsilon), but the overall bounds are simpler, easier to interpret, and have better dependence on other problem parameters.
Edit intent: clarity