wanyu/IteraTeR_v2 huggingface dataset:
Original:  The paper further sheds light on the challenges that need to be addressed for realizing practical cloud-enabled HAPS, mainly, those related to the high energy, processing power, quality of service (QoS), and security considerations.
Revised:  The paper further sheds light on the challenges that need to be addressed for realizing practical cloud-enabled HAPS, mainly, those related to high energy, processing power, quality of service (QoS), and security considerations.
Edit intent: fluency
Original: The (unweighted) tree edit distance problem for n node trees asks to compute a measure of dissimilarity between two rooted trees with node labels.
Revised: The (unweighted) tree edit distance problem for n node trees asks to compute a measure of dissimilarity between two rooted trees with node labels.
Edit intent: fluency
Original:  The same paper also showed that O(n ^ 3) is the best possible running time for any algorithm using the so-called decomposition strategy , which underlies almost all the known algorithms for this problem.
Revised:  The same paper also showed that O(n ^ 3) is the best possible running time for any algorithm using the so-called decomposition strategy , which underlies almost all the known algorithms for this problem.
Edit intent: fluency
Original:  In this paper, we break the cubic barrier by showing an O(n ^ {2.9546}) time algorithm for the unweighted tree edit distance problem.
Revised:  In this paper, we break the cubic barrier by showing an O(n ^ {2.9546}) time algorithm for the unweighted tree edit distance problem.
Edit intent: fluency
Original:  It is known that a satisfying assignment exists with high probability at clause density m/n < 2^k \log 2 - 1{2} (\log 2 + 1) + o_k(1), while the best polynomial-time algorithm known, the Fix algorithm of Coja-Oghlan, finds a satisfying assignment at the much lower clause density (1 - o_k(1)) 2^k \log k / k. This prompts the question: is it possible to efficiently find a satisfying assignment at higher clause densities?
Revised:  It is known that satisfying assignments exist with high probability at clause density m/n < 2^k \log 2 - 1{2} (\log 2 + 1) + o_k(1), while the best polynomial-time algorithm known, the Fix algorithm of Coja-Oghlan, finds a satisfying assignment at the much lower clause density (1 - o_k(1)) 2^k \log k / k. This prompts the question: is it possible to efficiently find a satisfying assignment at higher clause densities?
Edit intent: fluency
Original:  It is known that a satisfying assignment exists with high probability at clause density m/n < 2^k \log 2 - 1{2} (\log 2 + 1) + o_k(1), while the best polynomial-time algorithm known, the Fix algorithm of Coja-Oghlan, finds a satisfying assignment at the much lower clause density (1 - o_k(1)) 2^k \log k / k. This prompts the question: is it possible to efficiently find a satisfying assignment at higher clause densities?
Revised:  It is known that a satisfying assignment exists with high probability up to clause density m/n < 2^k \log 2 - 1{2} (\log 2 + 1) + o_k(1), while the best polynomial-time algorithm known, the Fix algorithm of Coja-Oghlan, finds a satisfying assignment at the much lower clause density (1 - o_k(1)) 2^k \log k / k. This prompts the question: is it possible to efficiently find a satisfying assignment at higher clause densities?
Edit intent: clarity
Original:  It is known that a satisfying assignment exists with high probability at clause density m/n < 2^k \log 2 - 1{2} (\log 2 + 1) + o_k(1), while the best polynomial-time algorithm known, the Fix algorithm of Coja-Oghlan, finds a satisfying assignment at the much lower clause density (1 - o_k(1)) 2^k \log k / k. This prompts the question: is it possible to efficiently find a satisfying assignment at higher clause densities?
Revised:  It is known that a satisfying assignment exists with high probability at clause density m/n = 2^k \log 2 - 1{2} (\log 2 + 1) + o_k(1), while the best polynomial-time algorithm known, the Fix algorithm of Coja-Oghlan, finds a satisfying assignment at the much lower clause density (1 - o_k(1)) 2^k \log k / k. This prompts the question: is it possible to efficiently find a satisfying assignment at higher clause densities?
Edit intent: clarity
Original:  We show that low degree polynomial algorithms can find a satisfying assignment at clause density (1 - o_k(1)) 2^k \log k / k, matching Fix, and not at clause density (1 + o_k(1)) \kappa^* 2^k \log k / k , where \kappa^* \approx 4.911.
Revised:  We show that low degree polynomial algorithms cannot find a satisfying assignment at clause density (1 - o_k(1)) 2^k \log k / k, matching Fix, and not at clause density (1 + o_k(1)) \kappa^* 2^k \log k / k , where \kappa^* \approx 4.911.
Edit intent: clarity
Original:  We show that low degree polynomial algorithms can find a satisfying assignment at clause density (1 - o_k(1)) 2^k \log k / k, matching Fix, and not at clause density (1 + o_k(1)) \kappa^* 2^k \log k / k , where \kappa^* \approx 4.911.
Revised:  We show that low degree polynomial algorithms can find a satisfying assignment at clause density (1 - o_k(1)) 2^k \log k / k, matching Fix, and not at clause density (1 + o_k(1)) \kappa^* 2^k \log k / k for a universal constant \kappa^* \approx 4.911.
Edit intent: clarity
Original: Mobility-as-a-Service (MaaS) is emerging mobility trend driven by the concept of "Everything-as-a-Service" and enabled through mobile internet technologies.
Revised: Mobility-as-a-Service (MaaS) is an emerging business model driven by the concept of "Everything-as-a-Service" and enabled through mobile internet technologies.
Edit intent: clarity
Original:  We consider a double-auction mechanism where travelers submit purchase-bids to accommodate their travel demand via MaaS  , and TSPs submit sell-bids to supply mobility resources for the MaaS platform in exchange for payments.
Revised:  We consider a double-auction mechanism where travelers submit purchase-bids to accommodate their travel demand via MaaS platform , and TSPs submit sell-bids to supply mobility resources for the MaaS platform in exchange for payments.
Edit intent: fluency
Original:  The MaaS regulator makes the operating decisions to maximize its profits  .
Revised:  The MaaS regulator aims to maximize its profits .
Edit intent: clarity
Original:  TSPs) decide the participation levels of joining the MaaS platform to minimize their travel costs (resp. maximize their profits).
Revised:  TSPs) adjust their participation level in the MaaS platform to minimize their travel costs (resp. maximize their profits).
Edit intent: clarity
Original:  We propose customized branch-and-bound algorithms based on strong duality reformulations to solve the SLMFGs.
Revised:  We propose customized branch-and-bound algorithms based on strong duality reformulations to solve these SLMFGs.
Edit intent: fluency
Original:  Extensive numerical experiments conducted on large scale simulation instances generated from realistic mobility data highlight that the performance of the proposed algorithms is significantly superior to a benchmarking approach  and provide meaningful  insights for the regulation of two-sided MaaS markets  .
Revised:  Extensive numerical experiments conducted on large scale simulation instances generated from realistic mobility data highlight that the performance of the proposed algorithms is significantly superior to a benchmarking approach , and provide meaningful insights for the regulation of two-sided MaaS markets .
Edit intent: fluency
Original:  Extensive numerical experiments conducted on large scale simulation instances generated from realistic mobility data highlight that the performance of the proposed algorithms is significantly superior to a benchmarking approach  and provide meaningful  insights for the regulation of two-sided MaaS markets  .
Revised:  Extensive numerical experiments conducted on large scale simulation instances generated from realistic mobility data highlight that the performance of the proposed algorithms is significantly superior to a benchmarking approach and provide meaningful managerial insights for the regulation of two-sided MaaS markets .
Edit intent: clarity
Original:  Extensive numerical experiments conducted on large scale simulation instances generated from realistic mobility data highlight that the performance of the proposed algorithms is significantly superior to a benchmarking approach  and provide meaningful  insights for the regulation of two-sided MaaS markets  .
Revised:  Extensive numerical experiments conducted on large scale simulation instances generated from realistic mobility data highlight that the performance of the proposed algorithms is significantly superior to a benchmarking approach and provide meaningful insights for the regulation of two-sided MaaS markets in practice .
Edit intent: clarity
Original:  Robustness here means that the method is proved to be invariant domain preserving under the hyperbolic CFL time step restriction, and it produces results that are reproducible and that can be shown to be accurate on challenging 2D and 3D realistic benchmarks.
Revised:  Robustness here means that the method is proved to be invariant domain preserving under the hyperbolic CFL time step restriction, and the method delivers results that are reproducible and that can be shown to be accurate on challenging 2D and 3D realistic benchmarks.
Edit intent: clarity
Original:  In particular, we provide probabilistic algorithms for fuzzy clustering in this setting that asks O(poly(k)\log n) similarity queries and run with polynomial-time-complexity, where n is the number of items.
Revised:  In particular, we provide algorithms for fuzzy clustering in this setting that asks O(poly(k)\log n) similarity queries and run with polynomial-time-complexity, where n is the number of items.
Edit intent: clarity
Original:  The ubiquitous Lloyd-type algorithms (or , expectation-maximization algorithm ) can get stuck at a local minima .
Revised:  The ubiquitous Lloyd-type algorithms (or , expectation-maximization algorithm ) can get stuck at a local minimum .
Edit intent: fluency
Original:  Our results show that by making  few similarity queries, the problem becomes easier to solve.
Revised:  Our results show that by making a few similarity queries, the problem becomes easier to solve.
Edit intent: fluency
Original:  In the previous paper we characterized those m between the maximum size%DIFDELCMD < n{\lfloor n/2 \rfloor} %%% and n{\lceil n/2\rceil}-\lceil n/2\rceil^2 n{\lceil n/2 \rceil} that are not sizes of maximal antichains.
Revised:  In the previous paper we characterized those m between %DIFDELCMD < n{\lfloor n/2 \rfloor} %%% and n{\lceil n/2\rceil}-\lceil n/2\rceil^2 n{\lceil n/2 \rceil} that are not sizes of maximal antichains.
Edit intent: clarity
Original:  In the previous paper we characterized those m between the maximum size%DIFDELCMD < n{\lfloor n/2 \rfloor} %%% and n{\lceil n/2\rceil}-\lceil n/2\rceil^2 n{\lceil n/2 \rceil} that are not sizes of maximal antichains.
Revised:  In the previous paper we characterized those m between the maximum size%DIFDELCMD < n{\lfloor n/2 \rfloor} %%% n{\lceil n/2\rceil}-\lceil n/2\rceil^2 n{\lceil n/2 \rceil} that are not sizes of maximal antichains.
Edit intent: coherence
Original:  We demonstrate AWARE  on the novel task of predicting whether a gene is associated with a disease and where it most likely manifests in the human body.
Revised:  We demonstrate AWARE on the novel task of predicting whether a gene is associated with a disease and where that association most likely manifests in the human body.
Edit intent: clarity
Original:  To achieve this, we employ a new approach based on a general fixed point theorem, originally proven by Volovikov (1996), and recently applied by Joji\'{c}, Panina, and \v{Z ivaljevi\'{c} (2020) to the envy-free division problem of a cake.
Revised:  To achieve this, we employ a new approach based on a general fixed point theorem, originally proven by Volovikov (1996), and recently applied by Joji\'{c}, Panina, and \v{Z ivaljevi\'{c} (2020) to the envy-free division problem of a cake.
Edit intent: fluency
Original:  We consider a reconstruction of ferromagnetic Ising models on Erdos-R\'enyi random graphs by direct coupling analysis (DCA)--a highly successful , global statistical approach to modeling amino acid sequence data.
Revised:  To this end, we characterize the efficacy of direct coupling analysis (DCA)--a highly successful , global statistical approach to modeling amino acid sequence data.
Edit intent: clarity
Original:  We consider a reconstruction of ferromagnetic Ising models on Erdos-R\'enyi random graphs by direct coupling analysis (DCA)--a highly successful , global statistical approach to modeling amino acid sequence data.
Revised:  We consider a reconstruction of ferromagnetic Ising models on Erdos-R\'enyi random graphs by direct coupling analysis (DCA)--a highly successful method for analyzing amino acid sequence data.
Edit intent: clarity
Original:  Our work offers an insight into the regime in which DCA operates so successfully and more broadly how inference interacts with the nature of data-generating distributions .
Revised:  Our work offers an insight into the regime in which DCA operates so successfully and more broadly how inference interacts with data structure .
Edit intent: clarity
Original:  Interestingly, the geometric median can also be viewed as the equilibrium of a process where each vector of the tuple pulls on a common decision point with a unitary force towards them, promoting the "one voter, one unit force" fairness principle.
Revised:  Interestingly, the "one voter, one unit force" fairness principle.
Edit intent: coherence
Original:  In this paper, we analyze the strategyproofness of the geometric median as a voting system.
Revised:  However, what was not known is the extent to which the geometric median as a voting system.
Edit intent: coherence
Original:  Assuming that voters want to minimize the Euclidean distance between their preferred vector and the outcome of the vote, we first prove that , in the general case, the geometric median is not even \alpha-strategyproof .
Revised:  Assuming that voters want to minimize the Euclidean distance between their preferred vector ? We prove in this paper that, perhaps surprisingly , in the general case, the geometric median is not even \alpha-strategyproof .
Edit intent: clarity
Original:  Assuming that voters want to minimize the Euclidean distance between their preferred vector and the outcome of the vote, we first prove that , in the general case, the geometric median is not even \alpha-strategyproof .
Revised:  Assuming that voters want to minimize the Euclidean distance between their preferred vector and the outcome of the vote, we first prove that , the geometric median is not even \alpha-strategyproof .
Edit intent: clarity
Original:  However , in the limit of a large number of voters , assuming that voters' preferred vectors are drawn i.i.d. from a distribution of preferred vectors, we also prove that the geometric median is asymptotically \alpha-strategyproof.
Revised:  However , in the limit of a large number of voters with i.i.d. from a distribution of preferred vectors, we also prove that the geometric median is asymptotically \alpha-strategyproof.
Edit intent: clarity
Original:  However , in the limit of a large number of voters , assuming that voters' preferred vectors are drawn i.i.d. from a distribution of preferred vectors, we also prove that the geometric median is asymptotically \alpha-strategyproof.
Revised:  However , in the limit of a large number of voters , assuming that voters' preferred vectors are drawn i.i.d. preferred vectors, we also prove that the geometric median is asymptotically \alpha-strategyproof.
Edit intent: clarity
Original:  However , in the limit of a large number of voters , assuming that voters' preferred vectors are drawn i.i.d. from a distribution of preferred vectors, we also prove that the geometric median is asymptotically \alpha-strategyproof.
Revised:  However , in the limit of a large number of voters , assuming that voters' preferred vectors are drawn i.i.d. from a distribution of preferred vectors, the geometric median is asymptotically \alpha-strategyproof.
Edit intent: coherence
Original:  The bound \alpha describes what a voter can gain (at most) by deviating from truthfulness.
Edit intent: coherence
Original:  We then generalize our results to the case where each voter actually cares more about some dimensions rather than others . Roughly, we show that, if some dimensions are more polarized and regarded as more important, then the geometric median becomes less strategyproof.
Revised:  We then generalize our results to voters who care more about some dimensions rather than others . Roughly, we show that, if some dimensions are more polarized and regarded as more important, then the geometric median becomes less strategyproof.
Edit intent: clarity
Original:  We then generalize our results to the case where each voter actually cares more about some dimensions rather than others . Roughly, we show that, if some dimensions are more polarized and regarded as more important, then the geometric median becomes less strategyproof.
Revised:  We then generalize our results to the case where each voter actually cares more about some dimensions . Roughly, we show that, if some dimensions are more polarized and regarded as more important, then the geometric median becomes less strategyproof.
Edit intent: clarity
Original:  Interestingly, we also show how the skewed geometric medians can be used to improve strategyproofness.
Revised:  Interestingly, we also show how the skewed geometric medians can improve strategyproofness.
Edit intent: coherence
Original:  Nevertheless, if voters care differently about different dimensions, we prove that no skewed geometric median can achieve strategyproofness for all of them .
Revised:  Nevertheless, if voters care differently about different dimensions, we prove that no skewed geometric median can achieve strategyproofness for all .
Edit intent: coherence
Original:  Overall, our results provide insight into the extent to which the (skewed) geometric median is a suitable approach to aggregate high-dimensional disagreements.
Revised:  Overall, our results constitute a coherent set of insights into the extent to which the (skewed) geometric median is a suitable approach to aggregate high-dimensional disagreements.
Edit intent: clarity
Original:  Overall, our results provide insight into the extent to which the (skewed) geometric median is a suitable approach to aggregate high-dimensional disagreements.
Revised:  Overall, our results provide insight into the extent to which the geometric median is a suitable approach to aggregate high-dimensional disagreements.
Edit intent: clarity
Original:  Overall, our results provide insight into the extent to which the (skewed) geometric median is a suitable approach to aggregate high-dimensional disagreements.
Revised:  Overall, our results provide insight into the extent to which the (skewed) geometric median is suitable to aggregate high-dimensional disagreements.
Edit intent: clarity
Original: Contracts (or interface) theories have been proposed to formally support distributed and decentralized system design while ensuring safe system integration.
Revised: Contract theories have been proposed to formally support distributed and decentralized system design while ensuring safe system integration.
Edit intent: clarity
Original:  While this new model remains generic, it provides a much more elegant and richer algebra for its key notions of refinement, parallel composition, and quotient, and it allows considering new operations.
Revised:  While this new model remains generic, it provides a much more elegant and richer algebra for its key notions of refinement, parallel composition, and quotient, and it allows inclusion of new operations.
Edit intent: clarity
Original:  In this paper , we construct two classes of quantum synchronizable codes which obtained by the cyclotomic classes of order two over Z_{2q} . And the synchronization capabilities reach the upper bound under certain constrains .
Revised:  This paper contributes to constructing two classes of quantum synchronizable codes which obtained by the cyclotomic classes of order two over Z_{2q} . And the synchronization capabilities reach the upper bound under certain constrains .
Edit intent: clarity
Original:  In this paper , we construct two classes of quantum synchronizable codes which obtained by the cyclotomic classes of order two over Z_{2q} . And the synchronization capabilities reach the upper bound under certain constrains .
Revised:  In this paper , we construct two classes of quantum synchronizable codes by the cyclotomic classes of order two over Z_{2q} . And the synchronization capabilities reach the upper bound under certain constrains .
Edit intent: clarity
Original:  In this paper , we construct two classes of quantum synchronizable codes which obtained by the cyclotomic classes of order two over Z_{2q} . And the synchronization capabilities reach the upper bound under certain constrains .
Revised:  In this paper , we construct two classes of quantum synchronizable codes which obtained by the cyclotomic classes of order two over Z_{2q} , whose synchronization capabilities can reach the upper bound under certain constrains .
Edit intent: clarity
Original:  In this paper , we construct two classes of quantum synchronizable codes which obtained by the cyclotomic classes of order two over Z_{2q} . And the synchronization capabilities reach the upper bound under certain constrains .
Revised:  In this paper , we construct two classes of quantum synchronizable codes which obtained by the cyclotomic classes of order two over Z_{2q} . And the synchronization capabilities reach the upper bound under certain conditions .
Edit intent: clarity
Original:  Moreover, the quantum synchronizable code posses good error-correcting capability towards bit error and phase error, since cyclic codes we employed to construct quantum synchronizable codes are optimal or almost optimal .
Revised:  Moreover, the quantum synchronizable codes possess good error-correcting capability towards bit error and phase error, since cyclic codes we employed to construct quantum synchronizable codes are optimal or almost optimal .
Edit intent: fluency
Original:  Moreover, the quantum synchronizable code posses good error-correcting capability towards bit error and phase error, since cyclic codes we employed to construct quantum synchronizable codes are optimal or almost optimal .
Revised:  Moreover, the quantum synchronizable code posses good error-correcting capability towards bit errors and phase errors .
Edit intent: coherence
Original: In this paper, we propose  high order semi-implicit schemes for the all Mach full Euler equations of gas dynamics.
Revised: In this paper, we propose high order semi-implicit scheme for the all Mach full Euler equations of gas dynamics.
Edit intent: fluency
Original:  While great research efforts have been devoted to exploiting deep neural networks for improved stock prediction, the existing studies still suffer from two major issues  .
Revised:  While great research efforts have been devoted to exploiting deep neural networks for improved stock prediction, two major issues .
Edit intent: clarity
Original:  First, the  long-range dependencies in time series are not sufficiently captured .
Revised:  First, the capture of long-range dependencies in time series are not sufficiently captured .
Edit intent: fluency
Original:  First, the  long-range dependencies in time series are not sufficiently captured .
Revised:  First, the long-range dependencies in time series is not sufficiently addressed .
Edit intent: clarity
Original:  In this study, we propose a novel framework to address both issues regarding stock prediction . Specifically, in terms of transforming time series into complex networks, we convert market price series into graphs.
Revised:  In this study, we propose a novel framework to address both issues . Specifically, in terms of transforming time series into complex networks, we convert market price series into graphs.
Edit intent: clarity