wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Before our work, such improved algorithms were not known even for m equals 4 A key step in our approach is the following new result in Littlewood-Offord theory on the additive combinatorics of subset sums: For every \delta >0 there exists an \varepsilon >0 such that if |\{ X\subseteq \{1,\ldots,n \} : w(X)=v \}| \leq 2^{(1-\varepsilon)n} for every v then |\{ w(X): X \subseteq \{1,\ldots,n\} \}|\leq 2^{\delta n}.
Revised:  Before our work, such improved algorithms were not known even for m equals 4 A key step in our approach is the following new result in Littlewood-Offord theory on the additive combinatorics of subset sums: For every \delta >0 there exists an \varepsilon >0 such that if |\{ X\subseteq \{1,\ldots,n \} : w(X)=v \}| \leq 2^{(1-\varepsilon)n} for some v then |\{ w(X): X \subseteq \{1,\ldots,n\} \}|\leq 2^{\delta n}.
Edit intent: clarity
Original:  We further show that with O(\log(n) ^7 ) many cut queries a quantum algorithm can with high probability output a spanning forest for G. En route to proving these results, we design quantum algorithms for learning a graph using cut queries.
Revised:  We further show that with O(\log(n) ^8 ) many cut queries a quantum algorithm can with high probability output a spanning forest for G. En route to proving these results, we design quantum algorithms for learning a graph using cut queries.
Edit intent: meaning-changed
Original:  We first provide a  general structure of infinite-dimensional port-Hamiltonian systems (pHs) for which the Partitioned Finite Element Method (PFEM) straightforwardly applies.
Revised:  We first provide a novel general structure of infinite-dimensional port-Hamiltonian systems (pHs) for which the Partitioned Finite Element Method (PFEM) straightforwardly applies.
Edit intent: meaning-changed
Original:  Using this approach, I analyze the fiscal policy of the US economy . Our empirical study indicates that large fiscal contraction generates a negative effect on the growth rate of the economy , and small and large fiscal expansions realize a positive impact on the growth rate .
Revised:  Using this approach, I analyze the fiscal policy of the US economy from 1992 to 2019. The empirical study indicates that large fiscal contraction generates a negative effect on the growth rate of the economy , and small and large fiscal expansions realize a positive impact on the growth rate .
Edit intent: meaning-changed
Original: An investigation of hanging nodes in the context of AFC schemes have been proposed. Results for the handling of grids with hanging nodes have been presented for higher-order Lagrange elements.
Revised: An investigation of hanging nodes in the context of a posteriori error estimator for algebraic flux-corrected (AFC) schemes for stationary convection-diffusion equations. Results have also been presented for the handling of grids with hanging nodes have been presented for higher-order Lagrange elements.
Edit intent: meaning-changed
Original:  Results have also been presented for the handling of grids with hanging nodes for higher-order Lagrange elements. Numerical simulation illustrating the satisfaction and the violation of  discrete maximum principle (DMP) for the BJK limiter and the Kuzmin limiter, respectively have been presented in two dimensions.
Revised:  Numerical simulations illustrating the satisfaction and the violation of discrete maximum principle (DMP) for the BJK limiter and the Kuzmin limiter, respectively have been presented in two dimensions.
Edit intent: coherence
Original:  Our analysis shows that PLMs such as BART and T5 achieve  state-of-the-art results in graph-to-text benchmarks without explicitly encoding the graph structure. We also demonstrate that task-adaptive pretraining strategies are beneficial to the target task, improving even furtherthe state of the art in two benchmarks for graph-to-text generation.
Revised:  Our analysis shows that PLMs such as BART and T5 achieve state-of-the-art results and that task-adaptive pretraining strategies are beneficial to the target task, improving even furtherthe state of the art in two benchmarks for graph-to-text generation.
Edit intent: clarity
Original:  We also demonstrate that task-adaptive pretraining strategies are beneficial to the target task, improving even furtherthe state of the art in two benchmarks for graph-to-text generation. In a final analysis, we investigate possible reasons for the PLMs' success on graph-to-text tasks.
Revised:  We also demonstrate that task-adaptive pretraining strategies improve their performance even further. In particular, we report new state-of-the-art BLEU scores of 49.72 on LDC2017T10, 59.70 on WebNLG, and 25.66 on AGENDA datasets - a relative improvement of 31.8\%, 4.5\%, and 42.4\%, respectively. In an extensive analysis, we investigate possible reasons for the PLMs' success on graph-to-text tasks.
Edit intent: meaning-changed
Original: We study and SI-type model , with the possibility of vaccination, where the population is partitioned between pro-vaxxers and anti-vaxxers  .
Revised: We interpret attitudes towards science and pseudosciences as cultural traits that diffuse in society through communication efforts exerted by agents. We present a tractable model that allows us to study the interaction among the diffusion of an epidemic, vaccination choices, and the dynamics of cultural traits. We apply it to study the impact of homophily between pro-vaxxers and anti-vaxxers .
Edit intent: meaning-changed
Original:  We show that, during the outbreak of a disease, segregating people that are against vaccination from the rest of the population decreases the speed of recovery and may increase the number of cases . Then, we include endogenous choices based on the tradeoff between the cost of vaccinating and the risk of getting infected. We show that the results remain valid under endogenous choices, unless people are too flexible in determining their identity towards vaccination .
Revised:  We show that, during the outbreak of a disease, segregating people that are against vaccination from the rest of the population decreases the speed of recovery and may increase the number of cases and make the disease endemic. The dynamics of the shares of the two cultural traits in the population is crucial in determining the sign of the total effect on the cumulative infection: more homophily is beneficial if agents are not too flexible in determining their identity towards vaccination .
Edit intent: meaning-changed
Original:  The new extended  system is similar to the one presented by Greengard et al. (2009) for which a fast direct solver was constructed by Zhang and Gillman (2018) but the corresponding fast direct solver is more efficient than the one for the original extended system.
Revised:  The new extended linear system is similar to the one presented by Greengard et al. (2009) for which a fast direct solver was constructed by Zhang and Gillman (2018) but the corresponding fast direct solver is more efficient than the one for the original extended system.
Edit intent: meaning-changed
Original:  The new extended  system is similar to the one presented by Greengard et al. (2009) for which a fast direct solver was constructed by Zhang and Gillman (2018) but the corresponding fast direct solver is more efficient than the one for the original extended system.
Revised:  The new extended system is similar to a previously presented technique for which the authors have constructed a fast direct solver was constructed by Zhang and Gillman (2018) but the corresponding fast direct solver is more efficient than the one for the original extended system.
Edit intent: meaning-changed
Original:  The new extended  system is similar to the one presented by Greengard et al. (2009) for which a fast direct solver was constructed by Zhang and Gillman (2018) but the corresponding fast direct solver is more efficient than the one for the original extended system.
Revised:  The new extended system is similar to the one presented by Greengard et al. (2009) for which a fast direct solver . The key features of the work presented in this paper are that the fast direct solver is more efficient than the one for the original extended system.
Edit intent: clarity
Original:  The new extended  system is similar to the one presented by Greengard et al. (2009) for which a fast direct solver was constructed by Zhang and Gillman (2018) but the corresponding fast direct solver is more efficient than the one for the original extended system. Another important feature of the new extended system is that it can easily handle problems that require specialized quadrature for weakly singular kernels  . Numerical results illustrate the improved performance of the fast direct solver for the new extended system when compared to the fast direct solver for the original extended system.
Revised:  The new extended system is similar to the one presented by Greengard et al. (2009) for which a fast direct solver was constructed by Zhang and Gillman (2018) but the corresponding fast direct solver is more efficient for the new extended linear system and that problems involving specialized quadrature for weakly singular kernels . Numerical results illustrate the improved performance of the fast direct solver for the new extended system when compared to the fast direct solver for the original extended system.
Edit intent: meaning-changed
Original:  Another important feature of the new extended system is that it can easily handle problems that require specialized quadrature for weakly singular kernels  . Numerical results illustrate the improved performance of the fast direct solver for the new extended system when compared to the fast direct solver for the original extended system.
Revised:  Another important feature of the new extended system is that it can easily handle problems that require specialized quadrature for weakly singular kernels can be easily handled . Numerical results illustrate the improved performance of the fast direct solver for the new extended system when compared to the fast direct solver for the original extended system.
Edit intent: meaning-changed
Original:  Although previous research has proposed successful task-model encoders that analyze images and human body movements, the encoders have been designed in environments without noise. Therefore, there has been little discussion on how to guide a task-model encoder in a scene with spatio-temporal noises  such as cluttered objects or unrelated human body movements.
Revised:  Although previous research has proposed successful task-model encoders , there has been little discussion on how to guide a task-model encoder in a scene with spatio-temporal noises such as cluttered objects or unrelated human body movements.
Edit intent: clarity
Original:  In human-to-human demonstrations, verbal instructions play a role in guiding an observer's visual attention . Inspired by the function of verbal instructions , we propose a verbal focus-of-attention (FoA) system (i.e., spatio-temporal filters) to guide a task-model encoder.
Revised:  In human-to-human demonstrations, verbal instructions play a role in guiding an observer's visual attention , we propose a verbal focus-of-attention (FoA) system (i.e., spatio-temporal filters) to guide a task-model encoder.
Edit intent: clarity
Original:  Recent advancements in automatic speech recognition (ASR) and natural language understanding (NLU) offer potential solutions to generate these summaries automatically . In the current paper, we focus on two tasks: classifying utterances from medical conversations according to (i) the SOAP section and (ii) the speaker role , both fundamental building blocks along the path towards an end-to-end, automated SOAP note for medical conversations.
Revised:  Recent advancements in automatic speech recognition (ASR) and natural language understanding (NLU) offer potential solutions to generate these summaries automatically , but rigorous quantitative baselines for benchmarking research in this domain are lacking. In this paper, we focus on two tasks: classifying utterances from medical conversations according to (i) the SOAP section and (ii) the speaker role , both fundamental building blocks along the path towards an end-to-end, automated SOAP note for medical conversations.
Edit intent: meaning-changed
Original:  In the current paper, we focus on two tasks: classifying utterances from medical conversations according to (i) the SOAP section and (ii) the speaker role , both fundamental building blocks along the path towards an end-to-end, automated SOAP note for medical conversations.
Revised:  In the current paper, we bridge this gap for two tasks: classifying utterances from medical conversations according to (i) the SOAP section and (ii) the speaker role , both fundamental building blocks along the path towards an end-to-end, automated SOAP note for medical conversations.
Edit intent: meaning-changed
Original:  In the current paper, we focus on two tasks: classifying utterances from medical conversations according to (i) the SOAP section and (ii) the speaker role , both fundamental building blocks along the path towards an end-to-end, automated SOAP note for medical conversations.
Revised:  In the current paper, we focus on two tasks: classifying utterances from medical conversations according to (i) the SOAP section and (ii) the speaker role . Both are fundamental building blocks along the path towards an end-to-end, automated SOAP note for medical conversations.
Edit intent: coherence
Original: We study nonlinear hyperbolic conservation laws with non-convex flux  and, for a broad class of numerical methods based on summation by parts operators, we compute numerically the kinetic functions associated with each scheme.
Revised: We study nonlinear hyperbolic conservation laws with non-convex flux in one space dimension and, for a broad class of numerical methods based on summation by parts operators, we compute numerically the kinetic functions associated with each scheme.
Edit intent: meaning-changed
Original: This paper aims at comparing two coupling approaches as basic layers for building clustering criteria, suited for modularizing very large graphs. Although the scientific literature is not sparing with clustering criteria dedicated to graphs and networksdecomposition, we shall nevertheless rework this subject, in this paper, by proposing a new symmetric and dual approach based on coupling functions, allowing to compare and calibrate them. To elaborate those coupling maps, we will briefly use "optimal transport theory" as a starting point, then we will derive two main families of criteria: those based upon "statistical independence" versus those based upon "logical indetermina-tion ".
Revised: This paper aims at comparing two coupling approaches as basic layers for building clustering criteria, suited for modularizing and clustering very large networks. We briefly use "optimal transport theory" as a starting point, then we will derive two main families of criteria: those based upon "statistical independence" versus those based upon "logical indetermina-tion ".
Edit intent: coherence
Original:  To elaborate those coupling maps, we will briefly use "optimal transport theory" as a starting point, then we will derive two main families of criteria: those based upon "statistical independence" versus those based upon "logical indetermina-tion ".
Revised:  To elaborate those coupling maps, we will briefly use "optimal transport theory" as a starting point, and a way as well, to derive two canonical couplings: "statistical independence" versus those based upon "logical indetermina-tion ".
Edit intent: clarity
Original:  To elaborate those coupling maps, we will briefly use "optimal transport theory" as a starting point, then we will derive two main families of criteria: those based upon "statistical independence" versus those based upon "logical indetermina-tion ".
Revised:  To elaborate those coupling maps, we will briefly use "optimal transport theory" as a starting point, then we will derive two main families of criteria: those based upon "statistical independence" and "logical indetermina-tion ".
Edit intent: fluency
Original:  To elaborate those coupling maps, we will briefly use "optimal transport theory" as a starting point, then we will derive two main families of criteria: those based upon "statistical independence" versus those based upon "logical indetermina-tion ".
Revised:  To elaborate those coupling maps, we will briefly use "optimal transport theory" as a starting point, then we will derive two main families of criteria: those based upon "statistical independence" versus those based upon "logical indetermination ".
Edit intent: fluency
Original:  Among others, we will use the so called "Monge's properties", applied to contingency matrices context, as specific tricks for putting forward some key features about those criteria. A further and deeper study is proposed, highlighting "logical indetermination", because it is, by far, lesser known.
Revised:  Among others, we will use the so called "Monge's properties", applied to contingency matrices , and justifying the \otimes versus \oplus notation. A study is proposed, highlighting "logical indetermination", because it is, by far, lesser known.
Edit intent: meaning-changed
Original:  Our main algorithm AdaAGD+ is an accelerated method, which is universal in the sense that it achieves nearly-optimal convergence rates for both smooth and non-smooth functions, even when it only has access to stochastic gradients.
Revised:  Our main algorithms AdaACSA and AdaAGD+ is an accelerated method, which is universal in the sense that it achieves nearly-optimal convergence rates for both smooth and non-smooth functions, even when it only has access to stochastic gradients.
Edit intent: meaning-changed
Original:  Our main algorithm AdaAGD+ is an accelerated method, which is universal in the sense that it achieves nearly-optimal convergence rates for both smooth and non-smooth functions, even when it only has access to stochastic gradients.
Revised:  Our main algorithm AdaAGD+ are accelerated methods, which are universal in the sense that it achieves nearly-optimal convergence rates for both smooth and non-smooth functions, even when it only has access to stochastic gradients.
Edit intent: fluency
Original:  Our main algorithm AdaAGD+ is an accelerated method, which is universal in the sense that it achieves nearly-optimal convergence rates for both smooth and non-smooth functions, even when it only has access to stochastic gradients.
Revised:  Our main algorithm AdaAGD+ is an accelerated method, which is universal in the sense that they achieve nearly-optimal convergence rates for both smooth and non-smooth functions, even when it only has access to stochastic gradients.
Edit intent: clarity
Original:  Our main algorithm AdaAGD+ is an accelerated method, which is universal in the sense that it achieves nearly-optimal convergence rates for both smooth and non-smooth functions, even when it only has access to stochastic gradients.
Revised:  Our main algorithm AdaAGD+ is an accelerated method, which is universal in the sense that it achieves nearly-optimal convergence rates for both smooth and non-smooth functions, even when they only have access to stochastic gradients.
Edit intent: clarity
Original: The problem of catastrophic URLetting can be traced back to the 1980s, but it has not been completely solved . Since human brains are good at continual lifelong learning, brain-inspired methods may provide solutions to this problem.
Revised: The problem of catastrophic URLetting has a history of more than 30 years and has not been completely solved . Since human brains are good at continual lifelong learning, brain-inspired methods may provide solutions to this problem.
Edit intent: meaning-changed
Original: The problem of catastrophic URLetting can be traced back to the 1980s, but it has not been completely solved . Since human brains are good at continual lifelong learning, brain-inspired methods may provide solutions to this problem.
Revised: The problem of catastrophic URLetting can be traced back to the 1980s, but it has not been completely solved yet. Since the human brain has natural ability to perform continual lifelong learning, brain-inspired methods may provide solutions to this problem.
Edit intent: clarity
Original: The problem of catastrophic URLetting can be traced back to the 1980s, but it has not been completely solved . Since human brains are good at continual lifelong learning, brain-inspired methods may provide solutions to this problem.
Revised: The problem of catastrophic URLetting can be traced back to the 1980s, but it has not been completely solved . Since human brains are good at continual lifelong learning, learning from the brain may provide solutions to this problem.
Edit intent: clarity
Original:  The end result of learning different objects in different categories is the formation of concepts in the brain. Experiments showed that concepts are likely encoded by concept cells in the medial temporal lobe (MTL) of the human brain. Furthermore, concept cells encode concepts sparsely and are responsive to multi-modal stimuli. However, it is unknown how concepts are formed in the MTL. Here we assume that the integration of audio and visual perceptual information in the MTL during learning is a crucial step to form concepts and make continual learning possible , and we propose a biological plausible audio-visual integration model (AVIM), which is a spiking neural network with multi-compartmental neuron model and a calcium based synaptic tagging and capture plasticity model, as a possible mechanism of concept formation .
Revised:  In this paper, we propose a novel biologically plausible audio-visual integration model (AVIM) based on the assumption that the integration of audio and visual perceptual information in the MTL during learning is a crucial step to form concepts and make continual learning possible , and we propose a biological plausible audio-visual integration model (AVIM), which is a spiking neural network with multi-compartmental neuron model and a calcium based synaptic tagging and capture plasticity model, as a possible mechanism of concept formation .
Edit intent: coherence
Original:  Here we assume that the integration of audio and visual perceptual information in the MTL during learning is a crucial step to form concepts and make continual learning possible , and we propose a biological plausible audio-visual integration model (AVIM), which is a spiking neural network with multi-compartmental neuron model and a calcium based synaptic tagging and capture plasticity model, as a possible mechanism of concept formation .
Revised:  Here we assume that the integration of audio and visual perceptual information in the medial temporal lobe during learning is a crucial step to form concepts and make continual learning possible , and we propose a biological plausible audio-visual integration model (AVIM), which is a spiking neural network with multi-compartmental neuron model and a calcium based synaptic tagging and capture plasticity model, as a possible mechanism of concept formation .
Edit intent: clarity
Original:  Here we assume that the integration of audio and visual perceptual information in the MTL during learning is a crucial step to form concepts and make continual learning possible , and we propose a biological plausible audio-visual integration model (AVIM), which is a spiking neural network with multi-compartmental neuron model and a calcium based synaptic tagging and capture plasticity model, as a possible mechanism of concept formation .
Revised:  Here we assume that the integration of audio and visual perceptual information in the MTL during learning is crucial to form concepts and make continual learning possible , and we propose a biological plausible audio-visual integration model (AVIM), which is a spiking neural network with multi-compartmental neuron model and a calcium based synaptic tagging and capture plasticity model, as a possible mechanism of concept formation .
Edit intent: clarity