wanyu/IteraTeR_v2 huggingface dataset:
Original:  Even though the deterministic dynamical behavior of type I and II action potentials differ, results show that the single mechanism explains how ion channel noise generates spontaneous action potentials.
Revised:  Even though the deterministic dynamical behavior of type I and II action potentials differ, results show that a single mechanism explains how ion channel noise generates spontaneous action potentials.
Edit intent: fluency
Original: Many aspects of macroevolutionary theory and our knowledge of biotic responses to global environmental change derive from literature-based compilations of paleontological data.
Revised: Many aspects of macroevolutionary theory and our understanding of biotic responses to global environmental change derive from literature-based compilations of paleontological data.
Edit intent: clarity
Original:  We show that PaleoDeepDive requires comparatively little training data to perform comparably to humans in many complex data extraction tasks, and then deploy the system to extend the human-constructed Paleobiology Database to include nearly ten times more journal articles.
Revised:  We show that PaleoDeepDive requires comparatively little training data to perform comparably to humans in complex data extraction tasks, and then deploy the system to extend the human-constructed Paleobiology Database to include nearly ten times more journal articles.
Edit intent: clarity
Original:  Unlike traditional databases, PaleoDeepDive produces a probabilistic database that improves as new information is added and that is extendable to include data not previously accessible on large scales, including morphological data in biological illustrations .
Revised:  Unlike traditional databases, PaleoDeepDive produces a probabilistic database that systematically improves as information is added and that is extendable to include data not previously accessible on large scales, including morphological data in biological illustrations .
Edit intent: clarity
Original:  Unlike traditional databases, PaleoDeepDive produces a probabilistic database that improves as new information is added and that is extendable to include data not previously accessible on large scales, including morphological data in biological illustrations .
Revised:  Unlike traditional databases, PaleoDeepDive produces a probabilistic database that improves as new information is added . We also show that the system can readily accommodate sophisticated data types, such as morphological data in biological illustrations .
Edit intent: clarity
Original:  Although literature-based compilations will always be subject to errors caused by inconsistent and erroneous data reporting, our high quality machine-reading approach to data synthesis and integration brings within reach  questions that are now underdetermined and does so in ways that may stimulate  new modes of inquiry.
Revised:  Although literature-based compilations will always be subject to errors caused by inconsistent and erroneous data reporting, our high quality machine-reading approach to data synthesis and integration brings within reach many questions that are now underdetermined and does so in ways that may stimulate new modes of inquiry.
Edit intent: clarity
Original:  Although literature-based compilations will always be subject to errors caused by inconsistent and erroneous data reporting, our high quality machine-reading approach to data synthesis and integration brings within reach  questions that are now underdetermined and does so in ways that may stimulate  new modes of inquiry.
Revised:  Although literature-based compilations will always be subject to errors caused by inconsistent and erroneous data reporting, our high quality machine-reading approach to data synthesis and integration brings within reach questions that are currently underdetermined and does so in ways that may stimulate new modes of inquiry.
Edit intent: clarity
Original:  Although literature-based compilations will always be subject to errors caused by inconsistent and erroneous data reporting, our high quality machine-reading approach to data synthesis and integration brings within reach  questions that are now underdetermined and does so in ways that may stimulate  new modes of inquiry.
Revised:  Although literature-based compilations will always be subject to errors caused by inconsistent and erroneous data reporting, our high quality machine-reading approach to data synthesis and integration brings within reach questions that are now underdetermined and does so in ways that may stimulate entirely new modes of inquiry.
Edit intent: clarity
Original: This paper further investigates the succinctness landscape of query rewriting in OWL 2 QL . We clarify the worst-case size of positive existential (PE), non-recursive Datalog (NDL), and first-order (FO) rewritings for various classes of tree-like conjunctive queries, ranging from linear queries up to bounded treewidth queries.
Revised: This paper investigates the impact of query topology on the difficulty of answering conjunctive queries in the presence of OWL 2 QL . We clarify the worst-case size of positive existential (PE), non-recursive Datalog (NDL), and first-order (FO) rewritings for various classes of tree-like conjunctive queries, ranging from linear queries up to bounded treewidth queries.
Edit intent: clarity
Original: This paper further investigates the succinctness landscape of query rewriting in OWL 2 QL . We clarify the worst-case size of positive existential (PE), non-recursive Datalog (NDL), and first-order (FO) rewritings for various classes of tree-like conjunctive queries, ranging from linear queries up to bounded treewidth queries.
Revised: This paper further investigates the succinctness landscape of query rewriting in OWL 2 QL . We clarify the worst-case size of positive existential (PE), non-recursive Datalog (NDL), and first-order (FO) rewritings for various classes of tree-like conjunctive queries, ranging from linear queries to bounded treewidth queries.
Edit intent: clarity
Original:  More specifically, we establish a superpolynomial lower bound on the size of PE-rewritings that holds already for linear queries and TBoxes of depth 2.
Revised:  Perhaps our most surprising result is a superpolynomial lower bound on the size of PE-rewritings that holds already for linear queries and TBoxes of depth 2.
Edit intent: clarity
Original:  More specifically, we establish a superpolynomial lower bound on the size of PE-rewritings that holds already for linear queries and TBoxes of depth 2.
Revised:  More specifically, we establish a superpolynomial lower bound on the size of PE-rewritings that holds already for linear queries and ontologies of depth 2.
Edit intent: clarity
Original:  For NDL-rewritings , we show that polynomial-size rewritings always exist for tree-shaped queries with a bounded number of leaves (and arbitrary TBoxes ), and for bounded treewidth queries and bounded depth TBoxes.
Revised:  For NDL-rewritings , we show that polynomial-size rewritings always exist for tree-shaped queries with a bounded number of leaves (and arbitrary ontologies ), and for bounded treewidth queries and bounded depth TBoxes.
Edit intent: clarity
Original:  Along with known results, this yields a complete picture of the succinctness landscape for the considered classes of queries and TBoxes .
Revised:  Along with known results, this yields a complete picture of the succinctness and complexity landscapes for the considered classes of queries and TBoxes .
Edit intent: clarity
Original:  Along with known results, this yields a complete picture of the succinctness landscape for the considered classes of queries and TBoxes .
Revised:  Along with known results, this yields a complete picture of the succinctness landscape for the considered classes of queries and ontologies .
Edit intent: clarity
Original: The existence of a die-out threshold ( di?erent from the classic disease-invasion one) de?ning a region of slow extinction of an epidemic has been proved elsewhere for susceptible-awareinfectious- susceptible models without awareness decay  .
Revised: The existence of a die-out threshold ( different from the classic disease-invasion one) de?ning a region of slow extinction of an epidemic has been proved elsewhere for susceptible-awareinfectious- susceptible models without awareness decay .
Edit intent: fluency
Original: The existence of a die-out threshold ( di?erent from the classic disease-invasion one) de?ning a region of slow extinction of an epidemic has been proved elsewhere for susceptible-awareinfectious- susceptible models without awareness decay  .
Revised: The existence of a die-out threshold ( di?erent from the classic disease-invasion one) defining a region of slow extinction of an epidemic has been proved elsewhere for susceptible-awareinfectious- susceptible models without awareness decay .
Edit intent: fluency
Original: The existence of a die-out threshold ( di?erent from the classic disease-invasion one) de?ning a region of slow extinction of an epidemic has been proved elsewhere for susceptible-awareinfectious- susceptible models without awareness decay  .
Revised: The existence of a die-out threshold ( di?erent from the classic disease-invasion one) de?ning a region of slow extinction of an epidemic has been proved elsewhere for susceptible-aware-infectious-susceptible models without awareness decay .
Edit intent: fluency
Original:  By means of an equivalent mean-?eld model de?ned on regular random networks, we interpret the dynamics of the system in this region and prove that the existence of  this second epidemic threshold is not a generic property .
Revised:  By means of an equivalent mean-field model defined on regular random networks, we interpret the dynamics of the system in this region and prove that the existence of this second epidemic threshold is not a generic property .
Edit intent: clarity
Original:  We illustrate these ?ndings with continuous-time stochastic simulations on regular random networks with di?erent degrees .
Revised:  We illustrate these findings with continuous-time stochastic simulations on regular random networks with di?erent degrees .
Edit intent: fluency
Original: Encoding temporal information from the recent past as spatially distributed memory is essential to be able to instantly access the entire past .
Revised: Encoding temporal information from the recent past as spatially distributed activations is essential in order for the entire recent past to be simultaneously accessible .
Edit intent: clarity
Original:  Any biological or synthetic agent that relies on the past to predict or plan the future, would be endowed with such a spatially distributed temporal memory.
Revised:  Any biological or synthetic agent that relies on the past to predict / plan the future, would be endowed with such a spatially distributed temporal memory.
Edit intent: fluency
Original:  In natural settings where relevant signals show scale free temporal fluctuations, it is advantageous to have a memory system that scale invariantly coarse grains the past information while spatially distributing it .
Revised:  In natural settings where relevant signals show scale free temporal fluctuations, the predictive information encoded in memory is maximal if the past information while spatially distributing it .
Edit intent: clarity
Original:  In natural settings where relevant signals show scale free temporal fluctuations, it is advantageous to have a memory system that scale invariantly coarse grains the past information while spatially distributing it .
Revised:  In natural settings where relevant signals show scale free temporal fluctuations, it is advantageous to have a memory system that scale invariantly coarse grains the past information is scale invariantly coarse grained .
Edit intent: clarity
Original:  We show that any mechanistic construction of such a memory systemin the continuum limit is equivalent to encoding  linear combinations of the Laplace transformed past and their approximated inverses.
Revised:  We show that any mechanistic construction of such a memory systemin the continuum limit is equivalent to encoding the linear combinations of the Laplace transformed past and their approximated inverses.
Edit intent: fluency
Original:  We show that any mechanistic construction of such a memory systemin the continuum limit is equivalent to encoding  linear combinations of the Laplace transformed past and their approximated inverses.
Revised:  We show that any mechanistic construction of such a memory systemin the continuum limit is equivalent to encoding linear combinations of Laplace transform of the past information and their approximated inverses.
Edit intent: clarity
Original:  This mechanism is readily amenable to a discretized implementation in networks that maintain information from exponentially long past timescales within linearly increasing memory resources .
Revised:  This reveals a fundamental construction constraint on memory networks that attempt to maximize predictive information storage relevant to the natural world .
Edit intent: clarity
Original:  Basis representation of finite rings and the Hermite and Smith normal forms are discussed to obtain this prime ideal test .
Revised:  The techniques which we used are basis representation of finite rings and the Hermite and Smith normal forms are discussed to obtain this prime ideal test .
Edit intent: coherence
Original:  Basis representation of finite rings and the Hermite and Smith normal forms are discussed to obtain this prime ideal test .
Revised:  Basis representation of finite rings and the Hermite and Smith normal forms .
Edit intent: coherence
Original: We describe a deterministic polynomial-time test that determining whether a nonzero ideal is a prime ideal in a Dedekind domain with finite rank .
Revised: We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank .
Edit intent: clarity
Original:  Here we consider the k-colouring model.
Revised:  Here we consider the colouring model.
Edit intent: clarity
Original:  For the case where the underlying tree is d-ary and d is sufficiently large, it is well known that d/ln d is a thresholdfunction .
Revised:  For the case where the underlying tree is d-ary tree it is well known that d/ln d is a thresholdfunction .
Edit intent: clarity
Original:  For the case where the underlying tree is d-ary and d is sufficiently large, it is well known that d/ln d is a thresholdfunction .
Revised:  For the case where the underlying tree is d-ary and d is sufficiently large, it is well known that d/ln (d) is the reconstruction threshold .
Edit intent: clarity
Original:  That is, for k=(1+eps)d/ln d we have non-reconstruction and for k=(1-eps)d/ln d we have reconstruction.
Revised:  That is, for k=(1+eps)d/ln d we have non-reconstruction while for k=(1-eps)d/ln d we have reconstruction.
Edit intent: clarity
Original:  Herewe consider the  case where the underlying tree is a random in particularit is a Galton-Watson tree (GW tree) .
Revised:  Herewe consider the case where the underlying tree is chosen according to a predefined distribution. In particular, our focus is on the well-known Galton-Watson tree (GW tree) .
Edit intent: clarity
Original:  Herewe consider the  case where the underlying tree is a random in particularit is a Galton-Watson tree (GW tree) .
Revised:  Herewe consider the case where the underlying tree is a random in particularit is a Galton-Watson trees .
Edit intent: clarity
Original:  The aforementioned study focuses on GW trees with offspring distribution binomial with parameters nand d/n  , i.e. B(n , d/n ) . Here we consider a broader version of the problem that includes the binomial as a special one.
Revised:  The aforementioned study focuses on GW trees with offspring distribution B(n, d/n , i.e. B(n , d/n ) . Here we consider a broader version of the problem that includes the binomial as a special one.
Edit intent: coherence
Original:  The aforementioned study focuses on GW trees with offspring distribution binomial with parameters nand d/n  , i.e. B(n , d/n ) . Here we consider a broader version of the problem that includes the binomial as a special one.
Revised:  The aforementioned study focuses on GW trees with offspring distribution binomial with parameters nand d/n ) , i.e. B(n , d/n ) . Here we consider a broader version of the problem that includes the binomial as a special one.
Edit intent: fluency
Original:  The aforementioned study focuses on GW trees with offspring distribution binomial with parameters nand d/n  , i.e. B(n , d/n ) . Here we consider a broader version of the problem that includes the binomial as a special one.
Revised:  The aforementioned study focuses on GW trees with offspring distribution binomial with parameters nand d/n , i.e. the binomial with parameters n and d/n ) . Here we consider a broader version of the problem that includes the binomial as a special one.
Edit intent: clarity
Original:  We relate the corresponding bounds of k for (non)reconstruction with certain concentration properties of the offspring distribution.
Revised:  We relate the corresponding bounds of k for (non)reconstruction to certain concentration properties of the offspring distribution.
Edit intent: fluency
Original:  An interesting consequence of our analysis is that for offspring distribution with expected offspring d, we get the threshold function d/ln d under weaker concentration conditions compared to B (n,d/n).
Revised:  An interesting consequence of our analysis is that for distributions with expected offspring d, we get the threshold function d/ln d under weaker concentration conditions compared to B (n,d/n).
Edit intent: fluency
Original:  An interesting consequence of our analysis is that for offspring distribution with expected offspring d, we get the threshold function d/ln d under weaker concentration conditions compared to B (n,d/n).
Revised:  An interesting consequence of our analysis is that for offspring distribution with expected offspring d, we get reconstruction threshold d/ln d under weaker concentration conditions compared to B (n,d/n).
Edit intent: clarity
Original:  An interesting consequence of our analysis is that for offspring distribution with expected offspring d, we get the threshold function d/ln d under weaker concentration conditions compared to B (n,d/n).
Revised:  An interesting consequence of our analysis is that for offspring distribution with expected offspring d, we get the threshold function d/ln (d) under weaker concentration conditions compared to B (n,d/n).
Edit intent: clarity
Original:  This is accomplished by finding a parallel between their algorithms and the 1-dimensional Weisfeiler-Leman algorithm for solving the Graph Isomorphism problem.
Revised:  This is accomplished by finding a parallel between their algorithms and the 1-dimensional Weisfeiler-Leman algorithm for solving the Graph Isomorphism problem.
Edit intent: fluency
Original:  We observe that the general principle behind their algorithms is to separate the roots by computing the 1-dimensional Weisfeiler-Leman approximation to the orbits of this graph.
Revised:  We observe that the general principle behind their algorithms is to separate the roots by computing the 1-dimensional Weisfeiler-Leman approximation to the orbits of this graph.
Edit intent: fluency
Original:  We then go on to show how to implicitly compute the 2-dimensional Weisfeiler-Leman approximation of the orbits of these graphs.
Revised:  We then go on to show how to implicitly compute the 2-dimensional Weisfeiler-Leman approximation of the orbits of these graphs.
Edit intent: fluency
Original: In this paper we study the behaviour at infi?nity of the Fourier transform of Radon measures supported by the images of fractal sets under an algorithmically random Brownian motion.
Revised: In this paper we study the behaviour at infinity of the Fourier transform of Radon measures supported by the images of fractal sets under an algorithmically random Brownian motion.
Edit intent: fluency
Original:  We show that, under some computability conditions on these sets, the Fourier transform of the associated measures have, relative to the Hausdorff ? dimensions of these sets, optimal asymptotic decay at infi?nity .
Revised:  We show that, under some computability conditions on these sets, the Fourier transform of the associated measures have, relative to the Hausdorff dimensions of these sets, optimal asymptotic decay at infi?nity .
Edit intent: fluency
Original:  We show that, under some computability conditions on these sets, the Fourier transform of the associated measures have, relative to the Hausdorff ? dimensions of these sets, optimal asymptotic decay at infi?nity .
Revised:  We show that, under some computability conditions on these sets, the Fourier transform of the associated measures have, relative to the Hausdorff ? dimensions of these sets, optimal asymptotic decay at infinity .
Edit intent: fluency
Original:  The argument relies heavily on a direct characterisation, due to Asarin and Pokrovskii, of algorithmically random Brownian motion in terms of the pre?fix free Kolmogorov complexity of fi?nite binary sequences.
Revised:  The argument relies heavily on a direct characterisation, due to Asarin and Pokrovskii, of algorithmically random Brownian motion in terms of the prefix free Kolmogorov complexity of fi?nite binary sequences.
Edit intent: fluency
Original:  The argument relies heavily on a direct characterisation, due to Asarin and Pokrovskii, of algorithmically random Brownian motion in terms of the pre?fix free Kolmogorov complexity of fi?nite binary sequences.
Revised:  The argument relies heavily on a direct characterisation, due to Asarin and Pokrovskii, of algorithmically random Brownian motion in terms of the pre?fix free Kolmogorov complexity of finite binary sequences.
Edit intent: fluency
Original: The eukaryotic flagellum is a remarkable cellular structure, for it can sustain beating with unfailing rhythmicity, yet is capable of rapid responses to stimuli.
Revised: The eukaryotic flagellum beats with apparently unfailing periodicity, yet responds rapidly to stimuli.
Edit intent: clarity
Original:  By forcing beating flagella with hydrodynamic loads , we quantify the recovery of periodic breastroke beating from imposed perturbations .
Revised:  By forcing beating flagella with hydrodynamic loads , we quantify the recovery of periodic breastroke beating from transient hydrodynamic forcing .
Edit intent: clarity
Original:  These results will help constrain microscopic theories on the origin and regulation of  beating.
Revised:  These results will help constrain microscopic theories on the origins and regulation of beating.
Edit intent: fluency
Original:  For cut and project sets our proof relies on Ratner's theorems on homogeneous flows and on the structure of lattices in algebraic groups .
Revised:  For cut and project sets our proof relies on the dynamics of homogeneous flows .
Edit intent: clarity
Original:  We consider a weakening of the Danzer problem, the existence of a uniformly discrete dense forests, and we use homogeneous dynamics  to construct such sets.
Revised:  We consider a weakening of the Danzer problem, the existence of uniformly discrete dense forests, and we use homogeneous dynamics to construct such sets.
Edit intent: fluency
Original:  The latent formulation enables us to consider in a single model combinations of continuous traits, discrete binary traits , and discrete traits with multiple ordered and unordered states.
Revised:  The latent formulation enables us to consider in a single model combinations of continuous traits, discrete binary traits and discrete traits with multiple ordered and unordered states.
Edit intent: fluency
Original:  Finally, we showcase the method through applications to columbine flower morphology, antibiotic resistance in Salmonella , and epitope evolution in influenza.
Revised:  Finally, we showcase the method through applications to columbine flower morphology, antibiotic resistance in Salmonella and epitope evolution in influenza.
Edit intent: fluency