wanyu/IteraTeR_v2 huggingface dataset:
Original:  We give the first rigorous proof that there is a strongly amplifying family of directed graphs which we call "megastars".
Revised:  In this paper, we give the first rigorous proof that there is a strongly amplifying family of directed graphs which we call "megastars".
Edit intent: clarity
Original:  We show that the extinction probability of n-vertex graphs in this family of megastars is roughly n^{-1/2} , up to logarithmic factors , and that all infinite families of superstars and metafunnels have larger extinction probabilities  as a function of n . Our analysis of megastars is tight, up to logarithmic factors .
Revised:  We show that the extinction probability of n-vertex graph in this family of megastars is roughly n^{-1/2} , up to logarithmic factors , and that all infinite families of superstars and metafunnels have larger extinction probabilities as a function of n . Our analysis of megastars is tight, up to logarithmic factors .
Edit intent: fluency
Original:  We show that the extinction probability of n-vertex graphs in this family of megastars is roughly n^{-1/2} , up to logarithmic factors , and that all infinite families of superstars and metafunnels have larger extinction probabilities  as a function of n . Our analysis of megastars is tight, up to logarithmic factors .
Revised:  We show that the extinction probability of n-vertex graphs in this family of megastars is roughly n^{-1/2} ( up to logarithmic factors , and that all infinite families of superstars and metafunnels have larger extinction probabilities as a function of n . Our analysis of megastars is tight, up to logarithmic factors .
Edit intent: fluency
Original:  We show that the extinction probability of n-vertex graphs in this family of megastars is roughly n^{-1/2} , up to logarithmic factors , and that all infinite families of superstars and metafunnels have larger extinction probabilities  as a function of n . Our analysis of megastars is tight, up to logarithmic factors .
Revised:  We show that the extinction probability of n-vertex graphs in this family of megastars is roughly n^{-1/2} , up to logarithmic factors ). We prove that all infinite families of superstars and metafunnels have larger extinction probabilities as a function of n . Our analysis of megastars is tight, up to logarithmic factors .
Edit intent: coherence
Original:  We show that the extinction probability of n-vertex graphs in this family of megastars is roughly n^{-1/2} , up to logarithmic factors , and that all infinite families of superstars and metafunnels have larger extinction probabilities  as a function of n . Our analysis of megastars is tight, up to logarithmic factors .
Revised:  We show that the extinction probability of n-vertex graphs in this family of megastars is roughly n^{-1/2} , up to logarithmic factors , and that all infinite families of superstars and metafunnels have larger extinction probabilities ( as a function of n . Our analysis of megastars is tight, up to logarithmic factors .
Edit intent: fluency
Original:  We show that the extinction probability of n-vertex graphs in this family of megastars is roughly n^{-1/2} , up to logarithmic factors , and that all infinite families of superstars and metafunnels have larger extinction probabilities  as a function of n . Our analysis of megastars is tight, up to logarithmic factors .
Revised:  We show that the extinction probability of n-vertex graphs in this family of megastars is roughly n^{-1/2} , up to logarithmic factors , and that all infinite families of superstars and metafunnels have larger extinction probabilities as a function of n ). Finally, we prove that our analysis of megastars is tight, up to logarithmic factors .
Edit intent: coherence
Original: We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in R^4. Specifically, we show that an arrangement of n algebraic curves determines at most C_\epsilon n^{4/3+3\epsilon} two-rich points, provided at most n^{2/ 3-2 \epsilon} curves lie in any low degree hypersurface and at most n^{1/ 3- \epsilon} curves lie in any low degree surface.
Revised: We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in R^4. Specifically, we show that an arrangement of n algebraic curves determines at most C_\epsilon n^{4/3+3\epsilon} two-rich points, provided at most n^{2/ 3+2 \epsilon} curves lie in any low degree hypersurface and at most n^{1/ 3- \epsilon} curves lie in any low degree surface.
Edit intent: fluency
Original: We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in R^4. Specifically, we show that an arrangement of n algebraic curves determines at most C_\epsilon n^{4/3+3\epsilon} two-rich points, provided at most n^{2/ 3-2 \epsilon} curves lie in any low degree hypersurface and at most n^{1/ 3- \epsilon} curves lie in any low degree surface.
Revised: We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in R^4. Specifically, we show that an arrangement of n algebraic curves determines at most C_\epsilon n^{4/3+3\epsilon} two-rich points, provided at most n^{2/ 3-2 \epsilon} curves lie in any low degree hypersurface and at most n^{1/ 3+ \epsilon} curves lie in any low degree surface.
Edit intent: fluency
Original: Millimeter-wave (mmWave) frequencies between 30 and 300 GHz have attracted considerable attention for fifth generation (5G) cellular communication as they offer orders of magnitude greater bandwidth than current cellular systems.
Revised: The millimeter-wave (mmWave) frequencies between 30 and 300 GHz have attracted considerable attention for fifth generation (5G) cellular communication as they offer orders of magnitude greater bandwidth than current cellular systems.
Edit intent: clarity
Original: Millimeter-wave (mmWave) frequencies between 30 and 300 GHz have attracted considerable attention for fifth generation (5G) cellular communication as they offer orders of magnitude greater bandwidth than current cellular systems.
Revised: Millimeter-wave (mmWave) frequencies have attracted considerable attention for fifth generation (5G) cellular communication as they offer orders of magnitude greater bandwidth than current cellular systems.
Edit intent: clarity
Original:  However, the MAC layer may need to be significantly redesigned to support the highly directional transmissions, very low latencies and high peak rates inherent in mmWave communication.
Revised:  However, the MAC layer may need to be significantly redesigned to support the highly directional transmissions, ultra-low latencies and high peak rates inherent in mmWave communication.
Edit intent: clarity
Original:  However, the MAC layer may need to be significantly redesigned to support the highly directional transmissions, very low latencies and high peak rates inherent in mmWave communication.
Revised:  However, the MAC layer may need to be significantly redesigned to support the highly directional transmissions, very low latencies and high peak rates expected in mmWave communication.
Edit intent: clarity
Original: Firstly, this paper analyzes radio frame design options for a mmWave cellular airlink under the assumption of an LTE-like OFDM frame structure . Simple analytic formulae are derived to estimate the utilization as a function of key parameters such as the control periodicity, number of users, and channel and traffic statistics.
Revised: Firstly, this paper analyzes radio frame design options for a mmWave cellular airlink under the assumption of an LTE-like OFDM frame structure . Simple analytic formulae are derived to estimate the utilization as a function of control periodicity, number of users, and channel and traffic statistics.
Edit intent: clarity
Original:  It is  shown that fully digital beamforming architectures offer significantly lower overhead compared to analog and hybrid beamforming under equivalent power budgets.
Revised:  It is also shown that fully digital beamforming architectures offer significantly lower overhead compared to analog and hybrid beamforming under equivalent power budgets.
Edit intent: coherence
Original:  The task is difficult since 1) key pieces of information are often buried in extraneous detail in the question body and 2) available annotations  are scarce and fragmented , driven by participants .
Revised:  The task is difficult since 1) key pieces of information are often buried in extraneous details in the question body and 2) available annotations are scarce and fragmented , driven by participants .
Edit intent: fluency
Original:  The task is difficult since 1) key pieces of information are often buried in extraneous detail in the question body and 2) available annotations  are scarce and fragmented , driven by participants .
Revised:  The task is difficult since 1) key pieces of information are often buried in extraneous detail in the question body and 2) available annotations are scarce and fragmented .
Edit intent: clarity
Original:  We design a novel combination of recurrent and convolutional models (gated convolutions ) to effectively map questions to their semantic representations.
Revised:  We design a recurrent and convolutional models (gated convolutions ) to effectively map questions to their semantic representations.
Edit intent: clarity
Original:  We design a novel combination of recurrent and convolutional models (gated convolutions ) to effectively map questions to their semantic representations.
Revised:  We design a novel combination of recurrent and convolutional model (gated convolution ) to effectively map questions to their semantic representations.
Edit intent: fluency
Original:  Our evaluation demonstrates that our model yields 10%DIFDELCMD < \\%%% %DIF < gain over a standard IR baseline, and 6\\% over standard  neural network architectures (including CNNs and LSTMs ) trained analogously .
Revised:  Our evaluation demonstrates that our model yields %DIFDELCMD < \\%%% %DIF < gain over a standard IR baseline, and 6\\% over standard neural network architectures (including CNNs and LSTMs ) trained analogously .
Edit intent: clarity
Original:  Our evaluation demonstrates that our model yields 10%DIFDELCMD < \\%%% %DIF < gain over a standard IR baseline, and 6\\% over standard  neural network architectures (including CNNs and LSTMs ) trained analogously .
Revised:  Our evaluation demonstrates that our model yields 10%DIFDELCMD < \\%%% %DIF < gain over a standard IR baseline, and 6\\% over standard neural network architectures (including CNNs , LSTMs and GRUs) .
Edit intent: clarity
Original: An analysis of 1, 200 target articles in 12 journals in 6 subject fieldsand of 7, 000 citations to 36 top cited articles found in virology and chemistry a ratio of Google Scholar (GS ) over Scopus citation counts between 0.8 and 1.5, in Chinese studies between 1.8 and 2.8, in computational linguistics between 2 and 4, and in political science journals between 3 and 4. Open access journals show higher ratios than their non-OA counterparts.
Revised: An analysis of 1, 200 target articles in 12 journals from six subject fields, so that its findings cannot be generalized to all journals or fields. The study is exploratory, and hypothesis generating rather than hypothesis-testing. It confirms findings on source coverage and citation impact obtained in earlier studies. The ratio of GS over Scopus citation counts between 0.8 and 1.5, in Chinese studies between 1.8 and 2.8, in computational linguistics between 2 and 4, and in political science journals between 3 and 4. Open access journals show higher ratios than their non-OA counterparts.
Edit intent: coherence
Original: An analysis of 1, 200 target articles in 12 journals in 6 subject fieldsand of 7, 000 citations to 36 top cited articles found in virology and chemistry a ratio of Google Scholar (GS ) over Scopus citation counts between 0.8 and 1.5, in Chinese studies between 1.8 and 2.8, in computational linguistics between 2 and 4, and in political science journals between 3 and 4. Open access journals show higher ratios than their non-OA counterparts.
Revised: An analysis of 1, 200 target articles in 12 journals in 6 subject fieldsand of 7, 000 citations to 36 top cited articles found in virology and chemistry a ratio of Google Scholar (GS ) over Scopus citation varies across subject fields between 1.0 and 4.0, while Open Access journals in the sample show higher ratios than their non-OA counterparts.
Edit intent: clarity
Original:  In GS, the trade-off between data quality and indexing speed seems to be in favor of the latter . A median Scopus indexing delay of two months compared to GS is largely though not exclusively due to missing cited references in articles in press . Pros and cons of article-based and  concept-based citation indexes are discussed.
Revised:  In GS, the trade-off between data quality and indexing speed seems to be in favor of the latter . A median Scopus indexing delay of two months compared to GS is largely though not exclusively due to missing cited references in articles in press . Pros and cons of article-based and what is termed as concept-based citation indexes are discussed.
Edit intent: clarity
Original: We present modeling, analysis and numerical simulation of a prototype glucose driven drug delivery device  based on chemomechanical interactions and volume phase transitions in polyelectrolyte gels.
Revised: We develop, analyse and numerically simulate a model of a prototype glucose driven drug delivery device based on chemomechanical interactions and volume phase transitions in polyelectrolyte gels.
Edit intent: clarity
Original: We present modeling, analysis and numerical simulation of a prototype glucose driven drug delivery device  based on chemomechanical interactions and volume phase transitions in polyelectrolyte gels.
Revised: We present modeling, analysis and numerical simulation of a prototype , glucose-driven, rhythmic drug delivery device based on chemomechanical interactions and volume phase transitions in polyelectrolyte gels.
Edit intent: clarity
Original:  However, the hydrogen ions are not immediately released to Cell I but react, instead, with the negatively charged carboxyl groups of the membrane, which collapses when a critical pH is reached in Cell II, substantially attenuating glucose transport and%DIFDELCMD < \textrm {%%% H ^+ production.
Revised:  However, the hydrogen ions are not immediately released to Cell I but react, instead, with the negatively charged carboxyl groups of the membrane, which collapses when a critical pH is reached in Cell II, substantially attenuating glucose transport and%DIFDELCMD < \textrm {%%% ^+ production.
Edit intent: clarity
Original:  Subsequent diffusion of attached%DIFDELCMD < \textrm {%%% H ^+ ions increases again the concentration of negative carboxyl groups in the membrane, causing the gel to re-swell, and the process is poised to repeat itself.
Revised:  Subsequent diffusion of attached%DIFDELCMD < \textrm {%%% ^+ ions increases again the concentration of negative carboxyl groups in the membrane, causing the gel to re-swell, and the process is poised to repeat itself.
Edit intent: clarity
Original: In this paper, we study a class of quadratic-exponential growth BSDEs with jumps.
Revised: We investigate a class of quadratic-exponential growth BSDEs with jumps.
Edit intent: clarity
Original:  The quadratic structure was introduced by Barrieu & El Karoui (2013) and yields a very useful universal bound on the possible solutions.
Revised:  The quadratic structure introduced by Barrieu & El Karoui (2013) and yields a very useful universal bound on the possible solutions.
Edit intent: coherence
Original:  The quadratic structure was introduced by Barrieu & El Karoui (2013) and yields a very useful universal bound on the possible solutions.
Revised:  The quadratic structure was introduced by Barrieu & El Karoui (2013) yields the universal bound on the possible solutions.
Edit intent: coherence
Original:  With the bounded terminal condition as well as an additional local Lipschitz continuity, we give a simple and streamlined proof for the existence and the uniqueness of the solution .
Revised:  With a bounded terminal condition as well as an additional local Lipschitz continuity, we give a simple and streamlined proof for the existence and the uniqueness of the solution .
Edit intent: fluency
Original:  With the bounded terminal condition as well as an additional local Lipschitz continuity, we give a simple and streamlined proof for the existence and the uniqueness of the solution .
Revised:  With the bounded terminal condition and local Lipschitz continuity, we give a simple and streamlined proof for the existence and the uniqueness of the solution .
Edit intent: clarity
Original:  With the bounded terminal condition as well as an additional local Lipschitz continuity, we give a simple and streamlined proof for the existence and the uniqueness of the solution .
Revised:  With the bounded terminal condition as well as an additional local Lipschitz continuity, we give a simple and streamlined proof for the existence as well as the uniqueness of the solution .
Edit intent: fluency
Original:  The result is then used to generalize the existing results on the Malliavin's differentiability of the quadratic BSDEs in the diffusion setup to the quadratic-exponential growth BSDEs with jumps .
Revised:  The result is then used to generalize the existing results on the Malliavin's differentiability .
Edit intent: clarity
Original:  The quadratic structure introduced by Barrieu & El Karoui (2013) yields the universal bound on the possible solutions.
Revised:  The quadratic structure introduced by Barrieu & El Karoui (2013) yields the universal bounds on the possible solutions.
Edit intent: fluency
Original:  With a bounded terminal condition and local Lipschitz continuity , we give a simple and streamlined proof for the existence as well as the uniqueness of the solution without using the comparison principle.
Revised:  With local Lipschitz continuity , we give a simple and streamlined proof for the existence as well as the uniqueness of the solution without using the comparison principle.
Edit intent: coherence
Original: Although RNA-Seq data provide unprecedented isoform-level expression information, the detection , assessment, and characterization of alternative isoform regulation (AIR) remains difficult .
Revised: Although RNA-Seq data provide unprecedented isoform-level expression information, detection of alternative isoform regulation (AIR) remains difficult .
Edit intent: clarity
Original:  We introduce JunctionSeq, a new method based on the popular and well-established DEXSeq method, but designed to detect differential usage of both exonic regions and known/novel splice junctions.
Revised:  We introduce JunctionSeq, a new method based on the popular and well-established DEXSeq package to detect differential usage of both exonic regions and known/novel splice junctions.
Edit intent: clarity
Original:  We introduce JunctionSeq, a new method based on the popular and well-established DEXSeq method, but designed to detect differential usage of both exonic regions and known/novel splice junctions.
Revised:  We introduce JunctionSeq, a new method based on the popular and well-established DEXSeq method, but designed to detect differential usage of both exonic regions and splice junctions.
Edit intent: clarity
Original:  In addition to broadening the class of regulatory phenomena that can be detected, JunctionSeq provides a powerful and streamlined visualization and interpretation toolset that allows bioinformaticians to quickly and intuitively assess, evaluate, and characterize the detected differentials and design follow-up experiments.
Revised:  In addition to broadening the class of regulatory phenomena that can be detected, JunctionSeq provides a powerful and streamlined visualization toolset that allows bioinformaticians to quickly and intuitively assess, evaluate, and characterize the detected differentials and design follow-up experiments.
Edit intent: clarity
Original: Let F be a family of curves in the plane with the following properties: (1) each member of F intersects a fixed straight line L in at least one and at most t points , (2) any two members of F intersect in at most one point, (3) the intersection graph of F is triangle-free.
Revised: Let F be a family of curves in the plane with the following properties: (1) each member of F crosses a fixed straight line L in at least one and at most t points , (2) any two members of F intersect in at most one point, (3) the intersection graph of F is triangle-free.
Edit intent: fluency
Original: Let F be a family of curves in the plane with the following properties: (1) each member of F intersects a fixed straight line L in at least one and at most t points , (2) any two members of F intersect in at most one point, (3) the intersection graph of F is triangle-free.
Revised: Let F be a family of curves in the plane with the following properties: (1) each member of F intersects a fixed straight line L at least once and at most t points , (2) any two members of F intersect in at most one point, (3) the intersection graph of F is triangle-free.
Edit intent: clarity
Original: Let F be a family of curves in the plane with the following properties: (1) each member of F intersects a fixed straight line L in at least one and at most t points , (2) any two members of F intersect in at most one point, (3) the intersection graph of F is triangle-free.
Revised: Let F be a family of curves in the plane with the following properties: (1) each member of F intersects a fixed straight line L in at least one and at most t times , (2) any two members of F intersect in at most one point, (3) the intersection graph of F is triangle-free.
Edit intent: clarity
Original:  It has been conjectured that the intersection graphs of families of curves F satisfying just condition  1  have chromatic number bounded in terms of t and the clique number, which would generalize the recent result that the class of outerstring graphs is \chi-bounded.
Revised:  It has been conjectured that the intersection graphs of families of curves F satisfying just condition ( 1 have chromatic number bounded in terms of t and the clique number, which would generalize the recent result that the class of outerstring graphs is \chi-bounded.
Edit intent: fluency
Original:  It has been conjectured that the intersection graphs of families of curves F satisfying just condition  1  have chromatic number bounded in terms of t and the clique number, which would generalize the recent result that the class of outerstring graphs is \chi-bounded.
Revised:  It has been conjectured that the intersection graphs of families of curves F satisfying just condition 1 ) have chromatic number bounded in terms of t and the clique number, which would generalize the recent result that the class of outerstring graphs is \chi-bounded.
Edit intent: fluency
Original: Let \mathcal{F curves in the plane with the following properties: (1) each member of F crosses a fixed straight line L at least once and at most t times, ( 2 ) any two members of \mathcal{F intersect in at most one point, (3) the intersection graph of F is triangle-free.
Revised: Let \mathcal{F curves in the plane each of which crosses a fixed straight line L at least once and at most t times, ( 2 ) any two members of \mathcal{F intersect in at most one point, (3) the intersection graph of F is triangle-free.
Edit intent: clarity
Original: Let \mathcal{F curves in the plane with the following properties: (1) each member of F crosses a fixed straight line L at least once and at most t times, ( 2 ) any two members of \mathcal{F intersect in at most one point, (3) the intersection graph of F is triangle-free.
Revised: Let \mathcal{F curves in the plane with the following properties: (1) each member of F crosses a fixed straight line L at least once and at most t times, ( 2 intersect in at most one point, (3) the intersection graph of F is triangle-free.
Edit intent: clarity