wanyu/IteraTeR_v2 huggingface dataset:
Original:   This article introduces the task of keyphrase extractionand provides a view of existing work that is well organized and comprehensive.
Revised:  Keyphrases constitute a succinct conceptual summary of a document, which is very useful in digital information management systems for semantic indexing, faceted search, document clustering and classification. This article introduces the task of keyphrase extractionand provides a view of existing work that is well organized and comprehensive.
Edit intent: coherence
Original:  Finally, a comparative experimental study for popular unsupervised techniques on five datasets is presented .
Revised:  Finally, a comparative experimental study of popular unsupervised techniques on five datasets is presented .
Edit intent: fluency
Original:  Finally, a comparative experimental study for popular unsupervised techniques on five datasets is presented .
Revised:  Finally, a comparative experimental study for popular unsupervised techniques on five datasets .
Edit intent: clarity
Original:  We analyse the performance of two algorithms proposed by 1%DIFDELCMD < ]%%% , namely LTSVD and CTSVD, and discuss their advantages and limitations.
Revised:  We analyse the performance of two algorithms proposed by %DIFDELCMD < ]%%% , namely LTSVD and CTSVD, and discuss their advantages and limitations.
Edit intent: clarity
Original: We analyze  algorithmic problems in finitely generated semigroups of two-dimensional upper-triangular integer matrices .
Revised: We analyze algorithmic problems in finitely generated semigroups of 2-dimensional upper-triangular integer matrices .
Edit intent: fluency
Original:  On the one hand, we show that the reachability problem for 1-register machines over the integers with affine updates is PSPACE-hard, hence PSPACE-complete, strengthening a result by Finkel et al. that required polynomial updates.
Revised:  We show that the reachability problem for 1-register machines over the integers with affine updates is PSPACE-hard, hence PSPACE-complete, strengthening a result by Finkel et al. that required polynomial updates.
Edit intent: coherence
Original:  Building on a variety of techniques from recent years, we obtain a number of complexity results, including NP-completeness of the mortality problem for matrices with determinants +1 and 0.
Edit intent: coherence
Original:  We conclude that there is no further potential to improve the relation between latency and duty-cycle, but future ND protocols can improve their robustness against packet collisions.
Revised:  We conclude that there is no further potential to improve the relation between latency and duty-cycle, but future ND protocols can improve their robustness against beacon collisions.
Edit intent: clarity
Original:  For evaluation, we task \dypro with semantic classification ( %DIFDELCMD < \ie %%%  categorizing programs based on their semantics) and compared it against two prominent static models: Gated Graph Neural Network and TreeLSTM.
Revised:  For evaluation, we task \dypro with semantic classification ( %DIFDELCMD < \ie %%% i.e. categorizing programs based on their semantics) and compared it against two prominent static models: Gated Graph Neural Network and TreeLSTM.
Edit intent: coherence
Original: This paper presents a batch-parallel 2-3 tree T in the asynchronous PPM (parallel pointer machine) model that supports searches, insertions and deletions in sorted batches and has essentially optimal parallelism, even under the  QRMW (queued read-modify-write) memory  model where concurrent memory accesses to the same  location are queued and serviced one by one.
Revised: This paper presents a batch-parallel 2-3 tree T in the asynchronous PPM (parallel pointer machine) model that supports searches, insertions and deletions in sorted batches and has essentially optimal parallelism, even under the restrictive QRMW (queued read-modify-write) memory model where concurrent memory accesses to the same location are queued and serviced one by one.
Edit intent: clarity
Original: This paper presents a batch-parallel 2-3 tree T in the asynchronous PPM (parallel pointer machine) model that supports searches, insertions and deletions in sorted batches and has essentially optimal parallelism, even under the  QRMW (queued read-modify-write) memory  model where concurrent memory accesses to the same  location are queued and serviced one by one.
Revised: This paper presents a batch-parallel 2-3 tree T in the asynchronous PPM (parallel pointer machine) model that supports searches, insertions and deletions in sorted batches and has essentially optimal parallelism, even under the QRMW (queued read-modify-write) memory model where concurrent accesses to the same location are queued and serviced one by one.
Edit intent: clarity
Original: This paper presents a batch-parallel 2-3 tree T in the asynchronous PPM (parallel pointer machine) model that supports searches, insertions and deletions in sorted batches and has essentially optimal parallelism, even under the  QRMW (queued read-modify-write) memory  model where concurrent memory accesses to the same  location are queued and serviced one by one.
Revised: This paper presents a batch-parallel 2-3 tree T in the asynchronous PPM (parallel pointer machine) model that supports searches, insertions and deletions in sorted batches and has essentially optimal parallelism, even under the QRMW (queued read-modify-write) memory model where concurrent memory accesses to the same memory location are queued and serviced one by one.
Edit intent: fluency
Original:  Specifically, if T has n items, then performing an item-sorted batch  of b operations on T takes only O( b * log(n/b+1) + b ) work and O( log b + log n ) span (in the worst case as b,n -> inf).
Revised:  Specifically, if T has n items, then performing an item-sorted batch of b operations on T takes O( b * log(n/b+1) + b ) work and O( log b + log n ) span (in the worst case as b,n -> inf).
Edit intent: clarity
Original:  The input batch can be any balanced binary tree, and hence T can also be used to implement sorted sets supporting optimal intersection, union and difference of sets with sizes m <= n in O( m * log(n/m+1) ) work and O( log m + log n ) span.
Revised:  The input batch can be any balanced binary tree, and hence T can also be used to implement sorted sets supporting optimal intersection, union and difference of instances of T with sizes m <= n in O( m * log(n/m+1) ) work and O( log m + log n ) span.
Edit intent: clarity
Original:  The input batch can be any balanced binary tree, and hence T can also be used to implement sorted sets supporting optimal intersection, union and difference of sets with sizes m <= n in O( m * log(n/m+1) ) work and O( log m + log n ) span.
Revised:  The input batch can be any balanced binary tree, and hence T can also be used to implement sorted sets supporting optimal intersection, union and difference of sets with sizes m <= n , namely within O( m * log(n/m+1) ) work and O( log m + log n ) span.
Edit intent: clarity
Original:   To the author's knowledge, T is the first parallel sorted-set data structure with these performance bounds that can be used in an asynchronous multi-processor machine under a memory model with queued contention .
Revised:  To the author's knowledge, T is the first parallel sorted-set data structure that can be used in an asynchronous multi-processor machine under a memory model with queued contention .
Edit intent: clarity
Original:  All data structures and algorithms in this paper fit into the dynamic multithreading paradigm .
Revised:  Since all data structures and algorithms in this paper fit into the dynamic multithreading paradigm .
Edit intent: coherence
Original:  We subsiquently introduce jumps and analyze both constant jump size (Poisson process) and random jump size (compound Poisson process).
Revised:  We subsequently introduce jumps and analyze both constant jump size (Poisson process) and random jump size (compound Poisson process).
Edit intent: fluency
Original:  We find that global structural properties --- the total edge length and number of loops --- are sufficient to largely determine network exploration times for  both synthetic planar networks and for organelle morphologies extracted from living cells.
Revised:  We find that global structural properties --- the total edge length and number of loops --- are sufficient to largely determine network exploration times for both synthetic planar networks and organelle morphologies extracted from living cells.
Edit intent: fluency
Original:  (\tilde O(T) hides polylog(T).) This is the %DIFDELCMD < {\em %%% first near-linear time algorithm for any 4\leq k \leq polylog n. Previous fastest algorithm for small k takes \tilde O(m+n^{4/3}k^{7/3}) time [Nanongkai~et~al., STOC'19].
Revised:  (\tilde O(T) hides polylog(T).) This is the %DIFDELCMD < {\em %%% first near-linear time algorithm for any 4\leq k \leq polylog n. Previous fastest algorithm for small k takes \tilde O(m+n^{4/3}k^{7/3}) time [Nanongkai~et~al., STOC'19].
Edit intent: fluency
Original:  To evaluate the performance of a MAX-SAT solver, it is convenient to generate difficult MAX-SAT instances with solutions known in advance .
Revised:  To evaluate a MAX-SAT solver, it is convenient to generate difficult MAX-SAT instances with solutions known in advance .
Edit intent: clarity
Original:  To evaluate the performance of a MAX-SAT solver, it is convenient to generate difficult MAX-SAT instances with solutions known in advance .
Revised:  To evaluate the performance of a MAX-SAT solver, it is convenient to generate hard MAX-SAT instances with solutions known in advance .
Edit intent: clarity
Original:  To evaluate the performance of a MAX-SAT solver, it is convenient to generate difficult MAX-SAT instances with solutions known in advance .
Revised:  To evaluate the performance of a MAX-SAT solver, it is convenient to generate difficult MAX-SAT instances with known solutions .
Edit intent: clarity
Original:  For the random-loop algorithm, we provide a thorough theoretical and empirical analysis on its mathematical properties from the perspective of frustration, and observe empirically , using simulated annealing, a double phase transition behavior in the difficulty scaling behavior driven by the frustration index.
Revised:  For the random-loop algorithm, we provide a thorough theoretical and empirical analysis on its mathematical properties from the perspective of frustration, and observe empirically a double phase transition behavior in the difficulty scaling behavior driven by the frustration index.
Edit intent: clarity
Original:  For the random-loop algorithm, we provide a thorough theoretical and empirical analysis on its mathematical properties from the perspective of frustration, and observe empirically , using simulated annealing, a double phase transition behavior in the difficulty scaling behavior driven by the frustration index.
Revised:  For the random-loop algorithm, we provide a thorough theoretical and empirical analysis on its mathematical properties from the perspective of frustration, and observe empirically , using simulated annealing, a double phase transition behavior in the hardness scaling behavior driven by the frustration index.
Edit intent: clarity
Original:  For the structured-loop algorithm, we show that it offers an improvement in difficulty of the generated instances over the random-loop algorithm , with the improvement factor scaling super-exponentially with respect to the frustration index for instances at high loop density .
Revised:  For the structured-loop algorithm, we show that it offers an improvement in hardness over the random-loop algorithm , with the improvement factor scaling super-exponentially with respect to the frustration index for instances at high loop density .
Edit intent: clarity
Original:  For the structured-loop algorithm, we show that it offers an improvement in difficulty of the generated instances over the random-loop algorithm , with the improvement factor scaling super-exponentially with respect to the frustration index for instances at high loop density .
Revised:  For the structured-loop algorithm, we show that it offers an improvement in difficulty of the generated instances over the random-loop algorithm in the regime of high loop density .
Edit intent: clarity
Original:  However, complete reliance on Internet connectivity is impractical in low resource and remote environments where modern infrastructure is often lacking, power outages are frequent, and/or network connectivity is sparse (e.g. rural communities, mountainous regions of Appalachia, American Indian reservations, developing countries, and natural disaster situations).
Revised:  However, complete reliance on Internet connectivity is impractical in rural and remote environments where modern infrastructure is often lacking, power outages are frequent, and/or network connectivity is sparse (e.g. rural communities, mountainous regions of Appalachia, American Indian reservations, developing countries, and natural disaster situations).
Edit intent: clarity
Original:  This paper proposes supplementing intermittent Internet with opportunistic communication to leverage the social behaviors of patients, caregivers, and society members to facilitate out-of-range monitoring of patients via Bluetooth 5 during intermittent network connectivity  .
Revised:  This paper proposes augmenting intermittent Internet with opportunistic communication to leverage the social behaviors of patients, caregivers, and society members to facilitate out-of-range monitoring of patients via Bluetooth 5 during intermittent network connectivity .
Edit intent: clarity
Original:  This paper proposes supplementing intermittent Internet with opportunistic communication to leverage the social behaviors of patients, caregivers, and society members to facilitate out-of-range monitoring of patients via Bluetooth 5 during intermittent network connectivity  .
Revised:  This paper proposes supplementing intermittent Internet with opportunistic communication to leverage the social behaviors of patients, caregivers, and community members to facilitate out-of-range monitoring of patients via Bluetooth 5 during intermittent network connectivity .
Edit intent: clarity
Original:  The architecture is evaluated  using U.S. Census Bureau, the National Cancer Institute's, and IPUMS ATUS sample datafor Owingsville, KY, and is compared against a delay tolerant RPM case that is completely disconnected from the Internet.
Revised:  The architecture is evaluated for Owingsville, KY using U.S. Census Bureau, the National Cancer Institute's, and IPUMS ATUS sample datafor Owingsville, KY, and is compared against a delay tolerant RPM case that is completely disconnected from the Internet.
Edit intent: fluency
Original:  The architecture is evaluated  using U.S. Census Bureau, the National Cancer Institute's, and IPUMS ATUS sample datafor Owingsville, KY, and is compared against a delay tolerant RPM case that is completely disconnected from the Internet.
Revised:  The architecture is evaluated using U.S. Census Bureau, the National Cancer Institute's, and IPUMS-ATUS sample data, and is compared against a delay tolerant RPM case that is completely disconnected from the Internet.
Edit intent: clarity
Original: Parallel iterative maximal matching algorithms (adapted for switching) has long been recognized as a cost-effective family for crossbar scheduling .
Revised: Parallel maximal matching algorithms (adapted for switching) has long been recognized as a cost-effective family for crossbar scheduling .
Edit intent: clarity
Original: Parallel iterative maximal matching algorithms (adapted for switching) has long been recognized as a cost-effective family for crossbar scheduling .
Revised: Parallel iterative maximal matching algorithms (adapted for switching) appear to have stricken the best such tradeoff .
Edit intent: clarity
Original:  Although QPS-r builds upon an existing add-on technique called Queue-Proportional Sampling (QPS), we are the first to discover and prove this nice property of such matchings.
Revised:  Although QPS-r builds upon an existing technique called Queue-Proportional Sampling (QPS), we are the first to discover and prove this nice property of such matchings.
Edit intent: clarity
Original: We study the problem of estimating the volume of convex polytopes, focusing on H- and V-polytopes, as well as zonotopes .
Revised: We tackle the problem of estimating the volume of convex polytopes, focusing on H- and V-polytopes, as well as zonotopes .
Edit intent: clarity
Original:  These can be further applied in the development of verification tools, harnessing Isabelle /HOL's powerful proof automation facilities.
Revised:  These can be further applied in the development of verification tools, harnessing Isabelle 's proof automation facilities.
Edit intent: clarity
Original: Although human body shapes vary for different identities with different poses, they can be embedded into a low-dimensional space due to their similarity in structure.
Revised: Human bodies exhibit various shapes for different identities with different poses, they can be embedded into a low-dimensional space due to their similarity in structure.
Edit intent: clarity
Original: Although human body shapes vary for different identities with different poses, they can be embedded into a low-dimensional space due to their similarity in structure.
Revised: Although human body shapes vary for different identities or poses, but the body shape has certain similarities in structure and thus can be embedded into a low-dimensional space due to their similarity in structure.
Edit intent: coherence
Original: Although human body shapes vary for different identities with different poses, they can be embedded into a low-dimensional space due to their similarity in structure.
Revised: Although human body shapes vary for different identities with different poses, they can be embedded in a low-dimensional space due to their similarity in structure.
Edit intent: fluency
Original:  Inspired by the recent work on latent representation learning with a deformation-based mesh representation, we propose an autoencoder like network architecture to learn disentangled shape and pose embedding specifically for  3D human body.
Revised:  Inspired by the recent work on latent representation learning with a deformation-based mesh representation, we propose an autoencoder like network architecture to learn disentangled shape and pose embedding specifically for the 3D human body.
Edit intent: fluency
Original:  Moreover, we construct a large dataset of human body models with consistent topology for the learning of  neural network.
Revised:  Moreover, we construct a large dataset of human body models with consistent topology for the learning of the neural network.
Edit intent: fluency
Original:  Our learned embedding can achieve not only superior reconstruction accuracy but also provide great flexibilities in 3D human body creations via interpolation, bilateral interpolation and latent space sampling , which is confirmed by extensive experiments.
Revised:  Our learned embedding can not only achieve superior reconstruction accuracy but also provide great flexibilities in 3D human body creations via interpolation, bilateral interpolation and latent space sampling , which is confirmed by extensive experiments.
Edit intent: fluency
Original:  Our learned embedding can achieve not only superior reconstruction accuracy but also provide great flexibilities in 3D human body creations via interpolation, bilateral interpolation and latent space sampling , which is confirmed by extensive experiments.
Revised:  Our learned embedding can achieve not only superior reconstruction accuracy but also provide great flexibility in 3D human body creations via interpolation, bilateral interpolation and latent space sampling , which is confirmed by extensive experiments.
Edit intent: fluency
Original:  Our learned embedding can achieve not only superior reconstruction accuracy but also provide great flexibilities in 3D human body creations via interpolation, bilateral interpolation and latent space sampling , which is confirmed by extensive experiments.
Revised:  Our learned embedding can achieve not only superior reconstruction accuracy but also provide great flexibilities in 3D human body generation via interpolation, bilateral interpolation and latent space sampling , which is confirmed by extensive experiments.
Edit intent: clarity
Original:  Our learned embedding can achieve not only superior reconstruction accuracy but also provide great flexibilities in 3D human body creations via interpolation, bilateral interpolation and latent space sampling , which is confirmed by extensive experiments.
Revised:  Our learned embedding can achieve not only superior reconstruction accuracy but also provide great flexibilities in 3D human body creations via interpolation, bilinear interpolation, and latent space sampling , which is confirmed by extensive experiments.
Edit intent: clarity
Original:  Different from the previous schemes, the proposed scheme adopts the Non-equal length code mapping (NLCM) method to construct mapping relationship, which is not limited to the Huffman code lengths in a mapping set are equal.
Revised:  Different from the previous schemes, our mapping strategy allows the lengths of unused and used VLCs in a mapping set are equal.
Edit intent: clarity
Original: We study the query complexity of estimating the covariance matrix T of a distribution D over d-dimensional vectors, under the assumption that T is Toeplitz.
Revised: We study the sample complexity of estimating the covariance matrix T of a distribution D over d-dimensional vectors, under the assumption that T is Toeplitz.
Edit intent: clarity
Original:  We are interested in estimation strategies that may choose to view only a subset of entries in each vector sample x ^{(\ell) \sim D, which often equates to reducing hardware and communication requirements in applications ranging from wireless signal processing to advanced imaging.
Revised:  We are interested in estimation strategies that may choose to view only a subset of entries in each vector sample x \sim D, which often equates to reducing hardware and communication requirements in applications ranging from wireless signal processing to advanced imaging.
Edit intent: clarity
Original: The advice model of online computation captures the setting in which the online algorithm is given some partial information concerning the request sequence.
Revised: The advice model of online computation captures a setting in which the online algorithm is given some partial information concerning the request sequence.
Edit intent: fluency
Original: The advice model of online computation captures the setting in which the online algorithm is given some partial information concerning the request sequence.
Revised: The advice model of online computation captures the setting in which the algorithm is given some partial information concerning the request sequence.
Edit intent: fluency
Original:  Our objective is to quantify the impact of untrusted advice so as to design and analyze online algorithms that are resilient and perform well even when the advice is generated in a malicious, adversarial manner.
Revised:  Our objective is to quantify the impact of untrusted advice so as to design and analyze online algorithms that are robust and perform well even when the advice is generated in a malicious, adversarial manner.
Edit intent: clarity
Original:  In the context of traffic signal control, good cooperation among the traffic signal agents enables the vehicles to move through intersections more smoothly . Conventional transportation approaches implement cooperation by pre-calculating the offsets between two intersections.
Revised:  In the context of traffic signal control, good cooperation among the traffic signals enables vehicles to move through intersections more smoothly . Conventional transportation approaches implement cooperation by pre-calculating the offsets between two intersections.
Edit intent: clarity