wanyu/IteraTeR_v2 huggingface dataset:
Original:  To address this gap, in this paper we study QAnon from the perspective of "Q" themself.
Revised:  To address this gap, we study QAnon from the perspective of "Q" themself.
Edit intent: coherence
Original:  Specifically, we build a dataset of 4,949 canonical Q drops collected from six "aggregation sites," which curate and archive them from their original posting to anonymous and ephemeral image boards.
Revised:  We build a dataset of 4,949 canonical Q drops collected from six "aggregation sites," which curate and archive them from their original posting to anonymous and ephemeral image boards.
Edit intent: coherence
Original:  We then analyze the contents of the Q dropsthemselves, identifying topics of discussion , as well as finding statistically significant indications that drops were not authored by a single individual.
Revised:  We then analyze the Q drops' contents to identify topics of discussion , as well as finding statistically significant indications that drops were not authored by a single individual.
Edit intent: clarity
Original:  We then analyze the contents of the Q dropsthemselves, identifying topics of discussion , as well as finding statistically significant indications that drops were not authored by a single individual.
Revised:  We then analyze the contents of the Q dropsthemselves, identifying topics of discussion and find statistically significant indications that drops were not authored by a single individual.
Edit intent: coherence
Original:  Finally, we look at how posts on Reddit are used to disseminate Q drops to a wider audience .
Revised:  Finally, we look at how posts on Reddit are used to disseminate Q drops to wider audiences .
Edit intent: fluency
Original: Differential abundance tests in the compositional data are essential and fundamental tasks in various biomedical applications, such as single-cell, bulk RNA-seq, and microbiome data analysis.
Revised: Differential abundance tests in compositional data are essential and fundamental tasks in various biomedical applications, such as single-cell, bulk RNA-seq, and microbiome data analysis.
Edit intent: fluency
Original:  Despite the recent developments in the fields, differential abundance analysis in the compositional data is still a complicated and unsolved statistical problem  because of the compositional constraint and prevalent zero counts in the dataset.
Revised:  However, despite the recent developments in the fields, differential abundance analysis in the compositional data is still a complicated and unsolved statistical problem because of the compositional constraint and prevalent zero counts in the dataset.
Edit intent: coherence
Original:  Despite the recent developments in the fields, differential abundance analysis in the compositional data is still a complicated and unsolved statistical problem  because of the compositional constraint and prevalent zero counts in the dataset.
Revised:  Despite the recent developments in these fields, differential abundance analysis in the compositional data is still a complicated and unsolved statistical problem because of the compositional constraint and prevalent zero counts in the dataset.
Edit intent: fluency
Original:  Despite the recent developments in the fields, differential abundance analysis in the compositional data is still a complicated and unsolved statistical problem  because of the compositional constraint and prevalent zero counts in the dataset.
Revised:  Despite the recent developments in the fields, differential abundance analysis in compositional data remains a complicated and unsolved statistical problem because of the compositional constraint and prevalent zero counts in the dataset.
Edit intent: fluency
Original:  Despite the recent developments in the fields, differential abundance analysis in the compositional data is still a complicated and unsolved statistical problem  because of the compositional constraint and prevalent zero counts in the dataset.
Revised:  Despite the recent developments in the fields, differential abundance analysis in the compositional data is still a complicated and unsolved statistical problem , because of the compositional constraint and prevalent zero counts in the dataset.
Edit intent: fluency
Original:  To demonstrate its practical merits , we apply the new test to several numerical examples using both simulated and real datasets  .
Revised:  Finally , we apply the new test to several numerical examples using both simulated and real datasets .
Edit intent: coherence
Original:  To demonstrate its practical merits , we apply the new test to several numerical examples using both simulated and real datasets  .
Revised:  To demonstrate its practical merits , we apply the new test to several numerical examples using simulated and real datasets .
Edit intent: clarity
Original:  To demonstrate its practical merits , we apply the new test to several numerical examples using both simulated and real datasets  .
Revised:  To demonstrate its practical merits , we apply the new test to several numerical examples using both simulated and real datasets to demonstrate its practical merits .
Edit intent: fluency
Original:  The individual behavior of an autonomous vehicle as an intelligent self-interested decision-maker can be analyzed under a non-cooperative differential game model of the convoy .
Revised:  Under the non-cooperative differential game model of the convoy .
Edit intent: clarity
Original:  The receding horizon Nash equilibrium of the linear-quadratic differential game provides  a distributed state-feedback control strategy for the convoy .
Revised:  The receding horizon Nash equilibrium of the linear-quadratic differential game provides the convoy a distributed state-feedback control strategy for the convoy .
Edit intent: fluency
Original:  The receding horizon Nash equilibrium of the linear-quadratic differential game provides  a distributed state-feedback control strategy for the convoy .
Revised:  The receding horizon Nash equilibrium of the linear-quadratic differential game provides a distributed state-feedback control strategy .
Edit intent: clarity
Original:  This approach suffers a fundamental issue that neither the existence nor the uniqueness of a Nash equilibrium is guaranteed, so the convoy control.
Revised:  This approach suffers a fundamental issue that neither a Nash equilibrium's existence nor the uniqueness of a Nash equilibrium is guaranteed, so the convoy control.
Edit intent: clarity
Original:  Simulations illustrate the effectiveness of the presented convoy control scheme .
Revised:  Simulations illustrate the effectiveness of the presented convey control scheme and how it well suits automated highway driving scenarios .
Edit intent: clarity
Original:  The scRNA-seq community has developed many computational methods to detect doublets from scRNA-seq data.
Revised:  There are several computational methods for detecting doublets from scRNA-seq data.
Edit intent: clarity
Original:  Here, we summarize our benchmarking procedures into a protocol for researchers to systematically benchmark doublet-detection methods in terms of detection accuracy, impacts on downstream analyses, and computational efficiency .
Revised:  Here, we present a protocol of using DoubletCollection to benchmark doublet-detection methods in terms of detection accuracy, impacts on downstream analyses, and computational efficiency .
Edit intent: clarity
Original:  Here, we summarize our benchmarking procedures into a protocol for researchers to systematically benchmark doublet-detection methods in terms of detection accuracy, impacts on downstream analyses, and computational efficiency .
Revised:  Here, we summarize our benchmarking procedures into a protocol for researchers to systematically benchmark doublet-detection methods .
Edit intent: clarity
Original:  There are several computational methods for detecting doublets from scRNA-seq data.
Revised:  Computational methods have been developed for detecting doublets from scRNA-seq data.
Edit intent: clarity
Original:  We develop an R package DoubletCollection to integrate the installation and execution of those methods.
Revised:  We developed an R package DoubletCollection to integrate the installation and execution of those methods.
Edit intent: fluency
Original: Research in automatic speaker recognition (SR) has been undertaken for several decades, reaching great performance.
Revised: Adversarial examples to speaker recognition (SR) has been undertaken for several decades, reaching great performance.
Edit intent: clarity
Original:  This paper examines how state-of-the-art speaker identification (SID) systems are vulnerable to adversarial attacksand how to defend against them.
Revised:  Moreover, it is of greater importance to propose defenses that can protect the systems against these attacks. Addressing these concerns, this paper at first investigates how state-of-the-art speaker identification (SID) systems are vulnerable to adversarial attacksand how to defend against them.
Edit intent: coherence
Original: We investigated adversarial attacks common in the literature like fast gradient sign method (FGSM), iterative-FGSM / basic iterative method (BIM)  and Carlini-Wagner (CW) . Furthermore, we propose four pre-processing defenses against these attacks- randomized smoothing, DefenseGAN, variational autoencoder (VAE) and WaveGAN vocoder.
Revised: We investigated adversarial attacks common in the literature like fast gradient sign method (FGSM), basic iterative method (BIM) and Carlini-Wagner (CW) . Furthermore, we propose four pre-processing defenses against these attacks- randomized smoothing, DefenseGAN, variational autoencoder (VAE) and WaveGAN vocoder.
Edit intent: coherence
Original: We investigated adversarial attacks common in the literature like fast gradient sign method (FGSM), iterative-FGSM / basic iterative method (BIM)  and Carlini-Wagner (CW) . Furthermore, we propose four pre-processing defenses against these attacks- randomized smoothing, DefenseGAN, variational autoencoder (VAE) and WaveGAN vocoder.
Revised: We investigated adversarial attacks common in the literature like fast gradient sign method (FGSM), iterative-FGSM / basic iterative method (BIM) and Carlini-Wagner (CW) attack. To mitigate against these attacks, the paper proposes four pre-processing defenses against these attacks- randomized smoothing, DefenseGAN, variational autoencoder (VAE) and WaveGAN vocoder.
Edit intent: coherence
Original: Existing approaches to ensuring privacy of user speech data primarily focus on server-side approaches.
Revised: As users increasingly rely on cloud-based computing services, it is important to ensure that uploaded speech data remains private. Existing solutions rely either on server-side approaches.
Edit intent: clarity
Original:  While improving server-side privacy reduces certain security concerns, users still do not retain control over whether privacy is ensured on the client-side .
Revised:  While improving server-side privacy reduces certain security concerns, they do not give users client-side control over whether privacy is ensured on the client-side .
Edit intent: clarity
Original:  While improving server-side privacy reduces certain security concerns, users still do not retain control over whether privacy is ensured on the client-side .
Revised:  While improving server-side privacy reduces certain security concerns, users still do not retain control over whether their biometric information is sent to the server .
Edit intent: clarity
Original:  In this paper, we define, evaluate, and explore techniques for client-side  privacy in speech recognition, where the goal is to preserve privacy on raw speech data before leaving the client's device.
Revised:  In this paper, we formally define client-side privacy in speech recognition, where the goal is to preserve privacy on raw speech data before leaving the client's device.
Edit intent: clarity
Original:  In this paper, we define, evaluate, and explore techniques for client-side  privacy in speech recognition, where the goal is to preserve privacy on raw speech data before leaving the client's device.
Revised:  In this paper, we define, evaluate, and explore techniques for client-side privacy for speech recognition, where the goal is to preserve privacy on raw speech data before leaving the client's device.
Edit intent: fluency
Original:  Our results call for more research in this crucial area as a step towards safer real-world deployment of speech recognition systems at scale across mobile devices .
Revised:  Our results call for more research in client-side privacy to ensure a safer deployment of cloud-based speech processing services .
Edit intent: clarity
Original:  The particular variant where all the rectangles are squares and we want to minimize the area of the bounding square has been studied before and an algorithm with a competitive ratio of 8 has been given ~ [Fekete and Hoffmann, Algorithmica, 2017].
Revised:  The particular variant where all the rectangles are squares and we want to minimize the area of the bounding square has been studied before and an algorithm with a competitive ratio of 8 has been given [Fekete and Hoffmann, Algorithmica, 2017].
Edit intent: coherence
Original:  We address this relevant problem by proposing a decentralized analysis of multiparty session protocolsfor asynchronous processes with recursion .
Revised:  We propose a decentralized analysis of multiparty session protocolsfor asynchronous processes with recursion .
Edit intent: coherence
Original:  Our solution rests upon  APCP, a new type system that ensures protocol conformance and deadlock freedom with respect to binary protocols .
Revised:  Our solution rests upon APCP, a type system that ensures protocol conformance and deadlock freedom with respect to binary protocols .
Edit intent: clarity
Original:  Our analysis enables the sound and complete transfer of correctness from APCP to multiparty session protocols.
Revised:  Our analysis enables the sound and complete transfer of correctness from APCP to multiparty protocols.
Edit intent: clarity
Original: A refactoring must preserve the program's functionality.
Revised: Refactorings must not alter the program's functionality.
Edit intent: clarity
Original:  Since programs are rarely formally specified, we use the original program as functional specification and check whether the original and refactored program are functionally equivalent.
Revised:  Since programs are rarely formally specified, we use the original program as functional specification . Then, we check whether the original and refactored program are functionally equivalent.
Edit intent: coherence
Original:  More concretely, our PEQcheck technique follows a common approach and reduces equivalence checking to program verification.
Revised:  To this end, we apply a common idea and reduce equivalence checking to program verification.
Edit intent: clarity
Original:  To increase efficiency, PEQcheck generates several verification tasks, namely one per refactored code segment and not one per function as typically done by prior work.
Revised:  To increase efficiency, our equivalence checker PEQcheck constructs one verification task per refactored code segment and not one per function as typically done by prior work.
Edit intent: clarity
Original:  To increase efficiency, PEQcheck generates several verification tasks, namely one per refactored code segment and not one per function as typically done by prior work.
Revised:  To increase efficiency, PEQcheck generates several verification tasks, namely one per refactored code segment instead of one per function as typically done by prior work.
Edit intent: fluency
Original:  Additionally, PEQcheck takes the context of the segments into account.
Revised:  In addition, PEQcheck considers the context of the segments into account.
Edit intent: coherence
Original:  For example, only modified, live variables need to be equivalent and read-only variables can be shared between original and refactored code segments.
Revised:  For example, only modified, live variables need to be equivalent and read-only variables may be shared between original and refactored code segments.
Edit intent: clarity
Original: Our evaluation shows that the localized checking of PEQcheck\peqcheck can indeed be beneficial.
Revised: Our evaluation shows that the localized and context-aware checking performed by\peqcheck can indeed be beneficial.
Edit intent: clarity
Original:  Yet, the unknown accuracy of contact estimation by wireless technologies hinders the broad use.
Revised:  Yet, the unknown accuracy of contact estimation by wireless technologies hinders the broader use.
Edit intent: fluency
Original:  We address this challenge by conducting a measurement study with a custom testbed to show the benefits and limitations of Bluetooth Low Energy (BLE) in comparison to distance estimation by ultra-wideband (UWB) . Our results confirm that BLE-based distance estimation is not sufficient in real scenarios where smartphones are shielded heavily by the users' bodies.
Revised:  We address this challenge by conducting a measurement study with a custom testbed to show the capabilities and limitations of Bluetooth Low Energy (BLE) in comparison to distance estimation by ultra-wideband (UWB) . Our results confirm that BLE-based distance estimation is not sufficient in real scenarios where smartphones are shielded heavily by the users' bodies.
Edit intent: clarity
Original: This paper considers semi-discrete and fully discrete mixed finite element discretizations for Maxwell-model-based problems of wave propagation in 2-dimensional linear viscoelastic solid.
Revised: Semi-discrete and fully discrete mixed finite element discretizations for Maxwell-model-based problems of wave propagation in 2-dimensional linear viscoelastic solid.
Edit intent: clarity
Original: This paper considers semi-discrete and fully discrete mixed finite element discretizations for Maxwell-model-based problems of wave propagation in 2-dimensional linear viscoelastic solid.
Revised: This paper considers semi-discrete and fully discrete mixed finite element methods are considered for Maxwell-model-based problems of wave propagation in 2-dimensional linear viscoelastic solid.
Edit intent: clarity
Original: This paper considers semi-discrete and fully discrete mixed finite element discretizations for Maxwell-model-based problems of wave propagation in 2-dimensional linear viscoelastic solid.
Revised: This paper considers semi-discrete and fully discrete mixed finite element discretizations for Maxwell-model-based problems of wave propagation in linear viscoelastic solid.
Edit intent: clarity
Original:  A large class of existing mixed conforming finite elements for elasticity are used in the spatial discretization.
Revised:  A large class of existing mixed conforming finite elements for elasticity in the spatial discretization.
Edit intent: clarity
Original:  Numerical experiments are provided which apply two low order rectangular elements in the spatial discretization .
Revised:  Numerical experiments are provided to verify the theoretical results .
Edit intent: clarity
Original:  2) identifies the urgent need to address these obstacles in a grassroots manner, through a community of stakeholders including, researchers, imaging scientists, bioimage analysts, bioimage informatics developers, corporate partners, funding agencies, standards organizations, and scientific publishers ;
Revised:  2) identifies the urgent need to address these obstacles in a grassroots manner, through a community of stakeholders including, researchers, imaging scientists, bioimage analysts, bioimage informatics developers, corporate partners, funding agencies, standards organizations, scientific publishers, and observers of such ;
Edit intent: clarity
Original: In this work, we investigate the recovery of a parameter in a diffusion process given by the order of derivation in time for some class of diffusion  equations, including both classical and time-fractional diffusion equations, from the flux measurement observed at one point on the boundary.
Revised: In this work, we investigate the recovery of a parameter in a diffusion process given by the order of derivation in time for a class of diffusion equations, including both classical and time-fractional diffusion equations, from the flux measurement observed at one point on the boundary.
Edit intent: clarity
Original:  We prove a uniqueness result in an unknown medium (e.g., diffusion coefficients, obstacle, initial condition and source) which can be seen as the recovery of the order of derivation in a diffusion process having several pieces of unknown information.
Revised:  We prove a uniqueness result in an unknown medium (e.g., diffusion coefficients, obstacle, initial condition and source) , i.e., the recovery of the order of derivation in a diffusion process having several pieces of unknown information.
Edit intent: coherence
Original:  The proof relies on the analyticity of the solution at large time, the asymptotic decay behavior, the strong maximum principle of the elliptic problem and suitable application of the Hopf lemma.
Revised:  The proof relies on the analyticity of the solution at large time, asymptotic decay behavior, the strong maximum principle of the elliptic problem and suitable application of the Hopf lemma.
Edit intent: fluency
Original:  The proof relies on the analyticity of the solution at large time, the asymptotic decay behavior, the strong maximum principle of the elliptic problem and suitable application of the Hopf lemma.
Revised:  The proof relies on the analyticity of the solution at large time, the asymptotic decay behavior, strong maximum principle of the elliptic problem and suitable application of the Hopf lemma.
Edit intent: fluency
Original:  Furthermore, the iteration serves as a de facto regularization mechanism for computing singular zeros from empirical data.
Revised:  Furthermore, the iteration serves as a regularization mechanism for computing singular zeros from empirical data.
Edit intent: clarity
Original:  Furthermore, the iteration serves as a de facto regularization mechanism for computing singular zeros from empirical data.
Revised:  Furthermore, the iteration serves as a de facto regularization mechanism for computing singular solutions from empirical data.
Edit intent: clarity
Original:  Geometrically, the iteration approximately converges to the nearest point on the solution manifold.
Revised:  Geometrically, the iteration approximately approaches the nearest point on the solution manifold.
Edit intent: clarity
Original:  This extension simplifies nonlinear system modeling by eliminating the zero isolation process and enables a wide range of applications in algebraic computation.
Revised:  The method simplifies the modeling of nonlinear systems by permitting nonisolated solutions and enables a wide range of applications in algebraic computation.
Edit intent: clarity
Original:  We show that server-side localization is not trivial and present two unique challenges associated with this approach, namely Cardinality Mismatch andHigh Client Scan Latency .
Revised:  We show that server-side localization is not trivial and present two unique challenges associated with this approach, namely andHigh Client Scan Latency .
Edit intent: clarity
Original:  We show that server-side localization is not trivial and present two unique challenges associated with this approach, namely Cardinality Mismatch andHigh Client Scan Latency .
Revised:  We show that server-side localization is not trivial and present two unique challenges associated with this approach, namely Cardinality Mismatch High Client Scan Latency .
Edit intent: fluency
Original:  We collect three weeks of detailed ground truth data ( \approx 200 landmarks), from a WiFi setup that has been deployed for more than four years, to provide evidences for the extent and understanding the impact of these problems.
Revised:  We collect three weeks of detailed ground truth data ( ~ 200 landmarks), from a WiFi setup that has been deployed for more than four years, to provide evidences for the extent and understanding the impact of these problems.
Edit intent: clarity