wanyu/IteraTeR_v2 huggingface dataset:
Original:  Many authors have suggested that overconfidence--defined here as believing you are better than you are in reality--is advantageous because it serves to increase ambition, resolve, morale, persistence , and/or the bluffing of opponents .
Revised:  Some authors have suggested that overconfidence--defined here as believing you are better than you are in reality--is advantageous because it serves to increase ambition, resolve, morale, persistence , and/or the bluffing of opponents .
Edit intent: fluency
Original:  Many authors have suggested that overconfidence--defined here as believing you are better than you are in reality--is advantageous because it serves to increase ambition, resolve, morale, persistence , and/or the bluffing of opponents .
Revised:  Many authors have suggested that not just confidence but overconfidence-believing you are better than you are in reality--is advantageous because it serves to increase ambition, resolve, morale, persistence , and/or the bluffing of opponents .
Edit intent: clarity
Original:  Many authors have suggested that overconfidence--defined here as believing you are better than you are in reality--is advantageous because it serves to increase ambition, resolve, morale, persistence , and/or the bluffing of opponents .
Revised:  Many authors have suggested that overconfidence--defined here as believing you are better than you are in reality-is advantageous because it serves to increase ambition, resolve, morale, persistence , and/or the bluffing of opponents .
Edit intent: fluency
Original:  Many authors have suggested that overconfidence--defined here as believing you are better than you are in reality--is advantageous because it serves to increase ambition, resolve, morale, persistence , and/or the bluffing of opponents .
Revised:  Many authors have suggested that overconfidence--defined here as believing you are better than you are in reality--is advantageous because it serves to increase ambition, morale , and/or the bluffing of opponents .
Edit intent: clarity
Original:  Many authors have suggested that overconfidence--defined here as believing you are better than you are in reality--is advantageous because it serves to increase ambition, resolve, morale, persistence , and/or the bluffing of opponents .
Revised:  Many authors have suggested that overconfidence--defined here as believing you are better than you are in reality--is advantageous because it serves to increase ambition, resolve, morale, persistence , resolve, persistence, or the credibility of bluffing, generating a self-fulfilling prophecy in which exaggerated confidence actually increases the probability of success .
Edit intent: clarity
Original:  However, too much overconfidence can cause arrogance, market bubbles, financial collapses, policy failures, disasters, and wars , so it remains a puzzle how such a false belief could evolve or remain stable in a population of competing accurate beliefs.
Revised:  However, overconfidence also leads to faulty assessments, unrealistic expectations, and hazardous decisions , so it remains a puzzle how such a false belief could evolve or remain stable in a population of competing accurate beliefs.
Edit intent: clarity
Original:  Here, we present an evolutionary model that shows overconfidence actually maximizes individual fitness and populations will tend to become overconfident, as long as the resources at stake during conflicts exceed twice the cost of competition.
Revised:  Here, we present an evolutionary model showing that, counter-intuitively, overconfidence maximizes individual fitness and populations will tend to become overconfident, as long as the resources at stake during conflicts exceed twice the cost of competition.
Edit intent: clarity
Original:  Here, we present an evolutionary model that shows overconfidence actually maximizes individual fitness and populations will tend to become overconfident, as long as the resources at stake during conflicts exceed twice the cost of competition.
Revised:  Here, we present an evolutionary model that shows overconfidence actually maximizes individual fitness and populations will tend to become overconfident, as long as benefits from contested resources are sufficiently large compared to the cost of competition.
Edit intent: clarity
Original:  Moreover, the fact that overconfident populations are evolutionarily stable may be one reason why overconfidence persists todayin politics, business, and finance, even if it causes occasional disasters .
Revised:  Moreover, the fact that overconfident populations are evolutionarily stable in a wide range of environments may help to explain why overconfidence remains prevalent today, even if it causes occasional disasters .
Edit intent: clarity
Original:  For instance "random" point sets meet the condition with high probability.
Edit intent: coherence
Original: We present concentration bounds for linear functions of random variables arising from the pipage rounding procedure on matroid polytopes.
Revised: We present concentration bounds for functions of random variables arising from the pipage rounding procedure on matroid polytopes.
Edit intent: clarity
Original:  As an application, we give a (1-1/e-epsilon)-approximation algorithm for the problem of maximizing a monotone submodular function subject to 1 matroid and k linear constraints, for any constant k >=1 and epsilon>0.
Revised:  As an application, we give a (1-1/e-epsilon)-approximation algorithm for the problem of maximizing a monotone submodular function subject to 1 matroid and k linear constraints, for any constant k and epsilon>0.
Edit intent: clarity
Original:  This generalizes the result for k linear constraints by Kulik et al.
Edit intent: coherence
Original:  SODA 2009%DIFDELCMD < ] %%% We also give the same result for a super-constant number k of "loose" linear constraints, where the right-hand side dominates the matrix entries by an Omega(log k / epsilon^2) factor.
Revised:  %DIFDELCMD < ] %%% We also give the same result for a super-constant number k of "loose" linear constraints, where the right-hand side dominates the matrix entries by an Omega(log k / epsilon^2) factor.
Edit intent: coherence
Original:  We give an O(log m / log log m)-approximation for the general problem min {lambda: x in {0,1}^N, x in B(M), Ax <= lambda b}  where m is the number of packing constraints  .
Revised:  We give an O(log m / log log m)-approximation for the general problem Min {lambda: x in {0,1}^N, x in B(M), Ax <= lambda b} where m is the number of packing constraints .
Edit intent: fluency
Original:  We give an O(log m / log log m)-approximation for the general problem min {lambda: x in {0,1}^N, x in B(M), Ax <= lambda b}  where m is the number of packing constraints  .
Revised:  We give an O(log m / log log m)-approximation for the general problem min {lambda: x in {0,1}^N, x in B(M), Ax <= lambda b} , where m is the number of packing constraints .
Edit intent: fluency
Original:  We show that Maker wins the tournament game on K_{N} with q = (1 - o(1)) \log_{2 which supports the random graph intuition: the threshold for q is asymptotically the same for the game played by two `` clever'' players and the game played by two ``random'' players.
Revised:  We show that Maker wins the tournament game on K_{N} with q = (1 - o(1)) \log_{2 which supports the random graph intuition: the threshold for q is asymptotically the same for the game played by two " clever'' players and the game played by two ``random'' players.
Edit intent: fluency
Original: We propose a realistic mechanism accounting for the existence of sub-micrometric protein domains in cell membranes.
Revised: We discuss a realistic scenario, accounting for the existence of sub-micrometric protein domains in cell membranes.
Edit intent: clarity
Original: The autocorrelation function and the run structure are two basic notions for binary sequences, and they have been used as two independent criterions to characterize the randomness of binary sequences for more than 30 years.
Revised: The autocorrelation function and the run structure are two basic notions for binary sequences, and have been used as two independent criterions to characterize the randomness of binary sequences for more than 30 years.
Edit intent: coherence
Original: The autocorrelation function and the run structure are two basic notions for binary sequences, and they have been used as two independent criterions to characterize the randomness of binary sequences for more than 30 years.
Revised: The autocorrelation function and the run structure are two basic notions for binary sequences, and they have been used as two independent postulates to test randomness of binary sequences for more than 30 years.
Edit intent: clarity
Original:  In this paper, we establish a run series expansion formula for autocorrelation function of the binary sequence and show that the autocorrelation function is in fact completely determined by the run structure.
Revised:  In this paper, we prove for binary sequence that the autocorrelation function is in fact completely determined by the run structure.
Edit intent: clarity
Original:  In this paper, we establish a run series expansion formula for autocorrelation function of the binary sequence and show that the autocorrelation function is in fact completely determined by the run structure.
Revised:  In this paper, we establish a run series expansion formula for autocorrelation function of the binary sequence and show that the autocorrelation function is in fact completely determined by its run structure.
Edit intent: clarity
Original:  Keywords: traumatic brain injury, spinal injury and musculo-skeletal injury, Euclidean jolt, coupled loading-rate hypothesis 
Revised:  Keywords: traumatic brain injury, spinal injury , musculo-skeletal injury, Euclidean jolt, coupled loading-rate hypothesis 
Edit intent: coherence
Original:  Keywords: traumatic brain injury, spinal injury and musculo-skeletal injury, Euclidean jolt, coupled loading-rate hypothesis 
Revised:  Keywords: traumatic brain injury, spinal injury and musculo-skeletal injury, coupled loading-rate hypothesis 
Edit intent: coherence
Original:  Keywords: traumatic brain injury, spinal injury and musculo-skeletal injury, Euclidean jolt, coupled loading-rate hypothesis 
Revised:  Keywords: traumatic brain injury, spinal injury and musculo-skeletal injury, Euclidean jolt, coupled loading-rate hypothesis , Euclidean jolt
Edit intent: fluency
Original: We derive probabilistic representations for the probability density function of the arbitrage price of a financial asset and the price of European call and put options in a linear stochastic volatility model with correlated Brownian noises.
Revised: In this paper we investigate general linear stochastic volatility model with correlated Brownian noises.
Edit intent: clarity
Original:  These bounds hold both for PTFs over the Boolean hypercube and for multilinear PTFs over R\R ^n under the standard n-dimensional Gaussian distribution N(0,I_n) . Our bound on the Boolean average sensitivity of PTFs represents progress towards the resolution of a conjecture of Gotsman and Linial  , which states that the symmetric function slicing the middle d layers of the Boolean hypercube has the highest average sensitivity of all degree-d PTFs.
Revised:  These bounds hold both for PTFs over the Boolean hypercube and for PTFs over\R ^n under the standard n-dimensional Gaussian distribution N(0,I_n) . Our bound on the Boolean average sensitivity of PTFs represents progress towards the resolution of a conjecture of Gotsman and Linial , which states that the symmetric function slicing the middle d layers of the Boolean hypercube has the highest average sensitivity of all degree-d PTFs.
Edit intent: clarity
Original:  These bounds hold both for PTFs over the Boolean hypercube and for multilinear PTFs over R\R ^n under the standard n-dimensional Gaussian distribution N(0,I_n) . Our bound on the Boolean average sensitivity of PTFs represents progress towards the resolution of a conjecture of Gotsman and Linial  , which states that the symmetric function slicing the middle d layers of the Boolean hypercube has the highest average sensitivity of all degree-d PTFs.
Revised:  These bounds hold both for PTFs over the Boolean hypercube and for multilinear PTFs over R\R ^n under the standard n-dimensional Gaussian distribution . Our bound on the Boolean average sensitivity of PTFs represents progress towards the resolution of a conjecture of Gotsman and Linial , which states that the symmetric function slicing the middle d layers of the Boolean hypercube has the highest average sensitivity of all degree-d PTFs.
Edit intent: clarity
Original:  Our bounds on both average and noise sensitivity of multilinear PTFs in the Gaussian setting are obtained using fairly simple arguments;
Revised:  Our bounds on both average and noise sensitivity of PTFs in the Gaussian setting are obtained using fairly simple arguments;
Edit intent: clarity
Original:  To obtain our bound on the Boolean average sensitivity of PTFs, we generalize the " critical-index " machinery of Servedio (which in that work applies to halfspaces, i.e. degree-1 PTFs) to general PTFs.
Revised:  To obtain our bound on the Boolean average sensitivity of PTFs, we generalize the `` critical-index " machinery of Servedio (which in that work applies to halfspaces, i.e. degree-1 PTFs) to general PTFs.
Edit intent: fluency
Original: We discuss  use of multivariate Granger causality in presence of redundant variables: the application of the standard analysis, in this case, leads to under-estimation of causalities.
Revised: We discuss the use of multivariate Granger causality in presence of redundant variables: the application of the standard analysis, in this case, leads to under-estimation of causalities.
Edit intent: fluency
Original:  Using the un-normalized version of the causality index, we quantitatively develop the notions of redundancy and synergy in the frame of causality and propose two approaches to reveal the informational character of a system : (i) for a given target, the remaining variables are grouped so as to maximize the total causality and (ii) the whole set of variables is partitioned to maximize the total causality between groups.
Revised:  Using the un-normalized version of the causality index, we quantitatively develop the notions of redundancy and synergy in the frame of causality and propose two approaches to group redundant variables : (i) for a given target, the remaining variables are grouped so as to maximize the total causality and (ii) the whole set of variables is partitioned to maximize the total causality between groups.
Edit intent: clarity
Original:  We also show the application on a real neurological experiment, whose goal is to show the existence of an interaction between visual and magnetic stimulations in the cortical response of migraineurs .
Revised:  We also show the application to a real neurological experiment, whose goal is to show the existence of an interaction between visual and magnetic stimulations in the cortical response of migraineurs .
Edit intent: clarity
Original: A bacteria colony may develop a small number of cells genetically identical  , but phenotypically different from the majority cells in the populations .
Revised: A bacterial colony may develop a small number of cells genetically identical , but phenotypically different from the majority cells in the populations .
Edit intent: fluency
Original: A bacteria colony may develop a small number of cells genetically identical  , but phenotypically different from the majority cells in the populations .
Revised: A bacteria colony may develop a small number of cells genetically identical , but phenotypically different from other normally growing bacteria .
Edit intent: clarity
Original:  These so-called persister cells  are insensitive to antibiotics treatment, and contribute to the serious problem of drug resistance.
Revised:  These so-called persister cells are insensitive to antibiotic treatment, resulting in serious problems of drug resistance.
Edit intent: clarity
Original:  Resonant activation (RA) is a well-studied phenomenon in thermally activated barrier crossing events, where internal noise can constructively facilitate the barrier crossing .
Revised:  Resonant activation (RA) , a well-studied phenomenon in thermally activated barrier crossing events, where internal noise can constructively facilitate the barrier crossing .
Edit intent: fluency
Original:  Resonant activation (RA) is a well-studied phenomenon in thermally activated barrier crossing events, where internal noise can constructively facilitate the barrier crossing .
Revised:  Resonant activation (RA) is a well-studied phenomenon in physics where the internal noise of a system can constructively facilitate the barrier crossing .
Edit intent: clarity
Original:  Then we used coupled single cell and population simulations to demonstrate that one can greatly reduce the time and the total amount of antibiotics needed to extinct a bacteria populationwith RA.
Revised:  Then we used coupled single cell and population simulations to demonstrate that one can greatly reduce the time and total amount of antibiotics needed to extinct a bacteria populationwith RA.
Edit intent: fluency
Original:  We also suggested that RA can find application in other situations such as cancer radiotherapy .
Revised:  We also suggested that RA can find application in other situations such as cancer therapy .
Edit intent: clarity
Original:  In arriving our result, we also present a polynomial time algorithm for computing a shortest basis of %DIFDELCMD < \homo%%% (%DIFDELCMD < \KK%%%  ) for any finite simplicial complex%DIFDELCMD < \KK %%% embedded in Euclidean space {\em   .
Revised:  In arriving our result, we also present a polynomial time algorithm for computing a shortest basis of %DIFDELCMD < \homo%%% %DIFDELCMD < \KK%%% ) for any finite simplicial complex%DIFDELCMD < \KK %%% embedded in Euclidean space {\em .
Edit intent: fluency
Original: Although widely used in practice, the behavior and accuracy of the popular module identification technique called modularity maximization is not well understood  .
Revised: Although widely used in practice, the behavior and accuracy of the popular module identification technique called modularity maximization is not well understood in practical contexts .
Edit intent: clarity
Original:  Here, we present a broad and systematic characterization of its performance in practical situations.
Revised:  Here, we present a broad characterization of its performance in practical situations.
Edit intent: clarity
Original:  Here, we present a broad and systematic characterization of its performance in practical situations.
Revised:  Here, we present a broad and systematic characterization of its performance in such situations.
Edit intent: clarity
Original:  First, we generalize and clarify the recently identified resolution limit phenomenon  .
Revised:  First, we revisit and clarify the recently identified resolution limit phenomenon .
Edit intent: clarity
Original:  First, we generalize and clarify the recently identified resolution limit phenomenon  .
Revised:  First, we generalize and clarify the resolution limit phenomenon .
Edit intent: clarity
Original:  Second, we show that the modularity function Q exhibits extreme degeneracies: that is, the modularity landscape admits an exponential number of distinct high-scoring solutions and does not typically exhibit a clear global maximum.
Revised:  Second, we show that the modularity function Q exhibits extreme degeneracies: it typically admits an exponential number of distinct high-scoring solutions and does not typically exhibit a clear global maximum.
Edit intent: clarity
Original:  Finally, using three real-world examples of metabolic networks , we show that the degenerate solutions can fundamentally disagree on the composition of even the largest modules.
Revised:  Finally, using three real-world metabolic networks as examples , we show that the degenerate solutions can fundamentally disagree on the composition of even the largest modules.
Edit intent: clarity
Original:   We conclude by discussing avenues for mitigating  these behaviors, such as combining information from many degenerate solutions or using generative models.
Revised:  We conclude by discussing avenues for mitigating some of these behaviors, such as combining information from many degenerate solutions or using generative models.
Edit intent: clarity
Original:  We calibrate the model on French  for electricity and on UK market for gas, and then simulate some trajectories which reproduce well the observed prices behavior.
Revised:  We calibrate the model on French market for electricity and on UK market for gas, and then simulate some trajectories which reproduce well the observed prices behavior.
Edit intent: fluency
Original: We investigate the partition LP formulation for Steiner trees and ] extend the technique of uncrossing, usually applied to set systems , to families of partitions.
Revised: We investigate the partition LP formulation for Steiner trees and ] extend the technique of uncrossing, usually applied to families of sets , to families of partitions.
Edit intent: clarity
Original:  Firstly, we show that basic feasible solutions to the partition LP formulation have sparse support.
Revised:  Firstly, we show that basic feasible solutions to the partition LP formulation has sparse support.
Edit intent: fluency
Original:  Then the Q-system will be a prototype way giving to the relativized calculus the possibility to put in to practice an oracle, kind of object having till now abstract nature.
Revised:  Then the QO-system will be a prototype way giving to the relativized calculus the possibility to put in to practice an oracle, kind of object having till now abstract nature.
Edit intent: clarity
Original:  The basic physical tool of our theorization, we call Quantum State Selection, consists in the twin-combined measurement process through positive valued measure operator (POVM), needed to provide the Q-oracle 's answer.
Revised:  The basic physical tool of our theorization, we call Quantum State Selection, consists in the twin-combined measurement process through positive valued measure operator (POVM), needed to provide the quantum oracle 's answer.
Edit intent: fluency
Original:  Unfortunately, the running time's dependence on the MSO formula describing the problem is in general an exponential tower of unbounded height, and there exist lower bounds proving that this cannot be improved  .
Revised:  Unfortunately, the running time's dependence on the MSO formula describing the problem is in general a tower of exponentials of unbounded height, and there exist lower bounds proving that this cannot be improved .
Edit intent: clarity
Original:  We prove that in this case the running time implied by Courcelle's theorem can be improved by a huge factor, bringing the running time down from non-elementary to doubly and singly exponential for MSO and FO logic respectively  .
Revised:  We prove that in this case the running time implied by Courcelle's theorem can be improved dramatically, from non-elementary to doubly and singly exponential for MSO and FO logic respectively .
Edit intent: clarity
Original: We consider the problem of testing if a given function f : %DIFDELCMD < \F%%% _2^n%DIFDELCMD < \to \F%%%  _2 is close to any degree d polynomial in n variables, also known as the Reed-Muller testing problem.
Revised: We consider the problem of testing if a given function f : %DIFDELCMD < \F%%% %DIFDELCMD < \to \F%%% _2 is close to any degree d polynomial in n variables, also known as the Reed-Muller testing problem.
Edit intent: clarity
Original:  \mbox{ AKKLR a natural 2^{d+1}-query test for this property  ]  and showed that it accepts every degree d polynomial with probability 1, while rejecting functions that are \Omega(1) -far with probability \Omega (1/(d 2^{d})).
Revised:  \mbox{ AKKLR a natural 2^{d+1}-query test for this property ] and showed that it accepts every degree d polynomial with probability 1, while it rejects functions that are \Omega(1) -far with probability \Omega (1/(d 2^{d})).
Edit intent: fluency