wanyu/IteraTeR_v2 huggingface dataset:
Original:  Given an automaton, the problem is to produce an improviser, a probabilistic Turing machine which randomly generates words in its language, subject to two additional constraints: to share some similarity with a reference word, while exhibiting a given amount of randomness.
Revised:  Given an automaton, the problem is to produce an improviser, a probabilistic algorithm that randomly generates words in its language, subject to two additional constraints: to share some similarity with a reference word, while exhibiting a given amount of randomness.
Edit intent: clarity
Original:  Given an automaton, the problem is to produce an improviser, a probabilistic Turing machine which randomly generates words in its language, subject to two additional constraints: to share some similarity with a reference word, while exhibiting a given amount of randomness.
Revised:  Given an automaton, the problem is to produce an improviser, a probabilistic Turing machine which randomly generates words in its language, subject to two additional constraints: the satisfaction of an admissibility predicate, and exhibition of a specified amount of randomness.
Edit intent: clarity
Original:  Given an automaton, the problem is to produce an improviser, a probabilistic algorithm that randomly generates words in its language, subject to two additional constraints: the satisfaction of an admissibility predicate, and  exhibition of a specified amount of randomness.
Revised:  Given an automaton, the problem is to produce an improviser, a probabilistic algorithm that randomly generates words in its language, subject to two additional constraints: the satisfaction of an admissibility predicate, and the exhibition of a specified amount of randomness.
Edit intent: fluency
Original:  This problem has proved useful, for example, in generating musical improvisations that satisfy rhythmic and melodic constraints, where admissibility was determined by some bounded divergence from a reference melody.
Revised:  This problem has proved useful, for example, in generating musical improvisations that satisfy rhythmic and melodic constraints, where admissibility is determined by some bounded divergence from a reference melody.
Edit intent: fluency
Original:  This problem has proved useful, for example, in generating musical improvisations that satisfy rhythmic and melodic constraints, where admissibility is determined by some bounded divergence from a reference melody.
Revised:  Control improvisation has multiple applications, including, for example, in generating musical improvisations that satisfy rhythmic and melodic constraints, where admissibility is determined by some bounded divergence from a reference melody.
Edit intent: clarity
Original:  This problem has proved useful, for example, in generating musical improvisations that satisfy rhythmic and melodic constraints, where admissibility is determined by some bounded divergence from a reference melody.
Revised:  This problem has proved useful, for example, generating musical improvisations that satisfy rhythmic and melodic constraints, where admissibility is determined by some bounded divergence from a reference melody.
Edit intent: fluency
Original: Morphogenesis in plants is initiated in meristems, the cells there differentiating under the influence of signals from the hormone auxin . Auxin is actively transported throughout the meristem via dedicated transporters such as PIN.
Revised: The hormone auxin is actively transported throughout the meristem via dedicated transporters such as PIN.
Edit intent: clarity
Original: Morphogenesis in plants is initiated in meristems, the cells there differentiating under the influence of signals from the hormone auxin . Auxin is actively transported throughout the meristem via dedicated transporters such as PIN.
Revised: Morphogenesis in plants is initiated in meristems, the cells there differentiating under the influence of signals from the hormone auxin . Auxin is actively transported throughout plants via protein machineries including the dedicated transporter known as PIN.
Edit intent: clarity
Original:  In the last decade it has been discovered that this transport is highly polarised, nearby cells driving auxin flux in similar directions.
Revised:  The associated transport is ordered with nearby cells driving auxin flux in similar directions.
Edit intent: clarity
Original:  Our main findings are: (i) spontaneous  PIN polarisation arises if and only if cooperative effects in PIN recycling are strong enough , (ii) there is no need for an auxin concentration gradient, and (iii) orderly multi-cellular patterns of PIN polarisation are favored by molecular noise.
Revised:  Our main findings are: (i) spontaneous intracellular PIN polarisation arises if and only if cooperative effects in PIN recycling are strong enough , (ii) there is no need for an auxin concentration gradient, and (iii) orderly multi-cellular patterns of PIN polarisation are favored by molecular noise.
Edit intent: clarity
Original:  Our main findings are: (i) spontaneous  PIN polarisation arises if and only if cooperative effects in PIN recycling are strong enough , (ii) there is no need for an auxin concentration gradient, and (iii) orderly multi-cellular patterns of PIN polarisation are favored by molecular noise.
Revised:  Our main findings are: (i) spontaneous PIN polarisation arises if PIN recycling dynamics are sufficiently non-linear , (ii) there is no need for an auxin concentration gradient, and (iii) orderly multi-cellular patterns of PIN polarisation are favored by molecular noise.
Edit intent: clarity
Original:  Our main findings are: (i) spontaneous  PIN polarisation arises if and only if cooperative effects in PIN recycling are strong enough , (ii) there is no need for an auxin concentration gradient, and (iii) orderly multi-cellular patterns of PIN polarisation are favored by molecular noise.
Revised:  Our main findings are: (i) spontaneous PIN polarisation arises if and only if cooperative effects in PIN recycling are strong enough , (ii) there is no need for an auxin concentration gradient, and (iii) ordered multi-cellular patterns of PIN polarisation are favored by molecular noise.
Edit intent: fluency
Original:  This problem relates to the verification of Petri Nets , but existing approaches are not sufficient for certain situations that commonly arise in molecular implementations, such as what we call "delayed choice.
Revised:  This problem relates to the verification of Petri nets , but existing approaches are not sufficient for certain situations that commonly arise in molecular implementations, such as what we call "delayed choice.
Edit intent: fluency
Original:   We further show how pathway decomposition can be combined with weak bisimulation to handle a wider class that includes all currently known enzyme-free DNA implementation techniques.
Revised:  We further show how pathway decomposition can be combined with weak bisimulation to handle a wider class that includes most currently known enzyme-free DNA implementation techniques.
Edit intent: clarity
Original: High-throughput molecular approaches are required to investigate the origin and diffusion of antimicrobial resistance in rapidly radiating pathogen outbreaks.
Revised: High-throughput molecular screening is required to investigate the origin and diffusion of antimicrobial resistance in rapidly radiating pathogen outbreaks.
Edit intent: clarity
Original: High-throughput molecular approaches are required to investigate the origin and diffusion of antimicrobial resistance in rapidly radiating pathogen outbreaks.
Revised: High-throughput molecular approaches are required to investigate the origin and diffusion of antimicrobial resistance in pathogen outbreaks.
Edit intent: clarity
Original:  Frequent global sweeps of new dominant ST131 varieties necessitate deep genomic scrutiny of their spread, evolution and lateral transfer of drug resistance genes.
Revised:  Frequent global sweeps of new dominant ST131 originated firstly by a mutation enhancing virulence and lateral transfer of drug resistance genes.
Edit intent: clarity
Original:  Consequently, genomic epidemiology needs to explore the scale of phenotypic regulatory control acting on RNA . A multi-faceted approach can comprehensively assess antimicrobial resistance in E. coli ST131 in terms of within-host genetic heterogeneity, regulation of gene expression, and transmission dynamics between hosts to achieve a goal of pre-empting resistance before it emerges by optimising drug treatment protocols.
Revised:  Consequently, genomic epidemiology needs to explore the scale of phenotypic regulatory control acting on RNA . A multi-faceted approach can enhance assessment of antimicrobial resistance in E. coli ST131 in terms of within-host genetic heterogeneity, regulation of gene expression, and transmission dynamics between hosts to achieve a goal of pre-empting resistance before it emerges by optimising drug treatment protocols.
Edit intent: clarity
Original:  Consequently, genomic epidemiology needs to explore the scale of phenotypic regulatory control acting on RNA . A multi-faceted approach can comprehensively assess antimicrobial resistance in E. coli ST131 in terms of within-host genetic heterogeneity, regulation of gene expression, and transmission dynamics between hosts to achieve a goal of pre-empting resistance before it emerges by optimising drug treatment protocols.
Revised:  Consequently, genomic epidemiology needs to explore the scale of phenotypic regulatory control acting on RNA . A multi-faceted approach can comprehensively assess antimicrobial resistance in E. coli ST131 by examining transmission dynamics between hosts to achieve a goal of pre-empting resistance before it emerges by optimising drug treatment protocols.
Edit intent: clarity
Original:  Consequently, genomic epidemiology needs to explore the scale of phenotypic regulatory control acting on RNA . A multi-faceted approach can comprehensively assess antimicrobial resistance in E. coli ST131 in terms of within-host genetic heterogeneity, regulation of gene expression, and transmission dynamics between hosts to achieve a goal of pre-empting resistance before it emerges by optimising drug treatment protocols.
Revised:  Consequently, genomic epidemiology needs to explore the scale of phenotypic regulatory control acting on RNA . A multi-faceted approach can comprehensively assess antimicrobial resistance in E. coli ST131 in terms of within-host genetic heterogeneity, regulation of gene expression, and transmission dynamics between hosts to achieve a goal of pre-empting resistance before it emerges by optimising antimicrobial treatment protocols.
Edit intent: clarity
Original:  Can convergence of PWR also be used as a tool to test for the homogeneity of citation patterns within a set?
Edit intent: clarity
Original:   In this study, PWR is explained in relation to other size-independent recursive metrics such as Pinski Narin's (1976) influence weights, Bergstrom's (2007) Eigenfactor, Brin%DIFDELCMD < & %%% Page's (2001) PageRank, and Kleinberg's (1999) Hubs-and-Authorities from the HITS algorithm .
Revised:  In this study, PWR is discussed and critically assessed in relation to other size-independent recursive metrics such as Pinski Narin's (1976) influence weights, Bergstrom's (2007) Eigenfactor, Brin%DIFDELCMD < & %%% Page's (2001) PageRank, and Kleinberg's (1999) Hubs-and-Authorities from the HITS algorithm .
Edit intent: clarity
Original:   In this study, PWR is explained in relation to other size-independent recursive metrics such as Pinski Narin's (1976) influence weights, Bergstrom's (2007) Eigenfactor, Brin%DIFDELCMD < & %%% Page's (2001) PageRank, and Kleinberg's (1999) Hubs-and-Authorities from the HITS algorithm .
Revised:  In this study, PWR is explained in relation to other size-independent recursive metrics Narin's (1976) influence weights, Bergstrom's (2007) Eigenfactor, Brin%DIFDELCMD < & %%% Page's (2001) PageRank, and Kleinberg's (1999) Hubs-and-Authorities from the HITS algorithm .
Edit intent: clarity
Original:   In this study, PWR is explained in relation to other size-independent recursive metrics such as Pinski Narin's (1976) influence weights, Bergstrom's (2007) Eigenfactor, Brin%DIFDELCMD < & %%% Page's (2001) PageRank, and Kleinberg's (1999) Hubs-and-Authorities from the HITS algorithm .
Revised:  In this study, PWR is explained in relation to other size-independent recursive metrics such as Pinski %DIFDELCMD < & %%% Page's (2001) PageRank, and Kleinberg's (1999) Hubs-and-Authorities from the HITS algorithm .
Edit intent: coherence
Original:   In this study, PWR is explained in relation to other size-independent recursive metrics such as Pinski Narin's (1976) influence weights, Bergstrom's (2007) Eigenfactor, Brin%DIFDELCMD < & %%% Page's (2001) PageRank, and Kleinberg's (1999) Hubs-and-Authorities from the HITS algorithm .
Revised:  In this study, PWR is explained in relation to other size-independent recursive metrics such as Pinski Narin's (1976) influence weights, Bergstrom's (2007) Eigenfactor, Brin%DIFDELCMD < & %%% .
Edit intent: coherence
Original: In this paper, we propose a heuristic for the graph isomorphism problem that is based on the eigendecomposition of the adjacency matrices.
Revised: In this paper, we propose algorithms for the graph isomorphism problem that is based on the eigendecomposition of the adjacency matrices.
Edit intent: clarity
Original: In this paper, we propose a heuristic for the graph isomorphism problem that is based on the eigendecomposition of the adjacency matrices.
Revised: In this paper, we propose a heuristic for the graph isomorphism problem that is based on the eigendecompositions of the adjacency matrices.
Edit intent: fluency
Original:  It is well known, that the eigenvalues of the adjacency matrices of isomorphic graphs need to be identical.
Revised:  The eigenvalues of isomorphic graphs are identical.
Edit intent: clarity
Original:  By repeatedly perturbing the adjacency matrices  , it is possible to break symmetries of the graphs without changing the isomorphism and to assign vertices of G_A to vertices of G_B , provided that an admissible assignment exists.
Revised:  By repeatedly perturbing the adjacency matrices , it is possible to break symmetries of the graphs and iteratively assign vertices of G_A to vertices of G_B , provided that an admissible assignment exists.
Edit intent: clarity
Original:   For a parameterized family of models in which the network load approaches capacity, a variant of the MaxWeight policy is approximately optimal, with bounded regret, even though the average cost grows without bound .
Revised:  For a parameterized family of models in which the network load approaches capacity, this policy is shown to be approximately optimal, with bounded regret, even though the average cost grows without bound .
Edit intent: clarity
Original: Packing and covering linear programs ( LP) are an important class of problems that bridges computer science, operation research, and optimization.
Revised: Packing and covering linear programs ( PC-LPs) form an important class of problems that bridges computer science, operation research, and optimization.
Edit intent: clarity
Original: Packing and covering linear programs ( LP) are an important class of problems that bridges computer science, operation research, and optimization.
Revised: Packing and covering linear programs ( LP) are an important class of linear programs (LPs) across computer science, operation research, and optimization.
Edit intent: clarity
Original: Packing and covering linear programs ( LP) are an important class of problems that bridges computer science, operation research, and optimization.
Revised: Packing and covering linear programs ( LP) are an important class of problems that bridges computer science, operations research, and optimization.
Edit intent: fluency
Original:  Efficient algorithms for solving such LPs have received significant attention in the past 20 years LN93, PST95, BBR97, You01, Nem04, BI04, BBR04, Nes05, AK08, AHK12, KY13, You14, AO15 . Unfortunately, all known nearly-linear time algorithms for producing (1+\varepsilon)-approximate solutions to packing and covering LPs have a running time dependence that is at least proportional to \varepsilon^{-2} .
Revised:  LN93, PST95, BBR97, You01, Nem04, BI04, BBR04, Nes05, AK08, AHK12, KY13, You14, AO15 . Unfortunately, all known nearly-linear time algorithms for producing (1+\varepsilon)-approximate solutions to packing and covering LPs have a running time dependence that is at least proportional to \varepsilon^{-2} .
Edit intent: coherence
Original:  Efficient algorithms for solving such LPs have received significant attention in the past 20 years LN93, PST95, BBR97, You01, Nem04, BI04, BBR04, Nes05, AK08, AHK12, KY13, You14, AO15 . Unfortunately, all known nearly-linear time algorithms for producing (1+\varepsilon)-approximate solutions to packing and covering LPs have a running time dependence that is at least proportional to \varepsilon^{-2} .
Revised:  Efficient algorithms for solving such LPs have received significant attention in the past 20 years LN93, PST95, BBR97, You01, Nem04, BI04, BBR04, Nes05, AK08, AHK12, KY13, You14, AO15nearly-linear time . Unfortunately, all known nearly-linear time algorithms for producing (1+\varepsilon)-approximate solutions to packing and covering LPs have a running time dependence that is at least proportional to \varepsilon^{-2} .
Edit intent: clarity
Original:  Efficient algorithms for solving such LPs have received significant attention in the past 20 years LN93, PST95, BBR97, You01, Nem04, BI04, BBR04, Nes05, AK08, AHK12, KY13, You14, AO15 . Unfortunately, all known nearly-linear time algorithms for producing (1+\varepsilon)-approximate solutions to packing and covering LPs have a running time dependence that is at least proportional to \varepsilon^{-2} .
Revised:  Efficient algorithms for solving such LPs have received significant attention in the past 20 years LN93, PST95, BBR97, You01, Nem04, BI04, BBR04, Nes05, AK08, AHK12, KY13, You14, AO15width . Unfortunately, all known nearly-linear time algorithms for producing (1+\varepsilon)-approximate solutions to packing and covering LPs have a running time dependence that is at least proportional to \varepsilon^{-2} .
Edit intent: fluency
Original:  Efficient algorithms for solving such LPs have received significant attention in the past 20 years LN93, PST95, BBR97, You01, Nem04, BI04, BBR04, Nes05, AK08, AHK12, KY13, You14, AO15 . Unfortunately, all known nearly-linear time algorithms for producing (1+\varepsilon)-approximate solutions to packing and covering LPs have a running time dependence that is at least proportional to \varepsilon^{-2} .
Revised:  Efficient algorithms for solving such LPs have received significant attention in the past 20 years LN93, PST95, BBR97, You01, Nem04, BI04, BBR04, Nes05, AK08, AHK12, KY13, You14, AO15 . Unfortunately, all existing nearly-linear-time algorithms for solving PC-LPs require time at least proportional to \varepsilon^{-2} .
Edit intent: clarity
Original:  In this paper, we leverage insights from optimization theory to break this longstanding barrier .
Revised:  In this paper, we break this longstanding barrier .
Edit intent: clarity
Original:  This is the first application of our linear coupling technique (see AO14%DIFDELCMD < ]%%% ) to problems that are not amenable to blackbox applications known iterative algorithms in convex optimization .
Revised:  This is the first application of our linear coupling technique AO14%DIFDELCMD < ]%%% ) to problems that are not amenable to blackbox applications known iterative algorithms in convex optimization .
Edit intent: coherence
Original:  This is the first application of our linear coupling technique (see AO14%DIFDELCMD < ]%%% ) to problems that are not amenable to blackbox applications known iterative algorithms in convex optimization .
Revised:  This is the first application of our linear coupling technique (see %DIFDELCMD < ]%%% ) to problems that are not amenable to blackbox applications known iterative algorithms in convex optimization .
Edit intent: clarity
Original:  This is the first application of our linear coupling technique (see AO14%DIFDELCMD < ]%%% ) to problems that are not amenable to blackbox applications known iterative algorithms in convex optimization .
Revised:  This is the first application of our linear coupling technique (see AO14%DIFDELCMD < ]%%% to problems that are not amenable to blackbox applications known iterative algorithms in convex optimization .
Edit intent: fluency
Original:  In 1993, Luby and Nisan constructed an iterative first-order algorithm for approximately solving PC-LPs in nearly-linear time , independently of the program'swidth , i.e., the largest value in the program's description .
Revised:  In 1993, Luby and Nisan constructed an iterative algorithm for approximately solving PC-LPs in nearly-linear time , independently of the program'swidth , i.e., the largest value in the program's description .
Edit intent: clarity
Original:  In 1993, Luby and Nisan constructed an iterative first-order algorithm for approximately solving PC-LPs in nearly-linear time , independently of the program'swidth , i.e., the largest value in the program's description .
Revised:  In 1993, Luby and Nisan constructed an iterative first-order algorithm for approximately solving PC-LPs in , independently of the program'swidth , i.e., the largest value in the program's description .
Edit intent: clarity
Original:  In 1993, Luby and Nisan constructed an iterative first-order algorithm for approximately solving PC-LPs in nearly-linear time , independently of the program'swidth , i.e., the largest value in the program's description .
Revised:  In 1993, Luby and Nisan constructed an iterative first-order algorithm for approximately solving PC-LPs in nearly-linear time width , i.e., the largest value in the program's description .
Edit intent: clarity
Original:  In 1993, Luby and Nisan constructed an iterative first-order algorithm for approximately solving PC-LPs in nearly-linear time , independently of the program'swidth , i.e., the largest value in the program's description .
Revised:  In 1993, Luby and Nisan constructed an iterative first-order algorithm for approximately solving PC-LPs in nearly-linear time , independently of the program's , i.e., the largest value in the program's description .
Edit intent: fluency
Original:  Unfortunately, all existing nearly-linear-time algorithms for solving PC-LPs require time at least proportional to \varepsilon^{-2} to produce a 1%DIFDELCMD < \pm %%% \varepsilon approximation to the optimum .
Revised:  Unfortunately, all existing nearly linear-time algorithms for solving PC-LPs require time at least proportional to \varepsilon^{-2} to produce a 1%DIFDELCMD < \pm %%% \varepsilon approximation to the optimum .
Edit intent: fluency
Original:  Unfortunately, all existing nearly-linear-time algorithms for solving PC-LPs require time at least proportional to \varepsilon^{-2} to produce a 1%DIFDELCMD < \pm %%% \varepsilon approximation to the optimum .
Revised:  Unfortunately, all existing nearly-linear-time algorithms for solving PC-LPs require time at least proportional to \varepsilon^{-2} %DIFDELCMD < \pm %%% \varepsilon approximation to the optimum .
Edit intent: clarity
Original:  Unfortunately, all existing nearly-linear-time algorithms for solving PC-LPs require time at least proportional to \varepsilon^{-2} to produce a 1%DIFDELCMD < \pm %%% \varepsilon approximation to the optimum .
Revised:  Unfortunately, all existing nearly-linear-time algorithms for solving PC-LPs require time at least proportional to \varepsilon^{-2} to produce a 1%DIFDELCMD < \pm %%% .
Edit intent: clarity
Original:  This is the first application of our linear coupling technique to problems that are not amenable to blackbox applications known iterative algorithms in convex optimization.
Revised:  This is an application of our linear coupling technique to problems that are not amenable to blackbox applications known iterative algorithms in convex optimization.
Edit intent: clarity