wanyu/IteraTeR_v2 huggingface dataset:
Original:  More precisely, we show that (v) and%DIFDELCMD < p%%% (G) can be estimated respectively in time \mathcal{O(m \log n) and O(m \log^2 n).
Revised:  More precisely, we show that %DIFDELCMD < p%%% (G) can be estimated respectively in time \mathcal{O(m \log n) and O(m \log^2 n).
Edit intent: clarity
Original:  More precisely, we show that (v) and%DIFDELCMD < p%%% (G) can be estimated respectively in time \mathcal{O(m \log n) and O(m \log^2 n).
Revised:  More precisely, we show that (v) and%DIFDELCMD < p%%% (m \log n) and O(m \log^2 n).
Edit intent: clarity
Original: In this work we investigate the problem of percolation centrality, a generalization of betweenness centrality, in a weighted graphG under the light of sample complexity theory .
Revised: In this work we investigate the problem of estimating the percolation centrality of every vertex in a graph. This centrality measure quantifies the importance of each vertex in a graph going through a contagious process .
Edit intent: clarity
Original:  It is an open problem whether these centrality measure can be computed in O(n^{3-c}) time, for any constant c>0.
Revised:  It is an open problem whether the percolation centrality can be computed in O(n^{3-c}) time, for any constant c>0.
Edit intent: clarity
Original:  The estimative obtained by the algorithm is within \epsilon of the exact value with probability 1-\delta, for {\it fixed} constants 0 < \epsilon,\delta \leq 1. 
Revised:  The estimation obtained by the algorithm is within \epsilon of the exact value with probability 1-\delta, for {\it fixed} constants 0 < \epsilon,\delta \leq 1. 
Edit intent: clarity
Original: We address the problem of Any-Code Generation (AnyGen) - generating code without any restriction on the vocabulary or structure.
Revised: We address the problem of any-code completion - generating code without any restriction on the vocabulary or structure.
Edit intent: clarity
Original:  The state-of-the-art in this problem is the sequence-to-sequence (seq2seq) approach, which treats code as a sequence and does not leverage any structural information.
Edit intent: coherence
Original:  Unlike previous structural techniques that have severely restricted the kinds of expressions that can be generated  , our approach can generate arbitrary expressions in any programming language.
Revised:  Unlike previous techniques that have severely restricted the kinds of expressions that can be generated , our approach can generate arbitrary expressions in any programming language.
Edit intent: clarity
Original:  Unlike previous structural techniques that have severely restricted the kinds of expressions that can be generated  , our approach can generate arbitrary expressions in any programming language.
Revised:  Unlike previous structural techniques that have severely restricted the kinds of expressions that can be generated in this task , our approach can generate arbitrary expressions in any programming language.
Edit intent: clarity
Original:  Unlike previous structural techniques that have severely restricted the kinds of expressions that can be generated  , our approach can generate arbitrary expressions in any programming language.
Revised:  Unlike previous structural techniques that have severely restricted the kinds of expressions that can be generated , our approach can generate arbitrary code in any programming language.
Edit intent: clarity
Original:  Our model significantly outperforms both seq2seq and a variety of existing structured approaches in generating Java and C# code.
Revised:  Our model significantly outperforms both seq2seq and a variety of structured approaches in generating Java and C# code.
Edit intent: clarity
Original:  We make our code, datasets, and models available online .
Revised:  We make our code, datasets, and models publicly available .
Edit intent: clarity
Original:  We make our code, datasets, and models publicly available .
Revised:  Our code, data, and trained models are available at URL . An online demo is available at URL .
Edit intent: clarity
Original: It was recently shown that certain subsurface hydrological inverse problems - here framed as determining the composition of an aquifer from pressure readings - can be solved on a quantum annealer.
Revised: It was recently shown that certain subsurface hydrological inverse problems -- here framed as determining the composition of an aquifer from pressure readings - can be solved on a quantum annealer.
Edit intent: fluency
Original: It was recently shown that certain subsurface hydrological inverse problems - here framed as determining the composition of an aquifer from pressure readings - can be solved on a quantum annealer.
Revised: It was recently shown that certain subsurface hydrological inverse problems - here framed as determining the composition of an aquifer from pressure readings -- can be solved on a quantum annealer.
Edit intent: fluency
Original:  In this paper  we study why this regime is difficult , and use several pre- and post-processing tools attempt to address these issues.
Revised:  In this paper , we study why this regime is difficult , and use several pre- and post-processing tools attempt to address these issues.
Edit intent: fluency
Original:  In this paper  we study why this regime is difficult , and use several pre- and post-processing tools attempt to address these issues.
Revised:  In this paper we study why this regime is difficult and use several pre- and post-processing tools attempt to address these issues.
Edit intent: fluency
Original:  In this paper  we study why this regime is difficult , and use several pre- and post-processing tools attempt to address these issues.
Revised:  In this paper we study why this regime is difficult , and use several pre- and post-processing tools to address these issues.
Edit intent: clarity
Original:  Sometimes, as in the 1918 Spanish flu epidemic, a contagion mutates as it propagates .
Revised:  Sometimes, as in the 1918 Spanish flu epidemic, a contagion mutates at some point as it spreads through a network .
Edit intent: clarity
Original:  This prediction agrees with the observed statistics of memes propagating and mutating on Facebook, and is expected to hold universally for other effectively infinite-dimensional networks, such as the global human contact network.
Revised:  This prediction agrees with the observed statistics of memes propagating and mutating on Facebook, and is expected to hold for other effectively infinite-dimensional networks, such as the global human contact network.
Edit intent: clarity
Original:  Recent work has applied similar methodology in the setting of multi-player general-sum differential games.
Revised:  Recent work has applied similar methodology in the setting of multiplayer general-sum differential games.
Edit intent: fluency
Original:  Here, ILQ methods are capable of finding local Nash equilibria in interactive motion planning problems in real-time.
Revised:  Here, ILQ methods are capable of finding local equilibria in interactive motion planning problems in real-time.
Edit intent: clarity
Original: Quantitative analysis of individual atherosclerotic plaques are mostly descriptive, relying - for example - on histological classification by spectral analysis of ultrasound waves or by staining and observing particular cellular components.
Revised: Analyses of individual atherosclerotic plaques are mostly descriptive, relying - for example - on histological classification by spectral analysis of ultrasound waves or by staining and observing particular cellular components.
Edit intent: clarity
Original: Quantitative analysis of individual atherosclerotic plaques are mostly descriptive, relying - for example - on histological classification by spectral analysis of ultrasound waves or by staining and observing particular cellular components.
Revised: Quantitative analysis of individual atherosclerotic plaques are mostly descriptive, relying -- for example -- on histological classification by spectral analysis of ultrasound waves or by staining and observing particular cellular components.
Edit intent: fluency
Original: Quantitative analysis of individual atherosclerotic plaques are mostly descriptive, relying - for example - on histological classification by spectral analysis of ultrasound waves or by staining and observing particular cellular components.
Revised: Quantitative analysis of individual atherosclerotic plaques are mostly descriptive, relying - for example - on histological classification by spectral analysis of ultrasound waves or staining and observing particular cellular components.
Edit intent: fluency
Original:  The main approach is to use Partial Differential Equations (PDEs) with macrophages, necrotic cells, oxidized lipids, oxygen concentration and PDGF (Platelet Derived Growth Factor) as primary variables coupled to a biomechanical model to describe vessel growth.
Revised:  The main approach is to use Partial Differential Equations (PDEs) with macrophages, necrotic cells, oxidized lipids, oxygen concentration and PDGF as primary variables coupled to a biomechanical model to describe vessel growth.
Edit intent: coherence
Original:  The model is deterministic, providing morphological and histological characteristics of an atherosclerotic vessel at any desired future time point.
Revised:  The model is deterministic, providing mechanical, morphological, and histological characteristics of an atherosclerotic vessel at any desired future time point.
Edit intent: clarity
Original:  Finally, we use our model to create a computer-generated animations of a possible plaque evolution that are in qualitative agreement with serial ultrasound images published by Kubo et al. (2010)  .
Revised:  Finally, we use our model to create computer-generated animations of a possible plaque evolution that are in qualitative agreement with serial ultrasound images published by Kubo et al. (2010) .
Edit intent: fluency
Original:  Finally, we use our model to create a computer-generated animations of a possible plaque evolution that are in qualitative agreement with serial ultrasound images published by Kubo et al. (2010)  .
Revised:  Finally, we use our model to create a computer-generated animations of a plaque evolution that are in qualitative agreement with serial ultrasound images published by Kubo et al. (2010) .
Edit intent: clarity
Original:  In this paper, we introduce SharPer, a permissioned blockchain system that enhances the scalability of blockchain systems by clustering (partitioning) the nodes and assigning different data shards to different clusters  . SharPer supports both intra-shard and cross-shard transactions and processes intra-shard transactions of different clusters as well as cross-shard transactions with non-overlapping clusters simultaneously.
Revised:  In this paper, we introduce SharPer, a permissioned blockchain system that improves scalability by clustering (partitioning) the nodes and assigning different data shards to different clusters . SharPer supports both intra-shard and cross-shard transactions and processes intra-shard transactions of different clusters as well as cross-shard transactions with non-overlapping clusters simultaneously.
Edit intent: clarity
Original:  The experimental results reveal the efficiency of SharPer in terms of performance and scalability especially in workloads with a low percentage of cross-shard transactions (typical settings in partitioned databases) .
Revised:  The experimental results reveal the efficiency of SharPer in terms of performance and scalability especially in workloads with a low percentage of cross-shard transactions .
Edit intent: clarity
Original: We present two iterative algorithms to interpolate graph signals from only a partial set of samples.
Revised: We propose an iterative algorithm to interpolate graph signals from only a partial set of samples.
Edit intent: clarity
Original:  Let \omega(w)=\min\{| u| t \mid u\in K(w)\} and let \phi(n)=\max\{\omega(w)\mid w\in R and | w|=n\}, where n>0.
Revised:  Let \omega(w)=\min\{| u| \mid u\in K(w)\} and let \phi(n)=\max\{\omega(w)\mid w\in R and | w|=n\}, where n>0.
Edit intent: clarity
Original: We present a number of contributions to bridging the gap between supervisory control theory and coordination of services  to explore the frontiers between coordination and control systems.
Revised: We present a number of contributions to bridging the gap between supervisory control theory and coordination of services in order to explore the frontiers between coordination and control systems.
Edit intent: coherence
Original:  Motivated , in part, by the success of advice complexity in the area of online algorithm , recently Borodin et al. have extended the fixed priority model to include an advice tape oracle.
Revised:  Motivated by the success of advice complexity in the area of online algorithm , recently Borodin et al. have extended the fixed priority model to include an advice tape oracle.
Edit intent: coherence
Original:  Motivated , in part, by the success of advice complexity in the area of online algorithm , recently Borodin et al. have extended the fixed priority model to include an advice tape oracle.
Revised:  Motivated , in part, by the success of advice complexity in the area of online algorithms , recently Borodin et al. have extended the fixed priority model to include an advice tape oracle.
Edit intent: fluency
Original:  They also developed a reduction-based framework for proving lower bounds against this rather powerful model.
Revised:  They also developed a reduction-based framework for proving lower bounds in this model.
Edit intent: clarity
Original:  In this paper, we extend the advice tape model further to the arguably more useful adaptive priority algorithms .
Revised:  In this paper, we extend the adaptive priority model to include an advice tape oracle .
Edit intent: clarity
Original:   In the process, we manage to simplify the proof that the framework works, and we strengthen all the  lower bounds by a factor of 2.
Revised:  In the process, we simplify the proof that the framework works, and we strengthen all the lower bounds by a factor of 2.
Edit intent: coherence
Original:  As a motivation of an adaptive priority model with advice , we present a purely combinatorial adaptive priority algorithm with advice for the minimum vertex cover problem on graphs of maximum degree 3.
Revised:  As a motivation of an adaptive priority model with advice , we present a purely combinatorial adaptive priority algorithm with advice for Minimum Vertex Cover on triangle-free graphs of maximum degree 3.
Edit intent: clarity
Original:  As a motivation of an adaptive priority model with advice , we present a purely combinatorial adaptive priority algorithm with advice for the minimum vertex cover problem on graphs of maximum degree 3.
Revised:  As a motivation of an adaptive priority model with advice , we present a purely combinatorial adaptive priority algorithm with advice for the minimum vertex cover problem on graphs of maximum degree three.
Edit intent: fluency
Original: The priority model was introduced by Borodin, Rackoff and Nielsen to capture " greedy-like " algorithms.
Revised: The priority model was introduced by Borodin, Rackoff and Nielsen to capture " greedy-like algorithms.
Edit intent: fluency
Original:  Motivated by the success of advice complexity in the area of online algorithms, recently Borodin et al. have extended the fixed priority model to include an advice tape oracle.
Revised:  Motivated by the success of advice complexity in the area of online algorithms, Borodin et al. have extended the fixed priority model to include an advice tape oracle.
Edit intent: coherence
Original:  The framework provides a template, where one can obtain a lower bound relatively easily by exhibiting some ``gadget patterns'' fulfilling given criteria.
Revised:  The framework provides a template, where one can obtain a lower bound relatively easily by exhibiting "gadget patterns" fulfilling given criteria.
Edit intent: clarity
Original:  The branching in branch-and-reduce algorithms can be seen as trying all possible advice strings, and all priority algorithms with advice that achieve optimality can be used to define corresponding exact algorithms, priority exact algorithms  .
Revised:  Priority algorithms with advice that achieve optimality can be used to define corresponding exact algorithms, priority exact algorithms .
Edit intent: coherence
Original:  A key technical innovation in SeLoC is a relational version of weakest preconditions to track information flow using separation logic resources.
Revised:  A key technical innovation in SeLoC is a relational form of weakest preconditions to track information flow using separation logic resources.
Edit intent: clarity
Original:  A key technical innovation in SeLoC is a relational version of weakest preconditions to track information flow using separation logic resources.
Revised:  A key technical innovation in SeLoC is a relational version of weakest preconditions that can track information flow using separation logic resources.
Edit intent: clarity
Original:  While a coflow is a collection of tasks that can be processed by  corresponding computing machines, it is completed only when all its tasks are completed within the deadline.
Revised:  While a coflow is a collection of tasks that can be processed by the corresponding computing machines, it is completed only when all its tasks are completed within the deadline.
Edit intent: fluency
Original:  Moreover, we consider unreliable computing machines, whose processing speed is uncertain but is limited.
Revised:  Moreover, we consider unreliable computing machines, whose processing speeds are uncertain but limited.
Edit intent: fluency
Original:  Because of the limited processing abilities of the computing machines, an algorithm for scheduling  coflows in the unreliable computing machines is critical to maximize the average number of completed coflows for each job.
Revised:  Because of the limited processing abilities of the computing machines, an algorithm for scheduling the coflows in the unreliable computing machines is critical to maximize the average number of completed coflows for each job.
Edit intent: fluency
Original:  Because of the limited processing abilities of the computing machines, an algorithm for scheduling  coflows in the unreliable computing machines is critical to maximize the average number of completed coflows for each job.
Revised:  Because of the limited processing abilities of the computing machines, an algorithm for scheduling coflows in the computing machines is critical to maximize the average number of completed coflows for each job.
Edit intent: clarity
Original:  The master machine is running multiple jobs.
Revised:  The master is running multiple jobs.
Edit intent: clarity
Original:  Each job stochastically generates real-time coflows with a strict coflows' deadline.
Revised:  Each job stochastically generates real-time jobs with a strict coflows' deadline.
Edit intent: clarity
Original:  While a coflow is a collection of tasks that can be processed by the corresponding computing machines, a real-time coflow is completed only when all its tasks are completed  within the deadline.
Revised:  While a coflow is a collection of tasks that can be processed by the corresponding computing machines, a real-time job is completed only when all its tasks are completed within the deadline.
Edit intent: clarity
Original:  While a coflow is a collection of tasks that can be processed by the corresponding computing machines, a real-time coflow is completed only when all its tasks are completed  within the deadline.
Revised:  While a coflow is a collection of tasks that can be processed by the corresponding computing machines, a real-time coflow is completed only when all its tasks are completed by the corresponding workers within the deadline.
Edit intent: clarity
Original:  Moreover, we consider unreliable computing machines , whose processing speeds are uncertain but limited .
Revised:  Moreover, we consider unreliable workers , whose processing speeds are uncertain but limited .
Edit intent: clarity
Original:  Moreover, we consider unreliable computing machines , whose processing speeds are uncertain but limited .
Revised:  Moreover, we consider unreliable computing machines , whose processing speeds are uncertain .
Edit intent: clarity
Original:  Because of the limited processing abilities of the computing machines , an algorithm for scheduling the coflows in the computing machines is critical to maximize the average number of completed coflows for each job.
Revised:  Because of the limited processing abilities of the workers , an algorithm for scheduling the coflows in the computing machines is critical to maximize the average number of completed coflows for each job.
Edit intent: clarity
Original:  Because of the limited processing abilities of the computing machines , an algorithm for scheduling the coflows in the computing machines is critical to maximize the average number of completed coflows for each job.
Revised:  Because of the limited processing abilities of the computing machines , an algorithm for scheduling the jobs in the workers is needed to maximize the average number of completed coflows for each job.
Edit intent: clarity
Original:  The feasibility-optimal scheduling algorithm can fulfill the largest region of jobs ' requirements for the average number of completed coflows .
Revised:  The feasibility-optimal scheduling algorithm can fulfill the largest region of jobs ' requirements for the average number of completed jobs .
Edit intent: clarity
Original:  However, the feasibility-optimal scheduling algorithm suffers from high computational complexity when the number of jobs is large.
Revised:  However, the feasibility-optimal scheduling algorithm suffers from high computational complexity when the number of applications is large.
Edit intent: clarity
Original:  For example, a differentiable elastic object simulator written in our language is 4.2x faster than the hand-engineered CUDA version yet runs as fast, and is 188x faster than TensorFlow . Using our differentiable programs, neural network controllers are typically optimized within only tens of iterations .
Revised:  For example, a differentiable elastic object simulator written in our language is 4.2x faster than the hand-engineered CUDA version yet runs as fast, and is 188x faster than the TensorFlow implementation . Using our differentiable programs, neural network controllers are typically optimized within only tens of iterations .
Edit intent: clarity
Original:  Apart from a handful of general-purpose blockchains, such as Ethereum or Hyperledger Fabric, there are hundreds other designed for specific applications and typically do not talk to each other.
Revised:  Apart from a handful of general-purpose blockchains, such as Ethereum or Hyperledger Fabric, there are hundreds of others designed for specific applications and typically do not talk to each other.
Edit intent: fluency
Original:  In particular : We show a doubly efficient pseudo-deterministic  proof for linear programming where the canonical solution which the prover will provide is the lexicographically greatest optimal solution for the LP.
Revised:  In particular , we show a doubly efficient pseudo-deterministic proof for linear programming where the canonical solution which the prover will provide is the lexicographically greatest optimal solution for the LP.
Edit intent: fluency
Original:  We show a doubly efficient pseudo-deterministic proof for 3-SUM and problems reducible to 3-SUM . We show a doubly-efficient pseudo-deterministic proof for the hitting set problem .
Revised:  We show a doubly efficient pseudo-deterministic proof for 3-SUM and problems reducible to 3-SUM , the hitting set problem .
Edit intent: fluency
Original: The Kreiss constant of a matrix and the distance to uncontrollability can both be defined by global minimization problems of certain singular value functions in two real variables , which often have multiple local minima.
Revised: We propose a new approach to computing global minimizers of singular value functions in two real variables , which often have multiple local minima.
Edit intent: clarity