wanyu/IteraTeR_v2 huggingface dataset:
Original:  The paper was intended to concentrate on  DecreaseKey interface, but it could be hard to separate the two described data structures without carefull reading.
Revised:  The paper was intended to concentrate on the DecreaseKey interface, but it could be hard to separate the two described data structures without carefull reading.
Edit intent: fluency
Original:  Current paper's goal is not to invent a novel data structure, but to describe the rather easy DecreaseKey version in  hopefully readable form.
Revised:  Current paper's goal is not to invent a novel data structure, but to describe a rather easy DecreaseKey version in hopefully readable form.
Edit intent: fluency
Original:  Current paper's goal is not to invent a novel data structure, but to describe the rather easy DecreaseKey version in  hopefully readable form.
Revised:  Current paper's goal is not to invent a novel data structure, but to describe the rather easy DecreaseKey version in a hopefully readable form.
Edit intent: fluency
Original:  The paper is intended not to require references to other papers.
Revised:  The paper is intended not to require reference to other papers.
Edit intent: fluency
Original:  We will rove that for euclidean Traveling Salesman Problems with n cities the approximation ratio of the 2-Opt heuristic is \Theta(\log n/ \log \log n).
Revised:  We will prove that for euclidean Traveling Salesman Problems with n cities the approximation ratio of the 2-Opt heuristic is \Theta(\log n/ \log \log n).
Edit intent: fluency
Original:  In parallel,  scholarly research regarding various aspects of the pandemic has been extensively published.
Revised:  In parallel, extensive scholarly research regarding various aspects of the pandemic has been extensively published.
Edit intent: fluency
Original:  In parallel,  scholarly research regarding various aspects of the pandemic has been extensively published.
Revised:  In parallel, scholarly research regarding various aspects of the pandemic has been published.
Edit intent: clarity
Original:  In this work, we analyse the changes in biology and medical publishing patterns in terms of the volume of publications in both preprint servers and peer reviewed journals  , average time until the acceptance of papers to said journals, and international (co-)authorship of papers .
Revised:  In this work, we analyse the changes in biology and medical publishing patterns in terms of the volume of publications in both peer reviewed journals , average time until the acceptance of papers to said journals, and international (co-)authorship of papers .
Edit intent: clarity
Original:  In this work, we analyse the changes in biology and medical publishing patterns in terms of the volume of publications in both preprint servers and peer reviewed journals  , average time until the acceptance of papers to said journals, and international (co-)authorship of papers .
Revised:  In this work, we analyse the changes in biology and medical publishing patterns in terms of the volume of publications in both preprint servers and peer reviewed journals , average time to acceptance of papers to said journals, and international (co-)authorship of papers .
Edit intent: coherence
Original:  In this work, we analyse the changes in biology and medical publishing patterns in terms of the volume of publications in both preprint servers and peer reviewed journals  , average time until the acceptance of papers to said journals, and international (co-)authorship of papers .
Revised:  In this work, we analyse the changes in biology and medical publishing patterns in terms of the volume of publications in both preprint servers and peer reviewed journals , average time until the acceptance of papers submitted to biomedical journals, international (co-)authorship of papers .
Edit intent: clarity
Original:  a significantly lower mean time to acceptance for COVID-19 papers is apparent, and it has (partially) come at the expense of non-COVID-19 papers;
Revised:  a significantly faster mean time to acceptance for COVID-19 papers is apparent, and it has (partially) come at the expense of non-COVID-19 papers;
Edit intent: clarity
Original:  and a significant reduction in international collaboration for COVID-19 papers has  been identified.
Revised:  and a significant reduction in international collaboration for COVID-19 papers has also been identified.
Edit intent: clarity
Original:  As the pandemic continues to spread, these changes may cause  research in non-COVID-19 biology and medical areas to be slowed down and bring about a lower rate of international collaboration.
Revised:  As the pandemic continues to spread, these changes may cause a slow down in research in non-COVID-19 biology and medical areas to be slowed down and bring about a lower rate of international collaboration.
Edit intent: fluency
Original:  As the pandemic continues to spread, these changes may cause  research in non-COVID-19 biology and medical areas to be slowed down and bring about a lower rate of international collaboration.
Revised:  As the pandemic continues to spread, these changes may cause research in non-COVID-19 biomedical fields and bring about a lower rate of international collaboration.
Edit intent: clarity
Original:  W R has the interesting property that it constructs a ring of characteristic ~ 0 out of a ring of characteristic ~ p > 1, and it can be used more specifically to construct from a finite field containing Z/pZ the corresponding unramified field extension of the p-adic numbers ~ Q_p (which is unique up to isomorphism).
Revised:  W R has the interesting property that it constructs a ring of characteristic 0 out of a ring of characteristic ~ p > 1, and it can be used more specifically to construct from a finite field containing Z/pZ the corresponding unramified field extension of the p-adic numbers ~ Q_p (which is unique up to isomorphism).
Edit intent: fluency
Original:  W R has the interesting property that it constructs a ring of characteristic ~ 0 out of a ring of characteristic ~ p > 1, and it can be used more specifically to construct from a finite field containing Z/pZ the corresponding unramified field extension of the p-adic numbers ~ Q_p (which is unique up to isomorphism).
Revised:  W R has the interesting property that it constructs a ring of characteristic ~ 0 out of a ring of characteristic p > 1, and it can be used more specifically to construct from a finite field containing Z/pZ the corresponding unramified field extension of the p-adic numbers ~ Q_p (which is unique up to isomorphism).
Edit intent: fluency
Original:  W R has the interesting property that it constructs a ring of characteristic ~ 0 out of a ring of characteristic ~ p > 1, and it can be used more specifically to construct from a finite field containing Z/pZ the corresponding unramified field extension of the p-adic numbers ~ Q_p (which is unique up to isomorphism).
Revised:  W R has the interesting property that it constructs a ring of characteristic ~ 0 out of a ring of characteristic ~ p > 1, and it can be used more specifically to construct from a finite field containing Z/pZ the corresponding unramified field extension of the p-adic numbers Q_p (which is unique up to isomorphism).
Edit intent: fluency
Original:  We develop idioms to cleanly handle calculations of identities between operations on the ring of Witt vectors.
Revised:  In the process we develop idioms to cleanly handle calculations of identities between operations on the ring of Witt vectors.
Edit intent: clarity
Original:  In this paper we study first-order  transductions and the quasi-order they induce on infinite hereditary classes of finite graphs.
Revised:  In this paper we study first-order (FO) transductions and the quasi-order they induce on infinite hereditary classes of finite graphs.
Edit intent: clarity
Original:  In this paper we study first-order  transductions and the quasi-order they induce on infinite hereditary classes of finite graphs.
Revised:  In this paper we study first-order transductions and the quasiorder they induce on infinite hereditary classes of finite graphs.
Edit intent: fluency
Original:  In this paper we study first-order  transductions and the quasi-order they induce on infinite hereditary classes of finite graphs.
Revised:  In this paper we study first-order transductions and the quasi-order they induce on infinite classes of finite graphs.
Edit intent: fluency
Original:  Surprisingly, this quasi-order is very complex, though shaped by the locality properties of first-order logic.
Revised:  Surprisingly, this quasiorder is very complex, though shaped by the locality properties of first-order logic.
Edit intent: fluency
Original:  While a summarization of a dataset based on a set of patterns does not provide a general and satisfying view over a dataset, we introduce a concise representation --the closure structure-- based on closed itemsets and their minimum generators, for capturing the intrinsic content of a dataset.
Revised:  While a summarization of a dataset based on a set of patterns does not provide a general and satisfying view over a dataset, we introduce a concise representation -- the closure structure -- based on closed itemsets and their minimum generators, for capturing the intrinsic content of a dataset.
Edit intent: fluency
Original:  We develop a Embibe Score Quotient model (ESQ) to predict test scores based on observed academic, behavioral and test-taking features of a student. ESQ can be used to predict the future scoring potential of a student as well as offer personalized learning nudges, both critical to improving LOs.
Revised:  We develop an Embibe Score Quotient model (ESQ) to predict test scores based on observed academic, behavioral and test-taking features of a student. ESQ can be used to predict the future scoring potential of a student as well as offer personalized learning nudges, both critical to improving LOs.
Edit intent: fluency
Original:  Based on this finding, we propose a cross-architecture training procedure with a margin focused loss (Margin-MSE), that adapts knowledge distillation to the varying score output distributions of different BERT and non-BERT  ranking architectures.
Revised:  Based on this finding, we propose a cross-architecture training procedure with a margin focused loss (Margin-MSE), that adapts knowledge distillation to the varying score output distributions of different BERT and non-BERT passage ranking architectures.
Edit intent: fluency
Original:  We show that across our evaluated architectures our Margin-MSE knowledge distillation significantly improves their effectiveness without compromising their efficiency.
Revised:  We show that across our evaluated architectures our Margin-MSE knowledge distillation significantly improves re-ranking effectiveness without compromising their efficiency.
Edit intent: clarity
Original:   To benefit the community, we publish the costly teacher-score training files in a ready-to-use package.
Revised:  To benefit the community, we publish the teacher-score training files in a ready-to-use package.
Edit intent: clarity
Original:  Although we have known some results of transplantation experiments, there are many more possible experiments that we do not know the resultsof .
Revised:  Although we have known the results of some transplantation experiments, there are many more possible experiments that we do not know the resultsof .
Edit intent: fluency
Original:  Although we have known some results of transplantation experiments, there are many more possible experiments that we do not know the resultsof .
Revised:  Although we have known some results of transplantation experiments, there are many more possible experiments with unknown results .
Edit intent: clarity
Original:  We develop a penalty function-based method that uses the results of known experiments to infer the results of unknown experiments . Similar experiments without similar results get penalized , and correspond to smaller probability.
Revised:  We develop a penalty function-based method that uses the known experimental results to infer the results of unknown experiments . Similar experiments without similar results get penalized , and correspond to smaller probability.
Edit intent: clarity
Original:  We develop a penalty function-based method that uses the results of known experiments to infer the results of unknown experiments . Similar experiments without similar results get penalized , and correspond to smaller probability.
Revised:  We develop a penalty function-based method that uses the results of known experiments to infer the unknown experimental results . Similar experiments without similar results get penalized , and correspond to smaller probability.
Edit intent: clarity
Original:  We develop a penalty function-based method that uses the results of known experiments to infer the results of unknown experiments . Similar experiments without similar results get penalized , and correspond to smaller probability.
Revised:  We develop a penalty function-based method that uses the results of known experiments to infer the results of unknown experiments . Similar experiments without similar results get penalized and correspond to smaller probability.
Edit intent: fluency
Original:  This method can provide the most probable results of a group of experiments , or the probability of a specific result for each experiment.
Revised:  This method can provide the most probable results of a group of experiments or the probability of a specific result for each experiment.
Edit intent: fluency
Original:  Two maximum flows from source to sink are to be computed independently of each other with respect to the first and second capacity function, respectively, while an interdictor aims to minimize the value of both maximum flows by interdicting arcs.
Revised:  Two maximum flows from a source to a sink are to be computed independently of each other with respect to the first and second capacity function, respectively, while an interdictor aims to minimize the value of both maximum flows by interdicting arcs.
Edit intent: fluency
Original:  Noise and discrepancies on these assumptions can lead to significant changes in conclusions regarding a microbes' response.
Revised:  Noise and discrepancies on these assumptions can lead to significant changes in conclusions regarding the microbes' response.
Edit intent: fluency
Original:  These capabilities are demonstrated and validated herein using several case studies with synthetically generated microbial growth data.
Revised:  This methodology is demonstrated in the context of a specific case study and the estimation characteristics are validated in several scenarios using synthetically generated microbial growth data.
Edit intent: clarity
Original:  Following this direction, we close the gap between theory and practice by providing an algorithm that efficiently computes close to optimal vertex cover approximations on hyperbolic random graphs;
Revised:  Following this direction, we close the gap between theory and practice by providing an algorithm that efficiently computes nearly optimal vertex cover approximations on hyperbolic random graphs;
Edit intent: clarity
Original:  Then, a solution for multivariate bounds is achieved by reducing this problem to the univariate case;
Revised:  Then, a decision procedure for multivariate bounds is achieved by reducing this problem to the univariate case;
Edit intent: clarity
Original: StoqMA characterizes the computational hardness of stoquastic local Hamiltonians, which is a family of Hamiltonians that  not suffer from the sign problem.
Revised: StoqMA characterizes the computational hardness of stoquastic local Hamiltonians, which is a family of Hamiltonians that does not suffer from the sign problem.
Edit intent: fluency
Original:  Although an error reduction is commonplace for many complexity classes, such as BPP, BQP, MA, QMA, etc.,this property remains open for StoqMA since Bravyi, Bessen and Terhal defined this class in 2006.
Revised:  Although error reduction is commonplace for many complexity classes, such as BPP, BQP, MA, QMA, etc.,this property remains open for StoqMA since Bravyi, Bessen and Terhal defined this class in 2006.
Edit intent: clarity
Original:  In this note, we show that an error reduction for StoqMA will , perhaps surprisingly, imply that StoqMA = MA.
Revised:  In this note, we show that error reduction forStoqMA will imply that StoqMA = MA.
Edit intent: coherence
Original:  Namely, we show the following results: 1. When the subspaces A_0 and A_1 are incomparable, i.e., A_0 and A_1 are not contained inside each other, then there is a polynomial time algorithm to recover the subspaces A_0 and A_1. 2. In the case when A_1 is a subspace of A_0 with a significant gap in the dimension i.e., dim(A_1) \le \alpha dim(A _1 ) for \alpha<1, there is a n^{O(1/(1-\alpha))} time algorithm to recover the subspaces A_0 and A_1.
Revised:  Namely, we show the following results: 1. When the subspaces A_0 and A_1 are incomparable, i.e., A_0 and A_1 are not contained inside each other, then there is a polynomial time algorithm to recover the subspaces A_0 and A_1. 2. In the case when A_1 is a subspace of A_0 with a significant gap in the dimension i.e., dim(A_1) \le \alpha dim(A _0 ) for \alpha<1, there is a n^{O(1/(1-\alpha))} time algorithm to recover the subspaces A_0 and A_1.
Edit intent: fluency
Original: This paper presents a novel " {\em Interpolated Factored Green Function " method (IFGF) for the accelerated evaluation of the integral operators in scattering theory and other areas.
Revised: This paper presents a novel {\em Interpolated Factored Green Function " method (IFGF) for the accelerated evaluation of the integral operators in scattering theory and other areas.
Edit intent: fluency
Original: This paper presents a novel " {\em Interpolated Factored Green Function " method (IFGF) for the accelerated evaluation of the integral operators in scattering theory and other areas.
Revised: This paper presents a novel " {\em Interpolated Factored Green Function method (IFGF) for the accelerated evaluation of the integral operators in scattering theory and other areas.
Edit intent: fluency
Original:  Of particular interest among recurrent neural networks , we have the Reservoir Computing (RC) paradigm for its conceptual simplicity and fast training scheme.
Revised:  Of particular interest among recurrent neural networks we have the Reservoir Computing (RC) paradigm for its conceptual simplicity and fast training scheme.
Edit intent: fluency
Original:  Of particular interest among recurrent neural networks , we have the Reservoir Computing (RC) paradigm for its conceptual simplicity and fast training scheme.
Revised:  Of particular interest among recurrent neural networks , we have the Reservoir Computing (RC) paradigm characterized by conceptual simplicity and fast training scheme.
Edit intent: clarity
Original:  In this work, we study the properties behind learning dynamical systems with RC and propose a new guiding principle based on Generalized Synchronization (GS) granting its feasibility .
Revised:  In this work, we study the properties behind learning dynamical systems and propose a new guiding principle based on Generalized Synchronization (GS) granting its feasibility .
Edit intent: coherence
Original: In recent years, the machine learning community has seen a continuous growing interest in research aimed at investigating dynamical aspects of both training procedures and perfected recurrent models.
Revised: In recent years, the machine learning community has seen a continuous growing interest in research aimed at investigating dynamical aspects of both training procedures and machine learning models.
Edit intent: clarity
Original:  Of particular interest among recurrent neural networks we have the Reservoir Computing (RC) paradigm characterized by conceptual simplicity and  fast training scheme.
Revised:  Of particular interest among recurrent neural networks we have the Reservoir Computing (RC) paradigm characterized by conceptual simplicity and a fast training scheme.
Edit intent: fluency
Original:  In this work, we study the properties behind learning dynamical systems and propose a new guiding principle based on Generalized Synchronization (GS) , granting to learn a generic task with RC architectures.
Revised:  In this work, we analyze the role played by Generalized Synchronization (GS) , granting to learn a generic task with RC architectures.
Edit intent: clarity
Original:  In this work, we study the properties behind learning dynamical systems and propose a new guiding principle based on Generalized Synchronization (GS) , granting to learn a generic task with RC architectures.
Revised:  In this work, we study the properties behind learning dynamical systems and propose a new guiding principle based on Generalized Synchronization (GS) when training a RC to solve a generic task with RC architectures.
Edit intent: clarity
Original:  In addition , we show that - as opposed to the ESP - satisfaction of the GS can be measured by means of the Mutual False Nearest Neighbors index, which makes effective to practitioners theoretical derivations.
Revised:  In addition , we show that satisfaction of the GS can be measured by means of the Mutual False Nearest Neighbors index, which makes effective to practitioners theoretical derivations.
Edit intent: coherence
Original:  We evaluate our method on different standard benchmarks and see a relative error reduction of 8 \% on the CIFAR10 graph \\%DIF > on the CIFAR10 graph dataset and 11\% to 32\% on the molecular ZINC dataset.
Revised:  We evaluate our method on different standard benchmarks and see a relative error reduction of 8 \\%DIF > on the CIFAR10 graph dataset and 11\% to 32\% on the molecular ZINC dataset.
Edit intent: fluency
Original:  Finally, we bring the power of CNN data augmentation to graphs by providing a means of doing reflection, rotation and distortion on the underlying directional field.
Edit intent: coherence
Original:  An important outcome of this work is that it enables to translate any physical or biological problems with intrinsic directional axes into a graph network formalism with an embedded directional field .
Revised:  An important outcome of this work is that it enables to translate any physical or biological problems .
Edit intent: clarity
Original:  In this paper we describe an agent for the no-press variant of Diplomacy that combines supervised learning on human data with one-step lookahead search via external regret minimization.
Revised:  In this paper we describe an agent for the no-press variant of Diplomacy that combines supervised learning on human data with one-step lookahead search via regret minimization.
Edit intent: clarity
Original:  External regret minimization techniques have been behind previous AI successes in adversarial games, most notably poker, but have not previously been shown to be successful in large-scale games involving cooperation.
Revised:  Regret minimization techniques have been behind previous AI successes in adversarial games, most notably poker, but have not previously been shown to be successful in large-scale games involving cooperation.
Edit intent: fluency
Original: Background: Limited research exists on the association between increased physical activity and injury in children.
Revised: Background: Limited research exists on the association between changes in physical activity levels and injury in children.
Edit intent: clarity
Original:  Results: The  relationship between the ACWR and injury risk was best represented using a generalized additive mixed model for the uncoupled 5-week ACWR.
Revised:  Results: The prognostic relationship between the ACWR and injury risk was best represented using a generalized additive mixed model for the uncoupled 5-week ACWR.
Edit intent: clarity
Original:  Conclusion: Increases in physical activity in children are associated with much lower increases in injury risk compared to previous results in adults.
Revised:  Conclusion: Increases in physical activity in children are associated with much lower injury risks compared to previous results in adults.
Edit intent: fluency