wanyu/IteraTeR_v2 huggingface dataset:
Original:  For many extremal set theory problems, including the Erd \H{o Matching Conjecture, or the Complete t-Intersection Theorem, it is sufficient to deal with shifted families only.
Revised:  For many extremal set theory problems, including the Erd \H os Matching Conjecture, or the Complete t-Intersection Theorem, it is sufficient to deal with shifted families only.
Edit intent: fluency
Original:  In this note , we present very general approximation by juntas results for shifted families with explicit (and essentially linear) dependency on the input parameters.
Revised:  In this paper , we present very general approximation by juntas results for shifted families with explicit (and essentially linear) dependency on the input parameters.
Edit intent: clarity
Original:  The results are best possible up to some constant factors , moreover, they give meaningful statements for almost all range of values of n.
Revised:  The results are best possible up to some constant factors . Moreover, they give meaningful statements for almost all range of values of n.
Edit intent: fluency
Original:  The proofs are shorter than the proofs of the previous approximation by juntas results and are completely self-contained \ge  ]\choose  \le {\choose  {\choose  .
Revised:  The proofs are shorter than the proofs of the previous approximation by juntas results and are completely self-contained \ge ]\choose \le {\choose k {\choose .
Edit intent: clarity
Original:  The proofs are shorter than the proofs of the previous approximation by juntas results and are completely self-contained \ge  ]\choose  \le {\choose  {\choose  .
Revised:  The proofs are shorter than the proofs of the previous approximation by juntas results and are completely self-contained \ge ]\choose \le {\choose -{\choose .
Edit intent: clarity
Original:  The proofs are shorter than the proofs of the previous approximation by juntas results and are completely self-contained \ge  ]\choose  \le {\choose  {\choose  .
Revised:  The proofs are shorter than the proofs of the previous approximation by juntas results and are completely self-contained \ge ]\choose \le {\choose {\choose k .
Edit intent: fluency
Original:  Thus, the two parties should enter  derivative contracts with a negotiated price, which is the other part of the solution of the risk-sharing framework.
Revised:  Thus, the two parties should enter the derivative contracts with a negotiated price, which is the other part of the solution of the risk-sharing framework.
Edit intent: fluency
Original:  Thus, the two parties should enter  derivative contracts with a negotiated price, which is the other part of the solution of the risk-sharing framework.
Revised:  Thus, the two parties should enter derivative contracts with a negotiated price, and we call the negotiation a risk-sharing framework.
Edit intent: clarity
Original: [...] The most famous MC techniques were developed from the late 80s, bearing in mind the well-known "point-based" temporal logics LTL and CTL.
Revised: [...] The most famous model checking (MC) techniques were developed from the late 80s, bearing in mind the well-known "point-based" temporal logics LTL and CTL.
Edit intent: clarity
Original:  However, while the expressiveness of such logics is beyond doubt, there are some properties we may want to check  that are inherently "interval-based" and thus cannot be expressed by point-based temporal logics, e.g., "the proposition p has to hold in at least an average number of system states in a given computation sector".
Revised:  However, while the expressiveness of such logics is beyond doubt, there are some properties we may want to check over system models that are inherently "interval-based" and thus cannot be expressed by point-based temporal logics, e.g., "the proposition p has to hold in at least an average number of system states in a given computation sector".
Edit intent: clarity
Original:  The Halpern and Shoham's modal logic of time intervals (HS , for short ) is one of the most famous ITLs: it features one modality for each of the 13 possible ordering relations between pairs of intervals, apart from equality.
Revised:  The Halpern and Shoham's modal logic of time intervals (HS ) is one of the most famous ITLs: it features one modality for each of the 13 possible ordering relations between pairs of intervals, apart from equality.
Edit intent: clarity
Original:  When the agents can only acquire partial observations and are faced with a task requiring coordination and synchronisation skills, inter-agent communication plays an essential role.
Revised:  When the agents can only acquire partial observations and are faced with tasks requiring coordination and synchronisation skills, inter-agent communication plays an essential role.
Edit intent: fluency
Original:  In this work, we propose a framework for multi-agent training using deep deterministic policy gradients that enables the concurrent, end-to-end learning of an explicit communication protocol through a memory device.
Revised:  In this work, we propose a framework for multi-agent training using deep deterministic policy gradients that enables concurrent, end-to-end learning of an explicit communication protocol through a memory device.
Edit intent: fluency
Original:  A key algorithmic problem concerning the chase procedure is all-instances chase termination, that is, given a set TGDs , is it the case that the chase under this set of TGDs terminates , for every input database?
Revised:  A key problem concerning the chase procedure is all-instances chase termination, that is, given a set TGDs , is it the case that the chase under this set of TGDs terminates , for every input database?
Edit intent: clarity
Original:  A key algorithmic problem concerning the chase procedure is all-instances chase termination, that is, given a set TGDs , is it the case that the chase under this set of TGDs terminates , for every input database?
Revised:  A key algorithmic problem concerning the chase procedure is all-instances termination: for a given set of tuple-generating dependencies (TGDs) , is it the case that the chase under this set of TGDs terminates , for every input database?
Edit intent: clarity
Original:  A key algorithmic problem concerning the chase procedure is all-instances chase termination, that is, given a set TGDs , is it the case that the chase under this set of TGDs terminates , for every input database?
Revised:  A key algorithmic problem concerning the chase procedure is all-instances chase termination, that is, given a set TGDs , is it the case that the chase terminates for every input database?
Edit intent: clarity
Original:  In view of the fact that this problem is , in general, undecidable, it is natural to ask whether  well-behaved classes of TGDs , introduced in different contexts, ensure decidability.
Revised:  In view of the fact that this problem is undecidable, it is natural to ask whether well-behaved classes of TGDs , introduced in different contexts, ensure decidability.
Edit intent: coherence
Original:  In view of the fact that this problem is , in general, undecidable, it is natural to ask whether  well-behaved classes of TGDs , introduced in different contexts, ensure decidability.
Revised:  In view of the fact that this problem is , in general, undecidable, it is natural to ask whether known well-behaved classes of TGDs , introduced in different contexts, ensure decidability.
Edit intent: clarity
Original:  In view of the fact that this problem is , in general, undecidable, it is natural to ask whether  well-behaved classes of TGDs , introduced in different contexts, ensure decidability.
Revised:  In view of the fact that this problem is , in general, undecidable, it is natural to ask whether well-behaved classes of TGDs ensure decidability.
Edit intent: clarity
Original:  In this work, we concentrate on guarded TGDs, a prominent class of TGDs that has been introduced in the context of ontological reasoning .
Revised:  We consider here the main paradigms that led to robust TGD-based formalisms, that is, guardedness and stickiness .
Edit intent: clarity
Original:  Although all-instances chase termination is well-understood for the oblivious version of the chase (it is complete for 2EXPTIME), for the more subtle case of the restricted (a.k.a. the standard) chase it has remained open.
Revised:  Although all-instances termination is well-understood for the oblivious version of the chase (it is complete for 2EXPTIME), for the more subtle case of the restricted (a.k.a. the standard) chase it has remained open.
Edit intent: fluency
Original:  Although all-instances chase termination is well-understood for the oblivious version of the chase (it is complete for 2EXPTIME), for the more subtle case of the restricted (a.k.a. the standard) chase it has remained open.
Revised:  Although all-instances chase termination is well-understood for the oblivious version of the chase , the more subtle case of the restricted (a.k.a. the standard) chase it has remained open.
Edit intent: coherence
Original:  Based on the  United States granted patent database from 1976 to 2017, our analysis identifies the reference-based Jaccard index as the statistically superior measure, for explaining the historical diversifications and predicting future movement directions of both individual inventors and organizations across technology domains.
Revised:  Based on the complete United States granted patent database from 1976 to 2017, our analysis identifies the reference-based Jaccard index as the statistically superior measure, for explaining the historical diversifications and predicting future movement directions of both individual inventors and organizations across technology domains.
Edit intent: clarity
Original:  Based on the  United States granted patent database from 1976 to 2017, our analysis identifies the reference-based Jaccard index as the statistically superior measure, for explaining the historical diversifications and predicting future movement directions of both individual inventors and organizations across technology domains.
Revised:  Based on the United States granted patent database from 1976 to 2017, our analysis identifies a reference-based Jaccard index as the statistically superior measure, for explaining the historical diversifications and predicting future movement directions of both individual inventors and organizations across technology domains.
Edit intent: fluency
Original:  Finally, we corroborate the effectiveness of the proposed algorithms through extensive evaluations using both trace-driven simulations and simulations based on synthesized network settings .
Revised:  Finally, we corroborate the effectiveness of the proposed algorithms through extensive evaluations using trace-driven simulations and simulations based on synthesized network settings .
Edit intent: clarity
Original:  Finally, we corroborate the effectiveness of the proposed algorithms through extensive evaluations using both trace-driven simulations and simulations based on synthesized network settings .
Revised:  Finally, we corroborate the effectiveness of the proposed algorithms through extensive evaluations using both trace-driven simulations .
Edit intent: clarity
Original: This paper provides a surprisingly simple method for obtaining fast (constant amortized time) deterministic distributed algorithms for a highly-dynamic setting, in which arbitrarily many edge changes may occur in each round.
Revised: This paper provides a simple algorithmic template for obtaining fast (constant amortized time) deterministic distributed algorithms for a highly-dynamic setting, in which arbitrarily many edge changes may occur in each round.
Edit intent: clarity
Original: This paper provides a surprisingly simple method for obtaining fast (constant amortized time) deterministic distributed algorithms for a highly-dynamic setting, in which arbitrarily many edge changes may occur in each round.
Revised: This paper provides a surprisingly simple method for obtaining fast distributed algorithms for a highly-dynamic setting, in which arbitrarily many edge changes may occur in each round.
Edit intent: clarity
Original: This paper provides a simple algorithmic template for obtaining fast distributed algorithms for a highly-dynamic setting, in which arbitrarily many \emph{ edge changes may occur in each round.
Revised: This paper provides a simple algorithmic template for obtaining fast distributed algorithms for a highly-dynamic setting, in which \emph{ edge changes may occur in each round.
Edit intent: clarity
Original: This paper provides a simple algorithmic template for obtaining fast distributed algorithms for a highly-dynamic setting, in which arbitrarily many \emph{ edge changes may occur in each round.
Revised: This paper provides a simple algorithmic template for obtaining fast distributed algorithms for a highly-dynamic setting, in which arbitrarily many \emph{arbitrarily many edge changes may occur in each round.
Edit intent: fluency
Original: ~'95]. We call the subclass that we define locally-fixable labelings (LFLs).
Revised: ~'95]. We call the subclass that we define locally-fixable labelings (LFLs).
Edit intent: fluency
Original: This paper provides a simple algorithmic template for obtaining fast distributed algorithms for a highly-dynamic setting, in which \emph{arbitrarily many edge changes may occur in each round.
Revised: This paper provides an algorithmic framework for obtaining fast distributed algorithms for a highly-dynamic setting, in which \emph{arbitrarily many edge changes may occur in each round.
Edit intent: clarity
Original: This paper provides a simple algorithmic template for obtaining fast distributed algorithms for a highly-dynamic setting, in which \emph{arbitrarily many edge changes may occur in each round.
Revised: This paper provides a simple algorithmic template for obtaining fast distributed algorithms for a highly-dynamic setting, in which \emph{*arbitrarily many* edge changes may occur in each round.
Edit intent: fluency
Original:  Our algorithm significantly improves upon prior work in its combination of (1) having an O(1) amortized time complexity, (2)  not posing any restrictions on the dynamic behavior of the environment, ( 3 ) being deterministic, ( 4 ) having strong guarantees for intermediate solutions, and ( 5 ) being applicable for a wide family of tasks which we combinatorially define .
Revised:  Our algorithm significantly improves upon prior work in its combination of (1) having an O(1) amortized time complexity, (2) not posing any restrictions on the dynamic behavior of the environment, ( 4 ) being deterministic, ( 4 ) having strong guarantees for intermediate solutions, and ( 5 ) being applicable for a wide family of tasks which we combinatorially define .
Edit intent: coherence
Original:  Our algorithm significantly improves upon prior work in its combination of (1) having an O(1) amortized time complexity, (2)  not posing any restrictions on the dynamic behavior of the environment, ( 3 ) being deterministic, ( 4 ) having strong guarantees for intermediate solutions, and ( 5 ) being applicable for a wide family of tasks which we combinatorially define .
Revised:  Our algorithm significantly improves upon prior work in its combination of (1) having an O(1) amortized time complexity, (2) not posing any restrictions on the dynamic behavior of the environment, ( 3 ) being deterministic, ( 5 ) having strong guarantees for intermediate solutions, and ( 5 ) being applicable for a wide family of tasks which we combinatorially define .
Edit intent: coherence
Original: ~'95%DIFDELCMD < ]%%% . We call the subclass that we definelocally-fixable labelings (LFLs).
Revised: ~'95%DIFDELCMD < ]%%% locally-fixable labelings (LFLs).
Edit intent: coherence
Original: ~'95%DIFDELCMD < ]%%% . We call the subclass that we definelocally-fixable labelings (LFLs).
Revised: ~'95%DIFDELCMD < ]%%% . We call the subclass that we define (LFLs).
Edit intent: clarity
Original: As the global population ages, there is increased interest in living longer and improving  quality of life in later years.
Revised: As the global population ages, there is increased interest in living longer and improving one's quality of life in later years.
Edit intent: clarity
Original:  And despite successes in extending lifespan in model organisms there still are not any feasible solutions for delaying aging in humans.
Revised:  And despite research success to make model organisms live longer, there still aren't really any feasible solutions for delaying aging in humans.
Edit intent: clarity
Original:  With space travel, scientists could not know what it would take to get to the moon.
Revised:  With space travel, scientists couldn't know what it would take to get to the moon.
Edit intent: fluency
Original:  Perhaps with aging  we need a similar moonshot philosophy.
Revised:  Perhaps with aging , we need a similar moonshot philosophy.
Edit intent: fluency
Original:  This review therefore focuses on radical proposals that we hope might stimulate discussion on what we might consider doing differently to increase healthy human lifespan .
Revised:  This review therefore focuses on radical proposals . We hope it might stimulate discussion on what we might consider doing differently to increase healthy human lifespan .
Edit intent: coherence
Original:  These are in a sense optimal, since it is known that there is no FPTAS for bounded alphabets, while we prove that there is no EPTAS for unbounded alphabets .
Revised:  These are in a sense optimal, since it is known that there is no FPTAS for bounded alphabets, while we prove that there does not exist any EPTAS for unbounded alphabets .
Edit intent: clarity
Original:  Finally, we provide a matching conditional ( ] under the Exponential Time Hypothesis ) lower bound for any PTAS . As a side note, we prove that it is sufficient to work with only one threshold in the general variant of the problem.
Revised:  Finally, we provide a matching conditional ( ]. Furthermore, under the Exponential Time Hypothesis ) lower bound for any PTAS . As a side note, we prove that it is sufficient to work with only one threshold in the general variant of the problem.
Edit intent: coherence
Original:  This provides a missing piece in the earlier work of Dickinson ~\mbox{ Dickinson19500pt , Raab \mbox{ Raab1963}0pt }  ]  , and Green \mbox{ Green1968 .
Revised:  This provides a missing piece in the earlier work of Dickinson ~\mbox{ Dickinson19500pt , Raab \mbox{ Raab1963}0pt } ] , and Green Gre68 .
Edit intent: fluency
Original:  Our system is the start of the art on the TREC-CAR dataset and the top entry in the leaderboard of the MS MARCO passage retrieval task, outperforming the previous state of the art by 27\% (relative) in MRR@10.
Revised:  Our system is the state of the art on the TREC-CAR dataset and the top entry in the leaderboard of the MS MARCO passage retrieval task, outperforming the previous state of the art by 27\% (relative) in MRR@10.
Edit intent: fluency
Original:  The code to reproduce our submission is available at URL
Revised:  The code to reproduce our results is available at URL
Edit intent: clarity
Original: Computational fluid dynamics (CFD) models are emerging as mathematical tools to assist in the diagnostic assessment of cardiovascular disease.
Revised: Computational fluid dynamics (CFD) models are emerging as tools for assisting in diagnostic assessment of cardiovascular disease.
Edit intent: clarity
Original:  Recent advances in medical imaging and computational algorithms for analyzing said images have made subject-specific modeling of the cardiovascular system a feasible task .
Revised:  Recent advances in image segmentation has made subject-specific modeling of the cardiovascular system a feasible task .
Edit intent: clarity
Original:  Recent advances in medical imaging and computational algorithms for analyzing said images have made subject-specific modeling of the cardiovascular system a feasible task .
Revised:  Recent advances in medical imaging and computational algorithms for analyzing said images have made subject-specific modelling of the cardiovascular system a feasible task .
Edit intent: fluency
Original:  We introduce uncertainty in the blood vessel network by generating multiple segmentations of a pulmonary tree from a single image of an excised mouse lung using randomly selected pre-segmentation parameters.
Revised:  We introduce uncertainty in the blood vessel network by generating multiple segmentations of an image of an excised mouse lung using randomly selected pre-segmentation parameters.
Edit intent: clarity
Original:  We introduce uncertainty in the blood vessel network by generating multiple segmentations of a pulmonary tree from a single image of an excised mouse lung using randomly selected pre-segmentation parameters.
Revised:  We introduce uncertainty in the blood vessel network by generating multiple segmentations of a pulmonary tree from a single image of an excised mouse lung using different pre-segmentation parameters.
Edit intent: clarity
Original:  We use a custom MATLAB algorithm to extract vessel radii, length, and connectivity for each pulmonary network generated .
Revised:  A custom algorithm extracts vessel length, vessel radii, and network connectivity for each pulmonary network generated .
Edit intent: clarity
Original:  We use a custom MATLAB algorithm to extract vessel radii, length, and connectivity for each pulmonary network generated .
Revised:  We use a custom MATLAB algorithm to extract vessel radii, length, and connectivity for each segmented pulmonary network .
Edit intent: clarity
Original:  We quantify the uncertainty in geometric features of the network using density estimation techniques to specify probability densities for vessel radius and length .
Revised:  We quantify uncertainty in geometric features of the network using density estimation techniques to specify probability densities for vessel radius and length .
Edit intent: fluency
Original:  We quantify the uncertainty in geometric features of the network using density estimation techniques to specify probability densities for vessel radius and length .
Revised:  We quantify the uncertainty in geometric features by constructing probability densities for vessel radius and length .
Edit intent: clarity
Original:  We sample from these distributions , compute model parameters, and propagate uncertainties to pressure and flow predictions using a one-dimensional ( 1D ) fluid dynamics model.
Revised:  We sample from these distributions and propagate uncertainties to pressure and flow predictions using a one-dimensional ( 1D ) fluid dynamics model.
Edit intent: clarity
Original:  We sample from these distributions , compute model parameters, and propagate uncertainties to pressure and flow predictions using a one-dimensional ( 1D ) fluid dynamics model.
Revised:  We sample from these distributions , compute model parameters, and propagate uncertainties to pressure and flow predictions using a 1D ) fluid dynamics model.
Edit intent: fluency
Original:  We sample from these distributions , compute model parameters, and propagate uncertainties to pressure and flow predictions using a one-dimensional ( 1D ) fluid dynamics model.
Revised:  We sample from these distributions , compute model parameters, and propagate uncertainties to pressure and flow predictions using a one-dimensional ( 1D CFD model.
Edit intent: clarity
Original:  Results show that variation in network connectivity is a larger contributor to hemodynamic uncertainty in comparison to changes in vessel radius and length.
Revised:  Results show that variation in network connectivity is a larger contributor to haemodynamic uncertainty than vessel radius and length.
Edit intent: clarity