wanyu/IteraTeR_v2 huggingface dataset:
Original:  We find that the skewness in the distribution of mean citedness of different journals combines with the asymmetry in citedness of articles in each journal , resulting in a highly asymmetric citation distribution that well fits the theoretical lognormal model .
Revised:  We find that the skewness in the distribution of mean citedness of different venues combines with the asymmetry in citedness of articles in each journal , resulting in a highly asymmetric citation distribution that well fits the theoretical lognormal model .
Edit intent: clarity
Original:  We find that the skewness in the distribution of mean citedness of different journals combines with the asymmetry in citedness of articles in each journal , resulting in a highly asymmetric citation distribution that well fits the theoretical lognormal model .
Revised:  We find that the skewness in the distribution of mean citedness of different journals combines with the asymmetry in citedness of articles in each venue , resulting in a highly asymmetric citation distribution that well fits the theoretical lognormal model .
Edit intent: clarity
Original:  The usual reduced-form framework is extended in order to include possible economic shocks, in particular jumps in the recoveries at the default time.
Revised:  The usual reduced-form framework is extended in order to include possible economic shocks, in particular jumps of the recovery process at the default time.
Edit intent: clarity
Original: Post-translational modifications of the histone proteins in the chromosomes are an important factor in epigenetic control as specific regions of DNA in the chromatin are expressed , depending on the particular modification states of the histone proteins.
Revised: Post-translational modifications of histone proteins are an important factor in epigenetic control as specific regions of DNA in the chromatin are expressed , depending on the particular modification states of the histone proteins.
Edit intent: clarity
Original: Post-translational modifications of the histone proteins in the chromosomes are an important factor in epigenetic control as specific regions of DNA in the chromatin are expressed , depending on the particular modification states of the histone proteins.
Revised: Post-translational modifications of the histone proteins in the chromosomes are an important factor in epigenetic control that serve to regulate transcription , depending on the particular modification states of the histone proteins.
Edit intent: clarity
Original:  We study the stochastic dynamics of histone protein states, taking into account a non-local feedback mechanism where modified nucleosomes recruit enzymes that diffuse to nearby nucleosomes.
Revised:  We study the stochastic dynamics of histone protein states, taking into account a feedback mechanism where modified nucleosomes recruit enzymes that diffuse to nearby nucleosomes.
Edit intent: clarity
Original:  We study the stochastic dynamics of histone protein states, taking into account a non-local feedback mechanism where modified nucleosomes recruit enzymes that diffuse to nearby nucleosomes.
Revised:  We study the stochastic dynamics of histone protein states, taking into account a non-local feedback mechanism where modified nucleosomes recruit enzymes that diffuse to adjacent nucleosomes.
Edit intent: fluency
Original:  We discuss the role of the spatial dependence due to the non-local feedback mechanism , and we consider the effects of spatially heterogeneous enzymatic activity  .
Revised:  We discuss the role of the spatial dependance , and we consider the effects of spatially heterogeneous enzymatic activity .
Edit intent: clarity
Original:  Moreover, by combining Chain Routing with other mechanisms that implement complete orders in time, we surmise it is possible to design a new routing protocol which could be more reliable and stable than BGP  . Although Chain Routing will require an increase of the message overhead and greater coordination between network administrators, the rewards in stability and resilience should more than compensate for this effort.
Revised:  Moreover, by combining Chain Routing with other mechanisms that implement complete orders in time, we suggest that it is possible to design a new routing protocol which could be more reliable and stable than BGP . Although Chain Routing will require an increase of the message overhead and greater coordination between network administrators, the rewards in stability and resilience should more than compensate for this effort.
Edit intent: clarity
Original:  Moreover, by combining Chain Routing with other mechanisms that implement complete orders in time, we surmise it is possible to design a new routing protocol which could be more reliable and stable than BGP  . Although Chain Routing will require an increase of the message overhead and greater coordination between network administrators, the rewards in stability and resilience should more than compensate for this effort.
Revised:  Moreover, by combining Chain Routing with other mechanisms that implement complete orders in time, we surmise it is possible to design a new routing protocol which could be more reliable and stable than BGP 's current implementation . Although Chain Routing will require an increase of the message overhead and greater coordination between network administrators, the rewards in stability and resilience should more than compensate for this effort.
Edit intent: clarity
Original:  A kinetic model is also developed and used to evaluate the extent to which the experimentally realized gate is close to optimal.
Revised:  A kinetic model is also developed and used to evaluate the extent to which the performance of the experimentally realized logic gate is close to optimal.
Edit intent: clarity
Original: Despite the availability of very detailed data on financial market, agent-based modeling is hindered by the lack of information about real-trader behavior.
Revised: Despite the availability of very detailed data on financial market, agent-based modeling is hindered by the lack of information about real trader behavior.
Edit intent: fluency
Original:  A simple extension of CAPM that includes variable transaction costs is able to reproduce qualitatively the observed behaviors.
Revised:  A simple extension of CAPM that includes variable transaction costs is able to reproduce faithfully the observed behaviors.
Edit intent: clarity
Original:  We argue that this shows the collective ability of a population to construct a mean-variance portfolio that takes into account transaction costs.
Revised:  We finally argue that our results bring into light the collective ability of a population to construct a mean-variance portfolio that takes into account transaction costs.
Edit intent: clarity
Original:  We argue that this shows the collective ability of a population to construct a mean-variance portfolio that takes into account transaction costs.
Revised:  We argue that this shows the collective ability of a population to construct a mean-variance portfolio that takes into account the structure of transaction costs
Edit intent: clarity
Original: We study first-order quantum phase transitions in models where the mean-field traitment is exact, and in particular the exponentially fast closure of the energy gap with the system size  .
Revised: We study first-order quantum phase transitions in models where the mean-field traitment is exact, and the exponentially fast closure of the energy gap with the system size .
Edit intent: coherence
Original:  We consider exactly solvable ferromagnetic models and discuss their relation to the Grover problem to which they reduce in a particular limit.
Revised:  We consider exactly solvable ferromagnetic models , and show that they reduce to the Grover problem to which they reduce in a particular limit.
Edit intent: clarity
Original:  We consider exactly solvable ferromagnetic models and discuss their relation to the Grover problem to which they reduce in a particular limit.
Revised:  We consider exactly solvable ferromagnetic models and discuss their relation to the Grover problem in a particular limit.
Edit intent: clarity
Original:  We also discuss the (dire) consequences this has for quantum annealing and combinatorial optimization .
Revised:  We also discuss the (dire) consequences for quantum annealing and combinatorial optimization .
Edit intent: coherence
Original:  We also discuss the (dire) consequences this has for quantum annealing and combinatorial optimization .
Revised:  We also discuss the (dire) consequences this has for quantum annealing .
Edit intent: clarity
Original: The main challenges of cognitive radio include spectrum sensing at the physical (PHY) layer for the detection of primary users and spectrum sharing at the medium access control (MAC) layer to coordinate access among coexisting secondary users.
Revised: The main challenges of cognitive radio include spectrum sensing at the physical (PHY) layer to detect the activity of primary users and spectrum sharing at the medium access control (MAC) layer to coordinate access among coexisting secondary users.
Edit intent: clarity
Original:  We consider a time-slotted system in which secondary users have limited sensing capability: they can sense whether a channel is idle or busy, but they cannot detect the presence of a primary user .
Revised:  In this paper, we consider a cognitive radio network in which a primary user shares a channel with secondary users that cannot distinguish the signals of the primary user from those of a secondary user .
Edit intent: clarity
Original:  We propose a  distributed cognitive MAC protocol to achieve efficient spectrum sharing among  secondary users while protecting the primary user of a channel.
Revised:  We propose a distributed cognitive MAC protocols to achieve efficient spectrum sharing among secondary users while protecting the primary user of a channel.
Edit intent: fluency
Original:  We propose a  distributed cognitive MAC protocol to achieve efficient spectrum sharing among  secondary users while protecting the primary user of a channel.
Revised:  We propose a distributed cognitive MAC protocol to achieve efficient spectrum sharing among the secondary users while protecting the primary user of a channel.
Edit intent: fluency
Original:  By carefully designing a MAC protocol  , we can obtain high channel utilization by  secondary users while limiting interference to the primary user at a low level.
Revised:  By carefully designing a MAC protocol , we can obtain high channel utilization by the secondary users while limiting interference to the primary user at a low level.
Edit intent: fluency
Original:  This result suggests the possibility of utilizing MAC design in cognitive radio networks to overcome the limitations in spectrum sensing at the PHY layer as well as to achieve spectrum sharing at the MAC layer.
Revised:  The results of this paper suggest the possibility of utilizing MAC design in cognitive radio networks to overcome the limitations in spectrum sensing at the PHY layer as well as to achieve spectrum sharing at the MAC layer.
Edit intent: clarity
Original:  This result suggests the possibility of utilizing MAC design in cognitive radio networks to overcome the limitations in spectrum sensing at the PHY layer as well as to achieve spectrum sharing at the MAC layer.
Revised:  This result suggests the possibility of utilizing MAC design in cognitive radio networks to overcome limitations in spectrum sensing at the PHY layer as well as to achieve spectrum sharing at the MAC layer.
Edit intent: fluency
Original:  (c) in the absence of mutation , there is a region where heteroclinic cycles yield oscillations of large amplitude (not robust against noise).
Revised:  (c) in the absence of mutations , there is a region where heteroclinic cycles yield oscillations of large amplitude (not robust against noise).
Edit intent: fluency
Original:  We also analytically and numerically compute the average escape time necessary to reach a (quasi-)cycle on which the system oscillates at a given amplitude 
Revised:  We also analytically and numerically compute the average escape time necessary to reach a (quasi-)cycle on which the system oscillates at a given amplitude .
Edit intent: fluency
Original:  We develop an approach to relational learning which, given a set of pairs of objects S = A1:B1,A2:B2,> ..., AN:BN:B ^{(N)}\}} , measures how well other pairs A:B fit in with the set S . Our work addresses the  question: is the relation between objects A and B analogous to those relations found in S ? Such questions are particularly relevant in information retrieval, where an investigator might want to search for analogous pairs of objects that match the query set of interest.
Revised:  We develop an approach to relational learning which, given a set of pairs of objects S = A1:B1,A2:B2,> ..., A^{(N):B ^{(N)}\}} , measures how well other pairs A:B fit in with the set S . Our work addresses the question: is the relation between objects A and B analogous to those relations found in S ? Such questions are particularly relevant in information retrieval, where an investigator might want to search for analogous pairs of objects that match the query set of interest.
Edit intent: clarity
Original:  We develop an approach to relational learning which, given a set of pairs of objects S = A1:B1,A2:B2,> ..., AN:BN:B ^{(N)}\}} , measures how well other pairs A:B fit in with the set S . Our work addresses the  question: is the relation between objects A and B analogous to those relations found in S ? Such questions are particularly relevant in information retrieval, where an investigator might want to search for analogous pairs of objects that match the query set of interest.
Revised:  We develop an approach to relational learning which, given a set of pairs of objects S = A1:B1,A2:B2,> ..., AN:BN:B ^{(N)}\}} , measures how well other pairs A:B fit in with the set S . Our work addresses the following question: is the relation between objects A and B analogous to those relations found in S ? Such questions are particularly relevant in information retrieval, where an investigator might want to search for analogous pairs of objects that match the query set of interest.
Edit intent: clarity
Original: We propose a CDMA network implementation that enhances security at the physical layer .
Revised: We propose a network implementation with enhanced security at the physical layer .
Edit intent: clarity
Original:  By using an active star topology supporting both point-to-point and point-to-multipoint communication , 128 ONUs can transmit simultaneously at rates of at least 12 Mbps, with a reach of 20 km , thus addressing access network applications.
Revised:  By using an active star topology supporting both point-to-point and point-to-multipoint communication , 128 simultaneous users up to 20 km , thus addressing access network applications.
Edit intent: clarity
Original:  The Gini coefficient, a prominent measure for quality , for the expenditure distribution is found to be stable for the entire time span.
Revised:  The Gini coefficient, a prominent measure for inequality , for the expenditure distribution is found to be stable for the entire time span.
Edit intent: clarity
Original:  Here, we build upon prior work by Ta-Shma and by De and Vidick to show that the well known construction paradigm for extractors proposed by Trevisan is sound in the presence of quantum side information  .
Revised:  Here, we show that the well known construction paradigm for extractors proposed by Trevisan is sound in the presence of quantum side information .
Edit intent: clarity
Original: We show that any bounded-error quantum query algorithm that computes some total boolean function depending on n variables, and whose queries to the input do not depend on the result of previous queries , must make Omega(n) queries to the input in total.
Revised: We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries , must make Omega(n) queries to the input in total.
Edit intent: clarity
Original:   Thus, in this restricted setting, quantum algorithms can achieve at most a constant factor speed-up over classical query algorithms.
Revised:  Thus, in this restricted setting, quantum algorithms can achieve at most a very limited speed-up over classical query algorithms.
Edit intent: clarity
Original:  Characteristic features of our approach include (1) simplicity (we use only tensor products) and (2) yielding arbitrarily small distortions, or "almost Euclidean" subspaces  .
Revised:  Characteristic features of our approach include (1) simplicity (we use only tensor products) and (2) yielding "almost Euclidean" subspaces .
Edit intent: clarity
Original:  Characteristic features of our approach include (1) simplicity (we use only tensor products) and (2) yielding arbitrarily small distortions, or "almost Euclidean" subspaces  .
Revised:  Characteristic features of our approach include (1) simplicity (we use only tensor products) and (2) yielding arbitrarily small distortions, or "almost Euclidean" subspaces with arbitrarily small distortions .
Edit intent: clarity
Original: Dispersal is an important strategy employed by populations to locate and exploit favorable habitats.
Revised: Dispersal is an important strategy that allows organisms to locate and exploit favorable habitats.
Edit intent: clarity
Original:  However, the introduction of intrinsic demographic fluctuations can reverse this conclusion.
Revised:  However, the introduction of intrinsic demographic stochasticity can reverse this conclusion.
Edit intent: clarity
Original: The current distance%DIFDELCMD < } %%% was introduced by Vaillant and Glaunes as a way of comparing shapes (point sets, curves, surfaces) without having to rely on computing correspondences between features in each shape.
Revised:  current distance%DIFDELCMD < } %%% was introduced by Vaillant and Glaunes as a way of comparing shapes (point sets, curves, surfaces) without having to rely on computing correspondences between features in each shape.
Edit intent: fluency
Original: The current distance%DIFDELCMD < } %%% was introduced by Vaillant and Glaunes as a way of comparing shapes (point sets, curves, surfaces) without having to rely on computing correspondences between features in each shape.
Revised: The %DIFDELCMD < } %%% was introduced by Vaillant and Glaunes as a way of comparing shapes (point sets, curves, surfaces) without having to rely on computing correspondences between features in each shape.
Edit intent: clarity
Original:   In this paper, we provide the first algorithmic analysis of the current distance .
Revised:  In this paper, we provide the first algorithmic analysis of these distance metrics .
Edit intent: clarity
Original:  Our main results are (i) a method for computing the approximate current distance between two shapes in near-linear time , (ii) a coreset construction that allows us to approximate the current norm of a shape using a constant-sized sample, and (iii) an approximation algorithm for computing the current distance between two d-dimensional shapes under rigid transformations (rotations and translations).
Revised:  Our main contributions are as follows: (i) a method for computing the approximate current distance between two shapes in near-linear time , (ii) a coreset construction that allows us to approximate the current norm of a shape using a constant-sized sample, and (iii) an approximation algorithm for computing the current distance between two d-dimensional shapes under rigid transformations (rotations and translations).
Edit intent: clarity
Original:  Our main results are (i) a method for computing the approximate current distance between two shapes in near-linear time , (ii) a coreset construction that allows us to approximate the current norm of a shape using a constant-sized sample, and (iii) an approximation algorithm for computing the current distance between two d-dimensional shapes under rigid transformations (rotations and translations).
Revised:  Our main results are (i) We present fast approximation algorithms for computing the approximate current distance between two shapes in near-linear time , (ii) a coreset construction that allows us to approximate the current norm of a shape using a constant-sized sample, and (iii) an approximation algorithm for computing the current distance between two d-dimensional shapes under rigid transformations (rotations and translations).
Edit intent: clarity
Original:  Our main results are (i) a method for computing the approximate current distance between two shapes in near-linear time , (ii) a coreset construction that allows us to approximate the current norm of a shape using a constant-sized sample, and (iii) an approximation algorithm for computing the current distance between two d-dimensional shapes under rigid transformations (rotations and translations).
Revised:  Our main results are (i) a method for computing the kernel distance between two shapes in near-linear time , (ii) a coreset construction that allows us to approximate the current norm of a shape using a constant-sized sample, and (iii) an approximation algorithm for computing the current distance between two d-dimensional shapes under rigid transformations (rotations and translations).
Edit intent: fluency
Original:  2) they lack significance in spite of positive correlations in two time intervals right before and just after bubble crashes;
Revised:  2) it lacks significance in spite of positive correlations in two time intervals right before and just after bubble crashes;
Edit intent: fluency
Original:  2) they lack significance in spite of positive correlations in two time intervals right before and just after bubble crashes;
Revised:  2) they lack significance in spite of positive correlation in two time intervals right before and just after bubble crashes;
Edit intent: fluency
Original:  and 3) there exists , particularly, significant negative correlation between the rate of mean return and that of change in trading conditioning intensity when SEE Composite Index is rising during bull market.
Revised:  and 3) it shows , particularly, significant negative correlation between the rate of mean return and that of change in trading conditioning intensity when SEE Composite Index is rising during bull market.
Edit intent: clarity
Original:  The model and findings can help to well explain disposition effect and excessive trading, to time bubble crash, and to understand other anomalies in stock market.
Revised:  Our model and findings can help to well explain disposition effect and excessive trading, to time bubble crash, and to understand other anomalies in stock market.
Edit intent: fluency
Original:  The model and findings can help to well explain disposition effect and excessive trading, to time bubble crash, and to understand other anomalies in stock market.
Revised:  The model and findings can test both disposition effect and excessive trading, to time bubble crash, and to understand other anomalies in stock market.
Edit intent: clarity
Original:  We consider heterostasis for individual and networks of firing-rate neurons, adapting to achieve target distributions of firing rates maximizing information entropy.
Revised:  We consider polyhomeostasis for individual and networks of firing-rate neurons, adapting to achieve target distributions of firing rates maximizing information entropy.
Edit intent: clarity
Original:  We show that any finite heterostatic adaption rate destroys all attractors in Hopfield-like network setups, leading to intermittently bursting behavior and self-organized chaos.
Revised:  We show that any finite polyhomeostatic adaption rate destroys all attractors in Hopfield-like network setups, leading to intermittently bursting behavior and self-organized chaos.
Edit intent: clarity
Original:  The importance of heterostasis to adapting behavior in general is discussed.
Revised:  The importance of polyhomeostasis to adapting behavior in general is discussed.
Edit intent: clarity