wanyu/IteraTeR_v2 huggingface dataset:
Original:  we demonstrate how to apply Bayesian optimization with longitudinal case data to estimate the transmission rate of infectious individuals at  sites they visit and in their households , as well as the mobility reduction due to social distancing . Simulations using fine-grained  demographic data and site locations from several cities and regions demonstrate that our framework faithfully characterizes the observed longitudinal trend of COVID-19 cases.
Revised:  we demonstrate how to apply Bayesian optimization with longitudinal case data to estimate the transmission rate of infectious individuals at the sites they visit and in their households , as well as the mobility reduction due to social distancing . Simulations using fine-grained demographic data and site locations from several cities and regions demonstrate that our framework faithfully characterizes the observed longitudinal trend of COVID-19 cases.
Edit intent: fluency
Original:  we demonstrate how to apply Bayesian optimization with longitudinal case data to estimate the transmission rate of infectious individuals at  sites they visit and in their households , as well as the mobility reduction due to social distancing . Simulations using fine-grained  demographic data and site locations from several cities and regions demonstrate that our framework faithfully characterizes the observed longitudinal trend of COVID-19 cases.
Revised:  we demonstrate how to apply Bayesian optimization with longitudinal case data to estimate the transmission rate of infectious individuals at sites they visit and in their households . Simulations using fine-grained demographic data and site locations from several cities and regions demonstrate that our framework faithfully characterizes the observed longitudinal trend of COVID-19 cases.
Edit intent: clarity
Original:  Traditional drug development involve time consuming pipelines that conflict with the urgence of identifying effective therapies during a health and economic emergency.
Revised:  Traditional drug development involves time consuming pipelines that conflict with the urgence of identifying effective therapies during a health and economic emergency.
Edit intent: fluency
Original:  Links are ubiquitous in the sciences, and their normal or typical behavior is of significant importance in understanding situations such as the topological state of DNA or the statistical mechanics of ring polymers.
Revised:  Links are ubiquitous in the sciences, and their "normal" or "typical" behavior is of significant importance in understanding situations such as the topological state of DNA or the statistical mechanics of ring polymers.
Edit intent: fluency
Original: With a two-layer contact-dispersion model and data in China, we analyze the cost-effectiveness of three types of antiepidemic measures for COVID-19: regular epidemiological control, local social interaction control, and intercity travel restriction.
Revised: With a two-layer contact-dispersion model and data in China, we analyze the cost-effectiveness of three types of antiepidemic measures for COVID-19: regular epidemiological control, local social interaction control, and inter-city travel restriction.
Edit intent: fluency
Original:   Our first main result is an algorithm that computes all identifiable functions without any additional assumptions  .
Revised:  However, this solvability condition is not always satisfied, which presents a challenge. Our first main result is an algorithm that computes all identifiable functions without any additional assumptions .
Edit intent: coherence
Original:  For this problem, we show that the set of functions identifiable from multiple experiments is what would actually be computed by input-output equation-based algorithms if the solvability condition is not fulfilled .
Revised:  For this problem, we prove that the set of functions identifiable from multiple experiments is what would actually be computed by input-output equation-based algorithms if the solvability condition is not fulfilled .
Edit intent: coherence
Original:  For this problem, we show that the set of functions identifiable from multiple experiments is what would actually be computed by input-output equation-based algorithms if the solvability condition is not fulfilled .
Revised:  For this problem, we show that the set of functions identifiable from multiple experiments is what would actually be computed by input-output equation-based algorithms (whether or not the solvability condition is not fulfilled .
Edit intent: clarity
Original:  We first extend two algorithmic fractal dimensions--computability-theoretic versions of classical Hausdorff and packing dimensions that assign dimensions \dim(x) and Dim (x) to individual points x\in X--to arbitrary separable metric spaces and to arbitrary gauge families.
Revised:  We first extend two fractal dimensions--computability-theoretic versions of classical Hausdorff and packing dimensions that assign dimensions \dim(x) and Dim (x) to individual points x\in X--to arbitrary separable metric spaces and to arbitrary gauge families.
Edit intent: clarity
Original:  We then extend the point-to-set principle of J. Lutz and N. Lutz (2018) to arbitrary separable metric spaces and to a large class of gauge families.
Revised:  We then extend the point-to-set principle to arbitrary separable metric spaces and to a large class of gauge families.
Edit intent: coherence
Original:  These are classical questions whose statements do not involve computation or related aspects of logic.
Revised:  These are classical questions , meaning that their statements do not involve computation or related aspects of logic.
Edit intent: coherence
Original:  We first extend two fractal dimensions--computability-theoretic versions of classical Hausdorff and packing dimensions that assign dimensions \dim(x) and \mathrm{Dim (x) to individual points x\in X--to arbitrary separable metric spaces and to arbitrary gauge families.
Revised:  We first extend two fractal dimensions--computability-theoretic versions of classical Hausdorff and packing dimensions that assign dimensions \dim(x) and Dim (x) to individual points x\in X--to arbitrary separable metric spaces and to arbitrary gauge families.
Edit intent: coherence
Original:  Our third main result, proven via our extended point-to-set principle, states that, under a wide variety of gauge functions , the classical packing dimension agrees with the classical upper Minkowski dimension on all hyperspaces of compact sets.
Revised:  Our third main result, proven via our extended point-to-set principle, states that, under a wide variety of gauge families , the classical packing dimension agrees with the classical upper Minkowski dimension on all hyperspaces of compact sets.
Edit intent: clarity
Original: In customer support centers, a successful service interaction involves a  dialogue between a customer and an agent.
Revised: In customer contact centers, a successful service interaction involves a dialogue between a customer and an agent.
Edit intent: clarity
Original: In customer support centers, a successful service interaction involves a  dialogue between a customer and an agent.
Revised: In customer support centers, a successful service interaction involves a dialogue between a customer and agent.
Edit intent: fluency
Original:  Both parties depend on one another for information and problem solving , and this interaction defines a co-produced service process .
Revised:  Both parties depend on one another for information and problem solving .
Edit intent: clarity
Original:  In this paper, we propose, develop, and compare new stochastic models for the co-production of service in a contact center.
Revised:  In this paper, we propose, develop, and compare new stochastic models for service co-production of service in a contact center.
Edit intent: fluency
Original:  In this paper, we propose, develop, and compare new stochastic models for the co-production of service in a contact center.
Revised:  In this paper, we propose, develop, and compare new stochastic models for the co-production in a contact center.
Edit intent: clarity
Original: We study the Stokes problem over convex , polyhedral domains on weighted Sobolev spaces.
Revised: We study the Stokes problem over convex polyhedral domains on weighted Sobolev spaces.
Edit intent: fluency
Original:  The weight is assumed to belong to the Muckenhoupt class A_q , for q \in (1,\infty).
Revised:  The weight is assumed to belong to the Muckenhoupt class A_q for q \in (1,\infty).
Edit intent: fluency
Original:  We show that this problem is well--posed for all q. In addition, we show that the finite element Stokes projection is stable on weighted spaces.
Revised:  We show that the Stokes problem is well-posed for all q. In addition, we show that the finite element Stokes projection is stable on weighted spaces.
Edit intent: clarity
Original:  With the aid of these tools, we provide well--posedness and approximation results to some classes of non--Newtonian fluids.
Revised:  With the aid of these tools, we provide well-posedness and approximation results to some classes of non--Newtonian fluids.
Edit intent: fluency
Original:  With the aid of these tools, we provide well--posedness and approximation results to some classes of non--Newtonian fluids.
Revised:  With the aid of these tools, we provide well--posedness and approximation results to some classes of non-Newtonian fluids.
Edit intent: fluency
Original: We address the Multi-Agent Path Finding problem on a graph for agents assigned to goals in a known environment and under uncertainty .
Revised: We present an algorithm for finding optimal paths for multiple stochastic agents in a graph to reach their destinations with a user-specified maximum pairwise collision probability .
Edit intent: clarity
Original:  We model robot travel time along each edge of the graph by independent gamma-distributed random variables  and propose probabilistic conflict identification and constraint creation methods to robustly handle travel time uncertainty.
Revised:  We model robot travel time along each edge of the graph by independent gamma-distributed random variables , and propose probabilistic conflict identification and constraint creation methods to robustly handle travel time uncertainty.
Edit intent: fluency
Original:  We model robot travel time along each edge of the graph by independent gamma-distributed random variables  and propose probabilistic conflict identification and constraint creation methods to robustly handle travel time uncertainty.
Revised:  We model robot travel time along each edge of the graph by independent gamma-distributed random variables and propose probabilistic collision identification and constraint creation methods to robustly handle travel time uncertainty.
Edit intent: fluency
Original:  We show that under reasonable assumptions our algorithm is complete and optimal in terms of expected sum of travel times, while ensuring an upper bound on each pairwise conflict probability.
Revised:  We show that under reasonable assumptions our algorithm is optimal in terms of expected sum of travel times, while ensuring an upper bound on each pairwise conflict probability.
Edit intent: clarity
Original:  In this paper, we fill the long-standing gap in the field of the verification of continuous-time systems by proposing a linear-time temporal logic, named continuous linear logic (CLL) and the corresponding model checking algorithm for continuous-time Markov chains .
Revised:  In this paper, we propose a probabilistic linear-time temporal logic, named continuous linear logic (CLL) and the corresponding model checking algorithm for continuous-time Markov chains .
Edit intent: clarity
Original:  In this paper, we fill the long-standing gap in the field of the verification of continuous-time systems by proposing a linear-time temporal logic, named continuous linear logic (CLL) and the corresponding model checking algorithm for continuous-time Markov chains .
Revised:  In this paper, we fill the long-standing gap in the field of the verification of continuous-time systems by proposing a linear-time temporal logic, namely continuous-time linear logic (CLL) and the corresponding model checking algorithm for continuous-time Markov chains .
Edit intent: clarity
Original:  The correctness of our model checking algorithm depends on Schanuel's conjecture, a central open question in transcendental number theory.
Revised:  The correctness of the model-checking algorithm depends on Schanuel's conjecture, a central open question in transcendental number theory.
Edit intent: fluency
Original:  The correctness of our model checking algorithm depends on Schanuel's conjecture, a central open question in transcendental number theory.
Revised:  The correctness of our model checking algorithm depends on Schanuel's conjecture, a central open problem in transcendental number theory.
Edit intent: clarity
Original:  This trend was confirmed when the channel load aware mechanism was tested in a real deployment, and STAs were associated to the indicated AP/Extender  .
Revised:  This trend was confirmed when the channel load aware mechanism was tested in a real deployment, where STAs were associated to the indicated AP/Extender .
Edit intent: clarity
Original: Among the critical challenges around the COVID-19 pandemic is dealing with  potentially detrimental effects on people's mental health.
Revised: Among the critical challenges around the COVID-19 pandemic is dealing with the potentially detrimental effects on people's mental health.
Edit intent: fluency
Original:  Our findings suggest that i) shorter texts do not offer an as adequate insight into psychological processes as longer texts.
Revised:  Our findings suggest that i) short texts do not offer an as adequate insight into psychological processes as longer texts.
Edit intent: fluency
Original:  Our findings suggest that i) shorter texts do not offer an as adequate insight into psychological processes as longer texts.
Revised:  Our findings suggest that i) shorter texts do not offer as adequate insights into psychological processes as longer texts.
Edit intent: fluency
Original:  The findings align with general gender differences in language found elsewhere, but the current unique circumstances likely amplified these effects.
Revised:  This paper adds to the understanding of general gender differences in language found elsewhere, but the current unique circumstances likely amplified these effects.
Edit intent: clarity
Original:  The findings align with general gender differences in language found elsewhere, but the current unique circumstances likely amplified these effects.
Revised:  The findings align with general gender differences in language found elsewhere, and shows that the current unique circumstances likely amplified these effects.
Edit intent: coherence
Original: We consider the control of the COVID-19 pandemic , modeled by a standard SIR compartmental model.
Revised: We consider the control of the COVID-19 pandemic through a standard SIR compartmental model.
Edit intent: clarity
Original:  If each individual lowers his/her contact rate, the epidemic vanishes faster  but the effort cost may be high.
Revised:  If each individual lowers his/her contact rate, the epidemic vanishes faster , but the effort cost may be high.
Edit intent: fluency
Original:  The equilibrium selects a sub-optimal solution in comparison to the societal optimum (a centralized decision respected fully by all individuals), meaning that the cost of anarchy is strictly positive.
Revised:  However, this equilibrium selects a sub-optimal solution in comparison to the societal optimum (a centralized decision respected fully by all individuals), meaning that the cost of anarchy is strictly positive.
Edit intent: coherence
Original:  In this study we envisaged to answer these questions in a scientific manner taking into consideration five well known Bengali recitations of different poets conveying a variety of moods ranging from joy to sorrow.
Revised:  In this study we envisaged to answer these questions in a scientific manner taking into consideration 5 (five) well known Bengali recitations of different poets conveying a variety of moods ranging from joy to sorrow.
Edit intent: clarity
Original: In this research  we have empirically investigated the key drivers affecting liquidity in equity markets.
Revised: In this research , we have empirically investigated the key drivers affecting liquidity in equity markets.
Edit intent: fluency
Original:  On the theoretical side, we investigate the complexity of deciding whether a certain consequence has a proof of size at most n along the following orthogonal dimensions: (i) ~ the underlying proof system is polynomial or exponential;
Revised:  On the theoretical side, we investigate the complexity of deciding whether a certain consequence has a proof of size at most n along the following orthogonal dimensions: (i) the underlying proof system is polynomial or exponential;
Edit intent: fluency
Original:  (ii) ~ proofs may or may not reuse already derived consequences;
Revised:  (ii) proofs may or may not reuse already derived consequences;
Edit intent: fluency
Original:  and (iii) ~ the number n is represented in unary or binary.
Revised:  and (iii) the number n is represented in unary or binary.
Edit intent: fluency
Original:  An equilibrated a posteriori error estimator for arbitrary-order N\'ed\'elec elements for magnetostatic problems. arXiv preprint, arXiv:1909.01853 math.
Revised:  An equilibrated a posteriori error estimator for arbitrary-order N\'ed\'elec elements for magnetostatic problems. math.
Edit intent: clarity
Original:  In addition, we show that a variant of the problem with bottleneck objectives can be solved in polynomial time on general directed graphs.
Edit intent: coherence
Original:  It promises to drastically speed-up many chemical, financial, cryptographical, or machine-learning applications.
Revised:  It promises to dramatically speed-up many chemical, financial, cryptographical, or machine-learning applications.
Edit intent: fluency
Original:  It promises to drastically speed-up many chemical, financial, cryptographical, or machine-learning applications.
Revised:  It promises to drastically speed-up many chemical, financial, and machine-learning applications.
Edit intent: clarity
Original:  However, most existing methods are inspired by equivalence checking in the classical realm and have merely been extended to support quantum circuits (  which do not only rely on 0's and 1's, but also employ superposition and entanglement).
Revised:  However, most existing methods are inspired by the classical realm and have merely been extended to support quantum circuits ( which do not only rely on 0's and 1's, but also employ superposition and entanglement).
Edit intent: coherence
Original:  However, most existing methods are inspired by equivalence checking in the classical realm and have merely been extended to support quantum circuits (  which do not only rely on 0's and 1's, but also employ superposition and entanglement).
Revised:  However, most existing methods are inspired by equivalence checking in the classical realm and have merely been extended to support quantum circuits ( i.e., circuits which do not only rely on 0's and 1's, but also employ superposition and entanglement).
Edit intent: coherence
Original:  In this work, we propose an advanced methodology which takes the different paradigms of quantum circuits not  as a burden, but as a chance .
Revised:  In this work, we propose an advanced methodology which takes the different paradigms of quantum circuits not only as a burden, but as a chance .
Edit intent: coherence
Original:  In this work, we propose an advanced methodology which takes the different paradigms of quantum circuits not  as a burden, but as a chance .
Revised:  In this work, we propose an advanced methodology which takes the different paradigms of quantum circuits not as a burden, but as an opportunity .
Edit intent: clarity
Original:  Moreover, we unveil that, in contrast to the classical realm, simulation is very powerful in verifying quantum circuits.
Revised:  Moreover, we show that, in contrast to the classical realm, simulation is very powerful in verifying quantum circuits.
Edit intent: clarity
Original:  Experimental evaluations confirm that the resulting methodology allows  to conduct equivalence checking drastically faster than ever before -- in many cases just a single simulation run is sufficient.
Revised:  Experimental evaluations confirm that the resulting methodology allows one to conduct equivalence checking drastically faster than ever before -- in many cases just a single simulation run is sufficient.
Edit intent: clarity
Original:  Experimental evaluations confirm that the resulting methodology allows  to conduct equivalence checking drastically faster than ever before -- in many cases just a single simulation run is sufficient.
Revised:  Experimental evaluations confirm that the resulting methodology allows to conduct equivalence checking dramatically faster than ever before -- in many cases just a single simulation run is sufficient.
Edit intent: fluency
Original:  Experimental evaluations confirm that the resulting methodology allows  to conduct equivalence checking drastically faster than ever before -- in many cases just a single simulation run is sufficient.
Revised:  Experimental evaluations confirm that the resulting methodology allows to conduct equivalence checking drastically faster than ever before--in many cases just a single simulation run is sufficient.
Edit intent: fluency
Original:  The  amortized update time  of both algorithms can be made worst-case by paying some sub-polynomial factors.
Revised:  The amortized update time . The amortized update time of both algorithms can be made worst-case by paying some sub-polynomial factors.
Edit intent: clarity
Original:  First of all, we show a generic black-box reduction that allows us to assume that the graph undergoes only edge deletions and, more importantly, remains an expander with almost-uniform degree.
Revised:  The first technique, is a generic black-box reduction that allows us to assume that the graph undergoes only edge deletions and, more importantly, remains an expander with almost-uniform degree.
Edit intent: clarity
Original:  The second is a new technique called proactive resampling.
Revised:  The second technique we call proactive resampling.
Edit intent: clarity
Original:  [ Abstract was shortened ]
Revised:  [ ... ]
Edit intent: coherence
Original: Approximate nearest neighbor search (ANNS) is a long-studied problem in computational geometry  that has received considerable attentions by researchers in the community.
Revised: Approximate near-neighbors search (ANNS) is a long-studied problem in computational geometry that has received considerable attentions by researchers in the community.
Edit intent: fluency
Original: Approximate nearest neighbor search (ANNS) is a long-studied problem in computational geometry  that has received considerable attentions by researchers in the community.
Revised: Approximate nearest neighbor search (ANNS) is a long-studied problem in computational geometry that has received considerable attention by researchers in the community.
Edit intent: fluency
Original:  In  case that k is known in the preprocessing stage \eps we propose a fully deterministic data structure whose space is O(n ( 32d\big(\big\{\big(}{\eps}}\big)
Revised:  In case that k is known in the preprocessing stage \eps we propose a fully deterministic data structure whose space is 32d\big(\big\{\big(}{\eps}}\big)
Edit intent: clarity
Original:  We also \eps show that our data structure could give an alternative treatment of the approximate subtrajectory range counting (\textsc{ASRC ) problem studied by de Berg et al.
Revised:  We also \eps. We show that our data structure could give an alternative treatment of the approximate subtrajectory range counting (\textsc{ASRC ) problem studied by de Berg et al.
Edit intent: coherence