wanyu/IteraTeR_v2 huggingface dataset:
Original:  Congested Clique is a model of distributed (or parallel) computing, in which there are n players (nodes) with unique identifiers from set 1, ..., n , which perform computations in synchronous rounds.
Revised:  Congested Clique is a model of distributed (or parallel) computing, in which there are n players (nodes) with unique identifiers from set n , which perform computations in synchronous rounds.
Edit intent: clarity
Original:  While communicating, each pair of nodes is allowed to exchange a single message of size \mathcal{O (\log n) bits.
Revised:  While communicating, each pair of players is allowed to exchange a single message of size \mathcal{O (\log n) bits.
Edit intent: clarity
Original:  While communicating, each pair of nodes is allowed to exchange a single message of size \mathcal{O (\log n) bits.
Revised:  While communicating, each pair of nodes is allowed to exchange a single message of size O (\log n) bits.
Edit intent: clarity
Original:  In this paper we study a restricted version of the Congested Clique model, the Node Congested Clique  model, proposed by Augustine et al.[arxiv1805] .
Revised:  In this paper we study a restricted version of the Congested Clique model, the Node Congested Clique (NCC) model, proposed by Augustine et al.[arxiv1805] .
Edit intent: clarity
Original:  In this paper , we provide communication primitives that improve the round complexity of the MST (Minimum Spanning Tree) algorithm by Augustine et al.
Revised:  In this paper , we provide communication primitives that improve the round complexity of the MST algorithm by Augustine et al.
Edit intent: coherence
Original:  Moreover, we propose a different approach to this problem that requires only \mathcal{O(\log^3 n }  ]  / \log \log n) rounds, and has smaller dependence on the weights of the edges . Besides the faster MST algorithm, we consider the key contributions to be : -
Revised:  Moreover, we propose a different approach to this problem that requires only \mathcal{O(\log^3 n } ] / \log \log n) rounds, and has smaller dependence on the weights of the edges . Besides the faster MST algorithm, we consider the key contributions to be -
Edit intent: fluency
Original:  an efficient implementation of some basic protocols , - a tighter analysis of a special case of the sampling approach by Karger , Klein and Tarjan [JACM'95] ( and related results by Pemmaraju and Sardeshmukh [FSTTCS'16] ), - an application of sparse recovery techniques going slightly beyond the standard usage of linear graph sketching by Ahn, Guha and McGregor SODA'12
Revised:  an efficient implementation of some basic protocols , - a tighter analysis of a special case of the sampling approach by Karger et al. [JACM'95] ( and related results by Pemmaraju and Sardeshmukh [FSTTCS'16] ), - an application of sparse recovery techniques going slightly beyond the standard usage of linear graph sketching by Ahn, Guha and McGregor SODA'12
Edit intent: clarity
Original:  an efficient implementation of some basic protocols , - a tighter analysis of a special case of the sampling approach by Karger , Klein and Tarjan [JACM'95] ( and related results by Pemmaraju and Sardeshmukh [FSTTCS'16] ), - an application of sparse recovery techniques going slightly beyond the standard usage of linear graph sketching by Ahn, Guha and McGregor SODA'12
Revised:  an efficient implementation of some basic protocols , - a tighter analysis of a special case of the sampling approach by Karger , Klein and Tarjan [JACM'95] and related results by Pemmaraju and Sardeshmukh [FSTTCS'16] ), - an application of sparse recovery techniques going slightly beyond the standard usage of linear graph sketching by Ahn, Guha and McGregor SODA'12
Edit intent: fluency
Original:  an efficient implementation of some basic protocols , - a tighter analysis of a special case of the sampling approach by Karger , Klein and Tarjan [JACM'95] ( and related results by Pemmaraju and Sardeshmukh [FSTTCS'16] ), - an application of sparse recovery techniques going slightly beyond the standard usage of linear graph sketching by Ahn, Guha and McGregor SODA'12
Revised:  an efficient implementation of some basic protocols , - a tighter analysis of a special case of the sampling approach by Karger , Klein and Tarjan [JACM'95] ( and related results by Pemmaraju and Sardeshmukh [FSTTCS'16] - an application of sparse recovery techniques going slightly beyond the standard usage of linear graph sketching by Ahn, Guha and McGregor SODA'12
Edit intent: fluency
Original:  an efficient implementation of some basic protocols , - a tighter analysis of a special case of the sampling approach by Karger , Klein and Tarjan [JACM'95] ( and related results by Pemmaraju and Sardeshmukh [FSTTCS'16] ), - an application of sparse recovery techniques going slightly beyond the standard usage of linear graph sketching by Ahn, Guha and McGregor SODA'12
Revised:  an efficient implementation of some basic protocols , - a tighter analysis of a special case of the sampling approach by Karger , Klein and Tarjan [JACM'95] ( and related results by Pemmaraju and Sardeshmukh [FSTTCS'16] ), - SODA'12
Edit intent: coherence
Original:  for 2<k%DIFDELCMD < \le %%% 6, the proof of its running time , but not the correctness of its output, relies on an unproven but reasonable conjecture due to Bach and Huelsbergen .
Revised:  for 2<k%DIFDELCMD < \le %%% 2. We prove correctness unconditionally, but the running time relies on two unproven but reasonable conjecture due to Bach and Huelsbergen .
Edit intent: clarity
Original:  for 2<k%DIFDELCMD < \le %%% 6, the proof of its running time , but not the correctness of its output, relies on an unproven but reasonable conjecture due to Bach and Huelsbergen .
Revised:  for 2<k%DIFDELCMD < \le %%% 6, the proof of its running time , but not the correctness of its output, relies on an unproven but reasonable conjectures .
Edit intent: clarity
Original:  Our approach gives a simple but nontrivial deterministic distributed APSP algorithm that runs in (n ^{3/2) rounds.
Revised:  Our (n ^{3/2) rounds.
Edit intent: clarity
Original:  This bound matches a recent deterministic distributed algorithm in }%DIFDELCMD < [%%% ARKP18 . We then combine our new distributed APSP algorithm with a modified version of the algorithm in%DIFDELCMD < [%%% ARKP18 to obtain an%DIFDELCMD < O%%% (n^{4/3 bound of O(n^{3/2}) rounds .
Revised:  This bound matches a recent deterministic distributed algorithm in }%DIFDELCMD < [%%% . We then combine our new distributed APSP algorithm with a modified version of the algorithm in%DIFDELCMD < [%%% ARKP18 to obtain an%DIFDELCMD < O%%% (n^{4/3 bound of O(n^{3/2}) rounds .
Edit intent: fluency
Original:  This bound matches a recent deterministic distributed algorithm in }%DIFDELCMD < [%%% ARKP18 . We then combine our new distributed APSP algorithm with a modified version of the algorithm in%DIFDELCMD < [%%% ARKP18 to obtain an%DIFDELCMD < O%%% (n^{4/3 bound of O(n^{3/2}) rounds .
Revised:  This bound matches a recent deterministic distributed algorithm in }%DIFDELCMD < [%%% ARKP18 . We then combine our new distributed APSP algorithm with a modified version of the algorithm in%DIFDELCMD < [%%% to obtain an%DIFDELCMD < O%%% (n^{4/3 bound of O(n^{3/2}) rounds .
Edit intent: fluency
Original:  This bound matches a recent deterministic distributed algorithm in }%DIFDELCMD < [%%% ARKP18 . We then combine our new distributed APSP algorithm with a modified version of the algorithm in%DIFDELCMD < [%%% ARKP18 to obtain an%DIFDELCMD < O%%% (n^{4/3 bound of O(n^{3/2}) rounds .
Revised:  This bound matches a recent deterministic distributed algorithm in }%DIFDELCMD < [%%% ARKP18 . We then combine our new distributed APSP algorithm with a modified version of the algorithm in%DIFDELCMD < [%%% ARKP18 %DIFDELCMD < O%%% (n^{4/3 bound of O(n^{3/2}) rounds .
Edit intent: clarity
Original:  These latter results are presented in a companion paper~\mbox{ AR18b
Edit intent: coherence
Original: Specific protein-protein interactions are crucial in most cellular processes.
Revised: Functional protein-protein interactions are crucial in most cellular processes.
Edit intent: clarity
Original:  We present a hybrid quantum-classical algorithm to solve 3SAT problems involving n << M variables that significantly speeds up its fully classical counterpart.
Revised:  We present a hybrid quantum-classical algorithm to solve 3SAT problems involving n >> M variables that significantly speeds up its fully classical counterpart.
Edit intent: fluency
Original: Analyzing job hopping behavior is important for the understanding of job preference and career progression of working individuals.
Revised: Analyzing job hopping behavior is important for understanding job preference and career progression of working individuals.
Edit intent: fluency
Original:  As a consequence, any non-negative Holant problem on cubic graphs has an efficient approximation algorithm unless the problem is  counting perfect matchings, whose approximation complexity is a central open problem in the area.
Revised:  As a consequence, any non-negative Holant problem on cubic graphs has an efficient approximation algorithm unless the problem is counting perfect matchings, a central open problem in the area.
Edit intent: coherence
Original:  In the case of multiple solutions, our approach finds the commonalities between the solutions.
Revised:  In case of multiple solutions, our approach finds the commonalities between the solutions.
Edit intent: fluency
Original:  Further experiments on realistic numerical phantoms and an experiments X-ray dataset show that our method compares favourably to alternative approaches, including Total Variation and DART.
Revised:  Further experiments on realistic numerical phantoms and an experiment on X-ray dataset show that our method compares favourably to alternative approaches, including Total Variation and DART.
Edit intent: fluency
Original:  Further experiments on realistic numerical phantoms and an experiments X-ray dataset show that our method compares favourably to alternative approaches, including Total Variation and DART.
Revised:  Further experiments on realistic numerical phantoms and an experiments X-ray dataset show that our method compares favourably to Total Variation and DART.
Edit intent: clarity
Original: We consider the information extraction approach known as document spanners, and study the problem of efficiently computing the results of the extraction from an input document, where the extraction task is described as a sequential variable-set automaton (VA).
Revised: We consider the information extraction framework known as document spanners, and study the problem of efficiently computing the results of the extraction from an input document, where the extraction task is described as a sequential variable-set automaton (VA).
Edit intent: clarity
Original:  Our goal is to have an algorithm which is tractable in combined complexity, i.e., in the  input document and in the VA;
Revised:  Our goal is to have an algorithm which is tractable in combined complexity, i.e., in the input document and the VA;
Edit intent: fluency
Original:  while ensuring the best possible data complexity bounds in the input document , in particular constant delay in the document  .
Revised:  while ensuring the best possible data complexity bounds in the input document size, i.e., constant delay in the document .
Edit intent: clarity
Original:  while ensuring the best possible data complexity bounds in the input document , in particular constant delay in the document  .
Revised:  while ensuring the best possible data complexity bounds in the input document , in particular constant delay in the document size .
Edit intent: clarity
Original:   Florenzano et al. suggest that our desired runtime guarantees cannot be met for general sequential VAs.
Revised:  In particular, Florenzano et al. suggest that our desired runtime guarantees cannot be met for general sequential VAs.
Edit intent: coherence
Original:  Each SP behaves selfishly to maximize the expected long-term payoff from  competition with other SPs for the orchestration of channel access opportunities over its MUs, which request both mobile-edge computing and traditional cellular services in the slices.
Revised:  Each SP behaves selfishly to maximize the expected long-term payoff from the competition with other SPs for the orchestration of channel access opportunities over its MUs, which request both mobile-edge computing and traditional cellular services in the slices.
Edit intent: fluency
Original:  Each SP behaves selfishly to maximize the expected long-term payoff from  competition with other SPs for the orchestration of channel access opportunities over its MUs, which request both mobile-edge computing and traditional cellular services in the slices.
Revised:  Each SP behaves selfishly to maximize the expected long-term payoff from competition with other SPs for the orchestration of channels, which provides its MUs with the opportunities to access the computation and communication slices.
Edit intent: clarity
Original:  This problem is modelled as a stochastic game, in which the decision makings of a SP depend on the  network dynamics as well as the control policies of its competitors.
Revised:  This problem is modelled as a stochastic game, in which the decision makings of a SP depend on the global network dynamics as well as the control policies of its competitors.
Edit intent: clarity
Original:  While CVaR has recently been used in optimization of linear costs functions in robotics, we take the first stages towards extending this to discrete submodular optimization and provide several positive results.
Revised:  While CVaR has recently been used in optimization of linear cost functions in robotics, we take the first stages towards extending this to discrete submodular optimization and provide several positive results.
Edit intent: fluency
Original: Are '' turn-on '' and '' turn-off '' functions in protein-protein interaction networks exact opposites of each other?
Revised: Are " turn-on '' and '' turn-off '' functions in protein-protein interaction networks exact opposites of each other?
Edit intent: fluency
Original: Are '' turn-on '' and '' turn-off '' functions in protein-protein interaction networks exact opposites of each other?
Revised: Are '' turn-on " and " turn-off '' functions in protein-protein interaction networks exact opposites of each other?
Edit intent: fluency
Original: Are '' turn-on '' and '' turn-off '' functions in protein-protein interaction networks exact opposites of each other?
Revised: Are '' turn-on '' and '' turn-off " functions in protein-protein interaction networks exact opposites of each other?
Edit intent: fluency
Original: In this paper, we consider a range-search variant of the closest-pair problem.
Revised: We consider a range-search variant of the closest-pair problem.
Edit intent: clarity
Original:  We present results on this problem for two important cases : when \varGamma is a polygon (possibly with holes) and when \varGamma is a general convex body whose boundary is smooth.
Revised:  We present results on this problem for two important settings : when \varGamma is a polygon (possibly with holes) and when \varGamma is a general convex body whose boundary is smooth.
Edit intent: clarity
Original: Adaptation mechanism of cells on the basis of stochastic gene expression and epigenetic modi- fication is proposed.
Revised: Adaptation mechanism of cells on the basis of stochastic gene expression and epigenetic modification is proposed.
Edit intent: fluency
Original:  In such a network of interacting queues, when a user transmits a packet, it causes interference to the nearby user and decreases its rate of communication . Each user is aware of the status of the network, and accordingly reconfigures its transmission parameters to improve the network performance.
Revised:  In such a network of interacting queues, when a user transmits a packet, it causes interference to the nearby user and decreases its successful transmission probability . Each user is aware of the status of the network, and accordingly reconfigures its transmission parameters to improve the network performance.
Edit intent: clarity
Original:  We investigate the ergodicity conditions  and use the generating function approach to investigate the queueing delay.
Revised:  We investigate the ergodicity conditions , and use the generating function approach to investigate the queueing delay.
Edit intent: fluency
Original:  Generating functions for the steady-state distribution are obtained by solving a finite system of linear equations  and a functional equation with the aid of the theory of Riemann-Hilbert boundary value problems  .
Revised:  Generating functions for the steady-state distribution are obtained by solving a finite system of linear equations , and a functional equation with the aid of the theory of Riemann-Hilbert boundary value problems .
Edit intent: fluency
Original:  Generating functions for the steady-state distribution are obtained by solving a finite system of linear equations  and a functional equation with the aid of the theory of Riemann-Hilbert boundary value problems  .
Revised:  Generating functions for the steady-state distribution are obtained by solving a finite system of linear equations and a functional equation with the aid of the theory of Riemann(-Hilbert) boundary value problems .
Edit intent: fluency
Original:  The use of this framework is demonstrated by two case studies of large, industrial codes: Europlexus and code _aster .
Revised:  The use of this framework is demonstrated by two case studies of large, industrial codes: Europlexus and code \_aster .
Edit intent: fluency
Original:  The use of this framework is demonstrated by two case studies of large, industrial codes: Europlexus and code \_aster .
Revised:  The use of this framework is demonstrated by two case studies of large, industrial codes: Europlexus and code _aster .
Edit intent: fluency
Original: The Human Intranet is envisioned as an open, scalable platform that seamlessly integrates an ever-increasing number of sensor , actuation, computation, storage, communication, and energy nodes located on, in, or around the human body, acting in symbiosis with the functions provided by the body itself.
Revised: The Human Intranet is envisioned as an open, scalable platform that seamlessly integrates an ever-increasing number of sensing , actuation, computation, storage, communication, and energy nodes located on, in, or around the human body, acting in symbiosis with the functions provided by the body itself.
Edit intent: fluency
Original:  The adaptive structure is implemented and tested in two sample scenarios  and the results are reported.
Revised:  The adaptive structure is implemented and tested in two sample scenarios , and the results are reported.
Edit intent: fluency
Original:  One of the byproducts from our proof technique is a generalization of a result on Sperner admissible labelings due to [Mirzakhani and Vondr\'{a}k, 2015] that might be of independent combinatorial interest.
Revised:  One of the ingredients of our proof technique is a generalization of a result on Sperner admissible labelings due to [Mirzakhani and Vondr\'{a}k, 2015] that might be of independent combinatorial interest.
Edit intent: clarity
Original:  We prove worst-case local convergence rates of order h^{q+1 for a wide range of versions of this Gaussian ODE filter, as well as global convergence rates of order h^q in the case of q=1 and an integrated Brownian motion prior, and analyze how inaccurate information on x coming from approximate evaluations of f affects these rates.
Revised:  This article establishes worst-case local convergence rates of order h^{q+1 for a wide range of versions of this Gaussian ODE filter, as well as global convergence rates of order h^q in the case of q=1 and an integrated Brownian motion prior, and analyze how inaccurate information on x coming from approximate evaluations of f affects these rates.
Edit intent: clarity
Original:  We prove worst-case local convergence rates of order h^{q+1 for a wide range of versions of this Gaussian ODE filter, as well as global convergence rates of order h^q in the case of q=1 and an integrated Brownian motion prior, and analyze how inaccurate information on x coming from approximate evaluations of f affects these rates.
Revised:  We prove worst-case local convergence rates of order q+1 for a wide range of versions of this Gaussian ODE filter, as well as global convergence rates of order h^q in the case of q=1 and an integrated Brownian motion prior, and analyze how inaccurate information on x coming from approximate evaluations of f affects these rates.
Edit intent: fluency
Original:  We prove worst-case local convergence rates of order h^{q+1 for a wide range of versions of this Gaussian ODE filter, as well as global convergence rates of order h^q in the case of q=1 and an integrated Brownian motion prior, and analyze how inaccurate information on x coming from approximate evaluations of f affects these rates.
Revised:  We prove worst-case local convergence rates of order h^{q+1 for a wide range of versions of this Gaussian ODE filter, as well as global convergence rates of order q in the case of q=1 and an integrated Brownian motion prior, and analyze how inaccurate information on x coming from approximate evaluations of f affects these rates.
Edit intent: clarity
Original:  We prove worst-case local convergence rates of order h^{q+1 for a wide range of versions of this Gaussian ODE filter, as well as global convergence rates of order h^q in the case of q=1 and an integrated Brownian motion prior, and analyze how inaccurate information on x coming from approximate evaluations of f affects these rates.
Revised:  We prove worst-case local convergence rates of order h^{q+1 for a wide range of versions of this Gaussian ODE filter, as well as global convergence rates of order h^q in the case of q=1 and an integrated Brownian motion prior, and analyses how inaccurate information on x coming from approximate evaluations of f affects these rates.
Edit intent: fluency
Original:  Moreover, we present explicit formulas for the steady states and show thatthe posterior confidence intervals are well calibrated in all considered cases that exhibit global convergence---in the sense that they globally contract at the same rate as the truncation error \dots .
Revised:  Moreover, we show that, in the globally convergent case, the posterior credible intervals are well calibrated in all considered cases that exhibit global convergence---in the sense that they globally contract at the same rate as the truncation error \dots .
Edit intent: clarity
Original:  Moreover, we present explicit formulas for the steady states and show thatthe posterior confidence intervals are well calibrated in all considered cases that exhibit global convergence---in the sense that they globally contract at the same rate as the truncation error \dots .
Revised:  Moreover, we present explicit formulas for the steady states and show thatthe posterior confidence intervals are well calibrated in the sense that they globally contract at the same rate as the truncation error \dots .
Edit intent: clarity
Original:  Moreover, we present explicit formulas for the steady states and show thatthe posterior confidence intervals are well calibrated in all considered cases that exhibit global convergence---in the sense that they globally contract at the same rate as the truncation error \dots .
Revised:  Moreover, we present explicit formulas for the steady states and show thatthe posterior confidence intervals are well calibrated in all considered cases that exhibit global convergence---in the sense that they globally contract at the same rate as the truncation error \dots\ .
Edit intent: fluency
Original:  These methods model the true solution x and its first q derivatives a priori as a Gauss--Markov process X, which is then iteratively conditioned on information about x.
Revised:  These methods model the true solution x and its first q derivatives a priori as a Gauss--Markov process X, which is then iteratively conditioned on information about x.
Edit intent: fluency