wanyu/IteraTeR_v2 huggingface dataset:
Original:  Inspired by human documentation practices from analyzing 80 highly-voted Kaggle notebooks, we design and implement Themisto, an automated documentation generation system to explore the Human-AI Collaboration opportunity in the code documentation scenario.
Revised:  Inspired by human documentation practices learned from 80 highly-voted Kaggle notebooks, we design and implement Themisto, an automated documentation generation system to explore the Human-AI Collaboration opportunity in the code documentation scenario.
Edit intent: clarity
Original:  Inspired by human documentation practices from analyzing 80 highly-voted Kaggle notebooks, we design and implement Themisto, an automated documentation generation system to explore the Human-AI Collaboration opportunity in the code documentation scenario.
Revised:  Inspired by human documentation practices from analyzing 80 highly-voted Kaggle notebooks, we design and implement Themisto, an automated documentation generation system to explore how human-centered AI systems can support human data scientists in the machine learning code documentation scenario.
Edit intent: clarity
Original:  Themisto facilitates the creation of different types of documentation via three approaches: a deep-learning-based approach to generate documentation for source code (fully automated) , a query-based approach to retrieve the online API documentation for source code (fully automated) , and a user prompt approach to motivate users to write more documentation(semi-automated) .
Revised:  Themisto facilitates the creation of documentation via three approaches: a deep-learning-based approach to generate documentation for source code (fully automated) , a query-based approach to retrieve the online API documentation for source code (fully automated) , and a user prompt approach to motivate users to write more documentation(semi-automated) .
Edit intent: clarity
Original:  Themisto facilitates the creation of different types of documentation via three approaches: a deep-learning-based approach to generate documentation for source code (fully automated) , a query-based approach to retrieve the online API documentation for source code (fully automated) , and a user prompt approach to motivate users to write more documentation(semi-automated) .
Revised:  Themisto facilitates the creation of different types of documentation via three approaches: a deep-learning-based approach to generate documentation for source code , a query-based approach to retrieve the online API documentation for source code (fully automated) , and a user prompt approach to motivate users to write more documentation(semi-automated) .
Edit intent: fluency
Original:  Themisto facilitates the creation of different types of documentation via three approaches: a deep-learning-based approach to generate documentation for source code (fully automated) , a query-based approach to retrieve the online API documentation for source code (fully automated) , and a user prompt approach to motivate users to write more documentation(semi-automated) .
Revised:  Themisto facilitates the creation of different types of documentation via three approaches: a deep-learning-based approach to generate documentation for source code (fully automated) , a query-based approach to retrieve online API documentation for source code (fully automated) , and a user prompt approach to motivate users to write more documentation(semi-automated) .
Edit intent: fluency
Original:  Themisto facilitates the creation of different types of documentation via three approaches: a deep-learning-based approach to generate documentation for source code (fully automated) , a query-based approach to retrieve the online API documentation for source code (fully automated) , and a user prompt approach to motivate users to write more documentation(semi-automated) .
Revised:  Themisto facilitates the creation of different types of documentation via three approaches: a deep-learning-based approach to generate documentation for source code (fully automated) , a query-based approach to retrieve the online API documentation for source code , and a user prompt approach to motivate users to write more documentation(semi-automated) .
Edit intent: fluency
Original:  Themisto facilitates the creation of different types of documentation via three approaches: a deep-learning-based approach to generate documentation for source code (fully automated) , a query-based approach to retrieve the online API documentation for source code (fully automated) , and a user prompt approach to motivate users to write more documentation(semi-automated) .
Revised:  Themisto facilitates the creation of different types of documentation via three approaches: a deep-learning-based approach to generate documentation for source code (fully automated) , a query-based approach to retrieve the online API documentation for source code (fully automated) , and a user prompt approach to nudge users to write more documentation(semi-automated) .
Edit intent: clarity
Original:  Themisto facilitates the creation of different types of documentation via three approaches: a deep-learning-based approach to generate documentation for source code (fully automated) , a query-based approach to retrieve the online API documentation for source code (fully automated) , and a user prompt approach to motivate users to write more documentation(semi-automated) .
Revised:  Themisto facilitates the creation of different types of documentation via three approaches: a deep-learning-based approach to generate documentation for source code (fully automated) , a query-based approach to retrieve the online API documentation for source code (fully automated) , and a user prompt approach to motivate users to write documentation .
Edit intent: clarity
Original:  In this work, we hypothesise that one can re-purpose the use of the HyperANF a.k.a HyperBall algorithm -- intended for approximate diameter estimation -- to the task of privacy-preserving community detection for friend recommending systems that learn from an anonymous representation of the social network graph structure with limited privacy impacts .
Revised:  In this work, we hypothesise that one can re-purpose the use of the HyperANF a.k.a HyperBall algorithm -- intended for approximate diameter estimation -- to the task of privacy-preserving community detection for friend recommending systems that learn from an anonymous representation of the social network graph structure with limited privacy impact .
Edit intent: fluency
Original: This paper proposes a high-capacity reversible data hiding scheme for encrypted images using pixel predictions and Huffman encoding.
Revised: Previous reversible data hiding scheme for encrypted images using pixel predictions and Huffman encoding.
Edit intent: clarity
Original:  The  results show that the embedding capacity of the proposed scheme is larger than previous RDHEI arts.
Revised:  The experimental results show that the embedding capacity of the proposed scheme is larger than previous RDHEI arts.
Edit intent: clarity
Original:  Besides, the proposed scheme can provide high information security .
Revised:  Besides, the proposed schemes can ensure high information security .
Edit intent: clarity
Original:  Little detail of the original image can be  discovered from the encrypted image by the unauthorized users .
Revised:  Little detail of the original image can be discovered from the encrypted images or the marked encrypted images .
Edit intent: clarity
Original:  As a technology that can embed additional information in the encrypted domain, extract the embedded information correctly and recover the original image losslessly , RDHEI has received a lot of attention from researchers.
Revised:  As a technology which can embed additional information in the encrypted domain, extract the embedded information correctly and recover the original image losslessly , RDHEI has received a lot of attention from researchers.
Edit intent: fluency
Original:  As a technology that can embed additional information in the encrypted domain, extract the embedded information correctly and recover the original image losslessly , RDHEI has received a lot of attention from researchers.
Revised:  As a technology that can embed additional information in encrypted domain, extract the embedded information correctly and recover the original image losslessly , RDHEI has received a lot of attention from researchers.
Edit intent: fluency
Original:  As a technology that can embed additional information in the encrypted domain, extract the embedded information correctly and recover the original image losslessly , RDHEI has received a lot of attention from researchers.
Revised:  As a technology that can embed additional information in the encrypted domain, extract the embedded information correctly and recover the original image without loss , RDHEI has received a lot of attention from researchers.
Edit intent: clarity
Original:  As a technology that can embed additional information in the encrypted domain, extract the embedded information correctly and recover the original image losslessly , RDHEI has received a lot of attention from researchers.
Revised:  As a technology that can embed additional information in the encrypted domain, extract the embedded information correctly and recover the original image losslessly , RDHEI has been widely paid attention by researchers.
Edit intent: clarity
Original:  Experimental results prove that the proposed method outperforms the state-of-the-art methods in embedding rate and can extract the embedded information correctly and recover the image losslessly .
Revised:  The experimental results show that the proposed method outperforms the state-of-the-art methods in embedding rate and can extract the embedded information correctly and recover the image losslessly .
Edit intent: clarity
Original:  Experimental results prove that the proposed method outperforms the state-of-the-art methods in embedding rate and can extract the embedded information correctly and recover the image losslessly .
Revised:  Experimental results prove that the proposed algorithm can extract the embedded information correctly and recover the image losslessly .
Edit intent: clarity
Original: One of the strategies in combating COVID-19 consists of virtual screening for possible inhibitors for the attachment of SARS-CoV-2 Spike receptor-binding domain (RBD) to the human ACE2 receptor .
Revised: Virtual screening is a computational technique widely used for identifying small molecules which are most likely to bind to a protein target .
Edit intent: clarity
Original:  On the other hand, Sakuranetin was the one with the lowest affinity (about -6.38 Kcal/mol).
Revised:  On the other hand, Sakuranetin presented the lowest affinity (about -6.38 Kcal/mol).
Edit intent: clarity
Original:  The biding site surface analysis showed pocket-like regions on the RBD/ACE2 complex that yield several interactions (mostly hydrogen bonds) between the flavonoid and the amino acid residues of the proteins.
Revised:  The binding site surface analysis showed pocket-like regions on the RBD/ACE2 complex that yield several interactions (mostly hydrogen bonds) between the flavonoid and the amino acid residues of the proteins.
Edit intent: fluency
Original:  Surprisingly, all information necessary for computing the reachable part of a coalgebra is already present in the data structures that we previously developed only for the computation of behavioural equivalence.
Edit intent: coherence
Original: We investigated daily COVID-19 cases and death in the 337 lower tier local authority regions in England and Wales to better understand how the disease propagated over a 10-month period.
Revised: We investigated daily COVID-19 cases and deaths in the 337 lower tier local authority regions in England and Wales to better understand how the disease propagated over a 10-month period.
Edit intent: fluency
Original:  Computing accurate and efficient numerical solutions to TRT is challenging for several reasons, the first of which is that TRT is defined on a high-dimensional phase space .
Revised:  Computing accurate and efficient numerical solutions TRT are challenging for several reasons, the first of which is that TRT is defined on a high-dimensional phase space .
Edit intent: clarity
Original:  Computing accurate and efficient numerical solutions to TRT is challenging for several reasons, the first of which is that TRT is defined on a high-dimensional phase space .
Revised:  Computing accurate and efficient numerical solutions to TRT is challenging for several reasons, the first of which is that TRT is defined on a high-dimensional phase .
Edit intent: clarity
Original:  This can be partially overcome via implicit time integration, although fully implicit methods may become  expensive due to the strong nonlinearity and system size.
Revised:  This can be partially overcome via implicit time integration, although fully implicit methods may become computationally expensive due to the strong nonlinearity and system size.
Edit intent: clarity
Original:  We develop a method that is based on a discontinuous Galerkin scheme in space, coupled with a semi-implicit scheme in time.
Revised:  We develop a method that is based on a discontinuous Galerkin scheme in space, coupled with a semi-implicit discretization in time.
Edit intent: clarity
Original: We introduce Reflective Hamiltonian Monte Carlo (ReHMC), an HMC-based algorithm, to sample from a log-concave distribution restricted to a convex polytope .
Revised: We introduce Reflective Hamiltonian Monte Carlo (ReHMC), an HMC-based algorithm, to sample from a log-concave distribution restricted to a convex body .
Edit intent: clarity
Original:  Experiments suggest that ReHMC outperfroms Hit-and-Run and Coordinate-Hit-and-Run regarding the time it needs to produce an independent sample  .
Revised:  The experiments suggest that ReHMC outperfroms Hit-and-Run and Coordinate-Hit-and-Run regarding the time it needs to produce an independent sample .
Edit intent: fluency
Original:  Using the Helffer--Sj\"ostrand functional calculus, this paper proves analogous decompositions for scattering problems fitting into the black-box scattering framework of Sj\"ostrand-Zworski, thus covering Helmholtz problems with variable coefficients, impenetrable obstacles, and penetrable obstacles all at once.
Revised:  Using the Helffer-Sj\"ostrand functional calculus, this paper proves analogous decompositions for scattering problems fitting into the black-box scattering framework of Sj\"ostrand-Zworski, thus covering Helmholtz problems with variable coefficients, impenetrable obstacles, and penetrable obstacles all at once.
Edit intent: fluency
Original:  Because the typically slow flows are but tiny perturbations on top of a close balance between gravity and  pressure gradient, such simulations place heavy demands on numerical hydrodynamics schemes.
Revised:  Because the typically slow flows are merely tiny perturbations on top of a close balance between gravity and pressure gradient, such simulations place heavy demands on numerical hydrodynamics schemes.
Edit intent: fluency
Original:  Because the typically slow flows are but tiny perturbations on top of a close balance between gravity and  pressure gradient, such simulations place heavy demands on numerical hydrodynamics schemes.
Revised:  Because the typically slow flows are but tiny perturbations on top of a close balance between gravity and the pressure gradient, such simulations place heavy demands on numerical hydrodynamics schemes.
Edit intent: fluency
Original:  Three such schemes are applied in the implicit, finite-volume code SLH in combination with a low-Mach-number numerical flux function.
Revised:  Three such schemes were applied in the implicit, finite-volume code SLH in combination with a low-Mach-number numerical flux function.
Edit intent: fluency
Original:  We find that the \alpha-\beta and Deviation well-balancing methods can accurately maintain hydrostatic solutions provided that gravitational potential energy is included in the total energy balance.
Revised:  We find that the \alpha-\beta and deviation well-balancing methods can accurately maintain hydrostatic solutions provided that gravitational potential energy is included in the total energy balance.
Edit intent: fluency
Original:  The Deviation method also substantially increases accuracy of maintaining stationary orbital motions in a Keplerian disk on long time scales .
Revised:  The deviation method also substantially increases accuracy of maintaining stationary orbital motions in a Keplerian disk on long time scales .
Edit intent: fluency
Original:  The Deviation method also substantially increases accuracy of maintaining stationary orbital motions in a Keplerian disk on long time scales .
Revised:  The Deviation method also substantially increases accuracy of maintaining stationary orbital motions in a Keplerian disk on long timescales .
Edit intent: fluency
Original:  Our aim is to bring together several different disciplines required to provide a holistic approach to the epidemic , such as data science, epidemiology, or systems-and-control theory.
Revised:  Our aim is to bring together several different disciplines required to provide a holistic approach to epidemic analysis , such as data science, epidemiology, or systems-and-control theory.
Edit intent: clarity
Original:  Our aim is to bring together several different disciplines required to provide a holistic approach to the epidemic , such as data science, epidemiology, or systems-and-control theory.
Revised:  Our aim is to bring together several different disciplines required to provide a holistic approach to the epidemic , such as data science, epidemiology, and systems-and-control theory.
Edit intent: fluency
Original: In this paper, we develop a new neural network family based on power series expansion, which is proved to achieve a better approximation accuracy comparing to existing neural networks.
Revised: In this paper, we develop a new neural network family based on power series expansion, which is proved to achieve a better approximation accuracy in comparison with existing neural networks.
Edit intent: clarity
Original:  This new set of neural networks  can improve the expressive power while preserving comparable computational cost by increasing the degree of the network instead of increasing the depth or width.
Revised:  This new set of neural networks can improve the representation ability while preserving comparable computational cost by increasing the degree of the network instead of increasing the depth or width.
Edit intent: clarity
Original: Modeling the distribution of high dimensional data by a latent tree graphical model is a common approach in multiple scientific domains.
Revised: Modeling the distribution of high dimensional data by a latent tree graphical model is a prevalent approach in multiple scientific domains.
Edit intent: clarity
Original:  A common task is to infer the underlying tree structure  given only observations of the terminal nodes.
Revised:  A common task is to infer the underlying tree structure , given only observations of the terminal nodes.
Edit intent: fluency
Original:  A common task is to infer the underlying tree structure  given only observations of the terminal nodes.
Revised:  A common task is to infer the underlying tree structure given only observations of its terminal nodes.
Edit intent: fluency
Original:  First, recover the structure separately for multiplerandomly selected subsets of the terminal nodes.
Revised:  First, recover the structure separately of multiple, possibly random subsets of the terminal nodes.
Edit intent: clarity
Original:  Here, we develop Spectral Top-Down Recovery (STDR), a  divide-and-conquer approach for inference of large latent tree models.
Revised:  Here, we develop Spectral Top-Down Recovery (STDR), a divide-and-conquer approach to infer large latent tree models.
Edit intent: fluency
Original:  We prove that under certain conditions  this partitioning is consistent with the tree structure.
Revised:  We prove that under certain conditions , this partitioning is consistent with the tree structure.
Edit intent: fluency
Original:  This, in turn  leads to a significantly simpler merging procedure of the small subtrees.
Revised:  This, in turn , leads to a significantly simpler merging procedure of the small subtrees.
Edit intent: fluency
Original:  We prove that STDR is statistically consistent , and bound the number of samples required to accurately recover the tree with high probability.
Revised:  We prove that STDR is statistically consistent and bound the number of samples required to accurately recover the tree with high probability.
Edit intent: fluency
Original: A decision maker looks to take an active action (e.g., purchase some goods or make an investment) .
Revised: A decision-maker is deciding between an active action (e.g., purchase some goods or make an investment) .
Edit intent: clarity
Original:  The payoff of this active action depends on his own private type as well as a random and unknown state of nature.
Revised:  The payoff of the active action depends on his own private type as well as a random and unknown state of nature.
Edit intent: fluency
Original:  The payoff of this active action depends on his own private type as well as a random and unknown state of nature.
Revised:  The payoff of this active action depends on the buyer's private type and also an unknown state of nature.
Edit intent: clarity
Original: A decision-maker is deciding between an active action (e.g., purchase a house, invest certain stock) and a passive action.
Revised: A decision maker is choosing between an active action (e.g., purchase a house, invest certain stock) and a passive action.
Edit intent: fluency
Original:  An information seller can design experiments to reveal information about the realized state to the decision-maker and would like to maximize profit from selling such information.
Revised:  An information seller can design experiments to reveal information about the realized state to the decision maker, and would like to maximize profit from selling such information.
Edit intent: fluency
Original:  We fully characterize, in closed-form, the revenue-optimal information selling mechanism for the seller.
Revised:  We characterize, in closed-form, the revenue-optimal information selling mechanism for the seller.
Edit intent: clarity
Original:  After eliciting the buyer's type, the optimal mechanism charges the buyer an upfront payment and then simply reveals whether the realized state passed a certain threshold or not.
Revised:  After eliciting the buyer's type, the optimal mechanism charges the buyer an upfront payment and then simply reveals whether the realized state exceeds a certain threshold or not.
Edit intent: clarity
Original:  The special buyer type who is a priori indifferent between the active and passive action benefits the most from participating in the mechanism.
Revised:  The special buyer type who is a-priori indifferent between the active and passive action benefits the most from participating in the mechanism.
Edit intent: fluency
Original:  In particular, the largest gap known between Submodular and GS valuations was some constant ratio smaller than 2.
Edit intent: coherence
Original:  However, whether GS approximates general submodular valuations within a poly-logarithmic factor remains open, even in the special case of {\em concave of GS } valuations ( a subclass of Submodular containing budget additive ).
Revised:  Additionally, for a class of submodular functions that we refer to as {\em concave of GS } valuations ( a subclass of Submodular containing budget additive ).
Edit intent: clarity
Original:  For%DIFDELCMD < {\em %%% concave of Rado valuations(Rado is a significant subclass of GS, containing, e.g., weighted matroid rank functions and OXS ), we show approximability by GS within an O(\log^2m) factor.
Revised:  For%DIFDELCMD < {\em %%% valuations(Rado is a significant subclass of GS, containing, e.g., weighted matroid rank functions and OXS ), we show approximability by GS within an O(\log^2m) factor.
Edit intent: clarity