wanyu/IteraTeR_v2 huggingface dataset:
Original:  as encoded in the epidemic threshold parameter . Despite the great interest of the problem for the physics, applied mathematics,  and epidemiology communities, its complete theoretical understanding still represents a challenge and is currently limited to the cases where the time-scale separation between the spreading process and the network time-variation holds, or to specific temporal network models.
Revised:  as encoded in the epidemic threshold . Despite the great interest of the problem for the physics, applied mathematics, and epidemiology communities, its complete theoretical understanding still represents a challenge and is currently limited to the cases where the time-scale separation between the spreading process and the network time-variation holds, or to specific temporal network models.
Edit intent: clarity
Original:  as encoded in the epidemic threshold parameter . Despite the great interest of the problem for the physics, applied mathematics,  and epidemiology communities, its complete theoretical understanding still represents a challenge and is currently limited to the cases where the time-scale separation between the spreading process and the network time-variation holds, or to specific temporal network models.
Revised:  as encoded in the epidemic threshold parameter . Despite the great interest in the problem for the physics, applied mathematics, and epidemiology communities, its complete theoretical understanding still represents a challenge and is currently limited to the cases where the time-scale separation between the spreading process and the network time-variation holds, or to specific temporal network models.
Edit intent: fluency
Original:  as encoded in the epidemic threshold parameter . Despite the great interest of the problem for the physics, applied mathematics,  and epidemiology communities, its complete theoretical understanding still represents a challenge and is currently limited to the cases where the time-scale separation between the spreading process and the network time-variation holds, or to specific temporal network models.
Revised:  as encoded in the epidemic threshold parameter . Despite the great interest of the problem for the physics, applied mathematics, and epidemiology communities, a full theoretical understanding is still missing and currently limited to the cases where the time-scale separation between the spreading process and the network time-variation holds, or to specific temporal network models.
Edit intent: clarity
Original:  as encoded in the epidemic threshold parameter . Despite the great interest of the problem for the physics, applied mathematics,  and epidemiology communities, its complete theoretical understanding still represents a challenge and is currently limited to the cases where the time-scale separation between the spreading process and the network time-variation holds, or to specific temporal network models.
Revised:  as encoded in the epidemic threshold parameter . Despite the great interest of the problem for the physics, applied mathematics, and epidemiology communities, its complete theoretical understanding still represents a challenge and is currently limited to the cases where the time-scale separation holds between spreading and network dynamics or to specific temporal network models.
Edit intent: clarity
Original:  Here we introduce a Markov chain description of the Susceptible-Infectious-Susceptible process on a generic temporal networkand we adopt a multi-layer perspectiveto analytically derive its epidemic threshold .
Revised:  We consider a Markov chain description of the Susceptible-Infectious-Susceptible process on a generic temporal networkand we adopt a multi-layer perspectiveto analytically derive its epidemic threshold .
Edit intent: clarity
Original:  Its application to a set of time-varying network models and empirical networks and the comparison with stochastic numerical simulations show that the proposed analytical approach is accurate and general.
Revised:  Its application to a set of temporal models and empirical networks and the comparison with stochastic numerical simulations show that the proposed analytical approach is accurate and general.
Edit intent: clarity
Original:  This result is of fundamental and practical interest as the introduced framework provides the basis for new analytical understandings of the interplay between temporal networks and spreading dynamics.
Revised:  This result is of fundamental and practical interest , as it offers novel understanding of the interplay between temporal networks and spreading dynamics.
Edit intent: clarity
Original: In this paper , author will discuss a practical problem Urban Traffic with graph theory algorithms .
Revised: This paper will contribute to a practical problem Urban Traffic with graph theory algorithms .
Edit intent: clarity
Original: In this paper , author will discuss a practical problem Urban Traffic with graph theory algorithms .
Revised: In this paper , author will discuss a practical problem , Urban Traffic .
Edit intent: coherence
Original:  We will study those features, and try to simplify the complexity of this dynamic system.
Revised:  We will investigate those features, and try to simplify the complexity of this dynamic system.
Edit intent: clarity
Original:  We will study those features, and try to simplify the complexity of this dynamic system.
Revised:  We will study those features, try to simplify the complexity of this dynamic system.
Edit intent: coherence
Original:  We will study those features, and try to simplify the complexity of this dynamic system.
Revised:  We will study those features, and try to simplify the complexity and formulize this dynamic system.
Edit intent: clarity
Original:  These contents mainly contain how to analyze a decivion problem with Combinatorial Formula and graph theory algorithms , how to optimize our strategy for feasible solution with other method of Computer Science.
Revised:  These contents mainly contain how to analyze a decision problem with combinatorial method and graph theory algorithms , how to optimize our strategy for feasible solution with other method of Computer Science.
Edit intent: fluency
Original:  These contents mainly contain how to analyze a decivion problem with Combinatorial Formula and graph theory algorithms , how to optimize our strategy for feasible solution with other method of Computer Science.
Revised:  These contents mainly contain how to analyze a decivion problem with Combinatorial Formula and graph theory algorithms ; how to optimize our strategy for feasible solution with other method of Computer Science.
Edit intent: fluency
Original:  These contents mainly contain how to analyze a decivion problem with Combinatorial Formula and graph theory algorithms , how to optimize our strategy for feasible solution with other method of Computer Science.
Revised:  These contents mainly contain how to analyze a decivion problem with Combinatorial Formula and graph theory algorithms , how to optimize our strategy to gain a feasible solution through employing other principles of Computer Science.
Edit intent: clarity
Original: Recent work by Lackner (2014) presents a model for the single-peaked consistency of incomplete preference orders.
Revised: It is well known that single-peaked consistency of incomplete preference orders.
Edit intent: clarity
Original:  The work shows that the single-peaked consistency of weak orders is in P if they contain an implicitly specified total order.
Revised:  The work shows that the single-peaked consistency for weak orders is in P if they contain an implicitly specified total order.
Edit intent: fluency
Original:  We show in this paper that the general case is in P by a transformation to the problem of determining if a 0-1 matrix has the property of consecutive-ones in rows.
Revised:  We show in this paper that the general case is in P by a transformation to the problem of determining if a 0-1 matrix has the property of consecutive ones in rows.
Edit intent: fluency
Original:  We show that single-peaked consistency for weak orders is in P for the three different variants of single-peakedness for weak orders.
Revised:  We show that single-peaked consistency for weak orders is in P for three different variants of single-peakedness for weak orders.
Edit intent: clarity
Original:  Specifically, we consider Black's original definition  for weak orders (Black 1948), single-plateaued preferences (Black 1958) , and the existential model recently introduced by Lackner (2014) .
Revised:  Specifically, we consider Black's original definition for weak orders , Black's definition of single-plateaued preferences (Black 1958) , and the existential model recently introduced by Lackner (2014) .
Edit intent: clarity
Original:  Specifically, we consider Black's original definition  for weak orders (Black 1948), single-plateaued preferences (Black 1958) , and the existential model recently introduced by Lackner (2014) .
Revised:  Specifically, we consider Black's original definition for weak orders (Black 1948), single-plateaued preferences , and the existential model recently introduced by Lackner (2014) .
Edit intent: coherence
Original:  Specifically, we consider Black's original definition  for weak orders (Black 1948), single-plateaued preferences (Black 1958) , and the existential model recently introduced by Lackner (2014) .
Revised:  Specifically, we consider Black's original definition for weak orders (Black 1948), single-plateaued preferences (Black 1958) , and the existential model recently introduced by Lackner .
Edit intent: clarity
Original:  We accomplish this by transforming each of these single-peaked consistency problems to the problem of determining if a 0-1 matrix has the property of consecutive ones in rows .
Revised:  We accomplish our results by transforming each of these single-peaked consistency problems to the problem of determining if a 0-1 matrix has the property of consecutive ones in rows .
Edit intent: clarity
Original:  We accomplish this by transforming each of these single-peaked consistency problems to the problem of determining if a 0-1 matrix has the property of consecutive ones in rows .
Revised:  We accomplish this by transforming each of these single-peaked consistency problems to the problem of determining if a 0-1 matrix has the consecutive ones property .
Edit intent: clarity
Original:  We show that high-order or spectral accuracy can then be recovered by simply adding to the Lagrange interpolation formula a linear combination of the jumps.
Revised:  We show that high-order accuracy can be recovered by simply adding to the Lagrange interpolation formula a linear combination of the jumps.
Edit intent: clarity
Original:  We show that high-order or spectral accuracy can then be recovered by simply adding to the Lagrange interpolation formula a linear combination of the jumps.
Revised:  We show that high-order or spectral accuracy can then be recovered by adding to the Lagrange interpolation formula a linear combination of the jumps.
Edit intent: clarity
Original:  Equipping these systems with the possibility of testing regular properties on the contents of channels makes verification undecidable.
Revised:  Equipping these systems with the possibility of testing regular properties on the contents of channels makes it undecidable.
Edit intent: clarity
Original:  We propose an algorithm (shared information metric) that corrects for the biases and the resulting improved performance of the algorithm demonstrates the need to take due consideration of this issue in different applications .
Revised:  We propose an algorithm (shared information metric) that corrects for the biases and the resulting improved performance of the algorithm demonstrates the need to take due consideration of this issue in different contexts .
Edit intent: clarity
Original: We show that Firestone (2014) contains numerous errors in the application of past research.
Revised:  Firestone (2014) contains numerous errors in the application of past research.
Edit intent: coherence
Original:  F14 overestimates likely nitrate and 14C production from moderately nearby supernovae by about four orders of magnitude.
Revised:  The paper overestimates likely nitrate and 14C production from moderately nearby supernovae by about four orders of magnitude.
Edit intent: clarity
Original:  The task of entity disambiguation partitions the records belonging to multiple person with the objective that each decomposed partition is composed of records of a unique person.
Revised:  The task of entity disambiguation partitions the records belonging to multiple persons with the objective that each decomposed partition is composed of records of a unique person.
Edit intent: fluency
Original:  Our method is non-intrusive of privacy as it uses only the timestamped graph topology of an anonymized network.
Revised:  Our method is non-intrusive of privacy as it uses only the time-stamped graph topology of an anonymized network.
Edit intent: fluency
Original:  While the new attack does not challenge the unconditional security of the KLJN scheme, due to its more favorable properties for Eve, it requires higher requirements for the security/privacy enhancing protocol than any earlier versions.
Revised:  While the new attack does not challenge the unconditional security of the KLJN scheme, but it puts more stringent demands on the security/privacy enhancing protocol than any earlier versions.
Edit intent: clarity
Original:  In this paper, we initiate the study of tensor network non-zero testing (TNZ): Given a tensor network T, does T represent a non-zero vector?
Revised:  In this paper, we study the task of tensor network non-zero testing (TNZ): Given a tensor network T, does T represent a non-zero vector?
Edit intent: clarity
Original: In a recent work of Bei, Chen and Zhang (STOC 2013), a trial and error model of computing was introduced , and applied to some constraint satisfaction problems.
Revised: In 2013 Bei, Chen and Zhang (STOC 2013), a trial and error model of computing was introduced , and applied to some constraint satisfaction problems.
Edit intent: clarity
Original: In a recent work of Bei, Chen and Zhang (STOC 2013), a trial and error model of computing was introduced , and applied to some constraint satisfaction problems.
Revised: In a recent work of Bei, Chen and Zhang introduced a trial and error model of computing was introduced , and applied to some constraint satisfaction problems.
Edit intent: coherence
Original: In a recent work of Bei, Chen and Zhang (STOC 2013), a trial and error model of computing was introduced , and applied to some constraint satisfaction problems.
Revised: In a recent work of Bei, Chen and Zhang (STOC 2013), a trial and error model of computing , and applied to some constraint satisfaction problems.
Edit intent: coherence
Original:  In this paper we initiate a systematic {\em  study of constraint satisfaction problems in the trial and error model.
Revised:  In this paper we initiate a {\em study of constraint satisfaction problems in the trial and error model.
Edit intent: clarity
Original:  Our main contribution is to develop a transfer theorem \emph{ for each type of the revealing oracle, under a broad class of parameters.
Revised:  Our main contribution is to develop a \emph{ for each type of the revealing oracle, under a broad class of parameters.
Edit intent: clarity
Original: We show that No unbounded profit with bounded risk (NUPBR) implies predictable uniform tightness (P-UT), a boundedness property in the Emery topology which has been introduced by C. ~Stricker ~ S:85. Combining this insight with well known results from J. ~ M\'emin and L. ~S\l{ } MS:91 leads to a short variant of the proof of the fundamental theorem of asset pricing initially proved by F. ~ Delbaen and W. ~Schachermayer ~ DS:94.
Revised: We show that No unbounded profit with bounded risk (NUPBR) implies predictable uniform tightness (P-UT), a boundedness property in the Emery topology which has been introduced by C. Stricker S:85. Combining this insight with well known results from J. ~ M\'emin and L. ~S\l{ } MS:91 leads to a short variant of the proof of the fundamental theorem of asset pricing initially proved by F. ~ Delbaen and W. ~Schachermayer ~ DS:94.
Edit intent: fluency
Original: We show that No unbounded profit with bounded risk (NUPBR) implies predictable uniform tightness (P-UT), a boundedness property in the Emery topology which has been introduced by C. ~Stricker ~ S:85. Combining this insight with well known results from J. ~ M\'emin and L. ~S\l{ } MS:91 leads to a short variant of the proof of the fundamental theorem of asset pricing initially proved by F. ~ Delbaen and W. ~Schachermayer ~ DS:94.
Revised: We show that No unbounded profit with bounded risk (NUPBR) implies predictable uniform tightness (P-UT), a boundedness property in the Emery topology which has been introduced by C. ~Stricker ~ S:85. Combining this insight with well known results from J. M\'emin and L. ~S\l{ } MS:91 leads to a short variant of the proof of the fundamental theorem of asset pricing initially proved by F. ~ Delbaen and W. ~Schachermayer ~ DS:94.
Edit intent: fluency
Original: We show that No unbounded profit with bounded risk (NUPBR) implies predictable uniform tightness (P-UT), a boundedness property in the Emery topology which has been introduced by C. ~Stricker ~ S:85. Combining this insight with well known results from J. ~ M\'emin and L. ~S\l{ } MS:91 leads to a short variant of the proof of the fundamental theorem of asset pricing initially proved by F. ~ Delbaen and W. ~Schachermayer ~ DS:94.
Revised: We show that No unbounded profit with bounded risk (NUPBR) implies predictable uniform tightness (P-UT), a boundedness property in the Emery topology which has been introduced by C. ~Stricker ~ S:85. Combining this insight with well known results from J. ~ M\'emin and L. S } MS:91 leads to a short variant of the proof of the fundamental theorem of asset pricing initially proved by F. ~ Delbaen and W. ~Schachermayer ~ DS:94.
Edit intent: coherence
Original: We show that No unbounded profit with bounded risk (NUPBR) implies predictable uniform tightness (P-UT), a boundedness property in the Emery topology which has been introduced by C. ~Stricker ~ S:85. Combining this insight with well known results from J. ~ M\'emin and L. ~S\l{ } MS:91 leads to a short variant of the proof of the fundamental theorem of asset pricing initially proved by F. ~ Delbaen and W. ~Schachermayer ~ DS:94.
Revised: We show that No unbounded profit with bounded risk (NUPBR) implies predictable uniform tightness (P-UT), a boundedness property in the Emery topology which has been introduced by C. ~Stricker ~ S:85. Combining this insight with well known results from J. ~ M\'emin and L. ~S\l{ \l} MS:91 leads to a short variant of the proof of the fundamental theorem of asset pricing initially proved by F. ~ Delbaen and W. ~Schachermayer ~ DS:94.
Edit intent: fluency
Original: We show that No unbounded profit with bounded risk (NUPBR) implies predictable uniform tightness (P-UT), a boundedness property in the Emery topology which has been introduced by C. ~Stricker ~ S:85. Combining this insight with well known results from J. ~ M\'emin and L. ~S\l{ } MS:91 leads to a short variant of the proof of the fundamental theorem of asset pricing initially proved by F. ~ Delbaen and W. ~Schachermayer ~ DS:94.
Revised: We show that No unbounded profit with bounded risk (NUPBR) implies predictable uniform tightness (P-UT), a boundedness property in the Emery topology which has been introduced by C. ~Stricker ~ S:85. Combining this insight with well known results from J. ~ M\'emin and L. ~S\l{ } MS:91 leads to a short variant of the proof of the fundamental theorem of asset pricing initially proved by F. Delbaen and W. ~Schachermayer ~ DS:94.
Edit intent: fluency
Original: We show that No unbounded profit with bounded risk (NUPBR) implies predictable uniform tightness (P-UT), a boundedness property in the Emery topology which has been introduced by C. ~Stricker ~ S:85. Combining this insight with well known results from J. ~ M\'emin and L. ~S\l{ } MS:91 leads to a short variant of the proof of the fundamental theorem of asset pricing initially proved by F. ~ Delbaen and W. ~Schachermayer ~ DS:94.
Revised: We show that No unbounded profit with bounded risk (NUPBR) implies predictable uniform tightness (P-UT), a boundedness property in the Emery topology which has been introduced by C. ~Stricker ~ S:85. Combining this insight with well known results from J. ~ M\'emin and L. ~S\l{ } MS:91 leads to a short variant of the proof of the fundamental theorem of asset pricing initially proved by F. ~ Delbaen and W. Schachermayer DS:94.
Edit intent: fluency
Original:  The results are formulated in the general setting of admissible portfolio wealth processes as laid down by Y. ~Kabanov in ~ kab:97.
Revised:  The results are formulated in the general setting of admissible portfolio wealth processes as laid down by Y. Kabanov in kab:97.
Edit intent: fluency
Original:  Deriving efficient strategies jointly bringing into play the primal and the dual problems is however a more recent idea which has generated many important new contributions in the last years.
Revised:  Deriving efficient strategies which jointly brings into play the primal and the dual problems is however a more recent idea which has generated many important new contributions in the last years.
Edit intent: fluency
Original:  Using the experimental data to parameterise our model , we demonstrate that the model replicates both the qualitative form of the time-dependent data and quantitative statistics such as the mean switching time and stationary probability distribution .
Revised:  Using the experimental data to parameterise our model , we demonstrate that the model replicates both the qualitative form of the time-dependent data and quantitative statistics such as the mean switching times between states .
Edit intent: clarity
Original:  We develop a general theory for the fixation probability of a mutant in a population of wild-types, and for  unconditional and conditional mean fixation times.
Revised:  We develop a general theory for the fixation probability of a mutant in a population of wild-types, and for unconditional and conditional fixation times.
Edit intent: clarity
Original:  We also investigate stationary distributions of the population when mutations are more frequent .
Revised:  We also investigate stationary distributions when mutations are more frequent .
Edit intent: clarity
Original:  The levels of the Thermodynamic-RAM technology stack include the memristor, Knowm-Synapse, AHaH Node , kT-RAM, kT-RAM instruction set, sparse spike encoding, kT-RAM emulator, and SENSE Server .
Revised:  The levels of the Thermodynamic-RAM technology stack include the memristor, synapse, AHaH node , kT-RAM, kT-RAM instruction set, sparse spike encoding, kT-RAM emulator, and SENSE Server .
Edit intent: clarity
Original:  The levels of the Thermodynamic-RAM technology stack include the memristor, Knowm-Synapse, AHaH Node , kT-RAM, kT-RAM instruction set, sparse spike encoding, kT-RAM emulator, and SENSE Server .
Revised:  The levels of the Thermodynamic-RAM technology stack include the memristor, Knowm-Synapse, AHaH Node , kT-RAM, instruction set, sparse spike encoding, kT-RAM emulator, and SENSE Server .
Edit intent: fluency
Original:  The levels of the Thermodynamic-RAM technology stack include the memristor, Knowm-Synapse, AHaH Node , kT-RAM, kT-RAM instruction set, sparse spike encoding, kT-RAM emulator, and SENSE Server .
Revised:  The levels of the Thermodynamic-RAM technology stack include the memristor, Knowm-Synapse, AHaH Node , kT-RAM, kT-RAM instruction set, sparse spike encoding, kT-RAM emulator, and SENSE server .
Edit intent: fluency
Original:  We find strong agreement with available single molecule manipulation experiments  .
Revised:  We compare our predictions with available single molecule manipulation experiments .
Edit intent: clarity