wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this article, a readable implementation of Manacher's algorithm based on index mapping is developed which does away with the string augmentation  .
Revised:  In this article, a readable implementation of Manacher's algorithm based on index mapping that makes the string augmentation .
Edit intent: clarity
Original:  Within this scope, we give sufficient conditions for two interesting asymptotic proprieties: extinction and the mean persistence of the epidemic.
Revised:  Within this scope, we give sufficient conditions for two interesting asymptotic proprieties: extinction and persistence of the epidemic.
Edit intent: clarity
Original:  We also prove a sufficient condition for the chromatic number to be equal with a natural upper bound.
Revised:  We also prove a sufficient condition for the chromatic number to be equal to a natural upper bound.
Edit intent: fluency
Original:  ~ [SICOMP'11] proposed self-improving algorithms for sorting and Delaunay triangulation (DT) when the input instances x_1,\cdots,x_n follow some unknown product distribution.
Revised:  [SICOMP'11] proposed self-improving algorithms for sorting and Delaunay triangulation (DT) when the input instances x_1,\cdots,x_n follow some unknown product distribution.
Edit intent: coherence
Original: The design of data markets has gained in importance as firms increasingly use predictions from machine learning models to make their operationsmore effective , yet need to externally acquire the necessary training data to fit such models.
Revised: The design of data markets has gained importance as firms increasingly use predictions from machine learning models to make their operationsmore effective , yet need to externally acquire the necessary training data to fit such models.
Edit intent: clarity
Original: The design of data markets has gained in importance as firms increasingly use predictions from machine learning models to make their operationsmore effective , yet need to externally acquire the necessary training data to fit such models.
Revised: The design of data markets has gained in importance as firms increasingly use predictions from machine learning models to streamline operations , yet need to externally acquire the necessary training data to fit such models.
Edit intent: clarity
Original: The design of data markets has gained in importance as firms increasingly use predictions from machine learning models to make their operationsmore effective , yet need to externally acquire the necessary training data to fit such models.
Revised: The design of data markets has gained in importance as firms increasingly use predictions from machine learning models to make their operationsmore effective , yet need to externally acquire training data to fit such models.
Edit intent: clarity
Original:  A property of such markets that has been given limited consideration thus far is the externality faced by a firm when data is allocated to other, competing firms.
Revised:  One aspect that has received limited consideration is the externality faced by a firm when data is allocated to other, competing firms.
Edit intent: clarity
Original:  A property of such markets that has been given limited consideration thus far is the externality faced by a firm when data is allocated to other, competing firms.
Revised:  A property of such markets that has been given limited consideration thus far is the externality a firm faces when data is allocated to other, competing firms.
Edit intent: fluency
Original:  A property of such markets that has been given limited consideration thus far is the externality faced by a firm when data is allocated to other, competing firms.
Revised:  A property of such markets that has been given limited consideration thus far is the externality faced by a firm when data is allocated to competing firms.
Edit intent: clarity
Original:  In this work , we consider the case with n competing firms and a monopolistic data seller.
Revised:  In this work , we consider the setting of n competing firms and a monopolistic data seller.
Edit intent: clarity
Original:  We demonstrate that modeling the utility of firms solely through the increase in prediction accuracy experienced reduces the complex, combinatorial problem of allocating and pricing multiple data sets to an auction of a single digital (freely replicable) good . Crucially, this is what enables us to model the negative externalities experienced by a firm resulting from other firms' allocations.
Revised:  We demonstrate how modeling utility solely through increases in prediction accuracy experienced reduces the complex, combinatorial problem of allocating and pricing multiple data sets to an auction of a single digital (freely replicable) good . Crucially, this is what enables us to model the negative externalities experienced by a firm resulting from other firms' allocations.
Edit intent: clarity
Original:  We demonstrate that modeling the utility of firms solely through the increase in prediction accuracy experienced reduces the complex, combinatorial problem of allocating and pricing multiple data sets to an auction of a single digital (freely replicable) good . Crucially, this is what enables us to model the negative externalities experienced by a firm resulting from other firms' allocations.
Revised:  We demonstrate that modeling the utility of firms solely through the increase in prediction accuracy reduces the combinatorial problem of allocating and pricing multiple data sets to an auction of a single digital (freely replicable) good . Crucially, this is what enables us to model the negative externalities experienced by a firm resulting from other firms' allocations.
Edit intent: clarity
Original:  We demonstrate that modeling the utility of firms solely through the increase in prediction accuracy experienced reduces the complex, combinatorial problem of allocating and pricing multiple data sets to an auction of a single digital (freely replicable) good . Crucially, this is what enables us to model the negative externalities experienced by a firm resulting from other firms' allocations.
Revised:  We demonstrate that modeling the utility of firms solely through the increase in prediction accuracy experienced reduces the complex, combinatorial problem of allocating and pricing multiple datasets to a single digital (freely replicable) good . Crucially, this is what enables us to model the negative externalities experienced by a firm resulting from other firms' allocations.
Edit intent: clarity
Original:  We highlight how the form of the firms' private information -- whether they know the externalities they exert on others or that others exert on them -- affects the structure of the optimal mechanisms.
Revised:  We highlight how the form of firms' private information -- whether they know the externalities they exert on others or that others exert on them -- affects the structure of the optimal mechanisms.
Edit intent: fluency
Original:  We highlight how the form of the firms' private information -- whether they know the externalities they exert on others or that others exert on them -- affects the structure of the optimal mechanisms.
Revised:  We highlight how the form of the firms' private information -- whether they know the externalities they exert on others or vice-versa -- affects the structure of the optimal mechanisms.
Edit intent: clarity
Original:  We find that in all cases, the optimal allocation rules turn out to be single thresholds (one per firm), in which the seller allocates all information or none of it to a firm.
Revised:  We find that in all cases, the optimal allocation rule is a single threshold (one per firm), in which the seller allocates all information or none of it to a firm.
Edit intent: clarity
Original:  Towards this , we consider the setting of n competing firms and a monopolistic data seller .
Revised:  Such externalities couple firms' optimal allocations, despite the inherent free replicability of data. In this paper, we demonstrate that the presence of externalities increases the optimal revenue of a monopolistic data seller .
Edit intent: coherence
Original:  We demonstrate how modeling utility solely through increases in prediction accuracy reduces the combinatorial problem of allocating and pricing multiple datasets to  a single digital good auction.
Revised:  We demonstrate how modeling utility solely through increases in prediction accuracy reduces the combinatorial problem of allocating and pricing multiple datasets to the auction of a single digital good auction.
Edit intent: clarity
Original:  We find the welfare and revenue maximizing mechanisms, highlighting how the form of firms' private information -- whether they know the externalities they exert on others or vice-versa -- affects their overall structures.
Revised:  We find the welfare and revenue maximizing mechanisms, highlighting how the forms of firms' private information -- whether they know the externalities they exert on others or vice-versa -- affects their overall structures.
Edit intent: fluency
Original:  We find the welfare and revenue maximizing mechanisms, highlighting how the form of firms' private information -- whether they know the externalities they exert on others or vice-versa -- affects their overall structures.
Revised:  We find the welfare and revenue maximizing mechanisms, highlighting how the form of firms' private information - whether they know the externalities they exert on others or vice-versa -- affects their overall structures.
Edit intent: fluency
Original:  We find the welfare and revenue maximizing mechanisms, highlighting how the form of firms' private information -- whether they know the externalities they exert on others or vice-versa -- affects their overall structures.
Revised:  We find the welfare and revenue maximizing mechanisms, highlighting how the form of firms' private information -- whether they know the externalities they exert on others or vice-versa - affects their overall structures.
Edit intent: fluency
Original:  Then, we find the welfare and revenue maximizing mechanisms, highlighting how the forms of firms' private information - whether they know the externalities they exert on others or vice-versa - affects their overall structures.
Revised:  Then, we find the welfare and revenue maximizing mechanisms, highlighting how the form of firms' private information - whether they know the externalities they exert on others or vice-versa - affects their overall structures.
Edit intent: fluency
Original: A novel deep multi-agent reinforcement learning framework is proposed to identify and resolve conflicts among a variable number of aircraft in a high-density, stochastic, and dynamic sector in en route airspace . Currently the sector capacity is limited by human air traffic controller's cognitive limitation.
Revised: A novel deep multi-agent reinforcement learning framework is proposed to identify and resolve conflicts among a variable number of aircraft in a high-density, stochastic, and dynamic sector . Currently the sector capacity is limited by human air traffic controller's cognitive limitation.
Edit intent: clarity
Original: A novel deep multi-agent reinforcement learning framework is proposed to identify and resolve conflicts among a variable number of aircraft in a high-density, stochastic, and dynamic sector in en route airspace . Currently the sector capacity is limited by human air traffic controller's cognitive limitation.
Revised: A novel deep multi-agent reinforcement learning framework is proposed to identify and resolve conflicts among a variable number of aircraft in a high-density, stochastic, and dynamic sector in en route airspace . Currently the sector capacity is constrained by human air traffic controller's cognitive limitation.
Edit intent: fluency
Original:  In order to scale up to a high-density airspace, in this work we investigate the feasibility of a new concept (autonomous separation assurance) and a new approach (multi-agent reinforcement learning) to push the sector capacity above human cognitive limitation.
Revised:  We investigate the feasibility of a new concept (autonomous separation assurance) and a new approach (multi-agent reinforcement learning) to push the sector capacity above human cognitive limitation.
Edit intent: coherence
Original:  In order to scale up to a high-density airspace, in this work we investigate the feasibility of a new concept (autonomous separation assurance) and a new approach (multi-agent reinforcement learning) to push the sector capacity above human cognitive limitation.
Revised:  In order to scale up to a high-density airspace, in this work we investigate the feasibility of a new concept (autonomous separation assurance) and a new approach to push the sector capacity above human cognitive limitation.
Edit intent: clarity
Original:  Our proposed framework utilizes an actor-critic model, Proximal Policy Optimization (PPO) that we customize to incorporate an attention network.
Revised:  Our proposed framework utilizes Proximal Policy Optimization (PPO) that we customize to incorporate an attention network.
Edit intent: clarity
Original:  Our proposed framework utilizes an actor-critic model, Proximal Policy Optimization (PPO) that we customize to incorporate an attention network.
Revised:  Our proposed framework utilizes an actor-critic model, Proximal Policy Optimization (PPO) that we modify to incorporate an attention network.
Edit intent: clarity
Original:  By using the attention network, we are able to encode the information from a variable number of intruder aircraft into a fixed length vector and allow the agents to learn which intruder aircraft's information is critical to achieve the optimal performance.
Edit intent: coherence
Original:  The agents are trained using a centralized learning, decentralized execution scheme where one neural network is learned and shared by all agents in the environment.
Revised:  Agents are trained using a centralized learning, decentralized execution scheme where one neural network is learned and shared by all agents in the environment.
Edit intent: clarity
Original:  Numerical results show the proposed framework significantly reduces the offline training time without sacrificing performance .
Revised:  Numerical results show the proposed framework significantly reduces offline training time without sacrificing performance .
Edit intent: fluency
Original: Cerebrovascular accident (CVA) or stroke is the rapid loss of brain function due to disturbance in the blood supply to the brain.
Revised: Cerebrovascular accident (CVA) or stroke is the rapid loss of brain function due to disturbance in the blood supply to the brain.
Edit intent: fluency
Original:  We show that the strict service curve is the best obtainable one, and that delay bounds derived from it are tight (i.e.  worst-case) for flows of packets of constant size.
Revised:  We show that the strict service curve is the best obtainable one, and that delay bounds derived from it are tight (i.e. , worst-case) for flows of packets of constant size.
Edit intent: fluency
Original:  While most Chinese cities control the disease which resulted in the decaying stage, in other world-wide countries the situation is still becoming worse probably due to less control .
Revised:  While most cities in China control the disease which resulted in the decaying stage, in other world-wide countries the situation is still becoming worse probably due to less control .
Edit intent: clarity
Original: The new coronavirus known as COVID-19 is rapidly spreading since December 2019.
Revised: The new coronavirus known as COVID-19 is spread world-wide since December 2019.
Edit intent: clarity
Original:  Since quarantine is usually applied on a city level , more insight  can be obtained in analyzing the epidemic in cities.
Revised:  Since quarantine is usually applied on a city level , more insight can be obtained by analyzing the epidemic in cities.
Edit intent: clarity
Original:  Our results suggest that the disease spread in a city in China is characterized by  two-stages process.
Revised:  Our results suggest that the disease spread in a city in China is characterized by a two-stages process.
Edit intent: fluency
Original: When compiling programs for fault-tolerant quantum computers, approximation errors must be taken into account .
Revised: Approximation errors must be taken into account .
Edit intent: clarity
Original:  We propose a methodology that tracks such errors automatically and solves the optimization problem of finding accuracy parameters that guarantee a specified overall accuracy while aiming to minimize a custom implementation cost .
Revised:  We propose a methodology that tracks such errors automatically and then optimizes accuracy parameters to guarantee a specified overall accuracy while aiming to minimize a custom implementation cost .
Edit intent: clarity
Original:  The core idea  is to extract constraint and cost functions directly from the high-level description of the quantum program.
Revised:  The core idea of our approach is to extract constraint and cost functions directly from the high-level description of the quantum program.
Edit intent: clarity
Original:  Then, our custom compiler passes optimize these functions, turning them into (near-)symbolic expressions for (1) the total error and (2) the implementation cost (e.g., total  gate count).
Revised:  Then, custom compiler passes optimize these functions, turning them into (near-)symbolic expressions for (1) the total error and (2) the implementation cost (e.g., total gate count).
Edit intent: clarity
Original:  Result ~ (a) generalizes to arbitrary dimension d for labeled order types with the average number of extreme points 2d+o(1) and constant variance.
Revised:  Result (a) generalizes to arbitrary dimension d for labeled order types with the average number of extreme points 2d+o(1) and constant variance.
Edit intent: fluency
Original: A graph is fan-crossing free if it admits  a drawing in the plane so that each edge can be crossed by independent edges .
Revised: A graph is fan-crossing free a drawing in the plane so that each edge can be crossed by independent edges .
Edit intent: clarity
Original: A graph is fan-crossing free if it admits  a drawing in the plane so that each edge can be crossed by independent edges .
Revised: A graph is fan-crossing free if it admits if it has a drawing in the plane so that each edge can be crossed by independent edges .
Edit intent: clarity
Original: A graph is fan-crossing free if it admits  a drawing in the plane so that each edge can be crossed by independent edges .
Revised: A graph is fan-crossing free if it admits a drawing in the plane so that each edge is crossed by independent edges .
Edit intent: clarity
Original:  In particular, we show the fan22 crossing free graphs are universal for 2-subdivision and for node-to-circle 3 expansion  .
Revised:  In particular, we show the fan22 crossing free graphs are universal for 2-subdivision and the node-to-circle 3 expansion .
Edit intent: fluency
Original:  We theoretically analyze the dynamical effects of histone modifications on gene switching by using the Doi-Peliti operator formalism of chemical reaction kinetics .
Revised:  We theoretically analyze the dynamical effects of histone modifications on gene switching by extending the Doi-Peliti operator formalism of chemical reaction kinetics .
Edit intent: clarity
Original:  The calculated probability flux in self-regulating genes shows a distinct circular flow  around basins in the landscape of the gene state distribution, giving rise to hysteresis in gene switching.
Revised:  The calculated probability flux in self-regulating genes shows a distinct circular flow of the probability flux around basins in the landscape of the gene state distribution, giving rise to hysteresis in gene switching.
Edit intent: clarity
Original:  The calculated probability flux in self-regulating genes shows a distinct circular flow  around basins in the landscape of the gene state distribution, giving rise to hysteresis in gene switching.
Revised:  The calculated probability flux in self-regulating genes shows a distinct circular flow around basins in the landscape of the gene state distribution, which leads to hysteresis in gene switching.
Edit intent: coherence
Original:  The flux-landscape analyses elucidate the nonlinear nonequilibrium mechanism of epigenetic gene switching .
Revised:  The flux-landscape analyses shed light on the nonlinear nonadiabatic mechanism of epigenetic gene switching .
Edit intent: clarity
Original:  The flux-landscape analyses elucidate the nonlinear nonequilibrium mechanism of epigenetic gene switching .
Revised:  The flux-landscape analyses elucidate the nonlinear nonequilibrium mechanism of epigenetic cell fate decision making .
Edit intent: clarity
Original: Background: COVID-19 is an ongoing pandemic with over 200 ,000 confirmed cases with large variability in its reported case fatality rate (CFR).
Revised: Background: COVID-19 is an ongoing pandemic with over 200 ,000 confirmed cases and large variability in its reported case fatality rate (CFR).
Edit intent: fluency
Original:  As we are in the middle of an active outbreak, estimating this measure will necessarily involve correcting for time- and severity- dependent reporting of cases , and time-lags in observed patient outcomes.
Revised:  As we are in the middle of an active outbreak, estimating this measure involves correcting for time- and severity- dependent reporting of cases , and time-lags in observed patient outcomes.
Edit intent: clarity
Original:  As we are in the middle of an active outbreak, estimating this measure will necessarily involve correcting for time- and severity- dependent reporting of cases , and time-lags in observed patient outcomes.
Revised:  As we are in the middle of an active outbreak, estimating this measure will necessarily involve correcting for time- and severity- dependent reporting of cases as well as time-lags in observed patient outcomes.
Edit intent: clarity
Original:  Methods: We carry out a theoretical analysis of  current estimators of the CFR.
Revised:  Methods: We carry out a theoretical analysis of some current estimators of the CFR.
Edit intent: clarity
Original:  Methods: We carry out a theoretical analysis of  current estimators of the CFR.
Revised:  Methods: We carry out a theoretical analysis of current estimators of CFR.
Edit intent: fluency
Original:  We adapt a standard statistical technique, expectation maximization (EM) , in a form previously developed for pandemic influenzas to correct for time- and severity- dependent reporting in the estimated CFR of COVID-19 . Code is available at URL . Findings: We find that the na\"{ive estimator of CFR is asymptotically biased for the true CFR.
Revised:  We then adapt a previously developed method -- based on the well known expectation-maximization (EM) , in a form previously developed for pandemic influenzas to correct for time- and severity- dependent reporting in the estimated CFR of COVID-19 . Code is available at URL . Findings: We find that the na\"{ive estimator of CFR is asymptotically biased for the true CFR.
Edit intent: clarity
Original:  We adapt a standard statistical technique, expectation maximization (EM) , in a form previously developed for pandemic influenzas to correct for time- and severity- dependent reporting in the estimated CFR of COVID-19 . Code is available at URL . Findings: We find that the na\"{ive estimator of CFR is asymptotically biased for the true CFR.
Revised:  We adapt a standard statistical technique, expectation maximization (EM) technique -- for COVID-19 . Code is available at URL . Findings: We find that the na\"{ive estimator of CFR is asymptotically biased for the true CFR.
Edit intent: coherence