wanyu/IteraTeR_v2 huggingface dataset:
Original:  However, the exact impact of this resource expenditure on the physical spreading dynamics remains unknown.
Revised:  However, the impact of this resource expenditure on the physical spreading dynamics remains unknown.
Edit intent: clarity
Original:  Contrary to common sense, we find that such a catastrophic jump is more pronounced in the less contagious diseases, yet such diseases are usually among the most fatal ones.
Revised:  Contrary to common sense, we find that such a catastrophic jump is more pronounced in the less contagious diseases, which usually correspond to the most fatal ones.
Edit intent: clarity
Original:  Moreover, we observe a non-trivial resource amount requirement, that even with a single node as infection source, public resource needs to meet a significant amount to ensure epidemic containment.
Revised:  Furthermore, we find that even for a single infection source, public resource needs to meet a significant amount to ensure epidemic containment.
Edit intent: clarity
Original:  Our new findings have important implications on public health policies regarding the devoted public resource into epidemic disease control .
Revised:  Our findings provide a theoretical foundation for efficient epidemic containment strategies in the early stage .
Edit intent: clarity
Original: Community detection and link prediction are both of great significance in network analysis, which provide very valuable insights into topological structures of the network from diffrent perspectives.
Revised: Community detection and link prediction are both of great significance in network analysis, which provide very valuable insights into topological structures of the network from different perspectives.
Edit intent: fluency
Original:  In this paper, we propose a novel community detection algorithm with inclusion of link prediction, motivated by the question whether link prediction can be devoted to improve the accuracy of community partition.
Revised:  In this paper, we propose a novel community detection algorithm with inclusion of link prediction, motivated by the question whether link prediction can be devoted to improving the accuracy of community partition.
Edit intent: fluency
Original:  Extensive experiments are conducted on benchmark data sets, and the results of our proposed algorithm are compared with two classes of baselines .
Revised:  Extensive experiments are conducted on benchmark data sets, and the results of our proposed algorithm are compared with two classes of baseline .
Edit intent: fluency
Original:  The common goal is to select a subset of nodes of a specified size to infect so that the number of infected nodes at the conclusion of the epidemic is as large as possible.
Revised:  The common goal is to select an optimal set of nodes to seed the influence process, such that the number of infected nodes at the conclusion of the epidemic is as large as possible.
Edit intent: clarity
Original:  The common goal is to select a subset of nodes of a specified size to infect so that the number of infected nodes at the conclusion of the epidemic is as large as possible.
Revised:  The common goal is to select a subset of nodes of a specified size to infect so that the number of influenced nodes at the conclusion of the epidemic is as large as possible.
Edit intent: clarity
Original:  The common goal is to select a subset of nodes of a specified size to infect so that the number of infected nodes at the conclusion of the epidemic is as large as possible.
Revised:  The common goal is to select a subset of nodes of a specified size to infect so that the number of infected nodes at the conclusion of the campaign is as large as possible.
Edit intent: clarity
Original:  CF algorithms are trained using a dataset of user explicit or implicit preferences while CB algorithms are typically based on item profiles.
Revised:  CF algorithms are trained using a dataset of user preferences while CB algorithms are typically based on item profiles.
Edit intent: clarity
Original:  These approaches harness very different data sources hence the resulting recommended items are generally also very different.
Revised:  These approaches harness different data sources hence the resulting recommended items are generally also very different.
Edit intent: fluency
Original:  These approaches harness very different data sources hence the resulting recommended items are generally also very different.
Revised:  These approaches harness very different data sources and therefore the resulting recommended items are generally also very different.
Edit intent: coherence
Original:  These approaches harness very different data sources hence the resulting recommended items are generally also very different.
Revised:  These approaches harness very different data sources hence the resulting recommended items are generally very different.
Edit intent: clarity
Original:  Our analysis refers to the algorithm by Moser in 2009  , however it is based on a simple application of the probabilistic method, rather than a counting argument, as are most of the analyses of algorithms for variants of the Lov\'{a}sz Local Lemma.
Revised:  Our analysis refers to the algorithm by Moser ( 2009 , however it is based on a simple application of the probabilistic method, rather than a counting argument, as are most of the analyses of algorithms for variants of the Lov\'{a}sz Local Lemma.
Edit intent: fluency
Original:  Our analysis refers to the algorithm by Moser in 2009  , however it is based on a simple application of the probabilistic method, rather than a counting argument, as are most of the analyses of algorithms for variants of the Lov\'{a}sz Local Lemma.
Revised:  Our analysis refers to the algorithm by Moser in 2009 ) , however it is based on a simple application of the probabilistic method, rather than a counting argument, as are most of the analyses of algorithms for variants of the Lov\'{a}sz Local Lemma.
Edit intent: fluency
Original: We provide a simple algorithmic proof for the symmetric Lopsided Lov\'{asz Local Lemma, a variant of the classic Lov\'{a}sz Local Lemma, where, roughly, only the degree of the negatively correlated undesirable events counts.
Revised: sz Local Lemma, a variant of the classic Lov\'{a}sz Local Lemma, where, roughly, only the degree of the negatively correlated undesirable events counts.
Edit intent: coherence
Original:  Since it has been proven that IQP circuits are unlikely to be simulated classically up to a multiplicative error and an error in l1 norm, IQP is considered as one of the promising classes that demonstrates quantum supremacy.
Revised:  Since it has been proven that IQP circuits are unlikely to be simulated classically up to a multiplicative error and an error in the l_1 norm, IQP is considered as one of the promising classes that demonstrates quantum supremacy.
Edit intent: clarity
Original:  We show that even though ADIQP circuits are strictly weaker than IQP circuits in a sense, they are also hard to simulate classically up to a multiplicative error and an error in l1 norm.
Revised:  We show that even though ADIQP circuits are strictly weaker than IQP circuits in a sense, they are also hard to simulate classically up to a multiplicative error and an error in the l_1 norm.
Edit intent: clarity
Original:  Using prequential evaluation, we show that bagging is able to improve accuracy more than 35\% over the baseline  with small computational overhead.
Revised:  Using prequential evaluation, we show that bagging is able to improve accuracy up to 35\% over the baseline with small computational overhead.
Edit intent: clarity
Original:  Using prequential evaluation, we show that bagging is able to improve accuracy more than 35\% over the baseline  with small computational overhead.
Revised:  Using prequential evaluation, we show that bagging is able to improve accuracy more than 35\% over the baseline , with small computational overhead.
Edit intent: fluency
Original: Scalable and automatic formal verification for concurrent systems is always demanding , but yet to be developed .
Revised: Scalable and automatic formal verification for concurrent systems is always demanding .
Edit intent: coherence
Original:  Formal verification of finite state succinct automata can be automated .
Revised:  We generate succinct automata from infinite state concurrent programs in an automated manner .
Edit intent: clarity
Original:  We have prototyped our algorithm and applied our tool to the verification of multiple refinements.
Revised:  We have prototyped our algorithms and applied our tool to the verification of multiple refinements.
Edit intent: fluency
Original: Several studies pointed out the relevance of extrinsic noise in molecular networks in shaping cell decision making and differentiation .
Revised: Several studies highlighted the relevance of extrinsic noise in molecular networks in shaping cell decision making and differentiation .
Edit intent: clarity
Original: Several studies pointed out the relevance of extrinsic noise in molecular networks in shaping cell decision making and differentiation .
Revised: Several studies pointed out the relevance of extrinsic noise in shaping cell decision making and differentiation .
Edit intent: clarity
Original:  In this work we address the role of extrinsic noise in shaping bimodal gene distributions in the context of microRNA (miRNA)-mediated regulation , both with stochastic modelling and simulations .
Revised:  We theoretically address the presence of bimodal phenotypes in the context of microRNA (miRNA)-mediated regulation , both with stochastic modelling and simulations .
Edit intent: clarity
Original:  In this work we address the role of extrinsic noise in shaping bimodal gene distributions in the context of microRNA (miRNA)-mediated regulation , both with stochastic modelling and simulations .
Revised:  In this work we address the role of extrinsic noise in shaping bimodal gene distributions in the context of microRNA (miRNA)-mediated regulation .
Edit intent: coherence
Original:  bimodal target distributions can be obtained exploiting a noisy environment even in case of small miRNA-target interaction strength , (ii)
Revised:  bimodal target distributions which can be observed for a wider range of parameters compared to the case with intrinsic noise only and for lower miRNA-target interaction strength , (ii)
Edit intent: clarity
Original:  These so called system Gramian matrices were developed in linear system theory for applications such as model order reduction of control systems.
Revised:  These so-called system Gramians were developed in linear system theory for applications such as model order reduction of control systems.
Edit intent: clarity
Original:  Empirical Gramian matrices are an extension to the system Gramians for parametric and nonlinear systems as well as a data-driven method of computation.
Revised:  Empirical Gramian are an extension to the system Gramians for parametric and nonlinear systems as well as a data-driven method of computation.
Edit intent: clarity
Original: Socio-economic inequality is quantitatively measured from data using various indices.
Revised: Socio-economic inequality is measured using various indices.
Edit intent: clarity
Original:  The latter requires careful memory management , as a naive implementation of the Neural GPU is memory intensive.
Revised:  The latter requires a memory efficient implementation , as a naive implementation of the Neural GPU is memory intensive.
Edit intent: clarity
Original:  We find that these techniques to increase the set of algorithmic problems that can be solved by the Neural GPU: we have been able to learn to perform all the arithmetic operations (and generalize to arbitrarily long numbers) when the arguments are given in the decimal representation (which, surprisingly, has not been possible before).
Revised:  We find that these techniques increase the set of algorithmic problems that can be solved by the Neural GPU: we have been able to learn to perform all the arithmetic operations (and generalize to arbitrarily long numbers) when the arguments are given in the decimal representation (which, surprisingly, has not been possible before).
Edit intent: fluency
Original:  We have also been able to train the Neural GPU to evaluate long arithmetic expressions with multiple operands that require respecting the precedence order of the operands, although these have succeeded only in their binary representation, and not with 100%DIFDELCMD < \\%%% %DIF < accuracy.
Revised:  We have also been able to train the Neural GPU to evaluate long arithmetic expressions with multiple operands that require respecting the precedence order of the operands, although these have succeeded only in their binary representation, and not with %DIFDELCMD < \\%%% %DIF < accuracy.
Edit intent: clarity
Original:   In addition, we attempt to gain insight into the Neural GPU by understanding its failure modes.
Revised:  In addition, we gain insight into the Neural GPU by understanding its failure modes.
Edit intent: clarity
Original:   In addition, we attempt to gain insight into the Neural GPU by understanding its failure modes.
Revised:  In addition, we attempt to gain insight into the Neural GPU by investigating its failure modes.
Edit intent: clarity
Original:  For each execution, the chosen input to Est remains hidden from the steward , but the steward chooses the randomness of Est and, crucially, is allowed to modify the output of Est.
Revised:  For each execution, the steward chooses the randomness of Est and, crucially, is allowed to modify the output of Est.
Edit intent: coherence
Original:  The notion of a steward is inspired by adaptive data analysis, introduced by Dwork et al.
Edit intent: coherence
Original:  ( The generator is a variant of the INW generator .)As applications of our steward, we give time- and randomness-efficient algorithms for estimating the acceptance probabilities of many adaptively chosen Boolean circuits and for simulating any algorithm with an oracle for promise\mbox{-BPP a randomness-efficient version of the Goldreich-Levin algorithm;
Revised:  The generator is a variant of the INW generator .)As applications of our steward, we give time- and randomness-efficient algorithms for estimating the acceptance probabilities of many adaptively chosen Boolean circuits and for simulating any algorithm with an oracle for promise\mbox{-BPP a randomness-efficient version of the Goldreich-Levin algorithm;
Edit intent: fluency
Original:  ( The generator is a variant of the INW generator .)As applications of our steward, we give time- and randomness-efficient algorithms for estimating the acceptance probabilities of many adaptively chosen Boolean circuits and for simulating any algorithm with an oracle for promise\mbox{-BPP a randomness-efficient version of the Goldreich-Levin algorithm;
Revised:  ( The generator is a variant of the INW generator .)As applications of our steward, we give a randomness-efficient version of the Goldreich-Levin algorithm;
Edit intent: coherence
Original: We introduce the concept of a randomness steward, a tool for saving random bits when executing a randomized estimation algorithm \mathsf{Est outputs values in R^d , has \infty error \epsilon, has failure probability \delta, uses n coins, and will be executed k times.
Revised: Suppose \mathsf{Est randomized estimation algorithm \mathsf{Est outputs values in R^d , has \infty error \epsilon, has failure probability \delta, uses n coins, and will be executed k times.
Edit intent: clarity
Original:  As an application of our steward , we give a randomness-efficient version of the Goldreich-Levin algorithm;
Revised:  As an application , we give a randomness-efficient version of the Goldreich-Levin algorithm;
Edit intent: clarity
Original:  Many of these groups might be composed of inexperienced deep learning practitioners who are baffled by the dizzying array of architecture choices and therefore  use an older architecture , such as Alexnet.
Revised:  Many of these groups are likely to be composed of inexperienced deep learning practitioners who are baffled by the dizzying array of architecture choices and therefore use an older architecture , such as Alexnet.
Edit intent: clarity
Original:  Many of these groups might be composed of inexperienced deep learning practitioners who are baffled by the dizzying array of architecture choices and therefore  use an older architecture , such as Alexnet.
Revised:  Many of these groups might be composed of inexperienced deep learning practitioners who are baffled by the dizzying array of architecture choices and therefore opt to use an older architecture , such as Alexnet.
Edit intent: clarity
Original:  We hope others are inspired to build on this preliminary work.
Revised:  We hope others are inspired to build on our preliminary work.
Edit intent: fluency
Original:  We show that intractability of the constraint satisfaction problem \mathsf{CSP (R) for \mathscr{R can, in all known cases, be replaced by an infinite hierarchy of intractable promise problems of increasingly disparate promise conditions: where instances are guaranteed to be either have no solutions , or are k-robustly satisfiable (for any fixed k), meaning that every "reasonable" partial instantiation on  k variables extends to a solution.
Revised:  We show that intractability of the constraint satisfaction problem (R) for \mathscr{R can, in all known cases, be replaced by an infinite hierarchy of intractable promise problems of increasingly disparate promise conditions: where instances are guaranteed to be either have no solutions , or are k-robustly satisfiable (for any fixed k), meaning that every "reasonable" partial instantiation on k variables extends to a solution.
Edit intent: clarity
Original:  We show that intractability of the constraint satisfaction problem \mathsf{CSP (R) for \mathscr{R can, in all known cases, be replaced by an infinite hierarchy of intractable promise problems of increasingly disparate promise conditions: where instances are guaranteed to be either have no solutions , or are k-robustly satisfiable (for any fixed k), meaning that every "reasonable" partial instantiation on  k variables extends to a solution.
Revised:  We show that intractability of the constraint satisfaction problem \mathsf{CSP (R) can, in all known cases, be replaced by an infinite hierarchy of intractable promise problems of increasingly disparate promise conditions: where instances are guaranteed to be either have no solutions , or are k-robustly satisfiable (for any fixed k), meaning that every "reasonable" partial instantiation on k variables extends to a solution.
Edit intent: clarity
Original:  We show that intractability of the constraint satisfaction problem \mathsf{CSP (R) for \mathscr{R can, in all known cases, be replaced by an infinite hierarchy of intractable promise problems of increasingly disparate promise conditions: where instances are guaranteed to be either have no solutions , or are k-robustly satisfiable (for any fixed k), meaning that every "reasonable" partial instantiation on  k variables extends to a solution.
Revised:  We show that intractability of the constraint satisfaction problem \mathsf{CSP (R) for \mathscr{R can, in all known cases, be replaced by an infinite hierarchy of intractable promise problems of increasingly disparate promise conditions: where instances are guaranteed to either have no solutions , or are k-robustly satisfiable (for any fixed k), meaning that every "reasonable" partial instantiation on k variables extends to a solution.
Edit intent: fluency
Original:  We show that intractability of the constraint satisfaction problem \mathsf{CSP (R) for \mathscr{R can, in all known cases, be replaced by an infinite hierarchy of intractable promise problems of increasingly disparate promise conditions: where instances are guaranteed to be either have no solutions , or are k-robustly satisfiable (for any fixed k), meaning that every "reasonable" partial instantiation on  k variables extends to a solution.
Revised:  We show that intractability of the constraint satisfaction problem \mathsf{CSP (R) for \mathscr{R can, in all known cases, be replaced by an infinite hierarchy of intractable promise problems of increasingly disparate promise conditions: where instances are guaranteed to be either have no solutions at all, or to be k-robustly satisfiable (for any fixed k), meaning that every "reasonable" partial instantiation on k variables extends to a solution.
Edit intent: clarity
Original:  For example, subject to the assumption P\neq NP, then for any  k, we show that there is no polynomial time algorithm that can distinguish non-3-colorable graphs, from those for which any reasonable 3-coloring of any k of the vertices can extend to a full 3-coloring.
Revised:  For example, subject to the assumption P\neq NP, then for any k, we show that there is no polynomial time algorithm that can distinguish non-3-colourable graphs, from those for which any reasonable 3-coloring of any k of the vertices can extend to a full 3-coloring.
Edit intent: fluency
Original:  For example, subject to the assumption P\neq NP, then for any  k, we show that there is no polynomial time algorithm that can distinguish non-3-colorable graphs, from those for which any reasonable 3-coloring of any k of the vertices can extend to a full 3-coloring.
Revised:  For example, subject to the assumption P\neq NP, then for any k, we show that there is no polynomial time algorithm that can distinguish non-3-colorable graphs, from those for which any reasonable 3-colouring of any k of the vertices can extend to a full 3-coloring.
Edit intent: fluency
Original:  First, it is commonplace to perform data mining tasks such as clustering and classification of network attributes (attributes of the nodes, including social media posts) , on sampled graphs since real-world networks can be very large.
Revised:  First, it is commonplace to perform data mining tasks such as clustering and classification of network attributes (attributes of the nodes, including social media posts) . Furthermore, the extraordinarily large size of real-world networks can be very large.
Edit intent: clarity
Original: Although neurons in columns of tissue in visual cortex of adult carnivores and primates share similar preferences for the orientation of a visual stimulus, they can nevertheless have sparse and temporally uncorrelated firing visual response properties.
Revised: Although neurons in columns of visual cortex of adult carnivores and primates share similar preferences for the orientation of a visual stimulus, they can nevertheless have sparse and temporally uncorrelated firing visual response properties.
Edit intent: clarity
Original: Although neurons in columns of tissue in visual cortex of adult carnivores and primates share similar preferences for the orientation of a visual stimulus, they can nevertheless have sparse and temporally uncorrelated firing visual response properties.
Revised: Although neurons in columns of tissue in visual cortex of adult carnivores and primates share similar orientation tuning preferences, responses of nearby neurons are surprisingly sparse and temporally uncorrelated firing visual response properties.
Edit intent: clarity
Original:  In addition, we show how presentation of simulated full-field complex visual stimuli, designed to approximate visual scenes, leads to reduced correlation of local excitatory responses and increased excitatory response selectivity (lifetime sparseness).
Revised:  In addition, we show how presentation of simulated full-field complex visual stimuli, including reduced correlation of local excitatory responses and increased excitatory response selectivity (lifetime sparseness).
Edit intent: clarity