wanyu/IteraTeR_v2 huggingface dataset:
Original:  In the paper we proposed a new pricing theory with several rules to solve the paradox and state that the fair pricing should be judged by buyer and seller independently.
Revised:  In the paper we proposed a new pricing theory with several rules to solve the paradox and state that the fair pricing should be judged by the buyer and the seller independently.
Edit intent: fluency
Original:  In the paper , we propose a new pricing theory with several rules to solve the paradoxand state that the fair pricing should be judged by the buyer and the seller independently.
Revised:  In the paper we proposed a new pricing theory with several rules to solve the paradoxand state that the fair pricing should be judged by the buyer and the seller independently.
Edit intent: fluency
Original:  The seller is concerned about costs, and the buyer is concerned about the realistic prospect of returns.
Revised:  The seller is concerned about costs, while the buyer is concerned about the realistic prospect of returns.
Edit intent: coherence
Original: The St. Petersburg paradox , an important topic in probability theory, has not been solved  last 280 years.
Revised: The St. Petersburg Paradox , an important topic in probability theory, has not been solved last 280 years.
Edit intent: fluency
Original: The St. Petersburg paradox , an important topic in probability theory, has not been solved  last 280 years.
Revised: The St. Petersburg paradox , an important topic in probability theory, has not been solved in the last 280 years.
Edit intent: fluency
Original:  Petersburg Paradox in 1738, many people had tried to solve it and had proposed various explanations, but all are not satisfactory.
Revised:  Petersburg Paradox in 1738, many people had tried to solve it and had proposed various explanations, but all were not satisfactory.
Edit intent: fluency
Original:  In the paper we proposed a new pricing theory with several rules, which incidentally resolves this paradox.
Revised:  In this paper we propose a new pricing theory with several rules, which incidentally resolves this paradox.
Edit intent: fluency
Original:  While scRNA-seq has been used extensively to provide insight into health and disease , it has not been used for disease prediction or diagnostics.
Revised:  While scRNA-seq has been used extensively to provide insight into both healthy systems and diseases , it has not been used for disease prediction or diagnostics.
Edit intent: clarity
Original:  MS is a disease of the central nervous system that is difficult to diagnose.
Revised:  MS is a disease of the central nervous system that can be difficult to diagnose.
Edit intent: coherence
Original:  We achieve \mathbf{92 }%DIFDELCMD < \\%%% %DIF < accuracy in predicting MS,  outperforming other state-of-the-art methods such as a graph convolutional network , random forest , and multi-layer perceptron .
Revised:  We achieve }%DIFDELCMD < \\%%% %DIF < accuracy in predicting MS, outperforming other state-of-the-art methods such as a graph convolutional network , random forest , and multi-layer perceptron .
Edit intent: coherence
Original:  We achieve \mathbf{92 }%DIFDELCMD < \\%%% %DIF < accuracy in predicting MS,  outperforming other state-of-the-art methods such as a graph convolutional network , random forest , and multi-layer perceptron .
Revised:  We achieve \mathbf{92 }%DIFDELCMD < \\%%% %DIF < accuracy in predicting MS, outperforming other state-of-the-art methods such as a graph convolutional network and a random forest classifier .
Edit intent: clarity
Original:  The graph attention model also allow us to infer a new feature space for the cells that emphasizes the difference between the two conditions.
Revised:  The graph attention model also allow us to infer a new feature space for the cells that emphasizes the differences between the two conditions.
Edit intent: fluency
Original:  Finally we use the attention weights to learn a new low-dimensional embedding which we visualize with PHATE and UMAP . To the best of our knowledge, this is the first effort to use graph attention, and deep learning in general, to predict disease state from single-cell data.
Revised:  Finally we use the attention weights to learn a new low-dimensional embedding that can be visualized . To the best of our knowledge, this is the first effort to use graph attention, and deep learning in general, to predict disease state from single-cell data.
Edit intent: clarity
Original: We describe a strategy for identifying the universe of research publications relating to the application and development of artificial intelligence.
Revised: We describe a strategy for identifying the universe of research publications relevant to the application and development of artificial intelligence.
Edit intent: fluency
Original:  The approach leverages arXiv's corpus of scientific preprints, in which authors choose subject tags for their papers from a set defined by editors.
Revised:  The approach leverages the arXiv corpus of scientific preprints, in which authors choose subject tags for their papers from a set defined by editors.
Edit intent: fluency
Original:  We compose from these subjects a functional definition of AI-relevance with intuitive components, by learning the subject definitions from paper metadata, and then inferring the arXiv-subject labels of papers in  Web of Science .
Revised:  We compose a functional definition of AI-relevance with intuitive components, by learning the subject definitions from paper metadata, and then inferring the arXiv-subject labels of papers in Web of Science .
Edit intent: clarity
Original:  We compose from these subjects a functional definition of AI-relevance with intuitive components, by learning the subject definitions from paper metadata, and then inferring the arXiv-subject labels of papers in  Web of Science .
Revised:  We compose from these subjects a functional definition of AI relevance by learning these subjects from paper metadata, and then inferring the arXiv-subject labels of papers in Web of Science .
Edit intent: coherence
Original:  We evaluate the out-of-domain performance of our classifiers against other sources of subject information and results from other methods.
Revised:  We evaluate the out-of-domain performance of our classifiers against other sources of topic information and predictions from alternative methods.
Edit intent: clarity
Original:  We find that for the high-level fields of study represented on arXiv , a supervised solution can generalize for inference in other corpora .
Revised:  We find that a supervised solution can generalize to identify publications that belong to the high-level fields of study represented on arXiv , a supervised solution can generalize for inference in other corpora .
Edit intent: clarity
Original:  We find that for the high-level fields of study represented on arXiv , a supervised solution can generalize for inference in other corpora .
Revised:  We find that for the high-level fields of study represented on arXiv .
Edit intent: clarity
Original: An \alpha-additive spanner of an undirected graph G =(V, E)  is a subgraph H such that the distance between any two vertices in G is stretched by no more than an additive factor of \alpha.
Revised: A is a subgraph H such that the distance between any two vertices in G is stretched by no more than an additive factor of \alpha.
Edit intent: clarity
Original:  Specifically, we show that a weighted graph G contains all-pairs (pairwise) +2W and +4W weighted spanners of size O(n^{3/2}) and O (n^{7/5}) (O(np^{1/3}) and O(np^{2/7})) respectively.
Revised:  Specifically, we show that a weighted graph G contains all-pairs (pairwise) +2W and +4W weighted spanners of size O(n^{3/2}) and (n^{7/5}) (O(np^{1/3}) and O(np^{2/7})) respectively.
Edit intent: fluency
Original: A recent research theme has been the development of automatic methods to minimize robots' resource footprints.
Revised: Recent research has examined algorithms to minimize robots' resource footprints.
Edit intent: clarity
Original:  In particular, the class of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been studied and methods developed for automatically reducing their space requirements  .
Revised:  The class of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been studied and methods developed for automatically reducing their space requirements .
Edit intent: coherence
Original:  In particular, the class of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been studied and methods developed for automatically reducing their space requirements  .
Revised:  In particular, the class of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been studied and methods for reducing their space requirements .
Edit intent: clarity
Original:  In particular, the class of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been studied and methods developed for automatically reducing their space requirements  .
Revised:  In particular, the class of combinatorial filters (discrete variants of widely-used probabilistic estimators) has been studied and methods developed for automatically reducing their space requirements introduced .
Edit intent: clarity
Original:  In addressing the new---but still NP-complete---problem of minimization of cover filters, this paper shows that three of the concepts previously believed to be true about combinatorial filters (and actually conjectured, claimed, or assumed to be) are in fact false.
Revised:  In addressing the new -- but still NP-complete -- problem of minimization of cover filters, this paper shows that three of the concepts previously believed to be true about combinatorial filters (and actually conjectured, claimed, or assumed to be) are in fact false.
Edit intent: fluency
Original:  In addressing the new---but still NP-complete---problem of minimization of cover filters, this paper shows that three of the concepts previously believed to be true about combinatorial filters (and actually conjectured, claimed, or assumed to be) are in fact false.
Revised:  In addressing the new---but still NP-complete---problem of minimization of cover filters, this paper shows that multiple concepts previously believed to be true about combinatorial filters (and actually conjectured, claimed, or assumed to be) are in fact false.
Edit intent: clarity
Original:  In addition to solving the more general problem, the algorithm we present also corrects flaws present in all prior filter reduction methods.
Revised:  In addition to solving the more general problem, the algorithm also corrects flaws present in all prior filter reduction methods.
Edit intent: clarity
Original:  The algorithm also forms a promising basis for practical future development as it involves a reduction to SAT .
Revised:  In employing SAT, the algorithm provides a promising basis for practical future development as it involves a reduction to SAT .
Edit intent: clarity
Original:  The algorithm also forms a promising basis for practical future development as it involves a reduction to SAT .
Revised:  The algorithm also forms a promising basis for future practical development .
Edit intent: clarity
Original:  The proposed approach utilizes a mixed integer programming (MIP) formulation of neural models which includes a continuous importance score computed for each neuron in  the network.
Revised:  The proposed approach utilizes a mixed integer programming (MIP) for assigning importance scores to each neuron in the network.
Edit intent: clarity
Original:  The optimization in MIPsolver minimizes the number of critical neurons (i.e., with high importance score) that need to be kept for maintaining the overall accuracy of the model .
Revised:  The optimization in MIPsolver minimizes the number of critical neurons (i.e., with high importance score) that need to be kept for maintaining the overall accuracy of the trained neural network .
Edit intent: clarity
Original:  Further, the proposed formulation generalizes the recently considered lottery ticket optimization by identifying multiple "lucky" sub-networks resulting in optimized architecture that not only perform well on a single dataset, but also generalize across multiple ones upon retraining of network weights.
Revised:  Further, the proposed formulation generalizes the recently considered lottery ticket optimization by identifying multiple "lucky" sub-networks resulting in optimized architecture that not only performs well on a single dataset, but also generalize across multiple ones upon retraining of network weights.
Edit intent: fluency
Original:  Further, the proposed formulation generalizes the recently considered lottery ticket optimization by identifying multiple "lucky" sub-networks resulting in optimized architecture that not only perform well on a single dataset, but also generalize across multiple ones upon retraining of network weights.
Revised:  Further, the proposed formulation generalizes the recently considered lottery ticket optimization by identifying multiple "lucky" sub-networks resulting in optimized architecture that not only perform well on a single dataset, but also generalizes across multiple ones upon retraining of network weights.
Edit intent: fluency
Original:  Here we develop a method for extracting recurrences from functional programs in a higher-order language with let-polymorphism that provably bound their operational cost.
Revised:  Here we develop a method for extracting recurrences from functional programs in a higher-order language with let-polymorphism 
Edit intent: clarity
Original:  We give several examples of different models that formally justify various informal extract-a-recurrence-and-solve cost analyses to show the applicability of our approach.
Revised:  We give several examples of different models that formally justify various informal cost analyses to show the applicability of our approach.
Edit intent: clarity
Original:  These vulnerabilities, confirmed by ICAO, enable an ePassport holder who recently passed through a checkpoint to be reidentified without openning their ePassport.
Revised:  These vulnerabilities, confirmed by ICAO, enable an ePassport holder who recently passed through a checkpoint to be reidentified without opening their ePassport.
Edit intent: fluency
Original:  In order to tackle such bisimilarity problems, we develop here a chain of methods for the applied pi-calculus including a symbolic under approximation of bisimilarity, called open bisimilarity, and a modal logic, called classical FM, for describing and certifying attacks.
Revised:  In order to tackle such bisimilarity problems, we develop here a chain of methods for the applied \pi-calculus including a symbolic under approximation of bisimilarity, called open bisimilarity, and a modal logic, called classical FM, for describing and certifying attacks.
Edit intent: fluency
Original:  In order to tackle such bisimilarity problems, we develop here a chain of methods for the applied pi-calculus including a symbolic under approximation of bisimilarity, called open bisimilarity, and a modal logic, called classical FM, for describing and certifying attacks.
Revised:  In order to tackle such bisimilarity problems, we develop here a chain of methods for the applied pi-calculus including a symbolic under-approximation of bisimilarity, called open bisimilarity, and a modal logic, called classical FM, for describing and certifying attacks.
Edit intent: fluency
Original:  This paper explains how bisimilarity was used to discover these vulnerabilities, which exploit the BAC protocol -- the original ICAO 9303 standard ePassport authentication protocol -- and remains valid for the PACE protocol, which improves on the security of BAC in the latest ICAO 9303 standards.
Revised:  This paper explains how bisimilarity was used to discover these vulnerabilities, which exploit the BAC protocol - the original ICAO 9303 standard ePassport authentication protocol -- and remains valid for the PACE protocol, which improves on the security of BAC in the latest ICAO 9303 standards.
Edit intent: fluency
Original:  This paper explains how bisimilarity was used to discover these vulnerabilities, which exploit the BAC protocol -- the original ICAO 9303 standard ePassport authentication protocol -- and remains valid for the PACE protocol, which improves on the security of BAC in the latest ICAO 9303 standards.
Revised:  This paper explains how bisimilarity was used to discover these vulnerabilities, which exploit the BAC protocol -- the original ICAO 9303 standard ePassport authentication protocol - and remains valid for the PACE protocol, which improves on the security of BAC in the latest ICAO 9303 standards.
Edit intent: fluency
Original:  In practice, each service consists of a predetermined sequence of functions, called a service function chain (SFC), running on a cloud environment.
Revised:  In practice, each service consists of a predetermined sequence of functions, called service function chain (SFC), running on a cloud environment.
Edit intent: fluency
Original: It is often useful to tap secondary information from a running R script.
Revised: It is often useful to tap information from a running R script.
Edit intent: clarity
Original:  Obvious use cases include logging, and profiling of time or memoryconsuption .
Revised:  Obvious use cases include monitoring the consumption of resources (time, memory) and logging .
Edit intent: clarity
Original:  Perhaps less obvious cases include tracking changes in R objects or collecting output of unit tests (assertions) .
Revised:  Perhaps less obvious cases include tracking changes in R objects orcollecting output of unit tests (assertions) .
Edit intent: fluency
Original:  Perhaps less obvious cases include tracking changes in R objects or collecting output of unit tests (assertions) .
Revised:  Perhaps less obvious cases include tracking changes in R objects or collecting output of unit tests .
Edit intent: clarity
Original:  We thus present Time-Triggered Wireless (TTW), a wireless architecture for multi-mode CPS that offers reliable communication with guarantees on end-to-end delays and jitter among distributed applications executing on low-cost, low-power embedded devices.
Revised:  We thus present Time-Triggered Wireless (TTW), a wireless architecture for multi-mode CPS that offers reliable communication with guarantees on end-to-end delays among distributed applications executing on low-cost, low-power embedded devices.
Edit intent: clarity
Original:  We achieve this by exploiting the high reliability and deterministic behavior of a synchronous-transmission-based communication stack we design, and by coupling the timings of distributed task executions and message exchanges across the wireless network by solving a novel co-scheduling problem.
Revised:  We achieve this by exploiting the high reliability and deterministic behavior of a synchronous transmission based communication stack we design, and by coupling the timings of distributed task executions and message exchanges across the wireless network by solving a novel co-scheduling problem.
Edit intent: fluency
Original:  In this work, we shall focus on solving one representative query task, namely dynamic skyline query , in a secure manner over the cloud.
Revised:  In this work, we shall focus on solving one representative query task, namely dynamic skyline query , in a secure manner over the cloud.
Edit intent: fluency
Original:  To this end, we present a novel framework called scale .
Revised:  To this end, we present a novel framework called SCALE .
Edit intent: fluency
Original:  Empirical study over a series of datasets demonstrates that our framework improves the efficiency of query processing by nearly \textbf{three orders of magnitude compared to the state-of-the-art.
Revised:  Empirical study over a series of datasets demonstrates that our framework improves the efficiency of query processing by nearly \textbf{three orders of magnitude compared to the state-of-the-art.
Edit intent: fluency
Original:  A biologically-constrained Hebbian learning further improved the SNN performance in tracking a moving target.
Edit intent: coherence
Original:  Here, we report the tracking performance of the robotic head and show that the robotic eye kinematics are similar to those reported in human eye studies  .
Revised:  Here, we report the robot's target tracking ability, demonstrate that its eye kinematics are similar to those reported in human eye studies .
Edit intent: clarity
Original:  This work contributes to our ongoing effort to develop energy-efficient neuromorphic SNN and harness their emerging intelligence to control biomimetic robots with versatility and robustness.
Revised:  This work aligns with our ongoing effort to develop energy-efficient neuromorphic SNN and harness their emerging intelligence to control biomimetic robots with versatility and robustness.
Edit intent: clarity
Original:  This work contributes to our ongoing effort to develop energy-efficient neuromorphic SNN and harness their emerging intelligence to control biomimetic robots with versatility and robustness.
Revised:  This work contributes to our ongoing effort to develop energy-efficient neuromorphic SNNs and harness their emerging intelligence to control biomimetic robots with versatility and robustness.
Edit intent: fluency
Original:  Previous work has focused on static networks with an apriori fixed message size.
Revised:  Previous work has focused on static networks with an a priori fixed message size.
Edit intent: fluency
Original:  In this work  we consider the synthesis problem for a system of two nodes communicating in rounds over a dynamic link whose message size is not bounded.
Revised:  In this work , we consider the synthesis problem for a system of two nodes communicating in rounds over a dynamic link whose message size is not bounded.
Edit intent: fluency
Original:  Motivated by communication buses with direct acknowledge mechanisms  we further assume that nodes are aware of which messages have been delivered.
Revised:  Motivated by communication buses with direct acknowledge mechanisms , we further assume that nodes are aware of which messages have been delivered.
Edit intent: fluency
Original: In electricity markets futures deliver the underlying over a period and thus function as a swap contract .
Revised: In electricity markets , futures contracts typically function as a swap since they deliver the underlying over a period and thus function as a swap contract .
Edit intent: clarity
Original: In electricity markets futures deliver the underlying over a period and thus function as a swap contract .
Revised: In electricity markets futures deliver the underlying over a period of time .
Edit intent: clarity
Original:  In this paper  we introduce a market price of risk for delivery periods of electricity swaps .
Revised:  In this paper , we introduce a market price of risk for delivery periods of electricity swaps .
Edit intent: fluency
Original:  In this paper  we introduce a market price of risk for delivery periods of electricity swaps .
Revised:  In this paper we introduce a market price for the delivery periods of electricity swaps .
Edit intent: clarity
Original:  In particular, we suggest a weighted geometric average of an artificial geometric electricity futures price over the corresponding delivery period.
Revised:  In particular, we suggest a weighted geometric averaging of an artificial geometric electricity futures price over the corresponding delivery period.
Edit intent: fluency
Original:  This leads to a geometric electricity swap price dynamics without any approximation requirements .
Revised:  Without any need for approximations, this averaging results in geometric swap price dynamics without any approximation requirements .
Edit intent: clarity
Original:  This leads to a geometric electricity swap price dynamics without any approximation requirements .
Revised:  This leads to a geometric electricity swap price dynamics .
Edit intent: clarity