wanyu/IteraTeR_v2 huggingface dataset:
Original:  We also observe that genetic diversity at non-synonymous sites recovers after a selective sweep to its pre-sweep value within 18 months, whereas that at synonymous sites still remains depressed after this time period .
Revised:  We also observe that genetic diversity at non-synonymous sites recovers to its pre-fixation value within 18 months, whereas that at synonymous sites still remains depressed after this time period .
Edit intent: clarity
Original:  We also observe that genetic diversity at non-synonymous sites recovers after a selective sweep to its pre-sweep value within 18 months, whereas that at synonymous sites still remains depressed after this time period .
Revised:  We also observe that genetic diversity at non-synonymous sites recovers after a selective sweep to its pre-sweep value within 18 months, whereas diversity at synonymous sites still remains depressed after this time period .
Edit intent: clarity
Original:  We also observe that genetic diversity at non-synonymous sites recovers after a selective sweep to its pre-sweep value within 18 months, whereas that at synonymous sites still remains depressed after this time period .
Revised:  We also observe that genetic diversity at non-synonymous sites recovers after a selective sweep to its pre-sweep value within 18 months, whereas that at synonymous sites remains depressed after this time period .
Edit intent: clarity
Original:  Moreover, for the class of scale-free graphs our results show that the quantum PageRank algorithm outperforms the classical PageRank algorithm in the sense that quantum effects generically lead to changes in the classical ranking hierarchy .
Revised:  Moreover, our results show that the quantum PageRank algorithm outperforms the classical PageRank algorithm in the sense that quantum effects generically lead to changes in the classical ranking hierarchy .
Edit intent: coherence
Original:  Moreover, for the class of scale-free graphs our results show that the quantum PageRank algorithm outperforms the classical PageRank algorithm in the sense that quantum effects generically lead to changes in the classical ranking hierarchy .
Revised:  Moreover, for the class of scale-free graphs our results show that the quantum PageRank algorithm generically leads to changes in the classical ranking hierarchy .
Edit intent: clarity
Original:  The method utilizes a fixed ultra-wide bandwidth (UWB ) infrastructure and does not require a training database of template waveforms.
Revised:  The method utilizes a fixed UWB infrastructure and does not require a training database of template waveforms.
Edit intent: clarity
Original: Novel auctions are being designed all the time .
Revised: Novel auction schemes are constantly being designed .
Edit intent: clarity
Original:  But how can one tell whether a new design has the desired properties, such as efficiency, i.e. allocating goods to those bidders who value them most?
Revised:  But how to tell whether a new design has the desired properties, such as efficiency, i.e. allocating goods to those bidders who value them most?
Edit intent: clarity
Original:  To this end, we are formalising key facts of auction theory.
Edit intent: coherence
Original:  We investigated the suitability of four theorem provers ( Isabelle, Theorema, Mizar, and Hets/CASL/TPTP ) for reproducing a key result  : Vickrey's 1961 theorem on the properties of second-price auctions.
Revised:  We investigated the suitability of the Isabelle, Theorema, Mizar, and Hets/CASL/TPTP ) for reproducing a key result : Vickrey's 1961 theorem on the properties of second-price auctions.
Edit intent: clarity
Original:  We investigated the suitability of four theorem provers ( Isabelle, Theorema, Mizar, and Hets/CASL/TPTP ) for reproducing a key result  : Vickrey's 1961 theorem on the properties of second-price auctions.
Revised:  We investigated the suitability of four theorem provers ( Isabelle, Theorema, Mizar, and Hets/CASL/TPTP ) for reproducing a key result of auction theory : Vickrey's 1961 theorem on the properties of second-price auctions.
Edit intent: clarity
Original:  Based on our formalisation experience, taking the perspective of an auction designer  , we give recommendations on what system to use for formalising auctions and beyond , and outline further steps towards a complete auction theory toolbox.
Revised:  Based on our formalisation experience, taking an auction designer , we give recommendations on what system to use for formalising auctions and beyond , and outline further steps towards a complete auction theory toolbox.
Edit intent: clarity
Original:  Based on our formalisation experience, taking the perspective of an auction designer  , we give recommendations on what system to use for formalising auctions and beyond , and outline further steps towards a complete auction theory toolbox.
Revised:  Based on our formalisation experience, taking the perspective of an auction designer , we give recommendations on what system to use for formalising auctions , and outline further steps towards a complete auction theory toolbox.
Edit intent: coherence
Original:  In computer science , we seek to contribute to the development of formal methods by presenting new challenge problems.
Revised:  To formal methods , we seek to contribute to the development of formal methods by presenting new challenge problems.
Edit intent: clarity
Original:  In the first project year, we continued earlier studies on game theory , but then focused on auctions, where we are currently building a toolbox of formalisations, and have started to study matching and financial risk management.
Revised:  In the first project year, we continued earlier game theory studies but then focused on auctions, where we are currently building a toolbox of formalisations, and have started to study matching and financial risk management.
Edit intent: fluency
Original:  In the first project year, we continued earlier studies on game theory , but then focused on auctions, where we are currently building a toolbox of formalisations, and have started to study matching and financial risk management.
Revised:  In the first project year, we continued earlier studies on game theory , but then focused on auctions, where we are building a toolbox of formalisations, and have started to study matching and financial risk management.
Edit intent: clarity
Original:  In parallel to conducting research that connects economics and formal methods, we organise events and provide infrastructure to connect both communities, from generally fostering mutual awareness to targeted matchmaking.
Revised:  In parallel to conducting research that connects economics and formal methods, we organise events and provide infrastructure to connect both communities, from fostering mutual awareness to targeted matchmaking.
Edit intent: coherence
Original:  These efforts extend beyond economics, towards generally enabling domain experts to use formalised reasoning.
Revised:  These efforts extend beyond economics, towards generally enabling domain experts to use mechanised reasoning.
Edit intent: clarity
Original: Group-based Trajectory Modeling (GBTM) is applied to the citation curves of articles in six journals and to citable items--articles, reviews, and letters--in a single field of science ( "virology" , 24 journals), in order to distinguish statistically among the developmental trajectories in subpopulations.
Revised: Group-based Trajectory Modeling (GBTM) is applied to the citation curves of articles in six journals and to all citable items in a single field of science ( "virology" , 24 journals), in order to distinguish statistically among the developmental trajectories in subpopulations.
Edit intent: clarity
Original: Group-based Trajectory Modeling (GBTM) is applied to the citation curves of articles in six journals and to citable items--articles, reviews, and letters--in a single field of science ( "virology" , 24 journals), in order to distinguish statistically among the developmental trajectories in subpopulations.
Revised: Group-based Trajectory Modeling (GBTM) is applied to the citation curves of articles in six journals and to citable items--articles, reviews, and letters--in a single field of science ( Virology , 24 journals), in order to distinguish statistically among the developmental trajectories in subpopulations.
Edit intent: fluency
Original: Group-based Trajectory Modeling (GBTM) is applied to the citation curves of articles in six journals and to citable items--articles, reviews, and letters--in a single field of science ( "virology" , 24 journals), in order to distinguish statistically among the developmental trajectories in subpopulations.
Revised: Group-based Trajectory Modeling (GBTM) is applied to the citation curves of articles in six journals and to citable items--articles, reviews, and letters--in a single field of science ( "virology" , 24 journals), in order to distinguish among the developmental trajectories in subpopulations.
Edit intent: clarity
Original:  Although both patterns exhibit a rapid increase in the first years after publication, only papers following the trajectory of a "sticky knowledge claim" can be expected to have a sustained influence.
Revised:  Only papers following the trajectory of a "sticky knowledge claim" can be expected to have a sustained influence.
Edit intent: coherence
Original:  For the journals under study, the most frequently cited groups were  much smaller than ten percent.
Revised:  For the journals under study, the most frequently cited groups were furthermore much smaller than ten percent.
Edit intent: coherence
Original:  Since the index s is known, this is not an identification problem - instead it is learning a common property of the sequences in A.
Revised:  Since the index s is known, this is not an identification problem - instead it is computing a common property of the sequences in A.
Edit intent: clarity
Original:  We also give some examples of sets that are Learnable in the Limit, and derive some properties of Canonical and Complexity Bound Enumerations of classes of total functions, and show that no full enumeration of all indices of Turing machines TM_i that compute a given total function can be Learnable in the Limit.
Revised:  We also give some examples of sets that are Computable in the Limit, and derive some properties of Canonical and Complexity Bound Enumerations of classes of total functions, and show that no full enumeration of all indices of Turing machines TM_i that compute a given total function can be Learnable in the Limit.
Edit intent: clarity
Original:  We also give some examples of sets that are Learnable in the Limit, and derive some properties of Canonical and Complexity Bound Enumerations of classes of total functions, and show that no full enumeration of all indices of Turing machines TM_i that compute a given total function can be Learnable in the Limit.
Revised:  We also give some examples of sets that are Learnable in the Limit, and derive some properties of Canonical and Complexity Bound Enumerations of classes of total functions, and show that no full enumeration of all indices of Turing machines TM_i that compute a given total function can be Computable in the Limit.
Edit intent: clarity
Original:  We prove that given a digraph G on n vertices admitting a z-topological ordering , together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula \varphi and are the union of k %DIFDELCMD < {\bf %%% directed paths, in time f ( \varphi , k, z) \cdot n^{O(k\cdot z) .
Revised:  We prove that given a digraph G on n vertices admitting a z-topological order- ing , together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula \varphi and are the union of k %DIFDELCMD < {\bf %%% directed paths, in time f ( \varphi , k, z) \cdot n^{O(k\cdot z) .
Edit intent: fluency
Original:  We prove that given a digraph G on n vertices admitting a z-topological ordering , together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula \varphi and are the union of k %DIFDELCMD < {\bf %%% directed paths, in time f ( \varphi , k, z) \cdot n^{O(k\cdot z) .
Revised:  We prove that given a digraph G on n vertices admitting a z-topological ordering , together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula \phi and are the union of k %DIFDELCMD < {\bf %%% directed paths, in time f ( \varphi , k, z) \cdot n^{O(k\cdot z) .
Edit intent: fluency
Original:  We prove that given a digraph G on n vertices admitting a z-topological ordering , together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula \varphi and are the union of k %DIFDELCMD < {\bf %%% directed paths, in time f ( \varphi , k, z) \cdot n^{O(k\cdot z) .
Revised:  We prove that given a digraph G on n vertices admitting a z-topological ordering , together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula \varphi and are the union of k %DIFDELCMD < {\bf %%% directed paths, in time f ( \varphi , k, z) \cdot n^{O(k\cdot z) .
Edit intent: fluency
Original:  We prove that given a digraph G on n vertices admitting a z-topological ordering , together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula \varphi and are the union of k %DIFDELCMD < {\bf %%% directed paths, in time f ( \varphi , k, z) \cdot n^{O(k\cdot z) .
Revised:  We prove that given a digraph G on n vertices admitting a z-topological ordering , together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula \varphi and are the union of k %DIFDELCMD < {\bf %%% directed paths, in time f ( \phi , k, z) \cdot n^{O(k\cdot z) .
Edit intent: fluency
Original:  We prove that given a digraph G on n vertices admitting a z-topological ordering , together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula \varphi and are the union of k %DIFDELCMD < {\bf %%% directed paths, in time f ( \varphi , k, z) \cdot n^{O(k\cdot z) .
Revised:  We prove that given a digraph G on n vertices admitting a z-topological ordering , together with such an ordering, one may count the number of subgraphs of G that at the same time satisfy a monadic second order formula \varphi and are the union of k %DIFDELCMD < {\bf %%% directed paths, in time f ( \varphi , k, z) * n^O(k*z) .
Edit intent: clarity
Original:  Our result implies the polynomial time solvability of a vast number of natural counting problems on digraphs admitting z-topological orderings for constant values of z and k.
Revised:  Our result implies the polynomial time solvability of many natural counting problems on digraphs admitting z-topological orderings for constant values of z and k.
Edit intent: clarity
Original:  For instance, we are able to answer in polynomial time questions of the form: "How many planar subgraphs of G are the union of k directed paths?".
Edit intent: coherence
Original:  we observe that any digraph of %DIFDELCMD < {\bf %%% directed pathwidth d has a z-topological ordering for z \leq 2d + 1.  } Since graphs of %DIFDELCMD < {\bf %%% directed pathwidth can have both arbitrarily large %DIFDELCMD < {\bf %%% undirected tree width and arbitrarily large clique width,
Revised:  we observe that any digraph of %DIFDELCMD < {\bf %%% pathwidth d has a z-topological ordering for z \leq 2d + 1. } Since graphs of %DIFDELCMD < {\bf %%% directed pathwidth can have both arbitrarily large %DIFDELCMD < {\bf %%% undirected tree width and arbitrarily large clique width,
Edit intent: fluency
Original:  we observe that any digraph of %DIFDELCMD < {\bf %%% directed pathwidth d has a z-topological ordering for z \leq 2d + 1.  } Since graphs of %DIFDELCMD < {\bf %%% directed pathwidth can have both arbitrarily large %DIFDELCMD < {\bf %%% undirected tree width and arbitrarily large clique width,
Revised:  we observe that any digraph of %DIFDELCMD < {\bf %%% directed directed path-width d has a z-topological ordering for z \leq 2d + 1. } Since graphs of %DIFDELCMD < {\bf %%% directed pathwidth can have both arbitrarily large %DIFDELCMD < {\bf %%% undirected tree width and arbitrarily large clique width,
Edit intent: fluency
Original:  we observe that any digraph of %DIFDELCMD < {\bf %%% directed pathwidth d has a z-topological ordering for z \leq 2d + 1.  } Since graphs of %DIFDELCMD < {\bf %%% directed pathwidth can have both arbitrarily large %DIFDELCMD < {\bf %%% undirected tree width and arbitrarily large clique width,
Revised:  we observe that any digraph of %DIFDELCMD < {\bf %%% directed pathwidth d has a z- topological ordering for z \leq 2d + 1. } Since graphs of %DIFDELCMD < {\bf %%% directed pathwidth can have both arbitrarily large %DIFDELCMD < {\bf %%% undirected tree width and arbitrarily large clique width,
Edit intent: fluency
Original:  we observe that any digraph of %DIFDELCMD < {\bf %%% directed pathwidth d has a z-topological ordering for z \leq 2d + 1.  } Since graphs of %DIFDELCMD < {\bf %%% directed pathwidth can have both arbitrarily large %DIFDELCMD < {\bf %%% undirected tree width and arbitrarily large clique width,
Revised:  we observe that any digraph of %DIFDELCMD < {\bf %%% directed pathwidth d has a z-topological ordering for z \leq 2d + 1. } Since graphs of %DIFDELCMD < {\bf %%% pathwidth can have both arbitrarily large %DIFDELCMD < {\bf %%% undirected tree width and arbitrarily large clique width,
Edit intent: fluency
Original:  we observe that any digraph of %DIFDELCMD < {\bf %%% directed pathwidth d has a z-topological ordering for z \leq 2d + 1.  } Since graphs of %DIFDELCMD < {\bf %%% directed pathwidth can have both arbitrarily large %DIFDELCMD < {\bf %%% undirected tree width and arbitrarily large clique width,
Revised:  we observe that any digraph of %DIFDELCMD < {\bf %%% directed pathwidth d has a z-topological ordering for z \leq 2d + 1. } Since graphs of %DIFDELCMD < {\bf %%% directed pathwidth can have both arbitrarily large %DIFDELCMD < {\bf %%% tree width and arbitrarily large clique width,
Edit intent: clarity
Original:  we observe that any digraph of %DIFDELCMD < {\bf %%% directed pathwidth d has a z-topological ordering for z \leq 2d + 1.  } Since graphs of %DIFDELCMD < {\bf %%% directed pathwidth can have both arbitrarily large %DIFDELCMD < {\bf %%% undirected tree width and arbitrarily large clique width,
Revised:  we observe that any digraph of %DIFDELCMD < {\bf %%% directed pathwidth d has a z-topological ordering for z \leq 2d + 1. } Since graphs of %DIFDELCMD < {\bf %%% directed pathwidth can have both arbitrarily large %DIFDELCMD < {\bf %%% undirected undirected tree-width and arbitrarily large clique width,
Edit intent: fluency
Original:  our result provides for the first time a suitable way of partially transposing metatheorems developed in the context of the monadic second order logic of graphs of constant %DIFDELCMD < {\bf %%% undirected tree width and constant clique width to the realm of digraph width measures that are closed under taking subgraphs and whose constant levels incorporate families of graphs of arbitrarily large undirected tree width and arbitrarily large clique width.
Revised:  our result provides for the first time a suitable way of partially trans- posing metatheorems developed in the context of the monadic second order logic of graphs of constant %DIFDELCMD < {\bf %%% undirected tree width and constant clique width to the realm of digraph width measures that are closed under taking subgraphs and whose constant levels incorporate families of graphs of arbitrarily large undirected tree width and arbitrarily large clique width.
Edit intent: fluency
Original:  our result provides for the first time a suitable way of partially transposing metatheorems developed in the context of the monadic second order logic of graphs of constant %DIFDELCMD < {\bf %%% undirected tree width and constant clique width to the realm of digraph width measures that are closed under taking subgraphs and whose constant levels incorporate families of graphs of arbitrarily large undirected tree width and arbitrarily large clique width.
Revised:  our result provides for the first time a suitable way of partially transposing metatheorems developed in the context of the monadic second order logic of graphs of constant %DIFDELCMD < {\bf %%% tree width and constant clique width to the realm of digraph width measures that are closed under taking subgraphs and whose constant levels incorporate families of graphs of arbitrarily large undirected tree width and arbitrarily large clique width.
Edit intent: fluency
Original:  our result provides for the first time a suitable way of partially transposing metatheorems developed in the context of the monadic second order logic of graphs of constant %DIFDELCMD < {\bf %%% undirected tree width and constant clique width to the realm of digraph width measures that are closed under taking subgraphs and whose constant levels incorporate families of graphs of arbitrarily large undirected tree width and arbitrarily large clique width.
Revised:  our result provides for the first time a suitable way of partially transposing metatheorems developed in the context of the monadic second order logic of graphs of constant %DIFDELCMD < {\bf %%% undirected undirected tree-width and constant clique width to the realm of digraph width measures that are closed under taking subgraphs and whose constant levels incorporate families of graphs of arbitrarily large undirected tree width and arbitrarily large clique width.
Edit intent: fluency
Original:  our result provides for the first time a suitable way of partially transposing metatheorems developed in the context of the monadic second order logic of graphs of constant %DIFDELCMD < {\bf %%% undirected tree width and constant clique width to the realm of digraph width measures that are closed under taking subgraphs and whose constant levels incorporate families of graphs of arbitrarily large undirected tree width and arbitrarily large clique width.
Revised:  our result provides for the first time a suitable way of partially transposing metatheorems developed in the context of the monadic second order logic of graphs of constant %DIFDELCMD < {\bf %%% undirected tree width and constant clique width to the realm of digraph width measures that are closed under taking subgraphs and whose constant levels incorporate families of graphs of arbitrarily large undirected tree-width and arbitrarily large clique width.
Edit intent: fluency
Original:  Furthermore, when the temporal heterogeneity is strong enough, one obtains the vanishing transmissibility , hence the lack of epidemic outbreaks for any finite recovery time  , the condition of which was derived.
Revised:  Furthermore, when the temporal heterogeneity is strong enough, one obtains the vanishing transmissibility for any finite recovery time , the condition of which was derived.
Edit intent: coherence
Original:  Our analysis relies on three empirical studies of emerging technologies in the biomedical domain: RNA interference (RNAi), Human Papilloma Virus (HPV) testing technologies for cervical cancer, and Thiopurine Methyltransferase (TPMT) genetic testing.
Revised:  Our analysis relies on three case-studies of emerging technologies in the biomedical domain: RNA interference (RNAi), Human Papilloma Virus (HPV) testing technologies for cervical cancer, and Thiopurine Methyltransferase (TPMT) genetic testing.
Edit intent: clarity
Original:  Results show the variety of 'intelligence' inputs overlay mapping can produce for the governance of emerging technologies .
Revised:  Results illustrate the variety of 'intelligence' inputs overlay mapping can produce for the governance of emerging technologies .
Edit intent: clarity