wanyu/IteraTeR_v2 huggingface dataset:
Original:  We fully analyse the Staying norm in terms of evolutionary game theory and unveil that Staying is most effective in establishing cooperation , compared to the prevailing social norms  which rely on constant monitoring and unconditional assessment.
Revised:  We fully analyse the Staying norm in terms of evolutionary game theory and unveil that Staying is most effective in establishing cooperation , compared to the prevailing social norms , which rely on constant monitoring and unconditional assessment.
Edit intent: fluency
Original:  The excellence of Staying suggests the limitation of strict application of moral judgment  .
Revised:  The application of Staying suggests the limitation of strict application of moral judgment .
Edit intent: clarity
Original:  The excellence of Staying suggests the limitation of strict application of moral judgment  .
Revised:  The excellence of Staying suggests that the strict application of moral judgment .
Edit intent: clarity
Original:  The excellence of Staying suggests the limitation of strict application of moral judgment  .
Revised:  The excellence of Staying suggests the limitation of strict application of moral judgment is limited .
Edit intent: clarity
Original:  However, the underlying mechanisms that endow the system with these response properties remain elusive.
Revised:  However, the underlying mechanism that endows the system with these response properties remain elusive.
Edit intent: fluency
Original:  However, the underlying mechanisms that endow the system with these response properties remain elusive.
Revised:  However, the underlying mechanisms that endow the system with these response properties remains elusive.
Edit intent: fluency
Original:  Analyses of the LEGI-based model identify two different types of scale invariance , each of which is responsible for the two response properties.
Revised:  Analyses of the LEGI-based model reveal that the invariance can be divided into two parts , each of which is responsible for the two response properties.
Edit intent: clarity
Original:  Analyses of the LEGI-based model identify two different types of scale invariance , each of which is responsible for the two response properties.
Revised:  Analyses of the LEGI-based model identify two different types of scale invariance , each of which is responsible for the respective response properties.
Edit intent: clarity
Original:  Our hypothesis leads to an experimentally testable prediction that a system with both types of invariance detects the relative steepness even in spatio-temporal gradient stimuli such as waves .
Revised:  Our hypothesis leads to an experimentally testable prediction that a system with the invariance detects relative steepness even in spatio-temporal gradient stimuli such as waves .
Edit intent: clarity
Original:  Furthermore, we show that such behavior is independent of specific network topologies as long as the scale invariance holds, demonstrating the generic relationship between the scale invariance and the response properties .
Revised:  Furthermore, we show that the relation between the response properties and the scale invariance is general in that it can be implemented by models with different network topologies .
Edit intent: clarity
Original: As gene expression measurement technology is shifting from microarrays to sequencing, the statistical tools available for analyzing corresponding data require substantial modifications since RNA-seq data are measured as counts.
Revised: As gene expression measurement technology is shifting from microarrays to sequencing, the statistical tools available for their analysis must be adapted since RNA-seq data are measured as counts.
Edit intent: clarity
Original:  Applied to both simulated data and two real datasets, the proposed method is shown to exhibit very good statistical properties, with an increase in stability and power when compared to state of the art methods ROAST, edgeR and DESeq2, which can fail to control the type I error under certain reallistic settings.
Revised:  Applied to both simulated data and two real datasets, the proposed method is shown to exhibit very good statistical properties, with an increase in stability and power when compared to state of the art methods ROAST, edgeR and DESeq2, which can fail to control the type I error under certain realistic settings.
Edit intent: fluency
Original:  Recently, it has been proposed to tackle the count nature of these data by modeling log-count reads per million as continuous variables , using nonparametric regression to account for their inherent heteroscedasticity.
Revised:  It has been proposed to tackle the count nature of these data by modeling log-count reads per million as continuous variables , using nonparametric regression to account for their inherent heteroscedasticity.
Edit intent: coherence
Original:  Recently, it has been proposed to tackle the count nature of these data by modeling log-count reads per million as continuous variables , using nonparametric regression to account for their inherent heteroscedasticity.
Revised:  Recently, it has been proposed to model RNA-seq counts as continuous variables , using nonparametric regression to account for their inherent heteroscedasticity.
Edit intent: clarity
Original:  Recently, it has been proposed to tackle the count nature of these data by modeling log-count reads per million as continuous variables , using nonparametric regression to account for their inherent heteroscedasticity.
Revised:  Recently, it has been proposed to tackle the count nature of these data by modeling log-count reads per million as continuous variables using nonparametric regression to account for their inherent heteroscedasticity.
Edit intent: fluency
Original:  Adopting such a framework , we propose tcgsaseq, a principled, model-free and efficient top-down method for detecting longitudinal changes in RNA-seq gene sets . Considering gene sets defined a priori, tcgsaseq identifies those whose expression vary{\em   over time, based on an original variance component score test accounting for both covariates and heteroscedasticity without assuming any specific parametric distribution for the transformed counts.
Revised:  In this vein , we propose tcgsaseq, a principled, model-free and efficient top-down method for detecting longitudinal changes in RNA-seq gene sets . Considering gene sets defined a priori, tcgsaseq identifies those whose expression vary{\em over time, based on an original variance component score test accounting for both covariates and heteroscedasticity without assuming any specific parametric distribution for the transformed counts.
Edit intent: clarity
Original:  Adopting such a framework , we propose tcgsaseq, a principled, model-free and efficient top-down method for detecting longitudinal changes in RNA-seq gene sets . Considering gene sets defined a priori, tcgsaseq identifies those whose expression vary{\em   over time, based on an original variance component score test accounting for both covariates and heteroscedasticity without assuming any specific parametric distribution for the transformed counts.
Revised:  Adopting such a framework , we propose tcgsaseq, a principled, model-free , and efficient method for detecting longitudinal changes in RNA-seq gene sets . Considering gene sets defined a priori, tcgsaseq identifies those whose expression vary{\em over time, based on an original variance component score test accounting for both covariates and heteroscedasticity without assuming any specific parametric distribution for the transformed counts.
Edit intent: clarity
Original:  Adopting such a framework , we propose tcgsaseq, a principled, model-free and efficient top-down method for detecting longitudinal changes in RNA-seq gene sets . Considering gene sets defined a priori, tcgsaseq identifies those whose expression vary{\em   over time, based on an original variance component score test accounting for both covariates and heteroscedasticity without assuming any specific parametric distribution for the transformed counts.
Revised:  Adopting such a framework , we propose tcgsaseq, a principled, model-free and efficient top-down method for detecting longitudinal changes in RNA-seq gene sets defined{\em over time, based on an original variance component score test accounting for both covariates and heteroscedasticity without assuming any specific parametric distribution for the transformed counts.
Edit intent: clarity
Original:  Adopting such a framework , we propose tcgsaseq, a principled, model-free and efficient top-down method for detecting longitudinal changes in RNA-seq gene sets . Considering gene sets defined a priori, tcgsaseq identifies those whose expression vary{\em   over time, based on an original variance component score test accounting for both covariates and heteroscedasticity without assuming any specific parametric distribution for the transformed counts.
Revised:  Adopting such a framework , we propose tcgsaseq, a principled, model-free and efficient top-down method for detecting longitudinal changes in RNA-seq gene sets . Considering gene sets defined a priori, tcgsaseq identifies those whose expression vary{\em . The method identifies those gene sets whose expression varies over time, based on an original variance component score test accounting for both covariates and heteroscedasticity without assuming any specific parametric distribution for the transformed counts.
Edit intent: clarity
Original:  Adopting such a framework , we propose tcgsaseq, a principled, model-free and efficient top-down method for detecting longitudinal changes in RNA-seq gene sets . Considering gene sets defined a priori, tcgsaseq identifies those whose expression vary{\em   over time, based on an original variance component score test accounting for both covariates and heteroscedasticity without assuming any specific parametric distribution for the transformed counts.
Revised:  Adopting such a framework , we propose tcgsaseq, a principled, model-free and efficient top-down method for detecting longitudinal changes in RNA-seq gene sets . Considering gene sets defined a priori, tcgsaseq identifies those whose expression vary{\em over time, based on an original variance component score test accounting for both covariates and heteroscedasticity without assuming any specific parametric distribution for the (transformed) counts.
Edit intent: fluency
Original:  Applied to both simulated data and two real datasets, the proposed method is shown to exhibit very good statistical properties, with an increase in stability and power when compared to state of the art methods ROAST, edgeR  and DESeq2, which can fail to control the type I error under certain realistic settings.
Revised:  Applied to both simulated data and two real datasets, the proposed method is shown to exhibit very good statistical properties, with an increase in stability and power when compared to state-of-the-art methods ROAST, edgeR and DESeq2, which can fail to control the type I error under certain realistic settings.
Edit intent: fluency
Original:  Applied to both simulated data and two real datasets, the proposed method is shown to exhibit very good statistical properties, with an increase in stability and power when compared to state of the art methods ROAST, edgeR  and DESeq2, which can fail to control the type I error under certain realistic settings.
Revised:  Applied to both simulated data and two real datasets, the proposed method is shown to exhibit very good statistical properties, with an increase in stability and power when compared to state of the art methods ROAST, edgeR , and DESeq2, which can fail to control the type I error under certain realistic settings.
Edit intent: fluency
Original:  It has been proposed to model RNA-seq counts as continuous variables  using nonparametric regression to account for their inherent heteroscedasticity.
Revised:  Recently, it has been proposed to model RNA-seq counts as continuous variables using nonparametric regression to account for their inherent heteroscedasticity.
Edit intent: coherence
Original:  It has been proposed to model RNA-seq counts as continuous variables  using nonparametric regression to account for their inherent heteroscedasticity.
Revised:  It has been proposed to model RNA-seq counts as continuous variables , using nonparametric regression to account for their inherent heteroscedasticity.
Edit intent: fluency
Original:  In this vein , we propose tcgsaseq, a principled, model-free , and efficient method for detecting longitudinal changes in RNA-seq gene sets defined%DIFDELCMD < {\em %%% a priori .
Revised:  Adopting such a framework , we propose tcgsaseq, a principled, model-free , and efficient method for detecting longitudinal changes in RNA-seq gene sets defined%DIFDELCMD < {\em %%% a priori .
Edit intent: clarity
Original:  In this vein , we propose tcgsaseq, a principled, model-free , and efficient method for detecting longitudinal changes in RNA-seq gene sets defined%DIFDELCMD < {\em %%% a priori .
Revised:  In this vein , we propose tcgsaseq, a principled, model-free , and efficient method for detecting longitudinal changes in RNA-seq gene sets %DIFDELCMD < {\em %%% a priori .
Edit intent: fluency
Original:  In this vein , we propose tcgsaseq, a principled, model-free , and efficient method for detecting longitudinal changes in RNA-seq gene sets defined%DIFDELCMD < {\em %%% a priori .
Revised:  In this vein , we propose tcgsaseq, a principled, model-free , and efficient method for detecting longitudinal changes in RNA-seq gene sets defined%DIFDELCMD < {\em %%% .
Edit intent: clarity
Original:  The method identifies those gene sets whose expression varies over time, based on an original variance component score test accounting for both covariates and heteroscedasticity without assuming any specific parametric distribution for the (transformed ) counts.
Revised:  The method identifies those gene sets whose expression varies over time, based on an original variance component score test accounting for both covariates and heteroscedasticity without assuming any specific parametric distribution for the transformed counts.
Edit intent: fluency
Original:  Applied to both simulated data and two real datasets, tcgsaseq is shown to exhibit very good statistical properties, with an increase in stability and power when compared to state-of-the-art methods ROAST, edgeR , and DESeq2, which can fail to control the type I error under certain realistic settings.
Revised:  Applied to both simulated data and two real datasets, the proposed method is shown to exhibit very good statistical properties, with an increase in stability and power when compared to state-of-the-art methods ROAST, edgeR , and DESeq2, which can fail to control the type I error under certain realistic settings.
Edit intent: clarity
Original:  Applied to both simulated data and two real datasets, tcgsaseq is shown to exhibit very good statistical properties, with an increase in stability and power when compared to state-of-the-art methods ROAST, edgeR , and DESeq2, which can fail to control the type I error under certain realistic settings.
Revised:  Applied to both simulated data and two real datasets, tcgsaseq is shown to exhibit very good statistical properties, with an increase in stability and power when compared to state of the art methods ROAST, edgeR , and DESeq2, which can fail to control the type I error under certain realistic settings.
Edit intent: fluency
Original:  Applied to both simulated data and two real datasets, tcgsaseq is shown to exhibit very good statistical properties, with an increase in stability and power when compared to state-of-the-art methods ROAST, edgeR , and DESeq2, which can fail to control the type I error under certain realistic settings.
Revised:  Applied to both simulated data and two real datasets, tcgsaseq is shown to exhibit very good statistical properties, with an increase in stability and power when compared to state-of-the-art methods ROAST, edgeR and DESeq2, which can fail to control the type I error under certain realistic settings.
Edit intent: fluency
Original: Motivated by communication scenarios such as timing channels (in queuing systems, molecular communications, etc.) and bit-shift channels (in magnetic recording systems), we study the error control problem in cases where the dominant type of noise are symbol shifts .
Revised: The objects of study of this paper are communication channels in which the dominant type of noise are symbol shifts .
Edit intent: clarity
Original:  Model A can be informally described as follows: 1) The information is stored in an n -cell register, where each cell can either be left empty , or can contain a particle of one of P possible types, and 2) due to the imperfections of the device every particle is shifted k cells away from its original position over time , where k is drawn from a certain range of integers, without the possibility of reordering particles .
Revised:  Model A can be informally described as follows: 1) The information is stored in an n -cell register, where each cell is either empty or contains a particle of one of P possible types, and 2) due to the imperfections of the device every particle is shifted k cells away from its original position over time , where k is drawn from a certain range of integers, without the possibility of reordering particles .
Edit intent: clarity
Original:  Model A can be informally described as follows: 1) The information is stored in an n -cell register, where each cell can either be left empty , or can contain a particle of one of P possible types, and 2) due to the imperfections of the device every particle is shifted k cells away from its original position over time , where k is drawn from a certain range of integers, without the possibility of reordering particles .
Revised:  Model A can be informally described as follows: 1) The information is stored in an n -cell register, where each cell can either be left empty , or can contain a particle of one of P possible types, and 2) due to the imperfections of the device each of the particles may be shifted several cells away from its original position over time , where k is drawn from a certain range of integers, without the possibility of reordering particles .
Edit intent: clarity
Original:  Model A can be informally described as follows: 1) The information is stored in an n -cell register, where each cell can either be left empty , or can contain a particle of one of P possible types, and 2) due to the imperfections of the device every particle is shifted k cells away from its original position over time , where k is drawn from a certain range of integers, without the possibility of reordering particles .
Revised:  Model A can be informally described as follows: 1) The information is stored in an n -cell register, where each cell can either be left empty , or can contain a particle of one of P possible types, and 2) due to the imperfections of the device every particle is shifted k cells away from its original position over time .
Edit intent: coherence
Original:  Model B is an abstraction of a single-server queue: 1) The transmitter sends symbols/ packets from a P -ary alphabet through a queuing system with an infinite buffer  , and 2) each packet is being processed by the server for a  number of time slots k \in \{0, 1, \ldots, K \ additional types of noise , and the continuous-time case.
Revised:  Model B is an abstraction of a single-server queue: 1) The transmitter sends packets from a P -ary alphabet through a queuing system with an infinite buffer , and 2) each packet is being processed by the server for a number of time slots k \in \{0, 1, \ldots, K \ additional types of noise , and the continuous-time case.
Edit intent: clarity
Original:  We investigate when the pricing--hedging duality for a regular agent, who only observes the stock prices , extends to agents with some additional information  .
Revised:  We consider two agents, one who only observes the stock prices , extends to agents with some additional information .
Edit intent: clarity
Original:  We investigate when the pricing--hedging duality for a regular agent, who only observes the stock prices , extends to agents with some additional information  .
Revised:  We investigate when the pricing--hedging duality for a regular agent, who only observes the stock prices and another with some additional information .
Edit intent: clarity
Original:  We use results of Hou \& Ob\l\'oj \mbox{ ho_beliefs on robust approach with beliefs to establish the pricing--hedging duality for an informed agent.
Revised:  We use results of Hou Ob\l\'oj \mbox{ ho_beliefs on robust approach with beliefs to establish the pricing--hedging duality for an informed agent.
Edit intent: fluency
Original:  We use results of Hou \& Ob\l\'oj \mbox{ ho_beliefs on robust approach with beliefs to establish the pricing--hedging duality for an informed agent.
Revised:  We use results of Hou \& Ob\l\'oj on robust approach with beliefs to establish the pricing--hedging duality for an informed agent.
Edit intent: clarity
Original:  In this paper we investigate the problem of finding a coloring with the minimum number of colors where every pair of vertices receive distinct labels . Finding such a coloring generalizes several other well-known problems of vertex-distinguishing colorings in graphs.
Revised:  In this paper we investigate the problem of finding a coloring with the minimum number of colors where every vertex receives a distinct label . Finding such a coloring generalizes several other well-known problems of vertex-distinguishing colorings in graphs.
Edit intent: clarity
Original: We show that for any graph (without connected component reduced to an edge or a single vertex), the minimum number of colors for which such a coloring exists can only take 3 possible values depending on the order of the graph.
Revised: We show that for any graph (without connected component reduced to an edge or a single vertex), the minimum number of colors for which such a coloring exists can only take 3possible values depending on the order of the graph.
Edit intent: fluency
Original: We show tight lower bounds for the approximate near neighbor search problem for the entire trade-off between space and query time , in a restricted model of computation .
Revised: We show tight lower bounds for the entire trade-off between space and query time , in a restricted model of computation .
Edit intent: coherence
Original: We show tight lower bounds for the approximate near neighbor search problem for the entire trade-off between space and query time , in a restricted model of computation .
Revised: We show tight lower bounds for the approximate near neighbor search problem for the entire trade-off between space and query time for the Approximate Near Neighbor search problem. Our lower bounds hold in a restricted model of computation .
Edit intent: clarity
Original:  In particular , our lower bound matches the upper bound recently shown in [Laarhoven 2015] for the random instance on a Euclidean sphere (which we show in fact extends to the entire space R^d using the techniques from [Andoni, Razenshteyn 2015]).
Revised:  In articular , our lower bound matches the upper bound recently shown in [Laarhoven 2015] for the random instance on a Euclidean sphere (which we show in fact extends to the entire space R^d using the techniques from [Andoni, Razenshteyn 2015]).
Edit intent: fluency
Original:  In particular, this is the first  lower bound (for any static data structure) for two probes which is not polynomially smaller than for one probe , as usual cell-probe techniques yield .
Revised:  In particular, this is the first lower bound (for any static data structure) for two probes which is not polynomially smaller than for one probe .
Edit intent: coherence
Original:  To show the lower bound for two probes, we establish and exploit a connection to locally-decodable codes.
Revised:  To show the result for two probes, we establish and exploit a connection to locally-decodable codes.
Edit intent: clarity