wanyu/IteraTeR_v2 huggingface dataset:
Original:  This paper provides a comprehensive answer to the technological, ethical and security challenges, by proposing an architecture that provides  individuals, employers,  government agencies, a digital, decentralized, portable, immutable,  non-refutable health status cryptographic proof.
Revised:  This paper provides a comprehensive answer to the technological, ethical and security challenges, by proposing an architecture that provides individuals, employers, government agencies, a digital, decentralized, portable, immutable, and non-refutable health status cryptographic proof.
Edit intent: coherence
Original:  It can be used to evaluate the risk of allowing individuals to return to normal work, travel, and public life activities.
Revised:  It can be used to evaluate the risk of allowing individuals to return to work, travel, and public life activities.
Edit intent: clarity
Original:  In this paper, we show that neural networks can be used to train an universal approximator for energy potential functions.
Revised:  In this paper, we show that neural networks can be used to train a universal approximator for energy potential functions.
Edit intent: fluency
Original:  By incorporating a fully automated training process we have been able to train smooth, differentiable, and predictive potential functions on large scale crystal structures.
Revised:  By incorporating a fully automated training process we have been able to train smooth, differentiable, and predictive potential functions on large-scale crystal structures.
Edit intent: fluency
Original:  A variety of tests have also  performed to show the superiority and versatility of the machine-learned model.
Revised:  A variety of tests have also been performed to show the superiority and versatility of the machine-learned model.
Edit intent: fluency
Original: The mechanism of bacterial cell size control has been a mystery for decades, which involves the well-coordinated growth and division in  cell cycle.
Revised: The mechanism of bacterial cell size control has been a mystery for decades, which involves the well-coordinated growth and division in the cell cycle.
Edit intent: fluency
Original:  Taking the opportunity, this theoretical study aims to clarify the stochastic nature of bacterial cell size control under the assumption of the accumulation mechanism, which is favored by recent experiments.
Revised:  Taking the opportunity, this theoretical study aims to clarify the stochastic nature of bacterial cell size control under the assumption of the accumulation mechanism, which is favoured by recent experiments.
Edit intent: fluency
Original:  Via the master equation approach to the stochastic birth process combined with proper chosen boundary conditions, the cell size distribution of an exponentially growing colony is revisited.
Revised:  Via the master equation approach to the stochastic birth process combined with properly chosen boundary conditions, the cell size distribution of an exponentially growing colony is revisited.
Edit intent: fluency
Original:  Via the master equation approach to the stochastic birth process combined with proper chosen boundary conditions, the cell size distribution of an exponentially growing colony is revisited.
Revised:  Via the master equation approach to the stochastic birth process combined with proper chosen boundary conditions, the cell size distribution of an exponentially growing population is revisited.
Edit intent: clarity
Original:  Given a growth condition, the added size distribution is found independent of the birth size, the reason of which is shown in the picture of subortinated random walk.
Revised:  Given a growth condition, the added size distribution is found independent of the birth size, the reason for which is shown in the picture of subortinated random walk.
Edit intent: fluency
Original:  Given a growth condition, the added size distribution is found independent of the birth size, the reason of which is shown in the picture of subortinated random walk.
Revised:  Given a growth condition, the added size distribution is found independent of the birth size, the reason of which is shown in the picture of the subordinated random walk.
Edit intent: fluency
Original:  As a consequence of non-Gaussian noises of the added sizes, the non-equilibrium nature of bacterial cell size homeostasis is revealed , of which the biological meaning requires further investigation.
Revised:  As a consequence of non-Gaussian noises of the added sizes, the non-equilibrium nature of bacterial cell size homeostasis is predicted , of which the biological meaning requires further investigation.
Edit intent: clarity
Original:  Taking the opportunity, this theoretical study aims to clarify the stochastic nature of bacterial cell size control under the assumption of the accumulation mechanism, which is favoured by recent experiments  . Via the master equation approach to the stochastic birth process combined with properly chosen boundary conditions, the cell size distribution of an exponentially growing population is revisited.
Revised:  Taking the opportunity, this theoretical study aims to clarify the stochastic nature of bacterial cell size control under the assumption of the accumulation mechanism, which is favoured by recent experiments . Via the master equation approach with properly chosen boundary conditions, the cell size distribution of an exponentially growing population is revisited.
Edit intent: clarity
Original:  Specifically, we develop reinforcement learning (RL) based models to decide how to choose a subtree for insertion and how to split a node  , instead of relying on hand-crafted heuristic rules as R-Tree and its variants.
Revised:  Specifically, we develop reinforcement learning (RL) based models to decide how to choose a subtree for insertion and how to split a node when building an R-Tree , instead of relying on hand-crafted heuristic rules as R-Tree and its variants.
Edit intent: clarity
Original:  Specifically, we develop reinforcement learning (RL) based models to decide how to choose a subtree for insertion and how to split a node  , instead of relying on hand-crafted heuristic rules as R-Tree and its variants.
Revised:  Specifically, we develop reinforcement learning (RL) based models to decide how to choose a subtree for insertion and how to split a node , instead of relying on hand-crafted heuristic rules currently used by R-Tree and its variants.
Edit intent: clarity
Original:  Experiments on real and synthetic datasets with up to  100 million spatial objects clearly show that our RL based index outperforms R-Tree and its variants  .
Revised:  Experiments on real and synthetic datasets with up to more than 100 million spatial objects clearly show that our RL based index outperforms R-Tree and its variants .
Edit intent: clarity
Original: We present online algorithms for directed spanners and directed Steiner forests.
Revised: We present online algorithms for directed spanners and Steiner forests.
Edit intent: fluency
Original:  However, when relaxing the linear assumption with neural networks (e.g., Cox-MLP \mbox{ katzman2018deepsurv,kvamme2019time , we lose the guaranteed coverage.
Revised:  However, when relaxing the linear assumption with neural networks (e.g., Cox-MLP (Katzman et al., 2018; Kvamme et al., 2019)) , we lose the guaranteed coverage.
Edit intent: clarity
Original:  In the first algorithm WCCI , we revisit weighted conformal inference and introduce a new non-conformity score based on partial likelihood.
Revised:  In the first algorithm WCCI , we revisit weighted conformal inference and introduce a new non-conformity score based on partial likelihood.
Edit intent: fluency
Original:  We then propose a two-stage algorithm T-SCI , where we run WCCI in the first stage and apply quantile conformal inference to calibrate the results in the second stage.
Revised:  We then propose a two-stage algorithm T-SCI , where we run WCCI in the first stage and apply quantile conformal inference to calibrate the results in the second stage.
Edit intent: fluency
Original:  Computationally more efficient methods are proposed to exactly or approximately evaluate and differentiate: 1) the mean compliance, or 2) any scalar-valued function of the individual load compliances such as the weighted sum of the mean and standard deviation.
Revised:  Computationally more efficient methods are proposed to exactly evaluate and differentiate: 1) the mean compliance, or 2) any scalar-valued function of the individual load compliances such as the weighted sum of the mean and standard deviation.
Edit intent: clarity
Original:  The computational time complexities of all the proposed algorithms are analyzed, compared to the naive approaches and then experimentally verified.
Revised:  The computational time complexities of all the proposed algorithms are analyzed, compared with the naive approaches and then experimentally verified.
Edit intent: fluency
Original:  The maximum compliance constrained problem is solved using the augmented Lagrangian method and the exact method proposed for handling scalar-valued functions of the load compliances, where the scalar-valued function is the augmented Lagrangian function.
Revised:  The maximum compliance constrained problem is solved using the augmented Lagrangian method and the method proposed for handling scalar-valued functions of the load compliances, where the scalar-valued function is the augmented Lagrangian function.
Edit intent: clarity
Original:  Even in standard model with local fermionic modes  formally only the 'occupied' state |1> is truly relevant for Fermi-Dirac statistics , but 'vacuum' state |0> is not.
Revised:  Taking into account a model with local fermionic modes formally only the 'occupied' state |1> is truly relevant for Fermi-Dirac statistics , but 'vacuum' state |0> is not.
Edit intent: clarity
Original:  Even in standard model with local fermionic modes  formally only the 'occupied' state |1> is truly relevant for Fermi-Dirac statistics , but 'vacuum' state |0> is not.
Revised:  Even in standard model with local fermionic modes , formally only the 'occupied' state |1> is truly relevant for Fermi-Dirac statistics , but 'vacuum' state |0> is not.
Edit intent: fluency
Original:  Even in standard model with local fermionic modes  formally only the 'occupied' state |1> is truly relevant for Fermi-Dirac statistics , but 'vacuum' state |0> is not.
Revised:  Even in standard model with local fermionic modes formally only the 'occupied' states |1> is truly relevant for Fermi-Dirac statistics , but 'vacuum' state |0> is not.
Edit intent: fluency
Original:  While particular attention has been paid to phenomena like group polarization during debates, echo-chambers formation and bot detection, the semantic aspect of online communications has received relatively less attention .
Revised:  While particular attention has been paid to phenomena like elite and mass polarization during online debates and echo-chambers formation and bot detection, the semantic aspect of online communications has received relatively less attention .
Edit intent: clarity
Original:  On the `social ' side , our methodology allows us to extract relevant information about the political leaning of the communities of users , hereby called partisan communities , without resorting upon any external information.
Revised:  As regards the social analysis , our methodology allows us to extract relevant information about the political leaning of the communities of users , hereby called partisan communities , without resorting upon any external information.
Edit intent: clarity
Original:  On the `social ' side , our methodology allows us to extract relevant information about the political leaning of the communities of users , hereby called partisan communities , without resorting upon any external information.
Revised:  On the `social ' side , our methodology allows us to extract relevant information about the political orientation of the communities of users , hereby called partisan communities , without resorting upon any external information.
Edit intent: clarity
Original:  On the `social ' side , our methodology allows us to extract relevant information about the political leaning of the communities of users , hereby called partisan communities , without resorting upon any external information.
Revised:  On the `social ' side , our methodology allows us to extract relevant information about the political leaning of the communities of users - hereby called partisan communities , without resorting upon any external information.
Edit intent: fluency
Original:  On the `social ' side , our methodology allows us to extract relevant information about the political leaning of the communities of users , hereby called partisan communities , without resorting upon any external information.
Revised:  On the `social ' side , our methodology allows us to extract relevant information about the political leaning of the communities of users , hereby called partisan communities - without resorting upon any external information.
Edit intent: fluency
Original: On the `semantic ' side, instead, the networks of hashtags are characterized by a mesoscale structure which appears to be core-periphery - a seemingly recurrent pattern that is present also in the semantic networks characterizing the online debate in the run up of the 2018 Italian elections .
Revised: On the `semantic ' side, instead, the networks of hashtags display a mesoscale structure which appears to be core-periphery - a seemingly recurrent pattern that is present also in the semantic networks characterizing the online debate in the run up of the 2018 Italian elections .
Edit intent: clarity
Original: On the `semantic ' side, instead, the networks of hashtags are characterized by a mesoscale structure which appears to be core-periphery - a seemingly recurrent pattern that is present also in the semantic networks characterizing the online debate in the run up of the 2018 Italian elections .
Revised: On the `semantic ' side, instead, the networks of hashtags are characterized by a mesoscale structure organized in a core-periphery - a seemingly recurrent pattern that is present also in the semantic networks characterizing the online debate in the run up of the 2018 Italian elections .
Edit intent: clarity
Original:  The C-GAN, composed of two networks with three fully connected hidden layers, is trained on solutions generated by the GA, and then given sets of desired labels (i.e., objective function values), generates complementary solutions corresponding to those labels.
Revised:  The C-GAN, composed of two networks with three fully connected hidden layers, is trained on solutions generated by GA, and then given sets of desired labels (i.e., objective function values), generates complementary solutions corresponding to those labels.
Edit intent: fluency
Original: Because of the widespread diffusion of computational systems of stochastic nature, in recent years probabilistic model checking has become an important area of research .
Revised: In recent years probabilistic model checking has become an important area of research .
Edit intent: clarity
Original:  Imprecise probability theory offers a natural approach to overcome such limitation by a sensitivity analysis with respect to the values of these parameters.
Revised:  The theory of imprecise probabilities offers a natural approach to overcome such limitation by a sensitivity analysis with respect to the values of these parameters.
Edit intent: clarity
Original:  Here we present a further extension based on imprecise Markov reward models.
Revised:  We present a further extension based on imprecise Markov reward models.
Edit intent: coherence
Original:  These ideas are finally tested on a real case study involving the spend-down costs of geriatric medicine departments.
Revised:  These ideas are tested on a real case study involving the spend-down costs of geriatric medicine departments.
Edit intent: clarity
Original:  We then use a result of Stanley to show that , in general, the expected genus of every multistar with n nonleaf edges lies in an interval of length 2/(n + 1) centered at the expected genus of an n-edge dipole.
Revised:  We then use a result of Stanley to show that , in general, the expected genus of every multistar with n nonleaf edges lies in an interval of length 2/(n + 1) centered at the expected number of faces of an n-edge dipole.
Edit intent: clarity
Original:  In addition to investigating how noise and state changes impact neural computation, statistical models of trial-to-trial variability are becoming increasingly important as experimentalists aspire to study  naturalistic animal behaviors , which never repeat themselves exactly and may rarely do so even approximately.
Revised:  Disentangling these sources of variability is of great scientific interest in its own right, but it is also increasingly inescapable as neuroscientists aspire to study naturalistic animal behaviors , which never repeat themselves exactly and may rarely do so even approximately.
Edit intent: clarity
Original:  In addition to investigating how noise and state changes impact neural computation, statistical models of trial-to-trial variability are becoming increasingly important as experimentalists aspire to study  naturalistic animal behaviors , which never repeat themselves exactly and may rarely do so even approximately.
Revised:  In addition to investigating how noise and state changes impact neural computation, statistical models of trial-to-trial variability are becoming increasingly important as experimentalists aspire to study naturalistic animal behaviors . In these settings, behavioral actions never repeat themselves exactly and may rarely do so even approximately.
Edit intent: clarity
Original:  Estimating the basic features of neural response distributions may seem impossible in this trial-limited regime .
Revised:  Estimating the basic features of neural activity using few, if any, repeated trials are needed. Accurate statistical modeling in this severely trial-limited regime .
Edit intent: clarity
Original:  Fortunately, by identifying and leveraging simplifying structure in neural data  -- e. g. shared gain modulations across neural subpopulations, temporal smoothness in neural firing rates, and correlations in responses across behavioral conditions -- statistical estimation often remains tractable in practice.
Revised:  Fortunately, by identifying and leveraging simplifying structure in neural data -- including shared gain modulations across neural subpopulations, temporal smoothness in neural firing rates, and correlations in responses across behavioral conditions -- statistical estimation often remains tractable in practice.
Edit intent: clarity
Original: This paper proposes a multifractal model, with the aim of providing a possible explanation for the locality phenomenon that appears in the estimation of the Hurst exponent in stationary second order temporal series representing self-similar traffic flows in current high-speed computer networks .
Revised: In the context of the simulations carried out using a simplified multifractal model that is proposed to give an explanation to the locality phenomenon that appears in the estimation of the Hurst exponent in stationary second order temporal series representing self-similar traffic flows in current high-speed computer networks .
Edit intent: clarity
Original: This paper proposes a multifractal model, with the aim of providing a possible explanation for the locality phenomenon that appears in the estimation of the Hurst exponent in stationary second order temporal series representing self-similar traffic flows in current high-speed computer networks .
Revised: This paper proposes a multifractal model, with the aim of providing a possible explanation for the locality phenomenon that appears in the estimation of the Hurst exponent in the second-order stationary series that represent the self-similar traffic flows in current high-speed computer networks .
Edit intent: clarity
Original: This paper proposes a multifractal model, with the aim of providing a possible explanation for the locality phenomenon that appears in the estimation of the Hurst exponent in stationary second order temporal series representing self-similar traffic flows in current high-speed computer networks .
Revised: This paper proposes a multifractal model, with the aim of providing a possible explanation for the locality phenomenon that appears in the estimation of the Hurst exponent in stationary second order temporal series representing self-similar traffic flows in high-speed computer networks .
Edit intent: clarity
Original:  Degree centrality, closeness centrality, betweenness centrality and clustering coefficient are the most frequently used metrics to compute the nodes centrality.
Revised:  Degree centrality, closeness centrality, betweenness centrality and clustering coefficient are the most frequently used metrics to compute node centrality.
Edit intent: clarity
Original:  As an example, we consider the problem of "smoothed counting" of perfect matchings in hypergraphs  .
Revised:  We discuss applications to (perfect) matchings in hypergraphs .
Edit intent: clarity
Original:  Recently (arXiv 2021) , Alman proved that for any field F, d\geq 2 and arbitrary matrices M_1, \ldots, M_n \in \mathbb{F^{d\times d}, one can get a d^n\times d^n matrix of rank }%DIFDELCMD < \le %%% d^{(1-\gamma)n \dots\ge  ^{ ( 1+\varepsilon ) n } entries of the Kronecker product M = M_1\otimes M_2\otimes \ldots\otimes M_n\le  , where 1/\gamma is roughly 2^d/\varepsilon^2.
Revised:  Recently (arXiv 2021) , Alman proved that for any field F, d\geq 2 and arbitrary matrices M_1, ^{d\times d}, one can get a d^n\times d^n matrix of rank }%DIFDELCMD < \le %%% d^{(1-\gamma)n \dots\ge ^{ ( 1+\varepsilon ) n } entries of the Kronecker product M = M_1\otimes M_2\otimes \ldots\otimes M_n\le , where 1/\gamma is roughly 2^d/\varepsilon^2.
Edit intent: coherence
Original:  Recently (arXiv 2021) , Alman proved that for any field F, d\geq 2 and arbitrary matrices M_1, \ldots, M_n \in \mathbb{F^{d\times d}, one can get a d^n\times d^n matrix of rank }%DIFDELCMD < \le %%% d^{(1-\gamma)n \dots\ge  ^{ ( 1+\varepsilon ) n } entries of the Kronecker product M = M_1\otimes M_2\otimes \ldots\otimes M_n\le  , where 1/\gamma is roughly 2^d/\varepsilon^2.
Revised:  Recently (arXiv 2021) , Alman proved that for any field F, d\geq 2 and arbitrary matrices M_1, \ldots, M_n \in \mathbb{F^{d\times d}, one can get a d^n\times d^n matrix of rank }%DIFDELCMD < \le %%% d^{(1-\gamma)n \dots\ge ^{ 1+\varepsilon ) n } entries of the Kronecker product M = M_1\otimes M_2\otimes \ldots\otimes M_n\le , where 1/\gamma is roughly 2^d/\varepsilon^2.
Edit intent: fluency
Original:  Recently (arXiv 2021) , Alman proved that for any field F, d\geq 2 and arbitrary matrices M_1, \ldots, M_n \in \mathbb{F^{d\times d}, one can get a d^n\times d^n matrix of rank }%DIFDELCMD < \le %%% d^{(1-\gamma)n \dots\ge  ^{ ( 1+\varepsilon ) n } entries of the Kronecker product M = M_1\otimes M_2\otimes \ldots\otimes M_n\le  , where 1/\gamma is roughly 2^d/\varepsilon^2.
Revised:  Recently (arXiv 2021) , Alman proved that for any field F, d\geq 2 and arbitrary matrices M_1, \ldots, M_n \in \mathbb{F^{d\times d}, one can get a d^n\times d^n matrix of rank }%DIFDELCMD < \le %%% d^{(1-\gamma)n \dots\ge ^{ ( 1+\varepsilon } entries of the Kronecker product M = M_1\otimes M_2\otimes \ldots\otimes M_n\le , where 1/\gamma is roughly 2^d/\varepsilon^2.
Edit intent: clarity