wanyu/IteraTeR_v2 huggingface dataset:
Original:  Likewise, mutation rate and fitness become more correlated, even if they are completely uncorrelated for an isolated individual \emph{ , underlining the fact that the interaction induced by limitation of resources is by itself efficient for generating collective effects .
Revised:  Likewise, mutation rate and fitness become more correlated, even if they are completely uncorrelated for an isolated individual \emph{even if they are completely uncorrelated for an isolated individual , underlining the fact that the interaction induced by limitation of resources is by itself efficient for generating collective effects .
Edit intent: fluency
Original:  The outcome is an on-the-fly system that significantly outperforms its predecessors in terms of: precision of retrieval, memory requirements, and speed  facilitating accurate on-the-fly learning and ranking in under a second on a single GPU.
Revised:  The outcome is an on-the-fly system that significantly outperforms its predecessors in terms of: precision of retrieval, memory requirements, and speed , facilitating accurate on-the-fly learning and ranking in under a second on a single GPU.
Edit intent: fluency
Original:  Our goal is to synthesize values of these parameters that minimise expected cost of reaching a given set of target states for a given cost function .
Revised:  Our goal is to synthesize values of these parameters that minimise expected cost of reaching a given set of target states .
Edit intent: clarity
Original: It has been recently observed that the dynamical properties of mass action systems arising from many models of biochemical reaction networks may be derived by considering the corresponding properties of a related generalized mass action system.
Revised: It has been recently observed that the dynamical properties of mass action systems arising from many models of biochemical reaction networks can be derived by considering the corresponding properties of a related generalized mass action system.
Edit intent: clarity
Original: The dynamics of close relationships is important for understanding the life-course migration patterns .
Revised: The dynamics of close relationships is important for understanding the migration patterns of individual life-courses .
Edit intent: clarity
Original:  We incorporate the geographic and demographic information of millions of mobile phone users with their communication patterns to study the dynamics of close relationships and its effect in the life-course migration.
Revised:  We incorporate the geographic and demographic information of millions of mobile phone users with their communication patterns to study the dynamics of close relationships and its effect in their life-course migration.
Edit intent: clarity
Original: Background: With the ever increasing use of computational models in the biosciences, the need to efficiently and easily share models and reproduce the results of published studies  is becoming more important.
Revised: Background: With the ever increasing use of computational models in the biosciences, the need to share models and reproduce the results of published studies is becoming more important.
Edit intent: clarity
Original:  As part of this effort , various standards have been proposed that can be used to describe models, simulations, data or other essential information  .
Revised:  To this end , various standards have been proposed that can be used to describe models, simulations, data or other essential information .
Edit intent: clarity
Original:  These constitute various separate components that are required to reproduce a  published scientific result.
Revised:  These constitute various separate components required to reproduce a published scientific result.
Edit intent: clarity
Original:  These constitute various separate components that are required to reproduce a  published scientific result.
Revised:  These constitute various separate components that are required to reproduce a given published scientific result.
Edit intent: clarity
Original:  Results: In this work we describe the Open Modeling EXchange format (OMEX) that allows all the necessary information to be bundled together into one file .
Revised:  Results: We describe the Open Modeling EXchange format (OMEX) that allows all the necessary information to be bundled together into one file .
Edit intent: clarity
Original:  Results: In this work we describe the Open Modeling EXchange format (OMEX) that allows all the necessary information to be bundled together into one file .
Revised:  Results: In this work we describe the Open Modeling EXchange format (OMEX) .
Edit intent: clarity
Original:  The content of a COMBINE archive consists of files encoded in COMBINE standards whenever possible, but may include additional files defined by an Internet Media Type.
Revised:  The content of a COMBINE Archive consists of files encoded in COMBINE standards whenever possible, but may include additional files defined by an Internet Media Type.
Edit intent: fluency
Original:  Several tools supporting the COMBINE archive are available, either as independent libraries or embedded in modeling software.
Revised:  Several tools that support the COMBINE Archive are available, either as independent libraries or embedded in modeling software.
Edit intent: clarity
Original:  Conclusions: The COMBINE archive facilitates the reproduction of modeling and simulation experiments in biology by embedding all the relevant information in one file.
Revised:  Conclusions: The COMBINE Archive facilitates the reproduction of modeling and simulation experiments in biology by embedding all the relevant information in one file.
Edit intent: fluency
Original:  Having all the information stored and exchanged at once also helps support building logs and audit trails.
Revised:  Having all the information stored and exchanged at once also helps in building activity logs and audit trails.
Edit intent: clarity
Original:  We anticipate that the COMBINE archive will become a significant help  , as the domain moves to larger, more complex experiments such as multi-scale models of organs, digital organisms, and bioengineering.
Revised:  We anticipate that the COMBINE Archive will become a significant help , as the domain moves to larger, more complex experiments such as multi-scale models of organs, digital organisms, and bioengineering.
Edit intent: fluency
Original:  An analytical channel model for the new mechanism is developed to explore the fundamentals of metamaterial enhanced MI communication in various underground environments.
Revised:  An analytical channel model is developed to explore the fundamentals of metamaterial enhanced MI communication in various underground environments.
Edit intent: clarity
Original:  We prove that the problem of deciding if a given automaton is monotonic is NP-complete.
Revised:  We prove that the problem of deciding whether a given automaton is monotonic is NP-complete.
Edit intent: fluency
Original:  This also holds under the restriction that the input alphabet is binary .
Revised:  This also holds under the restriction to binary input alphabets .
Edit intent: clarity
Original:  This also holds under the restriction to binary input alphabets.
Edit intent: coherence
Original: We show that any complete k-partite graph G on n vertices, with k \ge 3, whose edges are two-coloured, can be covered by two vertex-disjoint monochromatic paths of distinct colours , under the necessary assumption that the largest partition class of G contains at most n/2 vertices.
Revised: We show that any complete k-partite graph G on n vertices, with k \ge 3, whose edges are two-coloured, can be covered with two vertex-disjoint monochromatic paths of distinct colours , under the necessary assumption that the largest partition class of G contains at most n/2 vertices.
Edit intent: fluency
Original: We show that any complete k-partite graph G on n vertices, with k \ge 3, whose edges are two-coloured, can be covered by two vertex-disjoint monochromatic paths of distinct colours , under the necessary assumption that the largest partition class of G contains at most n/2 vertices.
Revised: We show that any complete k-partite graph G on n vertices, with k \ge 3, whose edges are two-coloured, can be covered by two vertex-disjoint monochromatic paths of distinct colours . We prove this under the necessary assumption that the largest partition class of G contains at most n/2 vertices.
Edit intent: coherence
Original:  Secondly, we show that in the same situation, all but o(n) vertices of the graph can be covered by two vertex-disjoint monochromatic cycles of distinct colours, if colourings close to a split colouring are excluded.
Revised:  Secondly, we show that in the same situation, all but o(n) vertices of the graph can be covered with two vertex-disjoint monochromatic cycles of distinct colours, if colourings close to a split colouring are excluded.
Edit intent: fluency
Original: The Turing test asked whether one could recognize the behavior of a human from that of a computer algorithm.
Revised: The Turing test aimed to recognize the behavior of a human from that of a computer algorithm.
Edit intent: clarity
Original:  Today this question has suddenly become very relevant in the context of social media , where text constraints limit the expressive power of humans, and real incentives abound to develop human-mimicking software agents called social bots.
Revised:  Today this question has suddenly become very relevant in the context of social media , where text constraints limit the expressive power of humans, while incentives abound to develop human-mimicking software agents called social bots.
Edit intent: coherence
Original:  These social bots interact, often unnoticed, with real people in the social media ecosystems, but their abundance is uncertain.
Revised:  These social bots interact, often unnoticed, with real people in social media ecosystems, but their abundance is uncertain.
Edit intent: fluency
Original:  While many bots are benign, one can be design harmful bots with the goals of persuading, smearing, or deceiving.
Revised:  While many bots are benign, one can design harmful bots with the goals of persuading, smearing, or deceiving.
Edit intent: clarity
Original:  In this paper, we study the computational complexity of Grundy Coloring , the problem of determining whether a given graph has Grundy number at least k.
Revised:  In this paper, we study the computational complexity of GRUNDY COLORING , the problem of determining whether a given graph has Grundy number at least k.
Edit intent: fluency
Original:  We show that Grundy Coloring can be solved in time O^*( 2 ^n) on graphs of order n.
Revised:  We show that GRUNDY COLORING can be solved in time O^*( 2 ^n) on graphs of order n.
Edit intent: fluency
Original:  While the problem is known to be solvable in time f(k,w)  n for graphs of treewidth w, we prove that under the Exponential Time Hypothesis, it cannot be computed in time O^*(c ^w ), for every constant c.
Revised:  While the problem is known to be solvable in time f(k,w) n for graphs of treewidth w, we prove that under the Exponential Time Hypothesis, it cannot be computed in time O^*(c ^w ), for any constant c.
Edit intent: clarity
Original:  We also  consider two previously studied variants of Grundy Coloring, namely Weak Grundy Coloring and Connected Grundy Coloring .
Revised:  We also consider two previously studied variants of GRUNDY COLORING, namely WEAK GRUNDY COLORING and CONNECTED GRUNDY COLORING .
Edit intent: fluency
Original:  We show that Weak Grundy Coloring is fixed-parameter tractable with respect to the weak Grundy number.
Revised:  We show that WEAK GRUNDY COLORING is fixed-parameter tractable with respect to the weak Grundy number.
Edit intent: fluency
Original:  While the problem is known to be solvable in time f(k,w)
Revised:  While GRUNDY COLORING and WEAK GRUNDY COLORING are known to be solvable in time f(k,w)
Edit intent: clarity
Original:  \cdot n for graphs of treewidth w  , we prove that under the Exponential Time Hypothesis , it cannot be computed in time O^*( c ^{  w  }) , for any constant c . We also study the parameterized complexity of GRUNDY COLORINGparameterized by the number of colors, showing that it is in FPT for graphs}) algorithm for WEAK GRUNDY COLORING, which is therefore }\fpt \fpt including chordal graphs, claw-free graphs, and graphs excluding a fixed minor.
Revised:  \cdot n for graphs of treewidth w , we prove that under the Exponential Time Hypothesis (ETH), they cannot be solved in time O^*( c ^{ w }) , for any constant c . We also study the parameterized complexity of GRUNDY COLORINGparameterized by the number of colors, showing that it is in FPT for graphs}) algorithm for WEAK GRUNDY COLORING, which is therefore }\fpt \fpt including chordal graphs, claw-free graphs, and graphs excluding a fixed minor.
Edit intent: clarity
Original:  \cdot n for graphs of treewidth w  , we prove that under the Exponential Time Hypothesis , it cannot be computed in time O^*( c ^{  w  }) , for any constant c . We also study the parameterized complexity of GRUNDY COLORINGparameterized by the number of colors, showing that it is in FPT for graphs}) algorithm for WEAK GRUNDY COLORING, which is therefore }\fpt \fpt including chordal graphs, claw-free graphs, and graphs excluding a fixed minor.
Revised:  \cdot n for graphs of treewidth w , we prove that under the Exponential Time Hypothesis , it cannot be computed in time O^*( c ^{ o( w }) , for any constant c . We also study the parameterized complexity of GRUNDY COLORINGparameterized by the number of colors, showing that it is in FPT for graphs}) algorithm for WEAK GRUNDY COLORING, which is therefore }\fpt \fpt including chordal graphs, claw-free graphs, and graphs excluding a fixed minor.
Edit intent: clarity
Original:  \cdot n for graphs of treewidth w  , we prove that under the Exponential Time Hypothesis , it cannot be computed in time O^*( c ^{  w  }) , for any constant c . We also study the parameterized complexity of GRUNDY COLORINGparameterized by the number of colors, showing that it is in FPT for graphs}) algorithm for WEAK GRUNDY COLORING, which is therefore }\fpt \fpt including chordal graphs, claw-free graphs, and graphs excluding a fixed minor.
Revised:  \cdot n for graphs of treewidth w , we prove that under the Exponential Time Hypothesis , it cannot be computed in time O^*( c ^{ w }) . We also study the parameterized complexity of GRUNDY COLORINGparameterized by the number of colors, showing that it is in FPT for graphs}) algorithm for WEAK GRUNDY COLORING, which is therefore }\fpt \fpt including chordal graphs, claw-free graphs, and graphs excluding a fixed minor.
Edit intent: clarity
Original:  In stark contrast , it turns out that checking whether a given graph has connected Grundy number at least k is NP-complete\np already for k= 7.
Revised:  In stark contrast with the two other problems, we show that CONNECTED GRUNDY COLORING is\np already for k= 7.
Edit intent: clarity
Original:  Astronomy has seen a number of efforts to build a repository or directory of scientist-written software , one of which is the Astrophysics Source Code Library (ASCL).
Revised:  Astronomy has seen a number of efforts to build such a resource , one of which is the Astrophysics Source Code Library (ASCL).
Edit intent: clarity
Original:  When taking over responsibility for the ASCL in 2010, Allen sought to answer the opening question, hoping this would better inform her work .
Revised:  When taking over responsibility for the ASCL in 2010, the new editor sought to answer the opening question, hoping this would better inform her work .
Edit intent: clarity
Original:  When taking over responsibility for the ASCL in 2010, Allen sought to answer the opening question, hoping this would better inform her work .
Revised:  When taking over responsibility for the ASCL in 2010, Allen sought to answer the opening question, hoping this would better inform the work to be done .
Edit intent: clarity
Original: Many large-scale  systems such as intelligent transportation systems, smart grids or smart buildings collect data about the activities of their users to optimize their operations.
Revised: Many large-scale information systems such as intelligent transportation systems, smart grids or smart buildings collect data about the activities of their users to optimize their operations.
Edit intent: clarity
Original:   In a typical scenario, signals originate from many sensors capturing events involving these users, and several statistics of interest need to be continuously published in real-time.
Revised:  In a typical scenario, signals originate from many sensors capturing events involving the users, and several statistics of interest need to be continuously published in real-time.
Edit intent: fluency
Original:  In addition, in order to encourage user participation, privacy issues need to be taken into consideration.
Edit intent: coherence
Original:  This paper considers the problem of providing differential privacy guarantees for such multi-input multi-output systems operating continuously .
Revised:  This paper considers the problem of providing differential privacy guarantees for such multi-input multi-output systems processing event streams .
Edit intent: clarity
Original:  We show in particular how to construct  various extensions of the zero-forcing equalization mechanism, which we previously proposed for single-input single-output systems.
Revised:  We show how to construct various extensions of the zero-forcing equalization mechanism, which we previously proposed for single-input single-output systems.
Edit intent: coherence
Original:  We also describe an application to privately monitoring and forecasting occupancy in a building equipped with a dense network of motion detection sensors , which is useful for example to control its HVAC system .
Revised:  We also describe an application to privately monitoring and forecasting occupancy in a building equipped with multiple motion detection sensors , which is useful for example to control its HVAC system .
Edit intent: clarity
Original:  We also describe an application to privately monitoring and forecasting occupancy in a building equipped with a dense network of motion detection sensors , which is useful for example to control its HVAC system .
Revised:  We also describe an application to privately monitoring and forecasting occupancy in a building equipped with a dense network of motion detection sensors .
Edit intent: coherence
Original:   In spite of the inherent model complexity, the long-run asymptotic behavior of the resultant mid-price process is fully characterized in both cases and, hence, our analysis shed further light on the relation between the macro price dynamics and some more detailed LOB features than those considered in earlier works.
Revised:  In spite of the inherent model complexity, the long-run asymptotic behavior of the resultant mid-price process is fully characterized for both models and, hence, our analysis shed further light on the relation between the macro price dynamics and some more detailed LOB features than those considered in earlier works.
Edit intent: clarity
Original:  The asymptotic results are illustrated with a numerical Monte Carlo study for which an efficient novel simulation scheme is  developed.
Revised:  The asymptotic results are illustrated with a numerical Monte Carlo study for which an efficient simulation scheme is developed.
Edit intent: clarity
Original: Motivated by Cont and Larrard (2013)'s seminal Limit Order Book (LOB) model, we propose two continuous-time models for the level I of a LOB in which the arrivals of limit orders, market orders, and cancellations are assumed to be mutually independent, memoryless, and stationary, but, unlike the aforementioned paper, the proposed models also account for some of the sparsity and memory exhibited by real LOB dynamics.
Revised: We propose a new model for the level I of a LOB in which the arrivals of limit orders, market orders, and cancellations are assumed to be mutually independent, memoryless, and stationary, but, unlike the aforementioned paper, the proposed models also account for some of the sparsity and memory exhibited by real LOB dynamics.
Edit intent: clarity
Original:  A more realistic approach is pursued in a second model by keeping the information about the standing orders at the opposite side of the book after each price change (memory property), and also incorporating arrivals of new orders within the spread , which in turn leads to a variable spread .
Revised:  A more realistic approach is pursued in a second model by keeping the information about the standing orders at the opposite side of the book after each price change and the arrivals of new orders within the spread , which in turn leads to a variable spread .
Edit intent: coherence
Original:  To illustrate the applicability of the latter model, analytical expressions for some important quantities of interest , such as the distribution of the time span between price changes and the probability of consecutive price increments conditioned on the current state of the book , are derived.
Revised:  To illustrate the applicability of the considered framework, we also propose a feasible method to compute several quantities of interest , such as the distribution of the time span between price changes and the probability of consecutive price increments conditioned on the current state of the book , are derived.
Edit intent: clarity
Original: The reproduction and replication of novel scientific results has become a major issue for a number of  disciplines.
Revised: The reproduction and replication of novel results has become a major issue for a number of disciplines.
Edit intent: clarity
Original: The reproduction and replication of novel scientific results has become a major issue for a number of  disciplines.
Revised: The reproduction and replication of novel scientific results has become a major issue for a number of scientific disciplines.
Edit intent: clarity
Original:  In computer science and related  disciplines such as systems biology, the issues closely revolve around the ability to implement novel algorithms and approaches.
Revised:  In computer science and related computational disciplines such as systems biology, the issues closely revolve around the ability to implement novel algorithms and approaches.
Edit intent: clarity
Original:  Taking an approach from the literature and applying it in a new codebase frequently requires local knowledge missing from the published manuscripts and project websites.
Revised:  Taking an approach from the literature and applying it to a new codebase frequently requires local knowledge missing from the published manuscripts and project websites.
Edit intent: fluency
Original:  Alongside this issue, benchmarking, and the development of fair , and widely available  benchmark sets present another barrier.
Revised:  Alongside this issue, benchmarking, and the development of fair --- and widely available benchmark sets present another barrier.
Edit intent: fluency
Original:  Alongside this issue, benchmarking, and the development of fair , and widely available  benchmark sets present another barrier.
Revised:  Alongside this issue, benchmarking, and the development of fair , and widely available --- benchmark sets present another barrier.
Edit intent: fluency
Original: Deep within the networks of distributed systems often contain anomalies that affect its efficiency and performance.
Revised: Deep within the networks of distributed systems , one often finds anomalies that affect its efficiency and performance.
Edit intent: clarity
Original: Deep within the networks of distributed systems often contain anomalies that affect its efficiency and performance.
Revised: Deep within the networks of distributed systems often contain anomalies that affect their efficiency and performance.
Edit intent: fluency