wanyu/IteraTeR_v2 huggingface dataset:
Original: We study a multiplicative limit order book model for an illiquid  market, where price impact by large orders is multiplicative in relation to the current price, transient over time  , and non-linear in volume (market) impact.
Revised: We study a multiplicative limit order book model for an illiquid market, where trading causes price impact which is multiplicative in relation to the current price, transient over time , and non-linear in volume (market) impact.
Edit intent: clarity
Original: We study a limit order book model for an illiquid financial market, where trading causes price impact which is multiplicative in relation to the current price, transient over time with finite rate of resilience, and non-linear in the order size.
Revised: We study a multiplicative transient price impact model for an illiquid financial market, where trading causes price impact which is multiplicative in relation to the current price, transient over time with finite rate of resilience, and non-linear in the order size.
Edit intent: clarity
Original:  The purpose of this note is to provide an informal introduction to the framework of exchangeable distributions on partitions in  financial context.
Revised:  The purpose of this note is to introduce framework of exchangeable distributions on partitions in financial context.
Edit intent: clarity
Original:  The purpose of this note is to provide an informal introduction to the framework of exchangeable distributions on partitions in  financial context.
Revised:  The purpose of this note is to provide an informal introduction to the framework of exchangeable distributions on partitions in the financial context.
Edit intent: fluency
Original:  Framework of the two-parameter Poisson-Dirichlet distribution contains rich set of methods and tools, such as consistent family of distributions on partitions, limiting distribution in infinite ranked simplex and associated diffusion processes .
Revised:  Framework of the two-parameter Poisson-Dirichlet distribution contains rich set of methods and tools, including infinite-dimensional diffusion process .
Edit intent: clarity
Original:  However, the use of mm-wave technologies in cellular networks is not straightforward due to mm-wave severe propagation conditions that limit access availability.
Revised:  However, the use of mm-wave technologies in cellular networks is not straightforward due to mm-wave harsh propagation conditions that limit access availability.
Edit intent: clarity
Original:  In order to overcome this obstacle, hybrid network architectures are being considered where mmwave small cells can exploit an overlay coverage layer based on legacy technology.
Revised:  In order to overcome this obstacle, hybrid network architectures are being considered where mm-wave small cells can exploit an overlay coverage layer based on legacy technology.
Edit intent: fluency
Original:  However, mm-wave technology requires multiple antennas and highly directional transmissions to compensate for high path loss and limited power . Directional transmissions must be also used for the cell discovery and synchronization process, and this can lead to a non negligible delay due to  need to scan the cell area with multiple transmissions in different angles .
Revised:  However, mm-wave technology requires high gain antenna systems to compensate for high path loss and limited power . Directional transmissions must be also used for the cell discovery and synchronization process, and this can lead to a non negligible delay due to need to scan the cell area with multiple transmissions in different angles .
Edit intent: clarity
Original:  However, mm-wave technology requires multiple antennas and highly directional transmissions to compensate for high path loss and limited power . Directional transmissions must be also used for the cell discovery and synchronization process, and this can lead to a non negligible delay due to  need to scan the cell area with multiple transmissions in different angles .
Revised:  However, mm-wave technology requires multiple antennas and highly directional transmissions to compensate for high path loss and limited power . Directional transmissions must be also used for the cell discovery and synchronization process, and this can lead to a non-negligible delay due to need to scan the cell area with multiple transmissions in different angles .
Edit intent: fluency
Original:  However, mm-wave technology requires multiple antennas and highly directional transmissions to compensate for high path loss and limited power . Directional transmissions must be also used for the cell discovery and synchronization process, and this can lead to a non negligible delay due to  need to scan the cell area with multiple transmissions in different angles .
Revised:  However, mm-wave technology requires multiple antennas and highly directional transmissions to compensate for high path loss and limited power . Directional transmissions must be also used for the cell discovery and synchronization process, and this can lead to a non negligible delay due to the need to scan the cell area with multiple transmissions in different angles .
Edit intent: fluency
Original:  However, mm-wave technology requires multiple antennas and highly directional transmissions to compensate for high path loss and limited power . Directional transmissions must be also used for the cell discovery and synchronization process, and this can lead to a non negligible delay due to  need to scan the cell area with multiple transmissions in different angles .
Revised:  However, mm-wave technology requires multiple antennas and highly directional transmissions to compensate for high path loss and limited power . Directional transmissions must be also used for the cell discovery and synchronization process, and this can lead to a non negligible delay due to need to scan the cell area with multiple transmissions at different directions .
Edit intent: clarity
Original:  In this paper, we propose to exploit the context information related to user position, provided by the separated control plane, to improve the cell search procedure and minimize delay.
Revised:  In this paper, we propose to exploit the context information related to user position, provided by the separated control plane, to improve the cell discovery procedure and minimize delay.
Edit intent: clarity
Original: This paper studies the empirical tracking performance of gold leveraged ETFs , and their price relationships with gold spot and futures.
Revised: This paper studies the empirical tracking performance of leveraged ETFs on gold , and their price relationships with gold spot and futures.
Edit intent: clarity
Original:  However, we show that gold leveraged ETFs tend to underperform their  leveraged benchmark.
Revised:  However, we show that leveraged gold ETFs tend to underperform their leveraged benchmark.
Edit intent: fluency
Original: In this paper, we analyze dynamic switching networks where the networks switch arbitrarily among a set of topologies.
Revised: In this paper, we analyze dynamic switching networks , wherein the networks switch arbitrarily among a set of topologies.
Edit intent: fluency
Original:  For this class of dynamic networks, we derive an epidemic threshold  considering the SIS epidemic model.
Revised:  For this class of dynamic networks, we derive an epidemic threshold , considering the SIS epidemic model.
Edit intent: fluency
Original:  First, an epidemic probabilistic model based on assumption of independence between states of nodes is developed .
Revised:  First, an epidemic probabilistic model is developed assuming independence between states of nodes is developed .
Edit intent: clarity
Original:  First, an epidemic probabilistic model based on assumption of independence between states of nodes is developed .
Revised:  First, an epidemic probabilistic model based on assumption of independence between states of nodes .
Edit intent: clarity
Original:  We identify conditions for the epidemic dying out by linearizing the underlying dynamical system and analyzing its asymptotic stability around the origin.
Revised:  We identify the conditions under which the epidemic dies out by linearizing the underlying dynamical system and analyzing its asymptotic stability around the origin.
Edit intent: clarity
Original:  The concept of joint spectral radius is then used to derive the epidemic threshold which we validate using a myriad of networks (Watts-Strogatz, Barabasi-Albert, MIT reality mining graphs, Regular, and Gilbert).
Revised:  The concept of joint spectral radius is then used to derive the epidemic threshold , which is later validated using several networks (Watts-Strogatz, Barabasi-Albert, MIT reality mining graphs, Regular, and Gilbert).
Edit intent: clarity
Original:  A simplified version of  epidemic threshold is proposed for undirected networks.
Revised:  A simplified version of the epidemic threshold is proposed for undirected networks.
Edit intent: fluency
Original:  Moreover, in the case of static networks, it is shown that the derived epidemic threshold matches with the conventional analytical results.
Revised:  Moreover, in the case of static networks, the derived epidemic threshold matches with the conventional analytical results.
Edit intent: coherence
Original:  Moreover, in the case of static networks, it is shown that the derived epidemic threshold matches with the conventional analytical results.
Revised:  Moreover, in the case of static networks, it is shown that the derived epidemic threshold is shown to match conventional analytical results.
Edit intent: clarity
Original:  Then, it is proved that analytical results for  epidemic threshold of dynamic networks are applicable to periodic networks.
Revised:  Then, analytical results for epidemic threshold of dynamic networks are applicable to periodic networks.
Edit intent: coherence
Original:  Then, it is proved that analytical results for  epidemic threshold of dynamic networks are applicable to periodic networks.
Revised:  Then, it is proved that analytical results for the epidemic threshold of dynamic networks are applicable to periodic networks.
Edit intent: fluency
Original:  We demonstrate for dynamic regular networks,  the epidemic threshold is the same as the epidemic threshold for static regular networks.
Revised:  For dynamic regular networks, the epidemic threshold is the same as the epidemic threshold for static regular networks.
Edit intent: clarity
Original:  We demonstrate for dynamic regular networks,  the epidemic threshold is the same as the epidemic threshold for static regular networks.
Revised:  We demonstrate for dynamic regular networks, we demonstrate that the epidemic threshold is the same as the epidemic threshold for static regular networks.
Edit intent: clarity
Original:  We demonstrate for dynamic regular networks,  the epidemic threshold is the same as the epidemic threshold for static regular networks.
Revised:  We demonstrate for dynamic regular networks, the epidemic threshold is identical to the epidemic threshold for static regular networks.
Edit intent: clarity
Original:  An upper bound for the probability of epidemic spread out in dynamic Gilbert networks is also derived and verified using simulation.
Revised:  An upper bound for the epidemic spread probability in dynamic Gilbert networks is also derived and verified using simulation.
Edit intent: fluency
Original:  The mathematical properties include the total minimum mechanical power, the minimum dissipation theorem, a reciprocal relation, and a maximum principle for the vorticity.
Revised:  The mathematical properties include the total minimum mechanical power, minimum dissipation theorem, a reciprocal relation, and a maximum principle for the vorticity.
Edit intent: fluency
Original:  The mathematical properties include the total minimum mechanical power, the minimum dissipation theorem, a reciprocal relation, and a maximum principle for the vorticity.
Revised:  The mathematical properties include the total minimum mechanical power, the minimum dissipation theorem, reciprocal relation, and a maximum principle for the vorticity.
Edit intent: fluency
Original:  The mathematical properties include the total minimum mechanical power, the minimum dissipation theorem, a reciprocal relation, and a maximum principle for the vorticity.
Revised:  The mathematical properties include the total minimum mechanical power, the minimum dissipation theorem, a reciprocal relation, and maximum principle for the vorticity.
Edit intent: fluency
Original:  We will also show that a similar result holds for a Darcy-Brinkman velocity.
Revised:  We also show that a similar result holds for a Darcy-Brinkman velocity.
Edit intent: coherence
Original:  We will also show that a similar result holds for a Darcy-Brinkman velocity.
Revised:  We will also show that a similar result holds for Darcy-Brinkman velocity.
Edit intent: fluency
Original:  We also show that for a conservative body force, the Darcy velocity and the Darcy-Brinkman velocity have the minimum total dissipation among their respective kinematically admissible vector fields.
Revised:  We then show for a conservative body force, the Darcy velocity and the Darcy-Brinkman velocity have the minimum total dissipation among their respective kinematically admissible vector fields.
Edit intent: clarity
Original:  We also show that for a conservative body force, the Darcy velocity and the Darcy-Brinkman velocity have the minimum total dissipation among their respective kinematically admissible vector fields.
Revised:  We also show that for a conservative body force, the Darcy and Darcy-Brinkman velocity have the minimum total dissipation among their respective kinematically admissible vector fields.
Edit intent: fluency
Original:  We also show that for a conservative body force, the Darcy velocity and the Darcy-Brinkman velocity have the minimum total dissipation among their respective kinematically admissible vector fields.
Revised:  We also show that for a conservative body force, the Darcy velocity and the Darcy-Brinkman velocities have the minimum total dissipation among their respective kinematically admissible vector fields.
Edit intent: clarity
Original:  Using numerical examples, we show that the minimum dissipation theorem can be utilized  identify pollution errors in numerical solutions.
Revised:  Using numerical examples, we show that the minimum dissipation theorem can be utilized to identify pollution errors in numerical solutions.
Edit intent: fluency
Original:  We then show that the solutions to Darcy and Darcy-Brinkman equations  satisfy a reciprocal relation, which has the potential to identify errors in the numerical implementation of boundary conditions .
Revised:  The solutions to Darcy and Darcy-Brinkman equations satisfy a reciprocal relation, which has the potential to identify errors in the numerical implementation of boundary conditions .
Edit intent: coherence
Original:  Recent advancements in smart devices as well as radio access technologies promote the bulky content consumption even in the people riding vehicles, named as nomadic heavy users.
Revised:  Recent advancements in smart devices as well as radio access technologies promote the consumption of bulky content, even for people in moving vehicles, referred to as nomadic heavy users.
Edit intent: clarity
Original:  In this article the emergence of nomadic heavy user traffic is observed by the field experiments conducted in 2012 and 2014 in Seoul, Korea.
Revised:  In this article the emergence of nomadic heavy user traffic is observed by field experiments conducted in 2012 and 2014 in Seoul, Korea.
Edit intent: fluency
Original:  The association exploits the user traffic pattern that is convex-shaped over velocity, i.e. walking user traffic is less than stationary or nomadic user traffic, which is also experimentally discovered first by the field trials.
Revised:  The association exploits the user traffic pattern that is convex-shaped over velocity, i.e. walking user traffic is less than stationary or nomadic user traffic, which was also experimentally discovered first by the field trials.
Edit intent: fluency
Original:  Recent advancements in smart devices as well as radio access technologies promote the consumption of bulky content, even for people in moving vehicles, referred to as nomadic heavy users.
Revised:  Recent advancements in smart devices as well as radio access technologies promote the consumption of bulky content, even for people in moving vehicles, referred to as vehicular heavy users.
Edit intent: clarity
Original:  The experiments reveal that such traffic is becoming dominant, captured by the 8.62 times increase in nomadic heavy user traffic while the total traffic increased 3.04 times.
Revised:  The experiments reveal that such traffic is becoming dominant, captured by the 8.62 times increase in vehicular heavy user traffic while the total traffic increased 3.04 times.
Edit intent: clarity
Original:  For the purpose of resolving this so-called nomadic heavy user problem ( NHP), a cell association algorithm is proposed.
Revised:  To resolve this so-called nomadic heavy user problem ( NHP), a cell association algorithm is proposed.
Edit intent: coherence
Original:  Numerical evaluation verifies the proposed association outperforms the cell range expansion (CRE) based scheme in practice as the NHP becomes severe .
Revised:  Numerical evaluation verifies the proposed association outperforms the cell range expansion (CRE) .
Edit intent: clarity
Original:  We also determine a formula for the number of vertices of the smallest fullerenes with a given minimum face-distance between any two pentagons and determine the number of fullerenes where the minimum face-distance between any two pentagons is at least d, for 1%DIFDELCMD < \le %%% d%DIFDELCMD < \le %%% 4, up to 380 vertices.
Revised:  %DIFDELCMD < \le %%% d%DIFDELCMD < \le %%% 4, up to 380 vertices.
Edit intent: coherence
Original:  We also determine a formula for the number of vertices of the smallest fullerenes with a given minimum face-distance between any two pentagons and determine the number of fullerenes where the minimum face-distance between any two pentagons is at least d, for 1%DIFDELCMD < \le %%% d%DIFDELCMD < \le %%% 4, up to 380 vertices.
Revised:  We also determine a formula for the number of vertices of the smallest fullerenes with a given minimum face-distance between any two pentagons and determine the number of fullerenes where the minimum face-distance between any two pentagons is at least d, for 1%DIFDELCMD < \le %%% %DIFDELCMD < \le %%% 4, up to 380 vertices.
Edit intent: clarity
Original:   In this paper, we introduce the problem of %DIFDELCMD < {\em %%% Quality-Sponsored Data (QSD) in cellular networks and study its implications on market entities in various scenarios.
Revised:  In this paper, we consider the problem of %DIFDELCMD < {\em %%% Quality-Sponsored Data (QSD) in cellular networks and study its implications on market entities in various scenarios.
Edit intent: clarity
Original:  In our model, SPs make a portion of their resources available for sponsorship by CPs , and price it appropriately to maximize their payoff , which depends on the monetary revenue and the satisfaction of end-users both for the non-sponsored and sponsored content, while CPs generate revenue through advertisement.
Revised:  In our model, SPs allow CPs to sponsor a portion of their resources available for sponsorship by CPs , and price it appropriately to maximize their payoff , which depends on the monetary revenue and the satisfaction of end-users both for the non-sponsored and sponsored content, while CPs generate revenue through advertisement.
Edit intent: clarity
Original:  In our model, SPs make a portion of their resources available for sponsorship by CPs , and price it appropriately to maximize their payoff , which depends on the monetary revenue and the satisfaction of end-users both for the non-sponsored and sponsored content, while CPs generate revenue through advertisement.
Revised:  In our model, SPs make a portion of their resources , and price it appropriately to maximize their payoff , which depends on the monetary revenue and the satisfaction of end-users both for the non-sponsored and sponsored content, while CPs generate revenue through advertisement.
Edit intent: clarity
Original:  In our model, SPs make a portion of their resources available for sponsorship by CPs , and price it appropriately to maximize their payoff , which depends on the monetary revenue and the satisfaction of end-users both for the non-sponsored and sponsored content, while CPs generate revenue through advertisement.
Revised:  In our model, SPs make a portion of their resources available for sponsorship by CPs , and price it appropriately to maximize their payoff . The payoff of the SP depends on the monetary revenue and the satisfaction of end-users both for the non-sponsored and sponsored content, while CPs generate revenue through advertisement.
Edit intent: clarity
Original:  We also discuss about the effects of different parameters of the model on marketdynamics .
Revised:  We also discuss about the effects of different parameters of the market .
Edit intent: clarity
Original:  We use our model to show that the joint distribution of pairwise coalescence times at recombination sites under the SMC' is the same as it is marginally under the ARG, demonstrating that the SMC' is the canonical first-order sequentially Markov approximation to the pairwise ARG. Finally, we use these results to show that population size estimates under the pairwise SMC are asymptotically biased, while under the pairwise SMC' they are approximately asymptotically unbiased.
Revised:  We use our process to show that the joint distribution of pairwise coalescence times at recombination sites under the SMC' is the same as it is marginally under the ARG, demonstrating that the SMC' is the canonical first-order sequentially Markov approximation to the pairwise ARG. Finally, we use these results to show that population size estimates under the pairwise SMC are asymptotically biased, while under the pairwise SMC' they are approximately asymptotically unbiased.
Edit intent: clarity
Original:  We use our model to show that the joint distribution of pairwise coalescence times at recombination sites under the SMC' is the same as it is marginally under the ARG, demonstrating that the SMC' is the canonical first-order sequentially Markov approximation to the pairwise ARG. Finally, we use these results to show that population size estimates under the pairwise SMC are asymptotically biased, while under the pairwise SMC' they are approximately asymptotically unbiased.
Revised:  We use our model to show that the joint distribution of pairwise coalescence times at recombination sites under the SMC' is the same as it is marginally under the ARG, which demonstrates that the SMC' is the canonical first-order sequentially Markov approximation to the pairwise ARG. Finally, we use these results to show that population size estimates under the pairwise SMC are asymptotically biased, while under the pairwise SMC' they are approximately asymptotically unbiased.
Edit intent: coherence
Original:  We use our model to show that the joint distribution of pairwise coalescence times at recombination sites under the SMC' is the same as it is marginally under the ARG, demonstrating that the SMC' is the canonical first-order sequentially Markov approximation to the pairwise ARG. Finally, we use these results to show that population size estimates under the pairwise SMC are asymptotically biased, while under the pairwise SMC' they are approximately asymptotically unbiased.
Revised:  We use our model to show that the joint distribution of pairwise coalescence times at recombination sites under the SMC' is the same as it is marginally under the ARG, demonstrating that the SMC' is the canonical first-order sequentially Markov approximation to the ARG. Finally, we use these results to show that population size estimates under the pairwise SMC are asymptotically biased, while under the pairwise SMC' they are approximately asymptotically unbiased.
Edit intent: fluency