wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this paper, we report analytical results in a network model of interbank lending based on directly relevant financial parameters  such as interest rates and leverage ratios.
Revised:  Here we report analytical results in a network model of interbank lending based on directly relevant financial parameters such as interest rates and leverage ratios.
Edit intent: coherence
Original:  In this paper, we report analytical results in a network model of interbank lending based on directly relevant financial parameters  such as interest rates and leverage ratios.
Revised:  In this paper, we report analytical results in a network model of interbank lending based on directly relevant financial parameters , such as interest rates and leverage ratios.
Edit intent: fluency
Original:  Using a mean-field approach, we obtain a closed-form formula for the "critical degree", viz. the number of creditors per bank below which an individual shock can cascade throughout the network.
Revised:  Using a mean-field approach, we obtain a closed-form formula for the "critical degree", viz. the number of creditors per bank below which an individual shock can propagate throughout the network.
Edit intent: clarity
Original:  Here, we monitor the spontaneous self-sustained dynamics in neuronal clusters formed by interconnected aggregates of neurons .
Revised:  Here, we monitor the spontaneous self-sustained dynamics in neuronal cultures formed by interconnected aggregates of neurons .
Edit intent: clarity
Original:  The analysis of the time delays between ignition sequences of the clusters allows the reconstruction of the directed functional connectivity of the network.
Revised:  The analysis of the time delays between clusters' activations within the bursts allows the reconstruction of the directed functional connectivity of the network.
Edit intent: clarity
Original:  We show that in G a shortest path tree from a given source can be computed in O(n\log n) time in the unweighted case and in O(n^{1+\varepsilon}) time in the weighted case.
Revised:  We show that in G a shortest path tree from a given source in O(n\log n) time in the unweighted case and in O(n^{1+\varepsilon}) time in the weighted case.
Edit intent: clarity
Original:  Previous algorithms used O(n\log^6 n) expected time for the unweighted case and O(n^{4/3+\varepsilon}) time for the weighted case .
Revised:  Previous algorithms used O(n\log^6 n) expected time for the unweighted case and O(n^{4/3+\varepsilon}) .
Edit intent: clarity
Original: In the Vertex Cover Reconfiguration (VCR) problem, given graph G = (V, E), positive integers k and \ell, and two vertex covers S and T of G of size at most k, we determine whether S can be transformed into T by a sequence of at most \ell vertex additions or removals such that every operation results in a vertex cover of size at most k.
Revised: In the Vertex Cover Reconfiguration (VCR) problem, given a graph G, positive integers k and \ell, and two vertex covers S and T of G of size at most k, we determine whether S can be transformed into T by a sequence of at most \ell vertex additions or removals such that every operation results in a vertex cover of size at most k.
Edit intent: clarity
Original:  Motivated by recent results establishing the W[1]-hardness of VCR when parameterized by \ell, we delineate the complexity of the problem restricted to various graph classes.
Revised:  Motivated by results establishing the W[1]-hardness of VCR when parameterized by \ell, we delineate the complexity of the problem restricted to various graph classes.
Edit intent: clarity
Original:  In particular, we show that VCR remains W [1]-hard on bipartite graphs, is NP-hard but fixed-parameter tractable on  graphs of bounded degree, and is solvable in time polynomial in |V(G) | on cactus graphs .
Revised:  In particular, we show that VCR remains w [1]-hard on bipartite graphs, is NP-hard but fixed-parameter tractable on graphs of bounded degree, and is solvable in time polynomial in |V(G) | on cactus graphs .
Edit intent: fluency
Original:  We prove W 1%DIFDELCMD < ]%%% -hardness and fixed-parameter tractability via two new problems of independent interest .
Revised:  We prove W 1%DIFDELCMD < ]%%% .
Edit intent: clarity
Original: In the Vertex Cover Reconfiguration (VCR) problem, given a graph G, positive integers k and \ell , and two vertex covers S and T of G of size at most k, we determine whether S can be transformed into T by a sequence of at most \ell vertex additions or removals such that every operation results in a vertex cover of size at most k.
Revised: In the Vertex Cover Reconfiguration (VCR) problem, given a graph G, positive integers k and \ell and two vertex covers S and T of G of size at most k, we determine whether S can be transformed into T by a sequence of at most \ell vertex additions or removals such that every operation results in a vertex cover of size at most k.
Edit intent: fluency
Original:  In particular, we show that VCR remains w [1]-hard on bipartite graphs, is NP-hard  but fixed-parameter tractable on (regular) graphs of bounded degree , and is solvable in polynomial time on trees and (with some additional restrictions) on cactus graphs.
Revised:  In particular, we show that VCR remains W [1]-hard on bipartite graphs, is NP-hard but fixed-parameter tractable on (regular) graphs of bounded degree , and is solvable in polynomial time on trees and (with some additional restrictions) on cactus graphs.
Edit intent: fluency
Original:  In particular, we show that VCR remains w [1]-hard on bipartite graphs, is NP-hard  but fixed-parameter tractable on (regular) graphs of bounded degree , and is solvable in polynomial time on trees and (with some additional restrictions) on cactus graphs.
Revised:  In particular, we show that VCR remains w [1]-hard on bipartite graphs, is NP-hard , but fixed-parameter tractable on (regular) graphs of bounded degree , and is solvable in polynomial time on trees and (with some additional restrictions) on cactus graphs.
Edit intent: fluency
Original: Our main technical result is that metric balls in the coset leader graph of a linear binary code of block length n  spanned by constant-weight vectors grow exponentially slower than those in \{0,1\}^n.
Revised: Our main technical result is that , in the coset leader graph of a linear binary code of block length n spanned by constant-weight vectors grow exponentially slower than those in \{0,1\}^n.
Edit intent: clarity
Original: Motivation In many key applications in the field of metabolomics, such as toxicology or nutrigenomics, it is of interest to profile and detect physiological changes in metabolic pathways .
Revised:  In many key applications in the field of metabolomics, such as toxicology or nutrigenomics, it is of interest to profile and detect physiological changes in metabolic pathways .
Edit intent: coherence
Original: Motivation In many key applications in the field of metabolomics, such as toxicology or nutrigenomics, it is of interest to profile and detect physiological changes in metabolic pathways .
Revised: Motivation In many key applications of metabolomics, such as toxicology or nutrigenomics, it is of interest to profile and detect physiological changes in metabolic pathways .
Edit intent: clarity
Original: Motivation In many key applications in the field of metabolomics, such as toxicology or nutrigenomics, it is of interest to profile and detect physiological changes in metabolic pathways .
Revised: Motivation In many key applications in the field of metabolomics, such as toxicology or nutrigenomics, it is of interest to profile and detect changes in metabolic pathways .
Edit intent: clarity
Original:  For this purpose, it is useful to build a comprehensive graphical representation which shows metabolic processes occurring in an organism using networks.
Edit intent: coherence
Original:  To model these systems it is possible to describe both reactions and relations among enzymes and metobolites .
Revised:  To model these systems it is possible to describe both reactions and relations among enzymes and metabolites .
Edit intent: clarity
Original:  In this way, analysis of possible changes or perturbations impact throughout the network are easier to understand, detect and predict.
Revised:  In this way, analysis of the impact of changes in some metabolites or enzymes on different processes are easier to understand, detect and predict.
Edit intent: clarity
Original:  MetaboX includes methods to extract information about a resource of interest (e.g. metabolite, reaction and enzyme) for further processing and storing purposes.
Revised:  The MetaboX library includes methods to extract information about a resource of interest (e.g. metabolite, reaction and enzyme) for further processing and storing purposes.
Edit intent: clarity
Original: Although the phrase "ontogeny recapitulates phylogeny'' turned out to be incorrect, the search for possible relationships between development and evolution still gathers much attention.
Revised: Search for possible relationships between development and evolution still gathers much attention.
Edit intent: coherence
Original: The spontaneous emergence of coherent behavior through synchronization plays a key role in neural function and performance , and its anomalies often lie at the basis of pathologies.
Revised: The spontaneous emergence of coherent behavior through synchronization plays a key role in neural function , and its anomalies often lie at the basis of pathologies.
Edit intent: clarity
Original:  Between the synchronous and asynchronous regimes that can be achieved by tuning details in any generic network, here we elucidate the existence of a novel, broad intermediate state, stemming from the hierarchical modular organization of the connectome.
Revised:  We elucidate the existence of a novel, broad intermediate state, stemming from the hierarchical modular organization of the connectome.
Edit intent: clarity
Original:  Where one would expect a hierarchical matryovska-doll synchronization process, we show that the inter- play between network structure and quenched node frequency heterogeneity gives rise to frustrated synchronization, metastability, and chimera states .
Revised:  Where one would expect a hierarchical synchronization process, we show that the inter- play between network structure and quenched node frequency heterogeneity gives rise to frustrated synchronization, metastability, and chimera states .
Edit intent: clarity
Original:  Where one would expect a hierarchical matryovska-doll synchronization process, we show that the inter- play between network structure and quenched node frequency heterogeneity gives rise to frustrated synchronization, metastability, and chimera states .
Revised:  Where one would expect a hierarchical matryovska-doll synchronization process, we show that the interplay between structural bottlenecks and quenched intrinsic frequency heterogeneities at many different scales, gives rise to frustrated synchronization, metastability, and chimera states .
Edit intent: clarity
Original:  We uncover the spectral origin of the dynamic freezing behind such phenomenology, and discuss how such complex synchronization patterns relate to the need for the brain to access large dynamical repertoires without ad hoc fine-tuning to a critical point.
Revised:  We uncover the origin of the dynamic freezing behind such phenomenology, and discuss how such complex synchronization patterns relate to the need for the brain to access large dynamical repertoires without ad hoc fine-tuning to a critical point.
Edit intent: clarity
Original:  We uncover the spectral origin of the dynamic freezing behind such phenomenology, and discuss how such complex synchronization patterns relate to the need for the brain to access large dynamical repertoires without ad hoc fine-tuning to a critical point.
Revised:  We uncover the spectral origin of the dynamic freezing behind such phenomenology, and discuss how the emerging complex synchronization patterns relate to the need for the brain to access large dynamical repertoires without ad hoc fine-tuning to a critical point.
Edit intent: clarity
Original:  The hierarchical factor model considers that outlier loci are atypically explained by one of the factors.
Revised:  The hierarchical factor model searches for loci that are atypically related to population structure as measured by the latent factors.
Edit intent: clarity
Original:  In a model of population divergence, we show that it can achieve a 2-fold or more reduction of false discovery rate compared to the software BayeScan or compared to a F_{ST} approach.
Revised:  In a model of population divergence, we show that the factor model can achieve a 2-fold or more reduction of false discovery rate compared to the software BayeScan or compared to a F_{ST} approach.
Edit intent: clarity
Original: Linear mixed models (LMMs) are a powerful and established tool for studying the genetics of phenotypic variation .
Revised: Linear mixed models (LMMs) are a powerful and established tool for studying genotype-phenotype relationships .
Edit intent: clarity
Original:  A limiting assumption of LMMs is that the phenotype is Gaussian distributedunder the model , a requirement that rarely holds in practice.
Revised:  A limiting assumption of LMMs is that the residuals are Gaussian distributed , a requirement that rarely holds in practice.
Edit intent: clarity
Original:  Since violations of this assumption can lead to false conclusions and losses in power, it's common practice to pre-process the phenotypic values  , for instance by applying logarithmic  transformations.
Revised:  Violations of this assumption can lead to false conclusions and losses in power, it's common practice to pre-process the phenotypic values , for instance by applying logarithmic transformations.
Edit intent: coherence
Original:  Since violations of this assumption can lead to false conclusions and losses in power, it's common practice to pre-process the phenotypic values  , for instance by applying logarithmic  transformations.
Revised:  Since violations of this assumption can lead to false conclusions and losses in power, and hence it is common practice to pre-process the phenotypic values , for instance by applying logarithmic transformations.
Edit intent: coherence
Original:  We show in extensive simulations and  real data from human, mouse and yeast that application of these optimal transformations leads to increased power in genome-wide association studies and higher accuracy in heritability estimates and phenotype predictions.
Revised:  We show in extensive simulations and real data from human, mouse and yeast we show that using such optimal transformations lead to increased power in genome-wide association studies and higher accuracy in heritability estimates and phenotype predictions.
Edit intent: clarity
Original:  However , if only a set of views  are made accessible to users according to some policy , then this set should be checked against the policy for the whole probable query history.
Revised:  However if only a set of views are made accessible to users according to some policy , then this set should be checked against the policy for the whole probable query history.
Edit intent: coherence
Original:  However , if only a set of views  are made accessible to users according to some policy , then this set should be checked against the policy for the whole probable query history.
Revised:  However , if only a set of views are made accessible to users , then this set should be checked against the policy for the whole probable query history.
Edit intent: clarity
Original:  The aim of this work is to define a privacy preserving secure decomposition algorithm according to the attribute based policy rules and build an external layer which decomposes the relations into several ones in order to inhibit joins or inferences that may violate predefined privacy constraints.
Revised:  The aim of this work is to define a proactive decomposition algorithm according to the attribute based policy rules and build an external layer which decomposes the relations into several ones in order to inhibit joins or inferences that may violate predefined privacy constraints.
Edit intent: clarity
Original:  The aim of this work is to define a privacy preserving secure decomposition algorithm according to the attribute based policy rules and build an external layer which decomposes the relations into several ones in order to inhibit joins or inferences that may violate predefined privacy constraints.
Revised:  The aim of this work is to define a privacy preserving secure decomposition algorithm according to the attribute based policy rules and build a secure logical schema in which relations are decomposed into several ones in order to inhibit joins or inferences that may violate predefined privacy constraints.
Edit intent: clarity
Original:  One of these application is represented by optimizations that employ very expensive numerical simulations in terms of resources .
Revised:  One of these application is represented by optimizations that employ very expensive numerical simulations .
Edit intent: clarity
Original:  These technologies consist in enhancements of the basic structure and hybridizations with other optimization strategies.
Revised:  These technologies consist in enhancements of the ABC structure and hybridizations with other optimization strategies.
Edit intent: clarity
Original:  In this paper, we give a number of hardness results - for decision, approximate counting and exact counting - in the case that this condition on the minimal subgraphs having the desired property does not hold .
Revised:  In this paper, we give a number of hardness results for the situation in which this bounded treewidth condition does not hold .
Edit intent: clarity
Original:  This method formally discretizes the PDE on an infinite Cartesian grid, and then solves the corresponding difference equations .
Revised:  These difference equations can arise directly in the description of physical systems, e.g. crystal structures, or indirectly through the discretization of PDEs .
Edit intent: clarity
Original:  The new method yields more robust estimates of posterior uncertainty, and thus greatly reduces the tendency of the model to incorrectly estimate biogeographically interesting models with strong support.
Revised:  The new method yields more robust estimates of posterior uncertainty, and thus greatly reduces the tendency to incorrectly estimate biogeographically interesting models with strong support.
Edit intent: clarity
Original: Biogeographers often seek to explain speciation on geographical phenomena.
Edit intent: coherence
Original:  Establishing that a set of population splitting events occurred at the same time can be a  persuasive argument that a set of taxa were affected by the same geographic events.
Revised:  Establishing that a set of population-splitting events occurred at the same time can be a persuasive argument that a set of taxa were affected by the same geographic events.
Edit intent: fluency
Original:  Establishing that a set of population splitting events occurred at the same time can be a  persuasive argument that a set of taxa were affected by the same geographic events.
Revised:  Establishing that a set of population splitting events occurred at the same time can be a potentially persuasive argument that a set of taxa were affected by the same geographic events.
Edit intent: clarity
Original:  Huang et al. ( 2011) introduced an approximate Bayesian approach (implemented in the software msBayes) to estimate the probabilities of models in which multiple sets of taxadiverge simultaneously.
Revised:  Huang et al. ( 2013) assessed the ability of an approximate-Bayesian method ( msBayes) to estimate the probabilities of models in which multiple sets of taxadiverge simultaneously.
Edit intent: clarity
Original:  They proposed a model-averaging approach using narrow, empirically informed uniform priors.
Revised:  They proposed a model-averaging approach using narrow, empirical uniform priors.
Edit intent: clarity
Original:  Here, we demonstrate their approach is dangerous in the sense that the empirically-derived priors often exclude the true values of the parameters.
Revised:  Here, we demonstrate that the parameters.
Edit intent: clarity
Original: In Bender and Dokuchaev (2013)  we studied a control problem related to swing option pricing in a general non-Markovian setting.
Revised: In Bender and Dokuchaev (2013) , we studied a control problem related to swing option pricing in a general non-Markovian setting.
Edit intent: fluency
Original: This research is a review and assay of literature data on the properties of DNA open states .
Revised: Literature data on the properties of DNA open states .
Edit intent: clarity
Original:  Based on differences in thermodynamic properties and other characteristics three different types of DNA open states have been identified;
Revised:  Three types of DNA open states are recognized based on their differences in thermodynamic properties and other characteristics three different types of DNA open states have been identified;
Edit intent: clarity
Original:  a modern definition of the term "open state" has been given.
Revised:  a modern definition of the term "open state" is given.
Edit intent: clarity
Original:  A brief review of simple mathematical models of DNA has been presented;
Revised:  A review is carried out for simple mathematical models of DNA has been presented;
Edit intent: clarity
Original:  A brief review of simple mathematical models of DNA has been presented;
Revised:  A brief review of simple mathematical models of DNA 
Edit intent: clarity
Original:  in most of the models the state of every base pair is defined by one or two variables.
Revised:  in most of which the state of one pair is described by one or two variables.
Edit intent: clarity
Original:  Special emphasis is placed on the study of transfer and localization of base pair vibration energy in mechanical models.
Revised:  Special consideration is given to the studies of the transfer and localization of base pair vibration energy in mechanical models.
Edit intent: clarity
Original:  Special emphasis is placed on the study of transfer and localization of base pair vibration energy in mechanical models.
Revised:  Special emphasis is placed on the study of transfer and localization of the nucleotide pairs oscillations' energy by mechanical models.
Edit intent: clarity
Original:  These processes have been shown to play a key role in heterogeneous duplex dynamics, and their theoretical treatment is critically important for the development of modern molecular biology and biophysics.
Revised:  These processes are shown to play a key role in heterogeneous duplex dynamics, and their theoretical treatment is critically important for the development of modern molecular biology and biophysics.
Edit intent: style
Original:  These processes have been shown to play a key role in heterogeneous duplex dynamics, and their theoretical treatment is critically important for the development of modern molecular biology and biophysics.
Revised:  These processes have been shown to play a key role in the dynamics of a heterogeneous duplex. Their theoretical interpretation is proven to be very important for the development of modern molecular biology and biophysics.
Edit intent: clarity
Original:  The key features of theoretical approaches, that enabled description of various experimental data , have been considered.
Revised:  The main features of the theoretical approaches are considered which enabled describing various experimental data , have been considered.
Edit intent: clarity
Original:  The future development of the models has been described, some particular details of their optimization have been suggested;
Revised:  The future development of the models ' development are described, particular details of their optimization have been suggested;
Edit intent: clarity
Original:  probable ways of improving some experimental techniques have been proposed .
Revised:  probable ways of improving some experimental techniques are discussed .
Edit intent: clarity