wanyu/IteraTeR_full_sent huggingface dataset:
Original:   These results highlight the urgent need for prospective trials testing whether prophylactic \alpha-blockers improve outcomes in diseases with a prominent hyperinflammatory component such as COVID-19.
Revised:  We replicated these methods on three pneumonia cohorts, all with similar effects on both outcomes. All results were robust to various sensitivity analyses. These results highlight the urgent need for prospective trials testing whether prophylactic \alpha-blockers improve outcomes in diseases with a prominent hyperinflammatory component such as COVID-19.
Edit intent: meaning-changed
Original: Consider a gambler who observes the realizations of n independent, non-negative, distribution-labeled random variables arriving in a uniform random order and can stop the sequence at any time to obtain a reward of the most recent observation. In 2017, Correa et al. showed that when all distributions are identical, it is possible to design a stopping time that achieves a \beta \approx 0.745 fraction of the maximum value (the ``prophet'' benchmark), matching an upper bound of Hill and Kertz. In 2019, Correa et al. showed that when the distributions differ, it is no longer possible to achieve this bound: they prove an upper bound of \sqrt{3 - 1 < 0.74 on the best approximation ratio.
Revised: We introduce a new decomposition technique for random variables that maps a generic instance of the prophet inequalities problem to a new instance where all but a constant number of variables have a tractable structure that we refer to as (\varepsilon, \delta)-smallness. Using this technique, we make progress on several outstanding problems in the area: - 1 < 0.74 on the best approximation ratio.
Edit intent: meaning-changed
Original:  In 2019, Correa et al. showed that when the distributions differ, it is no longer possible to achieve this bound: they prove an upper bound of \sqrt{3 - 1 < 0.74 on the best approximation ratio.
Revised:  In 2019, Correa et al. showed that when the distributions differ, it is no longer possible to achieve this bound: they prove an upper bound of \sqrt{3 - 
Edit intent: coherence
Original:  We show that  it is possible to asymptotically achieve the \beta \approx 0.745 bound even in the case of non-identical distributions, as long as we are allowed to remove a small constant number of distributions.
Revised:  We show that , even in the case of non-identical distributions, it is possible to asymptotically achieve the \beta \approx 0.745 bound even in the case of non-identical distributions, as long as we are allowed to remove a small constant number of distributions.
Edit intent: coherence
Original:  We show that  it is possible to asymptotically achieve the \beta \approx 0.745 bound even in the case of non-identical distributions, as long as we are allowed to remove a small constant number of distributions.
Revised:  We show that it is possible to achieve (arbitrarily close to) the optimal approximation ratio of \beta \approx 0.745 bound even in the case of non-identical distributions, as long as we are allowed to remove a small constant number of distributions.
Edit intent: meaning-changed
Original:  We show that  it is possible to asymptotically achieve the \beta \approx 0.745 bound even in the case of non-identical distributions, as long as we are allowed to remove a small constant number of distributions.
Revised:  We show that it is possible to asymptotically achieve the \beta \approx 0.745 as long as we are allowed to remove a small constant number of distributions.
Edit intent: clarity
Original:  Formally, we show that for any \varepsilon, there exists a constant C_{\varepsilon = poly(1/\varepsilon) (independent of n)such that after removing C_{\varepsilon} distributions of our choice, we can achieve a (\beta - \varepsilon)-approximation to the resulting maximum.
Revised:  - We show that for any \varepsilon, there exists a constant C_{\varepsilon = poly(1/\varepsilon) (independent of n)such that after removing C_{\varepsilon} distributions of our choice, we can achieve a (\beta - \varepsilon)-approximation to the resulting maximum.
Edit intent: coherence
Original:  Formally, we show that for any \varepsilon, there exists a constant C_{\varepsilon = poly(1/\varepsilon) (independent of n)such that after removing C_{\varepsilon} distributions of our choice, we can achieve a (\beta - \varepsilon)-approximation to the resulting maximum.
Revised:  Formally, we show that for = poly(1/\varepsilon) (independent of n)such that after removing C_{\varepsilon} distributions of our choice, we can achieve a (\beta - \varepsilon)-approximation to the resulting maximum.
Edit intent: clarity
Original:  We additionally show }  it is possible to asymptotically achieve an exact \beta approximation ratio for several natural classes of problem instances, including small prophets (where each distribution is concentrated near zero) and frequent prophets (where each distribution occurs at least some number of times) .
Revised:  We additionally show } frequent instances of prophet inequalities (where each distribution reoccurs some number of times), it is possible to asymptotically achieve an exact \beta approximation ratio for several natural classes of problem instances, including small prophets (where each distribution is concentrated near zero) and frequent prophets (where each distribution occurs at least some number of times) .
Edit intent: meaning-changed
Original:  We additionally show }  it is possible to asymptotically achieve an exact \beta approximation ratio for several natural classes of problem instances, including small prophets (where each distribution is concentrated near zero) and frequent prophets (where each distribution occurs at least some number of times) .
Revised:  We additionally show } it is possible to achieve the optimal approximation ratio of \beta (improving over the previous best-known bound of 0.738). - We give a new, simpler proof of Kertz's optimal approximation guarantee of \beta \approx 0.745 for prophet inequalities with i.i.d. distributions. The proof is primal-dual and simultaneously produces upper and lower bounds. - Using this decomposition in combination with a novel convex programming formulation, we construct the first Efficient PTAS for the Optimal Ordering problem .
Edit intent: meaning-changed
Original:  However, large-scale evaluation of the public's response to social distancing campaigns has been lacking. We used anonymized and aggregated mobility data from Google Location History usersto estimate the impact of social distancing recommendations on bulk mobility among users who have opted into this service.
Revised:  However, the impacts of specific state-level policies on mobility and subsequent COVID-19 case trajectories have not been completely quantified. Using anonymized and aggregated mobility data from Google Location History usersto estimate the impact of social distancing recommendations on bulk mobility among users who have opted into this service.
Edit intent: meaning-changed
Original:  We used anonymized and aggregated mobility data from Google Location History usersto estimate the impact of social distancing recommendations on bulk mobility among users who have opted into this service. We found that state-of-emergency declarations resulted in approximately a 10 \% reduction in time spent away from places of residence.
Revised:  We used anonymized and aggregated mobility data from opted-in Google users, we found that state-level emergency declarations resulted in approximately a 10 \% reduction in time spent away from places of residence.
Edit intent: clarity
Original:  Implementation of one or more social distancing policies resulted in an additional 25 \% reduction in mobility the following week . Subsequent shelter-in-place mandates provided an additional 29 \% reduction.
Revised:  Implementation of one or more social distancing policies resulted in an additional 25 \% reduction in mobility the following week , and subsequent shelter-in-place mandates provided an additional 29 \% reduction.
Edit intent: coherence
Original:  Our findings provide evidence that state-wide mandates are effective in promoting social distancing within this study group .
Revised:  Decreases in mobility were associated with substantial reductions in case growth 2 to 4 weeks later. For example, a 10\% reduction in mobility was associated with a 17.5\% reduction in case growth 2 weeks later. Given the continued reliance on social distancing policies to limit the spread of COVID-19, these results may be helpful to public health officials trying to balance infection control with the economic and social consequences of these policies .
Edit intent: meaning-changed
Original:  This algorithm, LinearDesign, can compute the approximate minimum free energy mRNA sequence for this spike protein in just 16 minutes using beam size b = 1, 000, with only 0.6\% loss in free energy change compared to exact search (i.e., b =  infinity, which costs 1.6 hours ).
Revised:  This algorithm, LinearDesign, can compute the approximate minimum free energy mRNA sequence for this spike protein in just 11 minutes using beam size b = 1, 000, with only 0.6\% loss in free energy change compared to exact search (i.e., b = infinity, which costs 1.6 hours ).
Edit intent: meaning-changed
Original:  This algorithm, LinearDesign, can compute the approximate minimum free energy mRNA sequence for this spike protein in just 16 minutes using beam size b = 1, 000, with only 0.6\% loss in free energy change compared to exact search (i.e., b =  infinity, which costs 1.6 hours ).
Revised:  This algorithm, LinearDesign, can compute the approximate minimum free energy mRNA sequence for this spike protein in just 16 minutes using beam size b = 1, 000, with only 0.6\% loss in free energy change compared to exact search (i.e., b = + infinity, which costs 1.6 hours ).
Edit intent: fluency
Original:  This algorithm, LinearDesign, can compute the approximate minimum free energy mRNA sequence for this spike protein in just 16 minutes using beam size b = 1, 000, with only 0.6\% loss in free energy change compared to exact search (i.e., b =  infinity, which costs 1.6 hours ).
Revised:  This algorithm, LinearDesign, can compute the approximate minimum free energy mRNA sequence for this spike protein in just 16 minutes using beam size b = 1, 000, with only 0.6\% loss in free energy change compared to exact search (i.e., b = infinity, which costs 1 hour ).
Edit intent: clarity
Original:  As trading strategy, we use Krauss et al. (2017) and Fischer & Krauss (2018) as benchmark and, on each trading day,  buy the 10 stocks with the highest probability and sell short the 10 stocks with the lowest probability to outperform the market in terms of intraday returns -- all with equal monetary weight.
Revised:  As trading strategy, we use Krauss et al. (2017) and Fischer & Krauss (2018) as benchmark . On each trading day, buy the 10 stocks with the highest probability and sell short the 10 stocks with the lowest probability to outperform the market in terms of intraday returns -- all with equal monetary weight.
Edit intent: coherence
Original:  As trading strategy, we use Krauss et al. (2017) and Fischer & Krauss (2018) as benchmark and, on each trading day,  buy the 10 stocks with the highest probability and sell short the 10 stocks with the lowest probability to outperform the market in terms of intraday returns -- all with equal monetary weight.
Revised:  As trading strategy, we use Krauss et al. (2017) and Fischer & Krauss (2018) as benchmark and, on each trading day, we buy the 10 stocks with the highest probability and sell short the 10 stocks with the lowest probability to outperform the market in terms of intraday returns -- all with equal monetary weight.
Edit intent: fluency
Original:  In this paper, we attempt to shed light on the term's real-world usage on Twitter. Using sentiment feature analysis and topic modeling, we reveal substantial differences between the use of the controversial terms such as "Chinese virus " and that of the non-controversial terms such as "COVID-19" . For example, tweets using controversial terms contain a higher percentage of anger as well as negative emotions.
Revised:  In this paper, we attempt to shed light on the term's real-world usage is lacking to shed light on the issues behind the controversy. In this paper, we attempt to fill this gap. To model the substantive difference of tweets with controversial terms and those with non-controversial terms, we apply topic modeling and LIWC-based sentiment analysis. To test whether "Chinese virus " and that of the non-controversial terms such as "COVID-19" . For example, tweets using controversial terms contain a higher percentage of anger as well as negative emotions.
Edit intent: meaning-changed
Original:  Using sentiment feature analysis and topic modeling, we reveal substantial differences between the use of the controversial terms such as "Chinese virus " and that of the non-controversial terms such as "COVID-19" . For example, tweets using controversial terms contain a higher percentage of anger as well as negative emotions.
Revised:  Using sentiment feature analysis and topic modeling, we reveal substantial differences between the use of the controversial terms such as "Chinese Virus " and that of the non-controversial terms such as "COVID-19" . For example, tweets using controversial terms contain a higher percentage of anger as well as negative emotions.
Edit intent: fluency
Original:  Using sentiment feature analysis and topic modeling, we reveal substantial differences between the use of the controversial terms such as "Chinese virus " and that of the non-controversial terms such as "COVID-19" . For example, tweets using controversial terms contain a higher percentage of anger as well as negative emotions.
Revised:  Using sentiment feature analysis and topic modeling, we reveal substantial differences between the use of the controversial terms such as "Chinese virus " and "COVID-19" . For example, tweets using controversial terms contain a higher percentage of anger as well as negative emotions.
Edit intent: clarity
Original:  Using sentiment feature analysis and topic modeling, we reveal substantial differences between the use of the controversial terms such as "Chinese virus " and that of the non-controversial terms such as "COVID-19" . For example, tweets using controversial terms contain a higher percentage of anger as well as negative emotions. They also point to China more frequently. Our results suggest that while the term "Chinese virus " could be interpreted either as neutral or racist, its usage on social media leans strongly towards the latter .
Revised:  Using sentiment feature analysis and topic modeling, we reveal substantial differences between the use of the controversial terms such as "Chinese virus " and that of the non-controversial terms such as "COVID-19" are interchangeable, we formulate it as a classification task, mask out these terms, and classify them using the state-of-the-art transformer models. Our experiments consistently show that the term "Chinese virus " could be interpreted either as neutral or racist, its usage on social media leans strongly towards the latter .
Edit intent: meaning-changed
Original:  Our results indicate that these small drug molecules selectively bind to kinetically active and residues adjoining them on the surface  and inside protein  , and that some prefer hydrophobic over other active sites.
Revised:  Our results indicate that these small drug molecules selectively bind to stable, kinetically active residues and residues adjoining them on the surface and inside protein , and that some prefer hydrophobic over other active sites.
Edit intent: meaning-changed
Original:  The drugs studied include Chloroquine, Ivermectin, Remdesivir and alpha-difluoromethylornithine } (DMFO).
Revised:  The drugs studied include Chloroquine, Ivermectin, Remdesivir and alpha-difluoromethylornithine }-difluoromethylornithine (DMFO).
Edit intent: meaning-changed
Original:  Our results indicate that these small drug molecules selectively bind to stable, kinetically active residues and residues adjoining them on the surface of proteins and inside protein pockets , and that some prefer hydrophobic over other active sites.
Revised:  Our results indicate that these small molecules selectively bind to stable, kinetically active residues and residues adjoining them on the surface of proteins and inside protein pockets , and that some prefer hydrophobic over other active sites.
Edit intent: clarity
Original:  Our results indicate that these small drug molecules selectively bind to stable, kinetically active residues and residues adjoining them on the surface of proteins and inside protein pockets , and that some prefer hydrophobic over other active sites.
Revised:  Our results indicate that these small drug molecules selectively bind to stable, kinetically active residues and residues adjoining them on the surface of proteins and inside protein pockets and that some prefer hydrophobic over other active sites.
Edit intent: fluency
Original:  Conclusion: Light scattering changes produced by osmotic swelling, which have previously been characterized in squid and crab nerve, are also thought to occur in myelinated fibres on a scale which is detectable using OCT .
Revised:  Conclusion: Light scattering changes produced by osmotic swelling, which have previously been characterised in squid and crab nerve, are also thought to occur in myelinated fibres on a scale which is detectable using OCT .
Edit intent: clarity
Original:  Conclusion: Light scattering changes produced by osmotic swelling, which have previously been characterized in squid and crab nerve, are also thought to occur in myelinated fibres on a scale which is detectable using OCT .
Revised:  Conclusion: Light scattering changes produced by osmotic swelling, which have previously been characterized in squid and crab nerve, are also thought to occur in myelinated fibres on a scale which is detectable using OCT 
Edit intent: fluency
Original: We study two canonical online optimization problems under capacity/budget constraints , the fractional one-way trading problem (OTP) and the integral online knapsack problem (OKP) with an infinitesimal assumption.
Revised: We study two canonical online optimization problems under capacity/budget constraints : the fractional one-way trading problem (OTP) and the integral online knapsack problem (OKP) with an infinitesimal assumption.
Edit intent: fluency
Original: We study two canonical online optimization problems under capacity/budget constraints , the fractional one-way trading problem (OTP) and the integral online knapsack problem (OKP) with an infinitesimal assumption.
Revised: We study two canonical online optimization problems under capacity/budget constraints , the fractional one-way trading problem (OTP) and the integral online knapsack problem (OKP) under an infinitesimal assumption.
Edit intent: coherence
Original:   Our model of city-level transmission of an infectious agent (SEIR model) characterises spread via a (a) scale-free contact network (no control);
Revised:  Contact between individuals in the community is characterised by a contact graph, the structure of that contact graph is selected to mimic community control measures. Our model of city-level transmission of an infectious agent (SEIR model) characterises spread via a (a) scale-free contact network (no control);
Edit intent: meaning-changed
Original:  This model exhibits good  agreement between simulation and data from the 2020 pandemic spread of COVID-19. Also, estimates of the relevant rate parameters of the SEIR model are obtained and we demonstrate the robustness of our model predictions under uncertainty of those estimates.
Revised:  This model exhibits good agreement between simulation and data from the 2020 pandemic spread of coronavirus. Estimates of the relevant rate parameters of the SEIR model are obtained and we demonstrate the robustness of our model predictions under uncertainty of those estimates.
Edit intent: clarity
Original:  Our results suggest that the digital contagion of emotions, in particular the anger, should be comprehensively considered in profiling the online information spread. Cures like tagging anger in social media could be inspired to slowdown or prevent the contagion of fake news at the very beginning .
Revised:  Our results suggest that the digital contagion of emotions, in particular the anger, should be comprehensively considered in profiling the spread of online information. Cures such as tagging anger in social media could be inspired to slowdown or prevent the contagion of fake news at the very beginning .
Edit intent: fluency
Original:   Offline questionnaires reveal that anger leads to more incentivized audiences in terms of anxiety management and information sharing and accordingly makes fake news more contagious than real news online .
Revised:  The same results in Twitter and Weibo indicate that this mechanism is independent of the platform. Moreover, mutations in emotions like increasing anger will progressively speed up the information spread. Specifically, increasing the occupation of anger by 0.1 and reducing that of joy by 0.1 will produce nearly 6 more retweets in the Weibo dataset. Offline questionnaires reveal that anger leads to more incentivized audiences in terms of anxiety management and information sharing and accordingly makes fake news more contagious than real news online .
Edit intent: meaning-changed
Original:   Offline questionnaires reveal that anger leads to more incentivized audiences in terms of anxiety management and information sharing and accordingly makes fake news more contagious than real news online . Our results suggest that the digital contagion of emotions, in particular anger, should be comprehensively considered in profiling the spread of online information . Cures such as tagging anger in social media could be implemented to slow or prevent the contagion of fake news at the source.
Revised:  Offline questionnaires reveal that anger leads to more incentivized audiences in terms of anxiety management and information sharing and accordingly makes fake news more contagious than real news online . Cures such as tagging anger in social media could be implemented to slow or prevent the contagion of fake news at the source.
Edit intent: coherence
Original: We analyze some widespread models of population dynamics (logistic , \theta-logistic , and Gompertz model). In the first part of the article we discuss the deterministic versions of these models .
Revised: We analyze some widespread models of population dynamics (logistic , \theta-logistic stochastic differential equations, along with the exact expressions of both their probability density functions and their moments. We simulate in addition a few typical sample trajectories, and we provide a few examples of numerical computation of the said closed formulas at different noise intensities: this shows in particular that an increasing randomness - while making the process more unpredictable - asymptotically tends to suppress in average the logistic growth. These main results are preceded by a discussion of the noiseless, deterministic versions of these models .
Edit intent: meaning-changed
Original:  In the first part of the article we discuss the deterministic versions of these models . The discussion is also instrumental , on the basis of some very simplified , but working, hypotheses , to frame the logistic and \theta-logistic equations in an unified context, within which also the Gompertz model emerges from  anomalous scaling.
Revised:  In the first part of the article we discuss the deterministic versions of these models : a prologue which turns out to be instrumental - on the basis of some very simplified , but working, hypotheses , to frame the logistic and \theta-logistic equations in an unified context, within which also the Gompertz model emerges from anomalous scaling.
Edit intent: meaning-changed