wanyu/IteraTeR_v2 huggingface dataset:
Original:  We discuss its potential in the context of survey research, describing how this approach can capture and quantify valuable information arising from multiple sources of response uncertainty-which would be lost using conventional approaches--while preserving a high degree of response-efficiency.
Revised:  We discuss its potential to capture and quantify valuable information arising from multiple sources of response uncertainty-which would be lost using conventional approaches--while preserving a high degree of response-efficiency.
Edit intent: clarity
Original:   We then report a validation study, which utilizes our recently introduced open-source software (DECSYS) to administer an electronic interval-valued survey.
Revised:  We then report a validation study, utilizing our recently introduced open-source software (DECSYS) to administer an electronic interval-valued survey.
Edit intent: fluency
Original:   We then report a validation study, which utilizes our recently introduced open-source software (DECSYS) to administer an electronic interval-valued survey.
Revised:  We then report a validation study, which utilizes our recently introduced open-source software (DECSYS) to explore how interval-valued survey.
Edit intent: clarity
Original: This paper is focused on SIS  epidemic dynamics (also known as the contact process) on stationary Poisson point processes of the Euclidean plane, when the infection rate of a susceptible point is proportional to the number of infected points in a ball around it.
Revised: This paper is focused on SIS epidemic dynamics (also known as the contact process) on stationary Poisson point processes of the Euclidean plane, where the infection rate of a susceptible point is proportional to the number of infected points in a ball around it.
Edit intent: fluency
Original: This paper is focused on SIS  epidemic dynamics (also known as the contact process) on stationary Poisson point processes of the Euclidean plane, when the infection rate of a susceptible point is proportional to the number of infected points in a ball around it.
Revised: This paper is focused on SIS epidemic dynamics (also known as the contact process) on stationary Poisson point processes of the Euclidean plane, when the infection rate of a susceptible individual is proportional to the number of infected points in a ball around it.
Edit intent: clarity
Original: This paper is focused on SIS  epidemic dynamics (also known as the contact process) on stationary Poisson point processes of the Euclidean plane, when the infection rate of a susceptible point is proportional to the number of infected points in a ball around it.
Revised: This paper is focused on SIS epidemic dynamics (also known as the contact process) on stationary Poisson point processes of the Euclidean plane, when the infection rate of a susceptible point is proportional to the number of infected individuals in a disc around it.
Edit intent: clarity
Original:  Two models are discussed, the first with a static point process, and the second where points are  subject to some random motion.
Revised:  The main focus of the paper is a model where points are subject to some random motion.
Edit intent: clarity
Original:  Two models are discussed, the first with a static point process, and the second where points are  subject to some random motion.
Revised:  Two models are discussed, the first with a static point process, and the second where points are also subject to some random motion.
Edit intent: clarity
Original:  For both models, we use conservation equations for moment measures  to analyze the stationary  point processes of infected and susceptible points .
Revised:  Conservation equations for moment measures to analyze the stationary point processes of infected and susceptible points .
Edit intent: clarity
Original:  For both models, we use conservation equations for moment measures  to analyze the stationary  point processes of infected and susceptible points .
Revised:  For both models, we use conservation equations for moment measures are leveraged to analyze the stationary point processes of infected and susceptible points .
Edit intent: clarity
Original:  For both models, we use conservation equations for moment measures  to analyze the stationary  point processes of infected and susceptible points .
Revised:  For both models, we use conservation equations for moment measures to analyze the stationary regime of the point processes of infected and susceptible points .
Edit intent: clarity
Original:  For both models, we use conservation equations for moment measures  to analyze the stationary  point processes of infected and susceptible points .
Revised:  For both models, we use conservation equations for moment measures to analyze the stationary point processes of infected and susceptible individuals .
Edit intent: clarity
Original:  A heuristic factorization of the third moment measure is then proposed to derive simple polynomial equations allowing one to derive closed form approximations for the fraction of infected nodes and the steady state.
Revised:  A heuristic factorization of the third moment measure is then proposed to obtain simple polynomial equations allowing one to derive closed form approximations for the fraction of infected nodes and the steady state.
Edit intent: fluency
Original:  A heuristic factorization of the third moment measure is then proposed to derive simple polynomial equations allowing one to derive closed form approximations for the fraction of infected nodes and the steady state.
Revised:  A heuristic factorization of the third moment measure is then proposed to derive simple polynomial equations allowing one to derive closed form approximations for the fraction of infected individuals in the steady state.
Edit intent: clarity
Original:  According to this phase diagram , the survival of the epidemic is not always an increasing function of the motion rate.
Revised:  A key take-away from this phase diagram , the survival of the epidemic is not always an increasing function of the motion rate.
Edit intent: clarity
Original:  According to this phase diagram , the survival of the epidemic is not always an increasing function of the motion rate.
Revised:  According to this phase diagram is that the extinction of the epidemic is not always an increasing function of the motion rate.
Edit intent: clarity
Original:  According to this phase diagram , the survival of the epidemic is not always an increasing function of the motion rate.
Revised:  According to this phase diagram , the survival of the epidemic is not always aided by a decrease in the motion rate.
Edit intent: clarity
Original:  These simulations show that the polynomial equations accurately predict the fraction of infected nodes when the epidemic survives.
Revised:  These simulations show that the polynomial equations accurately predict the fraction of infected individuals when the epidemic survives.
Edit intent: clarity
Original: We define a new structure for collections of nodes in trees which are called "Sweep-Covers" for their 'covering' of all the nodes in the tree by some ancestor-descendent relationship.
Revised: I define a collections of nodes in trees which are called "Sweep-Covers" for their 'covering' of all the nodes in the tree by some ancestor-descendent relationship.
Edit intent: clarity
Original: I define a collections of nodes in trees which are called "Sweep-Covers" for their 'covering' of all the nodes in the tree by some ancestor-descendent relationship.
Revised: I define a collections of nodes in trees which are called "Sweep-Covers" for their 'covering' of all the nodes by some ancestor-descendent relationship.
Edit intent: coherence
Original:  Then, I analyze an algorithm for finding all sweep covers of a given size in any tree.
Revised:  This work provides an algorithm for finding all sweep covers of a given size in any tree.
Edit intent: clarity
Original:  Then, I analyze an algorithm for finding all sweep covers of a given size in any tree.
Revised:  Then, I analyze an algorithm for finding all sweep-covers of a given size in any tree.
Edit intent: fluency
Original:  The complexity of the algorithmis analyzed on a class of infinite \Delta-ary trees with constant path lengths between the \Delta-star internal nodes.
Revised:  The algorithm's complexity is proven on a class of infinite \Delta-ary trees with constant path lengths between the \Delta-star internal nodes.
Edit intent: clarity
Original: Conventional sparse retrieval methods such as TF-IDF and BM25 are simple and efficient, but solely rely on lexical overlap and fail to conduct semantic matching.
Revised: Conventional sparse retrieval methods such as TF-IDF and BM25 are simple and efficient, but solely rely on lexical overlap without semantic matching.
Edit intent: clarity
Original:  We show that generating various contexts of a query is beneficial as fusing their results consistently yields a better retrieval accuracy.
Revised:  We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy.
Edit intent: clarity
Original:  Moreover, GAR achieves the state-of-the-art performance of extractive QA on the Natural Questions and TriviaQA datasets  when equipped with an extractive reader  .
Revised:  Moreover, GAR achieves the state-of-the-art performance on the Natural Questions and TriviaQA datasets when equipped with an extractive reader .
Edit intent: clarity
Original:  In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query with relevant contexts through text generation  .
Revised:  In this paper, we present Generation-Augmented Retrieval (GAR) , a query expansion method that augments a query through text generation .
Edit intent: clarity
Original:  We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense  methods such as DPR \mbox{ karpukhin2020dense .
Revised:  We demonstrate that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \mbox{ karpukhin2020dense .
Edit intent: clarity
Original:  We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense  methods such as DPR \mbox{ karpukhin2020dense .
Revised:  We demonstrate on open-domain question answering that the generated contexts substantially enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \mbox{ karpukhin2020dense .
Edit intent: fluency
Original:  We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense  methods such as DPR \mbox{ karpukhin2020dense .
Revised:  We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense methods such as DPR \mbox{ karpukhin2020dense .
Edit intent: coherence
Original:  We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense  methods such as DPR \mbox{ karpukhin2020dense .
Revised:  We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than state-of-the-art dense methods such as DPR \mbox{ karpukhin2020dense .
Edit intent: fluency
Original:  We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense  methods such as DPR \mbox{ karpukhin2020dense .
Revised:  We demonstrate on open-domain question answering that the generated contexts significantly enrich the semantics of the queries and thus GAR with sparse representations (BM25) achieves comparable or better performance than the state-of-the-art dense retrieval methods such as DPR \mbox{ karpukhin2020dense .
Edit intent: clarity
Original:  We show that generating various contexts of a query is beneficial as fusing their results consistently yields better retrieval accuracy.
Revised:  We show that generating diverse contexts for a query is beneficial as fusing their results consistently yields better retrieval accuracy.
Edit intent: clarity
Original:  We show that, unlike pruning after training, accuracy is the same or higher when randomly shuffling which weights these methods prune within each layer or sampling new initial values  .
Revised:  We show that, unlike pruning after training, randomly shuffling the weights these methods prune within each layer or sampling new initial values .
Edit intent: clarity
Original:  This property undermines the claimed justifications for these methods and suggests broader challenges with the underlying pruning heuristics, the desire to prune at initialization, or both.
Revised:  This property suggests broader challenges with the underlying pruning heuristics, the desire to prune at initialization, or both.
Edit intent: clarity
Original:  Remarkably, there exists a number of fair cost-sharing mechanisms (e.g., equal-split, proportional-split, egalitarian and Nash bargaining solutions of bargaining games) that model practical cost-sharing applications with desirable properties of stable coalition structure , such as its existence and a small strong price-of-anarchy (SPoA) for approximating the social optimum.
Revised:  Remarkably, there exist a number of fair cost-sharing mechanisms (e.g., equal-split, proportional-split, egalitarian and Nash bargaining solutions of bargaining games) that model practical cost-sharing applications with desirable properties of stable coalition structure , such as its existence and a small strong price-of-anarchy (SPoA) for approximating the social optimum.
Edit intent: fluency
Original:  Remarkably, there exists a number of fair cost-sharing mechanisms (e.g., equal-split, proportional-split, egalitarian and Nash bargaining solutions of bargaining games) that model practical cost-sharing applications with desirable properties of stable coalition structure , such as its existence and a small strong price-of-anarchy (SPoA) for approximating the social optimum.
Revised:  Remarkably, there exists a number of fair cost-sharing mechanisms (e.g., equal-split, proportional-split, egalitarian and Nash bargaining solutions of bargaining games) that model practical cost-sharing applications with desirable properties , such as its existence and a small strong price-of-anarchy (SPoA) for approximating the social optimum.
Edit intent: clarity
Original:  Remarkably, there exists a number of fair cost-sharing mechanisms (e.g., equal-split, proportional-split, egalitarian and Nash bargaining solutions of bargaining games) that model practical cost-sharing applications with desirable properties of stable coalition structure , such as its existence and a small strong price-of-anarchy (SPoA) for approximating the social optimum.
Revised:  Remarkably, there exists a number of fair cost-sharing mechanisms (e.g., equal-split, proportional-split, egalitarian and Nash bargaining solutions of bargaining games) that model practical cost-sharing applications with desirable properties of stable coalition structure , such as the existence of a stable coalition structure with a small strong price-of-anarchy (SPoA) for approximating the social optimum.
Edit intent: clarity
Original:  Remarkably, there exists a number of fair cost-sharing mechanisms (e.g., equal-split, proportional-split, egalitarian and Nash bargaining solutions of bargaining games) that model practical cost-sharing applications with desirable properties of stable coalition structure , such as its existence and a small strong price-of-anarchy (SPoA) for approximating the social optimum.
Revised:  Remarkably, there exists a number of fair cost-sharing mechanisms (e.g., equal-split, proportional-split, egalitarian and Nash bargaining solutions of bargaining games) that model practical cost-sharing applications with desirable properties of stable coalition structure , such as its existence and a small strong price-of-anarchy (SPoA) to approximate the social optimum.
Edit intent: fluency
Original:  In this paper, we close several gaps on the  results of decentralized coalition formation: (1) We establish a logarithmic lower bound on SPoA, and hence, show several previously known fair cost-sharing mechanisms are the best practical mechanisms with minimal SPoA. (2) We improve the SPoA of egalitarian and Nash bargaining cost-sharing mechanisms to match the lower bound.
Revised:  In this paper, we close several gaps on the previous results of decentralized coalition formation: (1) We establish a logarithmic lower bound on SPoA, and hence, show several previously known fair cost-sharing mechanisms are the best practical mechanisms with minimal SPoA. (2) We improve the SPoA of egalitarian and Nash bargaining cost-sharing mechanisms to match the lower bound.
Edit intent: fluency
Original:  Our results on computational efficiency related to archiving of information provide guiding principles for the future design of learning rules in order to make them practically usable in large-scale networks.
Revised:  Our results on computational efficiency related to archiving of information provide guidelines for the design of learning rules in order to make them practically usable in large-scale networks.
Edit intent: clarity
Original: The ability to predict the chemical properties of compounds is crucial in discovering novel materials and drugs with specific desired characteristics.
Revised: Predicting the chemical properties of compounds is crucial in discovering novel materials and drugs with specific desired characteristics.
Edit intent: clarity
Original:  However, these datasets are often biased due to various reasons, such as experimental plans and publication decisions, and the prediction models trained using such biased datasets often suffer from over-fitting to the biased distributions and perform poorly on subsequent uses.
Revised:  However, these datasets are often biased because of various reasons, such as experimental plans and publication decisions, and the prediction models trained using such biased datasets often suffer from over-fitting to the biased distributions and perform poorly on subsequent uses.
Edit intent: fluency
Original:  The present study focuses on mitigating bias in the experimental datasets.
Revised:  Hence, this study focused on mitigating bias in the experimental datasets.
Edit intent: coherence
Original:  To this purpose, we adopt two techniques from causal inference and domain adaptation combined with graph neural networks capable of handling molecular structures.
Revised:  We adopted two techniques from causal inference and domain adaptation combined with graph neural networks capable of handling molecular structures.
Edit intent: coherence
Original:  To this purpose, we adopt two techniques from causal inference and domain adaptation combined with graph neural networks capable of handling molecular structures.
Revised:  To this purpose, we adopt two techniques from causal inference and domain adaptation combined with graph neural networks that can represent molecular structures.
Edit intent: clarity
Original:  The experimental results in four possible bias scenarios show that the inverse propensity scoring-based method makes solid improvements, while the domain-invariant representation learning approach fails .
Revised:  The experimental results in four possible bias scenarios indicated that the inverse propensity scoring-based method makes solid improvements, while the domain-invariant representation learning approach fails .
Edit intent: clarity
Original:  The experimental results in four possible bias scenarios show that the inverse propensity scoring-based method makes solid improvements, while the domain-invariant representation learning approach fails .
Revised:  The experimental results in four possible bias scenarios show that the inverse propensity scoring-based method made solid improvements, while the domain-invariant representation learning approach fails .
Edit intent: fluency
Original:  The experimental results in four possible bias scenarios show that the inverse propensity scoring-based method makes solid improvements, while the domain-invariant representation learning approach fails .
Revised:  The experimental results in four possible bias scenarios show that the inverse propensity scoring-based method makes solid improvements, but the domain-invariant representation learning approach fails .
Edit intent: coherence
Original:  The experimental results in four possible bias scenarios show that the inverse propensity scoring-based method makes solid improvements, while the domain-invariant representation learning approach fails .
Revised:  The experimental results in four possible bias scenarios show that the inverse propensity scoring-based method makes solid improvements, while the domain-invariant representation learning approach failed .
Edit intent: fluency
Original: The Probabilistic p-Center problem under Pressure ( %DIFDELCMD < {\tt %%% Min PpCP ) is a variant of the usual %DIFDELCMD < {\tt %%% Min p-Center problem we recently introduced in the context of wildfire management.
Revised: The Probabilistic p-Center problem under Pressure ( %DIFDELCMD < {\tt %%% Min PpCP ) is a variant of the usual %DIFDELCMD < {\tt %%% Min p-Center problem we recently introduced in the context of wildfire management.
Edit intent: fluency
Original: The Probabilistic p-Center problem under Pressure ( %DIFDELCMD < {\tt %%% Min PpCP ) is a variant of the usual %DIFDELCMD < {\tt %%% Min p-Center problem we recently introduced in the context of wildfire management.
Revised: The Probabilistic p-Center problem under Pressure ( %DIFDELCMD < {\tt %%% Min PpCP ) is a variant of the usual %DIFDELCMD < {\tt %%% p-Center problem we recently introduced in the context of wildfire management.
Edit intent: fluency
Original:  The problem is \%basically to locate p shelters minimizing the maximum distance people will have to cover \%in order to reach one of these shelters to reach the closest accessible shelter in case of fire.
Revised:  The problem is to locate p shelters minimizing the maximum distance people will have to cover \%in order to reach one of these shelters to reach the closest accessible shelter in case of fire.
Edit intent: coherence
Original:  The problem is \%basically to locate p shelters minimizing the maximum distance people will have to cover \%in order to reach one of these shelters to reach the closest accessible shelter in case of fire.
Revised:  The problem is \%basically to locate p shelters minimizing the maximum distance people will have to cover to reach the closest accessible shelter in case of fire.
Edit intent: clarity
Original:  The landscape is divided in zones and is modeled as an edge-weighted graph with vertices corresponding to zones and edges corresponding to direct connections between two adjacent zones.
Revised:  The landscape is divided into zones and is modeled as an edge-weighted graph with vertices corresponding to zones and edges corresponding to direct connections between two adjacent zones.
Edit intent: fluency