wanyu/IteraTeR_full_sent huggingface dataset:
Original:  We develop a data structure with O( n log log n ) space,  O( log n + k ) query time, and expected O( n polylog n ) preprocessing time , removing a ( log^2 n log log n ) -factor from the O( n ( log^2 n )( log log n )^2 ) space of Bohler et al 's recent SoCG'16 work.
Revised:  We develop a data structure with O( n log log n ) space, O( log n + k ) query time, and expected O( n polylog n ) preprocessing time , removing a ( log^2 n log log n ) space approaches the linear space, whose achievability is still unknown with the optimal query time, and improves the so far best O( n ( log^2 n )( log log n )^2 ) space of Bohler et al 's recent SoCG'16 work.
Edit intent: meaning-changed
Original:  We develop a data structure with O( n log log n ) space,  O( log n + k ) query time, and expected O( n polylog n ) preprocessing time , removing a ( log^2 n log log n ) -factor from the O( n ( log^2 n )( log log n )^2 ) space of Bohler et al 's recent SoCG'16 work. In addition, our dynamic version (that allows insertions and deletions of sites) also improves the space of Kaplan et al.'s recent SODA'17 work from O( n log^3 n ) to O( n log n ) , and reduces a ( log^2 n )-factor from their deletion time.
Revised:  We develop a data structure with O( n log log n ) space, O( log n + k ) query time, and expected O( n polylog n ) preprocessing time , removing a ( log^2 n log log n ) -factor from the O( n ( log^2 n )( log log n )^2 ) space of Bohler et al .'s work. Our dynamic version (that allows insertions and deletions of sites) also improves the space of Kaplan et al.'s recent SODA'17 work from O( n log^3 n ) to O( n log n ) , and reduces a ( log^2 n )-factor from their deletion time.
Edit intent: coherence
Original:  In addition, our dynamic version (that allows insertions and deletions of sites) also improves the space of Kaplan et al.'s recent SODA'17 work from O( n log^3 n ) to O( n log n ) , and reduces a ( log^2 n )-factor from their deletion time.
Revised:  In addition, our dynamic version (that allows insertions and deletions of sites) also reduces the space of Kaplan et al.'s recent SODA'17 work from O( n log^3 n ) to O( n log n ) , and reduces a ( log^2 n )-factor from their deletion time.
Edit intent: coherence
Original:  In addition, our dynamic version (that allows insertions and deletions of sites) also improves the space of Kaplan et al.'s recent SODA'17 work from O( n log^3 n ) to O( n log n ) , and reduces a ( log^2 n )-factor from their deletion time.
Revised:  In addition, our dynamic version (that allows insertions and deletions of sites) also improves the space of Kaplan et al.'s work from O( n log^3 n ) to O( n log n ) , and reduces a ( log^2 n )-factor from their deletion time.
Edit intent: clarity
Original:  In addition, our dynamic version (that allows insertions and deletions of sites) also improves the space of Kaplan et al.'s recent SODA'17 work from O( n log^3 n ) to O( n log n ) , and reduces a ( log^2 n )-factor from their deletion time. We obtain these improvements based on linear-size shallow cuttings , which are a standard technique to deal with the k nearest neighbor problem for point sites in the Euclidean metric.
Revised:  In addition, our dynamic version (that allows insertions and deletions of sites) also improves the space of Kaplan et al.'s recent SODA'17 work from O( n log^3 n ) to O( n log n ) . To obtain these progresses, we devise shallow cuttings of linear size for general distance functions. Shallow cuttings are a key technique to deal with the k nearest neighbor problem for point sites in the Euclidean metric.
Edit intent: clarity
Original:  Kaplan et al. has generalized shallow cuttings to general distance functions, but the size of their version has an extra double logarithmic factor.
Revised:  Kaplan et al. has generalized shallow cuttings to general distance functions, but their shallow cuttings could not be applied to the k nearest neighbors problem. Recently, Kaplan et al. constructed shallow cuttings that are feasible for the k nearest neighbors problem, while the size of their version has an extra double logarithmic factor.
Edit intent: meaning-changed
Original:  We successfully design linear-size shallow cuttings for general distance functions, indicating that for general distance functions it could still be possible to achieve the same complexities as point sites in the Euclidean metric. Our breakthrough to achieve the linear size is a new random sampling technique (for the configuration space) that employs relatively many local conflicts to prevent relatively few global conflicts.
Revised:  Our innovation is a new random sampling technique (for the configuration space) that employs relatively many local conflicts to prevent relatively few global conflicts.
Edit intent: clarity
Original:  Our breakthrough to achieve the linear size is a new random sampling technique (for the configuration space) that employs relatively many local conflicts to prevent relatively few global conflicts. We believe this new random sampling technique has its own merit for further applications .
Revised:  Our breakthrough to achieve the linear size is a new random sampling technique for the analysis of geometric structures. Since our new technique provides a new way to develop and analyze geometric algorithms, we believe it is of independent interest .
Edit intent: clarity
Original:  Based on the this decomposition , we further show that the associated optimal exercise boundary exists , and is a strictly increasing and smooth curve . We also analyze its asymptotic behavior for both large maturity and small time lag using the free-boundary method .
Revised:  Based on the this decomposition , we further show that the associated optimal exercise boundary exists , and is a strictly increasing and smooth curve , and analyze the asymptotic behavior of the value function and the optimal exercise boundary for both large maturity and small time lag using the free-boundary method .
Edit intent: meaning-changed
Original:  Monte Carlo simulations suggest a good finite sample performance for the proposed inferences  .
Revised:  Monte Carlo simulations suggest a good finite sample performance for the proposed inferences . Finally, in an empirical application estimating the elasticity of intertemporal substitution (EIS) with US data, we obtain TSIV estimates that are much larger than their standard IV counterparts, with our robust Hausman test failing to reject the null hypothesis of exogeneity of real interest rates .
Edit intent: meaning-changed
Original:  The presence of high levels of noise can hamper discovery of  patterns and dynamics encapsulated by these networks. Here we propose Network Enhancement (NE), a novel method for improving the signal-to-noise ratio of undirected, weighted networks , and thereby improving the performance of downstream analysis.
Revised:  The presence of high levels of noise can hamper discovery of patterns and dynamics . We propose Network Enhancement (NE), a novel method for improving the signal-to-noise ratio of undirected, weighted networks , and thereby improving the performance of downstream analysis.
Edit intent: clarity
Original:  Here we propose Network Enhancement (NE), a novel method for improving the signal-to-noise ratio of undirected, weighted networks , and thereby improving the performance of downstream analysis. NE applies a novel operator that induces sparsity and leverages higher-order networkstructures to remove weak edgesand enhance real connections.
Revised:  Here we propose Network Enhancement (NE), a novel method for improving the signal-to-noise ratio of undirected, weighted networks . NE uses a doubly stochastic matrix operator that induces sparsity and leverages higher-order networkstructures to remove weak edgesand enhance real connections.
Edit intent: meaning-changed
Original:  This iterative approach has a closed-form solution at convergence with desirable performanceproperties. We demonstrate the effectiveness of NE in denoising biological networks for several challenging yet important problems. Our experiments show that NE improves gene function prediction by denoising interaction networks from 22 human tissues.
Revised:  This iterative approach has a closed-form solution that increases spectral eigengap of the input network. As a result, NE removes weak edges, enhances real connections, and leads to better downstream performance. Experiments show that NE improves gene function prediction by denoising interaction networks from 22 human tissues.
Edit intent: meaning-changed
Original:  Our experiments show that NE improves gene function prediction by denoising interaction networks from 22 human tissues. Further, we use NE to interpret noisy Hi-C contact maps from the human genome and demonstrate its utility across varying degrees of data quality.
Revised:  Our experiments show that NE improves gene function prediction by denoising tissue-specific interaction networks, alleviates interpretation of noisy Hi-C contact maps from the human genome and demonstrate its utility across varying degrees of data quality.
Edit intent: clarity
Original:  Further, we use NE to interpret noisy Hi-C contact maps from the human genome and demonstrate its utility across varying degrees of data quality. Finally, when applied to fine-grained species identification , NE outperforms alternative approaches by a significant margin.
Revised:  Further, we use NE to interpret noisy Hi-C contact maps from the human genome , and boosts fine-grained species identification , NE outperforms alternative approaches by a significant margin.
Edit intent: coherence
Original:  Finally, when applied to fine-grained species identification , NE outperforms alternative approaches by a significant margin. Taken together, our results indicate that NE is widely applicable for denoising weighted biological networks, especially when they contain high levels of noise .
Revised:  Finally, when applied to fine-grained identification accuracy of species. Our results indicate that NE is widely applicable for denoising weighted biological networks, especially when they contain high levels of noise .
Edit intent: clarity
Original: The study of neuronal interactions is currently at the center of several neuroscience big collaborative projects (including the Human Connectome  , the Blue Brain  , the Brainome, etc.) which attempt to obtain a detailed map of the entire brain matrix .
Revised: The study of neuronal interactions is currently at the center of several big collaborative neuroscience projects (including the Human Connectome , the Blue Brain , the Brainome, etc.) which attempt to obtain a detailed map of the entire brain matrix .
Edit intent: fluency
Original: The study of neuronal interactions is currently at the center of several neuroscience big collaborative projects (including the Human Connectome  , the Blue Brain  , the Brainome, etc.) which attempt to obtain a detailed map of the entire brain matrix .
Revised: The study of neuronal interactions is currently at the center of several neuroscience big collaborative projects (including the Human Connectome Project , the Blue Brain , the Brainome, etc.) which attempt to obtain a detailed map of the entire brain matrix .
Edit intent: clarity
Original: The study of neuronal interactions is currently at the center of several neuroscience big collaborative projects (including the Human Connectome  , the Blue Brain  , the Brainome, etc.) which attempt to obtain a detailed map of the entire brain matrix .
Revised: The study of neuronal interactions is currently at the center of several neuroscience big collaborative projects (including the Human Connectome , the Blue Brain Project , the Brainome, etc.) which attempt to obtain a detailed map of the entire brain matrix .
Edit intent: clarity
Original: The study of neuronal interactions is currently at the center of several neuroscience big collaborative projects (including the Human Connectome  , the Blue Brain  , the Brainome, etc.) which attempt to obtain a detailed map of the entire brain matrix .
Revised: The study of neuronal interactions is currently at the center of several neuroscience big collaborative projects (including the Human Connectome , the Blue Brain , the Brainome, etc.) which attempt to obtain a detailed map of the entire brain .
Edit intent: clarity
Original:  We observe that upon imposing the neuronal excitation/inhibition balance, although the eigenvalues remain unchanged, their stability dramatically decreases due to  strong non-orthogonality of associated eigenvectors.
Revised:  We observe that upon imposing the neuronal excitation/inhibition balance, despite the eigenvalues remaining unchanged, their stability dramatically decreases due to strong non-orthogonality of associated eigenvectors.
Edit intent: fluency
Original:  We observe that upon imposing the neuronal excitation/inhibition balance, although the eigenvalues remain unchanged, their stability dramatically decreases due to  strong non-orthogonality of associated eigenvectors.
Revised:  We observe that upon imposing the neuronal excitation/inhibition balance, although the eigenvalues remain unchanged, their stability dramatically decreases due to the strong non-orthogonality of associated eigenvectors.
Edit intent: fluency
Original:  However, the general relation between diffusion and stochastic system dynamics remains unveiled. Here we examine the general relation and find the universal law under which the steady-state distribution in complex balanced networks is diffusion-independent.
Revised:  However, the general relation between diffusion and stochastic system dynamics remains veiled. Within the approximation of reaction-diffusion master equation (RDME), we find general relation that the steady-state distribution in complex balanced networks is diffusion-independent.
Edit intent: meaning-changed
Original: We analyze total, asymmetric and frequency connectedness between the oil and forex markets using high-frequency  intra-day data over  2007 -- 2015. Methodologically, we extend the Diebold-Yilmaz spillover index in two ways to account for asymmetric and frequency connectedness . Empirically, our resultsshow that by combining crude oil with the set of currencies a total connectedness of the portfolio is lower than the total connectedness of the forex market itself.
Revised: We analyze total, asymmetric and frequency connectedness between the oil and forex markets using high-frequency intra-day data over 2007 -- 2017. By employing variance decompositions and their spectral representation in combination with realized semivariances to account for asymmetric and frequency connectedness . Empirically, our resultsshow that by combining crude oil with the set of currencies a total connectedness of the portfolio is lower than the total connectedness of the forex market itself.
Edit intent: meaning-changed
Original:  Methodologically, we extend the Diebold-Yilmaz spillover index in two ways to account for asymmetric and frequency connectedness . Empirically, our resultsshow that by combining crude oil with the set of currencies a total connectedness of the portfolio is lower than the total connectedness of the forex market itself.
Revised:  Methodologically, we extend the Diebold-Yilmaz spillover index in two ways to account for asymmetric and frequency connectedness , we obtain interesting results. We show that divergence in monetary policy regimes affects forex volatility spillovers but that adding oil to a forex portfolio decreases the total connectedness of the forex market itself.
Edit intent: meaning-changed
Original:  Methodologically, we extend the Diebold-Yilmaz spillover index in two ways to account for asymmetric and frequency connectedness . Empirically, our resultsshow that by combining crude oil with the set of currencies a total connectedness of the portfolio is lower than the total connectedness of the forex market itself. Further, in terms of asymmetries we show that bad volatility dominates connectedness on the forex market. However, when we add oil into a hypothetical portfolio of oil and foreign currencies, asymmetry in connectedness between the two classes of assets reverses in favor of the good volatility. Finally, the frequency connectedness analysis reveals that dynamic of the shorter and longer term connectedness dramatically differs. While shorter-term connectedness is usually low, the long-term connectedness sharply rises during the global financial crisis, European debt crisis, and after the oil price drop in 2014.
Revised:  Methodologically, we extend the Diebold-Yilmaz spillover index in two ways to account for asymmetric and frequency connectedness . Empirically, our resultsshow that by combining crude oil with the set of currencies a total connectedness of the portfolio is lower than the total connectedness of the mixed portfolio. Asymmetries in connectedness sharply rises during the global financial crisis, European debt crisis, and after the oil price drop in 2014.
Edit intent: clarity
Original:  While shorter-term connectedness is usually low, the long-term connectedness sharply rises during the global financial crisis, European debt crisis, and after the oil price drop in 2014. Hence, the long-term connectedness reflects worrisome beliefs of investors and correlates with the increased market uncertainty .
Revised:  While shorter-term connectedness is usually low, the long-term connectedness are relatively small. While negative shocks dominate forex volatility connectedness, positive shocks prevail when oil and forex markets are assessed jointly. Frequency connectedness is largely driven by uncertainty shocks and to a lesser extent by liquidity shocks, which impact long-term connectedness reflects worrisome beliefs of investors and correlates with the increased market uncertainty .
Edit intent: meaning-changed
Original:  We hypothesize that due to non-instantaneous information flows, the inclusion of such a sentiment indicator  derived purely from unstructured news data  will improve our capabilities to forecast future recessions  .
Revised:  We hypothesize that due to non-instantaneous information flows, the inclusion of such a sentiment indicator derived purely from unstructured news data will improve our capabilities to forecast future recessions because it provides a direct measure of the polarity of the information consumers and producers are exposed to .
Edit intent: meaning-changed
Original:  We go on to show that the use of this proposed metric, even when included with consumer survey data, helps improve model performance significantly. This metric, in combination with consumer survey data, S P 500 returns, and the yield curve, produces forecasts that significantly outperform models of higher complexity, containing traditional economic indicators .
Revised:  We go on to show that the P 500 returns, and the yield curve, produces forecasts that significantly outperform models of higher complexity, containing traditional economic indicators .
Edit intent: clarity
Original:  This metric, in combination with consumer survey data, S P 500 returns, and the yield curve, produces forecasts that significantly outperform models of higher complexity, containing traditional economic indicators .
Revised:  This metric, in combination with consumer survey data, S inclusion of our proposed news sentiment indicator, with traditional sentiment data, such as the Michigan Index of Consumer Sentiment and the Purchasing Manager's Index, and common factors derived from a large panel of economic and financial indicators helps improve model performance significantly .
Edit intent: meaning-changed
Original:  The LPC of learners increased with response accuracy whereas their N1 amplitude after learning increased with between-category separation  . Non-learners showed no significant changes in dissimilarity judgments, LPC or N1, within or between categories.
Revised:  LPC increased with response accuracy whereas their N1 amplitude after learning increased with between-category separation . Non-learners showed no significant changes in dissimilarity judgments, LPC or N1, within or between categories.
Edit intent: clarity
Original:  The LPC of learners increased with response accuracy whereas their N1 amplitude after learning increased with between-category separation  . Non-learners showed no significant changes in dissimilarity judgments, LPC or N1, within or between categories.
Revised:  The LPC of learners increased with response accuracy and N1 amplitude after learning increased with between-category separation . Non-learners showed no significant changes in dissimilarity judgments, LPC or N1, within or between categories.
Edit intent: clarity
Original:  The LPC of learners increased with response accuracy whereas their N1 amplitude after learning increased with between-category separation  . Non-learners showed no significant changes in dissimilarity judgments, LPC or N1, within or between categories.
Revised:  The LPC of learners increased with response accuracy whereas their N1 amplitude decreased with between-category separation . Non-learners showed no significant changes in dissimilarity judgments, LPC or N1, within or between categories.
Edit intent: clarity
Original:  The LPC of learners increased with response accuracy whereas their N1 amplitude after learning increased with between-category separation  . Non-learners showed no significant changes in dissimilarity judgments, LPC or N1, within or between categories.
Revised:  The LPC of learners increased with response accuracy whereas their N1 amplitude after learning increased with between-category separation for the Learners . Non-learners showed no significant changes in dissimilarity judgments, LPC or N1, within or between categories.
Edit intent: meaning-changed
Original: We consider general evolutionary dynamics under persistent payoff heterogeneity and study the dynamic relation between the strategy composition over different types and the aggregate strategy distribution of the entire population. It is rigorously proven that continuity of either the revision protocol or the type distribution guarantees the existence of a unique solution trajectory .
Revised: We consider general evolutionary dynamics under heterogeneous populations is presented. The framework allows continuously many types of heterogeneous agents, heterogeneity both in payoff functions and in revision protocols and the entire joint distribution of strategies and types to influence the payoffs of agents. We clarify regularity conditions for the unique existence of a unique solution trajectory .
Edit intent: meaning-changed
Original:  It is rigorously proven that continuity of either the revision protocol or the type distribution guarantees the existence of a unique solution trajectory . In many major evolutionary dynamics, an agent's switching rate between actions increases with the payoff gain from this switch, which causes nonaggregability: the current strategy composition must be identified to predict the transition of the aggregate strategy. Looking at the strategy composition, we retain equilibrium stationarity in general and  stability in potential games under admissible dynamics.
Revised:  It is rigorously proven that continuity of either the revision protocol or the type distribution guarantees the existence of a solution trajectory and for the existence of equilibrium. We confirm that equilibrium stationarity in general and stability in potential games under admissible dynamics.
Edit intent: clarity