wanyu/IteraTeR_v2 huggingface dataset:
Original: Recently, some researchers in the community of answer set programming introduced the notions of subjective constraint monotonicity, epistemic splitting, and foundedness  for epistemic logic programs, aiming to use them as main criteria / intuitions to compare different answer set semantics proposed in the literature on how they comply with these intuitions.
Revised: Recently, some researchers in the community of answer set programming introduced the notions of subjective constraint monotonicity, epistemic splitting, and foundedness for epistemic logic programs, aiming to use them as main criteria respectively intuitions to compare different answer set semantics proposed in the literature on how they comply with these intuitions.
Edit intent: fluency
Original:  In this note we demonstrate that these three properties are too strong and may exclude some desired answer sets / world views.
Revised:  In this note , we consider these three notions and demonstrate on some examples that they may be too strong in general and may exclude some desired answer sets / world views.
Edit intent: clarity
Original:  In this note we demonstrate that these three properties are too strong and may exclude some desired answer sets / world views.
Revised:  In this note we demonstrate that these three properties are too strong and may exclude some desired answer sets respectively world views.
Edit intent: fluency
Original:  Therefore, such properties should not be used as necessary conditions for answer set semantics  .
Revised:  In conclusion, these properties should not be used as necessary conditions for answer set semantics .
Edit intent: coherence
Original:  Therefore, such properties should not be used as necessary conditions for answer set semantics  .
Revised:  Therefore, such properties should not be regarded as mandatory properties that every answer set semantics .
Edit intent: clarity
Original: In this paper, we study the numerical method for solving forward-backward stochastic differential equations driven by G-Brownian motion (G-FBSDEs) which correspond to fully nonlinear partial differential equation (PDEs).
Revised: In this paper, we study the numerical method for solving forward-backward stochastic differential equations driven by G-Brownian motion (G-FBSDEs) which correspond to fully nonlinear partial differential equations (PDEs).
Edit intent: fluency
Original:  However, observations may also be independent samples from marginal data distributionsof each observable variable , summary statistics, or even data distributions themselves .
Revised:  However, in many real-life scenarios, the observations are given as marginal distributions , summary statistics, or even data distributions themselves .
Edit intent: clarity
Original:  We define the notion of stochastic conditioning and describe extensions of known general inference algorithms to probabilistic programs with stochastic conditioning.
Revised:  We define the notion of stochastic conditioning and discuss its key properties. We then show how to perform inference in the presence of stochastic conditioning.
Edit intent: clarity
Original:  In case studies we provide probabilistic programs for several problems of statistical inference which are impossible or difficult to approach otherwise, perform inference on the programs, and analyse the results .
Revised:  We demonstrate potential usage of stochastic conditioning on several case studies which involve various kinds of stochastic conditioning and are difficult to solve otherwise. Although we present stochastic conditioning in the context of probabilistic programming, our formalization is general and applicable to other settings .
Edit intent: clarity
Original: The discipline of process mining deals with analyzing execution data of operational processes, extracting models from event data, checking the conformance between event data and normative models, and enhancing all aspects of processes.
Revised: Process mining is a discipline which concerns the analysis of execution data of operational processes, extracting models from event data, checking the conformance between event data and normative models, and enhancing all aspects of processes.
Edit intent: clarity
Original: The discipline of process mining deals with analyzing execution data of operational processes, extracting models from event data, checking the conformance between event data and normative models, and enhancing all aspects of processes.
Revised: The discipline of process mining deals with analyzing execution data of operational processes, the extraction of models from event data, checking the conformance between event data and normative models, and enhancing all aspects of processes.
Edit intent: fluency
Original: The discipline of process mining deals with analyzing execution data of operational processes, extracting models from event data, checking the conformance between event data and normative models, and enhancing all aspects of processes.
Revised: The discipline of process mining deals with analyzing execution data of operational processes, extracting models from event data, the measurement of the conformance between event data and normative models, and enhancing all aspects of processes.
Edit intent: clarity
Original: The discipline of process mining deals with analyzing execution data of operational processes, extracting models from event data, checking the conformance between event data and normative models, and enhancing all aspects of processes.
Revised: The discipline of process mining deals with analyzing execution data of operational processes, extracting models from event data, checking the conformance between event data and normative models, and the enhancement of all aspects of processes.
Edit intent: fluency
Original:  Recently, new techniques have been developed to analyze event data containing uncertainty;
Revised:  Recently, new methods have been developed to analyze event data containing uncertainty;
Edit intent: clarity
Original:  these techniques strongly rely on representing uncertain event data through graph-based models explicitly capturing uncertainty.
Revised:  these techniques prominently rely on representing uncertain event data through graph-based models explicitly capturing uncertainty.
Edit intent: clarity
Original:  these techniques strongly rely on representing uncertain event data through graph-based models explicitly capturing uncertainty.
Revised:  these techniques strongly rely on representing uncertain event data by means of graph-based models explicitly capturing uncertainty.
Edit intent: clarity
Original:  In this paper, we present a novel approach to efficiently compute a graph representation of the behavior contained in an uncertain process trace.
Revised:  In this paper, we introduce a new approach to efficiently compute a graph representation of the behavior contained in an uncertain process trace.
Edit intent: clarity
Original:  In this paper, we present a novel approach to efficiently compute a graph representation of the behavior contained in an uncertain process trace.
Revised:  In this paper, we present a novel approach to efficiently calculate a graph representation of the behavior contained in an uncertain process trace.
Edit intent: fluency
Original:  We present our new algorithm, analyze its time complexity, and report experimental results showing order-of-magnitude performance improvements for  behavior graph construction.
Revised:  We present our new algorithm, analyze its time complexity, and show experimental results that highlight order-of-magnitude performance improvements for behavior graph construction.
Edit intent: clarity
Original:  We present our new algorithm, analyze its time complexity, and report experimental results showing order-of-magnitude performance improvements for  behavior graph construction.
Revised:  We present our new algorithm, analyze its time complexity, and report experimental results showing order-of-magnitude performance improvements for the behavior graph construction.
Edit intent: fluency
Original: In this paper, we describe the findings of a survey that covered the topics of stress, citation tool use habits, subjective happiness, h-index, research topic and tenure among a sample of 2056 authors of a preprint service.
Revised: We describe the findings of a survey that covered the topics of stress, citation tool use habits, subjective happiness, h-index, research topic and tenure among a sample of 2056 authors of a preprint service.
Edit intent: coherence
Original:   In addition, no significant difference between stress levels and the research topic of authors was found.
Revised:  In addition, no significant association between stress levels and the research topic of authors was found.
Edit intent: clarity
Original:   In addition, no significant difference between stress levels and the research topic of authors was found.
Revised:  In addition, no significant difference between stress levels and the research topic was found.
Edit intent: clarity
Original: We describe the findings of a survey that covered the topics of stress, citation tool use habits, subjective happiness, h-index, research topic and tenure among a sample of 2286 authors  arxiv.org.
Revised: We describe the findings of a survey that covered the topics of stress, citation tool use habits, subjective happiness, h-index, research topic and tenure among a sample of 2286 authors of arxiv.org.
Edit intent: clarity
Original:  Ph.D. s students report the lowest subjective happiness score among all faculty roles, while tenured faculty reports the highest.
Revised:  Ph.D. students report the lowest subjective happiness score among all faculty roles, while tenured faculty reports the highest.
Edit intent: fluency
Original:  Ph.D. s students report the lowest subjective happiness score among all faculty roles, while tenured faculty reports the highest.
Revised:  Ph.D. s students report the lowest subjective happiness score among all faculty roles, while tenured faculty report the highest.
Edit intent: fluency
Original:  Tenured faculty reports the lowest levels of stress , undergraduate and graduate students report the highest levels of stress.
Revised:  Tenured faculty report the lowest levels of stress , undergraduate and graduate students report the highest levels of stress.
Edit intent: fluency
Original:  Tenured faculty reports the lowest levels of stress , undergraduate and graduate students report the highest levels of stress.
Revised:  Tenured faculty reports the lowest levels of stress . Undergraduate and graduate students report the highest levels of stress.
Edit intent: fluency
Original:  In addition, no significant association between stress levels and the research topic was found .
Revised:  In addition, no significant association between stress levels and the research topic was found 
Edit intent: fluency
Original: In this letter we propose a simple yet effective set of local control rules to make a group of herder agents collect and contain in a desired region an ensemble of non-cooperative  target agents in the plane.
Revised: In this Letter we propose a simple yet effective set of local control rules to make a group of herder agents collect and contain in a desired region an ensemble of non-cooperative target agents in the plane.
Edit intent: fluency
Original:  We show that all strategies are robust to such consistent parameter variations with the dynamic target selection strategies exhibiting the best herding performance.
Edit intent: coherence
Original:  Extensive numerical simulations show the effectiveness of the approach and are complemented by a more realistic validation on commercially available robotic agents via ROS.
Revised:  Extensive numerical simulations confirm the effectiveness of the approach and are complemented by a more realistic validation on commercially available robotic agents via ROS.
Edit intent: clarity
Original: In this Letter we propose a simple yet effective set of local control rules to make a group of herder agents collect and contain in a desired region an ensemble of non-cooperative stochastic target agents in the plane.
Revised: In this Paper we propose a simple yet effective set of local control rules to make a group of herder agents collect and contain in a desired region an ensemble of non-cooperative stochastic target agents in the plane.
Edit intent: clarity
Original: In this Letter we propose a simple yet effective set of local control rules to make a group of herder agents collect and contain in a desired region an ensemble of non-cooperative stochastic target agents in the plane.
Revised: In this Letter we propose a simple yet effective set of local control rules to make a group of "herder agents" collect and contain in a desired region an ensemble of non-cooperative stochastic target agents in the plane.
Edit intent: fluency
Original: In this Letter we propose a simple yet effective set of local control rules to make a group of herder agents collect and contain in a desired region an ensemble of non-cooperative stochastic target agents in the plane.
Revised: In this Letter we propose a simple yet effective set of local control rules to make a group of herder agents collect and contain in a desired region an ensemble of non-cooperative stochastic "target agents" in the plane.
Edit intent: clarity
Original:  We consider a general formulation that actually addresses two problems, since it accounts for the non-symmetry of these divergences in general .
Revised:  Since these divergences are not symmetric with respect to their two input arguments in general, they lead to two different formulations of the problem .
Edit intent: clarity
Original:  To optimize the resulting objective, we derive two algorithms based on accelerated gradient descent and alternating direction method of multiplier . Experiments conducted on audio signal recovery from  either exact or modified spectrograms highlight the potential of our proposed methods for audio restoration.
Revised:  To optimize the resulting objective, we derive two algorithms based on accelerated gradient descent and alternating direction method of multipliers . Experiments conducted on audio signal recovery from either exact or modified spectrograms highlight the potential of our proposed methods for audio restoration.
Edit intent: fluency
Original:  To optimize the resulting objective, we derive two algorithms based on accelerated gradient descent and alternating direction method of multiplier . Experiments conducted on audio signal recovery from  either exact or modified spectrograms highlight the potential of our proposed methods for audio restoration.
Revised:  To optimize the resulting objective, we derive two algorithms based on accelerated gradient descent and alternating direction method of multiplier . Experiments conducted on audio signal recovery from spectrograms that are either exact or modified spectrograms highlight the potential of our proposed methods for audio restoration.
Edit intent: clarity
Original:  The stochastic properties of the network contagion Markov process are analytically examined, and in the particular case of memory one with homogeneous urns , we characterize the limiting state of infection in each urn.
Revised:  The stochastic properties of the network contagion Markov process are analytically examined, and for homogeneous system parameters , we characterize the limiting state of infection in each urn.
Edit intent: clarity
Original:  Furthermore, noting that the latter case dynamical system admits a linear variant (realized by retaining its leading linear terms), we study the asymptotic behavior of the linear systems for both memory modes and characterize their equilibrium.
Revised:  Furthermore, noting that the latter dynamical system admits a linear variant (realized by retaining its leading linear terms), we study the asymptotic behavior of the linear systems for both memory modes and characterize their equilibrium.
Edit intent: clarity
Original:  Finally, we present simulations to assess the quality of the approximation purveyed by the linear and non-linear dynamical systems , which illustrate the key role that memory plays in improving its accuracy .
Revised:  Finally, we present simulation studies to assess the quality of the approximation purveyed by the linear and non-linear dynamical systems , which illustrate the key role that memory plays in improving its accuracy .
Edit intent: clarity
Original:  Finally, we present simulations to assess the quality of the approximation purveyed by the linear and non-linear dynamical systems , which illustrate the key role that memory plays in improving its accuracy .
Revised:  Finally, we present simulations to assess the quality of the approximation purveyed by the linear and non-linear dynamical systems .
Edit intent: coherence
Original:  In this paper, we elaborate the analysis of some of the schemes which were presented in arXiv:1711.07926 for the heat equation with periodic boundary conditions.
Revised:  In this paper, we elaborate the approach presented in arXiv:1711.07926 for the heat equation with periodic boundary conditions.
Edit intent: clarity
Original:  We adopt this methodology to derive finite-difference schemes for heat equation with Dirichlet and Neumann boundary conditions, whose convergence rates are higher than their truncation errors.
Revised:  We generalize this methodology to derive finite-difference schemes for heat equation with Dirichlet and Neumann boundary conditions, whose convergence rates are higher than their truncation errors.
Edit intent: clarity
Original:  We adopt this methodology to derive finite-difference schemes for heat equation with Dirichlet and Neumann boundary conditions, whose convergence rates are higher than their truncation errors.
Revised:  We adopt this methodology to design BFD schemes for the heat equation with Dirichlet and Neumann boundary conditions, whose convergence rates are higher than their truncation errors.
Edit intent: clarity
Original:  We adopt this methodology to derive finite-difference schemes for heat equation with Dirichlet and Neumann boundary conditions, whose convergence rates are higher than their truncation errors.
Revised:  We adopt this methodology to derive finite-difference schemes for heat equation with Dirichlet or Neumann boundary conditions, whose convergence rates are higher than their truncation errors.
Edit intent: fluency
Original:  One of such formulations is the arc flow, where variables represent flows on individual arcs of the network.
Revised:  Such formulations correspond to determining an optimal flow in a network. One particular class of network flow formulations is the arc flow, where variables represent flows on individual arcs of the network.
Edit intent: clarity
Original:   This paper proves the analogous quasioptimality result for the heterogeneous (i.e. variable coefficient ) Helmholtz equation, posed in R^d, d=2,3, with the Sommerfeld radiation condition at infinity, and C^\infty coefficients.
Revised:  This paper proves the analogous quasioptimality result for the heterogeneous (i.e. variable-coefficient ) Helmholtz equation, posed in R^d, d=2,3, with the Sommerfeld radiation condition at infinity, and C^\infty coefficients.
Edit intent: fluency
Original: A new  non-adaptive  recursive scheme for multigrid algorithms is introduced.
Revised: A new non-adaptive ) recursive scheme for multigrid algorithms is introduced.
Edit intent: fluency
Original:  In cases of problems for which the convergence of standard V-cycles or F-cycles (corresponding to \kappa=1 and \kappa=2, respectively) is particularly slow, and yet the cost of W-cycles is very high due to the large number of recursive calls (which is in exponential in the number of levels), intermediate values of \kappa may prove to yield significantly faster run-times.
Revised:  In cases of problems for which the convergence of standard V-cycles or F-cycles (corresponding to \kappa=1 and \kappa=2, respectively) is particularly slow, and yet the cost of W-cycles is very high due to the large number of recursive calls (which is exponential in the number of levels), intermediate values of \kappa may prove to yield significantly faster run-times.
Edit intent: clarity
Original:  Fully 25\% of all prefix announcements in 2020 include neither community nor AS pathchanges, i. e. are unnecessary .
Revised:  Fully 25\% of all announcements update the community attribute, but not the AS path .
Edit intent: clarity
Original:   While it is well-recognized that intra-AS next-hop  changes can cause spurious updates, we show that unnecessary updates can be due to communities  - primarily geolocation communities during pathexploration events.
Revised:  While it is well-recognized that intra-AS next-hop changes can cause spurious updates, we show in controlled laboratory experiments that they can be due to communities - primarily geolocation communities during pathexploration events.
Edit intent: clarity
Original: BGP communities are widely used to tag prefix aggregates in order to efficiently implement policy, traffic engineering, and inter-AS signaling.
Revised: BGP communities are widely used to tag prefix aggregates for policy, traffic engineering, and inter-AS signaling.
Edit intent: clarity
Original:  Because each individual AS defines its own community semantics, many ASes blindly propagate communities they do not recognize in routing announcements . Prior research has shown the potential security vulnerabilities possible when communities are not properly filtered.
Revised:  Because individual ASes define their own community semantics, many ASes blindly propagate communities they do not recognize in routing announcements . Prior research has shown the potential security vulnerabilities possible when communities are not properly filtered.
Edit intent: clarity
Original:  Because each individual AS defines its own community semantics, many ASes blindly propagate communities they do not recognize in routing announcements . Prior research has shown the potential security vulnerabilities possible when communities are not properly filtered.
Revised:  Because each individual AS defines its own community semantics, many ASes blindly propagate communities they do not recognize . Prior research has shown the potential security vulnerabilities possible when communities are not properly filtered.
Edit intent: clarity
Original:  Because each individual AS defines its own community semantics, many ASes blindly propagate communities they do not recognize in routing announcements . Prior research has shown the potential security vulnerabilities possible when communities are not properly filtered.
Revised:  Because each individual AS defines its own community semantics, many ASes blindly propagate communities they do not recognize in routing announcements . Prior research has shown the potential security vulnerabilities when communities are not properly filtered.
Edit intent: clarity
Original:  In this work , we shed light on a second unintended side-effect of communities and open propagationpolicies : an increase in unnecessary BGP routing messages.
Revised:  In this work , we shed light on a second unintended side-effect of communities and permissive propagation : an increase in unnecessary BGP routing messages.
Edit intent: clarity
Original:  We examine 10 years of BGP messages observed  at two route collector systems.
Revised:  We examine 10 years of BGP messages observed in the wild at two route collector systems.
Edit intent: clarity
Original:  In 2020, around 25\% of all announcements update the community attribute, but not the AS path .
Revised:  In 2020, approximately 25\% of all announcements update the community attribute, but not the AS path .
Edit intent: clarity
Original:  In 2020, around 25\% of all announcements update the community attribute, but not the AS path .
Revised:  In 2020, around 25\% of all announcements modify the community attribute, but not the AS path .
Edit intent: clarity
Original:  In 2020, around 25\% of all announcements update the community attribute, but not the AS path .
Revised:  In 2020, around 25\% of all announcements update the community attribute, but retain the AS path .
Edit intent: clarity