wanyu/IteraTeR_v2 huggingface dataset:
Original:  For the arboricity game defined on the same graph, a partial order can be defined on the prime sets according to core allocations, and then the nucleolus can be computed efficiently by solving only two linear programs in the Maschlerscheme 21, 22%DIFDELCMD < ]%%% . In addition to computing the  nucleolus of arboricity games  , the prime partition provides an analogous graph decomposition to 29, 30 , which complements another line of research .
Revised:  For the arboricity game defined on the same graph, a partial order can be defined on the prime sets according to core allocations, and then the nucleolus can be computed efficiently by solving only two linear programs in the Maschlerscheme %DIFDELCMD < ]%%% . In addition to computing the nucleolus of arboricity games , the prime partition provides an analogous graph decomposition to 29, 30 , which complements another line of research .
Edit intent: coherence
Original:  For the arboricity game defined on the same graph, a partial order can be defined on the prime sets according to core allocations, and then the nucleolus can be computed efficiently by solving only two linear programs in the Maschlerscheme 21, 22%DIFDELCMD < ]%%% . In addition to computing the  nucleolus of arboricity games  , the prime partition provides an analogous graph decomposition to 29, 30 , which complements another line of research .
Revised:  For the arboricity game defined on the same graph, a partial order can be defined on the prime sets according to core allocations, and then the nucleolus can be computed efficiently by solving only two linear programs in the Maschlerscheme 21, 22%DIFDELCMD < ]%%% . In addition to computing the nucleolus of arboricity games , the prime partition provides an analogous graph decomposition to , which complements another line of research .
Edit intent: coherence
Original:  Alas , misinformation on COVID-19 is frequently spread on social media.
Revised:  Also , misinformation on COVID-19 is frequently spread on social media.
Edit intent: fluency
Original:  The dataset contains a rich set of multimedia information for each microblog including ground-truth label, textual, visual, response, and social network information.
Revised:  The dataset contains a rich set of multimedia information for each microblog including ground-truth label, textual, visual, temporal, and network information.
Edit intent: clarity
Original:  The dataset is available at URL with measures of protecting users' privacy.
Revised:  The dataset is available at URL 
Edit intent: coherence
Original: Large scale power systems are comprised of regional utilities with IIoT enabled assets that stream sensor readings in real time.
Revised: Large scale power systems are comprised of regional utilities with assets that stream sensor readings in real time.
Edit intent: clarity
Original:  Existing blockchain-based boardroom voting implementation called Open Voting Network (OVN)  supports only two candidates.
Revised:  Existing blockchain-based boardroom voting solution called Open Voting Network (OVN) supports only two candidates.
Edit intent: clarity
Original:  Existing blockchain-based boardroom voting implementation called Open Voting Network (OVN)  supports only two candidates.
Revised:  Existing blockchain-based boardroom voting implementation called Open Voting Network (OVN) provides the privacy of votes and perfect ballot secrecy, but it supports only two candidates.
Edit intent: coherence
Original:  Finally, we compare our implementation with OVN and show that our work decreases the costs for voters by 13.5 \% in terms of gas consumption \\%DIF > in terms of gas consumption.
Revised:  Finally, we compare our implementation with OVN and show that our work decreases the costs for voters by 13.5 \\%DIF > in terms of gas consumption.
Edit intent: coherence
Original: We investigate the problem of equilibrium price formation in an incomplete securities market.
Revised: We study an equilibrium-based continuous asset pricing problem for the securities market.
Edit intent: clarity
Original: Various noise models have been developed in quantum computing study to describe the propagation and effect of the noise from imperfect implementation of hardware.
Revised: Various noise models have been developed in quantum computing study to describe the propagation and effect of the noise which is caused by imperfect implementation of hardware.
Edit intent: clarity
Original:  By charactering the device errors in this way, we further improve error filters accordingly . Experiments conducted on IBM's quantum computing devices suggest that our approach provides better error-mitigation performance than existing error-mitigation techniques , in which error rates are estimated as deterministic values.
Revised:  By charactering the device errors in this way, we can further improve the accuracy of quantum error mitigation . Experiments conducted on IBM's quantum computing devices suggest that our approach provides better error-mitigation performance than existing error-mitigation techniques , in which error rates are estimated as deterministic values.
Edit intent: clarity
Original:  By charactering the device errors in this way, we further improve error filters accordingly . Experiments conducted on IBM's quantum computing devices suggest that our approach provides better error-mitigation performance than existing error-mitigation techniques , in which error rates are estimated as deterministic values.
Revised:  By charactering the device errors in this way, we further improve error filters accordingly . Experiments conducted on IBM's quantum computing devices suggest that our approach provides better error mitigation performance than existing error-mitigation techniques , in which error rates are estimated as deterministic values.
Edit intent: fluency
Original:  However,  learning models have been shown to be susceptible to input manipulations called adversarial examples.
Revised:  However, machine learning models have been shown to be susceptible to input manipulations called adversarial examples.
Edit intent: clarity
Original:  Yet , the trading domain remains largely unexplored in the context of adversarial learning.
Revised:  Despite this risk , the trading domain remains largely unexplored in the context of adversarial learning.
Edit intent: clarity
Original:  This is mainly because of the rapid changes in the market which impair the attacker's ability to create a real-time attack.
Edit intent: coherence
Original:  In this study, we present a realistic scenario in which an attacker gains control of an algorithmic trading bots by manipulating the input data stream in real-time .
Revised:  In this study, we present a realistic scenario in which an attacker gains control of an algorithmic trading bots by manipulating the input data stream in real time .
Edit intent: fluency
Original:  The attacker creates an universal perturbation that is agnostic to the target model and time of use, while also remaining imperceptible.
Revised:  The attacker creates a universal perturbation that is agnostic to the target model and time of use, while also remaining imperceptible.
Edit intent: fluency
Original:  The attacker creates an universal perturbation that is agnostic to the target model and time of use, while also remaining imperceptible.
Revised:  The attacker creates an universal perturbation that is agnostic to the target model and time of use, which, when added to the input stream, remains imperceptible.
Edit intent: clarity
Original:  We evaluate our attack on a real-world market data stream and target three different trading architectures .
Revised:  We evaluate our attack on a real-world market data stream and target three different trading algorithms .
Edit intent: clarity
Original:  We show that  our perturbation can fool the model at future unseen data points, in both white-box and black-box settings.
Revised:  We show that our perturbation can fool the trading algorithms at future unseen data points, in both white-box and black-box settings.
Edit intent: clarity
Original:  We believe these findings should serve as an alert to the finance community about the threats in this area and prompt further research on the risks associated with using automated learning models in the finance domain.
Revised:  We believe these findings should serve as an alert to the finance community about the threats in this area and promote further research on the risks associated with using automated learning models in the finance domain.
Edit intent: clarity
Original:  We believe these findings should serve as an alert to the finance community about the threats in this area and prompt further research on the risks associated with using automated learning models in the finance domain.
Revised:  We believe these findings should serve as an alert to the finance community about the threats in this area and prompt further research on the risks associated with using automated learning models in the trading domain.
Edit intent: clarity
Original:  We present two reconstruction modules, an encoder decoder-based architecture and a finite state transducer-based model .
Revised:  We present a finite state transducer-based model .
Edit intent: clarity
Original:  We demonstrate the efficacy of our proposed techniques using ASR systems for two Indian languages, Gujarati and Telugu  .
Revised:  We demonstrate the efficacy of our proposed technique using ASR systems for two Indian languages, Gujarati and Telugu .
Edit intent: fluency
Original:  Our mechanism is based on locality sensitive hashing (LSH) and the randomized response, and can be applied to  metrics including the angular distance (or cosine) metric, Jaccard metric, Earth Mover's metric, and l_p metric.
Revised:  Our mechanism is based on locality sensitive hashing (LSH) and the randomized response, and can be applied to a wide variety of metrics including the angular distance (or cosine) metric, Jaccard metric, Earth Mover's metric, and l_p metric.
Edit intent: clarity
Original:  Moreover, our mechanism works well for personal data in a high-dimensional space.
Revised:  Moreover, our mechanisms work well for personal data in a high-dimensional space.
Edit intent: fluency
Original:  We theoretically analyze the privacy property of our mechanism, and prove that it provides concentrated and probabilistic versions of extended DP . Then we apply our mechanism to friend matching based on personal data in a high-dimensional space with an angular distance metric.
Revised:  We theoretically analyze the privacy properties of our mechanisms, introducing new versions of concentrated and probabilistic versions of extended DP . Then we apply our mechanism to friend matching based on personal data in a high-dimensional space with an angular distance metric.
Edit intent: clarity
Original:  We theoretically analyze the privacy property of our mechanism, and prove that it provides concentrated and probabilistic versions of extended DP . Then we apply our mechanism to friend matching based on personal data in a high-dimensional space with an angular distance metric.
Revised:  We theoretically analyze the privacy property of our mechanism, and prove that it provides concentrated and probabilistic versions of extended DP . Then we apply our mechanisms to friend matching based on personal data in a high-dimensional space with an angular distance metric.
Edit intent: clarity
Original: Extended differential privacy, which is a generalization of standard differential privacy (DP) using a general metric rather than the Hamming metric, has been widely studied to provide rigorous privacy guarantees while keeping high utility.
Revised: Extended differential privacy, a generalization of standard differential privacy (DP) using a general metric rather than the Hamming metric, has been widely studied to provide rigorous privacy guarantees while keeping high utility.
Edit intent: coherence
Original:  In this paper, we propose two new extended DP mechanisms for privacy-preserving LSH. Our first mechanism is based on the multivariate Laplace mechanism and is designed for the Euclidean distance metric.
Revised:  In this paper, we propose a mechanism providing extended DP with a wide range of metrics. Our mechanism is based on the multivariate Laplace mechanism and is designed for the Euclidean distance metric.
Edit intent: clarity
Original:  Moreover, our mechanisms work well for personal data in a high-dimensional space.
Revised:  Moreover, our mechanism works well for personal data in a high-dimensional space.
Edit intent: fluency
Original:  We theoretically analyze the privacy properties of our mechanisms , introducing new versions of concentrated and probabilistic extended DP to explain the guarantees provided.
Revised:  We theoretically analyze the privacy properties of our mechanism , introducing new versions of concentrated and probabilistic extended DP to explain the guarantees provided.
Edit intent: fluency
Original:  Finally, we apply our mechanisms to friend matching based on personal data in a high-dimensional space with an angular distance metric  .
Revised:  Finally, we apply our mechanism to friend matching based on personal data in a high-dimensional space with an angular distance metric .
Edit intent: fluency
Original:  Finally, we apply our mechanisms to friend matching based on personal data in a high-dimensional space with an angular distance metric  .
Revised:  Finally, we apply our mechanisms to friend matching based on high-dimensional personal data with an angular distance metric .
Edit intent: clarity
Original: Extended differential privacy, a generalization of standard differential privacy (DP) using a general metric rather than the Hamming metric , has been widely studied to provide rigorous privacy guarantees while keeping high utility.
Revised: Extended differential privacy, a generalization of standard differential privacy (DP) using a general metric , has been widely studied to provide rigorous privacy guarantees while keeping high utility.
Edit intent: coherence
Original:  However, existing works on extended DP focus on a specific metric such as the Euclidean metric , the l_1 metric, and the Earth Mover's metric, and cannot be applied to other metrics . Consequently, existing extended DP mechanisms are limited to a small number of applications such as location-based services and document processing.
Revised:  However, existing works on extended DP are limited to few metrics such as the Euclidean metric , the l_1 metric, and the Earth Mover's metric, and cannot be applied to other metrics . Consequently, existing extended DP mechanisms are limited to a small number of applications such as location-based services and document processing.
Edit intent: clarity
Original:  However, existing works on extended DP focus on a specific metric such as the Euclidean metric , the l_1 metric, and the Earth Mover's metric, and cannot be applied to other metrics . Consequently, existing extended DP mechanisms are limited to a small number of applications such as location-based services and document processing.
Revised:  However, existing works on extended DP focus on a specific metric such as the Euclidean metric . Consequently, existing extended DP mechanisms are limited to a small number of applications such as location-based services and document processing.
Edit intent: coherence
Original:  However, existing works on extended DP focus on a specific metric such as the Euclidean metric , the l_1 metric, and the Earth Mover's metric, and cannot be applied to other metrics . Consequently, existing extended DP mechanisms are limited to a small number of applications such as location-based services and document processing.
Revised:  However, existing works on extended DP focus on a specific metric such as the Euclidean metric , the l_1 metric, and the Earth Mover's metric, and cannot be applied to other metrics . Consequently, they have only a small number of applications such as location-based services and document processing.
Edit intent: clarity
Original:  Our mechanism is based on locality sensitive hashing (LSH) and randomized response, and can be applied to a wide variety of metrics including the angular distance (or cosine) metric, Jaccard metric, Earth Mover's metric, and l_p metric.
Revised:  Our mechanism is based on locality sensitive hashing (LSH) , which can be applied to a wide variety of metrics including the angular distance (or cosine) metric, Jaccard metric, Earth Mover's metric, and l_p metric.
Edit intent: coherence
Original:  Our mechanism is based on locality sensitive hashing (LSH) and randomized response, and can be applied to a wide variety of metrics including the angular distance (or cosine) metric, Jaccard metric, Earth Mover's metric, and l_p metric.
Revised:  Our mechanism is based on locality sensitive hashing (LSH) and randomized response, and can be applied to the angular distance (or cosine) metric, Jaccard metric, Earth Mover's metric, and l_p metric.
Edit intent: clarity
Original:  Finally, we apply our mechanism to friend matching based on high-dimensional personal data with an angular distance metric in the local model  .
Revised:  Finally, we apply our mechanism to friend matching based on high-dimensional personal data with angular distance in the local model .
Edit intent: clarity
Original:  We also show through experiments that our mechanism makes possible friend matching with  rigorous privacy guarantees and high utility .
Revised:  Then we show that our mechanisms enable friend matching with rigorous privacy guarantees and high utility .
Edit intent: clarity
Original:  However, existing works on extended DP are limited to few metrics  such as the Euclidean metric.
Revised:  However, existing works on extended DP are limited to few metrics , such as the Euclidean metric.
Edit intent: fluency
Original:  Consequently, they have only a small number of applications  such as location-based services and document processing.
Revised:  Consequently, they have only a small number of applications , such as location-based services and document processing.
Edit intent: fluency
Original:  EHR data are typically stored in a relational database, which can also be converted to a Directed Acyclic Graph (DAG) , allowing two approaches for EHR QA: Table-based QA and Knowledge Graph-based QA.
Revised:  EHR data are typically stored in a relational database, which can also be converted to a directed acyclic graph , allowing two approaches for EHR QA: Table-based QA and Knowledge Graph-based QA.
Edit intent: clarity
Original:   To validate our hypothesis, we first construct EHR QA datasets based on MIMIC-III, where the same question-answer pairs are represented in SQL ( table-based ) and SPARQL (graph-based), respectively.
Revised:  To validate our hypothesis, we first construct EHR QA datasets (graph-based VS table-based ) and SPARQL (graph-based), respectively.
Edit intent: clarity
Original:  We then test a state-of-the-art EHR QA model on both datasets where the model demonstrated superior QA performance on the SPARQL version .
Revised:  We then test a state-of-the-art EHR QA model on all datasets where the model demonstrated superior QA performance on the SPARQL version .
Edit intent: clarity
Original:  Finally, we open-source both MIMICSQL* and MIMIC-SPARQL* to encourage further EHR QA research in both direction
Revised:  Finally, we open-source both MIMICSQL* and MIMIC-SPARQL* to encourage further EHR QA research in both directions.
Edit intent: fluency
Original: We study the family of ellipse-inscribed triangles with two vertices V1,V2 fixed on the boundary and a third one which sweeps it.
Revised: We study a family of ellipse-inscribed triangles with two vertices V1,V2 fixed on the boundary and a third one which sweeps it.
Edit intent: fluency
Original: We study the family of ellipse-inscribed triangles with two vertices V1,V2 fixed on the boundary and a third one which sweeps it.
Revised: We study the family of ellipse-inscribed triangles with two vertices V1,V2 fixed on the ellipse boundary while a third one which sweeps it.
Edit intent: clarity
Original: We study a family of ellipse-inscribed triangles with two vertices V1,V2 fixed on the ellipse boundary while a third one which sweeps it.
Revised: We study a family of ellipse-inscribed triangle families with two vertices V1,V2 fixed on the ellipse boundary while a third one which sweeps it.
Edit intent: clarity
Original: We study a family of ellipse-inscribed triangles with two vertices V1,V2 fixed on the ellipse boundary while a third one which sweeps it.
Revised: We study a family of ellipse-inscribed triangles with two vertices fixed to the ellipse boundary while a third one which sweeps it.
Edit intent: clarity
Original: We study a family of ellipse-inscribed triangles with two vertices V1,V2 fixed on the ellipse boundary while a third one which sweeps it.
Revised: We study a family of ellipse-inscribed triangles with two vertices V1,V2 fixed on the ellipse boundary and a third one which sweeps it.
Edit intent: coherence
Original:  We prove that: (i) if a triangle center is a fixed linear combination of barycenter and orthocenter, its locus over the family is an ellipse;
Revised:  We prove that: (i) if a triangle center is a fixed linear combination of barycenter and orthocenter, its locus is an ellipse;
Edit intent: clarity
Original:  (ii) over the 1d family of said linear combinations, loci centers sweep a line;
Revised:  (ii) and that over the family of said linear combinations, loci centers sweep a line;
Edit intent: coherence
Original:  (ii) over the 1d family of said linear combinations, loci centers sweep a line;
Revised:  (ii) over the 1d family of said linear combinations, the centers of said loci sweep a line;
Edit intent: clarity
Original:  Additionally, we study the external envelope of elliptic loci for fixed V1 and over all V2 on the ellipse .
Revised:  Additionally, we study invariants of the envelope of elliptic loci for fixed V1 and over all V2 on the ellipse .
Edit intent: clarity
Original:  Recent breakthroughs on this challenge have gravitated around a single dataset, MUSDB, that is limited to four instrument classes only.
Revised:  Recent breakthroughs on this challenge have gravitated around a single dataset, MUSDB, limited to four instrument classes only.
Edit intent: coherence
Original:  However larger datasets are costly and time-consuming in terms of collecting data and training deep networks .
Revised:  However larger datasets are costly and time-consuming in collecting data and training deep networks .
Edit intent: clarity
Original:  However larger datasets are costly and time-consuming in terms of collecting data and training deep networks .
Revised:  However larger datasets are costly and time-consuming in terms of collecting data and training deep neural networks (DNNs) .
Edit intent: clarity
Original:  In this work, we propose a fast method for evaluating the separability of instruments in any dataset or song, and for any instrument without the need to train and tune a deep neural network .
Revised:  In this work, we propose a fast method to evaluate the separability of instruments in any dataset or song, and for any instrument without the need to train and tune a deep neural network .
Edit intent: fluency
Original:  In this work, we propose a fast method for evaluating the separability of instruments in any dataset or song, and for any instrument without the need to train and tune a deep neural network .
Revised:  In this work, we propose a fast method for evaluating the separability of instruments in any dataset without training and tuning a DNN .
Edit intent: clarity
Original:  This separability measure helps selecting appropriate samples for the efficient training of neural networks.
Revised:  This separability measure helps to select appropriate samples for the efficient training of neural networks.
Edit intent: fluency