wanyu/IteraTeR_v2 huggingface dataset:
Original: Features of the CRISPR-Cas system, in which bacteria integrate small segments of phage genome (spacers) into their DNA to neutralize future attack, suggest its effect is not limited to individual bacteria but may control the fate and structure of whole populations.
Revised: Features of the CRISPR-Cas system, in which bacteria integrate small segments of phage genome (spacers) into their DNA to neutralize future attacks, suggest that its effect is not limited to individual bacteria but may control the fate and structure of whole populations.
Edit intent: fluency
Original:  a surprising prediction that we test with dynamic spacer-tracking data \mbox{ Paez-Espino2013 . This distribution depends on the state of the competing phage-bacteria population, which due to QS-based regulation may coexist in multiple stable states that vary significantly in their phage-to-bacterium ratio, an ecological measure of such systems.
Revised:  a surprising prediction that we test with dynamic spacer-tracking data \mbox{ Paez-Espino2013 . This distribution depends on the state of the competing phage-bacteria population, which due to QS-based regulation may coexist in multiple stable states that vary significantly in their phage-to-bacterium ratio, a widely used ecological measure to characterize microbial systems.
Edit intent: clarity
Original: We propose a dynamic model for the stability of a large financial network , which we formulate as a system of interacting diffusions on the positive half-line with an absorbing boundary at zero.
Revised: We propose a dynamic model for systemic risk in a large financial network , which we formulate as a system of interacting diffusions on the positive half-line with an absorbing boundary at zero.
Edit intent: clarity
Original: We propose a dynamic model for the stability of a large financial network , which we formulate as a system of interacting diffusions on the positive half-line with an absorbing boundary at zero.
Revised: We propose a dynamic model for the stability of a large financial system , which we formulate as a system of interacting diffusions on the positive half-line with an absorbing boundary at zero.
Edit intent: clarity
Original:  These diffusions represent the distances-to-default of the financial institutions in the network .
Revised:  These diffusions represent the distances-to-default of the financial institutions .
Edit intent: clarity
Original:  Moreover, we introduce an endogenous contagion mechanism whereby the default of one institution can lead to a drop in the distances-to-default of the other institutions.
Revised:  Moreover, we introduce an endogenous contagion mechanism whereby the default of one institution can cause a drop in the distances-to-default of the other institutions.
Edit intent: clarity
Original:  Depending on the realisations of the common noise and the strength of the mean reversion, this SPDE can exhibit rapid accelerations in the loss of mass at the boundary.
Revised:  Depending on the realizations of the common noise and the strength of the mean reversion, this SPDE can exhibit rapid accelerations in the loss of mass at the boundary.
Edit intent: fluency
Original:  Depending on the realisations of the common noise and the strength of the mean reversion, this SPDE can exhibit rapid accelerations in the loss of mass at the boundary.
Revised:  Depending on the realisations of the common noise and the strength of the mean reversion, the SPDE can exhibit rapid accelerations in the loss of mass at the boundary.
Edit intent: clarity
Original:  In other words,  there are events of small probability that  can give rise to systemic default cascades sparked by a devaluation of the common exposures and amplified by herd behaviour .
Revised:  In other words, there are events of small probability that can give rise to systemic default cascades .
Edit intent: clarity
Original: We propose a dynamic model for systemic risk in a large financial system , which we formulate as a system of interacting diffusions on the positive half-line with an absorbing boundary at zero .
Revised: We propose a dynamic model for systemic risk in a large financial system , which we derive from a system of interacting diffusions on the positive half-line with an absorbing boundary at zero .
Edit intent: clarity
Original: We propose a dynamic model for systemic risk in a large financial system , which we formulate as a system of interacting diffusions on the positive half-line with an absorbing boundary at zero .
Revised: We propose a dynamic model for systemic risk in a large financial system , which we formulate as a system of interacting diffusions on the positive half-line with an absorbing boundary at the origin .
Edit intent: clarity
Original:  In other words, sparked by a devaluation of the common exposures, there are events of small probability that, through amplification by herd behaviour, can give rise to systemic default cascades .
Revised:  In other words, the contagion mechanism can give rise to systemic default cascades .
Edit intent: clarity
Original:  In other words, sparked by a devaluation of the common exposures, there are events of small probability that, through amplification by herd behaviour, can give rise to systemic default cascades .
Revised:  In other words, sparked by a devaluation of the common exposures, there are events of small probability that, through amplification by herd behaviour, can give rise to periods of significant systemic default clustering .
Edit intent: clarity
Original:  A shift-rule receives a word as an argument and computes the digit that appears after it in the sequence.
Revised:  A shift-rule receives a word as an argument and computes the symbol that appears after it in the sequence.
Edit intent: clarity
Original:  We propose an extended notion we name a generalized-shift-rule, which receives a word, w, and an integer, c, and outputs the c digits that comes after w.
Revised:  We propose an extended notion we name a generalized-shift-rule, which receives a word, w, and an integer, c, and outputs the c symbols that comes after w.
Edit intent: clarity
Original: Index structures are one of the most important tools that DBAs leverage in order to improve the performance of analytics and transactional workloads.
Revised: Index structures are one of the most important tools that DBAs leverage to improve the performance of analytics and transactional workloads.
Edit intent: coherence
Original:  However, with the explosion of data that is constantly being generated in a wide variety of domains including autonomous vehicles, Internet of Things (IoT) devices, and E-commerce sites, building several indexes  can often become prohibitive and consume valuable system resources.
Revised:  However, building several indexes can often become prohibitive and consume valuable system resources.
Edit intent: coherence
Original:  However, with the explosion of data that is constantly being generated in a wide variety of domains including autonomous vehicles, Internet of Things (IoT) devices, and E-commerce sites, building several indexes  can often become prohibitive and consume valuable system resources.
Revised:  However, with the explosion of data that is constantly being generated in a wide variety of domains including autonomous vehicles, Internet of Things (IoT) devices, and E-commerce sites, building several indexes over large datasets can often become prohibitive and consume valuable system resources.
Edit intent: clarity
Original:  In fact, a recent study has shown that indexes created as part of the TPC-C benchmark can account for 55\% of the total memory available in a state-of-the-art in-memory DBMS.
Revised:  In fact, a recent study showed that indexes created as part of the TPC-C benchmark can account for 55\% of the total memory available in a state-of-the-art in-memory DBMS.
Edit intent: coherence
Original:  In fact, a recent study has shown that indexes created as part of the TPC-C benchmark can account for 55\% of the total memory available in a state-of-the-art in-memory DBMS.
Revised:  In fact, a recent study has shown that indexes created as part of the TPC-C benchmark can account for 55\% of the total memory available in a modern DBMS.
Edit intent: clarity
Original:  This overhead consumes valuable and expensive main memory, and limits the amount of space that a database has available to store new data or process existing data.
Revised:  This overhead consumes valuable and expensive main memory, and limits the amount of space available to store new data or process existing data.
Edit intent: clarity
Original:  To navigate this tradeoff, we provide a cost model that helps the DBA choose an appropriate error parameter given either (1) a lookup latency requirement (e.g., 500ns) or (2) a storage budget (e.g., 100MB).
Revised:  To navigate this tradeoff, we provide a cost model that helps determine an appropriate error parameter given either (1) a lookup latency requirement (e.g., 500ns) or (2) a storage budget (e.g., 100MB).
Edit intent: clarity
Original:  Using a variety of real-world datasets, we show that our index structure is able to provide performance that is comparable to full index structures while reducing the storage footprint by orders of magnitude.
Revised:  Using a variety of real-world datasets, we show that our index is able to provide performance that is comparable to full index structures while reducing the storage footprint by orders of magnitude.
Edit intent: clarity
Original:  The proposed algorithms prevent the untrusted cloud to know the database or the query while also preventing output size and access-pattern attacks.
Revised:  Our proposed algorithms prevent the untrusted cloud to know the database or the query while also preventing output size and access-pattern attacks.
Edit intent: fluency
Original:  The proposed algorithms prevent the untrusted cloud to know the database or the query while also preventing output size and access-pattern attacks.
Revised:  The proposed algorithms prevent the untrusted cloud from knowing the database or the query while also preventing output size and access-pattern attacks.
Edit intent: fluency
Original:  Interestingly, our algorithms do not need the database owner, which only creates and distributes secret-shares once, to be involved to answer any query, and hence, the database owner also cannot learn the query.
Revised:  Interestingly, our algorithms do not need the database owner, which only creates and distributes secret-shares once, to be involved in answering any query, and hence, the database owner also cannot learn the query.
Edit intent: clarity
Original:  We evaluate the efficiency of the algorithms on  parameters: (i) the number of communication rounds (between a user and a cloud), (ii) the total amount of bit flow (between a user and a cloud), and (iii) the computational load at the user-side and the cloud-side.
Revised:  We evaluate the efficiency of the algorithms on the following parameters: (i) the number of communication rounds (between a user and a cloud), (ii) the total amount of bit flow (between a user and a cloud), and (iii) the computational load at the user-side and the cloud-side.
Edit intent: clarity
Original: Data outsourcing allows data owners to keep their data at untrusted clouds that do not ensure the privacy of data and/or computations.
Revised: Data outsourcing allows data owners to keep their data at untrusted clouds that do not ensure the privacy of data and/or computations.
Edit intent: fluency
Original:  One useful framework for fault-tolerant data processing in a distributed fashion is MapReduce, which was developed for trusted private clouds.
Revised:  One useful framework for fault-tolerant data processing in a distributed fashion is MapReduce, which was developed for trusted private clouds.
Edit intent: fluency
Original:  Our proposed algorithms prevent the untrusted cloud from knowing the database or the query while also preventing output size and access-pattern attacks.
Revised:  Our proposed algorithms prevent an adversary from knowing the database or the query while also preventing output size and access-pattern attacks.
Edit intent: clarity
Original:  Our proposed algorithms prevent the untrusted cloud from knowing the database or the query while also preventing output size and access-pattern attacks.
Revised:  Our proposed algorithms prevent the untrusted cloud from knowing the database or the query while also preventing output-size and access-pattern attacks.
Edit intent: fluency
Original:  Interestingly, our algorithms do not need the database owner, which only creates and distributes secret-shares once, to be involved in answering any query, and hence, the database owner also cannot learn the query.
Revised:  Interestingly, our algorithms do not involve the database owner, which only creates and distributes secret-shares once, to be involved in answering any query, and hence, the database owner also cannot learn the query.
Edit intent: clarity
Original:  Interestingly, our algorithms do not need the database owner, which only creates and distributes secret-shares once, to be involved in answering any query, and hence, the database owner also cannot learn the query.
Revised:  Interestingly, our algorithms do not need the database owner, which only creates and distributes secret-shares once, in answering any query, and hence, the database owner also cannot learn the query.
Edit intent: clarity
Original:  We evaluate the efficiency of the algorithms on the following parameters: ( i ) the number of communication rounds (between a user and a cloud ), ( ii \textit{ ) the total amount of bit flow (between a user and a cloud ), and ( iii \textit{ ) the computational load at the user-side and the cloud-side.\B
Revised:  We evaluate the efficiency of the algorithms on the following parameters: ( i ) the number of communication rounds (between a user and a cloud ), ( ii \textit{ ) the total amount of bit flow (between a user and a cloud ), and ( iii \textit{ ) the computational load at the user-side and the cloud-side.\B
Edit intent: fluency
Original:  We evaluate the efficiency of the algorithms on the following parameters: ( i ) the number of communication rounds (between a user and a cloud ), ( ii \textit{ ) the total amount of bit flow (between a user and a cloud ), and ( iii \textit{ ) the computational load at the user-side and the cloud-side.\B
Revised:  We evaluate the efficiency of the algorithms on the following parameters: ( i ) the number of communication rounds (between a user and a server ), ( ii \textit{ ) the total amount of bit flow (between a user and a cloud ), and ( iii \textit{ ) the computational load at the user-side and the cloud-side.\B
Edit intent: clarity
Original:  We evaluate the efficiency of the algorithms on the following parameters: ( i ) the number of communication rounds (between a user and a cloud ), ( ii \textit{ ) the total amount of bit flow (between a user and a cloud ), and ( iii \textit{ ) the computational load at the user-side and the cloud-side.\B
Revised:  We evaluate the efficiency of the algorithms on the following parameters: ( i ) the number of communication rounds (between a user and a cloud ), ( \textit{ ) the total amount of bit flow (between a user and a cloud ), and ( iii \textit{ ) the computational load at the user-side and the cloud-side.\B
Edit intent: fluency
Original:  We evaluate the efficiency of the algorithms on the following parameters: ( i ) the number of communication rounds (between a user and a cloud ), ( ii \textit{ ) the total amount of bit flow (between a user and a cloud ), and ( iii \textit{ ) the computational load at the user-side and the cloud-side.\B
Revised:  We evaluate the efficiency of the algorithms on the following parameters: ( i ) the number of communication rounds (between a user and a cloud ), ( ii \textit{ ) the total amount of bit flow (between a user and a server ), and ( iii \textit{ ) the computational load at the user-side and the cloud-side.\B
Edit intent: clarity
Original:  We evaluate the efficiency of the algorithms on the following parameters: ( i ) the number of communication rounds (between a user and a cloud ), ( ii \textit{ ) the total amount of bit flow (between a user and a cloud ), and ( iii \textit{ ) the computational load at the user-side and the cloud-side.\B
Revised:  We evaluate the efficiency of the algorithms on the following parameters: ( i ) the number of communication rounds (between a user and a cloud ), ( ii \textit{ ) the total amount of bit flow (between a user and a cloud ), and ( iii \textit{ ) the computational load at the user and the server.\B
Edit intent: clarity
Original: Either by ensuring the continuing availability of information, or by deliberately caching content that might get deleted or removed , Web archiving services play an increasingly important role in today's information ecosystem .
Revised: Web archiving services play an increasingly important role in today's information ecosystem, by ensuring the continuing availability of information, or by deliberately caching content that might get deleted or removed , Web archiving services play an increasingly important role in today's information ecosystem .
Edit intent: coherence
Original: Either by ensuring the continuing availability of information, or by deliberately caching content that might get deleted or removed , Web archiving services play an increasingly important role in today's information ecosystem .
Revised: Either by ensuring the continuing availability of information, or by deliberately caching content that might get deleted or removed .
Edit intent: clarity
Original:  In this paper, we present a large-scale analysis of Web archiving services and their use on social media, aiming to shed light on the actors involved in this ecosystem, the content that gets archived, and how it is shared.
Revised:  In this paper, we present a large-scale analysis of Web archiving services and their use on social media, shedding light on the actors involved in this ecosystem, the content that gets archived, and how it is shared.
Edit intent: coherence
Original:  To this end, we crawl and study: 1) 21M URLs  , spanning almost two years, from archive.is;
Revised:  We crawl and study: 1) 21M URLs , spanning almost two years, from archive.is;
Edit intent: clarity
Original:  To this end, we crawl and study: 1) 21M URLs  , spanning almost two years, from archive.is;
Revised:  To this end, we crawl and study: 1) 21M URLs , spanning almost two years, 
Edit intent: clarity
Original:  Musical performance requires prediction to operate instruments, and perform in groups  .
Revised:  Musical performance requires prediction to operate instruments, to perform in groups .
Edit intent: coherence
Original:  We argue that predictive models could help interactive systems to understand their temporal context , and ensemble behaviour.
Revised:  We argue that predictive models could help interactive systems to understand their temporal context and ensemble behaviour.
Edit intent: fluency
Original:  Deep learning can allow data-driven  models with a long memory of past states.
Revised:  Deep learning can allow data-driven predictive models with a long memory of past states.
Edit intent: clarity
Original:  We motivate the framework with two examples from our recent work , as well as systems from the literature, and suggest musical use-cases where prediction is a necessary component.
Revised:  We apply our framework to examples from our recent work , as well as systems from the literature, and suggest musical use-cases where prediction is a necessary component.
Edit intent: clarity
Original:  We motivate the framework with two examples from our recent work , as well as systems from the literature, and suggest musical use-cases where prediction is a necessary component.
Revised:  We motivate the framework with two examples from our recent work and the literature, and suggest musical use-cases where prediction is a necessary component.
Edit intent: clarity
Original:  We argue, with reference to a number of digital music instruments (DMIs), including two of our own, that predictive machine learning models can help interactive systems to understand their temporal context and ensemble behaviour.
Revised:  In this paper, we investigate how a number of digital music instruments (DMIs), including two of our own, that predictive machine learning models can help interactive systems to understand their temporal context and ensemble behaviour.
Edit intent: clarity
Original:  We argue, with reference to a number of digital music instruments (DMIs), including two of our own, that predictive machine learning models can help interactive systems to understand their temporal context and ensemble behaviour.
Revised:  We argue, with reference to a number of digital musical instruments (DMIs), including two of our own, that predictive machine learning models can help interactive systems to understand their temporal context and ensemble behaviour.
Edit intent: fluency
Original:  We argue, with reference to a number of digital music instruments (DMIs), including two of our own, that predictive machine learning models can help interactive systems to understand their temporal context and ensemble behaviour.
Revised:  We argue, with reference to a number of digital music instruments (DMIs), including two of our own, have applied predictive machine learning models can help interactive systems to understand their temporal context and ensemble behaviour.
Edit intent: coherence
Original:  Mobile networks have connected tens of billions of devices on the ground in the past decades and are now ready to connect the flying drones in the sky.
Revised:  Mobile networks have connected tens of billions of devices on the ground in the past decades and are now ready to connect the drones flying in the sky.
Edit intent: fluency
Original:  We then present simulation results to shed light on the performance of a network when the network is serving many drones simultaneously over a wide area.
Revised:  We then present simulation results to shed light on the performance of a network when it is serving many drones simultaneously over a wide area.
Edit intent: clarity
Original:  The results, analysis, and design insights presented in this article help enhance the understanding of the applicability and performance of mobile network connectivity to low altitude drones.
Revised:  The results, analysis, and design insights presented in this article help enhance the understanding of the applicability and performance of providing mobile connectivity to low altitude drones.
Edit intent: clarity
Original:  We propose a novel method of describing and classifying online conversations using only the structure of the underlying temporal network and not the content of individual messages .
Revised:  We propose a new method to decompose a temporal network into macroscale components and to analyse the behaviour of these components, or collectives of nodes, across time .
Edit intent: clarity
Original:  This method utilises all available information in the temporal network ( no aggregation), combining both topological and temporal structure using temporal motifs and inter-event times.
Revised:  This method utilises all available information in the temporal network ( i.e. no temporal aggregation), combining both topological and temporal structure using temporal motifs and inter-event times.
Edit intent: coherence
Original:  This allows us create an embedding of the temporal network in order to describe the behaviour of individuals and collectives over time and examine the structure of conversation over multiple timescales .
Revised:  This allows us create an embedding of a temporal network in order to describe the behaviour of individuals and collectives over time and examine the structure of conversation over multiple timescales .
Edit intent: fluency