wanyu/IteraTeR_v2 huggingface dataset:
Original:  Finally, we prove that an algorithm of Berman and F\"{u (1994)  is a \left( \frac{\Delta+1 + \varepsilon\right)-certified algorithm  on graphs of maximum degree \Delta where all weights are equal to 1.
Revised:  Finally, we prove that an algorithm of Berman and F\"{u (1994) is a \left( \frac{\Delta + 1 + \varepsilon\right)-certified algorithm on graphs of maximum degree \Delta where all weights are equal to 1.
Edit intent: fluency
Original:  Finally, we prove that an algorithm of Berman and F\"{u (1994)  is a \left( \frac{\Delta+1 + \varepsilon\right)-certified algorithm  on graphs of maximum degree \Delta where all weights are equal to 1.
Revised:  Finally, we prove that an algorithm of Berman and F\"{u (1994) is a \left( \frac{\Delta+1 + \varepsilon\right)-certified algorithm for MIS on graphs of maximum degree \Delta where all weights are equal to 1.
Edit intent: clarity
Original: By networking multiple quantum devices, the Quantum Internet builds up a virtual quantum machine able to provide an exponential scale-up of the quantum computing power.
Revised: The Quantum Internet is envisioned as the final stage of the quantum computing power.
Edit intent: clarity
Original:  Then, we introduce quantum teleportation as the key strategy for transmitting quantum information without physically transferring the particle that stores the quantum information or violating the principles of  quantum mechanics.
Revised:  Then, we introduce quantum teleportation as the key strategy for transmitting quantum information without physically transferring the particle that stores the quantum information or violating the principles of the quantum mechanics.
Edit intent: fluency
Original:  Finally, we describe the key research challenges to design quantum communication networks  .
Revised:  Finally, the key research challenges to design quantum communication networks .
Edit intent: clarity
Original:  Finally, we describe the key research challenges to design quantum communication networks  .
Revised:  Finally, we describe the key research challenges to design quantum communication networks are described .
Edit intent: clarity
Original:  We find that the Leiden algorithm is faster than the Louvain algorithm and uncovers better partitions, in addition to providing explicit guarantees . Based on our results, we conclude that the Leiden algorithm is preferable to the Louvain algorithm .
Revised:  We find that the Leiden algorithm is faster than the Louvain algorithm and uncovers better partitions, in addition to providing explicit guarantees .
Edit intent: clarity
Original:  Delicate issues arise when the considered system can jump due to both exogenous shocks and endogenous controls.
Revised:  Delicate issues arise when the controlled system can jump due to both exogenous shocks and endogenous controls.
Edit intent: clarity
Original:  For the latter, we illustrate in a first case study how different signals on exogenous jumps lead to different optimal policies , interpolating between the predictable and optional optimal controls in a systematic manner.
Revised:  For the latter, we illustrate in a first case study how different signals on exogenous jumps lead to different optimal controls , interpolating between the predictable and optional optimal controls in a systematic manner.
Edit intent: clarity
Original:  For the latter, we illustrate in a first case study how different signals on exogenous jumps lead to different optimal policies , interpolating between the predictable and optional optimal controls in a systematic manner.
Revised:  For the latter, we illustrate in a first case study how different signals on exogenous jumps lead to different optimal policies , interpolating between the predictable and the optional case in a systematic manner.
Edit intent: clarity
Original:  This lower bound is an improvement of the known lower bound through the sparsity of f  . Using our lower bound we determine the exact parity decision tree complexity of several important Boolean functions including majority , recursive majorityand ^3 function .
Revised:  This lower bound is an improvement of lower bounds through the sparsity of f . Using our lower bound we determine the exact parity decision tree complexity of several important Boolean functions including majority , recursive majorityand ^3 function .
Edit intent: clarity
Original:  This lower bound is an improvement of the known lower bound through the sparsity of f  . Using our lower bound we determine the exact parity decision tree complexity of several important Boolean functions including majority , recursive majorityand ^3 function .
Revised:  This lower bound is an improvement of the known lower bound through the sparsity of f . Using our lower bound we determine the exact parity decision tree complexity of several important Boolean functions including majority , recursive majorityand and recursive majority .
Edit intent: clarity
Original:  For ^3 the complexity is n-1 for n divisible by 3 and is n otherwise.
Revised:  ^3 the complexity is n-1 for n divisible by 3 and is n otherwise.
Edit intent: coherence
Original:  In the simple stochastic setting we show that one of the agents (called the free rider), who has access to the history of other agents playing some zero regret algorithm can achieve just O(1) regret, as opposed to the regret lower bound of \Omega (\log T) when one decision maker is playing in isolation.
Revised:  In the simple stochastic setting we show that one of the agents (called the free rider), who has access to the history of other agents playing some zero-regret algorithm can achieve just O(1) regret, as opposed to the regret lower bound of \Omega (\log T) when one decision maker is playing in isolation.
Edit intent: fluency
Original:  In the linear contextual setting, we show that if the other agents play a particular, popular zero regret algorithm (UCB), then the free rider can again achieve O(1) regret.
Revised:  In the linear contextual setting, we show that if the other agents play a particular, popular zero-regret algorithm (UCB), then the free rider can again achieve O(1) regret.
Edit intent: fluency
Original:  In the simple stochastic setting  we show that one of the agents (called the free rider), who has access to the history of other agents playing some zero-regret algorithm can achieve just O(1) regret, as opposed to the regret lower bound of \Omega (\log T ) when one decision maker is playing in isolation.
Revised:  In the simple stochastic setting , we show that one of the agents (called the free rider), who has access to the history of other agents playing some zero-regret algorithm can achieve just O(1) regret, as opposed to the regret lower bound of \Omega (\log T ) when one decision maker is playing in isolation.
Edit intent: fluency
Original:  In the simple stochastic setting  we show that one of the agents (called the free rider), who has access to the history of other agents playing some zero-regret algorithm can achieve just O(1) regret, as opposed to the regret lower bound of \Omega (\log T ) when one decision maker is playing in isolation.
Revised:  In the simple stochastic setting we show that one of the agents (called the free rider), who has access to the history of other agents playing some zero-regret algorithm can achieve just O(1) regret, as opposed to the regret lower bound of \Omega (\log t ) when one decision maker is playing in isolation.
Edit intent: fluency
Original:  For example, we find out that Proportional Approval Voting (PAV) has better proportionality guarantees than its sequential counterpart, and that Phragm\'{e}n's Sequential Rule is worse than Sequential PAV.
Revised:  For example, we find that Proportional Approval Voting (PAV) has better proportionality guarantees than its sequential counterpart, and that Phragm\'{e}n's Sequential Rule is worse than Sequential PAV.
Edit intent: coherence
Original: In this paper we study edit similarity joins , in which we are given a set of strings and a threshold parameter K, and asked to find all pairs of strings whose edit distance are at most K . Edit similarity joins is a fundamental problem in query processing, and has been studied extensively in the database community since early 2000s .
Revised: We study the problem of computing similarity joins under edit distance on a set of strings and a threshold parameter K, and asked to find all pairs of strings whose edit distance are at most K . Edit similarity joins is a fundamental problem in query processing, and has been studied extensively in the database community since early 2000s .
Edit intent: clarity
Original: In this paper we study edit similarity joins , in which we are given a set of strings and a threshold parameter K, and asked to find all pairs of strings whose edit distance are at most K . Edit similarity joins is a fundamental problem in query processing, and has been studied extensively in the database community since early 2000s .
Revised: In this paper we study edit similarity joins , in which we are given a set of strings . Edit similarity joins is a fundamental problem in query processing, and has been studied extensively in the database community since early 2000s .
Edit intent: clarity
Original:  Yet, the degree to which brain activity and functional connectivity during learning is constrained across subjects, for example by conserved anatomy andphysiology or by the nature of the task, remains unknown.
Edit intent: coherence
Original:  Here, we measured brain activity and functional connectivity in a longitudinal  experiment in which healthy adult human participants learned the values of novel objects over the course of four days.
Revised:  Here, we measured brain activity and functional connectivity in a longitudinal experiment in which healthy adult human participants learn the values of novel objects over the course of four days.
Edit intent: fluency
Original:  Notably, inter-subject connectivity in activity and connectivity displayed marked temporal variations, with inter-subject correlations in activity exceeding those in connectivity during early learning and visa versa in later learning .
Revised:  Notably, inter-subject connectivity in activity and connectivity displayed marked temporal variations, with inter-subject correlations in activity exceeding those in connectivity during early learning and in later learning .
Edit intent: clarity
Original: In this paper we study the distribution of the non-trivial zeros of the  zeta-function \zeta(s) (and other L-functions) under Montgomery's pair correlation approach.
Revised: In this paper we study the distribution of the non-trivial zeros of the zeta-function \zeta(s) (and other L-functions) using Montgomery's pair correlation approach.
Edit intent: clarity
Original: We show conflict complexity of any total boolean function, recently defined in [Swagato Sanyal.
Revised: We show conflict complexity of every total Boolean function, recently defined in [Swagato Sanyal.
Edit intent: clarity
Original: We show conflict complexity of any total boolean function, recently defined in [Swagato Sanyal.
Revised: We show conflict complexity of any total boolean function, recently introduced in [Swagato Sanyal.
Edit intent: clarity
Original:  A composition theorem via conict complexity. arXiv preprint arXiv:1801.03285, 2018.] to study a composition theorem of randomized decision tree complexity, is at least a half of its block sensitivity.
Revised:  A composition theorem via conict complexity. arXiv preprint arXiv:1801.03285, 2018.] to prove a composition theorem of randomized decision tree complexity, is at least a half of its block sensitivity.
Edit intent: clarity
Original: Data structures that allow efficient distance estimation (distance oracles or distance sketches ) have been extensively studied, and are particularly well studied in centralized models and classical distributed models such as the CONGESTmodel .
Revised: Data structures that allow efficient distance estimation (distance oracles , distance sketches, etc. ) have been extensively studied, and are particularly well studied in centralized models and classical distributed models such as the CONGESTmodel .
Edit intent: coherence
Original: Data structures that allow efficient distance estimation (distance oracles or distance sketches ) have been extensively studied, and are particularly well studied in centralized models and classical distributed models such as the CONGESTmodel .
Revised: Data structures that allow efficient distance estimation (distance oracles or distance sketches ) have been extensively studied, and are particularly well studied in centralized models and classical distributed models such as CONGEST .
Edit intent: fluency
Original:  We provide algorithms for constructing the well-known Thorup-Zwick distance oracle (or distance sketches) in multiple different computational models and discuss the tradeoffs between different complexity measures such as space, time, approximation ratio, and communication complexity .
Revised:  We provide algorithms for constructing the well-known Thorup-Zwick distance oracle (or distance sketches) in these different computational models and discuss the tradeoffs between different complexity measures such as space, time, approximation ratio, and communication complexity .
Edit intent: clarity
Original:  We provide algorithms for constructing the well-known Thorup-Zwick distance oracle (or distance sketches) in multiple different computational models and discuss the tradeoffs between different complexity measures such as space, time, approximation ratio, and communication complexity .
Revised:  We provide algorithms for constructing the well-known Thorup-Zwick distance oracle (or distance sketches) in multiple different computational models and discuss the tradeoffs between various complexity measures such as space, time, approximation ratio, and communication complexity .
Edit intent: fluency
Original:  We initiate their study in newer (and arguably more realistic) models of distributed computation such as the Congested Clique model and the Massively Parallel Computation (MPC) model , as well as in related big data models such as streaming and semi-streaming .
Revised:  We initiate their study in newer (and arguably more realistic) models of distributed computation : the Congested Clique model and the Massively Parallel Computation (MPC) model , as well as in related big data models such as streaming and semi-streaming .
Edit intent: fluency
Original:  We initiate their study in newer (and arguably more realistic) models of distributed computation such as the Congested Clique model and the Massively Parallel Computation (MPC) model , as well as in related big data models such as streaming and semi-streaming .
Revised:  We initiate their study in newer (and arguably more realistic) models of distributed computation such as the Congested Clique model and the Massively Parallel Computation (MPC) model .
Edit intent: coherence
Original:  We provide algorithms for constructing the well-known Thorup-Zwick distance oracle (or distance sketches) in these different computational modelsand discuss the tradeoffs between various complexity measures such as space, time, stretch , and message complexity.
Revised:  We provide efficient constructions in both of these models , and message complexity.
Edit intent: clarity
Original: Previously, the controllability problem of a linear time-invariant dynamical system is mapped to the maximum matching (MM) problem on the bipartite representation of the underlying directed graph, and the sizes of MMs on bipartite random graphs, the basic quantity of the controllability problem, are calculated analytically with the cavity method at zero temperature limit.
Revised: Previously, the controllability problem of a linear time-invariant dynamical system was mapped to the maximum matching (MM) problem on the bipartite representation of the underlying directed graph, and the sizes of MMs on bipartite random graphs, the basic quantity of the controllability problem, are calculated analytically with the cavity method at zero temperature limit.
Edit intent: fluency
Original: Previously, the controllability problem of a linear time-invariant dynamical system is mapped to the maximum matching (MM) problem on the bipartite representation of the underlying directed graph, and the sizes of MMs on bipartite random graphs, the basic quantity of the controllability problem, are calculated analytically with the cavity method at zero temperature limit.
Revised: Previously, the controllability problem of a linear time-invariant dynamical system is mapped to the maximum matching (MM) problem on the bipartite representation of the underlying directed graph, and the sizes of MMs on random bipartite graphs were calculated analytically with the cavity method at zero temperature limit.
Edit intent: clarity
Original:  Our theory is much  simplified and easily interpreted, and can estimate MM sizes on general random graphs with or without symmetry between out- and in-degree distributions.
Revised:  Our theory is much more simplified and easily interpreted, and can estimate MM sizes on general random graphs with or without symmetry between out- and in-degree distributions.
Edit intent: fluency
Original:  Our theory is much  simplified and easily interpreted, and can estimate MM sizes on general random graphs with or without symmetry between out- and in-degree distributions.
Revised:  Our theory is much simplified and easily interpreted, and can estimate MM sizes on random graphs with or without symmetry between out- and in-degree distributions.
Edit intent: clarity
Original:   This paper proposes  high-level abstractions consisting of simple cryptographic primitives and  declarative configuration.
Revised:  The challenge is to design high-level abstractions that require minimum knowledge and effort to use while also allowing maximum control when needed. This paper proposes high-level abstractions consisting of simple cryptographic primitives and declarative configuration.
Edit intent: clarity
Original:   This paper proposes  high-level abstractions consisting of simple cryptographic primitives and  declarative configuration.
Revised:  This paper proposes such high-level abstractions consisting of simple cryptographic primitives and declarative configuration.
Edit intent: clarity
Original:  We have implemented these abstractions in Python, and used them to write a  variety of well-known security protocols, including Signal, Kerberos, and TLS.
Revised:  We have implemented these abstractions in Python, and used them to write a wide variety of well-known security protocols, including Signal, Kerberos, and TLS.
Edit intent: clarity
Original:  However, it has not been well investigated whether the methods can be employed as the front-end processing and directly improve the performance of a machine listener, i.e., an automatic speech recognizer, without retraining and joint-training the acoustic model.
Revised:  However, it has not been well investigated whether the methods can be employed as the front-end processing and directly improve the performance of a machine listener, i.e., an automatic speech recognizer, without retraining or joint-training the acoustic model.
Edit intent: fluency
Original: Auxin has critical roles in plant growth, dependent upon its heterogeneous distribution in  tissues.
Revised: Plant hormone auxin has critical roles in plant growth, dependent upon its heterogeneous distribution in tissues.
Edit intent: clarity
Original: Auxin has critical roles in plant growth, dependent upon its heterogeneous distribution in  tissues.
Revised: Auxin has critical roles in plant growth, dependent on its heterogeneous distribution in tissues.
Edit intent: fluency
Original: Auxin has critical roles in plant growth, dependent upon its heterogeneous distribution in  tissues.
Revised: Auxin has critical roles in plant growth, dependent upon its heterogeneous distribution in plant tissues.
Edit intent: fluency
Original:  Exactly how auxin signalling and transport , and developmental processes such as growth coordinate to achieve the precise patterns of auxin observed experimentally is not well understood.
Revised:  Exactly how auxin transport and developmental processes such as growth coordinate to achieve the precise patterns of auxin observed experimentally is not well understood.
Edit intent: clarity
Original:  Mathematical models describing  auxin-related signalling pathway, PIN and AUX1 dynamics, auxin transport, and cell growth in plant tissues were derived.
Revised:  Mathematical models describing the auxin-related signalling pathway, PIN and AUX1 dynamics, auxin transport, and cell growth in plant tissues were derived.
Edit intent: fluency
Original:  Changes in auxin-related signalling processes were shown to be able to trigger transition between passage and spot type patterns in auxin distribution.
Revised:  Changes in auxin-related signalling processes are shown to be able to trigger transition between passage and spot type patterns in auxin distribution.
Edit intent: fluency
Original:  Cell growth was shown to have strong influence on PIN polarisation and determination of auxin distribution patterns.
Revised:  Cell growth was shown to have influence on PIN polarisation and determination of auxin distribution patterns.
Edit intent: clarity
Original:  Numerical simulation results indicate that auxin-related signalling processes can explain the different  auxin distributions observed in plant tissues, whereas  interplay between auxin transport and growth can explain the `reverse-fountain' pattern in auxin distribution observed at  root tips.
Revised:  Numerical simulation results indicate that auxin-related signalling processes can explain the different patterns in auxin distributions observed in plant tissues, whereas interplay between auxin transport and growth can explain the `reverse-fountain' pattern in auxin distribution observed at root tips.
Edit intent: fluency
Original:  Numerical simulation results indicate that auxin-related signalling processes can explain the different  auxin distributions observed in plant tissues, whereas  interplay between auxin transport and growth can explain the `reverse-fountain' pattern in auxin distribution observed at  root tips.
Revised:  Numerical simulation results indicate that auxin-related signalling processes can explain the different auxin distributions observed in plant tissues, whereas the interplay between auxin transport and growth can explain the `reverse-fountain' pattern in auxin distribution observed at root tips.
Edit intent: fluency
Original:  Numerical simulation results indicate that auxin-related signalling processes can explain the different  auxin distributions observed in plant tissues, whereas  interplay between auxin transport and growth can explain the `reverse-fountain' pattern in auxin distribution observed at  root tips.
Revised:  Numerical simulation results indicate that auxin-related signalling processes can explain the different auxin distributions observed in plant tissues, whereas interplay between auxin transport and growth can explain the `reverse-fountain' pattern in auxin distribution observed at plant root tips.
Edit intent: fluency
Original: Text classification is a challenging problem which aims to identify the category of text .
Revised: Text classification is a challenging problem which aims to identify the category of texts .
Edit intent: fluency
Original:  Recently, Capsule Networks (CapsNets) are proposed for image classification , it has been shown that CapsNets have several advantages over Convolutional Neural Networks (CNNs), while, their validity in the domain of text has less been explored.
Revised:  Recently, Capsule Networks (CapsNets) are proposed for image classification . It has been shown that CapsNets have several advantages over Convolutional Neural Networks (CNNs), while, their validity in the domain of text has less been explored.
Edit intent: fluency
Original: Learning to cooperate is crucially important in multi-agent reinforcement learning .
Revised: Learning to cooperate is crucially important in multi-agent environments .
Edit intent: clarity