wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this paper, we give bounds on \psi\gp (G) when G is an arbitrary circle graph -- upper bounds in terms of the independence number , the clique cover number, and the number of vertices of G, and a lower bound in terms of the asteroidal number of G -- and show that \psi(G) is equal to the asteroidal number of G when G is a connected nonclique distance hereditary graph .
Revised:  In this paper, we give bounds on \psi\gp (G) when G is an arbitrary circle graph -- upper bounds in terms of the independence number , the clique cover number, and the number of vertices of G, and a lower bound in terms of the asteroidal number of G -- and show that \psi(G) is equal to the asteroidal number of G when G is a connected distance hereditary graph .
Edit intent: clarity
Original:  We then use our results to develop characterizations of distance hereditary permutation graphs . Finally, we describe\gp\lceil \rceil \ge  linear time algorithms for finding the polygon number of a circle representation and for finding the asteroidal number of a distance hereditary graph, improvements over previously known algorithms for those problems.
Revised:  We then use our results to develop characterizations of distance hereditary permutation graphs . Finally, we describe\gp\lceil \rceil \ge linear time algorithms for finding the polygon number of a circle representation and for finding the asteroidal number of a distance hereditary graph, both of which are improvements over previous algorithms for those problems.
Edit intent: clarity
Original: Modeling physical layer behavior of packet reception in the presence of interference is central to achieving efficient spectrum use in wireless sensor networks via spatial reuse .
Revised: Efficient spectrum use in wireless sensor networks via spatial reuse .
Edit intent: clarity
Original:  On one hand, analytic and simulations research has largely relied on assumptions of geometric path loss and isotropic transmission  which have not been borne out in experiments.
Revised:  On one hand, analytic and simulations research has largely relied on assumptions of geometric path loss and isotropic transmission , assumptions which have not been borne out in experiments.
Edit intent: fluency
Original:  Theoretically, we show thatall known SINR scheduling algorithms that work in general metric spaces carry over  and achieve equivalent performance guarantees in the new model.
Revised:  all known SINR scheduling algorithms that work in general metric spaces carry over and achieve equivalent performance guarantees in the new model.
Edit intent: coherence
Original: Probabilistic reconstruction of transmission networks for communicable diseases can provide important insights into epidemic dynamics, the effectiveness of infection control measures, and contact patterns in an at-risk population.
Edit intent: clarity
Original:  Whole genome sequencing of pathogens from multiple hosts provides an opportunity to investigate who infected whom with unparalleled resolution  .
Revised:  Whole genome sequencing of pathogens from multiple hosts in an epidemic offers the potential to investigate who infected whom with unparalleled resolution .
Edit intent: clarity
Original:  We considered disease outbreaks in a community with high frequency genomic sampling, and formulated stochastic epidemic models to investigate person-to-person transmission, based on  genomic and epidemiological data.
Revised:  We considered disease outbreaks in a setting with dense genomic sampling, and formulated stochastic epidemic models to investigate person-to-person transmission, based on genomic and epidemiological data.
Edit intent: clarity
Original:  We considered disease outbreaks in a community with high frequency genomic sampling, and formulated stochastic epidemic models to investigate person-to-person transmission, based on  genomic and epidemiological data.
Revised:  We considered disease outbreaks in a community with high frequency genomic sampling, and formulated stochastic epidemic models to investigate person-to-person transmission, based on observed genomic and epidemiological data.
Edit intent: clarity
Original:  It is generally acknowledged by  actuaries within UK life offices that it is currently impossible to correctly fulfill the requirements imposed by Solvency II using existing computational techniques based on commercially available valuation packages.
Revised:  It is generally acknowledged by practising actuaries within UK life offices that it is currently impossible to correctly fulfill the requirements imposed by Solvency II using existing computational techniques based on commercially available valuation packages.
Edit intent: clarity
Original:  It is generally acknowledged by  actuaries within UK life offices that it is currently impossible to correctly fulfill the requirements imposed by Solvency II using existing computational techniques based on commercially available valuation packages.
Revised:  It is generally acknowledged by actuaries within UK life offices that it is currently impossible to correctly fulfil the requirements imposed by Solvency II using existing computational techniques based on commercially available valuation packages.
Edit intent: fluency
Original:  Our results suggest that by using an optimised parallel implementation of this algorithm, on an affordable hardware platform, it is possible to perform the "brute force" approach to demonstrating solvency in a realistic timescale (of the order of a few hours).
Revised:  Our results suggest that by using an optimised parallel implementation of this algorithm, on an affordable hardware platform, it is possible to perform the `brute force' approach to demonstrating solvency in a realistic timescale (of the order of a few hours).
Edit intent: fluency
Original:  Complex phenotypic differences such as those among different acute leukemias cannot be fully captured by analyzing the expression levels of one single microRNA at a time .
Revised: Background: Complex phenotypic differences such as those among different acute leukemias cannot be fully captured by analyzing the expression levels of one single microRNA at a time .
Edit intent: coherence
Original:  Complex phenotypic differences such as those among different acute leukemias cannot be fully captured by analyzing the expression levels of one single microRNA at a time .
Revised:  Complex phenotypic differences among different acute leukemias cannot be fully captured by analyzing the expression levels of one single microRNA at a time .
Edit intent: clarity
Original:  Complex phenotypic differences such as those among different acute leukemias cannot be fully captured by analyzing the expression levels of one single microRNA at a time .
Revised:  Complex phenotypic differences such as those among different acute leukemias cannot be fully captured by analyzing the expression levels of one single molecule, such as a miR, at a time .
Edit intent: clarity
Original:  First, global human microRNA expression was measured on AML, B-ALL, and T-ALL cell lines and patient samples.
Revised:  First, global human microRNA expression was measured in AML, B-ALL, and T-ALL cell lines and patient samples.
Edit intent: clarity
Original:  Then, by systematically applying support vector machines to all microRNAs taken pairwise, we built an AML-centric microRNA-dyad networkbased only on the cell line data.
Revised:  Then, by systematically applying support vector machines to all measured miRs taken pairwise, we built an AML-centric microRNA-dyad networkbased only on the cell line data.
Edit intent: clarity
Original:  Then, by systematically applying support vector machines to all microRNAs taken pairwise, we built an AML-centric microRNA-dyad networkbased only on the cell line data.
Revised:  Then, by systematically applying support vector machines to all microRNAs taken pairwise, we build an AML-centric microRNA-dyad networkbased only on the cell line data.
Edit intent: fluency
Original:  In order to differentially characterize B-ALL and T-ALL, however,  at least 3 microRNAs were needed.
Revised:  In order to differentially characterize B-ALL and T-ALL, however, sets of at least 3 microRNAs were needed.
Edit intent: clarity
Original:  The most connected microRNA in the B-ALL-centric network was miR-708 (70\% of all triads).
Revised:  The most connected microRNA in the B-ALL-centric network , miR-708 (70\% of all triads).
Edit intent: fluency
Original:  Microarray and qRT-PCR analyses across cell lines and patient samples showed that miR-708 is highly and specifically expressed in B-ALL , suggesting that miR-708 might serve as a biomarker for B-ALL.
Revised:  Microarray and qRT-PCR analyses across cell lines and patient samples showed that miR-708 is highly and specifically expressed in B-ALLs , suggesting that miR-708 might serve as a biomarker for B-ALL.
Edit intent: clarity
Original:  However, by experimentally manipulating the expression levels of miR-708 in B-ALL cell lines, no functional effect was revealed on cell survivalor proliferation, which underscores the cooperative nature of cellular function involving multiple microRNAs .
Revised:  Conclusions: This approach is systematic, quantitative, scalable, and unbiased. Rather than a single signature, our approach yields a network of signatures reflecting the redundant nature of biological signaling pathways. The network representation allows for visual analysis of all signatures by an expert and for future integration of additional information. Furthermore, each signature involves only small sets of miRs, which are well suited for in depth validation through laboratory experiments. In particular, loss- and gain-of-function assays designed to drive changes in leukemia cell survival, proliferation and differentiation will benefit from the identification of multi-miR signatures that characterize leukemia subtypes and their normal counterpart cells of origin .
Edit intent: coherence
Original: Background: Complex phenotypic differences among different acute leukemias cannot be fully captured by analyzing the expression levels of one single molecule, such as a miR, at a time, but requires systematic analysis of large sets of miRs.
Revised:  Complex phenotypic differences among different acute leukemias cannot be fully captured by analyzing the expression levels of one single molecule, such as a miR, at a time, but requires systematic analysis of large sets of miRs.
Edit intent: coherence
Original:  Principal Component Analysis and other low-dimensional representation methods are not designed to optimally discriminate different phenotypes and, moreover, they yield linear or non-linear combinations of all measured miRs.
Revised:  While a popular approach for analysis of such datasets is principal component analysis (PCA), this method is not designed to optimally discriminate different phenotypes and, moreover, they yield linear or non-linear combinations of all measured miRs.
Edit intent: clarity
Original:  Principal Component Analysis and other low-dimensional representation methods are not designed to optimally discriminate different phenotypes and, moreover, they yield linear or non-linear combinations of all measured miRs.
Revised:  Principal Component Analysis and other low-dimensional representation methods are not designed to optimally discriminate different phenotypes . Moreover, PCA and other low-dimensional representation methods yield linear or non-linear combinations of all measured miRs.
Edit intent: coherence
Original:  Results: Global human miR expression was measured in AML, B-ALL, and T-ALL cell lines and patient RNA samples.
Revised:  Global human miR expression was measured in AML, B-ALL, and T-ALL cell lines and patient RNA samples.
Edit intent: coherence
Original:  Subsequent qRT-PCR analysis showed that the most connected miR in the B-ALL-centric network, miR-708, is highly and specifically expressed in B-ALLs, suggesting that miR-708 might serve as a biomarker for B-ALL. Conclusions: This approach is systematic, quantitative, scalable, and unbiased.
Revised:  Subsequent qRT-PCR analysis showed that the most connected miR in the B-ALL-centric network, miR-708, is highly and specifically expressed in B-ALLs, suggesting that miR-708 might serve as a biomarker for B-ALL. This approach is systematic, quantitative, scalable, and unbiased.
Edit intent: coherence
Original:  In particular, loss- and gain-of-function assays designed to drive changes in leukemia cell survival, proliferation and differentiation will benefit from the identification of multi-miR signatures that characterize leukemia subtypes and their normal counterpart cells of origin .
Revised:  In particular, loss- and gain-of-function assays designed to drive changes in leukemia cell survival, proliferation and differentiation .
Edit intent: clarity
Original:  We propose a novel protocol where the cognitive user transmits its packet over a channel formed by the aggregate of the inactive (empty) primary bands.
Revised:  We propose a novel protocol where the cognitive user transmits its packet over a channel formed by the aggregate of the inactive primary bands.
Edit intent: clarity
Original:  We study the impact of the number of the PUs, the sensing errors, and the number of antennas on the maximum secondary stable throughput.
Revised:  We study the impact of the number of PUs, sensing errors, and the number of antennas on the maximum secondary stable throughput.
Edit intent: fluency
Original: Graph vertices coloring with a given number of colors is a famous and much-studied NP-complete problem.
Revised: Graph vertex coloring with a given number of colors is a famous and much-studied NP-complete problem.
Edit intent: fluency
Original: Graph vertices coloring with a given number of colors is a famous and much-studied NP-complete problem.
Revised: Graph vertices coloring with a given number of colors is a well-known and much-studied NP-complete problem.
Edit intent: clarity
Original: The best methods to solve this problem are  hybrid algorithms such as memetic algorithms Galinier99, Lu10, Wu12 or quantum annealing Titiloye11a, Titiloye11b, Titiloye12 .
Revised: The most effective methods to solve this problem are hybrid algorithms such as memetic algorithms Galinier99, Lu10, Wu12 or quantum annealing Titiloye11a, Titiloye11b, Titiloye12 .
Edit intent: clarity
Original: The best methods to solve this problem are  hybrid algorithms such as memetic algorithms Galinier99, Lu10, Wu12 or quantum annealing Titiloye11a, Titiloye11b, Titiloye12 .
Revised: The best methods to solve this problem are proved to be hybrid algorithms such as memetic algorithms Galinier99, Lu10, Wu12 or quantum annealing Titiloye11a, Titiloye11b, Titiloye12 .
Edit intent: coherence
Original: The best methods to solve this problem are  hybrid algorithms such as memetic algorithms Galinier99, Lu10, Wu12 or quantum annealing Titiloye11a, Titiloye11b, Titiloye12 .
Revised: The best methods to solve this problem are hybrid algorithms such as memetic algorithms or quantum annealing Titiloye11a, Titiloye11b, Titiloye12 .
Edit intent: coherence
Original: The best methods to solve this problem are  hybrid algorithms such as memetic algorithms Galinier99, Lu10, Wu12 or quantum annealing Titiloye11a, Titiloye11b, Titiloye12 .
Revised: The best methods to solve this problem are hybrid algorithms such as memetic algorithms Galinier99, Lu10, Wu12 or quantum annealing .
Edit intent: coherence
Original:  This paper studies the impact of the increase and the decrease of diversification in one of the most effective algorithms known : the Hybrid Evolutionary Algorithm (HEA ) from Galinier and Hao Galinier99 .
Revised:  This paper studies the impact of the increase and the decrease of diversification in one of the most effective algorithms : the Hybrid Evolutionary Algorithm (HEA ) from Galinier and Hao Galinier99 .
Edit intent: clarity
Original:  This paper studies the impact of the increase and the decrease of diversification in one of the most effective algorithms known : the Hybrid Evolutionary Algorithm (HEA ) from Galinier and Hao Galinier99 .
Revised:  This paper studies the impact of the increase and the decrease of diversification in one of the most effective algorithms known : the Hybrid Evolutionary Algorithm HEA from Galinier and Hao Galinier99 .
Edit intent: clarity
Original:  This paper studies the impact of the increase and the decrease of diversification in one of the most effective algorithms known : the Hybrid Evolutionary Algorithm (HEA ) from Galinier and Hao Galinier99 .
Revised:  This paper studies the impact of the increase and the decrease of diversification in one of the most effective algorithms known : the Hybrid Evolutionary Algorithm (HEA ) from Galinier and Hao .
Edit intent: clarity
Original:  This new algorithm more effectively manages the correct 'dose' of diversification to add into the included local search - TabuCol Hertz87%DIFDELCMD < ] %%% in the case of the HEA.
Revised:  Hertz87%DIFDELCMD < ] %%% in the case of the HEA.
Edit intent: coherence
Original: It has produced several good results for the well-known DIMACS benchmark graphs, such as 47-colorings for DSJC500.5, 82-colorings for DSJC1000.5, 222-colorings for DSJC1000 .9 and 81-colorings for  flat1000\_76\_0 , which have so far only been produced by quantum annealing Titiloye12%DIFDELCMD < ] %%% in 2012 with massive multi-CPUs and even 47-colorings for \textless{}dsjc500.
Revised: It has produced several good results for the popular DIMACS benchmark graphs, such as 47-colorings for DSJC500.5, 82-colorings for DSJC1000.5, 222-colorings for DSJC1000 .9 and 81-colorings for flat1000\_76\_0 , which have so far only been produced by quantum annealing Titiloye12%DIFDELCMD < ] %%% in 2012 with massive multi-CPUs and even 47-colorings for \textless{}dsjc500.
Edit intent: clarity
Original: It has produced several good results for the well-known DIMACS benchmark graphs, such as 47-colorings for DSJC500.5, 82-colorings for DSJC1000.5, 222-colorings for DSJC1000 .9 and 81-colorings for  flat1000\_76\_0 , which have so far only been produced by quantum annealing Titiloye12%DIFDELCMD < ] %%% in 2012 with massive multi-CPUs and even 47-colorings for \textless{}dsjc500.
Revised: It has produced several good results for the well-known DIMACS benchmark graphs, such as 222-colorings for DSJC1000 .9 and 81-colorings for flat1000\_76\_0 , which have so far only been produced by quantum annealing Titiloye12%DIFDELCMD < ] %%% in 2012 with massive multi-CPUs and even 47-colorings for \textless{}dsjc500.
Edit intent: coherence
Original: It has produced several good results for the well-known DIMACS benchmark graphs, such as 47-colorings for DSJC500.5, 82-colorings for DSJC1000.5, 222-colorings for DSJC1000 .9 and 81-colorings for  flat1000\_76\_0 , which have so far only been produced by quantum annealing Titiloye12%DIFDELCMD < ] %%% in 2012 with massive multi-CPUs and even 47-colorings for \textless{}dsjc500.
Revised: It has produced several good results for the well-known DIMACS benchmark graphs, such as 47-colorings for DSJC500.5, 82-colorings for DSJC1000.5, 222-colorings for \textless{ .9 and 81-colorings for flat1000\_76\_0 , which have so far only been produced by quantum annealing Titiloye12%DIFDELCMD < ] %%% in 2012 with massive multi-CPUs and even 47-colorings for \textless{}dsjc500.
Edit intent: fluency
Original: It has produced several good results for the well-known DIMACS benchmark graphs, such as 47-colorings for DSJC500.5, 82-colorings for DSJC1000.5, 222-colorings for DSJC1000 .9 and 81-colorings for  flat1000\_76\_0 , which have so far only been produced by quantum annealing Titiloye12%DIFDELCMD < ] %%% in 2012 with massive multi-CPUs and even 47-colorings for \textless{}dsjc500.
Revised: It has produced several good results for the well-known DIMACS benchmark graphs, such as 47-colorings for DSJC500.5, 82-colorings for DSJC1000.5, 222-colorings for DSJC1000 .9 \textgreater{ 81-colorings for flat1000\_76\_0 , which have so far only been produced by quantum annealing Titiloye12%DIFDELCMD < ] %%% in 2012 with massive multi-CPUs and even 47-colorings for \textless{}dsjc500.
Edit intent: clarity
Original: It has produced several good results for the well-known DIMACS benchmark graphs, such as 47-colorings for DSJC500.5, 82-colorings for DSJC1000.5, 222-colorings for DSJC1000 .9 and 81-colorings for  flat1000\_76\_0 , which have so far only been produced by quantum annealing Titiloye12%DIFDELCMD < ] %%% in 2012 with massive multi-CPUs and even 47-colorings for \textless{}dsjc500.
Revised: It has produced several good results for the well-known DIMACS benchmark graphs, such as 47-colorings for DSJC500.5, 82-colorings for DSJC1000.5, 222-colorings for DSJC1000 .9 and 81-colorings for \textless{ flat1000\_76\_0 , which have so far only been produced by quantum annealing Titiloye12%DIFDELCMD < ] %%% in 2012 with massive multi-CPUs and even 47-colorings for \textless{}dsjc500.
Edit intent: fluency
Original: It has produced several good results for the well-known DIMACS benchmark graphs, such as 47-colorings for DSJC500.5, 82-colorings for DSJC1000.5, 222-colorings for DSJC1000 .9 and 81-colorings for  flat1000\_76\_0 , which have so far only been produced by quantum annealing Titiloye12%DIFDELCMD < ] %%% in 2012 with massive multi-CPUs and even 47-colorings for \textless{}dsjc500.
Revised: It has produced several good results for the well-known DIMACS benchmark graphs, such as 47-colorings for DSJC500.5, 82-colorings for DSJC1000.5, 222-colorings for DSJC1000 .9 and 81-colorings for flat1000\_76\_0 Titiloye12%DIFDELCMD < ] %%% in 2012 with massive multi-CPUs and even 47-colorings for \textless{}dsjc500.
Edit intent: coherence
Original: It has produced several good results for the well-known DIMACS benchmark graphs, such as 47-colorings for DSJC500.5, 82-colorings for DSJC1000.5, 222-colorings for DSJC1000 .9 and 81-colorings for  flat1000\_76\_0 , which have so far only been produced by quantum annealing Titiloye12%DIFDELCMD < ] %%% in 2012 with massive multi-CPUs and even 47-colorings for \textless{}dsjc500.
Revised: It has produced several good results for the well-known DIMACS benchmark graphs, such as 47-colorings for DSJC500.5, 82-colorings for DSJC1000.5, 222-colorings for DSJC1000 .9 and 81-colorings for flat1000\_76\_0 , which have so far only been produced by quantum annealing %DIFDELCMD < ] %%% in 2012 with massive multi-CPUs and even 47-colorings for \textless{}dsjc500.
Edit intent: coherence
Original:  Adopting the formalism of hypothesis testing in statistical analysis, we describe the minimax optimal rates  .
Revised:  Adopting the formalism of hypothesis testing in statistical analysis, we describe the minimax optimal rates of detection .
Edit intent: clarity
Original:  We also address algorithmic issues, and describe the performance of a new computationally efficient test  .
Revised:  We also address algorithmic issues, and give a computationally efficient test .
Edit intent: clarity
Original:  This result is compared to a related hypothesis on the hardness of detecting satisfiability of random formulas.
Revised:  This result is compared to a related hypothesis on the hardness of refuting satisfiability of random formulas.
Edit intent: clarity
Original:  Recently, a topologically motivated notion analogous to edge expansion that is based on Z_2-cohomology was introduced by Gromov and independently by Linial, Meshulam and Wallach and by Newman and Rabinovich .
Revised:  Recently, a topologically motivated notion analogous to edge expansion that is based on Z_2-cohomology was introduced by Gromov and independently by Linial, Meshulam and Wallach .
Edit intent: coherence
Original:  This results are interesting due to  applications in synchronization of finite state information sources.
Revised:  This results are interesting due to their applications in synchronization of finite state information sources.
Edit intent: clarity