wanyu/IteraTeR_v2 huggingface dataset:
Original:  A community-detection algorithm for formalising this perspective will be proposed and applied to the co-authorship network of the scientists that submitted to the 2001 Research Assessment Exercise in Business and Management in the UK . While results only partially support research-based homophily, they indicate that scientists use status positions for discriminating between potential partners by selecting collaborators from institutions with a rating similar to their own.
Revised:  A community-detection algorithm for formalising this perspective will be proposed and applied to the co-authorship network of the scientists that submitted in Business and Management in the UK . While results only partially support research-based homophily, they indicate that scientists use status positions for discriminating between potential partners by selecting collaborators from institutions with a rating similar to their own.
Edit intent: clarity
Original:  A community-detection algorithm for formalising this perspective will be proposed and applied to the co-authorship network of the scientists that submitted to the 2001 Research Assessment Exercise in Business and Management in the UK . While results only partially support research-based homophily, they indicate that scientists use status positions for discriminating between potential partners by selecting collaborators from institutions with a rating similar to their own.
Revised:  A community-detection algorithm for formalising this perspective will be proposed and applied to the co-authorship network of the scientists that submitted to the 2001 Research Assessment Exercise in Business and Management in the 2001 UK RAE . While results only partially support research-based homophily, they indicate that scientists use status positions for discriminating between potential partners by selecting collaborators from institutions with a rating similar to their own.
Edit intent: clarity
Original:  J. ~C. ~ Lagarias and Y. ~ Wang conjectured in 1995 that every finite set of real d \times d matrices satisfies the finiteness property.
Revised:  J. C. Lagarias and Y. ~ Wang conjectured in 1995 that every finite set of real d \times d matrices satisfies the finiteness property.
Edit intent: fluency
Original:  J. ~C. ~ Lagarias and Y. ~ Wang conjectured in 1995 that every finite set of real d \times d matrices satisfies the finiteness property.
Revised:  J. ~C. ~ Lagarias and Y. Wang conjectured in 1995 that every finite set of real d \times d matrices satisfies the finiteness property.
Edit intent: fluency
Original:  However, T. ~ Bousch and J. ~ Mairesse proved in 2002 that counterexamples to the finiteness conjecture exist, showing in particular that there exists a family of pairs of 2 \times 2 matrices which contains a counterexample.
Revised:  However, T. Bousch and J. ~ Mairesse proved in 2002 that counterexamples to the finiteness conjecture exist, showing in particular that there exists a family of pairs of 2 \times 2 matrices which contains a counterexample.
Edit intent: fluency
Original:  However, T. ~ Bousch and J. ~ Mairesse proved in 2002 that counterexamples to the finiteness conjecture exist, showing in particular that there exists a family of pairs of 2 \times 2 matrices which contains a counterexample.
Revised:  However, T. ~ Bousch and J. Mairesse proved in 2002 that counterexamples to the finiteness conjecture exist, showing in particular that there exists a family of pairs of 2 \times 2 matrices which contains a counterexample.
Edit intent: fluency
Original:  Similar results were subsequently given by V. ~D. ~ Blondel, J. ~ Theys and A. ~A. ~ Vladimirov and by V. ~S. ~ Kozyakin, but no explicit counterexample to the finiteness conjecture has so far been given.
Revised:  Similar results were subsequently given by V. D. Blondel, J. ~ Theys and A. ~A. ~ Vladimirov and by V. ~S. ~ Kozyakin, but no explicit counterexample to the finiteness conjecture has so far been given.
Edit intent: fluency
Original:  Similar results were subsequently given by V. ~D. ~ Blondel, J. ~ Theys and A. ~A. ~ Vladimirov and by V. ~S. ~ Kozyakin, but no explicit counterexample to the finiteness conjecture has so far been given.
Revised:  Similar results were subsequently given by V. ~D. ~ Blondel, J. Theys and A. ~A. ~ Vladimirov and by V. ~S. ~ Kozyakin, but no explicit counterexample to the finiteness conjecture has so far been given.
Edit intent: fluency
Original:  Similar results were subsequently given by V. ~D. ~ Blondel, J. ~ Theys and A. ~A. ~ Vladimirov and by V. ~S. ~ Kozyakin, but no explicit counterexample to the finiteness conjecture has so far been given.
Revised:  Similar results were subsequently given by V. ~D. ~ Blondel, J. ~ Theys and A. A. Vladimirov and by V. ~S. ~ Kozyakin, but no explicit counterexample to the finiteness conjecture has so far been given.
Edit intent: fluency
Original:  Similar results were subsequently given by V. ~D. ~ Blondel, J. ~ Theys and A. ~A. ~ Vladimirov and by V. ~S. ~ Kozyakin, but no explicit counterexample to the finiteness conjecture has so far been given.
Revised:  Similar results were subsequently given by V. ~D. ~ Blondel, J. ~ Theys and A. ~A. ~ Vladimirov and by V. S. Kozyakin, but no explicit counterexample to the finiteness conjecture has so far been given.
Edit intent: fluency
Original:  Namely, for the set %DIFDELCMD < \[ A_{\alpha_*}:= %DIFDELCMD < \left\{\left(array{cc}1&1\\0&1array\right), %DIFDELCMD < \alpha_*\left(\begin{array}{cc}1&0\\1&1\end{array}\right)\right\} \]%%% \[ \mathsf{A}_{\alpha_*}:= \{({cc}1&1\\0&1), \alpha_*({cc}1&0\\1&1)\}\] we give an explicit value of %DIFDELCMD < \[\alpha_* \simeq %DIFDELCMD < 0.749326546330367557943961948091344672091327370236064317358024\ldots \] %%%  such that \mathsf{A}_{\alpha_*} does not satisfy the finiteness property.
Revised:  Namely, for the set %DIFDELCMD < \[ A_{\alpha_*}:= %DIFDELCMD < \left\{\left(array{cc}1&1\\0&1array\right), %DIFDELCMD < \alpha_*\left(\begin{array}{cc}1&0\\1&1\end{array}\right)\right\} \]%%% \[ \mathsf{A}_{\alpha_*}:= \{({cc}1&1\\0&1), \alpha_*({cc}1&0\\1&1)\}\] we give an explicit value of %DIFDELCMD < \[\alpha_* \simeq %DIFDELCMD < 0.749326546330367557943961948091344672091327370236064317358024\ldots \] %%% \alpha_* \simeq 0.749326546330367557943961948091344672091327370236064317358024... such that \mathsf{A}_{\alpha_*} does not satisfy the finiteness property.
Edit intent: coherence
Original:  We examine the stability of the good-deal pricing bounds for the European call option when we change the market model's parameters .
Revised:  We examine the stability of these bounds when we change the market model's parameters .
Edit intent: clarity
Original:  We find that the pricing bounds depend strongly on the market parameters .
Revised:  We find that the pricing bounds depend strongly on the choice of the generator .
Edit intent: clarity
Original:  We suppose that users transmit data in the network at their maximum throughput and some erasure codes  make the transmission robust to packet loss .
Revised:  We suppose that users transmit data in the network at their maximum throughput and some erasure codes are used to make the transmission robust to packet loss .
Edit intent: clarity
Original:  We suppose that users transmit data in the network at their maximum throughput and some erasure codes  make the transmission robust to packet loss .
Revised:  We suppose that users transmit data in the network at their maximum throughput and some erasure codes make the transmission robust to packet losses .
Edit intent: fluency
Original:  Finally, the asymptotic stability of those processes is analyzed when the maximum throughput of the users decreases to 0.
Revised:  Finally, the asymptotic stability of those processes is analyzed when the access rate of the users decreases to 0.
Edit intent: clarity
Original:  An appropriate scaling is introduced and used to prove that the stability region of thoses networks is asymptotically maximized.
Revised:  An appropriate scaling is introduced and used to prove that the stability region of those networks is asymptotically maximized.
Edit intent: clarity
Original:  The presented method solves a node discovery problem to identify the nodes within a given dataset which are directly influenced by an unknown neighboring nodeduring the spread .
Revised:  This study addresses a node discovery problem to identify the nodes within a given dataset which are directly influenced by an unknown neighboring nodeduring the spread .
Edit intent: clarity
Original:  The presented method solves a node discovery problem to identify the nodes within a given dataset which are directly influenced by an unknown neighboring nodeduring the spread .
Revised:  The presented method solves a node discovery problem . Solving the problem means discriminating between neighboring nodes which are connected to and directly influenced by an unknown neighboring nodeduring the spread .
Edit intent: clarity
Original:  The dataset is either the time sequence data on the number of infectious persons or new cases in the early growth phase of an infectious disease outbreak.
Revised:  The dataset is the time sequence data on the number of infectious persons or new cases in the early growth phase of an infectious disease outbreak.
Edit intent: coherence
Original:  The dataset is either the time sequence data on the number of infectious persons or new cases in the early growth phase of an infectious disease outbreak.
Revised:  The dataset is either the time sequence data on the number of patients in the early growth phase of an infectious disease outbreak.
Edit intent: clarity
Original:  The method is tested with  computationally synthesized datasets and the WHO dataset on SARS outbreak.
Revised:  The method is tested with a number of computationally synthesized datasets and the WHO dataset on SARS outbreak.
Edit intent: clarity
Original: Stochasticity and spatial heterogeneity are of great interest recently in studying the spread of an infectious disease . Populations in a combination of epidemiological compartment models and a meta-population network model are described by stochastic differential equations.
Revised: Node discovery for the spread of an infectious disease . Populations in a combination of epidemiological compartment models and a meta-population network model are described by stochastic differential equations.
Edit intent: clarity
Original:  Solving the problem means discriminating between neighboring nodes which are connected to and directly influenced by (and influence as well) a missing influential spreader node, and non-neighboring nodes in a given dataset.
Revised:  Solving the problem means discriminating between neighboring nodes which are neighboring to a missing disease spreader node, and non-neighboring nodes in a given dataset.
Edit intent: clarity
Original:  The dataset is the time sequence data on the number of patients in the early growth phase of an infectious disease outbreak.
Revised:  The dataset is the number of patients in the early growth phase of an infectious disease outbreak.
Edit intent: clarity
Original:  In this paper we reconsider a simple phenomenological model which reproduces the behaviour of a molecule of double stranded DNA (dsDNA) under tension.
Revised:  In this paper we reconsider a simple phenomenological model which reproduces the behaviour of a molecule of double stranded DNA under tension.
Edit intent: clarity
Original: The notion of autocatalysis actually covers a large variety of mechanistic realisations of chemical systems .
Revised: Autocatalysis is a fundamental concept, used in a wide range of domains .
Edit intent: clarity
Original:  In addition, we have coNP-completeness results for the emptiness problem and the inclusion problem over deterministic partially ordered two-way B\"uchi automata.
Revised:  In addition, we have coNP-completeness of the emptiness problem and the inclusion problem over deterministic partially ordered two-way B\"uchi automata.
Edit intent: clarity
Original:  In addition, we have coNP-completeness results for the emptiness problem and the inclusion problem over deterministic partially ordered two-way B\"uchi automata.
Revised:  In addition, we have coNP-completeness results for the emptiness problem and the inclusion problem for deterministic partially ordered two-way B\"uchi automata.
Edit intent: clarity
Original: The evolution of protein-protein interactions over time has led to a complex network whose character is modular in the cellular function and highly correlated in its connectivity.
Revised: Cellular functions are based on the complex interplay of proteins, therefore the structure and dynamics of these protein-protein interactions over time has led to a complex network whose character is modular in the cellular function and highly correlated in its connectivity.
Edit intent: clarity
Original:  For instance, if we naively recompute the PageRanks as each edge arrives, the simple power iteration method needs \Omega( \frac{m^2{\log(1/(1-\epsilon))}} {\ln(1/(1-\epsilon))}} ) total time and the Monte Carlo method needs O(mn/\epsilon) total time;
Revised:  For instance, if we naively recompute the PageRanks as each edge arrives, the simple power iteration method needs \Omega( \frac{m^2{\log(1/(1-\epsilon))}} \frac{m^2{\ln(1/(1-\epsilon))}} ) total time and the Monte Carlo method needs O(mn/\epsilon) total time;
Edit intent: fluency
Original:  <br /> We first show a "molecular computability theoretic" result: there is an infinite shape S that is uniquely assembled by a tile system but not by any deterministic tile system.
Revised:  We first show a "molecular computability theoretic" result: there is an infinite shape S that is uniquely assembled by a tile system but not by any deterministic tile system.
Edit intent: fluency
Original:  In contrast, the problem of finding the minimum number of *deterministic* tile types that uniquely assemble a shape was shown to be NP-complete by Adleman, Cheng, Goel, Huang, Kempe, Moisset de Espan\'es, and Rothemund (Combinatorial Optimization Problems in Self-Assembly, STOC 2002).
Revised:  In contrast, the problem of finding the minimum number of deterministic tile types that uniquely assemble a shape was shown to be NP-complete by Adleman, Cheng, Goel, Huang, Kempe, Moisset de Espan\'es, and Rothemund (Combinatorial Optimization Problems in Self-Assembly, STOC 2002).
Edit intent: fluency
Original:  <br /> The conclusion is that nondeterminism confers extra power to assemble a shape from a small tile system, but unless the polynomial hierarchy collapses, it is computationally more difficult to exploit this power by finding the size of the smallest tile system, compared to finding the size of the smallest deterministic tile system.
Revised:  The conclusion is that nondeterminism confers extra power to assemble a shape from a small tile system, but unless the polynomial hierarchy collapses, it is computationally more difficult to exploit this power by finding the size of the smallest tile system, compared to finding the size of the smallest deterministic tile system.
Edit intent: coherence
Original:  The techniques are related to (i) the construction of a Poincare box as a classical physical random number generator (akin to a quantum Born box), and (ii) the conceivable capability of classical physical systems to "compute the hard (or even un)computable " by measuring observables which correspond to computationally hard (or even un)computable problems.
Revised:  The techniques are related to (i) the construction of a Poincare box as a classical physical random number generator (akin to a quantum Born box), and (ii) the conceivable capability of classical physical systems to "compute the hard or even the incomputable " by measuring observables which correspond to computationally hard (or even un)computable problems.
Edit intent: fluency
Original:  The techniques are related to (i) the construction of a Poincare box as a classical physical random number generator (akin to a quantum Born box), and (ii) the conceivable capability of classical physical systems to "compute the hard (or even un)computable " by measuring observables which correspond to computationally hard (or even un)computable problems.
Revised:  The techniques are related to (i) the construction of a Poincare box as a classical physical random number generator (akin to a quantum Born box), and (ii) the conceivable capability of classical physical systems to "compute the hard (or even un)computable " by measuring observables which correspond to computationally hard or even incomputable problems.
Edit intent: fluency
Original:  We introduce a novel and general branching strategy that branches on the forbidden subgraphs of a relaxed class of graphs .
Revised:  We introduce a novel and general search strategy that branches on the forbidden subgraphs of a relaxed class of graphs .
Edit intent: clarity
Original:  We introduce a novel and general branching strategy that branches on the forbidden subgraphs of a relaxed class of graphs .
Revised:  We introduce a novel and general branching strategy that branches on the forbidden subgraphs of a graph class relaxation .
Edit intent: clarity
Original:  By using the class of P4-sparse graphs as the relaxed graph class, we obtain efficient bounded-search tree algorithms for several parameterized deletion problems.
Revised:  By using the class of P_4-sparse graphs as the relaxed graph class, we obtain efficient bounded-search tree algorithms for several parameterized deletion problems.
Edit intent: clarity
Original:  By using the class of P4-sparse graphs as the relaxed graph class, we obtain efficient bounded-search tree algorithms for several parameterized deletion problems.
Revised:  By using the class of P4-sparse graphs as the relaxed graph class, we obtain efficient bounded search tree algorithms for several parameterized deletion problems.
Edit intent: fluency
Original:  For the cograph edge-deletion problem and the trivially perfect edge-deletion problem, the branching strategy yields the first non-trivial bounded-search tree algorithms .
Revised:  We give the first non-trivial bounded search tree algorithms for the cograph edge-deletion problem and the trivially perfect edge-deletion problem, the branching strategy yields the first non-trivial bounded-search tree algorithms .
Edit intent: clarity
Original:  For the cograph edge-deletion problem and the trivially perfect edge-deletion problem, the branching strategy yields the first non-trivial bounded-search tree algorithms .
Revised:  For the cograph edge-deletion problem and the trivially perfect edge-deletion problems .
Edit intent: clarity
Original:  For the cograph vertex deletion problem, the running time of our simple bounded search algorithm matches those previously designed with the help of complicated case distinctions and non-trivial running time analysis [ 16 ] and computer-aided branching rules [ 7 ] 
Revised:  For the cograph vertex deletion problem, the running time of our simple bounded search algorithm matches those previously designed with the help of complicated case distinctions and non-trivial running time analysis [ 16 ] and computer-aided branching rules [ 7 ] .
Edit intent: fluency
Original:  This provides one more evidence of the ubiquity of Random Matrix Theory.
Edit intent: coherence
Original: In Graph Minors III, Robertson and Seymour write: "It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal - indeed, we have convinced ourselves that they differ by at most one . "  They never gave a proof of this.
Revised: In Graph Minors III, Robertson and Seymour write: "It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal - indeed, we have convinced ourselves that they differ by at most one " They never gave a proof of this.
Edit intent: fluency
Original: In Graph Minors III, Robertson and Seymour write: "It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal - indeed, we have convinced ourselves that they differ by at most one . "  They never gave a proof of this.
Revised: In Graph Minors III, Robertson and Seymour write: "It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal - indeed, we have convinced ourselves that they differ by at most one . " . They never gave a proof of this.
Edit intent: fluency
Original:  This paper considers a class of networks based around a new concept (the locale) that allow exact results to be derived for epidemic dynamics.
Revised:  This paper considers a class of networks based around a concept (the locale) that allow exact results to be derived for epidemic dynamics.
Edit intent: clarity
Original:  While there is no restriction on the motifs that can be found in such graphs, each node must be uniquely assigned to a generally clustered subgraph in this construction .
Revised:  While there is no restriction on the motifs that can be found in such graphs, each node must be uniquely assigned to a generally clustered subgraph to obtain analytic traction .
Edit intent: clarity
Original:  Saturated networks generalize normal networks by Gnacadja, atomic event-systems by Adleman et al. and constructive networks by Shinar et al.
Revised:  Saturated networks generalize normal networks by Gnacadja, atomic event-systems of Adleman et al. and constructive networks by Shinar et al.
Edit intent: clarity
Original:  We define "catalytic networks " as networks  with an essentially catalytic reaction pathway: one which is "on " in the presence of certain catalysts and "off " in their absence.
Revised:  We define "catalytic networks " as networks with an essentially catalytic reaction pathway: one which is on in the presence of certain catalysts and "off " in their absence.
Edit intent: fluency
Original:  We define "catalytic networks " as networks  with an essentially catalytic reaction pathway: one which is "on " in the presence of certain catalysts and "off " in their absence.
Revised:  We define "catalytic networks " as networks with an essentially catalytic reaction pathway: one which is "on " in the presence of certain catalysts and off in their absence.
Edit intent: fluency
Original:  We show that  synthetic DNA molecular circuits that have been shown to perform signal amplification and molecular logic happen to be examples of catalytic networks .
Revised:  We show that examples of catalytic networks include synthetic DNA molecular circuits that have been shown to perform signal amplification and molecular logic happen to be examples of catalytic networks .
Edit intent: clarity
Original:  We obtain new proofs for the persistence of atomic event-systems of Adleman et al., and normal networks of Gnacadja.
Revised:  Consequently, we obtain new proofs for the persistence of atomic event-systems of Adleman et al., and normal networks of Gnacadja.
Edit intent: coherence
Original:  We define " autocatalytic networks, " and conjecture that  weakly-reversible reaction networks have critical siphons if and only if they are autocatalytic.
Revised:  We define autocatalytic networks, " and conjecture that weakly-reversible reaction networks have critical siphons if and only if they are autocatalytic.
Edit intent: fluency
Original:  We define " autocatalytic networks, " and conjecture that  weakly-reversible reaction networks have critical siphons if and only if they are autocatalytic.
Revised:  We define " autocatalytic networks, and conjecture that weakly-reversible reaction networks have critical siphons if and only if they are autocatalytic.
Edit intent: fluency
Original:  We define " autocatalytic networks, " and conjecture that  weakly-reversible reaction networks have critical siphons if and only if they are autocatalytic.
Revised:  We define " autocatalytic networks, " and conjecture that a weakly-reversible reaction networks have critical siphons if and only if they are autocatalytic.
Edit intent: fluency