wanyu/IteraTeR_v2 huggingface dataset:
Original:  The second method is importance sampling on genealogies, based on a characterization of the optimal proposal distribution that extends previous results to the variable-size setting.
Revised:  The second method is importance sampling on genealogies, based on a new result for the optimal proposal distribution that extends previous results to the variable-size setting.
Edit intent: clarity
Original:  The second method is importance sampling on genealogies, based on a characterization of the optimal proposal distribution that extends previous results to the variable-size setting.
Revised:  The second method is importance sampling on genealogies, based on a characterization of the optimal proposal distribution in the variable-size setting.
Edit intent: clarity
Original:  The model predicts regimes where bacterial and phage populations can co-exist, others where the populations oscillate , and still others where one population is driven to extinction.
Revised:  The model predicts regimes where bacterial and phage populations can co-exist, others where the populations exhibit damped oscillations , and still others where one population is driven to extinction.
Edit intent: clarity
Original:  Bacteria can interpolate between these limiting behaviors by actively tuning their overall acquisition rate .
Revised:  Bacteria can interpolate between these limiting behaviors by actively tuning their overall acquisition probability .
Edit intent: clarity
Original:  Scholars have attempted to understand such extraordinary credibility, but usually used the edit number without consideration of real-time.
Revised:  Scholars have attempted to understand such extraordinary credibility, but usually used the number of edits as the unit of time, without consideration of real-time.
Edit intent: clarity
Original:  By considering real-time, we find the existence of various growth patterns that are unobserved in terms of the number of edits as the time step .
Revised:  By considering real-time, we find the existence of distinct growth patterns that are unobserved in terms of the number of edits as the time step .
Edit intent: clarity
Original:  By considering real-time, we find the existence of various growth patterns that are unobserved in terms of the number of edits as the time step .
Revised:  By considering real-time, we find the existence of various growth patterns that are unobserved by utilizing the number of edits as the time step .
Edit intent: clarity
Original:  By considering real-time, we find the existence of various growth patterns that are unobserved in terms of the number of edits as the time step .
Revised:  By considering real-time, we find the existence of various growth patterns that are unobserved in terms of the number of edits as the unit of time .
Edit intent: clarity
Original:  The model successfully generates some key properties of the real Wikipedia articles such as distinct types of articles for the editing patterns characterized by the interrelationship between the numbers of edits and editors, and the article size.
Revised:  The model successfully generates key properties of the real Wikipedia articles such as distinct types of articles for the editing patterns characterized by the interrelationship between the numbers of edits and editors, and the article size.
Edit intent: clarity
Original:  We suggest that this decay of participants eventually brings inequality among the editors, which will be more severe with time.
Revised:  We suggest that this decay of participants eventually brings inequality among the editors, which will become more severe with time.
Edit intent: fluency
Original: Wikipedia is a free Internet encyclopedia with  enormous amount of contents .
Revised: Wikipedia is a free Internet encyclopedia with an enormous amount of contents .
Edit intent: fluency
Original: Wikipedia is a free Internet encyclopedia with  enormous amount of contents .
Revised: Wikipedia is a free Internet encyclopedia with enormous amount of content .
Edit intent: fluency
Original:  This open editing nature may give us prejudice that Wikipedia is  unstable and unreliable sources ;
Revised:  This open-editing nature may give us prejudice that Wikipedia is unstable and unreliable sources ;
Edit intent: fluency
Original:  This open editing nature may give us prejudice that Wikipedia is  unstable and unreliable sources ;
Revised:  This open editing nature may give us prejudice that Wikipedia is an unstable and unreliable sources ;
Edit intent: fluency
Original:  This open editing nature may give us prejudice that Wikipedia is  unstable and unreliable sources ;
Revised:  This open editing nature may give us prejudice that Wikipedia is unstable and unreliable source ;
Edit intent: fluency
Original:  Scholars have attempted to understand such extraordinary credibility, but usually used the number of edits as the unit of time, without consideration of real-time .
Revised:  Scholars have attempted to understand such extraordinary credibility, but usually used the number of edits as the unit of time, without consideration of real time .
Edit intent: fluency
Original:  In this work, we probe the formation of such collective intelligence through the systematic analysis using the entire history of 34,534,110 English Wikipedia articles, between 2001 and 2014.
Revised:  In this work, we probe the formation of such collective intelligence through a systematic analysis using the entire history of 34,534,110 English Wikipedia articles, between 2001 and 2014.
Edit intent: fluency
Original:  By considering real-time , we find the existence of distinct growth patterns that are unobserved by utilizing the number of edits as the unit of time.
Revised:  By considering real time , we find the existence of distinct growth patterns that are unobserved by utilizing the number of edits as the unit of time.
Edit intent: fluency
Original:  To account  these results, we present a mechanistic model that adopts both the article editing dynamics based on  editor-editor and editor-article interactions.
Revised:  To account for these results, we present a mechanistic model that adopts both the article editing dynamics based on editor-editor and editor-article interactions.
Edit intent: fluency
Original:  To account  these results, we present a mechanistic model that adopts both the article editing dynamics based on  editor-editor and editor-article interactions.
Revised:  To account these results, we present a mechanistic model that adopts the article editing dynamics based on editor-editor and editor-article interactions.
Edit intent: clarity
Original:  To account  these results, we present a mechanistic model that adopts both the article editing dynamics based on  editor-editor and editor-article interactions.
Revised:  To account these results, we present a mechanistic model that adopts both the article editing dynamics based on both editor-editor and editor-article interactions.
Edit intent: coherence
Original:  The model successfully generates  key properties of the real Wikipedia articles such as distinct types of articles for the editing patterns characterized by the interrelationship between the numbers of edits and editors, and the article size.
Revised:  The model successfully generates the key properties of the real Wikipedia articles such as distinct types of articles for the editing patterns characterized by the interrelationship between the numbers of edits and editors, and the article size.
Edit intent: fluency
Original:  The model successfully generates  key properties of the real Wikipedia articles such as distinct types of articles for the editing patterns characterized by the interrelationship between the numbers of edits and editors, and the article size.
Revised:  The model successfully generates key properties of real Wikipedia articles such as distinct types of articles for the editing patterns characterized by the interrelationship between the numbers of edits and editors, and the article size.
Edit intent: fluency
Original:  In addition, the model indicates that infrequently referred articles tend to grow faster than frequently referred one , and articles attracting high motivation of edit counterintuitively reduce the number of participants.
Revised:  In addition, the model indicates that infrequently referred articles tend to grow faster than frequently referred ones , and articles attracting high motivation of edit counterintuitively reduce the number of participants.
Edit intent: fluency
Original:  In addition, the model indicates that infrequently referred articles tend to grow faster than frequently referred one , and articles attracting high motivation of edit counterintuitively reduce the number of participants.
Revised:  In addition, the model indicates that infrequently referred articles tend to grow faster than frequently referred one , and articles attracting a high motivation to edit counterintuitively reduce the number of participants.
Edit intent: fluency
Original: Caching popular contents for frequent access is an attractive way of exploiting the redundancy of user requests.
Revised: Caching popular contents for frequent access is an attractive way of employing the redundancy of user requests.
Edit intent: clarity
Original:  We contribute to analyzing the cache-based content delivery in a two-tier heterogeneous network (HetNet) composed of base stations (BSs) and device-to-device (D2D) pairs, where the D2D accesses the networks with overlay spectrum sharing.
Revised:  We contribute to analyzing the cache-based content delivery in a twotier heterogeneous network (HetNet) composed of base stations (BSs) and device-to-device (D2D) pairs, where the D2D accesses the networks with overlay spectrum sharing.
Edit intent: fluency
Original:  Node locations are first modeled as mutually independent Poisson Point Processes (PPPs), and the  corresponding tier association and cognitive access protocol are developed.
Revised:  Node locations are first modeled as mutually independent Poisson Point Processes (PPPs), and the service queueing process is formulated. The corresponding tier association and cognitive access protocol are developed.
Edit intent: clarity
Original:  The number of BSs and D2D TXs in the SSR are then analyzed.
Revised:  Then the number of BSs and D2D TXs in the SSR are then analyzed.
Edit intent: coherence
Original:  The number of BSs and D2D TXs in the SSR are then analyzed.
Revised:  The number of BSs and D2D TXs in the SSR are analyzed.
Edit intent: clarity
Original:  We further elaborate the probability mass function (PMF) of the delay and  queue length, with modeling the traffic dynamics of request arrivals and departures at the BS and D2D TX as the discrete-time multiserver queue with priorities.
Revised:  We further elaborate the probability mass function (PMF) of the delay and the queue length, with modeling the traffic dynamics of request arrivals and departures at the BS and D2D TX as the discrete-time multiserver queue with priorities.
Edit intent: fluency
Original: Caching popular contents for frequent access is an attractive way of employing the redundancy of user requests.
Edit intent: clarity
Original:  We contribute to analyzing the cache-based content delivery in a twotier heterogeneous network (HetNet) composed of base stations (BSs)and device-to-device ( D2D ) pairs, where the D2D accesses the networks with overlay spectrum sharing .
Revised:  D2D ) pairs, where the D2D accesses the networks with overlay spectrum sharing .
Edit intent: coherence
Original:  Node locations are first modeled as mutually independent Poisson Point Processes (PPPs) , and the service queueing process is formulated.
Revised:  Node locations are first modeled as mutually independent Poisson Point Processes , and the service queueing process is formulated.
Edit intent: clarity
Original:  The corresponding tier association and cognitive access protocol are developed.
Revised:  Then the corresponding tier association and cognitive access protocol are developed.
Edit intent: coherence
Original: Network alignment is an important tool with extensive applications in comparative interactomics.
Revised: Network alignment has extensive applications in comparative interactomics.
Edit intent: clarity
Original:  We propose a novel formulation of the network alignment problem that extends topological similarity to higher-order structures and provide a new objective function that maximizes the number of aligned substructures.
Revised:  We propose a novel formulation of the network alignment problem that extends topological similarity to higher-order structures and provides a new objective function that maximizes the number of aligned substructures.
Edit intent: fluency
Original:  Using a case study on the NAPABench dataset, we show that TAME is capable of producing alignments with up to 99%DIFDELCMD < \\%%% %DIF < accuracy in terms of aligned nodes .
Revised:  Using a case study on the NAPAbench dataset, we show that TAME is capable of producing alignments with up to 99%DIFDELCMD < \\%%% %DIF < accuracy in terms of aligned nodes .
Edit intent: fluency
Original:  Using a case study on the NAPABench dataset, we show that TAME is capable of producing alignments with up to 99%DIFDELCMD < \\%%% %DIF < accuracy in terms of aligned nodes .
Revised:  Using a case study on the NAPABench dataset, we show that TAME is capable of producing %DIFDELCMD < \\%%% %DIF < accuracy in terms of aligned nodes .
Edit intent: clarity
Original:  Our results indicate that TAME outperforms the state-of-art alignment methods both in terms of biological and topological quality of the alignments .
Revised:  Our results indicate that TAME outperforms the state-of-art alignment methods in terms of biological and topological quality of the alignments .
Edit intent: clarity
Original: Alternating-time temporal logic ATL allows to specify requirements on abilities that different agents should (or should not) possess in a multi-agent system.
Revised: Alternating-time temporal logic (ATL) allows to specify requirements on abilities that different agents should (or should not) possess in a multi-agent system.
Edit intent: clarity
Original:  In particular, if the agents don't have perfect information about the global state of the system, the complexity ranges from Delta2P to undecidable, depending on  syntactic and semantic details.
Revised:  In particular, if the agents have imperfect information about the global state of the system, the complexity ranges from Delta2P to undecidable, depending on syntactic and semantic details.
Edit intent: fluency
Original:  In particular, if the agents don't have perfect information about the global state of the system, the complexity ranges from Delta2P to undecidable, depending on  syntactic and semantic details.
Revised:  In particular, if the agents don't have perfect information about the global state of the system, the complexity ranges from Delta2P to undecidable, depending on the syntactic and semantic details.
Edit intent: fluency
Original:   In this work, we propose to approximate model checking of ATL with imperfect information by verification of their "naive" translations to alternating epistemic mu-calculus .
Revised:  In this work, we look at the idea of approximating the former problem by the verification of its "naive" translations to alternating epistemic mu-calculus .
Edit intent: clarity
Original:   In this work, we propose to approximate model checking of ATL with imperfect information by verification of their "naive" translations to alternating epistemic mu-calculus .
Revised:  In this work, we propose to approximate model checking of ATL with imperfect information by verification of their "naive" translations to the latter .
Edit intent: clarity
Original: We investigate the dependence of the site frequency spectrum (SFS) on the topological structure of coalescent trees.
Revised: We investigate the dependence of the site frequency spectrum (SFS) on the topological structure of genealogical trees.
Edit intent: clarity
Original:  We show that basic population genetic statistics - for instance estimators of theta or neutrality tests such as Tajima's D - can be decomposed into components of waiting times between coalescent events and of tree topology.
Revised:  We show that basic population genetic statistics - for instance estimators of \theta or neutrality tests such as Tajima's D - can be decomposed into components of waiting times between coalescent events and of tree topology.
Edit intent: fluency
Original:  We use this framework to prove an oracle separation between QCMA and QMA using an `` in-place '' permutation oracle, making the first progress on this question since Aaronson and Kuperberg in 2007.
Revised:  We use this framework to prove an oracle separation between QCMA and QMA using an " in-place '' permutation oracle, making the first progress on this question since Aaronson and Kuperberg in 2007.
Edit intent: fluency
Original:  We use this framework to prove an oracle separation between QCMA and QMA using an `` in-place '' permutation oracle, making the first progress on this question since Aaronson and Kuperberg in 2007.
Revised:  We use this framework to prove an oracle separation between QCMA and QMA using an `` in-place " permutation oracle, making the first progress on this question since Aaronson and Kuperberg in 2007.
Edit intent: fluency
Original:  While methods developed for human studies can correct for strain structure, this risks considerable loss- of-power because genetic differences between strains often contribute substantial phenotypic variability.
Revised:  While methods developed for human studies can correct for strain structure, this risks considerable loss-of-power because genetic differences between strains often contribute substantial phenotypic variability.
Edit intent: fluency
Original:  Strong selection, recombination and penetrance confer high power to recover known antimicrobial resistance mechanisms, and reveal a novel association between the outer membrane porin nmpC and cefazolin resistance in E. coli.
Revised:  Strong selection, recombination and penetrance confer high power to recover known antimicrobial resistance mechanisms, and reveal a candidate association between the outer membrane porin nmpC and cefazolin resistance in E. coli.
Edit intent: clarity
Original:  While methods developed for human studies can correct for strain structure, this risks considerable loss-of-power because genetic differences between strains often contribute substantial phenotypic variability.
Revised:  While methods developed for human studies can correct for strain structure, this risks considerable loss- of-power because genetic differences between strains often contribute substantial phenotypic variability.
Edit intent: fluency
Original:  In particular, we show that, on the one hand the problem is NP-hard, but on the other hand, it admits a polynomial-time algorithm with respect to the number of data  for any fixed data dimension and number of modes.
Revised:  In particular, we show that, on the one hand the problem is NP-hard, but on the other hand, it admits a polynomial-time algorithm with respect to the number of data points for any fixed data dimension and number of modes.
Edit intent: clarity
Original:  A conjecture of Mohar (2007) asserts that all k-colourings, k \geq 3,  of a k-regular graph that is not complete are Kempe equivalent.
Revised:  A conjecture of Mohar (2007) asserts that , for k \geq 3, of a k-regular graph that is not complete are Kempe equivalent.
Edit intent: clarity
Original:  It was later shown that all 3-colourings of a cubic graph that is not K_4 or the triangular prism are Kempe equivalent.
Revised:  It was later shown that all 3-colourings of a cubic graph that is neitherK_4 nor the triangular prism are Kempe equivalent.
Edit intent: fluency
Original:  It was later shown that all 3-colourings of a cubic graph that is neitherK _4 nor the triangular prism are Kempe equivalent.
Revised:  It was later shown that all 3-colourings of a cubic graph that is neither K _4 nor the triangular prism are Kempe equivalent.
Edit intent: fluency
Original:  We also report the implications of this result on the ergodicity of the Wang-Swendsen-Koteck\'{y} algorithm for the antiferromagnetic Potts model at zero-temperature.
Revised:  We also report the implications of this result on the validity of the Wang-Swendsen-Koteck\'{y} algorithm for the antiferromagnetic Potts model at zero-temperature.
Edit intent: clarity
Original: As current airborne and spaceborne synthetic aperture radar (SAR) systems aim to produce higher resolution and wider area products , their associated complexities call for handling stricter requirements.
Revised: As current airborne and spaceborne synthetic aperture radar (SAR) systems associated with higher resolution and wider area products , their associated complexities call for handling stricter requirements.
Edit intent: clarity
Original:  When a multidimensional stochastic dynamical system possesses quantities that are approximately conserved on short timescales, it is common to observe on long timescales that trajectories remain close to some lower-dimensional subspace.
Revised:  When a multidimensional stochastic dynamical system possesses quantities that are approximately conserved on short timescales, in which case system trajectories are observed to remain close to some lower-dimensional subspace.
Edit intent: clarity
Original:  Here, we derive explicit and general formulae for a reduced-dimension description of such a process that is exact in the limit of small noise and well-separated slow and fast dynamics.
Revised:  Here, we derive explicit and general formulae for a reduced-dimension description of such processes that is exact in the limit of small noise and well-separated slow and fast dynamics.
Edit intent: fluency
Original:  The Michaelis-Menten law of enzyme-catalyzed reactions is explored as a worked example . Extensions of the method are presented for infinite dimensional systems and processes coupled to general noise sources.
Revised:  The Michaelis-Menten law of enzyme-catalyzed reactions is explored as a simple worked examples . Extensions of the method are presented for infinite dimensional systems and processes coupled to general noise sources.
Edit intent: clarity
Original:  A host of socioeconomic and cognitive factors are believed to affect social interactions, but few of these factors have been empirically validated  .
Revised:  A host of socioeconomic and cognitive factors were implicated in the formation of offline social ties, few of them have been empirically validated .
Edit intent: clarity
Original:  In this research work, we extracted a large corpus of data from a popular social media platform that consists of geo-referenced messages, or tweets, posted  from a major US metropolitan area.
Revised:  In this study, we analyze a large corpus of data from a popular social media platform that consists of geo-referenced messages, or tweets, posted from a major US metropolitan area.
Edit intent: clarity
Original:  In this research work, we extracted a large corpus of data from a popular social media platform that consists of geo-referenced messages, or tweets, posted  from a major US metropolitan area.
Revised:  In this research work, we extracted a large corpus of geo-referenced messages, or tweets, posted from a major US metropolitan area.
Edit intent: clarity
Original:  This allowed us to measure emotions expressed in  tweets posted from a specific area, and also use that area's socioeconomic and demographic characteristics in the analysis.
Revised:  This allowed us to measure emotions expressed in the tweets posted from a specific area, and also use that area's socioeconomic and demographic characteristics in the analysis.
Edit intent: fluency
Original:  This allowed us to measure emotions expressed in  tweets posted from a specific area, and also use that area's socioeconomic and demographic characteristics in the analysis.
Revised:  This allowed us to measure emotions expressed in tweets posted from a specific area, and also use that area's socioeconomic characteristics in analysis. \%
Edit intent: clarity