wanyu/IteraTeR_full_sent huggingface dataset:
Original:  For a source vertex set S\subseteq V in a digraph G(V,E), an S-source-wise round-trip spanner of G of stretch k is a subgraph H of G such that for every u\in S ,v\in V, the round-trip distance between u and v in H is at most k times of the original distance in G. We show that , for a digraph G(V,E)
Revised:  For a source vertex set S\subseteq V in a graph G(V,E), an S-source-wise round-trip spanner of G of stretch k is a subgraph H of G such that for every u\in S ,v\in V, the round-trip distance between u and v in H is at most k times of the original distance in G. We show that , for a digraph G(V,E)
Edit intent: clarity
Original:  For a source vertex set S\subseteq V in a digraph G(V,E), an S-source-wise round-trip spanner of G of stretch k is a subgraph H of G such that for every u\in S ,v\in V, the round-trip distance between u and v in H is at most k times of the original distance in G. We show that , for a digraph G(V,E)
Revised:  For a source vertex set S\subseteq V in a digraph G(V,E), an S-sourcewise round-trip spanner of G of stretch k is a subgraph H of G such that for every u\in S ,v\in V, the round-trip distance between u and v in H is at most k times of the original distance in G. We show that , for a digraph G(V,E)
Edit intent: fluency
Original:  For a source vertex set S\subseteq V in a digraph G(V,E), an S-source-wise round-trip spanner of G of stretch k is a subgraph H of G such that for every u\in S ,v\in V, the round-trip distance between u and v in H is at most k times of the original distance in G. We show that , for a digraph G(V,E)
Revised:  For a source vertex set S\subseteq V in a digraph G(V,E), an S-source-wise round-trip spanner of G of stretch k is a subgraph H of G such that for every pair of vertices u ,v\in V, the round-trip distance between u and v in H is at most k times of the original distance in G. We show that , for a digraph G(V,E)
Edit intent: clarity
Original:  For a source vertex set S\subseteq V in a digraph G(V,E), an S-source-wise round-trip spanner of G of stretch k is a subgraph H of G such that for every u\in S ,v\in V, the round-trip distance between u and v in H is at most k times of the original distance in G. We show that , for a digraph G(V,E)
Revised:  For a source vertex set S\subseteq V in a digraph G(V,E), an S-source-wise round-trip spanner of G of stretch k is a subgraph H of G such that for every u\in S ,v\in S\times V, their round-trip distance between u and v in H is at most k times of the original distance in G. We show that , for a digraph G(V,E)
Edit intent: clarity
Original:  For a source vertex set S\subseteq V in a digraph G(V,E), an S-source-wise round-trip spanner of G of stretch k is a subgraph H of G such that for every u\in S ,v\in V, the round-trip distance between u and v in H is at most k times of the original distance in G. We show that , for a digraph G(V,E)
Revised:  For a source vertex set S\subseteq V in a digraph G(V,E), an S-source-wise round-trip spanner of G of stretch k is a subgraph H of G such that for every u\in S ,v\in V, the round-trip distance in H is at most k times of the original distance in G. We show that , for a digraph G(V,E)
Edit intent: clarity
Original:  For a source vertex set S\subseteq V in a digraph G(V,E), an S-source-wise round-trip spanner of G of stretch k is a subgraph H of G such that for every u\in S ,v\in V, the round-trip distance between u and v in H is at most k times of the original distance in G. We show that , for a digraph G(V,E)
Revised:  For a source vertex set S\subseteq V in a digraph G(V,E), an S-source-wise round-trip spanner of G of stretch k is a subgraph H of G such that for every u\in S ,v\in V, the round-trip distance between u and v in H is at most k times of their round-trip distance in G. We show that , for a digraph G(V,E)
Edit intent: clarity
Original:  For a source vertex set S\subseteq V in a digraph G(V,E), an S-source-wise round-trip spanner of G of stretch k is a subgraph H of G such that for every u\in S ,v\in V, the round-trip distance between u and v in H is at most k times of the original distance in G. We show that , for a digraph G(V,E)
Revised:  For a source vertex set S\subseteq V in a digraph G(V,E), an S-source-wise round-trip spanner of G of stretch k is a subgraph H of G such that for every u\in S ,v\in V, the round-trip distance between u and v in H is at most k times of the original distance in G. We show that for a graph G(V,E)
Edit intent: clarity
Original:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt}%DIFAUXCMD , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Revised:  with n vertices and m edges , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt}%DIFAUXCMD , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Edit intent: clarity
Original:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt}%DIFAUXCMD , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Revised:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and an integer k>1 , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt}%DIFAUXCMD , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Edit intent: clarity
Original:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt}%DIFAUXCMD , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Revised:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm that in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt}%DIFAUXCMD , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Edit intent: fluency
Original:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt}%DIFAUXCMD , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Revised:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) constructs an S-sourcewise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt}%DIFAUXCMD , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Edit intent: coherence
Original:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt}%DIFAUXCMD , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Revised:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt}%DIFAUXCMD , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Edit intent: fluency
Original:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) . Compared with the state of the art}\hspace{0pt}%DIFAUXCMD , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Revised:  with n vertices , m edgesand nonnegative edge weights , an s-sized source vertex set S\subseteq V and a positive integer k , there exists an algorithm , in time O(ms^{1/k}\log^5n) , with high probability constructing an S-source-wise round-trip spanner of stretch O(k\log n) and size O(ns^{1/k}\log^2n) edges with high probability. Compared to the fast algorithms for constructing all-pairs round-trip spanners \mbox{%DIFAUXCMD \cite{PRS+18,CLR+20}\hspace{0pt}%DIFAUXCMD , our algorithm improve the running time and the number of edges in the spanner when k is super-constant.
Edit intent: meaning-changed
Original:  Compared with the existing algorithm } for constructing source-wise round-trip spanners }\hspace{0pt}%DIFAUXCMD } , our algorithm significantly improves their construction time \Omega(\min\{ms,n^\omega\})
Revised:  Compared with the existing algorithm } for constructing source-wise round-trip spanners \mbox{%DIFAUXCMD \cite{ZL17}\hspace{0pt}%DIFAUXCMD } , our algorithm significantly improves their construction time \Omega(\min\{ms,n^\omega\})
Edit intent: meaning-changed
Original:  (where \omega \in [2,2.373) and 2.373 is the matrix multiplication exponent) to nearly linear O(ms^{1/k}\log^5n), while still keeping a spanner stretch O(k \log n) and size O(ns^{1/k\log^2n), asymptotically similar to their stretch 2k+\epsilon and size O((k^2/\epsilon)ns^{1/k}\log(nw)), respectively}  }\hspace{0pt}%DIFAUXCMD can be adapted to the source-wise setting} .
Revised:  (where \omega \in [2,2.373) and 2.373 is the matrix multiplication exponent) to nearly linear O(ms^{1/k}\log^5n), at the expense of paying an extra O( \log n) and size O(ns^{1/k\log^2n), asymptotically similar to their stretch 2k+\epsilon and size O((k^2/\epsilon)ns^{1/k}\log(nw)), respectively} }\hspace{0pt}%DIFAUXCMD can be adapted to the source-wise setting} .
Edit intent: clarity
Original:  (where \omega \in [2,2.373) and 2.373 is the matrix multiplication exponent) to nearly linear O(ms^{1/k}\log^5n), while still keeping a spanner stretch O(k \log n) and size O(ns^{1/k\log^2n), asymptotically similar to their stretch 2k+\epsilon and size O((k^2/\epsilon)ns^{1/k}\log(nw)), respectively}  }\hspace{0pt}%DIFAUXCMD can be adapted to the source-wise setting} .
Revised:  (where \omega \in [2,2.373) and 2.373 is the matrix multiplication exponent) to nearly linear O(ms^{1/k}\log^5n), while still keeping a spanner stretch O(k \log n) \log^2n), asymptotically similar to their stretch 2k+\epsilon and size O((k^2/\epsilon)ns^{1/k}\log(nw)), respectively} }\hspace{0pt}%DIFAUXCMD can be adapted to the source-wise setting} .
Edit intent: fluency
Original:  (where \omega \in [2,2.373) and 2.373 is the matrix multiplication exponent) to nearly linear O(ms^{1/k}\log^5n), while still keeping a spanner stretch O(k \log n) and size O(ns^{1/k\log^2n), asymptotically similar to their stretch 2k+\epsilon and size O((k^2/\epsilon)ns^{1/k}\log(nw)), respectively}  }\hspace{0pt}%DIFAUXCMD can be adapted to the source-wise setting} .
Revised:  (where \omega \in [2,2.373) and 2.373 is the matrix multiplication exponent) to nearly linear O(ms^{1/k}\log^5n), while still keeping a spanner stretch O(k \log n) and size O(ns^{1/k\log^2n), asymptotically similar to their stretch 2k+\epsilon and size O((k^2/\epsilon)ns^{1/k}\log(nw)), respectively} in the stretch. As an important building block of the algorithm, we develop a graph partitioning algorithm to partition G into clusters of bounded radius and prove that for every u,v\in S\times V at small round-trip distance, the probability of separating them in different clusters is small. The algorithm takes the size of S as input and does not need the knowledge of S. With the algorithm and a reachability vertex size estimation algorithm, we show that the recursive algorithm for constructing standard round-trip spanners \mbox{%DIFAUXCMD \cite{PRS+18 }\hspace{0pt}%DIFAUXCMD can be adapted to the source-wise setting} .
Edit intent: meaning-changed
Original: In this paper, we present ArCOV-19 , an Arabic COVID-19 Twitter dataset that covers the period from 27^{th of January till 31^{st of March 2020.
Revised: In this paper, we present ArCOV-19 , an Arabic COVID-19 Twitter dataset that covers the period from 27^{th of January till 31^{st of March 2020.
Edit intent: fluency
Original: In this paper, we present ArCOV-19 , an Arabic COVID-19 Twitter dataset that covers the period from 27^{th of January till 31^{st of March 2020.
Revised: In this paper, we present ArCOV-19 , an Arabic COVID-19 Twitter dataset that covers the period from 27th of January till 31^{st of March 2020.
Edit intent: fluency
Original: In this paper, we present ArCOV-19 , an Arabic COVID-19 Twitter dataset that covers the period from 27^{th of January till 31^{st of March 2020.
Revised: In this paper, we present ArCOV-19 , an Arabic COVID-19 Twitter dataset that covers the period from 27^{th of January till 31st of March 2020.
Edit intent: fluency
Original:  ArCOV-19 is the first publicly-available Arabic Twitter dataset covering COVID-19 pandemic that includes around 748k popular tweets (according to Twitter search criterion) alongside the propagation networks of the most-popular subset of them.
Revised:  ArCOV-19 is the first publicly-available Arabic Twitter dataset covering COVID-19 pandemic that includes around 748k popular tweets (according to Twitter search criterion) alongside the propagation networks of the most-popular subset of them.
Edit intent: fluency
Original:  ArCOV-19 is the first publicly-available Arabic Twitter dataset covering COVID-19 pandemic that includes around 748k popular tweets (according to Twitter search criterion) alongside the propagation networks of the most-popular subset of them  .
Revised:  ArCOV-19 is the first publicly-available Arabic Twitter dataset covering COVID-19 pandemic that includes over 1M tweets alongside the propagation networks of the most-popular subset of them .
Edit intent: meaning-changed
Original:  ArCOV-19 is the first publicly-available Arabic Twitter dataset covering COVID-19 pandemic that includes around 748k popular tweets (according to Twitter search criterion) alongside the propagation networks of the most-popular subset of them  .
Revised:  ArCOV-19 is the first publicly-available Arabic Twitter dataset covering COVID-19 pandemic that includes around 748k popular tweets (according to Twitter search criterion) alongside the propagation networks of the most-popular subset of them (i.e., most-retweeted and -liked) .
Edit intent: meaning-changed
Original:  ArCOV-19 is the first publicly-available Arabic Twitter dataset covering COVID-19 pandemic that includes over 1M tweets alongside the propagation networks of the most-popular subset of them (i.e., most-retweeted and -liked).
Revised:  ArCOV-19 is the first publicly-available Arabic Twitter dataset covering COVID-19 pandemic that includes about 2.7M tweets alongside the propagation networks of the most-popular subset of them (i.e., most-retweeted and -liked).
Edit intent: meaning-changed
Original:  ArCOV-19 is designed to enable research under several domains including natural language processing, information retrieval, and social computing , among others . Preliminary analysis shows that ArCOV-19 captures rising discussions associated with the first reported cases of the disease as they appeared in the Arab world.
Revised:  ArCOV-19 is designed to enable research under several domains including natural language processing, information retrieval, and social computing . Preliminary analysis shows that ArCOV-19 captures rising discussions associated with the first reported cases of the disease as they appeared in the Arab world.
Edit intent: clarity
Original: In this paper, we explore some stylized facts in the Bitcoin market using the BTC-USD exchange rate time series of historical intraday data from 2013 to 2018. Despite Bitcoin presents some very peculiar idiosyncrasies, like the absence of macroeconomic fundamentals or connections with underlying asset or benchmark, a clear asymmetry between demand and supply and the presence of inefficiency in the form of very strong arbitrage opportunity  , all these elements seem to be marginal in the definition of the structural statistical properties of this virtual financial asset, which result to be analogous to general individual stocks or indices.
Revised: In this paper, we explore some stylized facts in the Bitcoin market using the BTC-USD exchange rate time series of historical intraday data from 2013 to 2020. Bitcoin presents some very peculiar idiosyncrasies, like the absence of macroeconomic fundamentals or connections with underlying asset or benchmark, a clear asymmetry between demand and supply and the presence of inefficiency in the form of very strong arbitrage opportunity , all these elements seem to be marginal in the definition of the structural statistical properties of this virtual financial asset, which result to be analogous to general individual stocks or indices.
Edit intent: meaning-changed
Original:  Despite Bitcoin presents some very peculiar idiosyncrasies, like the absence of macroeconomic fundamentals or connections with underlying asset or benchmark, a clear asymmetry between demand and supply and the presence of inefficiency in the form of very strong arbitrage opportunity  , all these elements seem to be marginal in the definition of the structural statistical properties of this virtual financial asset, which result to be analogous to general individual stocks or indices.
Revised:  Despite Bitcoin presents some very peculiar idiosyncrasies, like the absence of macroeconomic fundamentals or connections with underlying assets or benchmarks, an asymmetry between demand and supply and the presence of inefficiency in the form of very strong arbitrage opportunity , all these elements seem to be marginal in the definition of the structural statistical properties of this virtual financial asset, which result to be analogous to general individual stocks or indices.
Edit intent: clarity
Original:  Despite Bitcoin presents some very peculiar idiosyncrasies, like the absence of macroeconomic fundamentals or connections with underlying asset or benchmark, a clear asymmetry between demand and supply and the presence of inefficiency in the form of very strong arbitrage opportunity  , all these elements seem to be marginal in the definition of the structural statistical properties of this virtual financial asset, which result to be analogous to general individual stocks or indices.
Revised:  Despite Bitcoin presents some very peculiar idiosyncrasies, like the absence of macroeconomic fundamentals or connections with underlying asset or benchmark, a clear asymmetry between demand and supply and the presence of inefficiency in the form of strong arbitrage opportunity , all these elements seem to be marginal in the definition of the structural statistical properties of this virtual financial asset, which result to be analogous to general individual stocks or indices.
Edit intent: fluency
Original:  Despite Bitcoin presents some very peculiar idiosyncrasies, like the absence of macroeconomic fundamentals or connections with underlying asset or benchmark, a clear asymmetry between demand and supply and the presence of inefficiency in the form of very strong arbitrage opportunity  , all these elements seem to be marginal in the definition of the structural statistical properties of this virtual financial asset, which result to be analogous to general individual stocks or indices.
Revised:  Despite Bitcoin presents some very peculiar idiosyncrasies, like the absence of macroeconomic fundamentals or connections with underlying asset or benchmark, a clear asymmetry between demand and supply and the presence of inefficiency in the form of very strong arbitrage opportunity . Nevertheless , all these elements seem to be marginal in the definition of the structural statistical properties of this virtual financial asset, which result to be analogous to general individual stocks or indices.
Edit intent: coherence
Original:  The second, imposes independent delays on the time labels of every edge of the graph. cWe provide a thorough investigation of the computational complexity of different objectives related to reachability sets when these operations are used.
Revised:  The second, imposes independent delays on the time labels of every edge of the graph. We provide a thorough investigation of the computational complexity of different objectives related to reachability sets when these operations are used.
Edit intent: fluency
Original:  One of the finding is that the aggressive imposing the most significant measures followed by equally aggressive reducing them when the spread diminishes is likely to result in the periodicity of the epidemic; we use Bessel functions. Under such management, the epidemic ends relatively quickly due to the periodicity, but then it may resume.
Revised:  One of the finding is that the aggressive imposing the most significant measures followed by equally aggressive reducing them when the spread diminishes will effectively reduce the number of new infections to zero. We use the asymptotic periodicity of Bessel functions, which readily provides the required; but the epidemic may resume.
Edit intent: meaning-changed
Original:  One of the finding is that the aggressive imposing the most significant measures followed by equally aggressive reducing them when the spread diminishes will effectively reduce the number of new infections to zero . We use the asymptotic periodicity of Bessel functions , which readily provides the required;
Revised:  One of the finding is that the aggressive imposing the most significant measures followed by equally aggressive reducing them when the spread diminishes will effectively reduce the number of new infections to zero ; we use the theory of Bessel functions , which readily provides the required;
Edit intent: clarity
Original:  We use the asymptotic periodicity of Bessel functions , which readily provides the required; but the epidemic may resume . Practically: the hesitation before enabling some protection measures must be at least doubled before disabling them.
Revised:  We use the asymptotic periodicity of Bessel functions . Epidemics may resume after such saturation . Practically: the hesitation before enabling some protection measures must be at least doubled before disabling them.
Edit intent: clarity