wanyu/IteraTeR_v2 huggingface dataset:
Original:  We found that the retinal distance strongly deviates from Euclidean, and indeed from any distance with a static metric, yet it nevertheless has a simple structure that relies on a small number of stimulus projections.
Revised:  We found that the retinal distance strongly deviates from Euclidean, or any static metric, yet it nevertheless has a simple structure that relies on a small number of stimulus projections.
Edit intent: clarity
Original:  We found that the retinal distance strongly deviates from Euclidean, and indeed from any distance with a static metric, yet it nevertheless has a simple structure that relies on a small number of stimulus projections.
Revised:  We found that the retinal distance strongly deviates from Euclidean, and indeed from any distance with a static metric, yet has a simple structure that relies on a small number of stimulus projections.
Edit intent: coherence
Original:  By constructing a mathematical model for the retinal distance we show that this non-Euclidean nature  has important consequences for decoding and inferring feature sensitivity of whole neural populations .
Revised:  By constructing a mathematical model for the retinal distance we show that this non-Euclidean nature of the retinal distance has important consequences for decoding and inferring feature sensitivity of whole neural populations .
Edit intent: clarity
Original:  By constructing a mathematical model for the retinal distance we show that this non-Euclidean nature  has important consequences for decoding and inferring feature sensitivity of whole neural populations .
Revised:  By constructing a mathematical model for the retinal distance we show that this non-Euclidean nature has important consequences for neural decoding .
Edit intent: clarity
Original:  Sheldon originally introduced network reputation games to investigate the self-interested behavior of web authors who want to maximize their PageRank on a directed web graph by choosing their outlinks in a game theoretic manner.
Revised:  Sheldon originally introduced network reputation games to investigate the self-interested behavior of web authors who want to maximize their PageRank on a directed web graph by choosing their outlinks in a game theoretic manner.
Edit intent: fluency
Original:  In this paper we consider three different models for PageRank games on undirected graphs such as certain social networks.
Revised:  In this paper we consider three different models for PageRank games on undirected graphs such as certain social networks.
Edit intent: fluency
Original:  In the ED model players are free to delete any of their bidirectional links but may not add links.
Revised:  In the deletion-model players are free to delete any of their bidirectional links but may not add links.
Edit intent: clarity
Original:  We study the problem of determining whether the given graph represents a Nash equilibrium or not in the ED model.
Revised:  We study the problem of determining whether the given graph represents a Nash equilibrium or not in this model.
Edit intent: clarity
Original:  In the ECD model players are free to delete any biderctional links and add any directed links, since this addition can be done unilaterally  .
Revised:  In the ECD model players are free to delete any bidirectional links and add any directed links, since this addition can be done unilaterally .
Edit intent: fluency
Original:  In the ECD model players are free to delete any biderctional links and add any directed links, since this addition can be done unilaterally  .
Revised:  In the ECD model players are free to delete any biderctional links and add any directed links, since these additions can be done unilaterally .
Edit intent: fluency
Original:  Finally, in the EAD model we allow a node to make arbitrary deletions and the addition of a single bidirectional link if it would increase the page rank of the other player also.
Revised:  Finally, in the add-delete- model we allow a node to make arbitrary deletions and the addition of a single bidirectional link if it would increase the page rank of the other player also.
Edit intent: clarity
Original: We prove a conjecture in 3 by showing that cellular automata that eventually fix all cells to a fixed symbol 0 are nilpotent on S ^{\Z^d for all d.
Revised: We prove a conjecture 3 by showing that cellular automata that eventually fix all cells to a fixed symbol 0 are nilpotent on S ^{\Z^d for all d.
Edit intent: clarity
Original: We prove a conjecture in 3 by showing that cellular automata that eventually fix all cells to a fixed symbol 0 are nilpotent on S ^{\Z^d for all d.
Revised: We prove a conjecture in 3 by showing that cellular automata that eventually fix all cells to a fixed symbol 0 are nilpotent on S ^Z^d for all d.
Edit intent: fluency
Original:  This can be useful whenever one wishes to find a set of database sequences that is appropriate to use for comparative analysis of environmentally-derived sequences, such as for selecting "reference tree" sequences for phylogenetic placement of metagenomic reads.
Revised:  This can be useful whenever one wishes to find a set of reference sequences that is appropriate to use for comparative analysis of environmentally-derived sequences, such as for selecting "reference tree" sequences for phylogenetic placement of metagenomic reads.
Edit intent: clarity
Original:  Via simulation , we show that our ADCL criterion chooses chimeric sequences less often than random subsets, while the maximization of phylogenetic diversity chooses them more often than random.
Revised:  Via simulation , we show that the ADCL criterion chooses chimeric sequences less often than random subsets, while the maximization of phylogenetic diversity chooses them more often than random.
Edit intent: fluency
Original: On-line aggregation provides estimates to the final result of a computation during the actual processing.
Revised: Online aggregation provides estimates to the final result of a computation during the actual processing.
Edit intent: fluency
Original:  In this paper we introduce the first framework for parallel on-line aggregation in which the estimation  does not incur any overhead on top of the actual execution.
Revised:  In this paper we introduce the first framework for parallel online aggregation in which the estimation does not incur any overhead on top of the actual execution.
Edit intent: fluency
Original:  We design a novel estimator specifically targeted at parallel on- line aggregation.
Revised:  We design a novel estimator specifically targeted at parallel online aggregation.
Edit intent: fluency
Original:  When executed by the framework over an 8TB TPC-H instance, the estimator provides accurate confidence bounds early in the execution even when the cardinality of the final result is seven orders of magnitude smaller than the dataset size and without incurring any overhead.
Revised:  When executed by the framework over a massive 8\text{TB TPC-H instance, the estimator provides accurate confidence bounds early in the execution even when the cardinality of the final result is seven orders of magnitude smaller than the dataset size and without incurring any overhead.
Edit intent: clarity
Original:  When executed by the framework over an 8TB TPC-H instance, the estimator provides accurate confidence bounds early in the execution even when the cardinality of the final result is seven orders of magnitude smaller than the dataset size and without incurring any overhead.
Revised:  When executed by the framework over an 8TB TPC-H instance, the estimator provides accurate confidence bounds early in the execution even when the cardinality of the final result is seven orders of magnitude smaller than the dataset size and without incurring overhead.
Edit intent: clarity
Original:  Here we first describe the protein structure networks of molecular chaperones, then characterize chaperone containing subnetworks of interactomes called as chaperone-networks or chaperomes.
Revised:  Here , we describe first the protein structure networks of molecular chaperones, then characterize chaperone containing subnetworks of interactomes called as chaperone-networks or chaperomes.
Edit intent: fluency
Original:  Here we first describe the protein structure networks of molecular chaperones, then characterize chaperone containing subnetworks of interactomes called as chaperone-networks or chaperomes.
Revised:  Here we first describe the protein structure networks of molecular chaperones, then characterize chaperone containing sub-networks of interactomes called as chaperone-networks or chaperomes.
Edit intent: fluency
Original:  After memory formation the stored information is protected by modular boundary-induced segregation and information filtering  .
Revised:  After memory formation , modular boundary-induced segregation and information filtering .
Edit intent: clarity
Original:  After memory formation the stored information is protected by modular boundary-induced segregation and information filtering  .
Revised:  After memory formation the stored information is protected by modular boundary-induced segregation and information filtering protect the stored information .
Edit intent: clarity
Original:  Flexible network topology provides 'learning-competent' state.
Revised:  Flexible network topology provides "learning competent" state.
Edit intent: fluency
Original:  Since modular boundaries are efficient filters of information, in the 'learning-competent' state information filtering may be much smaller, than after memory formation.
Revised:  Since modular boundaries are efficient filters of information, in the "learning competent" state information filtering may be much smaller, than after memory formation.
Edit intent: fluency
Original:  This mechanism restricts high information transfer to the 'learning competent' state.
Revised:  This mechanism restricts high information transfer to the "learning competent" state.
Edit intent: fluency
Original:  The flexible networks of young organisms are generally in a 'learning competent' state.
Revised:  The flexible networks of young organisms are generally in a "learning competent" state.
Edit intent: fluency
Original:  On the contrary, locally rigid networks of old organisms have lost their 'learning competent' state, but store and protect their learnt information efficiently.
Revised:  On the contrary, locally rigid networks of old organisms have lost their "learning competent" state, but store and protect their learnt information efficiently.
Edit intent: fluency
Original: Spin models on adaptive networks have been shown to exhibit self-organized critical behavior from simple, biologically inspired and locally defined adaptation rules, and have been used to argue for similar adaptive mechanisms in the brain [1].
Revised: Spin models of adaptive networks have been shown to exhibit self-organized critical behavior from simple, biologically inspired and locally defined adaptation rules, and have been used to argue for similar adaptive mechanisms in the brain [1].
Edit intent: fluency
Original:  Subsequently, activity avalanches have been observed in cortical cultures which support the hypothesis of neural dynamics near criticality [2].
Revised:  However, the choice of spin-type node states limits the biological plausibility of these models. Subsequent experimental studies on real cortical cultures have revealed avalanche-like propagation of activity with statistical properties that support the hypothesis of neural dynamics near criticality [2].
Edit intent: clarity
Original: Spin models of adaptive networks have been shown to exhibit self-organized critical behavior from simple, biologically inspired and locally defined adaptation rules, and have been used to argue for similar adaptive mechanisms in the brain 1%DIFDELCMD < ]%%% . However, the choice of spin-type node states limits the biological plausibility of these models.
Revised: Spin models of adaptive networks have been shown to exhibit self-organized 1%DIFDELCMD < ]%%% . However, the choice of spin-type node states limits the biological plausibility of these models.
Edit intent: coherence
Original: Spin models of adaptive networks have been shown to exhibit self-organized critical behavior from simple, biologically inspired and locally defined adaptation rules, and have been used to argue for similar adaptive mechanisms in the brain 1%DIFDELCMD < ]%%% . However, the choice of spin-type node states limits the biological plausibility of these models.
Revised: Spin models of adaptive networks have been shown to exhibit self-organized critical behavior from simple, biologically inspired and locally defined adaptation rules, and have been used to argue for similar adaptive mechanisms in the brain %DIFDELCMD < ]%%% . However, the choice of spin-type node states limits the biological plausibility of these models.
Edit intent: coherence
Original:  As a result the new model allows to quantify neuronal avalanches in the evolved networks, where power-law scaling exponents of avalanche sizes and durations are compatible both with relations predicted from universal scaling theory as well as results from observed activity avalanches in real cortical cultures .
Revised:  As a result the new model allows to quantify neuronal avalanches in the evolved networks, where power-law scaling exponents of avalanche sizes and durations , as well as results from observed activity avalanches in real cortical cultures .
Edit intent: clarity
Original:  This paper investigates the Colourability problem on dually chordal graphs and will show that it is NP-complete in case of four colors .
Revised:  This paper investigates the Colourability problem on dually chordal graphs and will show that it is NP-complete in case of four colours .
Edit intent: fluency
Original:  For 3-Colourability this paper will show that a dually chordal graph is 3-colorable if and only if it is perfect and has no clique of size four.
Revised:  For 3-Colourability this paper will show that a dually chordal graph is 3-colourable if and only if it is perfect and has no clique of size four.
Edit intent: fluency
Original:  Also a simple linear time algorithm is given to find a 3-coloring in a dually chordal graph.
Revised:  Also a simple linear time algorithm is given to find a 3-colouring in a dually chordal graph.
Edit intent: fluency
Original:  This paper investigates the Colourability problem on dually chordal graphs and will show that it is NP-complete in case of four colours .
Revised:  This paper investigates the Colourability problem on dually chordal graphs . It will show that it is NP-complete in case of four colours .
Edit intent: coherence
Original: We further generalize the stochastic version of the replicator dynamics due to Fudenberg and Harris FH92  . In particular, we add a random jump term to the payoff function to simulate anomalous events and their effects on the fitness.
Revised: A further generalization of the stochastic replicator dynamic derived by Fudenberg and Harris FH92 . In particular, we add a random jump term to the payoff function to simulate anomalous events and their effects on the fitness.
Edit intent: clarity
Original: We consider the market of n financial agents who aim to increase their utilities by efficiently sharing their random endowments.
Revised: The paper studies an oligopolistic equilibrium model of financial agents who aim to increase their utilities by efficiently sharing their random endowments.
Edit intent: clarity
Original: We consider the market of n financial agents who aim to increase their utilities by efficiently sharing their random endowments.
Revised: We consider the market of n financial agents who aim to share their random endowments.
Edit intent: clarity
Original:  This , together with the fact that all delay moments of PB are finite makes PB a better alternative than EB , now that there are increasingly more multimedia applications with stringent delay requirements in the network .
Revised:  This , together with the fact that all delay moments of PB are finite makes PB a better alternative than EB for multimedia applications with stringent delay requirements in the network .
Edit intent: clarity
Original:  This , together with the fact that all delay moments of PB are finite makes PB a better alternative than EB , now that there are increasingly more multimedia applications with stringent delay requirements in the network .
Revised:  This , together with the fact that all delay moments of PB are finite makes PB a better alternative than EB , now that there are increasingly more multimedia applications with stringent delay requirements .
Edit intent: clarity
Original:  By construction, each sinlet is differentiable infinitely many times and has a well-defined and smoothly-varied instantaneous frequency known in analytical form.
Revised:  By construction, each sinlet is infinitely differentiable and has a well-defined and smoothly-varied instantaneous frequency known in analytical form.
Edit intent: clarity
Original:  By construction, each sinlet is differentiable infinitely many times and has a well-defined and smoothly-varied instantaneous frequency known in analytical form.
Revised:  By construction, each sinlet is differentiable infinitely many times and has a well-defined and smooth instantaneous frequency known in analytical form.
Edit intent: clarity
Original: Recently, a multi-scale notions of local homology was proposed (Bendich et al) to study the local structure of a stratified space around a given point from a point cloud sample.
Revised: Recently, multi-scale notions of local homology was proposed (Bendich et al) to study the local structure of a stratified space around a given point from a point cloud sample.
Edit intent: fluency
Original: Recently, a multi-scale notions of local homology was proposed (Bendich et al) to study the local structure of a stratified space around a given point from a point cloud sample.
Revised: Recently, a multi-scale notions of local homology was proposed (Bendich et al) to study the local structure of spaces around a given point from a point cloud sample.
Edit intent: clarity
Original:  To give reconstruction guarantees , the approach relied on constructing embedded complexes which become difficult to construct in high dimensions.
Revised:  Current reconstruction guarantees rely on constructing embedded complexes which become difficult to construct in high dimensions.
Edit intent: clarity
Original:  To give reconstruction guarantees , the approach relied on constructing embedded complexes which become difficult to construct in high dimensions.
Revised:  To give reconstruction guarantees , the approach relied on constructing embedded complexes which become difficult in high dimensions.
Edit intent: fluency
Original:  We derive sampling conditions under which thepersistence diagrams used for estimating local homology, can be approximated using families of Vietoris-Rips complexes, whose simple construction is robust in any dimension.
Revised:  We persistence diagrams used for estimating local homology, can be approximated using families of Vietoris-Rips complexes, whose simple construction is robust in any dimension.
Edit intent: clarity
Original:  We derive sampling conditions under which thepersistence diagrams used for estimating local homology, can be approximated using families of Vietoris-Rips complexes, whose simple construction is robust in any dimension.
Revised:  We derive sampling conditions under which thepersistence diagrams used for estimating local homology, can be approximated using families of Vietoris-Rips complexes, whose simple constructions are robust in any dimension.
Edit intent: fluency
Original:  To the best of our knowledge, our results, for the first time, make stratification learning using local homologyfeasible in high-dimensions .
Revised:  To the best of our knowledge, our results, for the first time, make applications based on local homology, such as stratification learning, feasible in high dimensions .
Edit intent: clarity
Original: Genomic regions  displaying outstanding correlation with some environmental variables are likely to be under selection and this is the rationale of recent methods of identifying selected loci and retrieve functional information about them.
Revised: Genomic regions (or loci) displaying outstanding correlation with some environmental variables are likely to be under selection and this is the rationale of recent methods of identifying selected loci and retrieve functional information about them.
Edit intent: clarity
Original: Genomic regions  displaying outstanding correlation with some environmental variables are likely to be under selection and this is the rationale of recent methods of identifying selected loci and retrieve functional information about them.
Revised: Genomic regions displaying outstanding correlation with some environmental variables are likely to be under selection and this is the rationale of recent methods of identifying selected loci and retrieving functional information about them.
Edit intent: fluency
Original:  For the routine analysis of genomewide data-sets , one also need fast inference and model selection algorithms.
Revised:  For the routine analysis of genome-wide datasets , one also need fast inference and model selection algorithms.
Edit intent: fluency
Original:  For the routine analysis of genomewide data-sets , one also need fast inference and model selection algorithms.
Revised:  For the routine analysis of genomewide data-sets , one also needs fast inference and model selection algorithms.
Edit intent: fluency
Original:  We describe a method based on an explicit spatial model that builds on the theoretical and computational framework developed by Rue et al. (2009) and Lindgren et al . (2011 .
Revised:  We propose a method based on an explicit spatial model that builds on the theoretical and computational framework developed by Rue et al. (2009) and Lindgren et al . (2011 .
Edit intent: clarity
Original:  We describe a method based on an explicit spatial model that builds on the theoretical and computational framework developed by Rue et al. (2009) and Lindgren et al . (2011 .
Revised:  We describe a method based on an explicit spatial model that builds on the theoretical and computational framework developed by Rue et al. (2009) and Lindgren et al (2011 .
Edit intent: fluency
Original:  The methods allows one to quantify  correlation between genotypes and environmental variables and to rank loci accordingly .
Revised:  The methods allows one to quantify the correlation between genotypes and environmental variables and to rank loci accordingly .
Edit intent: fluency
Original:  The methods allows one to quantify  correlation between genotypes and environmental variables and to rank loci accordingly .
Revised:  The methods allows one to quantify correlation between genotypes and environmental variables .
Edit intent: clarity
Original:  It works for SNP and AFLP data obtained either at the individual or at the population level.
Revised:  It works for the most common types of genetic markers, obtained either at the individual or at the population level.
Edit intent: clarity
Original: We revisit the question of the  pitch angle of DNA , which has been suggested to be 45 deg .
Revised: The question of the pitch angle of DNA , which has been suggested to be 45 deg .
Edit intent: clarity
Original: We revisit the question of the  pitch angle of DNA , which has been suggested to be 45 deg .
Revised: We revisit the question of the value of the pitch angle of DNA , which has been suggested to be 45 deg .
Edit intent: clarity
Original:  Models to assess extinction risk often lack explicit incorporation of these interspeci?c interactions.
Revised:  Models to assess extinction risk often lack explicit incorporation of these interspecific interactions.
Edit intent: fluency
Original:  We study a birth and death process in which the death rate includes an e?ect from predation.
Revised:  We study a birth and death process in which the death rate includes an effect from predation.
Edit intent: fluency