wanyu/IteraTeR_v2 huggingface dataset:
Original:  Secondly , we investigate different notions of what it means to "classically simulate" a quantum circuit.
Revised:  Second , we investigate different notions of what it means to "classically simulate" a quantum circuit.
Edit intent: coherence
Original:  Our results provide more examples where seemingly modest changes to the ingredients of Clifford circuits lead to large changes in the classical simulation complexity under plausible complexity assumptions .
Revised:  Our results provide more examples where seemingly modest changes to the ingredients of Clifford circuits lead to "large" changes in the classical simulation complexity under plausible complexity assumptions .
Edit intent: fluency
Original:  Our algorithm with probability (1-p_{err}) returns an estimate of |I| accurate within a factor (1\pmerr) invoking RandomSample(I) at most O \!%DIFDELCMD < \left(%%% \big( 1{err}\log(\frac{1{p_{err}})}|I| %DIFDELCMD < \right) %DIFDELCMD < %%% \big) times (for 1{err}\log(\frac{1{p_{err}})}=O %DIFDELCMD < \big(%%% \sqrt{|I|}%DIFDELCMD < \big)%%%  ).
Revised:  Our algorithm with probability (1-p_{err}) returns an estimate of |I| accurate within a factor (1\pmerr) invoking RandomSample(I) at most O %DIFDELCMD < \left(%%% \big( 1{err}\log(\frac{1{p_{err}})}|I| %DIFDELCMD < \right) %DIFDELCMD < %%% \big) times (for 1{err}\log(\frac{1{p_{err}})}=O %DIFDELCMD < \big(%%% \sqrt{|I|}%DIFDELCMD < \big)%%% ).
Edit intent: coherence
Original:  Our algorithm with probability (1-p_{err}) returns an estimate of |I| accurate within a factor (1\pmerr) invoking RandomSample(I) at most O \!%DIFDELCMD < \left(%%% \big( 1{err}\log(\frac{1{p_{err}})}|I| %DIFDELCMD < \right) %DIFDELCMD < %%% \big) times (for 1{err}\log(\frac{1{p_{err}})}=O %DIFDELCMD < \big(%%% \sqrt{|I|}%DIFDELCMD < \big)%%%  ).
Revised:  Our algorithm with probability (1-p_{err}) returns an estimate of |I| accurate within a factor (1\pmerr) invoking RandomSample(I) at most O \!%DIFDELCMD < \left(%%% \big( 1{err}\log(\frac{1{p_{err}})}|I| %DIFDELCMD < \right) %DIFDELCMD < %%% \big) times (for 1{err}\log(\frac{1{p_{err}})}=O %DIFDELCMD < \big(%%% \sqrt{|I|}%DIFDELCMD < \big)%%% (\sqrt{|I| ).
Edit intent: coherence
Original: One of the advantages of adopting the Model Based Development (MBD) process is that it enables testing and verification at early stages of development.
Revised: One of the advantages of adopting a Model Based Development (MBD) process is that it enables testing and verification at early stages of development.
Edit intent: fluency
Original:  Namely, given a parametric specification with multiple parameters, our solution can automatically infer the ranges of parameters for which the property holds/ does not hold on the system.
Revised:  Namely, given a parametric specification with multiple parameters, our solution can automatically infer the ranges of parameters for which the property does not hold on the system.
Edit intent: coherence
Original:  We include solutions and algorithms for the exploration and visualization of multi-parameter specifications.
Revised:  We include solutions and algorithms for the exploration and visualization of multi-parametric specifications.
Edit intent: fluency
Original:  We include solutions and algorithms for the exploration and visualization of multi-parametric specifications.
Revised:  We include algorithms for the exploration and visualization of multi-parametric specifications.
Edit intent: clarity
Original:  The framework is demonstrated on an industrial size, high-fidelity engine model and examples from the related literature.
Revised:  The framework is demonstrated on an industrial size, high-fidelity engine model as well as examples from related literature.
Edit intent: clarity
Original:  A basic representative and complexity of a homotopy equivalence class are defined and investigated.
Revised:  A basic graph and the complexity of a homotopy equivalence class are defined and investigated.
Edit intent: clarity
Original:  Diagrams are given of basic representatives with the complexity N less than 6.
Revised:  Diagrams are given of basic graphs with the complexity N less than 6.
Edit intent: clarity
Original:  This motivated us to employ cooperative games and to propose a Coalitional Game-Theoretic Clustering (CGTC) algorithm for WSNs. Basically two kinds of coalitions are formed regarding the location of sensor nodes , where local parameters play an important role in forming coalitions.
Revised:  This motivated us to employ cooperative games and propose a new clustering scheme called Coalitional Game-Theoretic Clustering (CGTC) algorithm for WSNs. Basically two kinds of coalitions are formed regarding the location of sensor nodes , where local parameters play an important role in forming coalitions.
Edit intent: clarity
Original:  Second, this aggregate of distinct cell types should show better growth than that of an isolated cell in the environment .
Revised:  Second, this aggregate of distinct cell types shows better growth than that of an isolated cell in the environment .
Edit intent: clarity
Original:  Third, this cell aggregate should show robustness in the number distribution of differentiated cell types.
Revised:  Third, this cell aggregate is robust in the number distribution of differentiated cell types.
Edit intent: clarity
Original:  The reactions convert external nutrients to internal components for cellular growth, and the divided cells interact through chemical diffusion.
Revised:  The reactions convert external nutrients into internal components for cellular growth, and the divided cells interact through chemical diffusion.
Edit intent: fluency
Original:  The reactions convert external nutrients to internal components for cellular growth, and the divided cells interact through chemical diffusion.
Revised:  The reactions convert external nutrients to internal components for cellular growth, and the divided cells interact via chemical diffusion.
Edit intent: fluency
Original:  This symbiotic differentiation emerged for a class of reaction networks under the condition of nutrient limitation and strong cell-cell interactions.
Revised:  This symbiotic differentiation emerged for a class of reaction networks with limited resources and strong cell-cell interactions.
Edit intent: clarity
Original:  Then, robustness in the cell type distribution was achieved, while instability of collective growth sometimes emerged even among the cooperative cells when the internal reserves of chemical products is dominant.
Revised:  Then, robustness in the cell type distribution was achieved, while instability of collective growth could emerge even among the cooperative cells when the internal reserves of chemical products is dominant.
Edit intent: clarity
Original:  Then, robustness in the cell type distribution was achieved, while instability of collective growth sometimes emerged even among the cooperative cells when the internal reserves of chemical products is dominant.
Revised:  Then, robustness in the cell type distribution was achieved, while instability of collective growth sometimes emerged even among the cooperative cells when the internal reserves of products were dominant.
Edit intent: clarity
Original:  The simplicity and generality of the present mechanism suggests that evolution to multicellularity is a natural consequence of interacting cells with limited resources, being consistent with the  behaviors and forms of several extant primitive forms of multicellularity, such as certain bacteria .
Revised:  The simplicity and generality of the present mechanism suggests that evolution to multicellularity is a natural consequence of interacting cells with limited resources, being consistent with the behaviors and forms of several aggregates of unicellular organisms .
Edit intent: clarity
Original:  This approach is based on a convex programming relaxation of the classical (generalized) modularity maximization formulation, followed by a novel doubly-weighted \ell_1 -norm k-median procedure.
Revised:  Our approach is based on a convex programming relaxation of the classical (generalized) modularity maximization formulation, followed by a novel doubly-weighted \ell_1 -norm k-median procedure.
Edit intent: fluency
Original:  This approach is based on a convex programming relaxation of the classical (generalized) modularity maximization formulation, followed by a novel doubly-weighted \ell_1 -norm k-median procedure.
Revised:  This approach is based on a convex programming relaxation of the classical (generalized) modularity maximization formulation, followed by a novel doubly-weighted \ell_1 -norm k -median procedure.
Edit intent: fluency
Original:  Experiment results show that our method enjoys competitive empirical performance compared to the state-of-the-art tractable methods in the literature.
Revised:  Experiment results show that our method enjoys competitive performance compared to the state-of-the-art tractable methods in the literature.
Edit intent: clarity
Original:  Experiment results show that our method enjoys competitive empirical performance compared to the state-of-the-art tractable methods in the literature.
Revised:  Experiment results show that our method enjoys competitive empirical performance compared to the state of the art in the literature.
Edit intent: clarity
Original:  Quantum networks must classically exchange complex metadata between devices in order to carry out information for protocols such as teleportation, super-dense coding, and quantum key distribution.
Edit intent: coherence
Original:   On finding the server unavailable ( busy or failed), inbound calls join the orbit and reattempt for service at exponentially-distributed time intervals.
Revised:  On finding the server unavailable ( either busy or temporarily broken down), incoming calls intrinsically join the virtual orbit from which they re-attempt for service at exponentially-distributed time intervals.
Edit intent: clarity
Original:   On finding the server unavailable ( busy or failed), inbound calls join the orbit and reattempt for service at exponentially-distributed time intervals.
Revised:  On finding the server unavailable ( busy or failed), inbound calls join the orbit and reattempt for service at exponentially distributed time intervals.
Edit intent: fluency
Original:  The system stability condition and probability generating functions  of the number of calls in orbit and system are derived and evaluated numerically in the context of mean system size, server availability, failure frequency , and orbit waiting time.
Revised:  The system stability condition along with probability generating functions of the number of calls in orbit and system are derived and evaluated numerically in the context of mean system size, server availability, failure frequency , and orbit waiting time.
Edit intent: clarity
Original:  The system stability condition and probability generating functions  of the number of calls in orbit and system are derived and evaluated numerically in the context of mean system size, server availability, failure frequency , and orbit waiting time.
Revised:  The system stability condition and probability generating functions of the number of calls in orbit and system are derived and evaluated numerically in the context of mean system size, server availability, failure frequency and orbit waiting time.
Edit intent: fluency
Original: Approximating a definite integral of product of cosines to within an accuracy of 2^-n ]  is equivalent to counting the number of equal-sum partitions of a set of positive integers , and is thus a #P problem.
Revised: Approximating a definite integral of product of cosines to within an accuracy of 2^-n ] is equivalent to counting the number of equal-sum partitions of the integers and is thus a #P problem.
Edit intent: clarity
Original:   Efficient numerical integration methods such as the double exponential formula , also known as tanh-sinh quadrature, have been around from the mid 70's.
Revised:  Efficient numerical integration methods such as the double exponential formula , also known as tanh-sinh quadrature, have been around since the mid 70's.
Edit intent: fluency
Original:  Taking note of the hardness of approximating the integral of interest we argue that unless P=NP the proven rates of convergence of such methods cannot possibly be correct  .
Revised:  Noting the hardness of approximating the integral of interest we argue that unless P=NP the proven rates of convergence of such methods cannot possibly be correct .
Edit intent: clarity
Original:  Taking note of the hardness of approximating the integral of interest we argue that unless P=NP the proven rates of convergence of such methods cannot possibly be correct  .
Revised:  Taking note of the hardness of approximating the integral we argue that unless P=NP the proven rates of convergence of such methods cannot possibly be correct .
Edit intent: clarity
Original:  Taking note of the hardness of approximating the integral of interest we argue that unless P=NP the proven rates of convergence of such methods cannot possibly be correct  .
Revised:  Taking note of the hardness of approximating the integral of interest we argue that the proven rates of convergence of such methods cannot possibly be correct .
Edit intent: clarity
Original:  In recent years, many researchers have successfully applied Siamese neural networks to obtain an embedding of data which corresponds to a "semantic similarity . "  We present an interpretation of this "semantic similarity" as learning of equivalence classes.
Revised:  In recent years, many researchers have successfully applied Siamese neural networks to obtain an embedding of data which corresponds to a "semantic similarity " We present an interpretation of this "semantic similarity" as learning of equivalence classes.
Edit intent: fluency
Original:  In recent years, many researchers have successfully applied Siamese neural networks to obtain an embedding of data which corresponds to a "semantic similarity . "  We present an interpretation of this "semantic similarity" as learning of equivalence classes.
Revised:  In recent years, many researchers have successfully applied Siamese neural networks to obtain an embedding of data which corresponds to a "semantic similarity . " . We present an interpretation of this "semantic similarity" as learning of equivalence classes.
Edit intent: fluency
Original: Motivation: Modelling methods that find structure in data are necessary with the current high volumes of genomic data, and there have been various efforts to find subsets of genes exhibiting consistent patterns over subsets of treatments.
Revised: Motivation: Modelling methods that find structure in data are necessary with the current large volumes of genomic data, and there have been various efforts to find subsets of genes exhibiting consistent patterns over subsets of treatments.
Edit intent: clarity
Original:  These biclustering techniques have usually focused on gene expression data only .
Revised:  These biclustering techniques have focused on one data source, often gene expression data only .
Edit intent: clarity
Original:  These biclustering techniques have usually focused on gene expression data only .
Revised:  These biclustering techniques have usually focused on gene expression data .
Edit intent: clarity
Original:  Results: Our simulation studies show that the proposed method reliably infers biclusters from heterogeneous data sources.
Revised:  Results: Our simulation studies show that the proposed method reliably infers bi-clusters from heterogeneous data sources.
Edit intent: fluency
Original:  We then tested the method on data from the NCI-DREAM drug sensitivity prediction challenge, resulting in an excellent prediction accuracy.
Revised:  We tested the method on data from the NCI-DREAM drug sensitivity prediction challenge, resulting in an excellent prediction accuracy.
Edit intent: coherence
Original:  The recently released Stanford Natural Language Inference (SNLI) corpus has made it possible to develop and evaluate learning-centered methods such as deep neural networks for the NLItask .
Revised:  The recently released Stanford Natural Language Inference (SNLI) corpus has made it possible to develop and evaluate learning-centered methods such as deep neural networks for natural language inference (NLI) .
Edit intent: clarity
Original:  Our model builds on top of a recently proposed neutral attention model for NLI but is based on a significantly different idea.
Revised:  Our model builds on top of a recently proposed neural attention model for NLI but is based on a significantly different idea.
Edit intent: clarity
Original:  Instead of deriving sentence embeddings for the premise and the hypothesis to be used for classification, our solution uses a matching-LSTM that performs word-by-word matching of the hypothesis with the premise.
Revised:  Instead of deriving sentence embeddings for the premise and the hypothesis to be used for classification, our solution uses a match-LSTM to perform word-by-word matching of the hypothesis with the premise.
Edit intent: coherence
Original:  Our experiments on the SNLI corpus show that our model outperforms the state of the art, achieving an accuracy of 86.1\% on the test data .
Revised:  On the SNLI corpus show that our model outperforms the state of the art, achieving an accuracy of 86.1\% on the test data .
Edit intent: clarity
Original:  Our experiments on the SNLI corpus show that our model outperforms the state of the art, achieving an accuracy of 86.1\% on the test data .
Revised:  Our experiments on the SNLI corpus , our model achieves an accuracy of 86.1\% on the test data .
Edit intent: clarity
Original:  Our experiments on the SNLI corpus show that our model outperforms the state of the art, achieving an accuracy of 86.1\% on the test data .
Revised:  Our experiments on the SNLI corpus show that our model outperforms the state of the art, achieving an accuracy of 86.1\% , outperforming the state of the art .
Edit intent: clarity
Original: Imaging a single protein has been a long-standing dream for advancing structural biology and with this various fields in natural science  .
Revised: Imaging single proteins has been a long-standing dream for advancing structural biology and with this various fields in natural science .
Edit intent: fluency
Original: Imaging a single protein has been a long-standing dream for advancing structural biology and with this various fields in natural science  .
Revised: Imaging a single protein has been a long-standing ambition for advancing various fields in natural science .
Edit intent: clarity
Original:  Here we show that soft-landing electrospray beam deposition allows for specific selection and sound deposition of individual proteins and protein complexes onto ultraclean freestanding graphene in an ultra-high vacuum environment.
Revised:  Here we show that soft-landing electrospray beam deposition allows for specific selection and sound deposition of individual proteins and protein complexes on ultraclean freestanding graphene in an ultra-high vacuum environment.
Edit intent: fluency
Original:  With this, images of individual folded proteins and protein complexes, not being the result of an averaging process , have been obtained for the first time .
Revised:  With this, images of individual folded proteins and protein complexes, not being the result of an averaging process .
Edit intent: clarity
Original:  Our first contribution is to adapt the classic operational semantics of lambda-calculus to the continuous case, via creating a measure space on terms and defining step-indexed approximations.
Revised:  Our first contribution is to adapt the classic operational semantics of lambda-calculus to a continuous setting via creating a measure space on terms and defining step-indexed approximations.
Edit intent: clarity
Original:  A key step is defining a sampling semantics of a term as a function from a trace of random samples to a value , and showing that the distribution induced by integrating over all traces equals the distributional semantics.
Revised:  A key step is defining a sampling semantics of a term as a function from a trace of random samples to a value . We show that the distribution induced by integrating over all traces equals the distributional semantics.
Edit intent: coherence
Original:  Another step is defining sufficient conditions for the distribution induced by trace MCMC to converge to the distributional semantics.
Revised:  Another step is defining sufficient conditions for the distribution induced by trace MCMC to converge to the distribution-based semantics.
Edit intent: clarity
Original: In a paper that initiated the modern study of the stochastic block model, Decelle , Krzakala, Moore and Zdeborov\'a made a fascinating conjecture: Denote by k the number of balanced communities, a/n the probability of connecting inside clusters and b/n across clusters , and set SNR= ( a-b )^2 / (k(a+(k-1)b)) ;
Revised: In a paper that initiated the modern study of the stochastic block model, Decelle , Krzakala, Moore and Zdeborov\'a made a fascinating conjecture: Denote by k the number of balanced communities, a/n the probability of connecting inside communities and b/n across clusters , and set SNR= ( a-b )^2 / (k(a+(k-1)b)) ;
Edit intent: fluency
Original: In a paper that initiated the modern study of the stochastic block model, Decelle , Krzakala, Moore and Zdeborov\'a made a fascinating conjecture: Denote by k the number of balanced communities, a/n the probability of connecting inside clusters and b/n across clusters , and set SNR= ( a-b )^2 / (k(a+(k-1)b)) ;
Revised: In a paper that initiated the modern study of the stochastic block model, Decelle , Krzakala, Moore and Zdeborov\'a made a fascinating conjecture: Denote by k the number of balanced communities, a/n the probability of connecting inside clusters and b/n across , and set SNR= ( a-b )^2 / (k(a+(k-1)b)) ;
Edit intent: fluency
Original: In a paper that initiated the modern study of the stochastic block model, Decelle , Krzakala, Moore and Zdeborov\'a made a fascinating conjecture: Denote by k the number of balanced communities, a/n the probability of connecting inside clusters and b/n across clusters , and set SNR= ( a-b )^2 / (k(a+(k-1)b)) ;
Revised: In a paper that initiated the modern study of the stochastic block model, Decelle , Krzakala, Moore and Zdeborov\'a made a fascinating conjecture: Denote by k the number of balanced communities, a/n the probability of connecting inside clusters and b/n across clusters , and set SNR= | a-b )^2 / (k(a+(k-1)b)) ;
Edit intent: fluency
Original: In a paper that initiated the modern study of the stochastic block model, Decelle , Krzakala, Moore and Zdeborov\'a made a fascinating conjecture: Denote by k the number of balanced communities, a/n the probability of connecting inside clusters and b/n across clusters , and set SNR= ( a-b )^2 / (k(a+(k-1)b)) ;
Revised: In a paper that initiated the modern study of the stochastic block model, Decelle , Krzakala, Moore and Zdeborov\'a made a fascinating conjecture: Denote by k the number of balanced communities, a/n the probability of connecting inside clusters and b/n across clusters , and set SNR= ( a-b | / (k(a+(k-1)b)) ;
Edit intent: clarity
Original:  for any k \geq 2, it is possible to detect efficiently communities whenever SNR>1 (the KS bound ), whereas for k\geq 5, it is possible to detect communities information-theoretically for some \mathrm{SNR<1. Massouli\'e, Mossel et al.\ and Bordenave et al.\ succeeded in proving that the KS bound is efficiently achievable for k=2, while Mossel et al.\ proved that the KS bound cannot be crossed information-theoretically for k=2.
Revised:  for any k \geq 2, it is possible to detect communities efficiently whenever SNR>1 (the KS bound ), whereas for k\geq 5, it is possible to detect communities information-theoretically for some \mathrm{SNR<1. Massouli\'e, Mossel et al.\ and Bordenave et al.\ succeeded in proving that the KS bound is efficiently achievable for k=2, while Mossel et al.\ proved that the KS bound cannot be crossed information-theoretically for k=2.
Edit intent: fluency