wanyu/IteraTeR_v2 huggingface dataset:
Original:  Then we also show that the PIE can be used to guarantee low re-identification risks for the local obfuscation mechanisms while keeping high utility.
Revised:  Then we show that the PIE can be used to guarantee low re-identification risks for the local obfuscation mechanisms while keeping high utility.
Edit intent: clarity
Original:  Then we also show that the PIE can be used to guarantee low re-identification risks for the local obfuscation mechanisms while keeping high utility.
Revised:  Then we also show that the PIE can be used to guarantee low reidentification risks for the local obfuscation mechanisms while keeping high utility.
Edit intent: fluency
Original:  However, there are scenarios in which the adversary needs to perform re-identification attacks to link the obfuscated data to users in this model.
Revised:  However, there are scenarios in which the adversary wants to perform re-identification attacks to link the obfuscated data to users in this model.
Edit intent: clarity
Original:  LDP can cause excessive obfuscation and destroy the utility in these scenarios , because it is not designed to directly prevent re-identification.
Revised:  LDP can cause excessive obfuscation and destroy the utility in these scenarios because it is not designed to directly prevent re-identification.
Edit intent: fluency
Original:  In this paper, we propose a privacy metric which we call the PIE (Personal Information Entropy).
Revised:  In this paper, we propose a privacy metric which we call PIE (Personal Information Entropy).
Edit intent: fluency
Original:  Through experiments, we show that LDP fails to guarantee meaningful privacy and utility in distribution estimation .
Revised:  Through experiments, we show that when we consider re-identification as a privacy risk, LDP can cause excessive obfuscation and destroy the utility .
Edit intent: clarity
Original:  Then we show that the PIE can be used to guarantee low reidentification risks for the local obfuscation mechanisms while keeping high utility.
Revised:  Then we show that the PIE can be used to guarantee low re-identification risks for the local obfuscation mechanisms while keeping high utility.
Edit intent: fluency
Original:  In this paper, we propose a measure of reidentification risks, which we call PIE (Personal Information Entropy).
Revised:  In this paper, we propose a measure of re-identification risks, which we call PIE (Personal Information Entropy).
Edit intent: fluency
Original:  Focusing is a restriction of the proof-search space that can capture various goal-directed proof-search procedures ;
Revised:  The focusing principle is a restriction of the proof-search space that can capture various goal-directed proof-search procedures ;
Edit intent: clarity
Original:  then we propose a polarised and focused variant of this calculus that we show is sound and complete via a cut-elimination argument.
Revised:  then we propose a polarised and focused variant that we show is sound and complete via a cut-elimination argument.
Edit intent: clarity
Original:  All of these methods rely on the fact that most of the topological constructions are actually stratifiable and differentiable almost everywhere.
Edit intent: coherence
Original:  However, the corresponding gradient and associated code is always anchored to a specific application and/or topological construction, and do not come with theoretical guarantees.
Revised:  However, the approaches proposed in the literature are usually anchored to a specific application and/or topological construction, and do not come with theoretical guarantees.
Edit intent: clarity
Original:  Conjugate gradient experiments reveal that in this framework the condition number of the Hessian is a good proxy for convergence.
Revised:  Conjugate gradient experiments show that in this framework the condition number of the Hessian is a good proxy for convergence.
Edit intent: fluency
Original:  This kind of problems have several interesting applications in understanding the spread of a disease in a network, tracing contacts in epidemic outbreaks, and finding signaling pathways in the brain network  .
Revised:  These kind of problems have several interesting applications in understanding the spread of a disease in a network, tracing contacts in epidemic outbreaks, and finding signaling pathways in the brain network .
Edit intent: fluency
Original:  This kind of problems have several interesting applications in understanding the spread of a disease in a network, tracing contacts in epidemic outbreaks, and finding signaling pathways in the brain network  .
Revised:  This kind of problems have several applications in understanding the spread of a disease in a network, tracing contacts in epidemic outbreaks, and finding signaling pathways in the brain network .
Edit intent: clarity
Original:  This kind of problems have several interesting applications in understanding the spread of a disease in a network, tracing contacts in epidemic outbreaks, and finding signaling pathways in the brain network  .
Revised:  This kind of problems have several interesting applications in understanding the spread of a disease in a network, tracing contacts in epidemic outbreaks, finding signaling pathways in the brain network .
Edit intent: fluency
Original:  We present an algebraic algorithm based on constrained multilinear sieving for solving the restless reachability problems we propose.
Revised:  We present an algebraic algorithmic framework based on constrained multilinear sieving for solving the restless reachability problems we propose.
Edit intent: clarity
Original:  With an open-source implementation  we demonstrate that the algorithm can scale to large temporal graphs with tens of millions of edges, despite the problem being NP-hard.
Revised:  With an open-source implementation , we demonstrate that the algorithm can scale to large temporal graphs with tens of millions of edges, despite the problem being NP-hard.
Edit intent: fluency
Original:  With an open-source implementation  we demonstrate that the algorithm can scale to large temporal graphs with tens of millions of edges, despite the problem being NP-hard.
Revised:  With an open-source implementation we demonstrate that the algorithm can scale to large temporal graphs with tens of millions of edges, despite the problems being NP-hard.
Edit intent: fluency
Original:  For instance, we can solve the restless reachability problem by restricting the path length to 9 in a real-world graph dataset with over 36 million directed edges in less than one hour on a 4-core Haswell desktop .
Revised:  For instance, we can solve the restless reachability problem by restricting the path length to 9 in a real-world graphs .
Edit intent: clarity
Original:  Based on this novel topology, we investigate a blockage type detection scheme, which reacts to blockage effects quickly and assist in various path reconfiguration approaches.
Revised:  Based on this novel topology, we investigate a blockage type detection scheme, which reacts to blockage effects quickly and assists in various path reconfiguration approaches.
Edit intent: fluency
Original: Conway's Game of Life (GoL) is the best-known cellular automaton.
Revised: Conway's Game of Life is the best-known cellular automaton.
Edit intent: clarity
Original:  GoL belongs to the set of semi-totalistic cellular automata, a family with 262,144 members.
Revised:  The Game of Life belongs to the set of semi-totalistic cellular automata, a family with 262,144 members.
Edit intent: clarity
Original:  In such a large family, what makes GoL stand out?
Revised:  Many of these automata may deserve as much attention as the Game of Life, if not more. The challenge we address here is to provide a structure for organizing this large family, what makes GoL stand out?
Edit intent: clarity
Original:  In such a large family, what makes GoL stand out?
Revised:  In such a large family, to make it easier to find interesting automata, and to understand the relations between automata.
Edit intent: coherence
Original:  Individuals with the Huntingtin gene mutation , which causes HD , may exhibit a range of speech symptoms as they progress from premanifest to manifest HD.
Revised:  Individuals with the gene mutation which causes HD , may exhibit a range of speech symptoms as they progress from premanifest to manifest HD.
Edit intent: clarity
Original:  Individuals with the Huntingtin gene mutation , which causes HD , may exhibit a range of speech symptoms as they progress from premanifest to manifest HD.
Revised:  Individuals with the Huntingtin gene mutation , which causes HD may exhibit a range of speech symptoms as they progress from premanifest to manifest HD.
Edit intent: fluency
Original:  Speech-based passive monitoring has the potential to augment clinical information by more continuously tracking manifestation symptoms.
Edit intent: coherence
Original:  To do so, we focus on one speech symptom of HD: distorted vowels .
Revised:  To do so, we focus on a key speech symptom of HD: distorted vowels .
Edit intent: clarity
Original:  To do so, we focus on one speech symptom of HD: distorted vowels .
Revised:  To do so, we focus on one speech symptom of HD: vowel distortion .
Edit intent: fluency
Original:  We introduce a set of Filtered Vowel Distortion Measures (FVDM) which we extract from read speech.
Revised:  We introduce a set of vowel features which we extract from read speech.
Edit intent: clarity
Original:  We introduce a set of Filtered Vowel Distortion Measures (FVDM) which we extract from read speech.
Revised:  We introduce a set of Filtered Vowel Distortion Measures (FVDM) which we extract from connected speech.
Edit intent: clarity
Original: We propose a sampling based method for computing the tensor ring (TR) decomposition of a data tensor.
Revised: We propose a sampling-based method for computing the tensor ring (TR) decomposition of a data tensor.
Edit intent: fluency
Original:  We provide relative error high probability guarantees for the sampled least squares problems.
Revised:  We provide high-probability relative-error guarantees for the sampled least squares problems.
Edit intent: clarity
Original:  The real data comes from hyperspectral imaging, video recordings, and a subset of the COIL-100 image dataset.
Edit intent: coherence
Original:  Our method achieves substantial speedup---sometimes two or three orders of magnitude---over competing methods, while maintaining good accuracy  .
Revised:  Our method achieves substantial speedup -- sometimes two or three orders of magnitude---over competing methods, while maintaining good accuracy .
Edit intent: fluency
Original:  Our method achieves substantial speedup---sometimes two or three orders of magnitude---over competing methods, while maintaining good accuracy  .
Revised:  Our method achieves substantial speedup---sometimes two or three orders of magnitude -- over competing methods, while maintaining good accuracy .
Edit intent: fluency
Original:  They are important for many use cases, including failure recovery to ensure rapid training progress , and online training to improve inference prediction accuracy .
Revised:  They are important for many use cases, including failure recovery to ensure rapid training progress . In addition, they are used for online training to improve inference prediction accuracy .
Edit intent: coherence
Original:  Given the typically large and ever-increasing recommendation model sizes, the checkpoint frequency and effectiveness is often bottlenecked by the storage write bandwidth and capacity , as well as the network bandwidth.
Revised:  Given the typically large and ever-increasing recommendation model sizes, checkpoint frequency is often bottlenecked by the storage write bandwidth and capacity , as well as the network bandwidth.
Edit intent: clarity
Original:  Overall, this study demonstrates that tauRAMD combines both computational efficiency and the ability to capture the main features determining the relative dissociation rates, thus providing insights that could be exploited in drug design .
Revised:  Overall, this study provides physical insights that could be exploited in drug design .
Edit intent: clarity
Original:  We then manually-annotated the tweets by veracity to support research on misinformation detection, which is one of the major problems faced during a pandemic.
Revised:  Tweets were manually-annotated the tweets by veracity to support research on misinformation detection, which is one of the major problems faced during a pandemic.
Edit intent: coherence
Original:  We then manually-annotated the tweets by veracity to support research on misinformation detection, which is one of the major problems faced during a pandemic.
Revised:  We then manually-annotated by veracity to support research on misinformation detection, which is one of the major problems faced during a pandemic.
Edit intent: clarity
Original:  We aim to support two classes of misinformation detection problems over Twitter: verifying free-text claims (called claim-level verification) and verifying claims expressed in tweets (called tweet-level verification).
Revised:  We aim to support two classes of misinformation detection over Twitter: verifying free-text claims (called claim-level verification) and verifying claims expressed in tweets (called tweet-level verification).
Edit intent: clarity
Original: Finite element modeling of charged species transport has enabled analysis, design  and optimization of a diverse array of electrochemical and electrokinetic devices.
Revised: Finite element modeling of charged species transport has enabled analysis, design , and optimization of a diverse array of electrochemical and electrokinetic devices.
Edit intent: fluency
Original:  These systems are represented by the Poisson-Nernst-Plank equations coupled with the Navier-Stokes equation, with a key quantity of interest being the current at the system boundaries.
Revised:  These systems are represented by the Poisson-Nernst-Planck equations coupled with the Navier-Stokes equation, with a key quantity of interest being the current at the system boundaries.
Edit intent: clarity
Original:  We resolve this challenge by using the Dirichlet-to-Neumann transformation to weakly impose the Dirichlet conditions for the Poisson-Nernst-Plank equations.
Revised:  We resolve this challenge by using the Dirichlet-to-Neumanntransformation to weakly impose the Dirichlet conditions for the Poisson-Nernst-Plank equations.
Edit intent: fluency
Original:  We resolve this challenge by using the Dirichlet-to-Neumann transformation to weakly impose the Dirichlet conditions for the Poisson-Nernst-Plank equations.
Revised:  We resolve this challenge by using the Dirichlet-to-Neumann transformation to weakly impose the Dirichlet conditions for the Poisson-Nernst-Planck equations.
Edit intent: clarity
Original:  The results obtained with weakly imposed Dirichlet boundary conditions showed excellent agreement with those obtained when conventional boundary conditions with highly resolved mesh were employed .
Revised:  The results obtained with weakly imposed Dirichlet boundary conditions showed excellent agreement with those obtained when conventional boundary conditions with highly resolved mesh we reemployed .
Edit intent: clarity
Original:   This approach substantially reduces the computational cost of modeling electrochemical systems.
Revised:  This approach substantially reduces the computational cost of model-ing electrochemical systems.
Edit intent: fluency
Original:  IoT has contributed significantly in numerous application areas.
Revised:  IoT has contributed significantly to numerous application areas.
Edit intent: fluency
Original:  The stormy expansion of smart devices and their credence for data transfer on wireless mechanics boosts their susceptibility to cyber-attacks.
Revised:  The stormy expansion of smart devices and their credence for data transfer using wireless mechanics boosts their susceptibility to cyber-attacks.
Edit intent: fluency
Original:  Consequently, the rate of cybercrimes is increasing day by day.
Revised:  Consequently, the rate of cybercrime is increasing day by day.
Edit intent: fluency
Original:  IoT forensics plays a vital role in cybercrime investigation .
Revised:  IoT forensics plays a vital role in cybercrime investigations .
Edit intent: fluency
Original:  At last, the various open research challenges in the area of IoT to assist cybercrime investigation are explained, which provide a new direction to the researchers to work further .
Revised:  At last, various open research challenges in the area of IoT to assist cybercrime investigation are explained, which provide a new direction to the researchers to work further .
Edit intent: fluency
Original:  At last, the various open research challenges in the area of IoT to assist cybercrime investigation are explained, which provide a new direction to the researchers to work further .
Revised:  At last, the various open research challenges in IoT to assist cybercrime investigation are explained, which provide a new direction to the researchers to work further .
Edit intent: clarity
Original:  At last, the various open research challenges in the area of IoT to assist cybercrime investigation are explained, which provide a new direction to the researchers to work further .
Revised:  At last, the various open research challenges in the area of IoT to assist cybercrime investigation are explained, which provide a new direction for further research .
Edit intent: clarity
Original: Graph neural networks (GNNs) can process graphs of different sizes but their capacity to generalize across sizes  is still not well understood.
Revised: Graph neural networks (GNNs) can process graphs of different sizes , but their ability to generalize across sizes is still not well understood.
Edit intent: clarity
Original:  First, as a self-supervised learning problem (SSL) over the target domain of large graphs.
Revised:  First, as a self-supervised learning problem (SSL) task aimed at learning meaningful representations of local structures that appear in large graphs.
Edit intent: clarity
Original:  We then study the size-generalization problem empirically and demonstrate that when there is a discrepancy in local structure, GNNs tend to converge to non-generalizing solutions in practice .
Revised:  We then study the size-generalization problem empirically and demonstrate that when there is a discrepancy in local structure, GNNs tend to converge to non-generalizing solutions .
Edit intent: clarity
Original:  We perform experiments on Burgers' equation, Darcy flow, and the Navier-Stokes equation (including the turbulent regime).
Revised:  We perform experiments on Burgers' equation, Darcy flow, and Navier-Stokes equation (including the turbulent regime).
Edit intent: fluency
Original: The arboricity of a network is the minimum number of forests needed to cover all edges of the network, which measures the network density 24%DIFDELCMD < ]%%% . We study the arboricity from a game theoretic perspective and consider cost allocations in the minimum forest cover problem.
Revised: The arboricity of a graph is the minimum number of forests needed to cover all edges of the network, which measures the network density 24%DIFDELCMD < ]%%% . We study the arboricity from a game theoretic perspective and consider cost allocations in the minimum forest cover problem.
Edit intent: clarity
Original: The arboricity of a network is the minimum number of forests needed to cover all edges of the network, which measures the network density 24%DIFDELCMD < ]%%% . We study the arboricity from a game theoretic perspective and consider cost allocations in the minimum forest cover problem.
Revised: The arboricity of a network is the minimum number of forests needed to cover all edges of the 24%DIFDELCMD < ]%%% . We study the arboricity from a game theoretic perspective and consider cost allocations in the minimum forest cover problem.
Edit intent: clarity
Original: The arboricity of a network is the minimum number of forests needed to cover all edges of the network, which measures the network density 24%DIFDELCMD < ]%%% . We study the arboricity from a game theoretic perspective and consider cost allocations in the minimum forest cover problem.
Revised: The arboricity of a network is the minimum number of forests needed to cover all edges of the network, which measures the network density %DIFDELCMD < ]%%% . We study the arboricity from a game theoretic perspective and consider cost allocations in the minimum forest cover problem.
Edit intent: fluency
Original: The arboricity of a network is the minimum number of forests needed to cover all edges of the network, which measures the network density 24%DIFDELCMD < ]%%% . We study the arboricity from a game theoretic perspective and consider cost allocations in the minimum forest cover problem.
Revised: The arboricity of a network is the minimum number of forests needed to cover all edges of the network, which measures the network density 24%DIFDELCMD < ]%%% graph. In this paper, we study the arboricity from a game theoretic perspective and consider cost allocations in the minimum forest cover problem.
Edit intent: clarity
Original: The arboricity of a network is the minimum number of forests needed to cover all edges of the network, which measures the network density 24%DIFDELCMD < ]%%% . We study the arboricity from a game theoretic perspective and consider cost allocations in the minimum forest cover problem.
Revised: The arboricity of a network is the minimum number of forests needed to cover all edges of the network, which measures the network density 24%DIFDELCMD < ]%%% . We study the arboricity from a game theoretic perspective and consider cost sharing in the minimum forest cover problem.
Edit intent: clarity
Original:  We introduce the arboricity game as a cooperative cost game defined on a graph G = (V, E), where the player set is E and the cost of a coalition S \subseteq E is the arboricity of the subgraph induced by S . We study properties of the core and propose an efficient algorithm for computing the nucleolus when the core is nonempty.
Revised:  We introduce the arboricity game as a cooperative cost game defined on a graph , where the players are edges and the cost of a coalition S \subseteq E is the arboricity of the subgraph induced by S . We study properties of the core and propose an efficient algorithm for computing the nucleolus when the core is nonempty.
Edit intent: clarity
Original:  We introduce the arboricity game as a cooperative cost game defined on a graph G = (V, E), where the player set is E and the cost of a coalition S \subseteq E is the arboricity of the subgraph induced by S . We study properties of the core and propose an efficient algorithm for computing the nucleolus when the core is nonempty.
Revised:  We introduce the arboricity game as a cooperative cost game defined on a graph G = (V, E), where the player set is E and the cost of each coalition is the arboricity of the subgraph induced by S . We study properties of the core and propose an efficient algorithm for computing the nucleolus when the core is nonempty.
Edit intent: clarity
Original:  We introduce the arboricity game as a cooperative cost game defined on a graph G = (V, E), where the player set is E and the cost of a coalition S \subseteq E is the arboricity of the subgraph induced by S . We study properties of the core and propose an efficient algorithm for computing the nucleolus when the core is nonempty.
Revised:  We introduce the arboricity game as a cooperative cost game defined on a graph G = (V, E), where the player set is E and the cost of a coalition S \subseteq E is the arboricity of the subgraph induced by the coalition . We study properties of the core and propose an efficient algorithm for computing the nucleolus when the core is nonempty.
Edit intent: fluency