wanyu/IteraTeR_full_sent huggingface dataset:
Original:  We establish that the tests are insufficiently powered to distinguish randomness from alternatives consistent with the variation in NBA shootingpercentages. While multiple testing procedures reveal that one shooter can be inferred to exhibit shooting significantly inconsistent with randomness , we find that participants in a survey of basketball fans over-estimate an average player's streakiness, corroborating the empirical support for the hot hand fallacy .
Revised:  We establish that substantially larger data sets are required to derive an informative measurement of the deviation from randomness in basketball shooting. Although multiple testing procedures reveal that one shooter can be inferred to exhibit shooting significantly inconsistent with randomness , we find that participants in a survey of basketball fans over-estimate an average player's streakiness, corroborating the empirical support for the hot hand fallacy .
Edit intent: clarity
Original:  While multiple testing procedures reveal that one shooter can be inferred to exhibit shooting significantly inconsistent with randomness , we find that participants in a survey of basketball fans over-estimate an average player's streakiness, corroborating the empirical support for the hot hand fallacy .
Revised:  While multiple testing procedures reveal that one shooter in the experiment exhibits a shooting pattern significantly inconsistent with randomness , we find that participants in a survey of basketball fans over-estimate an average player's streakiness, corroborating the empirical support for the hot hand fallacy .
Edit intent: clarity
Original:  While multiple testing procedures reveal that one shooter can be inferred to exhibit shooting significantly inconsistent with randomness , we find that participants in a survey of basketball fans over-estimate an average player's streakiness, corroborating the empirical support for the hot hand fallacy .
Revised:  While multiple testing procedures reveal that one shooter can be inferred to exhibit shooting significantly inconsistent with randomness - supplying strong evidence that basketball shooting is not random for all shooters all of the time - we find that participants in a survey of basketball fans over-estimate an average player's streakiness, corroborating the empirical support for the hot hand fallacy .
Edit intent: meaning-changed
Original:  While multiple testing procedures reveal that one shooter can be inferred to exhibit shooting significantly inconsistent with randomness , we find that participants in a survey of basketball fans over-estimate an average player's streakiness, corroborating the empirical support for the hot hand fallacy .
Revised:  While multiple testing procedures reveal that one shooter can be inferred to exhibit shooting significantly inconsistent with randomness , we find that the evidence against randomness is limited to this shooter. Our results provide a mathematical and statistical foundation for the design and validation of experiments that directly compare deviations from randomness with human beliefs about deviations from randomness in Bernoulli sequences .
Edit intent: meaning-changed
Original:  We show that, for a generic instance of the problem --- all instances except of a zero-measure set of degenerate problems --- a fair and Pareto-optimal division with the smallest possible number of shared objects can be found in polynomial time, assuming that the number of agents is fixed.
Revised:  We show that, for a generic instance of the problem -- all instances except of a zero-measure set of degenerate problems --- a fair and Pareto-optimal division with the smallest possible number of shared objects can be found in polynomial time, assuming that the number of agents is fixed.
Edit intent: fluency
Original:  We show that, for a generic instance of the problem --- all instances except of a zero-measure set of degenerate problems --- a fair and Pareto-optimal division with the smallest possible number of shared objects can be found in polynomial time, assuming that the number of agents is fixed.
Revised:  We show that, for a generic instance of the problem --- all instances except of a zero-measure set of degenerate problems -- a fair Pareto-optimal division with the smallest possible number of shared objects can be found in polynomial time, assuming that the number of agents is fixed.
Edit intent: clarity
Original:  However, the implementation of these algorithms often requires an enhanced indexing structure: to achieve optimality we either need to build completely new indexes  or we must populate the database with several different instantiations of common indexes such as B+-trees.
Revised:  However, the implementation of these algorithms often requires an enhanced indexing structure: to achieve optimality we either need to build completely new indexes , or we must populate the database with several different instantiations of common indexes such as B+-trees.
Edit intent: fluency
Original:  However, the implementation of these algorithms often requires an enhanced indexing structure: to achieve optimality we either need to build completely new indexes  or we must populate the database with several different instantiations of common indexes such as B+-trees.
Revised:  However, the implementation of these algorithms often requires an enhanced indexing structure: to achieve optimality we either need to build completely new indexes or we must populate the database with several instantiations of indexes such as B+-trees.
Edit intent: clarity
Original:  Remarkably, we can even extend our framework to compute more expressive queries in relational algebra using both unions and a form of limited negation, by introducing a lazy version of Qdags .
Revised:  Remarkably, we can even extend our framework to compute more expressive queries in relational algebra using both unions and a form of limited negation, by introducing a lazy version of qdags (lqdags) .
Edit intent: meaning-changed
Original:  It is shown that several conditions on dispersion matrices and the components of dispersion matrices of multivariate normal risks for the monotonicity of the Gini index in the usual stochastic order proposed by Samanthi, Wei and Brazauskas (2016) and Kim and Kim (2019)  also suitable for multivariate elliptical risks  .
Revised:  It is shown that several conditions on dispersion matrices and the components of dispersion matrices of multivariate normal risks for the monotonicity of the Gini index in the usual stochastic order proposed by Samanthi, Wei and Brazauskas (2016) and Kim and Kim (2019) are also suitable for multivariate elliptical risks .
Edit intent: clarity
Original:  It is shown that several conditions on dispersion matrices and the components of dispersion matrices of multivariate normal risks for the monotonicity of the Gini index in the usual stochastic order proposed by Samanthi, Wei and Brazauskas (2016) and Kim and Kim (2019)  also suitable for multivariate elliptical risks  .
Revised:  It is shown that several conditions on dispersion matrices and the components of dispersion matrices of multivariate normal risks for the monotonicity of the Gini index in the usual stochastic order proposed by Samanthi, Wei and Brazauskas (2016) and Kim and Kim (2019) also suitable for multivariate elliptical risks . We also study the tail probability of Gini index for multivariate elliptical risks and revised a large deviation result for the Gini indexes of multivariate normal risks in Kim and Kim (2019) .
Edit intent: meaning-changed
Original: We build a heuristic that takes a given option price in the tails with strike K and extends (for calls, all strikes > K, for put all strikes < K) assuming the continuation falls into what we define as "Karamata Constant" over which the strong Pareto law holds.
Revised: We build a methodology that takes a given option price in the tails with strike K and extends (for calls, all strikes > K, for put all strikes < K) assuming the continuation falls into what we define as "Karamata Constant" over which the strong Pareto law holds.
Edit intent: clarity
Original: We build a heuristic that takes a given option price in the tails with strike K and extends (for calls, all strikes > K, for put all strikes < K) assuming the continuation falls into what we define as "Karamata Constant" over which the strong Pareto law holds.
Revised: We build a heuristic that takes a given option price in the tails with strike K and extends (for calls, all strikes > K, for puts all strikes < K) assuming the continuation falls into what we define as "Karamata Constant" over which the strong Pareto law holds.
Edit intent: fluency
Original:  The heuristic allows us to scrutinize the volatility surface and test  theories of relative tail option mispricing and overpricing usually built on thin tailed models and modification of the Black-Scholes formula  .
Revised:  The methodology allows us to scrutinize the volatility surface and test theories of relative tail option mispricing and overpricing usually built on thin tailed models and modification of the Black-Scholes formula .
Edit intent: clarity
Original:  The heuristic allows us to scrutinize the volatility surface and test  theories of relative tail option mispricing and overpricing usually built on thin tailed models and modification of the Black-Scholes formula  .
Revised:  The heuristic allows us to scrutinize the volatility surface and test various theories of relative tail option mispricing and overpricing usually built on thin tailed models and modification of the Black-Scholes formula .
Edit intent: meaning-changed
Original:  The heuristic allows us to scrutinize the volatility surface and test  theories of relative tail option mispricing and overpricing usually built on thin tailed models and modification of the Black-Scholes formula  .
Revised:  The heuristic allows us to scrutinize the volatility surface and test theories of relative tail option overpricing ( usually built on thin tailed models and modification of the Black-Scholes formula .
Edit intent: clarity
Original:  The heuristic allows us to scrutinize the volatility surface and test  theories of relative tail option mispricing and overpricing usually built on thin tailed models and modification of the Black-Scholes formula  .
Revised:  The heuristic allows us to scrutinize the volatility surface and test theories of relative tail option mispricing and overpricing usually built on thin tailed models and minor modifications/fudging of the Black-Scholes formula .
Edit intent: meaning-changed
Original:  The heuristic allows us to scrutinize the volatility surface and test  theories of relative tail option mispricing and overpricing usually built on thin tailed models and modification of the Black-Scholes formula  .
Revised:  The heuristic allows us to scrutinize the volatility surface and test theories of relative tail option mispricing and overpricing usually built on thin tailed models and modification of the Black-Scholes formula ) .
Edit intent: fluency
Original:  We then propose a new non-adaptive scheduling policy that is based on combinatorial designs, and show that it improves our performance metrics. We observe in simulation that the proposed scheduling policy, as the performance metrics indicate , reduces the queuing times up to 25\% compared to random scheduling and up to 100\% compared round-robin scheduling.
Revised:  We then propose a new non-adaptive scheduling policy that is based on combinatorial designs, and show that it has better performance indicators. Simulations confirm that the proposed scheduling policy, as the performance metrics indicate , reduces the queuing times up to 25\% compared to random scheduling and up to 100\% compared round-robin scheduling.
Edit intent: clarity
Original:  We observe in simulation that the proposed scheduling policy, as the performance metrics indicate , reduces the queuing times up to 25\% compared to random scheduling and up to 100\% compared round-robin scheduling.
Revised:  We observe in simulation that the proposed scheduling policy, as the performance indicators suggest , reduces the queuing times up to 25\% compared to random scheduling and up to 100\% compared round-robin scheduling.
Edit intent: clarity
Original:  The method relies on implicit representations of the coboundary operator and of the filtration order of the simplices, avoiding the explicit construction and storage of the filtration coboundary matrix  .
Revised:  The method relies on implicit representations of the coboundary operator and of the filtration order of the simplices, avoiding the explicit construction and storage of the filtration coboundary matrix . Moreover, it makes use of apparent pairs, a simple but powerful method for constructing a discrete gradient field from a total order on the simplices of a simplicial complex, which is also of independent interest .
Edit intent: meaning-changed
Original:  As a practical illustration, we test the Environmental Kuznets Curve (EKC) hypothesis for six early industrialized countries . The more efficient and more powerful FMGLS approach raises important questions concerning the standard model specification for EKC analysis .
Revised:  As a practical illustration, we test the Environmental Kuznets Curve (EKC) hypothesis for six early industrialized countries as in Wagner et al. (2020) .
Edit intent: meaning-changed
Original:  Specialising to the bacterial persister phenotype, we analyse stochastic switching between phenotypes in detail in an asymptotic limit . Abundant phenotypic variation tends to be linearly destabilising, but, surprisingly, a rare phenotype can have a stabilising effect.
Revised:  Specialising to the bacterial persister phenotype, we analyse stochastic switching between phenotypes in detail in an asymptotic limit and partly overturn classical stability paradigms: abundant phenotypic variation is linearly destabilizing but, surprisingly, a rare phenotype can have a stabilising effect.
Edit intent: meaning-changed
Original: The law of a mean-reverting (Ornstein-Uhlenbeck) process driven by a compound Poisson with exponential jumps is investigated in the context of the energy derivatives pricing. The said distribution turns out to be related to the self-decomposable gamma laws, and its density and characteristic function are here given in closed-form. Algorithms for the exact simulation of such a process are accordingly derived with the advantage of being significantly faster (at least 30 times) than those available in the literature.
Revised: Most energy and commodity markets exhibit mean-reversion and occasional distinctive price spikes, which results in demand for derivative products which protect the holder against high prices. To this end, in this paper we present exact and fast methodologies for the simulation of the exact simulation of such a process are accordingly derived with the advantage of being significantly faster (at least 30 times) than those available in the literature.
Edit intent: clarity
Original:  Algorithms for the exact simulation of such a process are accordingly derived with the advantage of being significantly faster (at least 30 times) than those available in the literature. They are also extended to more general cases (bilateral exponential jumps, and time-dependent intensity of the Poisson process). These results are finally applied to the pricing of  gas storages and swings under  jump-diffusion market models, and the apparent computational advantages of the proposed procedures are emphasized 
Revised:  Algorithms for the exact simulation of the sum of an Ornstein-Uhlenbeck and an independent pure jump process, where the latter one is driven by a compound Poisson process with (bilateral) exponentially distributed jumps. These methodologies are finally applied to the pricing of gas storages and swings under jump-diffusion market models, and the apparent computational advantages of the proposed procedures are emphasized 
Edit intent: meaning-changed
Original:  We then apply this valuation to the decision problem of selecting papers for publication from an overall pool of submissions. Our initial analysis shows that one of the better solutions, we can accomplish with regards to the creation and dissemination of knowledge, might be described by the prescription, "Don't Simply Optimize, Also Randomize; best described by the term - Randoptimization". We specifically show that the best decision we can make, with regards to the selection of articles by journals, requires us to formulate a cutoff point, or, a region of optimal performance and randomly select from within that region of better results. The policy implication (for all fields) is to randomly select papers, based on publication limitations (journal space, reviewer load etc.) from an overall pool of submissions, that have a single shred of knowledge (or one unique idea) and have the editors and reviewers coach the authors to ensure a better final outcome .
Revised:  We provide justifications for these finance principles based on the limitations of the physical world we live in. To the best of our knowledge this is the first recorded attempt to put a numerical value on knowledge. The implications of this valuation exercise, which places a high premium on any piece of knowledge, are to ensure that participants in any knowledge system are better trained to notice the knowledge available from any source. Just because someone does not see a connection, does not mean that there is no connection. We need to try harder and be more open to acknowledging the smallest piece of new knowledge that might have been brought to light by anyone from anywhere about anything .
Edit intent: meaning-changed
Original: We introduce a new perspective on the evaluation of privacy, where rights of the data subjects, privacy principles, and usability criteriaare intertwined. This new perspective is visually represented through a cube  where each of its three axes of variability captures, respectively: principles, rights , and usability criteria.
Revised: We introduce a new model for evaluating privacy that builds on the criteria proposed by the EuroPriSe certification scheme by adding usability criteria. Our model is visually represented through a cube where each of its three axes of variability captures, respectively: principles, rights , and usability criteria.
Edit intent: meaning-changed
Original:  This new perspective is visually represented through a cube  where each of its three axes of variability captures, respectively: principles, rights , and usability criteria. In this way, our model, called Usable Privacy Cube (or UP Cube), brings out two perspectives on privacy: that of the data subjects and that of the controllers/processors.
Revised:  This new perspective is visually represented through a cube where each of its three axes of variability captures, respectively: rights of the data subjects and that of the controllers/processors.
Edit intent: clarity
Original:  In this way, our model, called Usable Privacy Cube (or UP Cube), brings out two perspectives on privacy: that of the data subjects and that of the controllers/processors. In the long run, the UP Cube is meant to be the model behind a new certification methodology capable of evaluating the usability of privacy . Our research builds on the criteriaproposed by the EuroPriSe certification scheme by adding usability criteria to their evaluation .
Revised:  In this way, our model, called Usable Privacy Cube (or UP Cube), brings out two perspectives on privacy: that of the data subjects , privacy principles, and usable privacy criteria .
Edit intent: clarity
Original:  We slightly URLanize the criteria of EuroPriSe to fit with the UP Cube model, i.e., we show how the EuroPriSe can be viewed as a combination of only principles and rights , forming the basis of the UP Cube.
Revised:  We slightly URLanize the criteria of EuroPriSe to fit with the UP Cube model, i.e., we show how the EuroPriSe can be viewed as a combination of only rights and principles , forming the basis of the UP Cube.
Edit intent: fluency
Original:  We slightly URLanize the criteria of EuroPriSe to fit with the UP Cube model, i.e., we show how the EuroPriSe can be viewed as a combination of only principles and rights , forming the basis of the UP Cube.
Revised:  We slightly URLanize the criteria of EuroPriSe to fit with the UP Cube model, i.e., we show how the EuroPriSe can be viewed as a combination of only principles and rights , forming the two axes at the basis of our UP Cube.
Edit intent: meaning-changed
Original:  Usability criteria are defined based on goals that we extract from the data protection regulations , at the same time considering the needs, goals and characteristics of different types of users and their context of use .
Revised:  In this way we also want to bring out two perspectives on privacy: that of the data subjects and, respectively, that of the controllers/processors. We define usable privacy criteria based on usability goals that we extract from the data protection regulations , at the same time considering the needs, goals and characteristics of different types of users and their context of use .
Edit intent: meaning-changed
Original:  Considering usability criteria allows for greater business differentiation  beyond GDPR compliance.
Revised:  Precisely, we measure effectiveness, efficiency, and satisfaction, considering both the objective and the perceived usability outcomes, producing measures of accuracy and completeness, of resource utilization (e.g., time, effort, financial), and measures resulting from satisfaction scales. In the long run, the UP Cube is meant to be the model behind a new certification methodology capable of evaluating the usability of privacy, to the benefit of common users. For industries, considering also the usability of privacy would allow for greater business differentiation beyond GDPR compliance.
Edit intent: coherence
Original:  We slightly URLanize the criteria of EuroPriSe to fit with the UP Cube model, i.e., we show how the EuroPriSe can be viewed as a combination of only rights and principles, forming the two axes at the basis of our UP Cube.
Revised:  We slightly URLanize the criteria of EuroPriSe to fit with the UP Cube model, i.e., we show how EuroPriSe can be viewed as a combination of only rights and principles, forming the two axes at the basis of our UP Cube.
Edit intent: clarity
Original: Standard artificial neural networks  model key cognitive aspects of brain function , such as learning and classification, but they do not model the affective (emotional) aspects ; however primary and secondary emotions play a key role in interactions with the physical, ecological, and social environment. These emotions are associated with memories when neuromodulators such as dopamine and noradrenaline affect entire patterns of synaptically activated neurons. Standard artificial neural networks (ANNs) do not model this non-local effect of neuromodulators, which are a significant feature in the brain (the associated `ascending systems' have been hard-wired into the brain by evolutionary processes).
Revised: Standard artificial neural networks model key cognitive aspects of brain function , such as learning and classification, but they do not model the affective (emotional) aspects of brain function. However these are a key feature of the brain (the associated `ascending systems' have been hard-wired into the brain by evolutionary processes).
Edit intent: coherence
Original:  In this paper we present a salience-affected neural network (SANN) model which, at the same time as local network processing of task-specific information, includes non-local salience (significance) effects responding to an input salience signal.
Revised:  These emotions are associated with memories when neuromodulators such as dopamine and noradrenaline affect entire patterns of synaptically activated neurons. Here we present a salience-affected neural network (SANN) model which, at the same time as local network processing of task-specific information, includes non-local salience (significance) effects responding to an input salience signal.
Edit intent: meaning-changed