wanyu/IteraTeR_v2 huggingface dataset:
Original:  We analyse voters' rational behaviour in a two-phase game, allowing players to undergo a negotiation phase before their vote, and showing under what conditions undesirable equilibria can be removed as an effect of the pre-vote phase.
Revised:  We analyse voters' rational behaviour in a two-phase game, showing under what conditions undesirable equilibria can be removed as an effect of the pre-vote phase.
Edit intent: clarity
Original: We study voting games on binary issues, where voters might hold an objective over some issues at stake, while willing to strike deals on the remaining ones, and can influence one another's voting decision before the vote takes place  .
Revised: We study voting games on binary issues, where voters hold an objective over some issues at stake, while willing to strike deals on the remaining ones, and can influence one another's voting decision before the vote takes place .
Edit intent: clarity
Original: We study voting games on binary issues, where voters might hold an objective over some issues at stake, while willing to strike deals on the remaining ones, and can influence one another's voting decision before the vote takes place  .
Revised: We study voting games on binary issues, where voters might hold an objective over the outcome of the collective decision and are allowed, before the vote takes place .
Edit intent: clarity
Original:  We analyse  voters' rational behaviour in the resulting two-phase game, showing under what conditions undesirable equilibria can be removed as an effect of the pre-vote phase.
Revised:  We analyse the voters' rational behaviour in the resulting two-phase game, showing under what conditions undesirable equilibria can be removed as an effect of the pre-vote phase.
Edit intent: fluency
Original:  We analyse  voters' rational behaviour in the resulting two-phase game, showing under what conditions undesirable equilibria can be removed as an effect of the pre-vote phase.
Revised:  We analyse voters' rational behaviour in the resulting two-phase game, showing under what conditions undesirable equilibria can be removed and desirable ones sustained as a consequence of the pre-vote phase.
Edit intent: clarity
Original: The estimation of the rates of speciation and extinction provides important information on the macro-evolutionary processes shaping biodiversity through time (Ricklefs 2007).
Revised: Recent methodological advances are enabling better examination of speciation and extinction provides important information on the macro-evolutionary processes shaping biodiversity through time (Ricklefs 2007).
Edit intent: clarity
Original:  Among them, we can distinguish between lineage-dependent, trait-dependent, time-dependent and density-dependent changes . Lineage specific methods identify changes in speciation and extinction rates --- \lambda%DIFDELCMD < } %%% and \mu%DIFDELCMD < }%%% , respectively --- at inner nodes of a phylogenetic tree (Rabosky et al. 2007;
Revised:  Among them, we can distinguish between lineage-dependent, trait-dependent, time-dependent and density-dependent changes . Lineage specific methods identify changes in speciation and extinction rates --- %DIFDELCMD < } %%% and \mu%DIFDELCMD < }%%% , respectively --- at inner nodes of a phylogenetic tree (Rabosky et al. 2007;
Edit intent: fluency
Original:  Among them, we can distinguish between lineage-dependent, trait-dependent, time-dependent and density-dependent changes . Lineage specific methods identify changes in speciation and extinction rates --- \lambda%DIFDELCMD < } %%% and \mu%DIFDELCMD < }%%% , respectively --- at inner nodes of a phylogenetic tree (Rabosky et al. 2007;
Revised:  Among them, we can distinguish between lineage-dependent, trait-dependent, time-dependent and density-dependent changes . Lineage specific methods identify changes in speciation and extinction rates --- \lambda%DIFDELCMD < } %%% \mu%DIFDELCMD < }%%% , respectively --- at inner nodes of a phylogenetic tree (Rabosky et al. 2007;
Edit intent: coherence
Original:  Among them, we can distinguish between lineage-dependent, trait-dependent, time-dependent and density-dependent changes . Lineage specific methods identify changes in speciation and extinction rates --- \lambda%DIFDELCMD < } %%% and \mu%DIFDELCMD < }%%% , respectively --- at inner nodes of a phylogenetic tree (Rabosky et al. 2007;
Revised:  Among them, we can distinguish between lineage-dependent, trait-dependent, time-dependent and density-dependent changes . Lineage specific methods identify changes in speciation and extinction rates --- \lambda%DIFDELCMD < } %%% and %DIFDELCMD < }%%% , respectively --- at inner nodes of a phylogenetic tree (Rabosky et al. 2007;
Edit intent: fluency
Original:  We argue that it has certain advantages over existing approaches such as the {\em Hybrid model} of \mbox{ BenediS00 }  that combines {\em N-grams} and \WCFGs.
Revised:  We argue that it has certain advantages over existing approaches such as the {\em Hybrid model} of Bened } that combines {\em N-grams} and \WCFGs.
Edit intent: clarity
Original:  We show that given a quantum circuit C with n uninitialized inputs, poly (n) gates  and treewidth t, one can compute in time (n{\delta})^{\exp(O(t))} a classical witness y\in \{0,1\}^n that maximizes the acceptance probability of C up to a \delta additive factor.
Revised:  We show that given a quantum circuit C with n uninitialized inputs, poly (n) gates , and treewidth t, one can compute in time (n{\delta})^{\exp(O(t))} a classical witness y\in \{0,1\}^n that maximizes the acceptance probability of C up to a \delta additive factor.
Edit intent: fluency
Original:  We show that given a quantum circuit C with n uninitialized inputs, poly (n) gates  and treewidth t, one can compute in time (n{\delta})^{\exp(O(t))} a classical witness y\in \{0,1\}^n that maximizes the acceptance probability of C up to a \delta additive factor.
Revised:  We show that given a quantum circuit C with n uninitialized inputs, poly (n) gates and treewidth t, one can compute in time (n{\delta})^{\exp(O(t))} a classical assignment y\in \{0,1\}^n that maximizes the acceptance probability of C up to a \delta additive factor.
Edit intent: fluency
Original:  In particular  our algorithm runs in polynomial time if t is constant and 1/poly(n) \leq \delta < 1. For unrestricted values of t  this problem is known to be hard for the complexity class QCMA , a quantum generalization of NP . In contrast, we show that the same problem is already NP-hard if t=O(\log n) even when \delta is constant.
Revised:  In particular , our algorithm runs in polynomial time if t is constant and 1/poly(n) \leq \delta < 1. For unrestricted values of t this problem is known to be hard for the complexity class QCMA , a quantum generalization of NP . In contrast, we show that the same problem is already NP-hard if t=O(\log n) even when \delta is constant.
Edit intent: fluency
Original:  In particular  our algorithm runs in polynomial time if t is constant and 1/poly(n) \leq \delta < 1. For unrestricted values of t  this problem is known to be hard for the complexity class QCMA , a quantum generalization of NP . In contrast, we show that the same problem is already NP-hard if t=O(\log n) even when \delta is constant.
Revised:  In particular our algorithm runs in polynomial time if t is constant and 1/poly(n) < \delta < 1. For unrestricted values of t this problem is known to be hard for the complexity class QCMA , a quantum generalization of NP . In contrast, we show that the same problem is already NP-hard if t=O(\log n) even when \delta is constant.
Edit intent: clarity
Original:  In particular  our algorithm runs in polynomial time if t is constant and 1/poly(n) \leq \delta < 1. For unrestricted values of t  this problem is known to be hard for the complexity class QCMA , a quantum generalization of NP . In contrast, we show that the same problem is already NP-hard if t=O(\log n) even when \delta is constant.
Revised:  In particular our algorithm runs in polynomial time if t is constant and 1/poly(n) \leq \delta < 1. For unrestricted values of t , this problem is known to be hard for the complexity class QCMA , a quantum generalization of NP . In contrast, we show that the same problem is already NP-hard if t=O(\log n) even when \delta is constant.
Edit intent: fluency
Original:  Finally , we show that for t=O(\log n) and constant \delta , it is QMA-hard to find a quantum witness%DIFDELCMD < \ket{\varphi} %DIFDELCMD < %%% that maximizes-complete to determine whether there exists a quantum state \mid\!
Revised:  On the other hand , we show that for t=O(\log n) and constant \delta , it is QMA-hard to find a quantum witness%DIFDELCMD < \ket{\varphi} %DIFDELCMD < %%% that maximizes-complete to determine whether there exists a quantum state \mid\!
Edit intent: coherence
Original:  Finally , we show that for t=O(\log n) and constant \delta , it is QMA-hard to find a quantum witness%DIFDELCMD < \ket{\varphi} %DIFDELCMD < %%% that maximizes-complete to determine whether there exists a quantum state \mid\!
Revised:  Finally , we show that for t=O(\log n) and constant \delta , it is %DIFDELCMD < \ket{\varphi} %DIFDELCMD < %%% that maximizes-complete to determine whether there exists a quantum state \mid\!
Edit intent: coherence
Original:  Therefore , we introduce the concept of k-module and show how it relates to the separators of the linear matroid generated by the columns of S.
Revised:  For this purpose , we introduce the concept of k-module and show how it relates to the separators of the linear matroid generated by the columns of S.
Edit intent: coherence
Original:  As Mesoudi and O'Brien (2008) have shown  selection broadly favors social learning  that is hierarchical and structured, rather than information which is piecemeal and independent.
Revised:  As Mesoudi and O'Brien (2008) have shown , selection broadly favors social learning that is hierarchical and structured, rather than information which is piecemeal and independent.
Edit intent: fluency
Original:  As Mesoudi and O'Brien (2008) have shown  selection broadly favors social learning  that is hierarchical and structured, rather than information which is piecemeal and independent.
Revised:  As Mesoudi and O'Brien (2008) have shown selection broadly favors social learning of information that is hierarchical and structured, rather than information which is piecemeal and independent.
Edit intent: clarity
Original:  Here, we introduce a structured extension of the Axelrod  model of cultural differentiation  .
Revised:  Here, we introduce an extension of the Axelrod model of cultural differentiation .
Edit intent: clarity
Original:  We examine the conditions under which structured suites of traits develop and differentiate in the model, which can represent the chains of prerequisites, "background" information, and local specializations characteristic of real technology traditions .
Revised:  We examine the resulting structure of cultural repertoires as learning environments range from largely unstructured imitation, to structured teaching of necessary prerequisites, and we find that in combination with individual learning and innovation, high probabilities of teaching prerequisites leads to richer cultural repertoires .
Edit intent: coherence
Original:  We are interested in particular applications, in which the successful delivery of a packet depends on the correct reception of this packet and all its preceding packets.
Revised:  We are interested in applications, in which the successful delivery of a packet depends on the correct reception of this packet and all its preceding packets.
Edit intent: clarity
Original:  Although finding the optimal packet selection policy using SSP is computationally intractable, we employ this formulation to draw guidelines for the packet selection policies that can efficiently reduce the number of undelivered packets to all receivers over all transmissions until completion.
Revised:  Although finding the optimal packet selection policy using SSP is computationally complex, it allows us to systematically exploit the problem structure and draw guidelines for the packet selection policies that can efficiently reduce the number of undelivered packets to all receivers over all transmissions until completion.
Edit intent: clarity
Original:  Although finding the optimal packet selection policy using SSP is computationally intractable, we employ this formulation to draw guidelines for the packet selection policies that can efficiently reduce the number of undelivered packets to all receivers over all transmissions until completion.
Revised:  Although finding the optimal packet selection policy using SSP is computationally intractable, we employ this formulation to draw guidelines for efficient packet selection policies that can efficiently reduce the number of undelivered packets to all receivers over all transmissions until completion.
Edit intent: fluency
Original:  Although finding the optimal packet selection policy using SSP is computationally intractable, we employ this formulation to draw guidelines for the packet selection policies that can efficiently reduce the number of undelivered packets to all receivers over all transmissions until completion.
Revised:  Although finding the optimal packet selection policy using SSP is computationally intractable, we employ this formulation to draw guidelines for the packet selection policies that can reduce the number of undelivered packets to all receivers over all transmissions until completion.
Edit intent: clarity
Original:  In addition, we extend this heuristic to erasure channels with memory and introduce another layered algorithm.
Edit intent: coherence
Original:  Simulation results illustrate that our proposed algorithms provide quicker delivery of the packets to the receivers compared to the existing algorithms in the literature.
Revised:  Simulation results illustrate that our proposed algorithm provides quicker packet delivery to the receivers compared to the existing algorithms in the literature.
Edit intent: clarity
Original:  In this host-parasitoid system, virtually all hosts are found by the wasp on a landscape scale .
Revised:  The wasp is known to find virtually all hosts are found by the wasp on a landscape scale .
Edit intent: clarity
Original:  In this host-parasitoid system, virtually all hosts are found by the wasp on a landscape scale .
Revised:  In this host-parasitoid system, virtually all hosts on a landscape scale .
Edit intent: clarity
Original:  Yet only about a third of the eggs in any  host egg cluster are parasitized.
Revised:  Yet only about a third of the eggs in any given host egg cluster are parasitized.
Edit intent: clarity
Original:  We first propose, test , and reject a series of system-specific simple physiological constraints that might limit host exploitation, such as egg limitation of the wasp , and physical inaccessibility of some hosts .
Revised:  We first propose, test , and reject a series of system-specific simple physiological constraints such as egg limitation of the wasp , and physical inaccessibility of some hosts .
Edit intent: clarity
Original:  We first propose, test , and reject a series of system-specific simple physiological constraints that might limit host exploitation, such as egg limitation of the wasp , and physical inaccessibility of some hosts .
Revised:  We first propose, test , and reject a series of system-specific simple physiological constraints that might limit host exploitation, such as egg limitation of the wasp .
Edit intent: coherence
Original:  We then consider classical mechanisms of individual behavioral restraint , including prudent predation and bet-hedging , which fail as explanations because the wasp lives as a large and genetically well-mixed population.
Revised:  We then consider classical mechanisms of individual behavioral restraint . Prudent predation and bet-hedging , which fail as explanations because the wasp lives as a large and genetically well-mixed population.
Edit intent: coherence
Original:  We then consider classical mechanisms of individual behavioral restraint , including prudent predation and bet-hedging , which fail as explanations because the wasp lives as a large and genetically well-mixed population.
Revised:  We then consider classical mechanisms of individual behavioral restraint , including prudent predation and bet-hedging fail as explanations because the wasp lives as a large and genetically well-mixed population.
Edit intent: coherence
Original:  We then consider classical mechanisms of individual behavioral restraint , including prudent predation and bet-hedging , which fail as explanations because the wasp lives as a large and genetically well-mixed population.
Revised:  We then consider classical mechanisms of individual behavioral restraint , including prudent predation and bet-hedging , which fail as explanations because the wasp lives as a large well-mixed population.
Edit intent: clarity
Original:   We next build a simple optimal foraging model with and without 1) a penalty for multiple parasitism of the same host , and 2) the potential benefit of avoiding density-dependent hyperparasitism.
Revised:  We next build an optimal foraging model with and without 1) a penalty for multiple parasitism of the same host , and 2) the potential benefit of avoiding density-dependent hyperparasitism.
Edit intent: clarity
Original:   We next build a simple optimal foraging model with and without 1) a penalty for multiple parasitism of the same host , and 2) the potential benefit of avoiding density-dependent hyperparasitism.
Revised:  We next build a simple optimal foraging model with and without 1) a penalty for superparasitism , and 2) the potential benefit of avoiding density-dependent hyperparasitism.
Edit intent: clarity
Original:   We next build a simple optimal foraging model with and without 1) a penalty for multiple parasitism of the same host , and 2) the potential benefit of avoiding density-dependent hyperparasitism.
Revised:  We next build a simple optimal foraging model with and without 1) a penalty for multiple parasitism of the same host , and 2) avoidance of density-dependent hyperparasitism.
Edit intent: clarity
Original:  Since there is strong competition for host egg clusters, the simple idea of search time of optimal foraging theory, is modified by strength of competition, increasing with the number of individuals monitoring host egg clusters.
Revised:  Search time is modified by strength of competition, increasing with the number of individuals monitoring host egg clusters.
Edit intent: coherence
Original:  In the end, the optimal foraging model explains sub-maximal resource use and deterrent marking behavior of the parasitoid when there is a cost to superparasitism and the search time to find the next egg cluster is short .
Revised:  The model explains both sub-maximal resource use and deterrent marking behavior of the parasitoid when there is a cost to superparasitism and the search time to find the next egg cluster is short .
Edit intent: clarity
Original: Sub-maximal resourceuse comes at a cost to resource-limited individuals .
Revised: When there is conspicuous under-exploitation of a limited resource, it is worth asking what mechanisms allow presumably valuable resources to be left unused? Evolutionary biologists have generated a wide range of hypotheses to explain this, ranging from interdemic group selection to selfishly prudent individual restraint .
Edit intent: clarity
Original:  We consider a situation in which, in spite of strong intraspecific competition, resources are consistently left unexploited by a parasitoid wasp.
Revised:  We consider a situation in which, in spite of high intraspecific competition, resources are consistently left unexploited by a parasitoid wasp.
Edit intent: clarity
Original:  The wasp is known to find virtually all hosts on a landscapescale but parasitize only about a third of the eggs in any given host egg cluster.
Revised:  The wasp is known to find virtually all hosts on a landscapescale but parasitize only about a third of the eggs in each, and then leaves a deterrent mark around the cluster.
Edit intent: clarity
Original:  We first test and reject a series of system-specific simple physiological constraints such as egg limitation of the wasp .
Revised:  We first test , and reject, a series of system-specific simple physiological constraints such as egg limitation of the wasp .
Edit intent: fluency
Original:  We first test and reject a series of system-specific simple physiological constraints such as egg limitation of the wasp .
Revised:  We first test and reject a series of system-specific simple constraints that might limit full host exploitation, such as asynchronous maturation of host eggs .
Edit intent: clarity
Original:  We then consider classical mechanisms of individual behavioral restraint.
Revised:  We then consider classical hypotheses for the evolution of restraint.
Edit intent: clarity
Original:  The host caterpillars live gregariously, and we find no individual benefits for the parasitoid of living in a sparsely parasitized nest.
Revised:  Also, we find no individual benefits for the parasitoid of living in a sparsely parasitized nest.
Edit intent: coherence
Original:  The host caterpillars live gregariously, and we find no individual benefits for the parasitoid of living in a sparsely parasitized nest.
Revised:  The host caterpillars live gregariously, and we find no individual benefits to the parasitoid of living in a sparsely parasitized nest.
Edit intent: fluency
Original:  The host caterpillars live gregariously, and we find no individual benefits for the parasitoid of living in a sparsely parasitized nest.
Revised:  The host caterpillars live gregariously, and we find no individual benefits for the parasitoid of developing in a sparsely parasitized nest.
Edit intent: clarity
Original: In this paper we present truthful online incentive mechanisms for determining near optimal prices for minimizing payments in crowd sensing , which leverages the pervasive smartphones to efficiently collect or upload real-time sensing data, enabling numerous novel useful online applications, such as air quality or traffic monitoring services, etc.
Revised: In this paper we present truthful online incentive mechanisms for determining near optimal prices for minimizing payments in crowd sensing , which leverages the pervasive smartphones to efficiently collect and upload sensing data, enabling numerous novel useful online applications, such as air quality or traffic monitoring services, etc.
Edit intent: clarity
Original:  In particular, the mechanisms are designed to handle the intricacies of online crowd sensing applications where users arrive online , the platform (the provider of crowd sensing applications) have service constraints, and the value function of selected users ' services is monotone submodular.
Revised:  In particular, the mechanisms are designed to handle the intricacies of online crowd sensing applications where users arrive online , the platform (the provider of crowd sensing applications) have service constraints, and the value function of selected users is monotone submodular.
Edit intent: fluency
Original:  To demonstrate the mechanism's practical effectiveness we conducted simulations to validate the theoretical properties of the online mechanisms.
Revised:  Finally, we use extensive simulations to demonstrate the theoretical properties of the online mechanisms.
Edit intent: clarity
Original:  To demonstrate the mechanism's practical effectiveness we conducted simulations to validate the theoretical properties of the online mechanisms.
Revised:  To demonstrate the mechanism's practical effectiveness we conducted simulations to validate the theoretical properties of our mechanisms.
Edit intent: clarity