wanyu/IteraTeR_v2 huggingface dataset:
Original:  We prove that a greedy node/edge removal strategy, based on successive minimization of LFVC, is nearly as good as the optimal, but intractable, combinatorial batch removal strategy.
Revised:  We prove that a greedy node/edge removal strategy, based on successive maximization of LFVC, is nearly as good as the optimal, but intractable, combinatorial batch removal strategy.
Edit intent: fluency
Original:  This paper addresses the problem of detecting deep communities using a new centrality measure, called the local Fiedler vector centrality (LFVC)  .
Revised:  This paper formulates the problem of detecting deep communities using a new centrality measure, called the local Fiedler vector centrality (LFVC) .
Edit intent: clarity
Original:  When the curing rates in the network are high, the all-healthy state is the unique equilibrium over the network.
Revised:  When the curing rates in the network are high, the disease-free state is the unique equilibrium over the network.
Edit intent: clarity
Original:  Using notions from positive systems theory, we provide conditions for the global asymptotic stability of the equilibrium points in both cases over strongly connected networks based on the value of the basic reproduction number, a fundamental quantity in the study of epidemics.
Revised:  Using notions from positive systems theory, we provide novel proofs for the global asymptotic stability of the equilibrium points in both cases over strongly connected networks based on the value of the basic reproduction number, a fundamental quantity in the study of epidemics.
Edit intent: clarity
Original:  When the network topology is weakly connected, we provide conditions for the existence, uniqueness, and global asymptotic stability of an endemic state, and we study the stability of the all-healthy state.
Revised:  When the network topology is weakly connected, we provide conditions for the existence, uniqueness, and global asymptotic stability of an endemic state, and we study the stability of the disease-free state.
Edit intent: clarity
Original:  additionally, we provide a sufficient condition for the global convergence to the all-healthy state, which can be checked in a distributed fashion.
Revised:  additionally, we provide a sufficient condition for the global convergence to the disease-free state, which can be checked in a distributed fashion.
Edit intent: clarity
Original:  However, quasi-potential landscapes that have been developed for continuous systems by multiple groups are not suitable for discrete networks , which are generally used to study large networks or ensembles thereof.
Revised:  However, quasi-potential landscapes , originally developed for continuous systems by multiple groups are not suitable for discrete networks , which are generally used to study large networks or ensembles thereof.
Edit intent: clarity
Original:  However, quasi-potential landscapes that have been developed for continuous systems by multiple groups are not suitable for discrete networks , which are generally used to study large networks or ensembles thereof.
Revised:  However, quasi-potential landscapes that have been developed for continuous systems , are not suitable for discrete networks , which are generally used to study large networks or ensembles thereof.
Edit intent: clarity
Original:  In the framework of Transcription Factor binding studies, motif finding algorithms of increasingly high performances are required to process the big datasets produced by new high-throughput sequencing technologies.
Revised:  In the framework of Transcription Factor binding studies, motif finding algorithms of increasingly high performance are required to process the big datasets produced by new high-throughput sequencing technologies.
Edit intent: fluency
Original:  Most existing algorithms are computationally prohibitive and often cannot support the large size of new experimental data.
Revised:  Most existing algorithms are computationally demanding and often cannot support the large size of new experimental data.
Edit intent: clarity
Original:  Based on spectral decompositions, this method is robust under model misspecification and  not prone to locally optimal solutions.
Revised:  Based on spectral decompositions, this method is robust under model misspecification and is not prone to locally optimal solutions.
Edit intent: fluency
Original:  In  few minutes, we can analyse datasets of more than hundred thousand sequences and produce motif profiles that match those computed by various state-of-the-art algorithms.
Revised:  In a few minutes, we can analyse datasets of more than hundred thousand sequences and produce motif profiles that match those computed by various state-of-the-art algorithms.
Edit intent: fluency
Original:  In  few minutes, we can analyse datasets of more than hundred thousand sequences and produce motif profiles that match those computed by various state-of-the-art algorithms.
Revised:  In few minutes, we can process datasets of hundreds of thousand sequences and produce motif profiles that match those computed by various state-of-the-art algorithms.
Edit intent: clarity
Original:  In  few minutes, we can analyse datasets of more than hundred thousand sequences and produce motif profiles that match those computed by various state-of-the-art algorithms.
Revised:  In few minutes, we can analyse datasets of more than hundred thousand sequences and extract motif profiles that match those computed by various state-of-the-art algorithms.
Edit intent: clarity
Original:  We aim for a filtration, a sequence of nested simplicial complexes, that captures the topological evolution of the offsets for increasing radii.
Revised:  We aim for a filtration, a sequence of nested cell complexes, that captures the topological evolution of the offsets for increasing radii.
Edit intent: fluency
Original:  The size of the filtration and the time complexity for computing it are proportional to the size of the Voronoi diagram and its time complexity, respectively), for any \epsilon > 0, in the 3-dimensional case} .
Revised:  The size of the filtration is proportional to the size of the Voronoi diagram and its time complexity, respectively), for any \epsilon > 0, in the 3-dimensional case} .
Edit intent: clarity
Original:  We show by experiments that our approach results in a similarly fast and topologically more stable method for computing a filtration compared to approximating the input by a point sample .
Revised:  We show by experiments that our approach results in a similarly fast and topologically more stable method for computing a filtration compared to approximating the input by point samples .
Edit intent: fluency
Original: We consider the relationship between nonlinearity and multiplicative complexity for Boolean functions with multiple outputs , studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity.
Revised: We consider the multiplicative complexity of Boolean functions with multiple outputs , studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity.
Edit intent: clarity
Original: We consider the relationship between nonlinearity and multiplicative complexity for Boolean functions with multiple outputs , studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity.
Revised: We consider the relationship between nonlinearity and multiplicative complexity for Boolean functions with multiple bits of output , studying how large a multiplicative complexity is necessary and sufficient to provide a desired nonlinearity.
Edit intent: clarity
Original:  Using known coding theory results, the lower bound proven here, for quadratic circuits for functions with n inputs and n outputs and high nonlinearity , shows that at least 2.32n AND gates are necessary .
Revised:  Combining this with known coding theory results, the lower bound proven here, for quadratic circuits for functions with n inputs and n outputs and high nonlinearity , shows that at least 2.32n AND gates are necessary .
Edit intent: coherence
Original:  Using known coding theory results, the lower bound proven here, for quadratic circuits for functions with n inputs and n outputs and high nonlinearity , shows that at least 2.32n AND gates are necessary .
Revised:  Using known coding theory results, we show that functions with n inputs and n outputs and high nonlinearity , shows that at least 2.32n AND gates are necessary .
Edit intent: clarity
Original:  Using known coding theory results, the lower bound proven here, for quadratic circuits for functions with n inputs and n outputs and high nonlinearity , shows that at least 2.32n AND gates are necessary .
Revised:  Using known coding theory results, the lower bound proven here, for quadratic circuits for functions with n inputs and n outputs with the highest possible nonlinearity must have at least 2.32n AND gates are necessary .
Edit intent: clarity
Original:  Using known coding theory results, the lower bound proven here, for quadratic circuits for functions with n inputs and n outputs and high nonlinearity , shows that at least 2.32n AND gates are necessary .
Revised:  Using known coding theory results, the lower bound proven here, for quadratic circuits for functions with n inputs and n outputs and high nonlinearity , shows that at least 2.32n AND gates .
Edit intent: clarity
Original:  For general circuits, we exhibit a concrete function with multiplicative complexity at least 2n-3  .
Revised:  Additionally we provide a function which, for general circuits, has multiplicative complexity at least 2n-3 .
Edit intent: clarity
Original:  Finally we study the multiplicative complexity of "almost all '' functions.
Revised:  Finally we study the multiplicative complexity of "almost all " functions.
Edit intent: fluency
Original: In October 2013 Italy enacted a law containing the first national regulations about the open-access availability of publicly-funded research results (publications).
Revised: In October 2013 Italy enacted a law containing the first national regulations about the open access availability of publicly-funded research results (publications).
Edit intent: fluency
Original:  This contribution examines how these new regulations match with the specific situation of that open-access pioneering discipline which is astrophysics  .
Revised:  The impact of these new regulations match with the specific situation of that open-access pioneering discipline which is astrophysics .
Edit intent: clarity
Original:  This contribution examines how these new regulations match with the specific situation of that open-access pioneering discipline which is astrophysics  .
Revised:  This contribution examines how these new regulations with the specific situation of that open-access pioneering discipline which is astrophysics .
Edit intent: fluency
Original:  This contribution examines how these new regulations match with the specific situation of that open-access pioneering discipline which is astrophysics  .
Revised:  This contribution examines how these new regulations match with the specific situation of that open access discipline which is astrophysics .
Edit intent: clarity
Original:  It is, however, not known how the synaptic efficacies in the neuronal networks of the brain adapt such that they can reliably generate spikes at specific points in time.
Revised:  However, it is not known how the synaptic efficacies in the neuronal networks of the brain adapt such that they can reliably generate spikes at specific points in time.
Edit intent: fluency
Original:  Known activity dependent synaptic plasticity rules are agnostic to the goal of learning spike times , while the existing formal and supervised methods are barely biologically plausible .
Revised:  Known activity dependent synaptic plasticity rules are agnostic to the goal of learning spike times . On the other hand, the existing formal and supervised methods are barely biologically plausible .
Edit intent: coherence
Original:  Furthermore, the stereotypic dynamics of the membrane potential close to action potentials causes a sensitivity of synaptic change to pre- and postsynaptic spike times which can reproduce anti-Hebbian forms of spike timing dependent plasticity .
Revised:  Furthermore, the stereotypic dynamics of the membrane potential close to action potentials causes a sensitivity of synaptic change to pre- and postsynaptic spike times which can reproduce Hebbian spike timing dependent plasticity .
Edit intent: clarity
Original:  For spatio-temporal input spike patterns our conceptually elementary plasticity rule achieves a surprisingly high storage capacity for spike associations , with robust memory retrieval  even in the presence of input activity corrupted by noise.
Revised:  For spatio-temporal input spike patterns our conceptually simple plasticity rule achieves a surprisingly high storage capacity for spike associations , with robust memory retrieval even in the presence of input activity corrupted by noise.
Edit intent: clarity
Original:  For spatio-temporal input spike patterns our conceptually elementary plasticity rule achieves a surprisingly high storage capacity for spike associations , with robust memory retrieval  even in the presence of input activity corrupted by noise.
Revised:  For spatio-temporal input spike patterns our conceptually elementary plasticity rule achieves a surprisingly high storage capacity for spike associations , with robust memory retrieval after learning even in the presence of input activity corrupted by noise.
Edit intent: clarity
Original:  For spatio-temporal input spike patterns our conceptually elementary plasticity rule achieves a surprisingly high storage capacity for spike associations , with robust memory retrieval  even in the presence of input activity corrupted by noise.
Revised:  For spatio-temporal input spike patterns our conceptually elementary plasticity rule achieves a surprisingly high storage capacity for spike associations , with robust memory retrieval even in the presence of activity corrupted by noise.
Edit intent: fluency
Original:  We show that the mixing of particles and the evolution of the process are influenced by the number of interconnecting links and by their functional properties, while surprisingly when the interconnecting links have the same function as the links within the networks, they are not affected by the interconnectivity strategies in use.
Revised:  We show that the mixing of particles and the process evolution are influenced by the number of interconnecting links and by their functional properties, while surprisingly when the interconnecting links have the same function as the links within the networks, they are not affected by the interconnectivity strategies in use.
Edit intent: clarity
Original:  We show that the mixing of particles and the evolution of the process are influenced by the number of interconnecting links and by their functional properties, while surprisingly when the interconnecting links have the same function as the links within the networks, they are not affected by the interconnectivity strategies in use.
Revised:  We show that the mixing of particles and the evolution of the process are influenced by the number of interconnecting links , by their functional properties, while surprisingly when the interconnecting links have the same function as the links within the networks, they are not affected by the interconnectivity strategies in use.
Edit intent: fluency
Original:  We show that the mixing of particles and the evolution of the process are influenced by the number of interconnecting links and by their functional properties, while surprisingly when the interconnecting links have the same function as the links within the networks, they are not affected by the interconnectivity strategies in use.
Revised:  We show that the mixing of particles and the evolution of the process are influenced by the number of interconnecting links and by their functional properties, and by the interconnectivity strategies in use.
Edit intent: coherence
Original:  Due to the better mixing, which suppresses the segregation effect, we show that the reaction rates  are faster than what was observed in other topologies, in-line with previous studies performed on single scale free networks.
Revised:  We show that the reaction rates are faster than what was observed in other topologies, in-line with previous studies performed on single scale free networks.
Edit intent: coherence
Original:  Due to the better mixing, which suppresses the segregation effect, we show that the reaction rates  are faster than what was observed in other topologies, in-line with previous studies performed on single scale free networks.
Revised:  Due to the better mixing, which suppresses the segregation effect, we show that the reaction rates on this system are faster than what was observed in other topologies, in-line with previous studies performed on single scale free networks.
Edit intent: clarity
Original: Limitation of resources has been recently introduced as a mechanism for the survival and coexistance of cooperators with defectors in well-mixed populations.
Revised: Limitation of resources has been recently introduced as a mechanism for the survival and coexistence of cooperators with defectors in well-mixed populations.
Edit intent: fluency
Original:  A prisoner's dilemma game on a scale-free network has shown coexistance of cooperators and defectors for the entire range of parameters.
Revised:  A prisoner's dilemma game on a scale-free network has shown coexistence of cooperators and defectors for the entire range of parameters.
Edit intent: fluency
Original:  Our results show thatby introducing the network to the limited resources model, the cooperator dominared region in the parameter space expands comparing to the results of well-mixed population and the coexistenceregion becomes narrower.
Revised:  Our results show that by introducing the network to the limited resources model, the cooperator dominared region in the parameter space expands comparing to the results of well-mixed population and the coexistenceregion becomes narrower.
Edit intent: fluency
Original:  Our results show thatby introducing the network to the limited resources model, the cooperator dominared region in the parameter space expands comparing to the results of well-mixed population and the coexistenceregion becomes narrower.
Revised:  Our results show thatby introducing the network to the limited resources model, the cooperator-dominated region in the parameter space expands comparing to the results of well-mixed population and the coexistenceregion becomes narrower.
Edit intent: fluency
Original:  Our results show thatby introducing the network to the limited resources model, the cooperator dominared region in the parameter space expands comparing to the results of well-mixed population and the coexistenceregion becomes narrower.
Revised:  Our results show thatby introducing the network to the limited resources model, the cooperator dominared region in the parameter space expands comparing to the results of well-mixed population and the coexistence region becomes narrower.
Edit intent: fluency
Original:  Specifically, we outline different ways in which students can be negatively exposed to their peers on MOOC forums and discuss two simple formulations of learning network diffusion, which formalize the essence of how such an influence spreads and can potentially lead to student attrition over time.
Revised:  Specifically, we outline different ways in which students can be negatively exposed to their peers on MOOC forums and discuss a simple formulation of learning network diffusion, which formalize the essence of how such an influence spreads and can potentially lead to student attrition over time.
Edit intent: clarity
Original:  Specifically, we outline different ways in which students can be negatively exposed to their peers on MOOC forums and discuss two simple formulations of learning network diffusion, which formalize the essence of how such an influence spreads and can potentially lead to student attrition over time.
Revised:  Specifically, we outline different ways in which students can be negatively exposed to their peers on MOOC forums and discuss two simple formulations of learning network diffusion, which formalizes the essence of how such an influence spreads and can potentially lead to student attrition over time.
Edit intent: fluency
Original:  To understand the prevalence and uses of these proxies, we build a TLS proxy measurement tool and deploy it via a Google AdWords campaign .
Revised:  To understand the prevalence and uses of these proxies, we build a TLS proxy measurement tool and deploy it via Google AdWords campaigns .
Edit intent: fluency
Original:  We generate 2.9 million certificate tests and  find that 1 in 250 TLS connections are proxied .
Revised:  We generate 2.9 million and find that 1 in 250 TLS connections are proxied .
Edit intent: clarity
Original:  We generate 2.9 million certificate tests and  find that 1 in 250 TLS connections are proxied .
Revised:  We generate 2.9 million certificate tests and find that 1 in 250 TLS connections are TLS-proxied .
Edit intent: clarity
Original:  We also find numerous instances of negligent and duplicitous behavior, some of which degrade security for users without their knowledge.
Revised:  We also find numerous instances of negligent , duplicitous, and suspicious behavior, some of which degrade security for users without their knowledge.
Edit intent: clarity
Original:  Distinguishing these types of practices is challenging in practice, indicating a need for transparency and user opt-in .
Revised:  Distinguishing these types of practices is challenging in practice, indicating a need for transparency and user awareness .
Edit intent: clarity
Original:  The steady state of the transporter is found and its stability is demonstrated .
Revised:  The steady state of the transporter is found and its stability is studied .
Edit intent: clarity
Original:  The glucose  translocation rates in two directions and in different steps of the transition are compared.
Revised:  The glucose translocation rates in two directions and in different steps are compared.
Edit intent: clarity
Original:  The non-Arrhenius temperature dependence of the transition rate and the temperature relation for the mean transport time are predicted.
Revised:  The non-Arrhenius temperature dependence of the transition rate and the mean transport time are predicted.
Edit intent: clarity
Original:  The non-Arrhenius temperature dependence of the transition rate and the temperature relation for the mean transport time are predicted.
Revised:  The non-Arrhenius temperature dependence of the transition rate and the temperature relation for the mean transport time is predicted.
Edit intent: fluency
Original: The class of finitely presented monoids defined by homogeneous (length-preserving) relations is considered .
Revised: This paper investigates the class of finitely presented monoids defined by homogeneous (length-preserving) relations is considered .
Edit intent: clarity
Original: The class of finitely presented monoids defined by homogeneous (length-preserving) relations is considered .
Revised: The class of finitely presented monoids defined by homogeneous (length-preserving) relations from a computational perspective .
Edit intent: clarity
Original:  The properties of admitting a finite complete rewriting system, having finite derivation type, being automatic, and being biautomatic , are investigated for monoids in this class .
Revised:  The properties of admitting a finite complete rewriting system, having finite derivation type, being automatic, and being biautomatic are investigated for monoids in this class .
Edit intent: fluency
Original:  The properties of admitting a finite complete rewriting system, having finite derivation type, being automatic, and being biautomatic , are investigated for monoids in this class .
Revised:  The properties of admitting a finite complete rewriting system, having finite derivation type, being automatic, and being biautomatic , are investigated for this class of monoids .
Edit intent: clarity