wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this paper, we provide the first algorithm, enabling the following capabilities: minimal communication, i.e., the algorithm is executed by the robots based only on minimal communication between them , system-wide resiliency, i.e., the algorithm is valid for any number of denial-of-service attacks and failures , and provable approximation performance, i.e., the algorithm ensures for all monotone and (possibly) submodular objective functions a solution that is finitely close to the optimal.
Revised:  In this paper, we provide the first algorithm, enabling the following capabilities: minimal communication, i.e., the algorithm is executed by the robots based only on minimal communication between them ; system-wide resiliency, i.e., the algorithm is valid for any number of denial-of-service attacks and failures , and provable approximation performance, i.e., the algorithm ensures for all monotone and (possibly) submodular objective functions a solution that is finitely close to the optimal.
Edit intent: fluency
Original:  In this paper, we provide the first algorithm, enabling the following capabilities: minimal communication, i.e., the algorithm is executed by the robots based only on minimal communication between them , system-wide resiliency, i.e., the algorithm is valid for any number of denial-of-service attacks and failures , and provable approximation performance, i.e., the algorithm ensures for all monotone and (possibly) submodular objective functions a solution that is finitely close to the optimal.
Revised:  In this paper, we provide the first algorithm, enabling the following capabilities: minimal communication, i.e., the algorithm is executed by the robots based only on minimal communication between them , system-wide resiliency, i.e., the algorithm is valid for any number of denial-of-service attacks and failures ; and provable approximation performance, i.e., the algorithm ensures for all monotone and (possibly) submodular objective functions a solution that is finitely close to the optimal.
Edit intent: fluency
Original:  In this paper, we provide the first algorithm, enabling the following capabilities: minimal communication, i.e., the algorithm is executed by the robots based only on minimal communication between them , system-wide resiliency, i.e., the algorithm is valid for any number of denial-of-service attacks and failures , and provable approximation performance, i.e., the algorithm ensures for all monotone and (possibly) submodular objective functions a solution that is finitely close to the optimal.
Revised:  In this paper, we provide the first algorithm, enabling the following capabilities: minimal communication, i.e., the algorithm is executed by the robots based only on minimal communication between them , system-wide resiliency, i.e., the algorithm is valid for any number of denial-of-service attacks and failures , and provable approximation performance, i.e., the algorithm ensures for all monotone (and not necessarily submodular) objective functions a solution that is finitely close to the optimal.
Edit intent: clarity
Original:  We  support our theoretical analyses with simulated and real-world experiments, by considering an active information acquisition application scenario, namely, multi-robot target tracking.
Revised:  We support our theoretical analyses with simulated and real-world experiments, by considering an active information gathering scenario, namely, multi-robot target tracking.
Edit intent: clarity
Original:  Our optimizations enable an over 100x speed up in the end-to-end analysis pipeline.
Revised:  Our optimizations enable an over 100\times speedup in the end-to-end analysis pipeline.
Edit intent: clarity
Original: Implantable medical devices (IMDs), including pacemakers, implanted cardiac defibrillators and neurostimulator are medical devices implanted into patients' bodies via surgery and are capable of monitoring patient's conditions and delivering therapy.
Revised: Implantable medical devices (IMDs), such as pacemakers, implanted cardiac defibrillators and neurostimulator are medical devices implanted into patients' bodies via surgery and are capable of monitoring patient's conditions and delivering therapy.
Edit intent: clarity
Original: Implantable medical devices (IMDs), including pacemakers, implanted cardiac defibrillators and neurostimulator are medical devices implanted into patients' bodies via surgery and are capable of monitoring patient's conditions and delivering therapy.
Revised: Implantable medical devices (IMDs), including pacemakers, implanted cardiac defibrillators , and neurostimulators are medical devices implanted into patients' bodies via surgery and are capable of monitoring patient's conditions and delivering therapy.
Edit intent: fluency
Original:  They often have built-in radio modules to support data reading and parameters reconfiguration according to the commands from external programmers.
Revised:  They often have built-in wireless communication modules to facilitate data collecting and device reprogramming by external programmers.
Edit intent: clarity
Original:  The lack of a secure authentication mechanism exposes patients to cyber attacks over the air and threatens patients' lives.
Revised:  The wireless communication brings significant conveniences for advanced applications such as real-time and remote monitoring but also introduces the risk of unauthorized wireless access. The absence of effective access control mechanisms exposes patients' life to cyber attacks over the air and threatens patients' lives.
Edit intent: clarity
Original:  In this paper, we design an effective authentication system for IMDs by utilizing POKs.
Revised:  In this paper, we present a lightweight and universally applicable access control system for IMDs by utilizing POKs.
Edit intent: clarity
Original:   We evaluate the proposed scheme with detailed security analysis and implement it on a prototype testbed to demonstrate its lightweight feature .
Revised:  We evaluate our proposed scheme through extensive security analysis and implement it on a prototype testbed to demonstrate its lightweight feature .
Edit intent: clarity
Original:   We evaluate the proposed scheme with detailed security analysis and implement it on a prototype testbed to demonstrate its lightweight feature .
Revised:  We evaluate the proposed scheme with detailed security analysis and a prototype implementation, which demonstrates our work's superiority on security and energy efficiency .
Edit intent: coherence
Original:  The model results are highly sensitive to network structure.
Revised:  The model results are sensitive to network structure.
Edit intent: clarity
Original: Planar cell polarity (PCP), the ability of a tissue to polarize coherently over multicellular length scales, provides the directional information that guides a multitude of developmental processes at cellular and tissue levels.
Revised: Planar cell polarity (PCP), the ability of a tissue on multicellular length scales, provides the directional information that guides a multitude of developmental processes at cellular and tissue levels.
Edit intent: clarity
Original: Planar cell polarity (PCP), the ability of a tissue to polarize coherently over multicellular length scales, provides the directional information that guides a multitude of developmental processes at cellular and tissue levels.
Revised: Planar cell polarity (PCP), the ability of a tissue to polarize coherently over multicellular length scales, provides directional information that guides a multitude of developmental processes at cellular and tissue levels.
Edit intent: fluency
Original:  While it is manifest that cells utilize both intracellular and intercellular mechanisms, how they couple together to produce the collective response remains an active area of investigation.
Revised:  While it is manifest that cells utilize both intracellular and intercellular mechanisms, how the two produce the collective response remains an active area of investigation.
Edit intent: clarity
Original:  While it is manifest that cells utilize both intracellular and intercellular mechanisms, how they couple together to produce the collective response remains an active area of investigation.
Revised:  While it is manifest that cells utilize both intracellular and intercellular mechanisms, how they couple together to produce the collective polarization remains an active area of investigation.
Edit intent: clarity
Original:  Exploring a phenomenological reaction-diffusion model, we predict a crucial, and novel, role for cytoplasmic interactions in the largescale correlations of cell polarities  .
Revised:  We study the role of intracellular interactions in the largescale correlations of cell polarities .
Edit intent: clarity
Original:  Exploring a phenomenological reaction-diffusion model, we predict a crucial, and novel, role for cytoplasmic interactions in the largescale correlations of cell polarities  .
Revised:  Exploring a phenomenological reaction-diffusion model, we predict a crucial, and novel, role for cytoplasmic interactions in the large-scale spatial coherence of cell polarities .
Edit intent: clarity
Original:  We demonstrate that finite-range (i.e. nonlocal ) cytoplasmic interactions are necessary and sufficient for the robust and longrange polarizationof tissues, even in the absence of global cues, and are essential to the faithful detection of weak directional signals.
Revised:  We demonstrate that nonlocal cytoplasmic interactions are necessary and sufficient for the robust and longrange polarizationof tissues, even in the absence of global cues, and are essential to the faithful detection of weak directional signals.
Edit intent: clarity
Original:  We demonstrate that finite-range (i.e. nonlocal ) cytoplasmic interactions are necessary and sufficient for the robust and longrange polarizationof tissues, even in the absence of global cues, and are essential to the faithful detection of weak directional signals.
Revised:  We demonstrate that finite-range (i.e. nonlocal ) cytoplasmic interactions are necessary and sufficient for the robust long-range polarization, and are essential to the faithful detection of weak directional signals.
Edit intent: clarity
Original:  While the first provably worse-case optimal join algorithm was discovered relatively recently, the techniques and results surrounding these algorithms grow out of decades of research from a wide range of areas, intimately connecting graph theory, algorithms, information theory, constraint satisfaction, database theory, and geometric inequalities.
Revised:  While the first provably worst-case optimal join algorithm was discovered relatively recently, the techniques and results surrounding these algorithms grow out of decades of research from a wide range of areas, intimately connecting graph theory, algorithms, information theory, constraint satisfaction, database theory, and geometric inequalities.
Edit intent: fluency
Original: In this work, we consider a new type of Fourier-like representation of boolean function f %DIFDELCMD < \colon%%%  \{+1,-1\}^n\to\{+1,-1\} %DIFDELCMD < \[ f(x) = %DIFDELCMD < \cos\left(\piS\subseteq[n]\phi_S i\in S x_i\right).
Revised: In this work, we consider a new type of Fourier-like representation of boolean function f %DIFDELCMD < \colon%%% : \{+1,-1\}^n\to\{+1,-1\} %DIFDELCMD < \[ f(x) = %DIFDELCMD < \cos\left(\piS\subseteq[n]\phi_S i\in S x_i\right).
Edit intent: fluency
Original: \] This representation, which we call a periodic Fourier representation, of boolean function is closely related to a certain type of multipartite Bell inequalities and non-adaptive measurement-based quantum computation with linear side-processing (NMQC_\oplus).
Revised: \] This representation, which we call the periodic Fourier representation, of boolean function is closely related to a certain type of multipartite Bell inequalities and non-adaptive measurement-based quantum computation with linear side-processing (NMQC_\oplus).
Edit intent: fluency
Original:  The minimum number of non-zero coefficients in the above representation, which we call a periodic Fourier sparsity, is equal to the number of qubits required for an exact computation of f by NMQC_\oplus.
Revised:  The minimum number of non-zero coefficients in the above representation, which we call the periodic Fourier sparsity, is equal to the number of qubits required for an exact computation of f by NMQC_\oplus.
Edit intent: fluency
Original:  The minimum number of non-zero coefficients in the above representation, which we call a periodic Fourier sparsity, is equal to the number of qubits required for an exact computation of f by NMQC_\oplus.
Revised:  The minimum number of non-zero coefficients in the above representation, which we call a periodic Fourier sparsity, is equal to the number of qubits required for the exact computation of f by NMQC_\oplus.
Edit intent: fluency
Original:  Periodic Fourier representations are not unique, and can be directly obtained both from a Fourier representation and an F_2-polynomial representation.
Revised:  Periodic Fourier representations are not unique, and can be directly obtained both from the Fourier representation and an F_2-polynomial representation.
Edit intent: fluency
Original:  Periodic Fourier representations are not unique, and can be directly obtained both from a Fourier representation and an F_2-polynomial representation.
Revised:  Periodic Fourier representations are not unique, and can be directly obtained both from a Fourier representation and the F_2-polynomial representation.
Edit intent: clarity
Original:  In this work, we first show that a boolean function related to Z/4Z-polynomial has a small periodic Fourier sparsity .
Revised:  In this work, we first show that boolean functions related to Z/4Z-polynomial has a small periodic Fourier sparsity .
Edit intent: fluency
Original:  In this work, we first show that a boolean function related to Z/4Z-polynomial has a small periodic Fourier sparsity .
Revised:  In this work, we first show that a boolean function related to Z/4Z-polynomial have small periodic Fourier sparsity .
Edit intent: fluency
Original:  In this work, we first show that a boolean function related to Z/4Z-polynomial has a small periodic Fourier sparsity .
Revised:  In this work, we first show that a boolean function related to Z/4Z-polynomial has a small periodic Fourier sparsities .
Edit intent: clarity
Original:  From this construction, we obtain a cubic improvement on periodic Fourier sparsity against other periodic Fourier representations obtained by a Fourier representation and an \mathbb{F}_2-polynomial representation.
Revised:  From this construction, we obtain a cubic improvement of periodic Fourier sparsity against other periodic Fourier representations obtained by a Fourier representation and an \mathbb{F}_2-polynomial representation.
Edit intent: fluency
Original:  From this construction, we obtain a cubic improvement on periodic Fourier sparsity against other periodic Fourier representations obtained by a Fourier representation and an \mathbb{F}_2-polynomial representation.
Revised:  From this construction, we obtain a cubic improvement on periodic Fourier sparsity compared to other periodic Fourier representations obtained by a Fourier representation and an \mathbb{F}_2-polynomial representation.
Edit intent: fluency
Original:  From this construction, we obtain a cubic improvement on periodic Fourier sparsity against other periodic Fourier representations obtained by a Fourier representation and an \mathbb{F}_2-polynomial representation.
Revised:  From this construction, we obtain a cubic improvement on periodic Fourier sparsity against other periodic Fourier representations obtained by the Fourier representation and an \mathbb{F}_2-polynomial representation.
Edit intent: fluency
Original:  From this construction, we obtain a cubic improvement on periodic Fourier sparsity against other periodic Fourier representations obtained by a Fourier representation and an \mathbb{F}_2-polynomial representation.
Revised:  From this construction, we obtain a cubic improvement on periodic Fourier sparsity against other periodic Fourier representations obtained by a Fourier representation and the \mathbb{F}_2-polynomial representation.
Edit intent: fluency
Original:  This cubic gap is currently the largest known gap .
Revised:  This cubic improvement is currently the largest known gap .
Edit intent: clarity
Original:  This cubic gap is currently the largest known gap .
Revised:  This cubic gap is currently the largest known improvement .
Edit intent: clarity
Original: In this work, we consider a new type of Fourier-like representation of boolean function f:\colon \{+1,-1\}^n\to\{+1,-1\} %DIFDELCMD < \[f(x)=\cos\left(\piS\subseteq[n]\phi_S\prod_{i\in %DIFDELCMD < S}x_i\right).
Revised: In this work, we consider a new type of Fourier-like representation of Boolean function f\colon \{+1,-1\}^n\to\{+1,-1\} %DIFDELCMD < \[f(x)=\cos\left(\piS\subseteq[n]\phi_S\prod_{i\in %DIFDELCMD < S}x_i\right).
Edit intent: fluency
Original:  \] This representation, which we call the periodic Fourier representation, of boolean function is closely related to a certain type of multipartite Bell inequalities and non-adaptive measurement-based quantum computation with linear side-processing (NMQC_\oplus).
Revised:  \] This representation, which we call the periodic Fourier representation, of Boolean function is closely related to a certain type of multipartite Bell inequalities and non-adaptive measurement-based quantum computation with linear side-processing (NMQC_\oplus).
Edit intent: fluency
Original:  The minimum number of non-zero coefficients in the above representation, which we call the periodic Fourier sparsity, is equal to the  number of qubits required for the exact computation of f by NMQC_\oplus.
Revised:  The minimum number of non-zero coefficients in the above representation, which we call the periodic Fourier sparsity, is equal to the required number of qubits required for the exact computation of f by NMQC_\oplus.
Edit intent: fluency
Original:  The minimum number of non-zero coefficients in the above representation, which we call the periodic Fourier sparsity, is equal to the  number of qubits required for the exact computation of f by NMQC_\oplus.
Revised:  The minimum number of non-zero coefficients in the above representation, which we call the periodic Fourier sparsity, is equal to the number of qubits for the exact computation of f by NMQC_\oplus.
Edit intent: clarity
Original:  In this work, we first show that boolean functions related to Z/4Z-polynomial have small periodic Fourier sparsities.
Revised:  In this work, we first show that Boolean functions related to Z/4Z-polynomial have small periodic Fourier sparsities.
Edit intent: fluency
Original:  From this construction, we obtain a cubic improvement of periodic Fourier sparsity compared to other periodic Fourier representations obtained by the Fourier representation and the \mathbb{F_2-polynomial representation.
Revised:  Second, we show that the periodic Fourier sparsity compared to other periodic Fourier representations obtained by the Fourier representation and the \mathbb{F_2-polynomial representation.
Edit intent: clarity
Original:  From this construction, we obtain a cubic improvement of periodic Fourier sparsity compared to other periodic Fourier representations obtained by the Fourier representation and the \mathbb{F_2-polynomial representation.
Revised:  From this construction, we obtain a cubic improvement of periodic Fourier sparsity _2-polynomial representation.
Edit intent: coherence
Original:  } Furthermore, we show that  \mathsf{AND}_n, \mathsf{Mod}^3_n and \mathsf{Maj can be exactly computed by depth-2 \mathrm{NMQC}_\oplus using  polynomial number of qubits, that implies exponential gaps between \mathrm{NMQC}_\oplus and depth-2 \mathrm{NMQC}_\oplus .
Revised:  } Furthermore, we show that \mathsf{AND}_n, \mathsf{Mod}^3_n , \mathsf{Maj can be exactly computed by depth-2 \mathrm{NMQC}_\oplus using polynomial number of qubits, that implies exponential gaps between \mathrm{NMQC}_\oplus and depth-2 \mathrm{NMQC}_\oplus .
Edit intent: fluency
Original:  } Furthermore, we show that  \mathsf{AND}_n, \mathsf{Mod}^3_n and \mathsf{Maj can be exactly computed by depth-2 \mathrm{NMQC}_\oplus using  polynomial number of qubits, that implies exponential gaps between \mathrm{NMQC}_\oplus and depth-2 \mathrm{NMQC}_\oplus .
Revised:  } Furthermore, we show that \mathsf{AND}_n, \mathsf{Mod}^3_n and \mathsf{Maj can be exactly computed by depth-2 \mathrm{NMQC}_\oplus using a polynomial number of qubits, that implies exponential gaps between \mathrm{NMQC}_\oplus and depth-2 \mathrm{NMQC}_\oplus .
Edit intent: fluency
Original:  Depending on the degree of disorder, the lowermost eigenstates exhibit strong localization in the form of an exponential decay of their moduli .
Revised:  Depending on the degree of disorder, we prove the existence of spectral gaps amongst the lowermost eigenvalues and the emergence of exponentially localized states .
Edit intent: clarity
Original:  Can today  physics provide an explanatory framework for understanding the evolution of biological complexity?
Revised:  Can today 's physics provide an explanatory framework for understanding the evolution of biological complexity?
Edit intent: fluency
Original:  This hierarchy happens to be a nontrivial extension of the hierarchy given by Sidki for automaton groups  and also gives new insights into the latter.
Revised:  This hierarchy extends that given by Sidki for automaton groups and also gives new insights into the latter.
Edit intent: clarity
Original:  This hierarchy happens to be a nontrivial extension of the hierarchy given by Sidki for automaton groups  and also gives new insights into the latter.
Revised:  This hierarchy happens to be a nontrivial extension of the hierarchy given by Sidki for automaton groups , and also gives new insights into the latter.
Edit intent: fluency
Original:  We prove that the Order Problem is decidable in the first two polynomial levels of this hierarchy, that is, when the state-activity is bounded.
Revised:  We prove that the Order Problem is decidable when the state-activity is bounded.
Edit intent: clarity
Original:  Recently proven to be undecidable for the whole family, the Order Problem remains open for the third level of this hierarchy, that is, when the state-activity is linear  .
Revised:  The Order Problem remains open for the third level of this hierarchy, that is, when the state-activity is linear .
Edit intent: clarity
Original:  Recently proven to be undecidable for the whole family, the Order Problem remains open for the third level of this hierarchy, that is, when the state-activity is linear  .
Revised:  Recently proven to be undecidable for the whole family, the Order Problem remains open for the next level of this hierarchy, that is, when the state-activity is linear .
Edit intent: clarity
Original: We revisit the model by Wiser, Ribeck, and Lenski (Science 342 (2013), 1364-1367 ), which describes how the mean fitness increases over time due to beneficial mutations in Lenski's long-term evolution experiment.
Revised: We revisit the model by Wiser, Ribeck, and Lenski (Science 342 (2013), 1364-1367 ), which describes how the mean fitness increases over time due to beneficial mutations in Lenski's long-term evolution experiment.
Edit intent: fluency
Original: We revisit the model by Wiser, Ribeck, and Lenski (Science 342 (2013), 1364-1367 ), which describes how the mean fitness increases over time due to beneficial mutations in Lenski's long-term evolution experiment.
Revised: We revisit the model by Wiser, Ribeck, and Lenski (Science 342 (2013), 1364--1367 ), which describes how the mean fitness increases over time due to beneficial mutations in Lenski's long-term evolution experiment.
Edit intent: clarity