wanyu/IteraTeR_v2 huggingface dataset:
Original:  To demonstrate that our TRNG design is viable on commodity DRAM chips, we rigorously characterize the behavior of activation failures in 282 state-of-the-art LPDDR4 devices from across three major DRAM vendors and verify our observations using four additional DDR3 DRAM devices drawn from the same vendors .
Revised:  To demonstrate that our TRNG design is viable on commodity DRAM chips, we rigorously characterize the behavior of activation failures in 282 state-of-the-art LPDDR4 devices from three major DRAM vendors and verify our observations using four additional DDR3 DRAM devices drawn from the same vendors .
Edit intent: clarity
Original:  To demonstrate that our TRNG design is viable on commodity DRAM chips, we rigorously characterize the behavior of activation failures in 282 state-of-the-art LPDDR4 devices from across three major DRAM vendors and verify our observations using four additional DDR3 DRAM devices drawn from the same vendors .
Revised:  To demonstrate that our TRNG design is viable on commodity DRAM chips, we rigorously characterize the behavior of activation failures in 282 state-of-the-art LPDDR4 devices from across three major DRAM manufacturers. We verify our observations using four additional DDR3 DRAM devices drawn from the same vendors .
Edit intent: clarity
Original:  To demonstrate that our TRNG design is viable on commodity DRAM chips, we rigorously characterize the behavior of activation failures in 282 state-of-the-art LPDDR4 devices from across three major DRAM vendors and verify our observations using four additional DDR3 DRAM devices drawn from the same vendors .
Revised:  To demonstrate that our TRNG design is viable on commodity DRAM chips, we rigorously characterize the behavior of activation failures in 282 state-of-the-art LPDDR4 devices from across three major DRAM vendors and verify our observations using four additional DDR3 DRAM devices from the same vendors .
Edit intent: clarity
Original:  To demonstrate that our TRNG design is viable on commodity DRAM chips, we rigorously characterize the behavior of activation failures in 282 state-of-the-art LPDDR4 devices from across three major DRAM vendors and verify our observations using four additional DDR3 DRAM devices drawn from the same vendors .
Revised:  To demonstrate that our TRNG design is viable on commodity DRAM chips, we rigorously characterize the behavior of activation failures in 282 state-of-the-art LPDDR4 devices from across three major DRAM vendors and verify our observations using four additional DDR3 DRAM devices drawn from the same manufacturers .
Edit intent: clarity
Original:  We use our observations to develop D-RaNGe , a methodology for extracting true random numbers from commodity DRAM devices with high throughput using access latency violation .
Revised:  We use our observations to develop D-RanGe , a methodology for extracting true random numbers from commodity DRAM devices with high throughput using access latency violation .
Edit intent: fluency
Original:  We evaluate the quality of D-RaNGe using the NIST statistical test suite for randomness and find that D-RaNGe: 1) successfully passes each test, and 2) generates true random numbers with over two orders of magnitude higher throughput when compared with the previous highest-throughput DRAM-based TRNG.
Revised:  We evaluate the quality of our TRNG using the commonly-used NIST statistical test suite for randomness and find that D-RaNGe: 1) successfully passes each test, and 2) generates true random numbers with over two orders of magnitude higher throughput when compared with the previous highest-throughput DRAM-based TRNG.
Edit intent: clarity
Original:  We evaluate the quality of D-RaNGe using the NIST statistical test suite for randomness and find that D-RaNGe: 1) successfully passes each test, and 2) generates true random numbers with over two orders of magnitude higher throughput when compared with the previous highest-throughput DRAM-based TRNG.
Revised:  We evaluate the quality of D-RaNGe using the NIST statistical test suite for randomness and find that D-RaNGe: 1) successfully passes each test, and 2) generates true random numbers with over two orders of magnitude higher throughput than the previous highest-throughput DRAM-based TRNG.
Edit intent: clarity
Original: We define a metric---the Network Gromov-Wasserstein distance---on weighted, directed networks that is sensitive to the presence of outliers.
Revised: We define a metric---the network Gromov-Wasserstein distance---on weighted, directed networks that is sensitive to the presence of outliers.
Edit intent: fluency
Original:  Efficient numerical method, including the finite difference method, inexact Newton method nonlinear solver, CPR-FPF preconditioners for linear systems and effective decoupling method, are presented.
Revised:  Efficient numerical method, including the finite difference method, CPR-FPF preconditioners for linear systems and effective decoupling method, are presented.
Edit intent: coherence
Original:  Our construction is non-cooperative and " just-barely " 3D in the sense that it places tiles at most one step into the third dimension.
Revised:  Our construction is non-cooperative and " just-barely '' 3D in the sense that it places tiles at most one step into the third dimension.
Edit intent: fluency
Original: The task of  visually grounded dialog involves learning goal-oriented cooperative dialog between autonomous agents who exchange information about a scene through several rounds of questions and answers  .
Revised: The task of conducting visually grounded dialog involves learning goal-oriented cooperative dialog between autonomous agents who exchange information about a scene through several rounds of questions and answers .
Edit intent: clarity
Original:  We posit that requiring  agents to adhere to  rules of human language while also maximizing information exchange is an ill-posed problem , and observe that humans do not stray from a common language , because they are social creatures  and have to communicate with many people everyday, and it is far easier to stick to a common language even at the cost of some efficiency loss.
Revised:  We posit that requiring artificial agents to adhere to rules of human language while also maximizing information exchange is an ill-posed problem , and observe that humans do not stray from a common language , because they are social creatures and have to communicate with many people everyday, and it is far easier to stick to a common language even at the cost of some efficiency loss.
Edit intent: clarity
Original:  We posit that requiring  agents to adhere to  rules of human language while also maximizing information exchange is an ill-posed problem , and observe that humans do not stray from a common language , because they are social creatures  and have to communicate with many people everyday, and it is far easier to stick to a common language even at the cost of some efficiency loss.
Revised:  We posit that requiring agents to adhere to the rules of human language while also maximizing information exchange is an ill-posed problem , and observe that humans do not stray from a common language , because they are social creatures and have to communicate with many people everyday, and it is far easier to stick to a common language even at the cost of some efficiency loss.
Edit intent: fluency
Original:  We posit that requiring  agents to adhere to  rules of human language while also maximizing information exchange is an ill-posed problem , and observe that humans do not stray from a common language , because they are social creatures  and have to communicate with many people everyday, and it is far easier to stick to a common language even at the cost of some efficiency loss.
Revised:  We posit that requiring agents to adhere to rules of human language while also maximizing information exchange is an ill-posed problem . We observe that humans do not stray from a common language , because they are social creatures and have to communicate with many people everyday, and it is far easier to stick to a common language even at the cost of some efficiency loss.
Edit intent: coherence
Original:  We posit that requiring  agents to adhere to  rules of human language while also maximizing information exchange is an ill-posed problem , and observe that humans do not stray from a common language , because they are social creatures  and have to communicate with many people everyday, and it is far easier to stick to a common language even at the cost of some efficiency loss.
Revised:  We posit that requiring agents to adhere to rules of human language while also maximizing information exchange is an ill-posed problem , and observe that humans do not stray from a common language because they are social creatures and have to communicate with many people everyday, and it is far easier to stick to a common language even at the cost of some efficiency loss.
Edit intent: fluency
Original:  We posit that requiring  agents to adhere to  rules of human language while also maximizing information exchange is an ill-posed problem , and observe that humans do not stray from a common language , because they are social creatures  and have to communicate with many people everyday, and it is far easier to stick to a common language even at the cost of some efficiency loss.
Revised:  We posit that requiring agents to adhere to rules of human language while also maximizing information exchange is an ill-posed problem , and observe that humans do not stray from a common language , because they are social creatures and have to communicate with many people everyday, so it is far easier to stick to a common language even at the cost of some efficiency loss.
Edit intent: coherence
Original:  Modern state-of-the-art Bayesian nonparametric methods for phylodynamics use either change-point models or Gaussian process priors to recover population size trajectories of unknown form . Change-point models suffer from computational issues when the number of change-points is unknown and needs to be estimated.
Revised:  Modern state-of-the-art Bayesian nonparametric methods for recovering population size trajectories of unknown form use either change-point models or Gaussian process priors to recover population size trajectories of unknown form . Change-point models suffer from computational issues when the number of change-points is unknown and needs to be estimated.
Edit intent: clarity
Original:  Modern state-of-the-art Bayesian nonparametric methods for phylodynamics use either change-point models or Gaussian process priors to recover population size trajectories of unknown form . Change-point models suffer from computational issues when the number of change-points is unknown and needs to be estimated.
Revised:  Modern state-of-the-art Bayesian nonparametric methods for phylodynamics use either change-point models or Gaussian process priors . Change-point models suffer from computational issues when the number of change-points is unknown and needs to be estimated.
Edit intent: clarity
Original:  These analyses show that our new method captures features of the population size trajectories that were missed by the state-of-the-art phylodynamic methods.
Revised:  These analyses show that our new method captures features of the population size trajectories that were missed by the state-of-the-art methods.
Edit intent: clarity
Original: Hate content in social media is ever increasing .
Revised: Hate content in social media is ever-increasing .
Edit intent: fluency
Original:  While Facebook, Twitter, Google have attempted to take several steps to tackle this hate content, they most often risk the violation of freedom of speech.
Revised:  While Facebook, Twitter, Google have attempted to take several steps to tackle the hateful content, they most often risk the violation of freedom of speech.
Edit intent: fluency
Original:  Counterspeech , on the other hand, provides an effective way of tackling the online hate without the loss of freedom of speech.
Revised:  Counterspeech , on the other hand, provides an effective way of tackling the online hate without any harm to the freedom of speech.
Edit intent: clarity
Original:  This analysis results in various interesting insights such as: the counterspeech comments receive double the likes received by the non-counterspeech comments, for certain communities majority of the non-counterspeech comments tend to be hate speech, the different types of counterspeech are not all equally effective and the language choice of users posting counterspeech is largely different from those posting non-counterspeech as revealed by a detailed psycholinguistic analysis.
Revised:  This analysis results in various interesting insights such as: the counterspeech comments receive much more likes as compared to the non-counterspeech comments, for certain communities majority of the non-counterspeech comments tend to be hate speech, the different types of counterspeech are not all equally effective and the language choice of users posting counterspeech is largely different from those posting non-counterspeech as revealed by a detailed psycholinguistic analysis.
Edit intent: clarity
Original: In this paper we design quantum algorithms for studying the autocorrelation spectrum of a Boolean function and its individual coefficients .
Revised: In this paper , we propose efficient probabilistic algorithms for several problems regarding the autocorrelation spectrum of a Boolean function and its individual coefficients .
Edit intent: clarity
Original:  The  Walsh spectrum is a related concept that is well-studied primarily due to its connection to the quantum circuit for the Deutsch-Jozsa problem but the autocorrelation spectrum has not received similar attention that we attempt to deliver in this paper.
Revised:  The Walsh spectrum is well-studied primarily due to its connection to the quantum circuit for the Deutsch-Jozsa problem but the autocorrelation spectrum has not received similar attention that we attempt to deliver in this paper.
Edit intent: clarity
Original:  First and foremost, we give an algorithm that samples from the Walsh spectrum of any derivative of f() ;
Revised:  First and foremost, we give an algorithm that samples from the Walsh spectrum of a certain derivative of f() ;
Edit intent: clarity
Original:  Then we given a different set of algorithms for estimating the square of a particular coefficient or cumulative sum of their squares.
Revised:  Finally we provide a different set of algorithms for estimating the square of a particular coefficient or cumulative sum of their squares.
Edit intent: fluency
Original:  Our last algorithm combines the technique of amplitude estimation and amplification in a novel manner to find points with high values of autocorrelation coefficients.`
Edit intent: coherence
Original: We introduce CLAIRE, a distributed-memory algorithm and software for solving constrained large deformation diffeomorphic image registration problems in three dimensions.
Revised: With this work, we release CLAIRE, a distributed-memory algorithm and software for solving constrained large deformation diffeomorphic image registration problems in three dimensions.
Edit intent: clarity
Original: We introduce CLAIRE, a distributed-memory algorithm and software for solving constrained large deformation diffeomorphic image registration problems in three dimensions.
Revised: We introduce CLAIRE, a distributed-memory implementation of an effective solver for constrained large deformation diffeomorphic image registration problems in three dimensions.
Edit intent: clarity
Original:  We exploit state-of-the-art techniques in scientific computing to develop an effective solver that scales to thousand of distributed memory nodes on high-end clusters.
Revised:  We exploit state-of-the-art techniques in scientific computing to develop an effective solver that scales to thousands of distributed memory nodes on high-end clusters.
Edit intent: fluency
Original:  We also implement an improved preconditioner for the reduced space Hessian to speedup the convergence .
Revised:  We also implement an improved preconditioner for the reduced space Hessian to speed up the convergence of our solver .
Edit intent: clarity
Original:  We compare the performance of our scheme against different flavors of the DEMONS algorithm for diffeomorphic image registration.
Revised:  We compare the performance of our scheme against different flavors of the Demons algorithm for diffeomorphic image registration.
Edit intent: fluency
Original:  With the present work we achieve a speedup of (on average) 5x with a peak performance of up to 17x compared to our former work.
Revised:  With the present work we achieve a speedup of (on average) 5\times with a peak performance of up to 17x compared to our former work.
Edit intent: clarity
Original:  With the present work we achieve a speedup of (on average) 5x with a peak performance of up to 17x compared to our former work.
Revised:  With the present work we achieve a speedup of (on average) 5x with a peak performance of up to 17\times compared to our former work.
Edit intent: clarity
Original: We study motion feasibility conditions of decentralized multi-agent control systems on Lie groups with collision avoidance constraints , modeled by an undirected graph .
Revised: We study the problem of motion feasibility for multiagent control systems on Lie groups with collision avoidance constraints , modeled by an undirected graph .
Edit intent: clarity
Original: We study motion feasibility conditions of decentralized multi-agent control systems on Lie groups with collision avoidance constraints , modeled by an undirected graph .
Revised: We study motion feasibility conditions of decentralized multi-agent control systems on Lie groups with collision avoidance constraints .
Edit intent: clarity
Original:  We first consider agents modeled by a kinematic left invariant control systems (single integrator) and nextas dynamical control systems (double integrator) determined by a left-trivialized Lagrangian function.
Revised:  We first consider the problem for kinematic left invariant control systems (single integrator) and nextas dynamical control systems (double integrator) determined by a left-trivialized Lagrangian function.
Edit intent: clarity
Original:  We first consider agents modeled by a kinematic left invariant control systems (single integrator) and nextas dynamical control systems (double integrator) determined by a left-trivialized Lagrangian function.
Revised:  We first consider agents modeled by a kinematic left invariant control systems and next, for dynamical control systems (double integrator) determined by a left-trivialized Lagrangian function.
Edit intent: clarity
Original:  We first consider agents modeled by a kinematic left invariant control systems (single integrator) and nextas dynamical control systems (double integrator) determined by a left-trivialized Lagrangian function.
Revised:  We first consider agents modeled by a kinematic left invariant control systems (single integrator) and nextas dynamical control systems given by a left-trivialized Lagrangian function.
Edit intent: clarity
Original:  In the kinematic approach, we study the problem of determining whether there are nontrivial trajectories of all agent kinematics that maintain the collision avoidance constraints.
Edit intent: coherence
Original:  In the dynamical problem, first order necessary conditions for the existence of feasible motions are obtained using techniques from variational calculus on manifolds and by introducing collision avoidance constraints among agents into an augmented action functional by using the Lagrange multipliers theorem .
Revised:  In the dynamical problem, motion feasibility conditions are obtained by using techniques from variational calculus on manifolds and by introducing collision avoidance constraints among agents into an augmented action functional by using the Lagrange multipliers theorem .
Edit intent: clarity
Original: We propose a very simple and natural approximation algorithm for the problem of finding a 2-edge-connected spanning subgraph of minimum  edge cost in a graph.
Revised: We propose a simple and natural approximation algorithm for the problem of finding a 2-edge-connected spanning subgraph of minimum edge cost in a graph.
Edit intent: coherence
Original:  This matches the ratio of existing primal-dual algorithms .
Revised:  Although this only matches the ratio of existing primal-dual algorithms .
Edit intent: coherence
Original:  We use B-DNA as our prototype system , where all sequences have purines  on the same strand and start with guanine.
Revised:  We use B-DNA as our prototype system . All sequences have purines on the same strand and start with guanine.
Edit intent: coherence
Original:  Our results reveal that there is a correspondence between the degree of structural complexity and the presence of correlations in the sequences and the aforementioned properties.
Revised:  Our results reveal that there is a correspondence between the degree of sequence intricacy and the presence of correlations in the sequences and the aforementioned properties.
Edit intent: clarity
Original:  Random segments represent the less efficient category .
Revised:  Random sequences is the less efficient category .
Edit intent: clarity
Original: Plato provides sound and tight deterministic error guarantees for approximate analytics over compressed time series . Plato supports expressions that are compositions of the (commonly used in time series analytics) linear algebra operators over vectors, along with arithmetic operators.
Revised: Plato provides sound and tight deterministic error guarantees for time series analytics. Plato evaluates any time series expression composed by the linear algebra operators over vectors, along with arithmetic operators.
Edit intent: clarity
Original:  Such analytics can express common statistics ( such as correlation and cross-correlation ) that may combine multiple time series.
Revised:  This large scope of possible expressions includes common use cases such as correlation and cross-correlation ) that may combine multiple time series.
Edit intent: clarity
Original:  The time series are segmented either by fixed-length segmentation or by (  more effective) variable-length segmentation.
Revised:  The time series are segmented either by fixed-length segmentation or by ( a usually more effective) variable-length segmentation.
Edit intent: coherence
Original:  Each segment (i) is compressed by an estimation  function that approximates the actual values and is coming from a user-chosen estimation function family, and (ii) is associated with one to three (depending on the case) precomputed error measures .
Revised:  Each segment is compressed by an estimation function that approximates the actual values and is coming from a user-chosen estimation function family, and (ii) is associated with one to three (depending on the case) precomputed error measures .
Edit intent: coherence
Original:  Each segment (i) is compressed by an estimation  function that approximates the actual values and is coming from a user-chosen estimation function family, and (ii) is associated with one to three (depending on the case) precomputed error measures .
Revised:  Each segment (i) is compressed by an estimation function that approximates the actual values and is coming from a user-chosen function family, and (ii) is associated with one to three (depending on the case) precomputed error measures .
Edit intent: fluency
Original:  Then Plato is able to provide tight deterministic error guarantees for the analytics over the compressed time series.
Revised:  Then Plato is able to provide tight deterministic error guarantees for analytics over the compressed time series.
Edit intent: fluency