wanyu/IteraTeR_v2 huggingface dataset:
Original:  This result is the 2D analogue of the jump from the optimum binary search trees of Knuth in 1971 which required that the distribution be provided, to the splay trees of Sleator and Tarjan in 1985 where in the static optimality theorem it was proven that splay trees had the same asymptotic performance of optimum search trees without being provided the probability distribution .
Revised:  This result is the 2D analogue of the jump from the optimum binary search trees of Knuth in 1971 which required that the distribution be provided, to the splay trees of Sleator and Tarjan in 1985 where in the static optimality theorem it was proven that splay trees had the same asymptotic performance as an optimum static structure, without needing any additional information .
Edit intent: clarity
Original:  This is partly due to the analytical methods used, which do not directly test whether neurogenesis has a mediating role on behaviour.
Revised:  This is partly due to the analytical methods used, which do not directly test whether neurogenesis mediates the effect of an intervention on behaviour.
Edit intent: clarity
Original:  A reanalysis of this dataset using causal models---which specifically test whether neurogenesis has a mediating role on pattern separation---provides strong evidence for the opposite conclusion: the effects of exercise on pattern separation are via neurogenesis-independent mechanisms.
Revised:  A reanalysis of this dataset using causal models---which specifically test whether neurogenesis has a mediating role on pattern separation---provides strong evidence for the opposite conclusion: the effects of exercise on pattern separation is via neurogenesis-independent mechanisms.
Edit intent: fluency
Original:  The majority of studies in the neurogenesis literature follow the same design, analysis, and logic as Creer et al., and the reported results from these studies provide little evidence for a causal role of neurogenesis because the results are also consistent with experimental treatments affecting behaviour through neurogenesis-independent mechanisms .
Revised:  Many studies in the neurogenesis literature follow the same design, analysis, and logic as Creer et al., and the reported results from these studies provide little evidence for a causal role of neurogenesis because the results are also consistent with experimental treatments affecting behaviour through neurogenesis-independent mechanisms .
Edit intent: clarity
Original:  The majority of studies in the neurogenesis literature follow the same design, analysis, and logic as Creer et al., and the reported results from these studies provide little evidence for a causal role of neurogenesis because the results are also consistent with experimental treatments affecting behaviour through neurogenesis-independent mechanisms .
Revised:  The majority of studies in the neurogenesis literature would benefit from the use of statistical methods that can separate neurogenesis-dependent from neurogenesis-independent mechanisms .
Edit intent: clarity
Original:  The majority of studies in the neurogenesis literature follow the same design, analysis, and logic as Creer et al., and the reported results from these studies provide little evidence for a causal role of neurogenesis because the results are also consistent with experimental treatments affecting behaviour through neurogenesis-independent mechanisms .
Revised:  The majority of studies in the neurogenesis literature follow the same design, analysis, and logic as Creer et al., and the reported results from these studies provide little evidence for a causal role of neurogenesis because the results are also consistent with experimental treatments affecting behaviour through neurogenesis-independent effects on behaviour .
Edit intent: clarity
Original: We analyze the  Synchrosqueezing transform, a consistent and invertible time-frequency analysis tool that can identify and extract oscillating components (of time-varying frequency and amplitude ) from regularly sampled time series.
Revised: We analyze the Synchrosqueezing transform, a time-frequency analysis tool that can identify and extract oscillating components (of time-varying frequency and amplitude ) from regularly sampled time series.
Edit intent: clarity
Original: We analyze the  Synchrosqueezing transform, a consistent and invertible time-frequency analysis tool that can identify and extract oscillating components (of time-varying frequency and amplitude ) from regularly sampled time series.
Revised: We analyze the Synchrosqueezing transform, a consistent and invertible time-frequency signal analysis method that can identify and extract oscillating components (of time-varying frequency and amplitude ) from regularly sampled time series.
Edit intent: clarity
Original: We analyze the  Synchrosqueezing transform, a consistent and invertible time-frequency analysis tool that can identify and extract oscillating components (of time-varying frequency and amplitude ) from regularly sampled time series.
Revised: We analyze the Synchrosqueezing transform, a consistent and invertible time-frequency analysis tool that can identify and extract oscillatory components with time-varying frequency and amplitude ) from regularly sampled time series.
Edit intent: clarity
Original:  This paper is devoted to address the three questions and provide the results obtainedrecently that include a closed form solution to estimate the loss rates of a tree network, a direct expression of the MLE for the general topology , a divide-and-conquer strategy to decompose a general network into a number of independent trees , and the method to estimate the loss rates of the decomposed trees .
Revised:  This paper is devoted to address the three questions and provide the results obtainedrecently that include a closed form solution to estimate the loss rates of a tree network, a direct expression of the MLE for the general topology and a divide-and-conquer strategy to decompose a general network into a number of independent trees , and the method to estimate the loss rates of the decomposed trees .
Edit intent: coherence
Original:  This paper is devoted to address the three questions and provide the results obtainedrecently that include a closed form solution to estimate the loss rates of a tree network, a direct expression of the MLE for the general topology , a divide-and-conquer strategy to decompose a general network into a number of independent trees , and the method to estimate the loss rates of the decomposed trees .
Revised:  This paper is devoted to address the three questions and provide the results obtainedrecently that include a closed form solution to estimate the loss rates of a tree network, a direct expression of the MLE for the general topology , a divide-and-conquer strategy to decompose a general network into two types of independent trees , and the method to estimate the loss rates of the decomposed trees .
Edit intent: clarity
Original:  This paper is devoted to address the three questions and provide the results obtainedrecently that include a closed form solution to estimate the loss rates of a tree network, a direct expression of the MLE for the general topology , a divide-and-conquer strategy to decompose a general network into a number of independent trees , and the method to estimate the loss rates of the decomposed trees .
Revised:  This paper is devoted to address the three questions and provide the results obtainedrecently that include a closed form solution to estimate the loss rates of a tree network, a direct expression of the MLE for the general topology , a divide-and-conquer strategy to decompose a general network into a number of independent trees , and the method to estimate the loss rates of each type .
Edit intent: clarity
Original:  Finally, we show for several stochastic volatility models the numerical performance of the associated Monte Carlo estimators  .
Revised:  Finally, we show the numerical performance of the associated Monte Carlo estimators .
Edit intent: clarity
Original:  Finally, we show for several stochastic volatility models the numerical performance of the associated Monte Carlo estimators  .
Revised:  Finally, we show for several stochastic volatility models the numerical performance of the associated Monte Carlo estimators for several stochastic volatility models .
Edit intent: clarity
Original:  In this note, we show that s(n) = a_1 (n) + \sum_{w in 1 (0+1)*} s([w bar]) a_{w1} (n) where w bar denotes the complementary pattern of w (obtained by sending 0 to 1 and 1 to 0, and [w] denotes the integer specified by the word w interpreted in base 2.
Revised:  In this note, we show that s(n) = a_1 (n) + \sum_{w in 1 (0+1)*} s([w bar]) a_{w1} (n) where w bar denotes the complement of w (obtained by sending 0 to 1 and 1 to 0, and [w] denotes the integer specified by the word w interpreted in base 2.
Edit intent: clarity
Original:  This leads to the analytical and numerical studies of a stochastic game with optimal stopping subject to early termination resulting from a default.
Revised:  This leads to the study of a stochastic game with optimal stopping subject to early termination resulting from a default.
Edit intent: clarity
Original: This paper studies the valuation of game-type credit default swaps (CDSs) that allow the protection buyer and seller to raise or reduce the respective position once prior to default.
Revised: This paper studies game-type credit default swaps (CDSs) that allow the protection buyer and seller to raise or reduce the respective position once prior to default.
Edit intent: clarity
Original: This paper studies the valuation of game-type credit default swaps (CDSs) that allow the protection buyer and seller to raise or reduce the respective position once prior to default.
Revised: This paper studies the valuation of game-type credit default swaps that allow the protection buyer and seller to raise or reduce the respective position once prior to default.
Edit intent: clarity
Original: This paper studies the valuation of game-type credit default swaps (CDSs) that allow the protection buyer and seller to raise or reduce the respective position once prior to default.
Revised: This paper studies the valuation of game-type credit default swaps (CDSs) that allow the protection buyer and seller to raise or reduce their respective positions once prior to default.
Edit intent: fluency
Original:  This leads to the study of a stochastic game with optimal stopping subject to early termination resulting from a default .
Revised:  This leads to the study of an optimal stopping game subject to early termination resulting from a default .
Edit intent: clarity
Original:  This leads to the study of a stochastic game with optimal stopping subject to early termination resulting from a default .
Revised:  This leads to the study of a stochastic game with optimal stopping subject to early default termination .
Edit intent: clarity
Original: The structure of a network in which agents interact affects whether cooperation will evolve in a population.
Revised: Dense cooperative networks are an essential element of social capital for a prosperous society. These networks enable individuals to overcome collective action dilemmas by enhancing trust.
Edit intent: clarity
Original:  In many biological and social settings, however, network structures are not fixed but evolve endogenously as agents exit from current relationships and build new ones.
Revised:  In many biological and social settings, network structures evolve endogenously as agents exit from current relationships and build new ones.
Edit intent: coherence
Original:  In many biological and social settings, however, network structures are not fixed but evolve endogenously as agents exit from current relationships and build new ones.
Revised:  In many biological and social settings, however, network structures are not fixed but evolve endogenously as agents exit relationships and build new ones.
Edit intent: clarity
Original: We consider a collection of mean field spin systems,  each of which is placed on the positions of a one-dimensional chain , coupled together by a Kac-type interaction along the chain .
Revised: We consider a collection of mean field spin systems, each of which is placed along the positions of a one-dimensional chain , coupled together by a Kac-type interaction along the chain .
Edit intent: fluency
Original:  We are interested in the  regime where the size of each mean field model tends to infinity and, the length of the chain and range of the Kac interaction are large but finite.
Revised:  We are interested in the regime where the size of each mean field model tends to infinity , and the length of the chain and range of the Kac interaction are large but finite.
Edit intent: fluency
Original:  We  derive an analytical expression for the equilibrium distribution of the game as a function of N and study its properties, which are then compared with a large dataset of internet auctions.
Revised:  We derive an analytical expression for the equilibrium distribution of the game as a function of the mean number of players, and compare them with a large dataset of internet auctions.
Edit intent: clarity
Original:  The empirical collective strategy reproduces the theoretical equilibrium with striking accuracy for small  N, while for larger N the quality of the fit deteriorates.
Revised:  The theory agrees with the data with striking accuracy for small N, while for larger N the quality of the fit deteriorates.
Edit intent: clarity
Original:  We interpret this result as the emergence of two different phases , one in which adaptation is feasible and one in which it is not.
Revised:  We interpret this result as the emergence of two different regimes , one in which adaptation is feasible and one in which it is not.
Edit intent: clarity
Original:  Finally, dendritic spine head dynamics has been modeled.
Revised:  Finally, dendritic spine-head dynamics has been modeled.
Edit intent: fluency
Original:  The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such that the graph is (strongly) rainbow connected.
Revised:  The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such that G is (strongly) rainbow connected.
Edit intent: fluency
Original:  Further, we study the parameterized version of the following problem : Given a graph G, determine the maximum number of pairs of vertices that can be rainbow connected with two colors.
Revised:  Further, we study the parameterized version of the following problem : Given a graph G, determine the maximum number of pairs of vertices that can be rainbow connected using two colors.
Edit intent: fluency
Original: In this study, a two-state mechanochemical model is presented to describe the dynamic properties of microtubule (MT) growth in cells.
Revised: In this study, a two-state mechanochemical model is presented to describe the dynamic instability of microtubules (MTs) in cells.
Edit intent: clarity
Original:  The MT switches between two states, assembly state and disassembly state.
Revised:  The MTs switches between two states, assembly state and disassembly state.
Edit intent: clarity
Original: The position of a propagating population front fluctuates because of the discreteness of the individuals and stochastic character of processes of birth, death and migration.
Revised: The position of propagating population fronts fluctuates because of the discreteness of the individuals and stochastic character of processes of birth, death and migration.
Edit intent: fluency
Original:  We also determine the probability distribution of rare, large fluctuations of the front position and, for a given average front speed , find the most likely population density profile of the front.
Revised:  We also determine the probability distribution of rare, large fluctuations of the front position and, for a given average front velocity , find the most likely population density profile of the front.
Edit intent: clarity
Original:  In this paper I will put forward important but yet overlooked relations between localization theory, random matrices, and the quasispecies model.
Revised:  In this paper I will put forward important but largely overlooked relations between localization theory, random matrices, and the quasispecies model.
Edit intent: clarity
Original:  In particular, I will show that the distribution of times between evolutionary jumps in the genotype space follows a power law, in agreement with recent findings in the shell model -- a simplified version of the quasispecies model.
Revised:  In particular, I will show that the distribution of times between evolutionary jumps in the genotype space follows a power law, in agreement with recent findings in the shell model - a simplified version of the quasispecies model.
Edit intent: fluency
Original:  Our present understanding of social rules in animal collectives is  based on empirical fits to observations and we lack first-principles approaches that allow their derivation.
Revised:  Our present understanding of social rules in animal collectives is mainly based on empirical fits to observations and we lack first-principles approaches that allow their derivation.
Edit intent: coherence
Original:  In the probability matching stage, each animal chooses a behavior with a probability given by the Bayesian estimation that this behavior is the most appropriate one.
Revised:  In the probability matching stage, each animal chooses a behavior with a probability equal to the Bayesian-estimated probability that this behavior is the most appropriate one.
Edit intent: clarity
Original:  The quantitative link shown between probabilistic estimation and collective rules of behavior allows a better contact with other fields such as foraging, mate selection, neurobiology and psychology, and gives predictions for experimenst directly testing the relationship between estimation and collective behavior.
Revised:  The quantitative link shown between probabilistic estimation and collective rules of behavior allows a better contact with other fields such as foraging, mate selection, neurobiology and psychology, and gives predictions for experiments directly testing the relationship between estimation and collective behavior.
Edit intent: fluency
Original:  So yes, in a computational sense, the aTAM is quite powerful .
Revised:  So yes, in a computational sense, the aTAM is quite powerful !
Edit intent: fluency
Original:  On the plus side, the aTAM, at temperature 1, is not only Turing universal but also supports the efficient self-assembly N \times N squares if self-assembly is allowed to utilize three spatial dimensions (Fu, Schweller and Cook, SODA 2011).
Revised:  On the plus side, the aTAM, at temperature 1, isn't only Turing universal but also supports the efficient self-assembly N \times N squares if self-assembly is allowed to utilize three spatial dimensions (Fu, Schweller and Cook, SODA 2011).
Edit intent: fluency
Original:  In this paper, we investigate the theoretical "power" of a seemingly simple, restrictive variant of Winfree's aTAM in which (1) the absolute value of every glue strength is 1, (2) there is a single negative strength glue type and (3) unequal glues cannot interact(i. e., glue functions must be "diagonal").
Revised:  We investigate the theoretical "power" of a seemingly simple, restrictive variant of Winfree's aTAM in which (1) the absolute value of every glue strength is 1, (2) there is a single negative strength glue type and (3) unequal glues cannot interact(i. e., glue functions must be "diagonal").
Edit intent: coherence
Original:  In this paper, we investigate the theoretical "power" of a seemingly simple, restrictive variant of Winfree's aTAM in which (1) the absolute value of every glue strength is 1, (2) there is a single negative strength glue type and (3) unequal glues cannot interact(i. e., glue functions must be "diagonal").
Revised:  In this paper, we investigate the theoretical "power" of a seemingly simple, restrictive class of tile assembly systems (TASs) in which (1) the absolute value of every glue strength is 1, (2) there is a single negative strength glue type and (3) unequal glues cannot interact(i. e., glue functions must be "diagonal").
Edit intent: clarity
Original:  In this paper, we investigate the theoretical "power" of a seemingly simple, restrictive variant of Winfree's aTAM in which (1) the absolute value of every glue strength is 1, (2) there is a single negative strength glue type and (3) unequal glues cannot interact(i. e., glue functions must be "diagonal").
Revised:  In this paper, we investigate the theoretical "power" of a seemingly simple, restrictive variant of Winfree's aTAM in which (1) the absolute value of every glue strength is 1, (2) there 's a single negative strength glue type and (3) unequal glues cannot interact(i. e., glue functions must be "diagonal").
Edit intent: fluency
Original:  We call this abstract model of self-assembly the restricted glue Tile Assembly Model (rgTAM ).
Revised:  We call this abstract model of self-assembly the restricted glue TASs (rgTAS ).
Edit intent: clarity
Original:  First, we first show that the tile complexity of uniquely producing an N \times N square in the rgTAM is O( \log N).
Revised:  First, we first show that the tile complexity of producing an N \times N square in the rgTAM is O( \log N).
Edit intent: clarity
Original:  First, we first show that the tile complexity of uniquely producing an N \times N square in the rgTAM is O( \log N).
Revised:  First, we first show that the tile complexity of uniquely producing an N \times N square with an rgTAS is O( \log N).
Edit intent: clarity
Original:  This paper provides new quantitative evidence of how journal rankings can disadvantage IDR in evaluation . Using publication data  it compares the degree of interdisciplinarity and the research performance of innovation studies units with business and management schools in the UK.
Revised:  This paper provides new quantitative evidence on how journal rankings can disadvantage IDR in evaluation . Using publication data it compares the degree of interdisciplinarity and the research performance of innovation studies units with business and management schools in the UK.
Edit intent: clarity
Original:  This paper provides new quantitative evidence of how journal rankings can disadvantage IDR in evaluation . Using publication data  it compares the degree of interdisciplinarity and the research performance of innovation studies units with business and management schools in the UK.
Revised:  This paper provides new quantitative evidence of how journal rankings can disadvantage interdisciplinary research during research evaluations . Using publication data it compares the degree of interdisciplinarity and the research performance of innovation studies units with business and management schools in the UK.
Edit intent: clarity
Original:  This paper provides new quantitative evidence of how journal rankings can disadvantage IDR in evaluation . Using publication data  it compares the degree of interdisciplinarity and the research performance of innovation studies units with business and management schools in the UK.
Revised:  This paper provides new quantitative evidence of how journal rankings can disadvantage IDR in evaluation . Using publication data , it compares the degree of interdisciplinarity and the research performance of innovation studies units with business and management schools in the UK.
Edit intent: fluency
Original:  The paper uses various mappings and metrics to show that innovation studies units are consistently more interdisciplinary than business and management schools .
Revised:  Using various mappings and metrics to show that innovation studies units are consistently more interdisciplinary than business and management schools .
Edit intent: clarity