wanyu/IteraTeR_v2 huggingface dataset:
Original:   [arXiv 2020], and we give conditions for list assignments by which graphs of treewidth k are \frac{1}{k+1}-flexibly (k+1)-choosable.
Revised:  ~ [arXiv 2020], and we give conditions for list assignments by which graphs of treewidth k are \frac{1}{k+1}-flexibly (k+1)-choosable.
Edit intent: fluency
Original:  Finally, we introduce a notion of flexible degeneracy, which strengthens flexible choosability, and we show that apart from a well-understood class of exceptions, three-connected non-regular graphs of maximum degree \Delta are flexibly (\Delta - 1)-degenerate.
Revised:  Finally, we introduce a notion of flexible degeneracy, which strengthens flexible choosability, and we show that apart from a well-understood class of exceptions, 3-connected non-regular graphs of maximum degree \Delta are flexibly (\Delta - 1)-degenerate.
Edit intent: fluency
Original: End-effect drives are proposed here as an effective way to implement goal-directed motor learning, in the absence of an explicit forward model.
Revised: End-effect drives are proposed as an effective way to implement goal-directed motor learning, in the absence of an explicit forward model.
Edit intent: coherence
Original:  Neural networks  work with full-size data without extensive preprocessing and feature generation and, thus, information loss.
Revised:  Neural networks can work with full-size data without extensive preprocessing and feature generation and, thus, information loss.
Edit intent: clarity
Original:  Recent work has shown that morphological difference between specific brain regions can be found on MRI with deep learning techniques.
Revised:  Recent work has shown that the morphological difference in specific brain regions can be found on MRI with deep learning techniques.
Edit intent: fluency
Original:  However, interpretation of the lately proposed models is based on a region of interest and can not be extended to pixel or voxel-wise image interpretation , which is considered to be more informative .
Revised:  However, interpretation of the existing models is based on a region of interest and can not be extended to pixel or voxel-wise image interpretation , which is considered to be more informative .
Edit intent: clarity
Original:  However, interpretation of the lately proposed models is based on a region of interest and can not be extended to pixel or voxel-wise image interpretation , which is considered to be more informative .
Revised:  However, interpretation of the lately proposed models is based on a region of interest and can not be extended to voxel-wise image interpretation , which is considered to be more informative .
Edit intent: clarity
Original:  In this paper, we confirm the previous findings in sex differences from diffusion-tensor imaging on T1 weighted brain MRI scans.
Revised:  In this paper, we extend the previous findings in sex differences from diffusion-tensor imaging on T1 weighted brain MRI scans.
Edit intent: clarity
Original:  In this paper, we confirm the previous findings in sex differences from diffusion-tensor imaging on T1 weighted brain MRI scans.
Revised:  In this paper, we confirm the previous findings in gender differences from diffusion-tensor imaging on T1 weighted brain MRI scans.
Edit intent: clarity
Original:  In this paper, we confirm the previous findings in sex differences from diffusion-tensor imaging on T1 weighted brain MRI scans.
Revised:  In this paper, we confirm the previous findings in sex differences from diffusion-tensor imaging on T1 brain MRI scans.
Edit intent: clarity
Original:  We compare the results of three voxel-based 3D CNN interpretation methods: Meaningful Perturbations, GradCam and Guided Backpropagation and provide the open-source code .
Revised:  We compare the results of three interpretation methods: Meaningful Perturbations, GradCam and Guided Backpropagation and provide the open-source code .
Edit intent: clarity
Original: Oscillatory systems arise in the different science fields , very importantly in Neuroscience . Complex mathematical formulations with differential equations have been proposed to model the dynamics of these systems.
Revised: Oscillatory systems arise in the different science fields . Complex mathematical formulations with differential equations have been proposed to model the dynamics of these systems.
Edit intent: coherence
Original: Huffman code mapping (HCM) is a recent technique for reversible data hiding ( RDH) in JPEG images.
Revised: Most existing lossless data hiding ( RDH) in JPEG images.
Edit intent: clarity
Original:  Previous studies only apply to the JPEG bitstream encoded with the standard Huffman table , in which unused codes usually exist hence the construction of code mapping can be guaranteed.
Revised:  However, previous studies only apply to the JPEG bitstream encoded with the standard Huffman table , in which unused codes usually exist hence the construction of code mapping can be guaranteed.
Edit intent: coherence
Original:  However, for the JPEG bitstream encoded with the optimized Huffman table,  the codes are all usedso code mapping is out of work.
Revised:  However, for the JPEG bitstream encoded with the optimized Huffman table, all the codes are all usedso code mapping is out of work.
Edit intent: fluency
Original:  However, for the JPEG bitstream encoded with the optimized Huffman table,  the codes are all usedso code mapping is out of work.
Revised:  However, for the JPEG bitstream encoded with the optimized Huffman table, the codes are used, so the traditional code mapping strategy does not work.
Edit intent: clarity
Original:  With this concern in mind, we aim to propose a generic LDH method  applicable to any JPEG bitstream .
Revised:  With this concern in mind, we propose a generic LDH method applicable to any JPEG bitstream .
Edit intent: clarity
Original:  With this concern in mind, we aim to propose a generic LDH method  applicable to any JPEG bitstream .
Revised:  With this concern in mind, we aim to propose a generic LDH method that is applicable to any JPEG bitstream .
Edit intent: clarity
Original:  Then, We explicitly formulate the construction of TCM as a combinatorial optimization problem and subsequently solve the problem by leveraging the genetic algorithm  .
Revised:  Then, We explicitly formulate the construction of TCM as a combinatorial optimization problem . The optimization problem can be solved by using some optimization algorithms. For example, in this paper, we use the genetic algorithm .
Edit intent: coherence
Original:  Consequently, the high embedding capacity can be achieved and the file size expansion in the marked bitstream is also well alleviated.
Revised:  Consequently, the high embedding capacity can be achieved , and the file-size increment in the marked bitstream is also well alleviated.
Edit intent: clarity
Original:  Finally, we embed additional data and modify the file header to guarantee  the marked bitstream is compatible with popular JPEG decoders.
Revised:  Finally, we embed additional data and modify the file header to guarantee that the marked bitstream is compatible with popular JPEG decoders.
Edit intent: fluency
Original:  The model integrates age-structured Susceptible-Exposed-Infected-Removed dynamics with real mobile phone data accounting for the population mobility  .
Revised:  The model integrates age-structured Susceptible-Exposed-Infected-Removed dynamics with real mobile phone data accounting for the population mobility , is presented .
Edit intent: coherence
Original:  A single user who consents to allow access to their own profile can thereby expose the personal data of their network connections to non-consented access.
Revised:  A user who consents to allow access to their own profile can thereby expose the personal data of their network connections to non-consented access.
Edit intent: clarity
Original:  A single user who consents to allow access to their own profile can thereby expose the personal data of their network connections to non-consented access.
Revised:  A single user who consents to allow access to their profile can expose the personal data of their network connections to non-consented access.
Edit intent: clarity
Original:  The traditional (informed individual) consent model is therefore not appropriate in online social networks where informed consent may not be possible for all users affected by data processing and where information is shared and distributed across many nodes .
Revised:  Therefore, the traditional consent model (informed and individual) is not appropriate in online social networks where informed consent may not be possible for all users affected by data processing and where information is shared and distributed across many nodes .
Edit intent: clarity
Original:  The traditional (informed individual) consent model is therefore not appropriate in online social networks where informed consent may not be possible for all users affected by data processing and where information is shared and distributed across many nodes .
Revised:  The traditional (informed individual) consent model is therefore not appropriate in social networks where informed consent may not be possible for all users affected by data processing and where information is shared and distributed across many nodes .
Edit intent: clarity
Original:  The traditional (informed individual) consent model is therefore not appropriate in online social networks where informed consent may not be possible for all users affected by data processing and where information is shared and distributed across many nodes .
Revised:  The traditional (informed individual) consent model is therefore not appropriate in online social networks where informed consent may not be possible for all users affected by data processing and where information is distributed across users .
Edit intent: clarity
Original:  We model the impact of distributed consent on the observability of social networks and find that relatively low adoption of even the simplest formulation of distributed consent would allow macroscopic subsets of online networks to preserve their connectivity and privacy .
Revised:  We model the impact of distributed consent on the observability of social networks and find that low adoption would allow macroscopic subsets of online networks to preserve their connectivity and privacy .
Edit intent: clarity
Original:  Our framework incorporates several key factors present in testing data, such as  high risk individuals are more likely to undergo testing and infected individuals potentially act as asymptomatic carriers of the disease .
Revised:  Our framework incorporates several key factors present in testing data, such as the fact that high risk individuals are more likely to undergo testing and infected individuals potentially act as asymptomatic carriers of the disease .
Edit intent: coherence
Original:  Our framework incorporates several key factors present in testing data, such as  high risk individuals are more likely to undergo testing and infected individuals potentially act as asymptomatic carriers of the disease .
Revised:  Our framework incorporates several key factors present in testing data, such as high risk individuals are more likely to undergo testing .
Edit intent: clarity
Original:  \mbox{ fklst proposed several research problems on packing arborescences.
Revised:  proposed several research problems on packing arborescences.
Edit intent: clarity
Original:  Some of them were settled in that paper and others were solved later by Matsuoka and Tanigawa \mbox{ mt Gao and Yang \mbox{ gy .
Revised:  Some of them were settled in that article and others were solved later by Matsuoka and Tanigawa \mbox{ mt Gao and Yang \mbox{ gy .
Edit intent: fluency
Original:  Some of them were settled in that paper and others were solved later by Matsuoka and Tanigawa \mbox{ mt Gao and Yang \mbox{ gy .
Revised:  Some of them were settled in that paper and others were solved later by Matsuoka and Tanigawa and by Gao and Yang \mbox{ gy .
Edit intent: clarity
Original:  Some of them were settled in that paper and others were solved later by Matsuoka and Tanigawa \mbox{ mt Gao and Yang \mbox{ gy .
Revised:  Some of them were settled in that paper and others were solved later by Matsuoka and Tanigawa \mbox{ mt Gao and Yang .
Edit intent: fluency
Original:  The last open problem will be settled in this paper .
Revised:  The last open problem is settled in this paper .
Edit intent: clarity
Original:  The last open problem will be settled in this paper .
Revised:  The last open problem will be settled in this article .
Edit intent: fluency
Original:  We show how to turn an inductive idea used in the last two articles into a simple proof technique that allows to relate previous results on arborescence packings.
Revised:  We show how to turn an inductive idea used in the latter two articles into a simple proof technique that allows to relate previous results on arborescence packings.
Edit intent: fluency
Original:  We show how a strong version of Edmonds' theorem \mbox{ e\hspace{0pt} } on packing spanning arborescences implies Kamiyama, Katoh and Takizawa's result \mbox{ \cite{kkt }\hspace{0pt} } on packing reachability arborescences and how Durand de Gevigney, Nguyen and Szigeti's theorem \mbox{ \cite{dns }\hspace{0pt} } on matroid-based packing of arborescences implies Kir\'aly's result \mbox{ \cite{k }\hspace{0pt} } on matroid-reachability-based packing of arborescences.
Revised:  We show how a strong version of Edmonds' theorem \hspace{0pt} } on packing spanning arborescences implies Kamiyama, Katoh and Takizawa's result \mbox{ \cite{kkt }\hspace{0pt} } on packing reachability arborescences and how Durand de Gevigney, Nguyen and Szigeti's theorem \mbox{ \cite{dns }\hspace{0pt} } on matroid-based packing of arborescences implies Kir\'aly's result \mbox{ \cite{k }\hspace{0pt} } on matroid-reachability-based packing of arborescences.
Edit intent: clarity
Original:  We show how a strong version of Edmonds' theorem \mbox{ e\hspace{0pt} } on packing spanning arborescences implies Kamiyama, Katoh and Takizawa's result \mbox{ \cite{kkt }\hspace{0pt} } on packing reachability arborescences and how Durand de Gevigney, Nguyen and Szigeti's theorem \mbox{ \cite{dns }\hspace{0pt} } on matroid-based packing of arborescences implies Kir\'aly's result \mbox{ \cite{k }\hspace{0pt} } on matroid-reachability-based packing of arborescences.
Revised:  We show how a strong version of Edmonds' theorem \mbox{ e\hspace{0pt} } on packing spanning arborescences implies Kamiyama, Katoh and Takizawa's result }\hspace{0pt} } on packing reachability arborescences and how Durand de Gevigney, Nguyen and Szigeti's theorem \mbox{ \cite{dns }\hspace{0pt} } on matroid-based packing of arborescences implies Kir\'aly's result \mbox{ \cite{k }\hspace{0pt} } on matroid-reachability-based packing of arborescences.
Edit intent: clarity
Original:  We show how a strong version of Edmonds' theorem \mbox{ e\hspace{0pt} } on packing spanning arborescences implies Kamiyama, Katoh and Takizawa's result \mbox{ \cite{kkt }\hspace{0pt} } on packing reachability arborescences and how Durand de Gevigney, Nguyen and Szigeti's theorem \mbox{ \cite{dns }\hspace{0pt} } on matroid-based packing of arborescences implies Kir\'aly's result \mbox{ \cite{k }\hspace{0pt} } on matroid-reachability-based packing of arborescences.
Revised:  We show how a strong version of Edmonds' theorem \mbox{ e\hspace{0pt} } on packing spanning arborescences implies Kamiyama, Katoh and Takizawa's result \mbox{ \cite{kkt }\hspace{0pt} } on packing reachability arborescences and how Durand de Gevigney, Nguyen and Szigeti's theorem \mbox{ \cite{dns }\hspace{0pt} } on matroid-based packing of arborescences implies Kir\'aly's result }\hspace{0pt} } on matroid-reachability-based packing of arborescences.
Edit intent: fluency
Original:  These strategies are then applied to South African data.
Revised:  The strategies are then applied to South African data.
Edit intent: fluency
Original:  We introduce a notion of a certificatae of an extensive-form approximate Nash equilibrium.
Revised:  We introduce a notion of a certificate of an extensive-form approximate Nash equilibrium.
Edit intent: fluency
Original:  In zero-sum games, we further show that an optimal certificate---given the exploration so far---can be computed with any standard game-solving algorithm (e.g., using a linear program or counterfactual regret minimization).
Revised:  In zero-sum games, we further show that an optimal certificate -- given the exploration so far---can be computed with any standard game-solving algorithm (e.g., using a linear program or counterfactual regret minimization).
Edit intent: fluency
Original:  In zero-sum games, we further show that an optimal certificate---given the exploration so far---can be computed with any standard game-solving algorithm (e.g., using a linear program or counterfactual regret minimization).
Revised:  In zero-sum games, we further show that an optimal certificate---given the exploration so far -- can be computed with any standard game-solving algorithm (e.g., using a linear program or counterfactual regret minimization).
Edit intent: fluency
Original: Analyzing and extracting useful information from real-world complex networks has become a key challenge due to the their large sizes such networks achieve nowadays.
Revised: Extracting information from real-world complex networks has become a key challenge due to the their large sizes such networks achieve nowadays.
Edit intent: clarity
Original: Analyzing and extracting useful information from real-world complex networks has become a key challenge due to the their large sizes such networks achieve nowadays.
Revised: Analyzing and extracting useful information from real-world networks has become a key challenge due to the their large sizes such networks achieve nowadays.
Edit intent: clarity
Original: Analyzing and extracting useful information from real-world complex networks has become a key challenge due to the their large sizes such networks achieve nowadays.
Revised: Analyzing and extracting useful information from real-world complex networks has become a key challenge due to the large sizes such networks achieve nowadays.
Edit intent: fluency
Original:  For instance, depending on the intended node centrality, it becomes unfeasible to compute it for such large complex networks due to the high computational cost.
Revised:  Depending on the intended node centrality, it becomes unfeasible to compute it for such large complex networks due to the high computational cost.
Edit intent: coherence
Original:  For instance, depending on the intended node centrality, it becomes unfeasible to compute it for such large complex networks due to the high computational cost.
Revised:  For instance, depending on the intended node centrality, it becomes unfeasible to compute it for such large complex networks due to the computational cost.
Edit intent: clarity
Original:  One way to tackle this problem is by developing fast methods capable of approximating the network centralities.
Revised:  One way to tackle this problem is by developing fast methods capable of approximating network centralities.
Edit intent: fluency
Original:  In this paper, we propose an approach capable of efficiently approximating node centralities for large networks using Neural Networks and Node Embedding echniques.
Revised:  In this paper, we propose an approach for efficiently approximating node centralities for large networks using Neural Networks and Node Embedding echniques.
Edit intent: clarity
Original:  We show that the NCA-GCN model works well in different node centralities for different network sizes  .
Revised:  We show that the NCA-GCN model works well in different node centralities and different network sizes .
Edit intent: clarity
Original: Extracting information from real-world networks has become a key challenge due to the large sizes such networks achieve nowadays.
Revised: Extracting information from real-world large networks is a key challenge due to the large sizes such networks achieve nowadays.
Edit intent: clarity
Original: Extracting information from real-world networks has become a key challenge due to the large sizes such networks achieve nowadays.
Revised: Extracting information from real-world networks has become a key challenge nowadays.
Edit intent: clarity
Original:  Depending on the intended node centrality, it becomes unfeasible to compute it for such large complex networks due to the computational cost.
Revised:  Depending on the intended node centrality, it becomes unfeasible to compute it for such large networks given the computational cost.
Edit intent: clarity
Original:  One way to tackle this problem is by developing fast methods capable of approximating network centralities.
Revised:  One solution is to develop fast methods capable of approximating network centralities.
Edit intent: clarity
Original:  In this paper , we propose an approach for efficiently approximating node centralities for large networks using Neural Networks and Graph Embedding techniques.
Revised:  Here , we propose an approach for efficiently approximating node centralities for large networks using Neural Networks and Graph Embedding techniques.
Edit intent: coherence
Original:  NCA-GE also trains pretty fast, requiring only a set of small synthetic graphs , and it works well for different node centralities and different network sizes and topologies.
Revised:  NCA-GE also trains pretty fast, requiring only a set of small synthetic graphs , and it works well for different node centralities , network sizes, and topologies.
Edit intent: fluency
Original:  Depending on the intended node centrality , it becomes unfeasible to compute it for such large networks given the computational cost.
Revised:  For instance, computing a node centrality may become unfeasible depending on the intended node centrality , it becomes unfeasible to compute it for such large networks given the computational cost.
Edit intent: clarity
Original:  Depending on the intended node centrality , it becomes unfeasible to compute it for such large networks given the computational cost.
Revised:  Depending on the intended centrality due to its computational cost.
Edit intent: clarity
Original:  Finally, we show that NCA-GE outperforms, in a variety of scenarios, the state-of-the-art method that approximates centrality ranks using the degree and eigenvector centralities as input  .
Revised:  Finally, we compare our approach to the state-of-the-art method that approximates centrality ranks using the degree and eigenvector centralities as input .
Edit intent: clarity
Original: A new proposal in database indexing has been for index structuresto automatically learn and use the distribution of the underlying data to improve their performance.
Revised: Recent work proposed learned index structures, which learn the distribution of the underlying data to improve their performance.
Edit intent: clarity
Original:  Initial work onlearned indexes has repeatedly shown that by learning the distribution of the data, index structures such as the B-Tree , can boost their performance by an order of magnitude while using a smaller memory footprint.
Revised:  Initial work on has repeatedly shown that by learning the distribution of the data, index structures such as the B-Tree , can boost their performance by an order of magnitude while using a smaller memory footprint.
Edit intent: clarity
Original:  Initial work onlearned indexes has repeatedly shown that by learning the distribution of the data, index structures such as the B-Tree , can boost their performance by an order of magnitude while using a smaller memory footprint.
Revised:  Initial work onlearned indexes has repeatedly shown that by learning the distribution of the data, index structures such as the B-Tree can improve their performance by an order of magnitude while using a smaller memory footprint.
Edit intent: clarity