wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our evaluation demonstrates that the enhanced mechanisms not only decrease the chances of graph recovery (with AUC dropping by up to 35 \%), but also provide even better graph utility than existing anonymization methods .
Revised:  Our evaluation demonstrates that the enhanced mechanisms not only decrease the chances of graph recovery (with AUC dropping by up to 35 \%), and provide even better graph utility than existing anonymization methods .
Edit intent: fluency
Original:  Our evaluation demonstrates that the enhanced mechanisms not only decrease the chances of graph recovery (with AUC dropping by up to 35 \%), but also provide even better graph utility than existing anonymization methods .
Revised:  Our evaluation demonstrates that the enhanced mechanisms not only decrease the chances of graph recovery (with AUC dropping by up to 35 \%), but also provide even better utility than the existing anonymization mechanisms .
Edit intent: clarity
Original:  We also prove that the intersection hypergraph of a family of n regions with linear union complexity with respect to a family of pseudo-disks admits a proper coloring with constant many colors and a conflict-free coloring with O(\log n) colors.
Revised:  We also prove that the intersection hypergraph of a family of n regions with linear union complexity with respect to a family of pseudo-disks admits a proper coloring with constantly many colors and a conflict-free coloring with O(\log n) colors.
Edit intent: fluency
Original:  4, 5 . However, findings from animal models and post-mortem studies in humans suggest that developmental dyslexia might also be associated with structural alterations in subcortical sensory pathways 6-12, reviewed in ref. 13 . Whether these alterations also exist in developmental dyslexia in-vivo and how they relate to dyslexia symptoms is currently unknown.
Revised:  4, 5 . However, findings from animal models and post-mortem studies in humans suggest that developmental dyslexia might also be associated with structural alterations in subcortical sensory pathways . Whether these alterations also exist in developmental dyslexia in-vivo and how they relate to dyslexia symptoms is currently unknown.
Edit intent: coherence
Original: This paper considers the task of matching images and sentences .
Revised: Matching images and sentences .
Edit intent: clarity
Original:  Code is availableat URL com/layumi/Image-Text-Embedding
Revised:  The code has been made publicly available.
Edit intent: clarity
Original: We consider a distribution grid used to charge electric vehicles subject to voltage stability and various other constraints .
Revised: We consider a distribution grid used to charge electric vehicles such that voltage drops stay bounded .
Edit intent: clarity
Original:  We model this as a class of resource-sharing networks  known as bandwidth-sharing networks in the communication network literature.
Revised:  We model this as a class of resource-sharing networks , known as bandwidth-sharing networks in the communication network literature.
Edit intent: fluency
Original:  Such networks have proved themselves to be an effective flow-level model of data traffic in wired and wireless networks.
Edit intent: coherence
Original:  We focus on resource sharing networks that are driven by a class of greedy control rules that can be implemented in a decentralized fashion.
Revised:  We focus on resource-sharing networks that are driven by a class of greedy control rules that can be implemented in a decentralized fashion.
Edit intent: fluency
Original:  For a large number of such control rules, we can characterize the performance of the system , subject to voltage stability constraints, by a fluid approximation.
Revised:  For a large number of such control rules, we can characterize the performance of the system by a fluid approximation.
Edit intent: clarity
Original:  This leads to a set of dynamic equations that take into account the stochastic behavior of cars .
Revised:  This leads to a set of dynamic equations that take into account the stochastic behavior of EVs .
Edit intent: style
Original:  For the class of weighted proportional fairness control, we show additional appealing properties under the linearized Distflow model, such as fairness , and a product form property of the stochastic model.
Revised:  For the class of weighted proportional fairness control, we show additional appealing properties under the linearized Distflow model, such as fairness and a product-form property of the stochastic model.
Edit intent: fluency
Original: Motivated by two problems on arithmetic progressions (APs)---concerning large deviations for AP counts in random sets and random differences in Szemer\'edi's theorem---we prove upper bounds on the Gaussian width of  the image of the n-dimensional Boolean hypercube under a mapping \psi:R^n\toR^k, where each coordinate is a constant-degree multilinear polynomial with 0/1 coefficients.
Revised: Motivated by problems on random differences in Szemer\'edi's theorem---we prove upper bounds on the Gaussian width of the image of the n-dimensional Boolean hypercube under a mapping \psi:R^n\toR^k, where each coordinate is a constant-degree multilinear polynomial with 0/1 coefficients.
Edit intent: clarity
Original: Motivated by two problems on arithmetic progressions (APs)---concerning large deviations for AP counts in random sets and random differences in Szemer\'edi's theorem---we prove upper bounds on the Gaussian width of  the image of the n-dimensional Boolean hypercube under a mapping \psi:R^n\toR^k, where each coordinate is a constant-degree multilinear polynomial with 0/1 coefficients.
Revised: Motivated by two problems on arithmetic progressions (APs)---concerning large deviations for AP counts in random sets and random differences in Szemer\'edi's theorem---we prove upper bounds on the Gaussian width of point sets that are formed by the image of the n-dimensional Boolean hypercube under a mapping \psi:R^n\toR^k, where each coordinate is a constant-degree multilinear polynomial with 0/1 coefficients.
Edit intent: clarity
Original: Motivated by two problems on arithmetic progressions (APs)---concerning large deviations for AP counts in random sets and random differences in Szemer\'edi's theorem---we prove upper bounds on the Gaussian width of  the image of the n-dimensional Boolean hypercube under a mapping \psi:R^n\toR^k, where each coordinate is a constant-degree multilinear polynomial with 0/1 coefficients.
Revised: Motivated by two problems on arithmetic progressions (APs)---concerning large deviations for AP counts in random sets and random differences in Szemer\'edi's theorem---we prove upper bounds on the Gaussian width of the image of the n-dimensional Boolean hypercube under a mapping \psi:R^n\toR^k, where each coordinate is a constant-degree multilinear polynomial with 0-1 coefficients.
Edit intent: clarity
Original:  Let X_k be the number of k-term APs in \mathbb{Z/NZ}%DIFDELCMD < ]%%% _p. We show that a precise estimate on the large deviation rate \log\Pr[X_k \geq (1+\delta)EX_k] due to Bhattacharya, Ganguly, Shao and Zhao is valid if p \geq \omega(N^{-c_k\log N) for c_k = (6k}%DIFDELCMD < \lceil%%% (k-1)/2%DIFDELCMD < \rceil%%% )^{-1, which slightly improves their bound of c_k = (6k(k-1))^{-1} for k \geq 5 (and matching their c_3 and c_4).
Revised:  \mathbb{Z/NZ}%DIFDELCMD < ]%%% _p. We show that a precise estimate on the large deviation rate \log\Pr[X_k \geq (1+\delta)EX_k] due to Bhattacharya, Ganguly, Shao and Zhao is valid if p \geq \omega(N^{-c_k\log N) for c_k = (6k}%DIFDELCMD < \lceil%%% (k-1)/2%DIFDELCMD < \rceil%%% )^{-1, which slightly improves their bound of c_k = (6k(k-1))^{-1} for k \geq 5 (and matching their c_3 and c_4).
Edit intent: clarity
Original:  Let X_k be the number of k-term APs in \mathbb{Z/NZ}%DIFDELCMD < ]%%% _p. We show that a precise estimate on the large deviation rate \log\Pr[X_k \geq (1+\delta)EX_k] due to Bhattacharya, Ganguly, Shao and Zhao is valid if p \geq \omega(N^{-c_k\log N) for c_k = (6k}%DIFDELCMD < \lceil%%% (k-1)/2%DIFDELCMD < \rceil%%% )^{-1, which slightly improves their bound of c_k = (6k(k-1))^{-1} for k \geq 5 (and matching their c_3 and c_4).
Revised:  Let X_k be the number of k-term APs in /NZ}%DIFDELCMD < ]%%% _p. We show that a precise estimate on the large deviation rate \log\Pr[X_k \geq (1+\delta)EX_k] due to Bhattacharya, Ganguly, Shao and Zhao is valid if p \geq \omega(N^{-c_k\log N) for c_k = (6k}%DIFDELCMD < \lceil%%% (k-1)/2%DIFDELCMD < \rceil%%% )^{-1, which slightly improves their bound of c_k = (6k(k-1))^{-1} for k \geq 5 (and matching their c_3 and c_4).
Edit intent: clarity
Original:  Let X_k be the number of k-term APs in \mathbb{Z/NZ}%DIFDELCMD < ]%%% _p. We show that a precise estimate on the large deviation rate \log\Pr[X_k \geq (1+\delta)EX_k] due to Bhattacharya, Ganguly, Shao and Zhao is valid if p \geq \omega(N^{-c_k\log N) for c_k = (6k}%DIFDELCMD < \lceil%%% (k-1)/2%DIFDELCMD < \rceil%%% )^{-1, which slightly improves their bound of c_k = (6k(k-1))^{-1} for k \geq 5 (and matching their c_3 and c_4).
Revised:  Let X_k be the number of k-term APs in \mathbb{Z/NZ}%DIFDELCMD < ]%%% \log N) for c_k = (6k}%DIFDELCMD < \lceil%%% (k-1)/2%DIFDELCMD < \rceil%%% )^{-1, which slightly improves their bound of c_k = (6k(k-1))^{-1} for k \geq 5 (and matching their c_3 and c_4).
Edit intent: coherence
Original:  Let X_k be the number of k-term APs in \mathbb{Z/NZ}%DIFDELCMD < ]%%% _p. We show that a precise estimate on the large deviation rate \log\Pr[X_k \geq (1+\delta)EX_k] due to Bhattacharya, Ganguly, Shao and Zhao is valid if p \geq \omega(N^{-c_k\log N) for c_k = (6k}%DIFDELCMD < \lceil%%% (k-1)/2%DIFDELCMD < \rceil%%% )^{-1, which slightly improves their bound of c_k = (6k(k-1))^{-1} for k \geq 5 (and matching their c_3 and c_4).
Revised:  Let X_k be the number of k-term APs in \mathbb{Z/NZ}%DIFDELCMD < ]%%% _p. We show that a precise estimate on the large deviation rate \log\Pr[X_k \geq (1+\delta)EX_k] due to Bhattacharya, Ganguly, Shao and Zhao is valid if p \geq \omega(N^{-c_k\log N) for c_k = (6k}%DIFDELCMD < \lceil%%% (k-1)/2%DIFDELCMD < \rceil%%% , which slightly improves their bound of c_k = (6k(k-1))^{-1} for k \geq 5 (and matching their c_3 and c_4).
Edit intent: coherence
Original:  - } A set D\subseteq \mathbb{Z}/N\mathbb{Z} is \ell-intersective if every dense subset of \mathbb{Z}/N\mathbb{Z} contains a non-trivial (\ell+1) -term AP with common difference in D.
Revised:  - } A set D\subseteq \mathbb{Z}/N\mathbb{Z} is \ell-intersective if any dense subset of \mathbb{Z}/N\mathbb{Z} contains a non-trivial (\ell+1) -term AP with common difference in D.
Edit intent: clarity
Original:  We show that [\mathbb{Z}/N\mathbb{Z}]_p is \ell-intersective with probability 1 - o _N(1) provided p \geq \omega(N^{-\beta_\ell}\log N) for \beta_\ell = (\lceil(\ell+1)/2\rceil)^{-1} , improving the bound \beta_\ell =(\ell +1)^{-1\ge  due to Frantzikinakis, Lesigne and Wierdl for \ell \geq 2 and reproving more directly the same result shown recently by the authors and Dvir.
Revised:  We show that [\mathbb{Z}/N\mathbb{Z}]_p is \ell-intersective with probability 1 - o (1) provided p \geq \omega(N^{-\beta_\ell}\log N) for \beta_\ell = (\lceil(\ell+1)/2\rceil)^{-1} , improving the bound \beta_\ell =(\ell +1)^{-1\ge due to Frantzikinakis, Lesigne and Wierdl for \ell \geq 2 and reproving more directly the same result shown recently by the authors and Dvir.
Edit intent: clarity
Original:  We show that [\mathbb{Z}/N\mathbb{Z}]_p is \ell-intersective with probability 1 - o _N(1) provided p \geq \omega(N^{-\beta_\ell}\log N) for \beta_\ell = (\lceil(\ell+1)/2\rceil)^{-1} , improving the bound \beta_\ell =(\ell +1)^{-1\ge  due to Frantzikinakis, Lesigne and Wierdl for \ell \geq 2 and reproving more directly the same result shown recently by the authors and Dvir.
Revised:  We show that [\mathbb{Z}/N\mathbb{Z}]_p is \ell-intersective with probability 1 - o _N(1) provided p \geq \omega(N^{-\beta_\ell}\log N) for \beta_\ell = (\lceil(\ell+1)/2\rceil)^{-1} , improving the bound \beta_\ell =(\ell +1)^{-1\ge due to Frantzikinakis, Lesigne and Wierdl for \ell \geq 2 and reproving more directly the same improvement shown recently by the authors and Dvir.
Edit intent: clarity
Original: Motivated by problems on random differences in Szemer\'edi 's theorem and on large deviations for arithmetic progressions in random sets, we prove upper bounds on the Gaussian width of point sets that are formed by the image of the n-dimensional Boolean hypercube under a mapping \psi:R^n\toR^k, where each coordinate is a constant-degree multilinear polynomial with 0-1 coefficients.
Revised: Motivated by problems on random differences in Szemer\'{e 's theorem and on large deviations for arithmetic progressions in random sets, we prove upper bounds on the Gaussian width of point sets that are formed by the image of the n-dimensional Boolean hypercube under a mapping \psi:R^n\toR^k, where each coordinate is a constant-degree multilinear polynomial with 0-1 coefficients.
Edit intent: fluency
Original:  This gives a polynomial improvement for all \ell \ge 2 of a previous bound due to Frantzikinakis, Lesigne and Wierdl, and reproves more directly the same improvement shown recently by the authors and Dvir. - Let X_k be the number of k-term arithmetic progressions in [\mathbb{Z}/N\mathbb{Z}]_p and consider the large deviation rate \rho_k(\delta) = \log\Pr[X_k \geq (1+\delta)\mathbb{E}X_k].
Revised:  This gives a polynomial improvement for all \ell \ge 2 of a previous bound due to Frantzikinakis, Lesigne and Wierdl, and reproves more directly the same improvement shown recently by the authors and Dvir. \bullet Let X_k be the number of k-term arithmetic progressions in [\mathbb{Z}/N\mathbb{Z}]_p and consider the large deviation rate \rho_k(\delta) = \log\Pr[X_k \geq (1+\delta)\mathbb{E}X_k].
Edit intent: clarity
Original:  We also discuss connections with the above-mentioned error correcting codes (locally decodable codes) and the Banach-space notion of type for injective tensor products of \ell_p-spaces.
Revised:  We also discuss connections with error correcting codes (locally decodable codes) and the Banach-space notion of type for injective tensor products of \ell_p-spaces.
Edit intent: clarity
Original:  We introduce a novel unsupervised neural dynamic topic model known as Recurrent Neural Network-Replicated Softmax Model (RNNRSM), where the discovered topics at each time influence the topic discovery in the subsequent time steps.
Revised:  We introduce a novel unsupervised neural dynamic topic model named as Recurrent Neural Network-Replicated Softmax Model (RNNRSM), where the discovered topics at each time influence the topic discovery in the subsequent time steps.
Edit intent: fluency
Original:  Applying RNN-RSM to 19 years of articles on NLP research, we demonstrate that compared to state-of-the art topic models, RNN-RSM shows better generalization, topic interpretation, evolution and trends.
Revised:  Applying RNN-RSM to 19 years of articles on NLP research, we demonstrate that compared to state-of-the art topic models, RNNRSM shows better generalization, topic interpretation, evolution and trends.
Edit intent: fluency
Original: This paper presents a simple approach to forecasting conditional probability distributions of asset returns.
Revised: We present a simple approach to forecasting conditional probability distributions of asset returns.
Edit intent: clarity
Original:  We work with a parsimonious parametrization of ordered binary choice regression that quite precisely forecasts future conditional probability distributions of returns , using past indicator and past volatility proxy as predictors.
Revised:  We work with a parsimonious specification of ordered binary choice regression that quite precisely forecasts future conditional probability distributions of returns , using past indicator and past volatility proxy as predictors.
Edit intent: clarity
Original:  Direct benefits of the proposed model are revealed in the empirical application to 29 most liquid U.S. stocks.
Revised:  Direct benefits of the model are revealed in the empirical application to 29 most liquid U.S. stocks.
Edit intent: clarity
Original:  Direct benefits of the proposed model are revealed in the empirical application to 29 most liquid U.S. stocks.
Revised:  Direct benefits of the proposed model are revealed in an empirical application to 29 most liquid U.S. stocks.
Edit intent: fluency
Original:  Direct benefits of the model are revealed in an empirical application to  29 most liquid U.S. stocks.
Revised:  Direct benefits of the model are revealed in an empirical application to the 29 most liquid U.S. stocks.
Edit intent: fluency
Original:  This problem is different from the standard estimation of complexity of an algorithm computing the p-th roots of 1.
Revised:  This result is different from the standard estimation of complexity of an algorithm computing the p-th roots of 1.
Edit intent: clarity
Original:  Furthermore, this set of known V alleles is both incomplete (particularly for non-European samples), and contains a significant number of spurious alleles.
Revised:  Furthermore, the currently-accepted set of known V alleles is both incomplete (particularly for non-European samples), and contains a significant number of spurious alleles.
Edit intent: clarity
Original: In this paper, we propose a methodology for estimating the crowd speed using WiFi devices , and without relying on people to carry any device (passively) .
Revised: In this paper, we propose a methodology for estimating the crowd speed using WiFi devices without relying on people to carry any device (passively) .
Edit intent: coherence
Original: In this paper, we propose a methodology for estimating the crowd speed using WiFi devices , and without relying on people to carry any device (passively) .
Revised: In this paper, we propose a methodology for estimating the crowd speed using WiFi devices , and without relying on people to carry any device .
Edit intent: coherence
Original:  Our approach not only enables speed estimation in the region where WiFi links are, but also in the adjacent possibly WiFi-free regions where there may be no WiFi signal available .
Revised:  Our approach not only enables speed estimation in the region where WiFi links are, but also in the adjacent possibly WiFi-free regions .
Edit intent: clarity
Original:  We first prove how the cross-correlation and the probability of crossing of the two links implicitly carry key information about the pedestrian speeds and develop a mathematical model to relate them to pedestrian speeds.
Revised:  We first prove how the cross-correlation and the probability of crossing the two links implicitly carry key information about the pedestrian speeds and develop a mathematical model to relate them to pedestrian speeds.
Edit intent: clarity
Original:  We then validate our approach with 108 experiments, in both indoor and outdoor, where up to 10 people walk in two adjacent areas, with a variety of speeds per region, showing that our framework can accurately estimate these speeds with only a pair of WiFi links in one region.
Revised:  We then validate our approach with 108 experiments, in both indoor and outdoor, where up to 10 people walk in two adjacent areas, with variety of speeds per region, showing that our framework can accurately estimate these speeds with only a pair of WiFi links in one region.
Edit intent: fluency
Original:  Furthermore, the overall classification accuracy, when crowd speed is categorized as slow, normal, and fast, is 85\%.
Edit intent: coherence
Original:  Recent studies also propose to compute top-k important communities, where each reported community not only is a cohesive subgraph but also has a high importance value.
Revised:  Recent studies propose to compute top-k important communities, where each reported community not only is a cohesive subgraph but also has a high importance value.
Edit intent: clarity
Original:  Recent studies also propose to compute top-k important communities, where each reported community not only is a cohesive subgraph but also has a high importance value.
Revised:  Recent studies also propose to compute top-k influential communities, where each reported community not only is a cohesive subgraph but also has a high importance value.
Edit intent: clarity
Original:  Recent studies also propose to compute top-k important communities, where each reported community not only is a cohesive subgraph but also has a high importance value.
Revised:  Recent studies also propose to compute top-k important communities, where each reported community not only is a cohesive subgraph but also has a high influence value.
Edit intent: clarity
Original:  The existing approaches to the problem of importance-based top-k community search are either index- based algorithms or online search algorithms without indexes.
Revised:  The existing approaches to the problem of top-k community search are either index- based algorithms or online search algorithms without indexes.
Edit intent: clarity
Original:  The existing approaches to the problem of importance-based top-k community search are either index- based algorithms or online search algorithms without indexes.
Revised:  The existing approaches to the problem of importance-based top-k influential community search can be categorized as index-based algorithms and online search algorithms without indexes.
Edit intent: clarity
Original:  As the index-based algorithms  need to pre-compute a special- purpose index and can only work for one built-in vertex weight vector , in this paper we study the online search approach.
Revised:  The index-based algorithms need to pre-compute a special- purpose index and can only work for one built-in vertex weight vector , in this paper we study the online search approach.
Edit intent: fluency
Original:  As the index-based algorithms  need to pre-compute a special- purpose index and can only work for one built-in vertex weight vector , in this paper we study the online search approach.
Revised:  As the index-based algorithms need to pre-compute a special-purpose index and only work for one built-in vertex weight vector , in this paper we study the online search approach.
Edit intent: clarity
Original:  Finally, we also extend our techniques to the general case of importance-based top-k community search regard- ing other cohesiveness measures.
Revised:  Finally, we also extend our techniques to the general case of top-k community search regard- ing other cohesiveness measures.
Edit intent: coherence
Original:  Finally, we also extend our techniques to the general case of importance-based top-k community search regard- ing other cohesiveness measures.
Revised:  Finally, we also extend our techniques to the general case of importance-based top-k influential community search regarding other cohesiveness measures.
Edit intent: clarity
Original: Goal-conditional policies allow reinforcement learning agents to pursue specific goals during different episodes .
Revised: A reinforcement learning agent that needs to pursue different goals across episodes requires a goal-conditional policy .
Edit intent: clarity
Original:  In addition to their potential to generalize desired behavior to unseen goals, such policies may also help in defining options for arbitrary subgoals, enabling higher-level planning .
Revised:  In addition to their potential to generalize desirable behavior to unseen goals, such policies may also help in defining options for arbitrary subgoals, enabling higher-level planning .
Edit intent: fluency
Original:  In addition to their potential to generalize desired behavior to unseen goals, such policies may also help in defining options for arbitrary subgoals, enabling higher-level planning .
Revised:  In addition to their potential to generalize desired behavior to unseen goals, such policies may also enable higher-level planning .
Edit intent: clarity
Original:  Reinforcement learning agents have only recently been endowed with such capacity for hindsight , which is highly valuable in environments with sparse rewards .
Revised:  Reinforcement learning agents have only recently been endowed with such capacity for hindsight .
Edit intent: clarity