wanyu/IteraTeR_v2 huggingface dataset:
Original:  (iii)  a simple and practical show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds, (iv)  democratic action plans, which are sequences of social states starting with Reality , in which the transition from one to the next has democratic support, and (v) reasoned nullification of Independence of Irrelevant Alternatives and hence abdication of Arrow's Theorem.
Revised:  (iii) a simple and practical show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds, (iv) Produces democratic action plans, which are sequences of social states starting with Reality , in which the transition from one to the next has democratic support, and (v) reasoned nullification of Independence of Irrelevant Alternatives and hence abdication of Arrow's Theorem.
Edit intent: coherence
Original:  (iii)  a simple and practical show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds, (iv)  democratic action plans, which are sequences of social states starting with Reality , in which the transition from one to the next has democratic support, and (v) reasoned nullification of Independence of Irrelevant Alternatives and hence abdication of Arrow's Theorem.
Revised:  (iii) a simple and practical show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds, (iv) democratic action plans, which start with Reality and proceed in democratically-supported transitions; and (v) reasoned nullification of Independence of Irrelevant Alternatives and hence abdication of Arrow's Theorem.
Edit intent: clarity
Original:  (iii)  a simple and practical show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds, (iv)  democratic action plans, which are sequences of social states starting with Reality , in which the transition from one to the next has democratic support, and (v) reasoned nullification of Independence of Irrelevant Alternatives and hence abdication of Arrow's Theorem.
Revised:  (iii) a simple and practical show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds, (iv) democratic action plans, which are sequences of social states starting with Reality , in which the transition from one to the next has democratic support, and (v) Nullifies Independence of Irrelevant Alternatives and hence abdication of Arrow's Theorem.
Edit intent: clarity
Original:  (iii)  a simple and practical show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds, (iv)  democratic action plans, which are sequences of social states starting with Reality , in which the transition from one to the next has democratic support, and (v) reasoned nullification of Independence of Irrelevant Alternatives and hence abdication of Arrow's Theorem.
Revised:  (iii) a simple and practical show-of-hands agenda that implements an approval vote in one round and Condorcet-consistent voting in multiple rounds, (iv) democratic action plans, which are sequences of social states starting with Reality , in which the transition from one to the next has democratic support, and (v) reasoned nullification of Independence of Irrelevant Alternatives and hence abdicates Arrow's Theorem.
Edit intent: fluency
Original:  and , more generally, help restore trust in democracy by showing that it offers a coherent and hopeful vision .
Revised:  and , more generally, help restore trust in democracy by showing that it offers a coherent and offer a coherent, simple, efficient, easy to communicate, and trustworthy path forward to democracy .
Edit intent: clarity
Original:  Here we propose to rectify this neglect and incorporate Reality into Social Choice , distinguishing Reality from hypothesis .
Revised:  Here we propose to rectify this neglect and incorporate Reality into Social Choice .
Edit intent: clarity
Original: We propose a new statistical model suitable for machine learning tasks of systems with long distance correlations such as human languages.
Revised: We propose a new statistical model suitable for machine learning of systems with long distance correlations such as human languages.
Edit intent: clarity
Original: We propose a new statistical model suitable for machine learning tasks of systems with long distance correlations such as human languages.
Revised: We propose a new statistical model suitable for machine learning tasks of systems with long distance correlations such as natural languages.
Edit intent: clarity
Original: We present a novel explanation for the group polarization effect whereby discussion  induces shifts toward the extreme.
Revised: We present a novel explanation for the group polarization effect whereby discussion among like-minded individuals induces shifts toward the extreme.
Edit intent: clarity
Original:  Additionally, heuristic issue substitution can shift the effective reference point for discussion from the policy reference, yielding differential polarization by policy side.
Revised:  Additionally, use of a heuristic frame can shift the effective reference point for discussion from the policy reference, yielding differential polarization by policy side.
Edit intent: clarity
Original:  Additionally, heuristic issue substitution can shift the effective reference point for discussion from the policy reference, yielding differential polarization by policy side.
Revised:  Additionally, heuristic issue substitution can shift the frame reference point away from the policy reference, yielding differential polarization by policy side.
Edit intent: clarity
Original:  The results, which challenge existing polarization theories , are in qualitative and quantitative accord with our theory and models .
Revised:  The results, which challenge existing polarization theory , are in qualitative and quantitative accord with our theory and models .
Edit intent: fluency
Original:  The results, which challenge existing polarization theories , are in qualitative and quantitative accord with our theory and models .
Revised:  The results, which challenge existing polarization theories , are in qualitative and quantitative accord with our theory and model .
Edit intent: fluency
Original:  The identification of such roles provides key insight into the organization of networks and can also be used to inform machine learning on graphs .
Revised:  The identification of such roles provides key insight into the organization of networks and can be used for a variety of machine learning tasks .
Edit intent: clarity
Original:  However, learning structural representations of nodes is a challenging unsupervised-learning task, which typically involves manually specifying and tailoring topological features for each node.
Revised:  However, learning structural representations of nodes is a challenging problem, and it has typically involved manually specifying and tailoring topological features for each node.
Edit intent: clarity
Original:  Here we develop GraphWave, a method that represents each node's local network neighborhood via a low-dimensional embedding by leveraging spectral graph wavelet diffusion patterns.
Revised:  In this paper, we develop GraphWave, a method that represents each node's local network neighborhood via a low-dimensional embedding by leveraging spectral graph wavelet diffusion patterns.
Edit intent: clarity
Original:  Here we develop GraphWave, a method that represents each node's local network neighborhood via a low-dimensional embedding by leveraging spectral graph wavelet diffusion patterns.
Revised:  Here we develop GraphWave, a method that represents each node's network neighborhood via a low-dimensional embedding by leveraging spectral graph wavelet diffusion patterns.
Edit intent: clarity
Original:  We prove that nodes with similar local network neighborhoods will have similar GraphWave embeddings even though these nodes may reside in very different parts of the network .
Revised:  We prove that nodes with similar network neighborhoods will have similar GraphWave embeddings even though these nodes may reside in very different parts of the network .
Edit intent: clarity
Original:  We evaluate performance on both synthetic and real-world datasets, obtaining improvements of up to 71\% over state-of-the-art baselines  .
Revised:  We evaluate performance on both synthetic and real-world potential for capturing structural roles in networks, and our approach outperforms existing state-of-the-art baselines .
Edit intent: clarity
Original:  We also give a nearly optimal construction when there are two global parities (h=2) and improve existing constructions when there are three global parities (h=3).
Revised:  We also give an optimal construction when there are two global parities (h=2) and improve existing constructions when there are three global parities (h=3).
Edit intent: clarity
Original: In recent years the explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes.
Revised: The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes.
Edit intent: clarity
Original: We prove that Lipschitz learning on graphs is consistent with the absolutely minimal Lipschitz extension problem in the limit of infinite unlabeled data and finite labeled data.
Revised: We study the consistency of Lipschitz learning on graphs is consistent with the absolutely minimal Lipschitz extension problem in the limit of infinite unlabeled data and finite labeled data.
Edit intent: clarity
Original: We prove that Lipschitz learning on graphs is consistent with the absolutely minimal Lipschitz extension problem in the limit of infinite unlabeled data and finite labeled data.
Revised: We prove that Lipschitz learning on graphs in the limit of infinite unlabeled data and finite labeled data.
Edit intent: clarity
Original:  In this Pearl, we show how to implement delimited continuations in terms of exceptions and state, a construction we call thermometer continuations .
Revised:  In this Pearl, we show how to implement delimited continuations in terms of exceptions and state, a construction we call thermometer continuations .
Edit intent: fluency
Original:  While traditional implementations of delimited continuations require some way of "capturing" an intermediate state of the computation, the insight of thermometer continuations is to reach this intermediate state by replaying the entire computation from the start, guiding it using a "replay stack" it so that the same thing happens until the captured point.
Revised:  While traditional implementations of delimited continuations require some way of "capturing" an intermediate state of the computation, the insight of thermometer continuations is to reach this intermediate state by replaying the entire computation from the start, guiding it using a recording it so that the same thing happens until the captured point.
Edit intent: clarity
Original:  Remarkably, this model is known to have a dual equivalent representation in terms of phase, called the \theta -model, which has advantages for numerical simulations and analysis over the QIF model.
Revised:  Remarkably, this model is known to have a dual equivalent representation in terms of phase, called the \theta -model, which has advantages for numerical simulations and analysis over the QIF model.
Edit intent: fluency
Original:  Moreover, I show the condition for which the phase models exhibit discontinuous onset firing rate, a defining characteristics of Type-II spiking neurons.
Revised:  Moreover, I show the condition for which the phase models exhibit discontinuous onset firing rate, the hallmark of Type-II spiking neurons.
Edit intent: clarity
Original:  In this paper, we show that for curves with long edges the Fr\'echet distance computations become easier.
Revised:  In this paper, we show that for a special class of curves the Fr\'echet distance computations become easier.
Edit intent: clarity
Original:  Let P and Q be two polygonal curves in \mathbb{R \Reals ^d with n and m vertices, respectively.
Revised:  Let P and Q be two polygonal curves in \Reals ^d with n and m vertices, respectively.
Edit intent: clarity
Original: Computing the ~%DIFDELCMD < \Frd%%% \ between two polygonal curves takes roughly quadratic time.
Revised: Computing the %DIFDELCMD < \Frd%%% \ between two polygonal curves takes roughly quadratic time.
Edit intent: fluency
Original: A network of social sensors estimate an unknown  state of nature  by performing Bayesian Social Learning, and myopically optimize individual reward functions.
Revised: A sequence of social sensors estimate an unknown state of nature by performing Bayesian Social Learning, and myopically optimize individual reward functions.
Edit intent: clarity
Original: A network of social sensors estimate an unknown  state of nature  by performing Bayesian Social Learning, and myopically optimize individual reward functions.
Revised: A network of social sensors estimate an unknown state of nature ) by performing Bayesian Social Learning, and myopically optimize individual reward functions.
Edit intent: fluency
Original:  How should a fusion center dynamically incen- tivize the social sensors for acquiring the information about the underlying state?
Revised:  How should a fusion center dynamically incentivize the social sensors for acquiring the information about the underlying state?
Edit intent: fluency
Original:  How should a fusion center dynamically incen- tivize the social sensors for acquiring the information about the underlying state?
Revised:  How should a fusion center dynamically incen- tivize the social sensors for acquiring information about the underlying state?
Edit intent: fluency
Original:  Finally , uniform bounds on the average additional cost incurred by the fusion center for employing a sub-optimal policy are provided.
Revised:  Fourth , uniform bounds on the average additional cost incurred by the fusion center for employing a sub-optimal policy are provided.
Edit intent: fluency
Original:  This characterizes the trade-off between the cost of information acquisition and consistency , for the fusion center  .
Revised:  This characterizes the trade-off between the cost of information acquisition and consistency for the fusion center .
Edit intent: fluency
Original: Average response properties of cortical sensory neurons such as firing rate and feature tuning are known to change with behavioral state.
Revised: Behavioral states marked by varying levels of arousal and attention modulate some properties of cortical sensory neurons such as firing rate and feature tuning are known to change with behavioral state.
Edit intent: clarity
Original:  Neurons recorded in the visual motion-sensitive  middle temporal cortex ( area MT) in sufentanil-anesthetized non-human primates tend to have lower average spike counts and greater trial-to-trial variability in response to constant direction stimuli compared to the alert state.
Revised:  Neurons recorded in the visual motion-sensitive neurons in middle temporal cortex ( area MT) in sufentanil-anesthetized non-human primates tend to have lower average spike counts and greater trial-to-trial variability in response to constant direction stimuli compared to the alert state.
Edit intent: clarity
Original:  Neurons recorded in the visual motion-sensitive  middle temporal cortex ( area MT) in sufentanil-anesthetized non-human primates tend to have lower average spike counts and greater trial-to-trial variability in response to constant direction stimuli compared to the alert state.
Revised:  Neurons recorded in the visual motion-sensitive middle temporal cortex ( MT) in sufentanil-anesthetized non-human primates tend to have lower average spike counts and greater trial-to-trial variability in response to constant direction stimuli compared to the alert state.
Edit intent: clarity
Original:  Neurons recorded in the visual motion-sensitive  middle temporal cortex ( area MT) in sufentanil-anesthetized non-human primates tend to have lower average spike counts and greater trial-to-trial variability in response to constant direction stimuli compared to the alert state.
Revised:  Neurons recorded in the visual motion-sensitive middle temporal cortex ( area MT) in sufentanil-anesthetized non-human primates tend to have lower average spike counts , without decreasing trial-to-trial variability in response to constant direction stimuli compared to the alert state.
Edit intent: clarity
Original:  Neurons recorded in the visual motion-sensitive  middle temporal cortex ( area MT) in sufentanil-anesthetized non-human primates tend to have lower average spike counts and greater trial-to-trial variability in response to constant direction stimuli compared to the alert state.
Revised:  Neurons recorded in the visual motion-sensitive middle temporal cortex ( area MT) in sufentanil-anesthetized non-human primates tend to have lower average spike counts and greater trial-to-trial variability compared to the alert state.
Edit intent: clarity
Original:  Anesthesia-induced increases in response variation create supra-Poisson variance-to-mean ratios (Fano factors) on time scales of%DIFDELCMD < \sim250 %%% ms.
Revised:  Anesthesia-induced increases in response variation create supra-Poisson %DIFDELCMD < \sim250 %%% ms.
Edit intent: clarity
Original:  We find that alert-state MT neurons have higher mean firing rates , lower spike count variance, and largely sub-Poisson variability that is stimulus-dependent and cannot be explained by firing rate differences alone.
Revised:  We find that alert-state MT neurons have higher mean firing rates and largely sub-Poisson variability that is stimulus-dependent and cannot be explained by firing rate differences alone.
Edit intent: clarity
Original:  A simple model explains qualitative shifts in the distribution of observed Fano factors in the two states via a suppression in the variance of gain fluctuations  in the alert state.
Revised:  A simple model explains qualitative shifts in the distribution of observed Fano factors via a suppression in the variance of gain fluctuations in the alert state.
Edit intent: clarity
Original: This paper proposes a hybrid data mining approach to quantitatively analyze product complexity of prefabricated construction components from product nonconforming quality performance data .
Revised: This paper proposes a hybrid data mining approach to quantitatively analyze the complexity of prefabricated construction components from product nonconforming quality performance data .
Edit intent: fluency
Original: This paper proposes a hybrid data mining approach to quantitatively analyze product complexity of prefabricated construction components from product nonconforming quality performance data .
Revised: This paper proposes a hybrid data mining approach to quantitatively analyze product complexity of prefabricated construction components through the integration of quality performance-based measures with associated engineering design information .
Edit intent: clarity
Original:  The research outcomes provide valuable insights for practitioners to better analyze and manage product complexity.
Revised:  The research outcomes provide simplified, interpretable, and informative insights for practitioners to better analyze and manage product complexity.
Edit intent: clarity
Original: Network translation has recently be used to establish steady state properties of mass action systems by corresponding the given system to a generalized one which is either dynamically or steady state equivalent.
Revised: Network translation has recently been used to establish steady state properties of mass action systems by corresponding the given system to a generalized one which is either dynamically or steady state equivalent.
Edit intent: fluency
Original:  In addition to establishing the capacity for absolute concentration robustness, we show that , in contrast to existing results, network translation can often provide a method for deriving the steady state value of the robust species.
Revised:  In addition to establishing the capacity for absolute concentration robustness, we show that network translation can often provide a method for deriving the steady state value of the robust species.
Edit intent: clarity
Original:  In this paper, the problem of training a two-layer SNNs is studied for the purpose of classification, under a Generalized Linear Model (GLM) probabilistic neural model that was previously considered within the computational neuroscience literature.
Revised:  In this paper, the problem of training a two-layer SNN is studied for the purpose of classification, under a Generalized Linear Model (GLM) probabilistic neural model that was previously considered within the computational neuroscience literature.
Edit intent: fluency
Original:  We propose a general framework based on the generating function to calculate the CNBD distributions of complex networks.
Revised:  We propose a general framework to calculate the CNBD distributions of complex networks.
Edit intent: clarity
Original:  In particular, we show that for } the ER network, the CNBD distribution obey the Poisson law for node sets of any size .
Revised:  In particular, we show that for } the ER network, the CNS of node sets with an arbitrary size obeys the Poisson distribution .
Edit intent: clarity
Original: Over the years, quantifying  similarity of nodes has been a hot topic , yet distributions of node similarity for complex networks remain unknown .
Revised: Over the years, quantifying the similarity of nodes has been a hot topic , yet distributions of node similarity for complex networks remain unknown .
Edit intent: fluency
Original: Over the years, quantifying  similarity of nodes has been a hot topic , yet distributions of node similarity for complex networks remain unknown .
Revised: Over the years, quantifying similarity of nodes has been a hot topic in complex networks, yet little has been known about the distributions of node-similarity .
Edit intent: clarity
Original:  In this paper, we consider a typical measure called common neighbor based similarity (CNS) , which literally characterizes similarity of nodes based on the number of common neighbors (CN) they share in the network .
Revised:  In this paper, we consider a typical measure of node-similarity called the common neighbor based similarity (CNS) , which literally characterizes similarity of nodes based on the number of common neighbors (CN) they share in the network .
Edit intent: clarity
Original:  In this paper, we consider a typical measure called common neighbor based similarity (CNS) , which literally characterizes similarity of nodes based on the number of common neighbors (CN) they share in the network .
Revised:  In this paper, we consider a typical measure called common neighbor based similarity (CNS) .
Edit intent: coherence
Original:  In particular, we show that for the ER network, the CNS of node sets with an arbitrary size obeys the Poisson distribution .
Revised:  In particular, we show that for the ER network, the CNS of node sets of any particular size obeys the Poisson distribution .
Edit intent: clarity
Original:  In particular, we show that for the ER network, the CNS of node sets with an arbitrary size obeys the Poisson distribution .
Revised:  In particular, we show that for the ER network, the CNS of node sets with an arbitrary size obeys the Poisson law .
Edit intent: clarity
Original:  We also connect the node similarity distribution to the link prediction problem.
Revised:  We also connect the node-similarity distribution to the link prediction problem.
Edit intent: fluency
Original:  An interesting finding is that the prediction performance depends solely on the CNS distributions of connected node pairs and unconnected ones.
Revised:  We found that the performance of link prediction depends solely on the CNS distributions of connected node pairs and unconnected ones.
Edit intent: clarity