wanyu/IteraTeR_full_sent huggingface dataset:
Original:  The analyses will be updated bi-weekly to th  dynamically assess the short- and medium-term effects of these interventions to shed light on how crime adapts to such structural modification of the environment.
Revised:  The analyses will be updated bi-weekly to and up to March 28th dynamically assess the short- and medium-term effects of these interventions to shed light on how crime adapts to such structural modification of the environment.
Edit intent: meaning-changed
Original:  The analyses will be updated bi-weekly to th  dynamically assess the short- and medium-term effects of these interventions to shed light on how crime adapts to such structural modification of the environment.
Revised:  The analyses will be updated bi-weekly to th 2020) to dynamically assess the short- and medium-term effects of these interventions to shed light on how crime adapts to such structural modification of the environment.
Edit intent: meaning-changed
Original: Do people discriminate between men and women when they are in charge of punishing defectors or rewarding cooperators? Answering this question has potentially far-reaching implications on gender equity, since cooperative behaviour forms the basis of our societies and is typically enforced through punishment or rewarding. In this paper we report on two pre-registered experiments, that we hope shed some light on this question.
Revised: Do people discriminate between men and women when they have the option to punish defectors or reward cooperators? Here we report on two pre-registered experiments, that we hope shed some light on this question.
Edit intent: clarity
Original:  Study 1 (N= 1,077 ) shows that people do not discriminate between genders when they are in charge of punishing (rewarding ) defectors (cooperators) in a one-shot public goods game.
Revised:  Study 1 (N= 544 ) shows that people do not discriminate between genders when they are in charge of punishing (rewarding ) defectors (cooperators) in a one-shot public goods game.
Edit intent: meaning-changed
Original:  Study 1 (N= 1,077 ) shows that people do not discriminate between genders when they are in charge of punishing (rewarding ) defectors (cooperators) in a one-shot public goods game.
Revised:  Study 1 (N= 1,077 ) shows that people do not discriminate between genders when they have the option to punish (reward ) defectors (cooperators) in a one-shot public goods game.
Edit intent: clarity
Original:  Study 1 (N= 1,077 ) shows that people do not discriminate between genders when they are in charge of punishing (rewarding ) defectors (cooperators) in a one-shot public goods game. In this study, punishment/reward is implemented by asking participants whether they want to pay a cost to decrease/increase the payoff of a defector/cooperator . Study 2 (N=253) extends Study 1 to a different method of punishing/rewarding ;
Revised:  Study 1 (N= 1,077 ) shows that people do not discriminate between genders when they are in charge of punishing (rewarding ) defectors (cooperators) in a one-shot prisoner's dilemma with third-party punishment/reward is implemented by asking participants whether they want to pay a cost to decrease/increase the payoff of a defector/cooperator . Study 2 (N=253) extends Study 1 to a different method of punishing/rewarding ;
Edit intent: meaning-changed
Original:  In this study, punishment/reward is implemented by asking participants whether they want to pay a cost to decrease/increase the payoff of a defector/cooperator . Study 2 (N=253) extends Study 1 to a different method of punishing/rewarding ;
Revised:  In this study, punishment/reward . Study 2 (N=253) extends Study 1 to a different method of punishing/rewarding ;
Edit intent: coherence
Original:  In this study, punishment/reward is implemented by asking participants whether they want to pay a cost to decrease/increase the payoff of a defector/cooperator . Study 2 (N=253) extends Study 1 to a different method of punishing/rewarding ;
Revised:  In this study, punishment/reward is implemented by asking participants whether they want to pay a cost to decrease/increase the payoff of a defector/cooperator . Study 2 (N=253) extends Study 1 to a different method of punishing/rewarding :
Edit intent: fluency
Original:  All these results are robust to splitting the sample by gender : in our context , neither men nor women discriminate between genders when they are in charge of punishing defectors or rewarding cooperators .
Revised:  Study 3a (N=331) and Study 3b (N=310) conceptually replicate Study 2 with a slightly different gender manipulation. These latter studies show that, in situations where they do not have specific beliefs about the gender of the defector/cooperator's partner , neither men nor women discriminate between genders when they are in charge of punishing defectors or rewarding cooperators .
Edit intent: meaning-changed
Original:  We first tested the method with a large dataset of known protein complexes obtaining an overall area under the ROC curve of 0.69 in the blind recognition of binding sites and then applied it to investigate the features of the interaction between the Spike protein of SARS-Cov-2 and human cellular receptors.
Revised:  We first tested the method with a large dataset of known protein complexes obtaining an overall area under the ROC curve of 0.76 in the blind recognition of binding sites and then applied it to investigate the features of the interaction between the Spike protein of SARS-Cov-2 and human cellular receptors.
Edit intent: meaning-changed
Original:  Significant gaps persist in our knowledge of COVID 19 epidemiology, transmission dynamics, investigation tools and management, despite (or possibly contributing to ) the fact that the ourtbreak is an unprecedented global threat.
Revised:  Significant gaps persist in our knowledge of COVID-19 epidemiology, transmission dynamics, investigation tools and management, despite (or possibly contributing to ) the fact that the ourtbreak is an unprecedented global threat.
Edit intent: fluency
Original:  Significant gaps persist in our knowledge of COVID 19 epidemiology, transmission dynamics, investigation tools and management, despite (or possibly contributing to ) the fact that the ourtbreak is an unprecedented global threat.
Revised:  Significant gaps persist in our knowledge of COVID 19 epidemiology, transmission dynamics, investigation tools and management, despite (or possibly because of ) the fact that the ourtbreak is an unprecedented global threat.
Edit intent: clarity
Original:  We construct and analyze here one first step: that of adapting a traditional SEIR epidemic model to the specific dynamic compartments and epidemic parameters of COVID 19 , as it spreads in an age-heterogeneous community.
Revised:  We construct and analyze here one first step: that of adapting a traditional SEIR epidemic model to the specific dynamic compartments and epidemic parameters of COVID-19 , as it spreads in an age-heterogeneous community.
Edit intent: fluency
Original:  We construct and analyze here one first step: that of adapting a traditional SEIR epidemic model to the specific dynamic compartments and epidemic parameters of COVID-19 , as it spreads in an age-heterogeneous community.
Revised:  In our work, we adapt a traditional SEIR epidemic model to the specific dynamic compartments and epidemic parameters of COVID-19 , as it spreads in an age-heterogeneous community.
Edit intent: clarity
Original:  We construct and analyze here one first step: that of adapting a traditional SEIR epidemic model to the specific dynamic compartments and epidemic parameters of COVID-19 , as it spreads in an age-heterogeneous community.
Revised:  We construct and analyze here one first step: that of adapting a traditional SEIR epidemic model to the specific dynamic compartments and epidemic parameters of COVID 19 , as it spreads in an age-heterogeneous community.
Edit intent: fluency
Original:  We analyze the current management strategy of the epidemic course ( travel bans, service closures and interruptions, social distancing) .
Revised:  We analyze the current management strategy of the epidemic course ( as they were implemented through lockdown and reopening procedures in many of the US states and countries worldwide); however, to more clearly illustrate ideas, we focus on the example of a small scale college town community, with the timeline of control measures introduced in the state of New York .
Edit intent: meaning-changed
Original: Neonatal sepsis (NS) and resulting complications, such as postinfectious hydrocephalus (PIH), are a significant cause of neonatal and infant mortality throughout the developing world. Addressing this problem requires dynamical modeling and estimation of the true state of the disease using realistic data collection schemes, followed by optimal allocation of resources to control the disease with a combination of prevention and treatment. To address these issues, we first develop a compartmental model for non-communicable infections, which are especially common with NS. Then, we develop a novel optimal linear filterfor Poisson observations, characteristic of infectious diseases, which model the number of patients recorded as presenting each day at hospitals.
Revised: An optimal filter for Poisson observations is developed as a variant of the traditional Kalman filter. Poisson distributions are characteristic of infectious diseases, which model the number of patients recorded as presenting each day at hospitals.
Edit intent: clarity
Original:  To address these issues, we first develop a compartmental model for non-communicable infections, which are especially common with NS. Then, we develop a novel optimal linear filterfor Poisson observations, characteristic of infectious diseases, which model the number of patients recorded as presenting each day at hospitals. The classical Linear Quadratic Regulator is generalized to nonautonomous linear dynamics with mixed linear and quadratic cost functions, which better model real world costs. At each step we apply our methods to  a case study of NS and PIH , using parameters estimated from publicly available data for Uganda.
Revised:  To address these issues, we first develop a compartmental model for non-communicable infections, which are especially common with NS. Then, we develop a novel optimal linear filterfor Poisson observations, characteristic of infectious diseases, which model the number of patients recorded as presenting each day to a case study of NS and PIH , using parameters estimated from publicly available data for Uganda.
Edit intent: clarity
Original:  At each step we apply our methods to  a case study of NS and PIH , using parameters estimated from publicly available data for Uganda. We demonstrate the effectiveness of our filter in numerical experiments and study the effect of the economic cost of NS and PIH on the optimal allocation of resources between prevention and treatment.
Revised:  At each step we apply our methods to a case study of NS and PIH , using parameters estimated from publicly available data .
Edit intent: coherence
Original:  Temporary measures aiming to reduce transmission are likely ineffective to mitigate the peak. An application to a stylized asset pricing model suggests that the stock price may decrease by 25-50\% during the epidemic, although the stock market crash is short-lived .
Revised:  The peak reduces to 6.2\% under the optimal mitigation policy that controls the timing and intensity of social distancing. A stylized asset pricing model suggests that the stock price may decrease by 25-50\% during the epidemic, although the stock market crash is short-lived .
Edit intent: meaning-changed
Original: Stochastic zeroth-order optimization concerns problems where only noisy function evaluations are available. Such problems arises frequently in many important applications. In this paper, we consider stochastic zeroth-order optimization over Riemannian submanifolds embedded in an Euclidean space, an important but less studied area, and propose four algorithms for solving this class of problems under different settings.
Revised: We consider stochastic zeroth-order optimization over Riemannian submanifolds embedded in an Euclidean space, an important but less studied area, and propose four algorithms for solving this class of problems under different settings.
Edit intent: coherence
Original:  In this paper, we consider stochastic zeroth-order optimization over Riemannian submanifolds embedded in an Euclidean space, an important but less studied area, and propose four algorithms for solving this class of problems under different settings.
Revised:  In this paper, we consider stochastic zeroth-order optimization over Riemannian submanifolds embedded in Euclidean space, an important but less studied area, and propose four algorithms for solving this class of problems under different settings.
Edit intent: fluency
Original:  In this paper, we consider stochastic zeroth-order optimization over Riemannian submanifolds embedded in an Euclidean space, an important but less studied area, and propose four algorithms for solving this class of problems under different settings. Our algorithms are based on estimating the Riemannian gradient and Hessian from noisy objective function evaluations, based on a Riemannian version of the Gaussian smoothing technique.
Revised:  In this paper, we consider stochastic zeroth-order optimization over Riemannian submanifolds embedded in an Euclidean space, where the task is to solve Riemannian optimization problem with only noisy objective function evaluations. Towards this, our main contribution is to propose estimators of the Riemannian gradient and Hessian from noisy objective function evaluations, based on a Riemannian version of the Gaussian smoothing technique.
Edit intent: coherence
Original:  In particular, we consider the following settings for the objective function: (i) stochastic and gradient-Lipschitz (in both nonconvex and geodesic convex settings), (ii) sum of gradient-Lipschitz and non-smooth functions, and (iii) Hessian-Lipschitz.
Revised:  The proposed estimators overcome the difficulty of the non-linearity of the manifold constraint and the issues that arise in using Euclidean Gaussian smoothing techniques when the function is defined only over the manifold. We use the proposed estimators to solve Riemannian optimization problems in the following settings for the objective function: (i) stochastic and gradient-Lipschitz (in both nonconvex and geodesic convex settings), (ii) sum of gradient-Lipschitz and non-smooth functions, and (iii) Hessian-Lipschitz.
Edit intent: meaning-changed
Original: In this work we add a graph theoretical perspective to a classical problemof fairly allocating indivisible items to several agents. Agents have different profit valuations of items and we allow an incompatibility relation between pairs of items described in terms of a conflict graph.
Revised: In this work we add a graph theoretical perspective to this classical problem. Thereby we introduce an incompatibility relation between pairs of items described in terms of a conflict graph.
Edit intent: coherence
Original:  Hence, every feasible allocation of items to the agents corresponds to a partial coloring , that is , a collection of pairwise disjoint independent sets. The sum of profits of vertices/items assigned to one color/agent should be optimized in a maxi-min sense. We derive complexity and algorithmic results for this problem , which is a generalization of the classical Partitionand Independent Set problems. In particular, we{\sc  {\sc   show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs  .
Revised:  Hence, every feasible allocation of items to the agents corresponds to a partial coloring of the conflict graph. Every agent has its own profit valuation for every item. Aiming at a fair allocation, our goal is the maximization of the lowest total profit of items allocated to any one of the agents. The resulting optimization problem contains, as special cases, both{\sc {\sc show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs .
Edit intent: clarity
Original:  In particular, we{\sc  {\sc   show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs  .
Revised:  In particular, we{\sc Partition {\sc show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs .
Edit intent: meaning-changed
Original:  In particular, we{\sc  {\sc   show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs  .
Revised:  In particular, we{\sc and{\sc show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs .
Edit intent: meaning-changed
Original:  In particular, we{\sc  {\sc   show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs  .
Revised:  In particular, we{\sc {\sc Independent Set show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs .
Edit intent: fluency
Original:  In particular, we{\sc  {\sc   show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs  .
Revised:  In particular, we{\sc {\sc . In our contribution we derive complexity and algorithmic results depending on the properties of the given graph. We can show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs .
Edit intent: meaning-changed
Original:  In particular, we{\sc  {\sc   show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs  .
Revised:  In particular, we{\sc {\sc show that the problem is strongly NP-hard for bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs .
Edit intent: meaning-changed
Original:  In particular, we{\sc  {\sc   show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs  .
Revised:  In particular, we{\sc {\sc show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time for the classes of cocomparability graphs and biconvex bipartite graphs .
Edit intent: coherence
Original:  In particular, we{\sc  {\sc   show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs  .
Revised:  In particular, we{\sc {\sc show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of chordal graphs, cocomparability graphs, biconvex bipartite graphs .
Edit intent: clarity
Original:  In particular, we{\sc  {\sc   show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs  .
Revised:  In particular, we{\sc {\sc show that the problem is strongly NP-complete in the classes of bipartite graphs and their line graphs, and solvable in pseudo-polynomial time in the classes of cocomparability graphs and biconvex bipartite graphs , and graphs of bounded treewidth. Each of the pseudo-polynomial algorithms can also be turned into a fully polynomial approximation scheme (FPTAS) .
Edit intent: meaning-changed
Original:  Synaptic weights at in-phase PF-Purkinje cell (PC) synapses of active GR cells are strongly depressed via strong long-term depression (LTD), while those at anti- and complex out-of-phase PF-PC synapses are weakly depressed through weak LTD.
Revised:  Synaptic weights at in-phase PF-Purkinje cell (PC) synapses of active GR cells are strongly depressed via strong long-term depression (LTD), while those at anti-phase and complex out-of-phase PF-PC synapses are weakly depressed through weak LTD.
Edit intent: fluency
Original:  This kind of "effective" depression (i.e., strong/weak LTD) at  PF-PC synapses causes a big modulation in firing of PCs, which then exert effective inhibitory coordination on  vestibular nucleus (VN) neuron (which evokes OKR).
Revised:  This kind of "effective" depression (i.e., strong/weak LTD) at the PF-PC synapses causes a big modulation in firing of PCs, which then exert effective inhibitory coordination on vestibular nucleus (VN) neuron (which evokes OKR).
Edit intent: fluency
Original:  This kind of "effective" depression (i.e., strong/weak LTD) at  PF-PC synapses causes a big modulation in firing of PCs, which then exert effective inhibitory coordination on  vestibular nucleus (VN) neuron (which evokes OKR).
Revised:  This kind of "effective" depression (i.e., strong/weak LTD) at PF-PC synapses causes a big modulation in firings of PCs, which then exert effective inhibitory coordination on vestibular nucleus (VN) neuron (which evokes OKR).
Edit intent: fluency
Original:  This kind of "effective" depression (i.e., strong/weak LTD) at  PF-PC synapses causes a big modulation in firing of PCs, which then exert effective inhibitory coordination on  vestibular nucleus (VN) neuron (which evokes OKR).
Revised:  This kind of "effective" depression (i.e., strong/weak LTD) at PF-PC synapses causes a big modulation in firing of PCs, which then exert effective inhibitory coordination on the vestibular nucleus (VN) neuron (which evokes OKR).
Edit intent: fluency
Original:  For the firing of  VN neuron, the learning gain degree {L}_g, corresponding to the modulation gain ratio, increases with increasing  learning cycle, and it saturates at about the 300th cycle.
Revised:  For the firing of the VN neuron, the learning gain degree {L}_g, corresponding to the modulation gain ratio, increases with increasing learning cycle, and it saturates at about the 300th cycle.
Edit intent: fluency
Original:  For the firing of  VN neuron, the learning gain degree {L}_g, corresponding to the modulation gain ratio, increases with increasing  learning cycle, and it saturates at about the 300th cycle.
Revised:  For the firing of VN neuron, the learning gain degree {L}_g, corresponding to the modulation gain ratio, increases with increasing the learning cycle, and it saturates at about the 300th cycle.
Edit intent: fluency