wanyu/IteraTeR_v2 huggingface dataset:
Original:  Inevitably, the interest levied by banks in return for money created via monetizing debt systematically reallocates resources towards the financial institutions, and away from industrial and manual production, farming and labor.
Revised:  The interest levied by banks in return for money created via monetizing debt systematically reallocates resources towards the financial institutions, and away from industrial and manual production, farming and labor.
Edit intent: coherence
Original: General options for monetary systems, in particular the creation of fiat money, as well as its appropriation in various setups is discussed.
Revised: General options for monetary systems, in particular the creation of fiat money, as well as its appropriation in various setups are discussed.
Edit intent: fluency
Original:  We find that, in healthy brains the nodes of the network are mainly connected to other nodes in the same module, whereas the brain connectivity of epileptic patientsexhibits a modular organization where nodes are interconnected with different modules of the network.
Revised:  We find that, for the activities in the nodes of the network are mainly connected to other nodes in the same module, whereas the brain connectivity of epileptic patientsexhibits a modular organization where nodes are interconnected with different modules of the network.
Edit intent: clarity
Original:  Our results suggest that modularity plays a key role for the functional organization of brain areas during normal and pathological neural activities at rest 
Revised:  Our results suggest that modularity plays a key role for the functional organization of brain areas during normal and pathological neural activities at rest .
Edit intent: fluency
Original: We analyze the modular structure of weighted brain networks extracted from spontaneous magnetoencephalographic (MEG) signals of healthy subjects and epileptic patients (suffering from absence seizures) recorded at rest.
Revised: We analyze the connectivity structure of weighted brain networks extracted from spontaneous magnetoencephalographic (MEG) signals of healthy subjects and epileptic patients (suffering from absence seizures) recorded at rest.
Edit intent: clarity
Original:  We find that, for the activities in the 5-14 Hz range, healthy brains exhibit a modular organization characterized by a weak connectivitybetween the modules, whereas in the cortical connectivity of patients , nodes are interconnected with different modules of the network .
Revised:  We find that, for the activities in the 5-14 Hz range, healthy brains exhibit a sparse connectivity, whereas the brain networks of patients display a rich connectivity with clear modular structure .
Edit intent: clarity
Original:  Our results suggest that modularity plays a key role for the functional organization of brain areas during normal and pathological neural activities at rest.
Revised:  Our results suggest that modularity plays a key role in the functional organization of brain areas during normal and pathological neural activities at rest.
Edit intent: clarity
Original: The classification of life should be based upon our understanding of the underlying mechanism in the evolution of life.
Revised: The classification of life should be based upon the fundamental mechanism in the evolution of life.
Edit intent: clarity
Original:  The global relationships among species are circular , which is quite different from the common sense based upon phylogenetic trees.
Revised:  We found that the global relationships among species are circular , which is quite different from the common sense based upon phylogenetic trees.
Edit intent: coherence
Original:  Thus, we suggest that domains can be defined by distinguished genealogical circles, which are global and steady characteristics of living systems.
Revised:  Thus, we suggest that domains can be defined by distinguished phylogenetic circles, which are global and steady characteristics of living systems.
Edit intent: fluency
Original:  Thus, we suggest that domains can be defined by distinguished genealogical circles, which are global and steady characteristics of living systems.
Revised:  Thus, we suggest that domains can be defined by distinguished genealogical circles, which are global and stable characteristics of living systems.
Edit intent: clarity
Original:  We present  quantum algorithms that solve the hidden shift problems for several well-known classes of bent functions in polynomial time  with a constant number of queries, while the classical query complexity is shown to be exponential.
Revised:  We present quantum algorithms that solve the hidden shift problems for several well-known classes of bent functions in polynomial time and with a constant number of queries, while the classical query complexity is shown to be exponential.
Edit intent: coherence
Original:  We find thatwhen the the entropy parameter of a loop satisfies c \le 2, denaturation transition does not take place.
Revised:  Our model predicts that, when the entropy parameter of a loop satisfies c \le 2, denaturation transition does not take place.
Edit intent: clarity
Original:  On the other hand for c>2 a first-order denaturation transition takes place , as in the case with no supercoil .
Revised:  On the other hand for c>2 a first-order denaturation transition takes place , as in the case with no supercoils .
Edit intent: fluency
Original: While network coding can be an efficient means of information dissemination in networks, it is highly susceptible to `` pollution attacks, '' as the injection of even a single erroneous packet has the potential to corrupt each and every packet received by a given destination.
Revised: While network coding can be an efficient means of information dissemination in networks, it is highly susceptible to " pollution attacks, '' as the injection of even a single erroneous packet has the potential to corrupt each and every packet received by a given destination.
Edit intent: fluency
Original: While network coding can be an efficient means of information dissemination in networks, it is highly susceptible to `` pollution attacks, '' as the injection of even a single erroneous packet has the potential to corrupt each and every packet received by a given destination.
Revised: While network coding can be an efficient means of information dissemination in networks, it is highly susceptible to `` pollution attacks, " as the injection of even a single erroneous packet has the potential to corrupt each and every packet received by a given destination.
Edit intent: fluency
Original:  To limit the power of potential adversaries, a broadcast-mode transformation is introduced, in which nodes are limited to just a single (broadcast) transmission per generation.
Revised:  To limit the power of potential adversaries, a broadcast transformation is introduced, in which nodes are limited to just a single (broadcast) transmission per generation.
Edit intent: clarity
Original: We revisit the problem of (1 + /- eps)-approximating the L_p norm, 0 < = p <  =  2, of an n-dimensional vector updated in a stream of length m with positive and negative updates to its coordinates.
Revised: We revisit the problem of (1 + /- eps)-approximating the L_p norm, 0 < eps < = 2, of an n-dimensional vector updated in a stream of length m with positive and negative updates to its coordinates.
Edit intent: clarity
Original:  Our results imply space-optimality of the celebrated L_2 estimation algorithm of Alon, Matias, Szegedy JCSS 1999%DIFDELCMD < ] %%% and L_1-difference algorithm of Feigenbaum et al., SICOMP 2002%DIFDELCMD < ]%%% , as well as a separation in the complexity of L_0-estimation between the insertion-only and turnstile models since Bar-Yossef et al., RANDOM 2002%DIFDELCMD < ] %%% give an O( 1/eps ^2 + log n) space algorithm for the former.
Revised:  Our results imply space-optimality of the celebrated L_2 estimation algorithm of %DIFDELCMD < ] %%% and L_1-difference algorithm of Feigenbaum et al., SICOMP 2002%DIFDELCMD < ]%%% , as well as a separation in the complexity of L_0-estimation between the insertion-only and turnstile models since Bar-Yossef et al., RANDOM 2002%DIFDELCMD < ] %%% give an O( 1/eps ^2 + log n) space algorithm for the former.
Edit intent: coherence
Original:  Our results imply space-optimality of the celebrated L_2 estimation algorithm of Alon, Matias, Szegedy JCSS 1999%DIFDELCMD < ] %%% and L_1-difference algorithm of Feigenbaum et al., SICOMP 2002%DIFDELCMD < ]%%% , as well as a separation in the complexity of L_0-estimation between the insertion-only and turnstile models since Bar-Yossef et al., RANDOM 2002%DIFDELCMD < ] %%% give an O( 1/eps ^2 + log n) space algorithm for the former.
Revised:  Our results imply space-optimality of the celebrated L_2 estimation algorithm of Alon, Matias, Szegedy JCSS 1999%DIFDELCMD < ] %%% Feigenbaum et al., SICOMP 2002%DIFDELCMD < ]%%% , as well as a separation in the complexity of L_0-estimation between the insertion-only and turnstile models since Bar-Yossef et al., RANDOM 2002%DIFDELCMD < ] %%% give an O( 1/eps ^2 + log n) space algorithm for the former.
Edit intent: coherence
Original:  Our results imply space-optimality of the celebrated L_2 estimation algorithm of Alon, Matias, Szegedy JCSS 1999%DIFDELCMD < ] %%% and L_1-difference algorithm of Feigenbaum et al., SICOMP 2002%DIFDELCMD < ]%%% , as well as a separation in the complexity of L_0-estimation between the insertion-only and turnstile models since Bar-Yossef et al., RANDOM 2002%DIFDELCMD < ] %%% give an O( 1/eps ^2 + log n) space algorithm for the former.
Revised:  Our results imply space-optimality of the celebrated L_2 estimation algorithm of Alon, Matias, Szegedy JCSS 1999%DIFDELCMD < ] %%% and L_1-difference algorithm of %DIFDELCMD < ]%%% , as well as a separation in the complexity of L_0-estimation between the insertion-only and turnstile models since Bar-Yossef et al., RANDOM 2002%DIFDELCMD < ] %%% give an O( 1/eps ^2 + log n) space algorithm for the former.
Edit intent: clarity
Original:  Our results imply space-optimality of the celebrated L_2 estimation algorithm of Alon, Matias, Szegedy JCSS 1999%DIFDELCMD < ] %%% and L_1-difference algorithm of Feigenbaum et al., SICOMP 2002%DIFDELCMD < ]%%% , as well as a separation in the complexity of L_0-estimation between the insertion-only and turnstile models since Bar-Yossef et al., RANDOM 2002%DIFDELCMD < ] %%% give an O( 1/eps ^2 + log n) space algorithm for the former.
Revised:  Our results imply space-optimality of the celebrated L_2 estimation algorithm of Alon, Matias, Szegedy JCSS 1999%DIFDELCMD < ] %%% and L_1-difference algorithm of Feigenbaum et al., SICOMP 2002%DIFDELCMD < ]%%% , as well as a separation in the complexity of L_0-estimation between the insertion-only and turnstile models since %DIFDELCMD < ] %%% give an O( 1/eps ^2 + log n) space algorithm for the former.
Edit intent: coherence
Original:  Our techniques also improve the best known lower bound for additive entropy approximation, and variants were used in Clarkson, Woodruff, 2008%DIFDELCMD < ] %%% to obtain tight space bounds for streaming linear algebra problems.
Revised:  Our techniques also improve the best known lower bound for additive entropy approximation, and variants were used in %DIFDELCMD < ] %%% to obtain tight space bounds for streaming linear algebra problems.
Edit intent: coherence
Original:  For 0 < p < 2, we improve the algorithm of Indyk, J. ACM '06%DIFDELCMD < ] %%% by showing that a pseudorandom generator (PRG) construction of Armoni, RANDOM 1998%DIFDELCMD < ] %%% can be improved by using a more space-efficient implementation of a recent extractor of Guruswami, Umans, Vadhan, CCC 2007%DIFDELCMD < ]%%% . Specifically, the improved Armoni PRG stretches a seed of O((S/(log(S) -
Revised:  For 0 Indyk, J. ACM '06%DIFDELCMD < ] %%% by showing that a pseudorandom generator (PRG) construction of Armoni, RANDOM 1998%DIFDELCMD < ] %%% can be improved by using a more space-efficient implementation of a recent extractor of Guruswami, Umans, Vadhan, CCC 2007%DIFDELCMD < ]%%% . Specifically, the improved Armoni PRG stretches a seed of O((S/(log(S) -
Edit intent: clarity
Original:  For 0 < p < 2, we improve the algorithm of Indyk, J. ACM '06%DIFDELCMD < ] %%% by showing that a pseudorandom generator (PRG) construction of Armoni, RANDOM 1998%DIFDELCMD < ] %%% can be improved by using a more space-efficient implementation of a recent extractor of Guruswami, Umans, Vadhan, CCC 2007%DIFDELCMD < ]%%% . Specifically, the improved Armoni PRG stretches a seed of O((S/(log(S) -
Revised:  For 0 < p < 2, we improve the algorithm of %DIFDELCMD < ] %%% by showing that a pseudorandom generator (PRG) construction of Armoni, RANDOM 1998%DIFDELCMD < ] %%% can be improved by using a more space-efficient implementation of a recent extractor of Guruswami, Umans, Vadhan, CCC 2007%DIFDELCMD < ]%%% . Specifically, the improved Armoni PRG stretches a seed of O((S/(log(S) -
Edit intent: coherence
Original:  For 0 < p < 2, we improve the algorithm of Indyk, J. ACM '06%DIFDELCMD < ] %%% by showing that a pseudorandom generator (PRG) construction of Armoni, RANDOM 1998%DIFDELCMD < ] %%% can be improved by using a more space-efficient implementation of a recent extractor of Guruswami, Umans, Vadhan, CCC 2007%DIFDELCMD < ]%%% . Specifically, the improved Armoni PRG stretches a seed of O((S/(log(S) -
Revised:  For 0 < p < 2, we improve the algorithm of Indyk, J. ACM '06%DIFDELCMD < ] %%% Armoni, RANDOM 1998%DIFDELCMD < ] %%% can be improved by using a more space-efficient implementation of a recent extractor of Guruswami, Umans, Vadhan, CCC 2007%DIFDELCMD < ]%%% . Specifically, the improved Armoni PRG stretches a seed of O((S/(log(S) -
Edit intent: clarity
Original:  For 0 < p < 2, we improve the algorithm of Indyk, J. ACM '06%DIFDELCMD < ] %%% by showing that a pseudorandom generator (PRG) construction of Armoni, RANDOM 1998%DIFDELCMD < ] %%% can be improved by using a more space-efficient implementation of a recent extractor of Guruswami, Umans, Vadhan, CCC 2007%DIFDELCMD < ]%%% . Specifically, the improved Armoni PRG stretches a seed of O((S/(log(S) -
Revised:  For 0 < p < 2, we improve the algorithm of Indyk, J. ACM '06%DIFDELCMD < ] %%% by showing that a pseudorandom generator (PRG) construction of %DIFDELCMD < ] %%% can be improved by using a more space-efficient implementation of a recent extractor of Guruswami, Umans, Vadhan, CCC 2007%DIFDELCMD < ]%%% . Specifically, the improved Armoni PRG stretches a seed of O((S/(log(S) -
Edit intent: clarity
Original:  loglog(R) + O( 1 )))log R) bits to R bits fooling space-S algorithmsfor any R = 2 ^{O(S) Nisan, Combinatorica 1992%DIFDELCMD < ]%%% , and improving several existing streaming algorithms .
Revised:  loglog(R) + O( 1 )))log R) bits to R bits fooling space-S algorithmsfor any R = 2 Nisan, Combinatorica 1992%DIFDELCMD < ]%%% , and improving several existing streaming algorithms .
Edit intent: clarity
Original: We investigate the clustering dynamics of multichannel (multivariate) time series by first representing their correlations as time-dependent networks and then examining the evolution of network communities.
Revised: We study the cluster dynamics of multichannel (multivariate) time series by first representing their correlations as time-dependent networks and then examining the evolution of network communities.
Edit intent: fluency
Original: We investigate the clustering dynamics of multichannel (multivariate) time series by first representing their correlations as time-dependent networks and then examining the evolution of network communities.
Revised: We investigate the clustering dynamics of multichannel (multivariate) time series by representing their correlations as time-dependent networks and then examining the evolution of network communities.
Edit intent: coherence
Original: We investigate the clustering dynamics of multichannel (multivariate) time series by first representing their correlations as time-dependent networks and then examining the evolution of network communities.
Revised: We investigate the clustering dynamics of multichannel (multivariate) time series by first representing their correlations as time-dependent networks and investigating the evolution of network communities.
Edit intent: clarity
Original:  To do this, we employ a node-centric approach that allows us to to track the functional roles of individual nodes in time without having to track entire communities.
Revised:  We employ a node-centric approach that allows us to to track the functional roles of individual nodes in time without having to track entire communities.
Edit intent: coherence
Original:  To do this, we employ a node-centric approach that allows us to to track the functional roles of individual nodes in time without having to track entire communities.
Revised:  To do this, we employ a node-centric approach that allows us to to track the functional roles of individual nodes without having to track entire communities.
Edit intent: clarity
Original:   Using dynamical community detection, we find that exchange rates with strong intra-community connections are persistently assigned to communities with the same set of nodes .
Revised:  Using dynamical community detection, we find that exchange rates that are strongly attached to their community are persistently grouped with the same set of nodes .
Edit intent: clarity
Original: Chemotaxis usually involves cellular motion towards an exogenous, often static, source of chemoattractant.
Revised: Chemotaxis is typically modeled in the context of cellular motion towards an exogenous, often static, source of chemoattractant.
Edit intent: clarity
Original: Chemotaxis usually involves cellular motion towards an exogenous, often static, source of chemoattractant.
Revised: Chemotaxis usually involves cellular motion towards a static, exogenous source of chemoattractant.
Edit intent: clarity
Original:  We demonstrate an enhanced mechanism in which a single particle (the{\it   cell) releases a chemical that diffuses to fixed particles (targets) and signals the production of another chemical by the targets.
Revised:  We demonstrate an enhanced mechanism in which a self-propelled particle ({\it cell) releases a chemical that diffuses to fixed particles (targets) and signals the production of another chemical by the targets.
Edit intent: clarity
Original:  We demonstrate an enhanced mechanism in which a single particle (the{\it   cell) releases a chemical that diffuses to fixed particles (targets) and signals the production of another chemical by the targets.
Revised:  We demonstrate an enhanced mechanism in which a single particle (the{\it , a cell) releases a chemical that diffuses to fixed particles (targets) and signals the production of another chemical by the targets.
Edit intent: fluency
Original:  In the presence of multiple targets, the one selected by the cell depends on the strength and, more interestingly, the frequency of probe chemical release.
Revised:  In the presence of multiple targets, the one selected by the cell depends on the strength and, interestingly, on the frequency of probe chemical release.
Edit intent: coherence
Original:  Although it involves one more stepthan standard chemotaxis, our simple chemical "pinging" mechanism can offer far greater flexibility in regulating target selection  seen in a number of physical or biological realizations.
Revised:  Although involving an additional chemical signaling step, our chemical ``pinging'' hypothesis allows for greater flexibility in regulating target selection seen in a number of physical or biological realizations.
Edit intent: clarity
Original:  Although it involves one more stepthan standard chemotaxis, our simple chemical "pinging" mechanism can offer far greater flexibility in regulating target selection  seen in a number of physical or biological realizations.
Revised:  Although it involves one more stepthan standard chemotaxis, our simple chemical "pinging" mechanism can offer far greater flexibility in regulating target selection , as seen in a number of physical or biological realizations.
Edit intent: coherence
Original: Based on the concepts of isovists and medial axes, we developed a set of algorithms that can automatically generate the axial lines for representing individual linearly stretched parts of open space of an urban environment.
Revised: Based on the concepts of isovists and medial axes, we developed a set of algorithms that can automatically generate axial lines for representing individual linearly stretched parts of open space of an urban environment.
Edit intent: clarity
Original:  The generation of the axial lines has been a key aspect of space syntax research, conventionally relying on hand-drawn axial lines of an urban environment, often called the axial map, for urban morphological analysis.
Revised:  The generation of the axial lines has been a key aspect of space syntax research, conventionally relying on hand-drawn axial lines of an urban environment, often called axial map, for urban morphological analysis.
Edit intent: fluency
Original:  Our algorithms are proved to provide a better solution than existing ones.
Revised:  Our algorithms provide a better solution than existing ones.
Edit intent: clarity
Original:  Throughout this paper, we have also argued and demonstrated that the axial lines constitute a true skeleton, superior to the medial axes, in capturing what we perceive about the urban environment.
Revised:  Throughout this paper, we have also argued and demonstrated that the axial lines constitute a true skeleton, superior to medial axes, in capturing what we perceive about the urban environment.
Edit intent: fluency
Original: Bibliometrics , also known as scientometrics, has the ambitious goal of measuring science.
Revised: Bibliometrics has the ambitious goal of measuring science.
Edit intent: clarity
Original:  We review the main historical contributions to the field, distinguish the current principal research themes, and survey the present-day bibliometric data sources and indicators .
Revised:  We review the main historical contributions to the field, the most interesting bibliometric indicators, and the most popular bibliometric data sources and indicators .
Edit intent: clarity
Original: The analysis of network topology and dynamics is increasingly used for the description of the structure, function and evolution of complex systems.
Revised: The network concept is increasingly used for the description of the structure, function and evolution of complex systems.
Edit intent: clarity
Original: The analysis of network topology and dynamics is increasingly used for the description of the structure, function and evolution of complex systems.
Revised: The analysis of network topology and dynamics is increasingly used for the description of complex systems.
Edit intent: clarity
Original:  Local cooperation in a stable environment may lead to over-optimization developing an always-old  network, which ages slowly , and dies in an apoptosis-like process.
Revised:  A stable environment develops cooperation leading to over-optimization developing an always-old network, which ages slowly , and dies in an apoptosis-like process.
Edit intent: clarity
Original:  Local cooperation in a stable environment may lead to over-optimization developing an always-old  network, which ages slowly , and dies in an apoptosis-like process.
Revised:  Local cooperation in a stable environment may lead to over-optimization , and forming an " always-old network, which ages slowly , and dies in an apoptosis-like process.
Edit intent: clarity
Original:  Local cooperation in a stable environment may lead to over-optimization developing an always-old  network, which ages slowly , and dies in an apoptosis-like process.
Revised:  Local cooperation in a stable environment may lead to over-optimization developing an always-old " network, which ages slowly , and dies in an apoptosis-like process.
Edit intent: fluency