wanyu/IteraTeR_v2 huggingface dataset:
Original:  In a regime in which front dynamics is determined by a local front speed , irrespective of the microscopic origin, we (i) describe the effect of multiple inhomogeneities in the light of an event-based solution, (ii) find a slow-down due to obstacles that is dominated by the number density and width of obstacles, but not by their precise shape , and (iii) characterize a speedupand its dependence on hotspot strength and density.
Revised:  In a regime in which front dynamics is determined by a local front speed , irrespective of the microscopic origin, we (i) describe the effect of multiple inhomogeneities in the light of an event-based solution, (ii) find a slow-down that is dominated by the number density and width of obstacles, but not by their precise shape , and (iii) characterize a speedupand its dependence on hotspot strength and density.
Edit intent: clarity
Original:  In a regime in which front dynamics is determined by a local front speed , irrespective of the microscopic origin, we (i) describe the effect of multiple inhomogeneities in the light of an event-based solution, (ii) find a slow-down due to obstacles that is dominated by the number density and width of obstacles, but not by their precise shape , and (iii) characterize a speedupand its dependence on hotspot strength and density.
Revised:  In a regime in which front dynamics is determined by a local front speed , irrespective of the microscopic origin, we (i) describe the effect of multiple inhomogeneities in the light of an event-based solution, (ii) find a slow-down due to obstacles that is dominated by the number density and width of obstacles, but not by their precise shape . Hotspots result in a speedup, which we characterise as function of hotspot strength and density.
Edit intent: clarity
Original:  the third includes methods for simulating, fitting, evaluating and predicting the generalized process with any recovery time distribution .
Revised:  the third includes methods for simulating, fitting, evaluating and predicting the generalized process .
Edit intent: clarity
Original: We address the following question: is it possible to infer global regularity of  mild solution from a single approximate solution?
Revised: We address the following question: is it possible to infer global regularity of a mild solution from a single approximate solution?
Edit intent: fluency
Original:  Two  treatments leading to essentially the same conclusion are presented.
Revised:  Two different treatments leading to essentially the same conclusion are presented.
Edit intent: clarity
Original:  Assuming a relatively simple scale-invariant relation of the size of the approximate solution, the resolution parameter, and the initial energy, we show that the answer is affirmative for a general class of approximate solutions, including Leray's mollified solutions.
Revised:  Assuming a relatively simple scale-invariant relation involving the size of the approximate solution, the resolution parameter, and the initial energy, we show that the answer is affirmative for a general class of approximate solutions, including Leray's mollified solutions.
Edit intent: clarity
Original: To predict and maximize future rewards in this ever-changing world, animals must be able to discover the temporal structure of stimuli and then take the right action at the right time.
Revised: To predict and maximize future rewards in this ever-changing world, animals must be able to discover the temporal structure of stimuli and then anticipate or act correctly at the right time.
Edit intent: clarity
Original:  Here, we addressed this problem by training neural network models on four timing tasks: interval production, interval comparison, timed spatial reproduction, and timed decision making.
Revised:  Here, we addressed these problems by training neural network models on four timing tasks: interval production, interval comparison, timed spatial reproduction, and timed decision making.
Edit intent: fluency
Original: To predict and maximize future rewards in this ever-changing world, animals must be able to discover the temporal structure of stimuli and then anticipate or act correctly at the right time.
Revised: To maximize future rewards in this ever-changing world, animals must be able to discover the temporal structure of stimuli and then anticipate or act correctly at the right time.
Edit intent: clarity
Original:  This is based on the network structure of multiple feedforward sequences that mutually excite or inhibit depending on whether their preferences of non-timing information are similar or not.
Revised:  This is based on the network structure of multiple feedforward sequences that mutually excite or inhibit depending on whether their preferences of non-temporal information are similar or not.
Edit intent: fluency
Original:  Strong temporal signal in non-timing tasks arises from high temporal complexity of task, broad input tuning, multi-tasking and timing anticipation .
Revised:  Strong temporal signal in non-timing tasks , including the anticipation of coming events .
Edit intent: clarity
Original:  Our work discloses fundamental computional principles of temporal processing, and is supported by and gives predictions to a number of experimental phenomena.
Revised:  Our work discloses fundamental computational principles of temporal processing, and is supported by and gives predictions to a number of experimental phenomena.
Edit intent: fluency
Original:  We then present well-posedness and error analysis for a semidiscrete continuous-in-time finite element approximation on simplicial grids with spatial discretization based on the Raviart-Thomas spaces of degree k for the pseudostress tensor and discontinuous piecewise polynomial elements of degree k for the velocity  .
Revised:  We then present well-posedness and error analysis for semidiscrete continuous-in-time finite element approximation on simplicial grids with spatial discretization based on the Raviart-Thomas spaces of degree k for the pseudostress tensor and discontinuous piecewise polynomial elements of degree k for the velocity .
Edit intent: fluency
Original:  We provide several numerical results for a fully discrete scheme employing a Backward Euler time discretization to confirm the theoretical rates of convergence and illustrate the performance and flexibility of the method for a range of model parameters.
Revised:  We provide several numerical results to confirm the theoretical rates of convergence and illustrate the performance and flexibility of the method for a range of model parameters.
Edit intent: clarity
Original:  Metadata accompanying images on social-media represent an ideal source of additional information for retrieving proper neighbourhoods easing image annotation task.
Revised:  Metadata accompanying images on social-media represent an ideal source of additional information for retrieving proper neighborhoods easing image annotation task.
Edit intent: fluency
Original:  To this end, we blend visual features extracted from neighbours and their metadata to jointly leverage context and visual cues.
Revised:  To this end, we blend visual features extracted from neighbors and their metadata to jointly leverage context and visual cues.
Edit intent: fluency
Original:  Our models use multiple semantic embeddings to properly map metadata to a meaningful semantic space decoupling the neural model from the low-level representation of metadata and achieve robustness to vocabulary changes between training and testing phases . Convolutional and recurrent neural networks (CNNs-RNNs) are jointly adopted to infer similarity among neighbours and query images.
Revised:  Our models use multiple semantic embeddings to achieve the dual objective of being robust to vocabulary changes between training and testing phases . Convolutional and recurrent neural networks (CNNs-RNNs) are jointly adopted to infer similarity among neighbours and query images.
Edit intent: clarity
Original:  Our models use multiple semantic embeddings to properly map metadata to a meaningful semantic space decoupling the neural model from the low-level representation of metadata and achieve robustness to vocabulary changes between training and testing phases . Convolutional and recurrent neural networks (CNNs-RNNs) are jointly adopted to infer similarity among neighbours and query images.
Revised:  Our models use multiple semantic embeddings to properly map metadata to a meaningful semantic space decoupling the neural model from the low-level representation of metadata and achieve robustness to vocabulary changes between training and testing phases . Convolutional and recurrent neural networks (CNNs-RNNs) are jointly adopted to infer similarity among neighbors and query images.
Edit intent: fluency
Original:  Given the potentially dangerous effects of hate speech, which can inflict harm on targeted victims, create a sense of fear amongst communities and pollute civic discourse , there is a pressing need to  understand at a granular level how it manifests amongst far right actors online .
Revised:  Given the potentially dangerous effects of hate speech, which can inflict harm on targeted victims, create a sense of fear amongst communities and stir up intergroup tensions and conflict. Accordingly , there is a pressing need to understand at a granular level how it manifests amongst far right actors online .
Edit intent: clarity
Original:  Given the potentially dangerous effects of hate speech, which can inflict harm on targeted victims, create a sense of fear amongst communities and pollute civic discourse , there is a pressing need to  understand at a granular level how it manifests amongst far right actors online .
Revised:  Given the potentially dangerous effects of hate speech, which can inflict harm on targeted victims, create a sense of fear amongst communities and pollute civic discourse , there is a pressing need to better understand at a granular level how it manifests amongst far right actors online .
Edit intent: clarity
Original:  Using a new dataset of five million tweets, collected over a period of one year,  we identify seven distinct trajectories of Islamophobia, which capture qualitative, qualitative and temporal differences in users' behaviour.
Revised:  Analysing a new data set of five million tweets, collected over a period of one year, we identify seven distinct trajectories of Islamophobia, which capture qualitative, qualitative and temporal differences in users' behaviour.
Edit intent: clarity
Original:  We propose AdaWISH, which is able to obtain the same guarantee , but accesses only a small subset of queries of WISH. For example, when the number of function values is bounded by a constant, AdaWISH issues only O( \log n) queries.
Revised:  We propose AdaWISH, which is able to obtain the same guarantee but accesses only a small subset of queries of WISH. For example, when the number of function values is bounded by a constant, AdaWISH issues only O( \log n) queries.
Edit intent: fluency
Original:  We propose AdaWISH, which is able to obtain the same guarantee , but accesses only a small subset of queries of WISH. For example, when the number of function values is bounded by a constant, AdaWISH issues only O( \log n) queries.
Revised:  We propose AdaWISH, which is able to obtain the same guarantee , but accesses only a small subset of queries of WISH. For example, when the number of function values is bounded by a constant, AdaWISH issues only O( log n) queries.
Edit intent: fluency
Original:  The key idea is to query adaptively, taking advantage of the shape of the weight function  .
Revised:  The key idea is to query adaptively, taking advantage of the shape of the weight function being integrated .
Edit intent: clarity
Original:  Experimentally, AdaWISH gives precise estimates for discrete integration problems, of the same quality as that of WISH and better than several competing approaches, on a variety of probabilistic inference benchmarks , while saving substantially on the number of optimization queries compared to WISH. For example, it saves 81.5%DIFDELCMD < \\%%% %DIF < of WISH queries while retaining the quality of results on a suite of UAI inference challenge benchmarks  .
Revised:  Experimentally, AdaWISH gives precise estimates for discrete integration problems, of the same quality as that of WISH and better than several competing approaches, on a variety of probabilistic inference benchmarks . At the same time, it saves substantially on the number of optimization queries compared to WISH. For example, it saves 81.5%DIFDELCMD < \\%%% %DIF < of WISH queries while retaining the quality of results on a suite of UAI inference challenge benchmarks .
Edit intent: coherence
Original:  Experimentally, AdaWISH gives precise estimates for discrete integration problems, of the same quality as that of WISH and better than several competing approaches, on a variety of probabilistic inference benchmarks , while saving substantially on the number of optimization queries compared to WISH. For example, it saves 81.5%DIFDELCMD < \\%%% %DIF < of WISH queries while retaining the quality of results on a suite of UAI inference challenge benchmarks  .
Revised:  Experimentally, AdaWISH gives precise estimates for discrete integration problems, of the same quality as that of WISH and better than several competing approaches, on a variety of probabilistic inference benchmarks , while saving substantially on the number of optimization queries compared to WISH. %DIFDELCMD < \\%%% %DIF < of WISH queries while retaining the quality of results on a suite of UAI inference challenge benchmarks .
Edit intent: coherence
Original:  Experimentally, AdaWISH gives precise estimates for discrete integration problems, of the same quality as that of WISH and better than several competing approaches, on a variety of probabilistic inference benchmarks , while saving substantially on the number of optimization queries compared to WISH. For example, it saves 81.5%DIFDELCMD < \\%%% %DIF < of WISH queries while retaining the quality of results on a suite of UAI inference challenge benchmarks  .
Revised:  Experimentally, AdaWISH gives precise estimates for discrete integration problems, of the same quality as that of WISH and better than several competing approaches, on a variety of probabilistic inference benchmarks , while saving substantially on the number of optimization queries compared to WISH. For example, it saves 81.5%DIFDELCMD < \\%%% %DIF < of WISH queries while retaining the quality of On a suite of UAI inference challenge benchmarks .
Edit intent: clarity
Original:  We propose an unsupervised model-free method to identify the subset of features that define a low dimensional subspace in which clustering can be conducted.
Revised:  We propose an unsupervised method to identify the subset of features that define a low dimensional subspace in which clustering can be conducted.
Edit intent: clarity
Original:  Although the dynamics of large cascades have been extensively studied in various contexts, few have examined the mechanisms that govern the efficiency of information diffusion.
Revised:  Although the dynamics of large cascades have been extensively studied in various contexts, few have examined the efficiency of information diffusion.
Edit intent: clarity
Original:  Although the dynamics of large cascades have been extensively studied in various contexts, few have examined the mechanisms that govern the efficiency of information diffusion.
Revised:  Although the dynamics of large cascades have been extensively studied in various contexts, few have examined the mechanisms that govern the efficiency of global diffusion.
Edit intent: clarity
Original:  Here, by employing the linear threshold model on networks with communities, we demonstrate that a prominent network feature---the modular structure---strongly affects the speed of information diffusion .
Revised:  Here, by employing the linear threshold model on networks with communities, we demonstrate that a prominent network feature---the modular structure---strongly affects the speed of diffusion at global scale .
Edit intent: clarity
Original: The rapid diffusion of information and the adoption of ideas are of critical importance in situations as diverse as emergencies, collective actions,  or advertising and marketing.
Revised: The rapid diffusion of information and the adoption of ideas are of critical importance in situations as diverse as collective actions, or advertising and marketing.
Edit intent: clarity
Original:  Although the dynamics of large cascades have been extensively studied in various contexts, few have systematically examined the impact of network topology on the efficiency of global diffusion.
Revised:  Although the dynamics of large cascades have been extensively studied in various contexts, few have systematically examined the impact of network topology on the efficiency of information diffusion.
Edit intent: clarity
Original:  Our simulation results show that , when global cascades are enabled, there exists an optimal network modularity for the most efficient information spreading process.
Revised:  Our simulation results show that , when global cascades are enabled, there exists an optimal network modularity for the most efficient spreading process.
Edit intent: clarity
Original:  Beyond this critical value, either a stronger or a weaker modular structure actually hinders the speed of global cascades .
Revised:  Beyond this critical value, either a stronger or a weaker modular structure actually hinders the diffusion speed .
Edit intent: clarity
Original:  Our findings have practical implications in disciplines from marketing to epidemics , from neuroscience to engineering, where the understanding of the structural design of complex systems focuses on the efficiency of information propagation.
Revised:  Our findings have practical implications in disciplines from marketing to epidemiology , from neuroscience to engineering, where the understanding of the structural design of complex systems focuses on the efficiency of information propagation.
Edit intent: clarity
Original:  Here  the focus is on a three-field formulation of the problem in which the displacement field of the elastic matrix and, additionally, one velocity field and one pressure field for each of the n \ge 1 fluid networks are the unknown physical quantities.
Revised:  Here , the focus is on a three-field formulation of the problem in which the displacement field of the elastic matrix and, additionally, one velocity field and one pressure field for each of the n \ge 1 fluid networks are the unknown physical quantities.
Edit intent: fluency
Original: A binary Steinhaus triangle is a triangle of zeroes and ones that points down and with the same local rule than the Pascal triangle modulo 2.
Revised: A binary Steinhaus triangle is a triangle of zeroes and ones that points down and with the same local rule as the Pascal triangle modulo 2.
Edit intent: fluency
Original:  This permits us to give, in the second part of this paper, an explicit basis for even Steinhaus graphs and for the vector space of parity-regular Steinhaus graphs , that is the linear subspace of Steinhaus graphs that are even or odd.
Revised:  This permits us to give, in the second part of this paper, an explicit basis for even Steinhaus graphs and for the vector space of parity-regular Steinhaus graphs ; i.e., the linear subspace of Steinhaus graphs that are even or odd.
Edit intent: coherence
Original:  Finally, in the last part of this paper, we consider the generalized Pascal triangles, that are triangles of zeroes and ones, that point up now, and always with the same local rule than the Pascal triangle modulo 2.
Revised:  Finally, in the last part of this paper, we consider the generalized Pascal triangles, that are triangles of zeroes and ones, that point up now, and always with the same local rule as the Pascal triangle modulo 2.
Edit intent: fluency
Original: The recently introduced Mass Energy Enstrophy and Vorticity conserving (MEEVc) scheme for Navier-Stokes equations in 2D is extended to address turbidity currents .
Revised: In this work we present a structure preserving discretization for turbidity currents based on a mass-, energy-, enstrophy-, and vorticity-conserving formulation for 2D is extended to address turbidity currents .
Edit intent: clarity
Original:  A comparison with literature results shows the ability of the new method to produce similar results with 10^2 less degrees of freedom.
Revised:  A comparison with literature results is presented showing that this approach can retrieve the dynamics of the system with a much smaller number of degrees of freedom.
Edit intent: clarity
Original:  The framework further recommends the movement of surrounding furniture objects that expand the size of the mutual space with minimal physical effort.
Revised:  The framework further recommends movement of surrounding furniture objects that expand the size of the mutual space with minimal physical effort.
Edit intent: fluency
Original: Particle-based simulations of the Vlasov equation typically require a large number of particles, which leads to  ordinary differential equations of a very high dimension . Solving such equations is computationally very expensive, especially when simulations for many different values of input parameters are desired.
Revised: Particle-based simulations of the Vlasov equation typically require a large number of particles, which leads to a high-dimensional system of ordinary differential equations of a very high dimension . Solving such equations is computationally very expensive, especially when simulations for many different values of input parameters are desired.
Edit intent: clarity
Original: Particle-based simulations of the Vlasov equation typically require a large number of particles, which leads to  ordinary differential equations of a very high dimension . Solving such equations is computationally very expensive, especially when simulations for many different values of input parameters are desired.
Revised: Particle-based simulations of the Vlasov equation typically require a large number of particles, which leads to ordinary differential equations . Solving such equations is computationally very expensive, especially when simulations for many different values of input parameters are desired.
Edit intent: clarity
Original: Particle-based simulations of the Vlasov equation typically require a large number of particles, which leads to  ordinary differential equations of a very high dimension . Solving such equations is computationally very expensive, especially when simulations for many different values of input parameters are desired.
Revised: Particle-based simulations of the Vlasov equation typically require a large number of particles, which leads to ordinary differential equations of a very high dimension . Solving such systems is computationally very expensive, especially when simulations for many different values of input parameters are desired.
Edit intent: clarity
Original: We present an algorithmic framework generalizing quantum-inspired polylogarithmic-time algorithms on low-rank matrices.
Revised: We present an algorithmic framework for quantum-inspired polylogarithmic-time algorithms on low-rank matrices.
Edit intent: clarity
Original:  The main result of this work is an algorithm for singular value transformation on low-rank inputs in the quantum-inspired regime, where singular value transformation is a framework proposed by Gily\'en et al.
Revised:  Motivated by quantum linear algebra algorithms and the quantum singular value transformation is a framework proposed by Gily\'en et al.
Edit intent: clarity
Original:  The main result of this work is an algorithm for singular value transformation on low-rank inputs in the quantum-inspired regime, where singular value transformation is a framework proposed by Gily\'en et al.
Revised:  The main result of this work is an algorithm for singular value transformation on low-rank inputs in the quantum-inspired regime, where singular value transformation (SVT) framework of Gily\'en et al.
Edit intent: clarity