wanyu/IteraTeR_v2 huggingface dataset:
Original:  The hardware itself must be able to support super-logarithmic ebits of entanglement across some poly(n) number of qubit-bipartitions, otherwise the quantum state itself will not possess volumetric entanglement growth and full-lattice-range correlations.
Revised:  The hardware itself should be able to support super-logarithmic ebits of entanglement across some poly(n) number of qubit-bipartitions, otherwise the quantum state itself will not possess volumetric entanglement growth and full-lattice-range correlations.
Edit intent: coherence
Original:  The hardware itself must be able to support super-logarithmic ebits of entanglement across some poly(n) number of qubit-bipartitions, otherwise the quantum state itself will not possess volumetric entanglement growth and full-lattice-range correlations.
Revised:  The hardware itself must be able to support super-logarithmic ebits of entanglement across some poly(n) number of qubit-bipartitions, otherwise the quantum state itself will not possess volumetric entanglement scaling and full-lattice-range correlations.
Edit intent: clarity
Original:  Inspired by the area law of tensor networks, we derive an upperbound for the minimum random circuit depth needed to generate the maximal bipartite entanglement correlations between all problem variables (qubits).
Revised:  Inspired by the area law of tensor networks, we derive an upper bound for the minimum random circuit depth needed to generate the maximal bipartite entanglement correlations between all problem variables (qubits).
Edit intent: fluency
Original:  Hence, as we present a connection between quantum supremacy protocols and quantum entanglement, the entanglement implicitly generated by such protocols can be tested separately to further ascertain the validity of any quantum supremacy claim.
Revised:  Hence, as we present a connection between quantum advantage protocols and quantum entanglement, the entanglement implicitly generated by such protocols can be tested separately to further ascertain the validity of any quantum supremacy claim.
Edit intent: clarity
Original:  Hence, as we present a connection between quantum supremacy protocols and quantum entanglement, the entanglement implicitly generated by such protocols can be tested separately to further ascertain the validity of any quantum supremacy claim.
Revised:  Hence, as we present a connection between quantum supremacy protocols and quantum entanglement, the entanglement implicitly generated by such protocols can be tested separately to further ascertain the validity of any quantum advantage claim.
Edit intent: clarity
Original: Internet traffic continues to grow unabatedly at a rapid rate , driven largely by more and more video content, from 1080p HD to 4K Ultra HD video streaming today, to 8K Ultra HD video streaming in the near future.
Revised: Internet traffic continues to grow relentlessly , driven largely by more and more video content, from 1080p HD to 4K Ultra HD video streaming today, to 8K Ultra HD video streaming in the near future.
Edit intent: clarity
Original:  Although studies have shown that the majority of packets processed by Internet routers are pass-through traffic, they nonetheless have to be queued and routed at every hop in current networks, which unnecesssarily adds substantial delays and processing costs.
Revised:  Although studies have shown that the majority of packets processed by Internet routers are pass-through traffic, they nonetheless have to be queued and routed at every hop in current networks, which unnecessarily adds substantial delays and processing costs.
Edit intent: fluency
Original:  The convexity of our problem formulations ensures globally optimal solutions when solved as convex optimization problems .
Revised:  The convexity of our problem formulations ensures globally optimal solutions .
Edit intent: clarity
Original: In 2000, Elowitz and Leibler introduced the repressilator -- a synthetic gene circuit with three genes that cyclically repress transcription of the next -- as well as a corresponding mathematical model.
Revised: In 2000, Elowitz and Leibler introduced the repressilator--a synthetic gene circuit with three genes that cyclically repress transcription of the next -- as well as a corresponding mathematical model.
Edit intent: fluency
Original:  In 2006, M\"uller \textit{et al %DIFDELCMD < \MBLOCKRIGHTBRACE%%% .  generalized the model to an arbitrary number of genes and analyzed the resulting dynamics.
Revised:  In 2006, M\"uller \textit{et al %DIFDELCMD < \MBLOCKRIGHTBRACE%%% . \ generalized the model to an arbitrary number of genes and analyzed the resulting dynamics.
Edit intent: fluency
Original:  Finally, we derive new rates functions describing transcription rates which arise under more reasonable biological assumptions than the widely used single-step binding assumptions.
Revised:  Finally, we derive a new rate function describing transcription that arises under more reasonable biological assumptions than the widely used single-step binding assumptions.
Edit intent: clarity
Original:  Taken together, our results provide a better understanding of genetic regulation by repression.
Revised:  Taken together, our results enhance our understanding of genetic regulation by repression.
Edit intent: clarity
Original:  Our query oracle %DIFDELCMD < {\em %%%  Tripartite Independent Set  (TIS) takes three disjoint sets of vertices A, B and C as input, and answers whether there exists a triangle having one endpoint in each of these three sets.
Revised:  Our query oracle %DIFDELCMD < {\em %%% " Tripartite Independent Set (TIS) takes three disjoint sets of vertices A, B and C as input, and answers whether there exists a triangle having one endpoint in each of these three sets.
Edit intent: fluency
Original:  Our query oracle %DIFDELCMD < {\em %%%  Tripartite Independent Set  (TIS) takes three disjoint sets of vertices A, B and C as input, and answers whether there exists a triangle having one endpoint in each of these three sets.
Revised:  Our query oracle %DIFDELCMD < {\em %%% Tripartite Independent Set " (TIS) takes three disjoint sets of vertices A, B and C as input, and answers whether there exists a triangle having one endpoint in each of these three sets.
Edit intent: fluency
Original:  Our query model is inspired by the %DIFDELCMD < {\em %%%  Bipartite Independent Set  (BIS) query oracle of Beame %DIFDELCMD < {\em %%% et al. (ITCS 2018).
Revised:  Our query model is inspired by the %DIFDELCMD < {\em %%% " Bipartite Independent Set (BIS) query oracle of Beame %DIFDELCMD < {\em %%% et al. (ITCS 2018).
Edit intent: fluency
Original:  Our query model is inspired by the %DIFDELCMD < {\em %%%  Bipartite Independent Set  (BIS) query oracle of Beame %DIFDELCMD < {\em %%% et al. (ITCS 2018).
Revised:  Our query model is inspired by the %DIFDELCMD < {\em %%% Bipartite Independent Set " (BIS) query oracle of Beame %DIFDELCMD < {\em %%% et al. (ITCS 2018).
Edit intent: fluency
Original:  Our query model is inspired by the %DIFDELCMD < {\em %%%  Bipartite Independent Set  (BIS) query oracle of Beame %DIFDELCMD < {\em %%% et al. (ITCS 2018).
Revised:  Our query model is inspired by the %DIFDELCMD < {\em %%% Bipartite Independent Set (BIS) query oracle of Beame %DIFDELCMD < {\em %%% et al. (ITCS, 2018).
Edit intent: clarity
Original:  We extend the algorithmic framework of Beame %DIFDELCMD < {\em %%% et al. , with%DIFDELCMD < \tis %DIFDELCMD < %%% replacing%DIFDELCMD < \bis%%%  , for triangle counting using ideas from color coding due to Alon et al. (J. ACM, 1995) and a concentration inequality for sums of random variables with bounded dependency due to Janson (Rand.
Revised:  We extend the algorithmic framework of Beame %DIFDELCMD < {\em %%% et al. %DIFDELCMD < \tis %DIFDELCMD < %%% replacing%DIFDELCMD < \bis%%% , for triangle counting using ideas from color coding due to Alon et al. (J. ACM, 1995) and a concentration inequality for sums of random variables with bounded dependency due to Janson (Rand.
Edit intent: fluency
Original:  We extend the algorithmic framework of Beame %DIFDELCMD < {\em %%% et al. , with%DIFDELCMD < \tis %DIFDELCMD < %%% replacing%DIFDELCMD < \bis%%%  , for triangle counting using ideas from color coding due to Alon et al. (J. ACM, 1995) and a concentration inequality for sums of random variables with bounded dependency due to Janson (Rand.
Revised:  We extend the algorithmic framework of Beame %DIFDELCMD < {\em %%% et al. , with%DIFDELCMD < \tis %DIFDELCMD < %%% %DIFDELCMD < \bis%%% , for triangle counting using ideas from color coding due to Alon et al. (J. ACM, 1995) and a concentration inequality for sums of random variables with bounded dependency due to Janson (Rand.
Edit intent: fluency
Original:  In this work, we provide the first approximate triangle counting algorithm using only polylogarithmic queries \emph{ .
Revised:  In this work, we provide an algorithm that approximately counts the number of triangles in a graph using only polylogarithmic queries \emph{ .
Edit intent: clarity
Original:  In this work, we provide the first approximate triangle counting algorithm using only polylogarithmic queries \emph{ .
Revised:  In this work, we provide the first approximate triangle counting algorithm using only polylogarithmic queries when\emph{ .
Edit intent: coherence
Original:  Our query oracle " {\em Tripartite Independent Set " (TIS) takes three disjoint sets of vertices A, B and C as input , and answers whether there exists a triangle having one endpoint in each of these three sets.
Revised:  Our query oracle {\em Tripartite Independent Set " (TIS) takes three disjoint sets of vertices A, B and C as input , and answers whether there exists a triangle having one endpoint in each of these three sets.
Edit intent: fluency
Original:  Our query oracle " {\em Tripartite Independent Set " (TIS) takes three disjoint sets of vertices A, B and C as input , and answers whether there exists a triangle having one endpoint in each of these three sets.
Revised:  Our query oracle " {\em Tripartite Independent Set (TIS) takes three disjoint sets of vertices A, B and C as input , and answers whether there exists a triangle having one endpoint in each of these three sets.
Edit intent: fluency
Original:  Our query oracle " {\em Tripartite Independent Set " (TIS) takes three disjoint sets of vertices A, B and C as input , and answers whether there exists a triangle having one endpoint in each of these three sets.
Revised:  Our query oracle " {\em Tripartite Independent Set " (TIS) takes three disjoint sets of vertices A, B and C as inputs , and answers whether there exists a triangle having one endpoint in each of these three sets.
Edit intent: fluency
Original:  Our query model   is inspired by the " {\em Bipartite Independent Set " (BIS) query oracle of Beame {\em et al. (ITCS, 2018).
Revised:  Our query model is inspired by the {\em Bipartite Independent Set " (BIS) query oracle of Beame {\em et al. (ITCS, 2018).
Edit intent: fluency
Original:  Our query model   is inspired by the " {\em Bipartite Independent Set " (BIS) query oracle of Beame {\em et al. (ITCS, 2018).
Revised:  Our query model is inspired by the " {\em Bipartite Independent Set (BIS) query oracle of Beame {\em et al. (ITCS, 2018).
Edit intent: fluency
Original:  Our query model   is inspired by the " {\em Bipartite Independent Set " (BIS) query oracle of Beame {\em et al. (ITCS, 2018).
Revised:  Our query model is inspired by the " {\em Bipartite Independent Set " (BIS) query oracle of Beame {\em et al. (ITCS 2018).
Edit intent: fluency
Original:  Their algorithm for edge estimation requires only polylogarithmic BIS queries, where a BIS query takes two disjoint sets A and B as input and answers whether there is an edge with endpoints in A and B.
Edit intent: coherence
Original:  Struct. Alg., 2004)\tis \bis .
Revised:  Struct. Alg., 2004)\tis replacing\bis .
Edit intent: fluency
Original: We show that the social dynamics responsible for the formation of recurrent component structures observed in real human face-to-face interaction networks  find a natural explanation in the assumption that the agents of the  network reside in a hidden similarity space.
Revised: We show that the social dynamics responsible for the formation of connected components that appear recurrently in face-to-face interaction networks find a natural explanation in the assumption that the agents of the network reside in a hidden similarity space.
Edit intent: clarity
Original: We show that the social dynamics responsible for the formation of recurrent component structures observed in real human face-to-face interaction networks  find a natural explanation in the assumption that the agents of the  network reside in a hidden similarity space.
Revised: We show that the social dynamics responsible for the formation of recurrent component structures observed in real human face-to-face interaction networks , find a natural explanation in the assumption that the agents of the network reside in a hidden similarity space.
Edit intent: fluency
Original:  Monero, a recent alternative currency enables mining with standard hardware in contrast to special hardware (ASICs) as often used in Bitcoin, paving the way for browser-based mining as a new revenue model for website operators.
Revised:  The Monero currency enables mining with standard hardware in contrast to special hardware (ASICs) as often used in Bitcoin, paving the way for browser-based mining as a new revenue model for website operators.
Edit intent: clarity
Original:  Monero, a recent alternative currency enables mining with standard hardware in contrast to special hardware (ASICs) as often used in Bitcoin, paving the way for browser-based mining as a new revenue model for website operators.
Revised:  Monero, a recent alternative currency enables mining with standard hardware in contrast to special hardware (ASICs) as often used in Bitcoin, paving the way for in-browser mining as a new revenue model for website operators.
Edit intent: clarity
Original: We present a framework for  efficient application of stateless model checking (SMC) to concurrent programs running under the Release-Acquire (RA) fragment of the C/C++11 memory model.
Revised: We present a framework for the efficient application of stateless model checking (SMC) to concurrent programs running under the Release-Acquire (RA) fragment of the C/C++11 memory model.
Edit intent: fluency
Original:  Our approach is based on exploring the possible program orders, which define the order in which instructions of a thread are executed, and read-from relations, which define how reads obtain their values from writes.
Revised:  Our approach is based on exploring the possible program orders, which define the order in which instructions of a thread are executed, and read-from relations, which specify how reads obtain their values from writes.
Edit intent: clarity
Original:  This is in contrast to previous approaches, which in addition explore the possible coherence orders, i.e., orderings between conflicting writes.
Revised:  This is in contrast to previous approaches, which also explore the possible coherence orders, i.e., orderings between conflicting writes.
Edit intent: fluency
Original:  Since unexpected test results such as program crashes or assertion violations depend only on the read-from relation, we avoid a potentially large source of redundancy.
Revised:  Since unexpected test results such as program crashes or assertion violations depend only on the read-from relation, we avoid a potentially significant source of redundancy.
Edit intent: clarity
Original:  We have implemented our framework in the tool TRACER . Experiments show that TRACER can be significantly faster than state-of-the-art tools that can handle the RA semantics.
Revised:  We have implemented our framework in the tool Tracer . Experiments show that TRACER can be significantly faster than state-of-the-art tools that can handle the RA semantics.
Edit intent: fluency
Original:  We have implemented our framework in the tool TRACER . Experiments show that TRACER can be significantly faster than state-of-the-art tools that can handle the RA semantics.
Revised:  We have implemented our framework in the tool TRACER . Experiments show that Tracer can be significantly faster than state-of-the-art tools that can handle the RA semantics.
Edit intent: style
Original: The notion of tree-cut width has been introduced by Wollan The structure of graphs not admitting a fixed immersion.
Revised:  The structure of graphs not admitting a fixed immersion.
Edit intent: coherence
Original: The notion of tree-cut width has been introduced by Wollan The structure of graphs not admitting a fixed immersion.
Revised: The notion of tree-cut width has been introduced by Wollan 
Edit intent: clarity
Original: %DIFDELCMD < {\it %%% Journal of Combinatorial Theory, Series B , 110:47 - 66, 2015%DIFDELCMD < ]%%% . It is defined via tree-cut decompositions, which are tree-like decompositions that highlight small (edge) cuts in a graph.
Revised: %DIFDELCMD < {\it %%% , 110:47 - 66, 2015%DIFDELCMD < ]%%% . It is defined via tree-cut decompositions, which are tree-like decompositions that highlight small (edge) cuts in a graph.
Edit intent: coherence
Original: %DIFDELCMD < {\it %%% Journal of Combinatorial Theory, Series B , 110:47 - 66, 2015%DIFDELCMD < ]%%% . It is defined via tree-cut decompositions, which are tree-like decompositions that highlight small (edge) cuts in a graph.
Revised: %DIFDELCMD < {\it %%% Journal of Combinatorial Theory, Series B %DIFDELCMD < ]%%% . It is defined via tree-cut decompositions, which are tree-like decompositions that highlight small (edge) cuts in a graph.
Edit intent: coherence
Original:  In this paper, we prove that every graph admits an optimal tree-cut decomposition that satisfies a certain Menger-like condition similar to that of the lean tree decompositions of Thomas [A ~menger-like property of tree-width: The finite case. %DIFDELCMD < {\it %%% Journal of Combinatorial Theory, Series B , 48(1): 67 - 76 , 1990].
Revised:  In this paper, we prove that every graph admits an optimal tree-cut decomposition that satisfies a certain Menger-like condition similar to that of the lean tree decompositions of Thomas [A Menger-like property of tree-width: The finite case. %DIFDELCMD < {\it %%% Journal of Combinatorial Theory, Series B , 48(1): 67 - 76 , 1990].
Edit intent: fluency
Original:  In this paper, we prove that every graph admits an optimal tree-cut decomposition that satisfies a certain Menger-like condition similar to that of the lean tree decompositions of Thomas [A ~menger-like property of tree-width: The finite case. %DIFDELCMD < {\it %%% Journal of Combinatorial Theory, Series B , 48(1): 67 - 76 , 1990].
Revised:  In this paper, we prove that every graph admits an optimal tree-cut decomposition that satisfies a certain Menger-like condition similar to that of the lean tree decompositions of Thomas [A ~menger-like property of tree-width: The finite case. %DIFDELCMD < {\it %%% Journal of Combinatorial Theory, Series B , 48(1): 67-76 , 1990].
Edit intent: fluency
Original:  Our results imply the%DIFDELCMD < {\sl %%% constructive existence, for every fixed r, of a linear algorithm for deciding whether the ] tree-cut width of a graph is at most r .
Revised:  Our results imply the%DIFDELCMD < {\sl %%% existence, for every fixed r, of a linear algorithm for deciding whether the ] tree-cut width of a graph is at most r .
Edit intent: fluency
Original:  In this work, we present our investigation on Shake-Shake regularization, drawing connections to the vicinal risk minimization principle and discriminative feature learning in face verification .
Revised:  In this work, we present our investigation on Shake-Shake regularization, drawing connections to the vicinal risk minimization principle and discriminative feature learning in verification tasks .
Edit intent: clarity
Original:  We show that if the zero matrix 0 is a product of matrices in M  then there are M_1, \ldots, M_{n^5} \in M with M_1 \cdots M_{n^5} = 0. This result has applications in automata theory and the theory of codes.
Revised:  We show that if the zero matrix 0 is a product of matrices in M , then there are M_1, \ldots, M_{n^5} \in M with M_1 \cdots M_{n^5} = 0. This result has applications in automata theory and the theory of codes.
Edit intent: fluency
Original:  Specifically, if X \subset \Sigma^* is a finite incomplete code  then there exists a word w \in \Sigma^* of length polynomial in x \in X |x| such that w is not a factor of any word in X^*.
Revised:  Specifically, if X \subset \Sigma^* is a finite incomplete code , then there exists a word w \in \Sigma^* of length polynomial in x \in X |x| such that w is not a factor of any word in X^*.
Edit intent: fluency
Original:  This study investigates parameter identification of a previously developed nonlinear respiratory mechanics model ~\mbox{ Ellwein18 tuned to the physiology of a 1 kg preterm infant, using local deterministic sensitivity analysis, subset selection, and gradient-based optimization.
Revised:  This study investigates parameter identification of a previously developed nonlinear respiratory mechanics model ~\mbox{ Ellwein18 tuned to the physiology of 1 kg preterm infant, using local deterministic sensitivity analysis, subset selection, and gradient-based optimization.
Edit intent: fluency
Original:  Here the unknown is a vector field that is specified by  large or infinite number of degrees of freedom.
Revised:  Here the unknown is a vector field that is specified by a large or infinite number of degrees of freedom.
Edit intent: fluency
Original:  Since the inverse problem is ill-posed, i.e., there may be many or no background flows that match a given set of observations, we adopt a Bayesian approach , incorporating prior knowledge of background flows and models of the observation error to develop probabilistic estimates of the fluid flow .
Revised:  Since the inverse problem is ill-posed, i.e., there may be many or no background flows that match a given set of observations, we adopt a Bayesian approach to regularize it .
Edit intent: clarity
Original:  First, we lay out a functional analytic and Bayesian framework for approaching this problem - a common experimental approach to visualizing complex fluid flows . Second, we define an adjoint method for efficient computation of the gradient of the log likelihood, a key ingredient in many numerical methods.
Revised:  First, we lay out a functional analytic and Bayesian framework for approaching this problem . Second, we define an adjoint method for efficient computation of the gradient of the log likelihood, a key ingredient in many numerical methods.
Edit intent: coherence
Original:  Finally, we identify two interesting example problems with very different posterior structures, which we use to conduct a large-scale benchmark of the convergence of several Markov Chain Monte Carlo methods that have been developed in recent years for infinite-dimensional settings.
Revised:  Finally, we identify interesting example problems with very different posterior structures, which we use to conduct a large-scale benchmark of the convergence of several Markov Chain Monte Carlo methods that have been developed in recent years for infinite-dimensional settings.
Edit intent: clarity
Original:  Finally, we identify two interesting example problems with very different posterior structures, which we use to conduct a large-scale benchmark of the convergence of several Markov Chain Monte Carlo methods that have been developed in recent years for infinite-dimensional settings.
Revised:  Finally, we identify two interesting example problems with very different posterior structures, which we use to conduct a large-scale benchmark of Markov Chain Monte Carlo methods that have been developed in recent years for infinite-dimensional settings.
Edit intent: clarity