wanyu/IteraTeR_v2 huggingface dataset:
Original: We consider social welfare functions that satisfy Arrow's classic axioms of independence of irrelevant alternatives and Pareto optimality when the outcome space is the convex hull over some finite set of alternatives.
Revised: We consider social welfare functions that satisfy Arrow's classic axioms of independence of irrelevant alternatives and Pareto optimality when the outcome space is the convex hull of some finite set of alternatives.
Edit intent: clarity
Original:  The domains admit arbitrary preferences over alternatives, which in turn completely determine an agent's preferences over all  outcomes.
Revised:  The domains admit arbitrary preferences over alternatives, which completely determine an agent's preferences over all outcomes.
Edit intent: clarity
Original:  However, the model for the underlying asset price process is typically based on data and found by a nonparametric statistical estimation procedure.
Revised:  However, the model for the underlying asset price process is typically based on data and found by a statistical estimation procedure.
Edit intent: clarity
Original: We study a model of seed dispersal that consists of an animal  moving diffusively, feeding on fruits and dispersing the seeds, which are later deposited and capable of germination.
Revised: We study a model of seed dispersal that considers the inclusion of an animal moving diffusively, feeding on fruits and dispersing the seeds, which are later deposited and capable of germination.
Edit intent: clarity
Original: We study a model of seed dispersal that consists of an animal  moving diffusively, feeding on fruits and dispersing the seeds, which are later deposited and capable of germination.
Revised: We study a model of seed dispersal that consists of an animal moving diffusively, feeding on fruits and transporting the seeds, which are later deposited and capable of germination.
Edit intent: clarity
Original: An ultra-high throughput low-density parity check (LDPC) decoder with an unrolled full-parallel architecture is proposed, which achieves the highest decoding throughput compared to previously reported LDPC decoders in  literature.
Revised: An ultra-high throughput low-density parity check (LDPC) decoder with an unrolled full-parallel architecture is proposed, which achieves the highest decoding throughput compared to previously reported LDPC decoders in the literature.
Edit intent: fluency
Original:  Furthermore, a finite-alphabet message passing algorithm is employed to replace the variable node update rule of  standard min-sum decoders with optimized look-up tables,  designed in a way that maximize the mutual information between decoding messages.
Revised:  Furthermore, a finite-alphabet message passing algorithm is employed to replace the variable node update rule of the standard min-sum decoders with optimized look-up tables, designed in a way that maximize the mutual information between decoding messages.
Edit intent: fluency
Original:  Furthermore, a finite-alphabet message passing algorithm is employed to replace the variable node update rule of  standard min-sum decoders with optimized look-up tables,  designed in a way that maximize the mutual information between decoding messages.
Revised:  Furthermore, a finite-alphabet message passing algorithm is employed to replace the variable node update rule of standard min-sum decoder with look-up tables, designed in a way that maximize the mutual information between decoding messages.
Edit intent: clarity
Original:  Furthermore, a finite-alphabet message passing algorithm is employed to replace the variable node update rule of  standard min-sum decoders with optimized look-up tables,  designed in a way that maximize the mutual information between decoding messages.
Revised:  Furthermore, a finite-alphabet message passing algorithm is employed to replace the variable node update rule of standard min-sum decoders with optimized look-up tables, which are designed in a way that maximize the mutual information between decoding messages.
Edit intent: coherence
Original:  Furthermore, a finite-alphabet message passing algorithm is employed to replace the variable node update rule of  standard min-sum decoders with optimized look-up tables,  designed in a way that maximize the mutual information between decoding messages.
Revised:  Furthermore, a finite-alphabet message passing algorithm is employed to replace the variable node update rule of standard min-sum decoders with optimized look-up tables, designed in a way that maximizes the mutual information between decoding messages.
Edit intent: fluency
Original: The fact that Parsimony may fail is not new.
Revised: To the known fact that Parsimony may fail is not new.
Edit intent: clarity
Original:  However , here we proved that no mater of what topology the true 9-taxon and greater species tree is the only thing you need to fail Parsimony is to have in this  tree three consecutive edges with lengths of some proportions.
Revised:  However , here we proved that no mater of what topology the true 9-taxon and greater species tree is the only thing one needs to break down Parsimony is to have in this tree three consecutive edges with lengths of some proportions.
Edit intent: clarity
Original:  However , here we proved that no mater of what topology the true 9-taxon and greater species tree is the only thing you need to fail Parsimony is to have in this  tree three consecutive edges with lengths of some proportions.
Revised:  However , here we proved that no mater of what topology the true 9-taxon and greater species tree is the only thing you need to fail Parsimony is to have in this species tree three consecutive edges with lengths of some proportions.
Edit intent: fluency
Original:  Therefore, Parsimony can be applied only when one knows for sure that the described lengths  cannot be met in the tree.
Revised:  Therefore, Parsimony may be applied only when one knows for sure that the described lengths cannot be met in the tree.
Edit intent: fluency
Original:  Therefore, Parsimony can be applied only when one knows for sure that the described lengths  cannot be met in the tree.
Revised:  Therefore, Parsimony can be applied only when the described lengths cannot be met in the tree.
Edit intent: clarity
Original:  For a fixed target graph H, the problem is to decide whether an input graph G, with each edge labeled by a pair of permutations of V(H), admits a homomorphism to H ' corresponding' to the labels, in a sense explained below.
Revised:  For a fixed target graph H, the problem is to decide whether an input graph G, with each edge labeled by a pair of permutations of V(H), admits a homomorphism to H ` corresponding' to the labels, in a sense explained below.
Edit intent: fluency
Original:  While most graphs H yield NP-complete problems, there are interesting cases of graphs H for which we solve the problem by Gaussian elimination.
Revised:  While most graphs H yield NP-complete problems, there are interesting cases of graphs H for which the problem is solved by Gaussian elimination.
Edit intent: clarity
Original:  In this note we only include {\em  {\em   the proofs for the case  H is reflexive  .
Revised:  In this note we only include {\em {\em the proofs for the case when H is reflexive .
Edit intent: clarity
Original:  In this paper, we arguably conduct the first systematic study of traffic engineering with segment routing in SDN based WANs.
Revised:  In this paper, we study practical traffic engineering (TE) with segment routing in SDN based WANs.
Edit intent: clarity
Original:  We then consider segment routing with shortest paths only, and prove that the traffic engineering problem can now be solved in (weakly ) polynomial time when the number of middlepoints per path is fixed and not part of the input.
Revised:  We then consider segment routing with shortest paths only, and prove that the traffic engineering problem can now be solved in weakly polynomial time when the number of middlepoints per path is fixed and not part of the input.
Edit intent: fluency
Original:  We then consider segment routing with shortest paths only, and prove that the traffic engineering problem can now be solved in (weakly ) polynomial time when the number of middlepoints per path is fixed and not part of the input.
Revised:  We then consider segment routing with shortest paths only, and prove that the traffic engineering problem can now be solved in (weakly ) polynomial time when the number of middlepoints is fixed and not part of the input.
Edit intent: clarity
Original:  We demonstrate that the network propensity for cooperation is determined by a network centrality measure here referred to as neighborhood importance index .
Revised:  We demonstrate that the propensity for cooperation is determined by a network centrality measure here referred to as neighborhood importance index .
Edit intent: clarity
Original:  In the presence of such mechanism, the evolution of cooperation is related to the dynamics of the levels of investments (i.e. probabilities of cooperation) of the individual nodes engaging in network interactions.
Revised:  In the presence of such mechanism, the evolution of cooperation is related to the dynamics of the levels of investments (i.e. probabilities of cooperation) of the individual nodes engaging in interactions.
Edit intent: clarity
Original:  We demonstrate that the propensity for cooperation is determined by a network centrality measure here referred to as neighborhood importance index , study the model in different random graph settings and discuss relevant implications to natural and artificial systems.
Revised:  We demonstrate that the propensity for cooperation is determined by a network centrality measure here referred to as neighborhood importance index and discuss relevant implications to natural and artificial systems.
Edit intent: clarity
Original:  To address the robustness of the state-based strategies to an invasion of defectors, we additionally provide an analysis which redefines the results for the case when a fraction of the network nodes behave as unconditional defectors.
Revised:  To address the robustness of the state-based strategies to an invasion of defectors, we additionally provide an analysis which redefines the results for the case when a fraction of the nodes behave as unconditional defectors.
Edit intent: clarity
Original:  We present mathematical analyses demonstrating the existence of a minimum time between cycles of chemotherapy for a protocol to be effective.
Revised:  We present mathematical analyses demonstrating the existence of a maximum time between cycles of chemotherapy for a protocol to be effective.
Edit intent: clarity
Original:  A mathematical equation is derived, which relates such a minimum time with the variables that govern the kinetics of the tumor and those characterizing the chemotherapeutic treatment.
Revised:  A mathematical equation is derived, which relates such a maximum time with the variables that govern the kinetics of the tumor and those characterizing the chemotherapeutic treatment.
Edit intent: clarity
Original: Flight delays have a negative effect on airlines, airports  and passengers.
Revised: Flight delays hurt airlines, airports and passengers.
Edit intent: clarity
Original: Flight delays have a negative effect on airlines, airports  and passengers.
Revised: Flight delays have a negative effect on airlines, airports , and passengers.
Edit intent: fluency
Original:  Moreover, the development of accurate prediction models for flight delays became cumbersome due to the complexity of air transportation system, the amount of methods for prediction, and the deluge of data related to such system .
Revised:  Moreover, the development of accurate prediction models for flight delays became cumbersome due to the complexity of air transportation system, the number of methods for prediction, and the deluge of data related to such system .
Edit intent: clarity
Original:  Moreover, the development of accurate prediction models for flight delays became cumbersome due to the complexity of air transportation system, the amount of methods for prediction, and the deluge of data related to such system .
Revised:  Moreover, the development of accurate prediction models for flight delays became cumbersome due to the complexity of air transportation system, the amount of methods for prediction, and the deluge of flight data .
Edit intent: clarity
Original:  We propose a taxonomy and summarize the initiatives used to address the flight delay prediction problem, according to scope, data  and computational methods, giving special attention to an increasing usage of machine learning methods.
Revised:  We propose a taxonomy and summarize the initiatives used to address the flight delay prediction problem, according to scope, data , and computational methods, giving special attention to an increasing usage of machine learning methods.
Edit intent: fluency
Original:  We propose a taxonomy and summarize the initiatives used to address the flight delay prediction problem, according to scope, data  and computational methods, giving special attention to an increasing usage of machine learning methods.
Revised:  We propose a taxonomy and summarize the initiatives used to address the flight delay prediction problem, according to scope, data and computational methods, giving particular attention to an increasing usage of machine learning methods.
Edit intent: fluency
Original:  We propose a taxonomy and summarize the initiatives used to address the flight delay prediction problem, according to scope, data  and computational methods, giving special attention to an increasing usage of machine learning methods.
Revised:  We propose a taxonomy and summarize the initiatives used to address the flight delay prediction problem, according to scope, data and computational methods, giving special attention to an increased usage of machine learning methods.
Edit intent: fluency
Original:  Besides, we also present a timeline of major works that depicts relationships between flight delay prediction problems and research trends to address them.
Revised:  Besides, we also present a timeline of significant works that depicts relationships between flight delay prediction problems and research trends to address them.
Edit intent: clarity
Original:  In this paper, we address the question of how to estimate the performance of a new  policy when we have log data from multiple historic policies.
Revised:  In this paper, we address the question of how to estimate the performance of a new target policy when we have log data from multiple historic policies.
Edit intent: fluency
Original:  In particular, we find that the standard Inverse Propensity Score (IPS) estimator suffers especially when logging and evaluation policies diverge -- to a point where throwing away data improves the variance of the estimator.
Revised:  In particular, we find that the standard Inverse Propensity Score (IPS) estimator suffers especially when logging and target policies diverge -- to a point where throwing away data improves the variance of the estimator.
Edit intent: clarity
Original:  A well-studied shortcoming is that extending it to disconnected graphs (and also directed graphs ) is controversial.
Revised:  A well-studied shortcoming is that extending it to disconnected graphs and directed graphs is controversial.
Edit intent: coherence
Original:  The second shortcoming is that when this measure is used in real-world networks, a huge number of vertices may have exactly the same closeness/eccentricity scores .
Revised:  The second shortcoming is that a huge number of vertices may have exactly the same closeness/eccentricity scores .
Edit intent: clarity
Original:  The second shortcoming is that when this measure is used in real-world networks, a huge number of vertices may have exactly the same closeness/eccentricity scores .
Revised:  The second shortcoming is that when this measure is used in real-world networks, a huge number of vertices may have exactly the same score .
Edit intent: clarity
Original:  The third shortcoming is that in many applications, the distance between two vertices not only depends on the size of shortest paths, but also on the number of shortest paths between them .
Revised:  The third shortcoming is that in many applications, the distance between two vertices not only depends on the length of shortest paths, but also on the number of shortest paths between them .
Edit intent: clarity
Original:  The third shortcoming is that in many applications, the distance between two vertices not only depends on the size of shortest paths, but also on the number of shortest paths between them .
Revised:  The third shortcoming is that in many applications, the distance between two vertices not only depends on the size of shortest paths, but also on the number of shortest paths .
Edit intent: clarity
Original:  In this paper,  we develop a new distance measure between vertices of a graph that yields discriminative distance-based centrality indices.
Revised:  In this paper, first we develop a new distance measure between vertices of a graph that yields discriminative distance-based centrality indices.
Edit intent: coherence
Original:  This measure is proportional to the size of shortest paths and inversely proportional to the number of shortest paths.
Revised:  This measure is proportional to the length of shortest paths and inversely proportional to the number of shortest paths.
Edit intent: clarity
Original:  We then develop randomized algorithms that precisely estimate average discriminative path length and average discriminative eccentricity and show that they give (\epsilon,\delta)-approximations of these indices.
Revised:  Second, we develop randomized algorithms that precisely estimate average discriminative path length and average discriminative eccentricity and show that they give (\epsilon,\delta)-approximations of these indices.
Edit intent: coherence
Original:  Finally, we preform extensive experiments over several real-world networks from different domains and show that compared to the traditional indices, discriminative indices have usually much more discriminability.
Revised:  Third, we perform extensive experiments over several real-world networks from different domains and show that compared to the traditional indices, discriminative indices have usually much more discriminability.
Edit intent: fluency
Original:  Finally, we preform extensive experiments over several real-world networks from different domains and show that compared to the traditional indices, discriminative indices have usually much more discriminability.
Revised:  Finally, we preform extensive experiments over several real-world networks from different domains . In our experiments, we first show that compared to the traditional indices, discriminative indices have usually much more discriminability.
Edit intent: coherence
Original:  We refer to this property as the tiny-world property .
Revised:  Fourth, in order to better motivate the usefulness of our proposed distance measure, we present a novel link prediction method, that uses discriminative distance to decide which vertices are more likely to form a link in future, and show its superior performance compared to the well-known existing measures .
Edit intent: coherence
Original: Learning an encoding of feature vectors in terms of an over-complete dictionary or a probabilistic information geometric (Fisher vectors) construct is wide-spread in statistical signal processing and computer vision.
Revised: Learning an encoding of feature vectors in terms of an over-complete dictionary or a information geometric (Fisher vectors) construct is wide-spread in statistical signal processing and computer vision.
Edit intent: clarity
Original:  We illustrate a variety of feature encodings incl. sparse dictionary coding and Fisher vectors along with proposing that a structured tensor factorization scheme enables us to perform retrieval that is at par, in terms of average precision, with Fisher vector encoded image signatures.
Revised:  We illustrate a variety of feature encodings incl. sparse dictionary coding and Fisher vectors along with proposing that a structured tensor factorization scheme enables us to perform retrieval that can be at par, in terms of average precision, with Fisher vector encoded image signatures.
Edit intent: clarity
Original:  It is shown that the conditioning of an implicit RK method behaves like that of the implicit Euler method.
Edit intent: coherence
Original:  Two solution strategies are considered for the linear system resulting from general implicit RK integration: the simultaneous solution where the system is solved as a whole  and a successive solution which follows the commonly used implementation of implicit RK methods to first transform the system into a number of smaller systems using the Jordan normal form of the RK matrix and then solve them successively.
Revised:  Two solution strategies are considered for the linear system resulting from general implicit RK integration: the simultaneous solution ( the system is solved as a whole and a successive solution which follows the commonly used implementation of implicit RK methods to first transform the system into a number of smaller systems using the Jordan normal form of the RK matrix and then solve them successively.
Edit intent: fluency
Original:  Two solution strategies are considered for the linear system resulting from general implicit RK integration: the simultaneous solution where the system is solved as a whole  and a successive solution which follows the commonly used implementation of implicit RK methods to first transform the system into a number of smaller systems using the Jordan normal form of the RK matrix and then solve them successively.
Revised:  Two solution strategies are considered for the linear system resulting from general implicit RK integration: the simultaneous solution where the system is solved as a whole ) and a successive solution which follows the commonly used implementation of implicit RK methods to first transform the system into a number of smaller systems using the Jordan normal form of the RK matrix and then solve them successively.
Edit intent: fluency
Original:  Two solution strategies are considered for the linear system resulting from general implicit RK integration: the simultaneous solution where the system is solved as a whole  and a successive solution which follows the commonly used implementation of implicit RK methods to first transform the system into a number of smaller systems using the Jordan normal form of the RK matrix and then solve them successively.
Revised:  Two solution strategies are considered for the linear system resulting from general implicit RK integration: the simultaneous solution where the system is solved as a whole and a successive solution which follows the commonly used implementation of implicit RK methods to first transform the system into smaller systems using the Jordan normal form of the RK matrix and then solve them successively.
Edit intent: clarity
Original:  Illustrative numerical examples are given.
Revised:  Numerical examples are given.
Edit intent: clarity
Original: Access to electronic health records (EHR) data has motivated computational advances in medical research.
Revised: Access to electronic health record (EHR) data has motivated computational advances in medical research.
Edit intent: fluency
Original:  In this paper, we propose a new approach, medical Generative Adversarial Network (medGAN), to generate realistic synthetic EHRs . Based on an input EHR dataset , medGAN can generate high-dimensional discrete variables (e.g., binary and count features) via a combination of an autoencoder and generative adversarial networks.
Revised:  In this paper, we propose a new approach, medical Generative Adversarial Network (medGAN), to generate realistic synthetic patient records . Based on an input EHR dataset , medGAN can generate high-dimensional discrete variables (e.g., binary and count features) via a combination of an autoencoder and generative adversarial networks.
Edit intent: clarity