wanyu/IteraTeR_v2 huggingface dataset:
Original:  Cohort state-transition models (cSTM) are decision models commonly used in medical decision making to simulate hypothetical cohorts' transitions across various health states over time.
Revised:  Cohort state-transition models (cSTM) are decision models commonly used in medical decision-making to simulate hypothetical cohorts' transitions across various health states over time.
Edit intent: fluency
Original:  Cohort state-transition models (cSTM) are decision models commonly used in medical decision making to simulate hypothetical cohorts' transitions across various health states over time.
Revised:  Cohort state-transition models (cSTM) are decision models commonly used in medical decision making to simulate hypothetical cohorts' transitions among various health states over time.
Edit intent: fluency
Original:  We demonstrate how to calculate economic outcomes and conducting a cost-effectiveness analysis of multiple strategies using the example model, and provide additional resources to conduct probabilistic sensitivity analyses .
Revised:  We demonstrate how to calculate economic outcomes and conducting a cost-effectiveness analysis of multiple strategies , and conduct a probabilistic sensitivity analysis .
Edit intent: clarity
Original:  Protocols such as CoAP or MQTT-SN are weakened by the overhead of DTLS sessions, which in common deployment protect content transfer only up to the gateway.
Revised:  Protocols such as CoAP or MQTT-SN are degraded by the overhead of DTLS sessions, which in common deployment protect content transfer only up to the gateway.
Edit intent: clarity
Original:  To preserve end-to-end content security throughout gateways and proxies, the IETF CoRE working group recently developed OSCORE as an extension to CoAP, which adds content object security features commonly known from Information Centric Networks (ICN).
Revised:  To preserve content security end-to-end via gateways and proxies, the IETF CoRE working group recently developed OSCORE as an extension to CoAP, which adds content object security features commonly known from Information Centric Networks (ICN).
Edit intent: clarity
Original:  To preserve end-to-end content security throughout gateways and proxies, the IETF CoRE working group recently developed OSCORE as an extension to CoAP, which adds content object security features commonly known from Information Centric Networks (ICN).
Revised:  To preserve end-to-end content security throughout gateways and proxies, the IETF recently developed Object Security for Constrained RESTful Environments (OSCORE), which extends CoAP with content object security features commonly known from Information Centric Networks (ICN).
Edit intent: clarity
Original: Active inference provides a biologically plausible process theory of brain function .
Revised: Active inference is a normative framework for explaining behaviour under the free energy principle -- a theory of self-organisation originating in neuroscience .
Edit intent: clarity
Original:  It specifies neuronal dynamics for state-estimation in terms of a gradient descent on (variational) free energy -- a measure of the fit between an internal (generative) model and sensory observations.
Revised:  It specifies neuronal dynamics for state-estimation in terms of a descent on (variational) free energy -- a measure of the fit between an internal (generative) model and sensory observations.
Edit intent: clarity
Original:  When formulated for discrete state-space generative models, the free energy gradient turns out to be a prediction error -- plausibly encoded in the average membrane potentials of neuronal populations.
Revised:  The free energy gradient turns out to be a prediction error -- plausibly encoded in the average membrane potentials of neuronal populations.
Edit intent: clarity
Original:  When formulated for discrete state-space generative models, the free energy gradient turns out to be a prediction error -- plausibly encoded in the average membrane potentials of neuronal populations.
Revised:  When formulated for discrete state-space generative models, the free energy gradient is a prediction error -- plausibly encoded in the average membrane potentials of neuronal populations.
Edit intent: clarity
Original:  Conversely, the expected probability of a state can then be expressed in terms of  firing rates.
Revised:  Conversely, the expected probability of a state can be expressed in terms of firing rates.
Edit intent: coherence
Original:  The performance of belief updating is scored in terms of information length , a measure of the distance traveled in information space , which has a direct interpretation in terms of metabolic efficiency.
Revised:  The performance of belief updating in both schemes , a measure of the distance traveled in information space , which has a direct interpretation in terms of metabolic efficiency.
Edit intent: clarity
Original:  The performance of belief updating is scored in terms of information length , a measure of the distance traveled in information space , which has a direct interpretation in terms of metabolic efficiency.
Revised:  The performance of belief updating is scored in terms of information length , a measure of the distance traveled in information space that has a direct interpretation in terms of metabolic efficiency.
Edit intent: fluency
Original: We study a scenario in which an agent population wishes to identify a majority-supported proposal to change the status quo , where proposals are elements of an abstract space.
Revised: We study a setting in which a community wishes to identify a majority-supported proposal to change the status quo , where proposals are elements of an abstract space.
Edit intent: clarity
Original:  We identify a class of metric spaces, which includes all Euclidean spaces, for which the deliberation process isguaranteed to result insuccess : Deliberation will terminate with a majority coalition, as long as a majority-supported proposal exists.
Revised:  We identify a class of metric spaces, which includes all Euclidean spaces, for which the deliberation process isguaranteed to result in : Deliberation will terminate with a majority coalition, as long as a majority-supported proposal exists.
Edit intent: clarity
Original:  We describe a deliberation process in which agents dynamically form coalitions around proposals that they prefer over the status quo.
Revised:  We describe a process---called deliberation---in which agents dynamically form coalitions around proposals that they prefer over the status quo.
Edit intent: clarity
Original:  We describe a deliberation process in which agents dynamically form coalitions around proposals that they prefer over the status quo.
Revised:  We describe a deliberation process in which agents dynamically form coalitions around proposals they prefer over the status quo.
Edit intent: fluency
Original:  We formulate conditions  on the space of proposals and on the ways in which coalitions are formed  that guarantee deliberation to succeed, that is, to terminate by identifying a \% majority-supported proposal with the maximum support .
Revised:  We formulate conditions ( on the space of proposals and on the ways in which coalitions are formed that guarantee deliberation to succeed, that is, to terminate by identifying a \% majority-supported proposal with the maximum support .
Edit intent: fluency
Original:  We formulate conditions  on the space of proposals and on the ways in which coalitions are formed  that guarantee deliberation to succeed, that is, to terminate by identifying a \% majority-supported proposal with the maximum support .
Revised:  We formulate conditions on the space of proposals and on the ways in which coalitions are formed ) that guarantee deliberation to succeed, that is, to terminate by identifying a \% majority-supported proposal with the maximum support .
Edit intent: fluency
Original:  We formulate conditions  on the space of proposals and on the ways in which coalitions are formed  that guarantee deliberation to succeed, that is, to terminate by identifying a \% majority-supported proposal with the maximum support .
Revised:  We formulate conditions on the space of proposals and on the ways in which coalitions are formed that guarantee deliberation to succeed, that is, to terminate by identifying a majority-supported proposal with the maximum support .
Edit intent: clarity
Original:  We describe a process---called deliberation---in which agents dynamically form coalitions around proposals they prefer over the status quo.
Revised:  We describe a process -- called deliberation -- in which agents dynamically form coalitions around proposals they prefer over the status quo.
Edit intent: fluency
Original: This paper devotes to the construction of finite elements on grids that consist of general quadrilaterals not limited in parallelograms.
Revised: This paper is devoted to the construction of finite elements on grids that consist of general quadrilaterals not limited in parallelograms.
Edit intent: fluency
Original:  The two finite element spaces on general quadrilateral grids, together with the space of piecewise constant functions, formulate a discretised de Rham complex.
Revised:  The two finite element spaces on general quadrilateral grids, together with the space of piecewise constant functions, formulate a discretized de Rham complex.
Edit intent: fluency
Original:  A rigorous analysis is given in this paper that it is impossible to construct a practically useful finite element defined as Ciarlet's triple whose shape functions are always piecewise polynomials and which can form conforming subspaces on a grid that consists of arbitrary quadrilaterals.
Revised:  A rigorous analysis is given in this paper that it is impossible to construct a practically useful finite element defined as Ciarlet's triple that can formulate a finite element space which consists of continuous piecewise polynomial functions on a grid that consists of arbitrary quadrilaterals.
Edit intent: clarity
Original:  A rigorous analysis is given in this paper that it is impossible to construct a practically useful finite element defined as Ciarlet's triple whose shape functions are always piecewise polynomials and which can form conforming subspaces on a grid that consists of arbitrary quadrilaterals.
Revised:  A rigorous analysis is given in this paper that it is impossible to construct a practically useful finite element defined as Ciarlet's triple whose shape functions are always piecewise polynomials and which can form conforming subspaces on a grid that may include arbitrary quadrilaterals.
Edit intent: clarity
Original: Low rank tensor approximations have been employed successfully , for example, to build surrogate models that can be used to speed up large-scale inference problems in high dimensions.
Revised: Low-rank tensor approximations have been employed successfully , for example, to build surrogate models that can be used to speed up large-scale inference problems in high dimensions.
Edit intent: fluency
Original:  In this paper, we develop a-priori rank bounds for approximations in the functional Tensor-Train representation for the case of a Gaussian (normally distributed) model.
Revised:  In this paper, a-priori rank bounds for approximations in the functional Tensor-Train representation for the case of a Gaussian (normally distributed) model.
Edit intent: coherence
Original:  In this paper, we develop a-priori rank bounds for approximations in the functional Tensor-Train representation for the case of a Gaussian (normally distributed) model.
Revised:  In this paper, we develop a-priori rank bounds for approximations in the functional tensor-train representation for the case of a Gaussian (normally distributed) model.
Edit intent: fluency
Original:  We show that under suitable conditions on the precision matrix, we can represent the Gaussian density  to high accuracy without suffering from an exponential growth of complexity as the dimension increases.
Revised:  We show that under suitable conditions on the precision matrix, the Gaussian density to high accuracy without suffering from an exponential growth of complexity as the dimension increases.
Edit intent: clarity
Original:  Our results provide evidence of the suitability and limitations of low rank tensor methods in a simple but important model case.
Revised:  These results provide a rigorous justification of the suitability and limitations of low rank tensor methods in a simple but important model case.
Edit intent: clarity
Original:  Our results provide evidence of the suitability and limitations of low rank tensor methods in a simple but important model case.
Revised:  Our results provide evidence of the suitability and the limitations of low-rank tensor methods in a simple but important model case.
Edit intent: fluency
Original:  We show that AMSNP has a complexity dichotomy if and only if Constraint Satisfaction Problems for reducts of finitely bounded homogeneous structures have a complexity dichotomy .
Revised:  We show that AMSNP has a complexity dichotomy if and only if Constraint Satisfaction Problems for reducts of finitely bounded homogeneous structures .
Edit intent: fluency
Original:  The connection to CSPs also implies that every AMSNP sentence can be evaluated in polynomial time on classes of finite structures of bounded treewidth.
Revised:  The connection to CSPs also implies that every ASNP sentence can be evaluated in polynomial time on classes of finite structures of bounded treewidth.
Edit intent: fluency
Original:  The proof relies on the following fact , which we believe is of independent interest in model theory: for classes of finite  structures given by finitely many forbidden substructures, the amalgamation property is decidable.
Revised:  The proof relies on the fact that for classes of finite structures given by finitely many forbidden substructures, the amalgamation property is decidable.
Edit intent: clarity
Original: Understanding the structure of knowledge domains has been one of the foundational challenges in the science of science.
Revised: Understanding the structure of knowledge domains is one of the foundational challenges in the science of science.
Edit intent: coherence
Original: Understanding the structure of knowledge domains has been one of the foundational challenges in the science of science.
Revised: Understanding the structure of knowledge domains has been one of the foundational challenges in science of science.
Edit intent: fluency
Original:  Here, we propose a neural embedding technique that leverages the information contained in the paper citation network to obtain continuous  representations of scientific periodicals.
Revised:  Here, we propose a neural embedding technique that leverages the information contained in the citation network to obtain continuous representations of scientific periodicals.
Edit intent: clarity
Original:  We demonstrate that our  embeddings encode nuanced relationships between periodicals as well as the complex disciplinary  structure of science, even allowing us to make cross-disciplinary analogies between periodicals.
Revised:  We demonstrate that our periodical embeddings encode nuanced relationships between periodicals as well as the complex disciplinary structure of science, even allowing us to make cross-disciplinary analogies between periodicals.
Edit intent: fluency
Original:  We demonstrate that our  embeddings encode nuanced relationships between periodicals as well as the complex disciplinary  structure of science, even allowing us to make cross-disciplinary analogies between periodicals.
Revised:  We demonstrate that our embeddings encode nuanced relationships between periodicals as well as the complex disciplinary structure of science, allowing us to make cross-disciplinary analogies between periodicals.
Edit intent: coherence
Original:  Our framework may offer novel quantification methods in science of science, which may in turn facilitate the study of how knowledge is created and organized.
Revised:  Our framework may offer novel quantification methods in science of science, our framework may in turn facilitate the study of how knowledge is created and organized.
Edit intent: coherence
Original:  We show that our suggested mechanism serves as a catalyst for cooperation, even when signalling is costly or when punishment would be impractical.
Revised:  We show that our suggested mechanism catalyses cooperation, even when signalling is costly or when punishment would be impractical.
Edit intent: clarity
Original: Recent  advances in brain recording technology and artificial intelligence are propelling a new paradigm in neuroscience beyond the traditional controlled experiment.
Revised: Recent technological advances in brain recording technology and artificial intelligence are propelling a new paradigm in neuroscience beyond the traditional controlled experiment.
Edit intent: clarity
Original: Recent  advances in brain recording technology and artificial intelligence are propelling a new paradigm in neuroscience beyond the traditional controlled experiment.
Revised: Recent advances in brain recording and artificial intelligence are propelling a new paradigm in neuroscience beyond the traditional controlled experiment.
Edit intent: clarity
Original:  Naturalistic neuroscience studies neural computations associated with spontaneous behaviors performed in unconstrained settings.
Revised:  Naturalistic neuroscience studies neural processes underlying spontaneous behaviors performed in unconstrained settings.
Edit intent: clarity
Original:  Analyzing such unstructured data lacking a priori experimental design remains a significant challenge, especially when the data is multi-modal and long-term.
Revised:  However, analyzing such unstructured data lacking a priori experimental design remains a significant challenge, especially when the data is multi-modal and long-term.
Edit intent: coherence
Original:  Our pipeline discovers and annotates thousands of instances of human upper-limb movement events in long-term (7--9 day) naturalistic behavior data using a combination of computer vision, discrete latent-variable modeling, and string pattern-matching .
Revised:  Our pipeline discovers and annotates thousands of instances of human upper-limb movement events in the behavioral videos .
Edit intent: clarity
Original:  Analysis of the simultaneously recorded brain data uncovers neural signatures of movement that corroborate prior findings from traditional controlled experiments.
Revised:  Analysis of the simultaneously recorded brain data reveals neural signatures of movement that corroborate prior findings from traditional controlled experiments.
Edit intent: clarity
Original:  We plan to publish our curated dataset, which captures naturalistic neural and behavioral variability at a scale not previously available .
Revised:  We plan to publish our curated dataset, providing a resource to study naturalistic neural and behavioral variability at a scale not previously available .
Edit intent: clarity
Original:  Hidden Markov models (HMMs) are a prevalent approach to inferring  dynamics among discrete states in neural data .
Revised:  Hidden Markov models (HMMs) are a prevalent approach to inferring such neural dynamics among discrete states in neural data .
Edit intent: clarity
Original:  Hidden Markov models (HMMs) are a prevalent approach to inferring  dynamics among discrete states in neural data .
Revised:  Hidden Markov models (HMMs) are a prevalent approach to inferring dynamics among discrete brain states .
Edit intent: clarity
Original:  However, the validity of modeling neural time series data with HMMs has not been established .
Revised:  However, the validity of modeling neural time series data has not been established .
Edit intent: clarity
Original:  However, the validity of modeling neural time series data with HMMs has not been established .
Revised:  However, the validity of modeling neural time series data with HMMs has not been sufficiently examined .
Edit intent: clarity
Original:  Here, to address this situation and examine the performance of the HMM, we compare the model with the Gaussian mixture model (GMM), which is  a statistically simpler model than the HMM with no assumption of Markovianity , by applying both models to synthetic and empirical resting-state functional magnetic resonance imaging (fMRI) data.
Revised:  Here, to address this situation and examine the performance of the HMM, we compare the model with the Gaussian mixture model (GMM), which is a statistically simpler model than the HMM , by applying both models to synthetic and empirical resting-state functional magnetic resonance imaging (fMRI) data.
Edit intent: coherence
Original:  Here, to address this situation and examine the performance of the HMM, we compare the model with the Gaussian mixture model (GMM), which is  a statistically simpler model than the HMM with no assumption of Markovianity , by applying both models to synthetic and empirical resting-state functional magnetic resonance imaging (fMRI) data.
Revised:  Here, to address this situation and examine the performance of the HMM, we compare the model with the Gaussian mixture model (GMM), which is a statistically simpler model than the HMM with no assumption of Markovianity , by applying both models to synthetic time series generated from empirical resting-state functional magnetic resonance imaging (fMRI) data.
Edit intent: clarity
Original:  These results suggest that GMMs can be a model of first choice for investigating hidden-state dynamics in data even if the time series is apparently not memoryless .
Revised:  These results suggest that the GMM can be a model of first choice for investigating hidden-state dynamics in data even if the time series is apparently not memoryless .
Edit intent: fluency
Original:  These results suggest that GMMs can be a model of first choice for investigating hidden-state dynamics in data even if the time series is apparently not memoryless .
Revised:  These results suggest that GMMs can be a viable alternative to the HMM for investigating hidden-state dynamics in data even if the time series is apparently not memoryless .
Edit intent: clarity
Original:  These results suggest that GMMs can be a model of first choice for investigating hidden-state dynamics in data even if the time series is apparently not memoryless .
Revised:  These results suggest that GMMs can be a model of first choice for investigating hidden-state dynamics under this condition .
Edit intent: clarity
Original: We derive a semi-analytical Laplace-transform based solution to the one-dimensional linear advection-diffusion-reaction equation in a layered medium .
Revised: A new semi-analytical Laplace-transform based solution to the one-dimensional linear advection-diffusion-reaction equation in a layered medium .
Edit intent: clarity
Original: We derive a semi-analytical Laplace-transform based solution to the one-dimensional linear advection-diffusion-reaction equation in a layered medium .
Revised: We derive a semi-analytical solution to the one-dimensional linear advection-diffusion-reaction equation in a layered medium .
Edit intent: coherence
Original:  Our solution approach involves introducing unknown functions representing the diffusive flux at the interfaces between adjacent layers, allowing the multilayer problem to be solved separately on each layer in the Laplace domain before being numerically inverted back to the time domain.
Revised:  Our solution approach involves introducing unknown functions representing the dispersive flux at the interfaces between adjacent layers, allowing the multilayer problem to be solved separately on each layer in the Laplace domain before being numerically inverted back to the time domain.
Edit intent: clarity