wanyu/IteraTeR_v2 huggingface dataset:
Original:  We leverage LSH style randomized indexing procedure and combine it with several principled techniques, such as reservoir sampling, recent advances in one-pass minwise hashing, and count based estimations .
Revised:  By leveraging a LSH style randomized indexing procedure and combine it with several principled techniques, such as reservoir sampling, recent advances in one-pass minwise hashing, and count based estimations .
Edit intent: fluency
Original:  We leverage LSH style randomized indexing procedure and combine it with several principled techniques, such as reservoir sampling, recent advances in one-pass minwise hashing, and count based estimations .
Revised:  We leverage LSH style randomized indexing procedure and combining it with several principled techniques, such as reservoir sampling, recent advances in one-pass minwise hashing, and count based estimations .
Edit intent: fluency
Original:  Our experiments shed new light on the difficulties associated with datasets having several millions of dimensions.
Revised:  Our experiments shed new light on the difficulties associated with datasets having several million dimensions.
Edit intent: fluency
Original: Reconciling the stability of epigenetic landscapes with the rapid turnover of histone modifications and their adaptability to external stimuli is an outstanding challenge.
Revised: Reconciling the stability of epigenetic patterns with the rapid turnover of histone modifications and their adaptability to external stimuli is an outstanding challenge.
Edit intent: clarity
Original:  We model chromatin as a  polymer whose segments bear non-permanent histone marks (or "colours" ) which can be modified by "writer" proteins.
Revised:  We model chromatin as a polymer whose segments bear non-permanent histone marks (or colours ) which can be modified by "writer" proteins.
Edit intent: fluency
Original:  The three-dimensional chromatin organisation is mediated by protein bridges, or "readers", such as Polycomb-Repressive-Complexes and Transcription-Factors .
Revised:  The three-dimensional chromatin organisation is mediated by protein bridges, or "readers", such as Polycomb Repressive Complexes and Transcription Factors .
Edit intent: fluency
Original:  Our model provides a starting point for an understanding of the biophysics of cellular differentiation and reprogramming.
Revised:  We finally suggest that our model provides a starting point for an understanding of the biophysics of cellular differentiation and reprogramming.
Edit intent: clarity
Original: In this short note we propose a new backtesting framework for Expected Shortfall that could be used by the regulator.
Revised: We propose a new backtesting framework for Expected Shortfall that could be used by the regulator.
Edit intent: clarity
Original:  Instead of looking at the estimated capital reserve and the realized cash-flow separately, one could bind them into the secured position, for which the risk measurement process is much easier.
Revised:  Instead of looking at the estimated capital reserve and the realised cash-flow separately, one could bind them into the secured position, for which the risk measurement process is much easier.
Edit intent: fluency
Original:  Instead of looking at the estimated capital reserve and the realized cash-flow separately, one could bind them into the secured position, for which the risk measurement process is much easier.
Revised:  Instead of looking at the estimated capital reserve and the realized cash-flow separately, one could bind them into the secured position, for which risk measurement is much easier.
Edit intent: clarity
Original: We introduce succinct lossless representations of query results called covers that are subsets of  these results , yet allow for constant-delay enumeration of all result tuples .
Revised: We introduce succinct lossless representations of query results called covers . They are subsets of these results , yet allow for constant-delay enumeration of all result tuples .
Edit intent: clarity
Original: We introduce succinct lossless representations of query results called covers that are subsets of  these results , yet allow for constant-delay enumeration of all result tuples .
Revised: We introduce succinct lossless representations of query results called covers that are subsets of these results .
Edit intent: coherence
Original:  For any join query, we give asymptotically tight size bounds for the covers of the query results and show that such covers can be computed in worst-case optimal time ( up to a logarithmic factor in the database size ) . For acyclic join queries, we can compute covers compositionally from covers for subqueries using plans with a new operator called cover-join.
Revised:  For any decomposition of a query, we give asymptotically tight size bounds for the covers of the query results and show that such covers can be computed in worst-case optimal time ( up to a logarithmic factor in the database size ) . For acyclic join queries, we can compute covers compositionally from covers for subqueries using plans with a new operator called cover-join.
Edit intent: clarity
Original:  For any join query, we give asymptotically tight size bounds for the covers of the query results and show that such covers can be computed in worst-case optimal time ( up to a logarithmic factor in the database size ) . For acyclic join queries, we can compute covers compositionally from covers for subqueries using plans with a new operator called cover-join.
Revised:  For any join query, we give asymptotically tight size bounds for the covers of the query results and show that such covers can be computed in worst-case optimal time up to a logarithmic factor in the database size ) . For acyclic join queries, we can compute covers compositionally from covers for subqueries using plans with a new operator called cover-join.
Edit intent: fluency
Original:  For any join query, we give asymptotically tight size bounds for the covers of the query results and show that such covers can be computed in worst-case optimal time ( up to a logarithmic factor in the database size ) . For acyclic join queries, we can compute covers compositionally from covers for subqueries using plans with a new operator called cover-join.
Revised:  For any join query, we give asymptotically tight size bounds for the covers of the query results and show that such covers can be computed in worst-case optimal time ( up to a logarithmic factor in the database size . For acyclic join queries, we can compute covers compositionally from covers for subqueries using plans with a new operator called cover-join.
Edit intent: fluency
Original:  We then generalise covers from join queries to functional aggregate queries , which express a host of computational problems , e.g., evaluation of querieswith joins and aggregates , in-database optimization, matrix chain multiplication, and inference in probabilistic graphical models.
Revised:  We then generalise covers from join queries to functional aggregate queries that express a host of computational problems , e.g., evaluation of querieswith joins and aggregates , in-database optimization, matrix chain multiplication, and inference in probabilistic graphical models.
Edit intent: coherence
Original:  We then generalise covers from join queries to functional aggregate queries , which express a host of computational problems , e.g., evaluation of querieswith joins and aggregates , in-database optimization, matrix chain multiplication, and inference in probabilistic graphical models.
Revised:  We then generalise covers from join queries to functional aggregate queries , which express a host of computational problems such as aggregate-join queries , in-database optimization, matrix chain multiplication, and inference in probabilistic graphical models.
Edit intent: clarity
Original:  Pulled waves are noisy because they are driven by high growth rates at the expansion edge, where the number of organisms is small  .
Revised:  Pulled waves are driven by high growth rates at the expansion edge, where the number of organisms is small .
Edit intent: clarity
Original:  Such waves have many unusual properties because their foci of growth, ancestry, and diversity are spatially separated from each other .
Revised:  These waves are unusual because their properties are controlled by both the leading edge and the bulk of the front .
Edit intent: clarity
Original:  To stimulate this thriving research direction, we propose 15 interesting open questions in this area  .
Revised:  To stimulate this thriving research direction, we propose 15 open questions in this area .
Edit intent: clarity
Original: A well-known result of Gottesman and Knill states that Clifford circuits - i.e. circuits composed of only CNOT, Hadamard, and \pi/4 phase gates - are efficiently classically simulable.
Revised: Clifford circuits -- i.e. circuits composed of only CNOT, Hadamard, and \pi/4 phase gates - are efficiently classically simulable.
Edit intent: coherence
Original:  We show that in contrast, "conjugated Clifford circuits" (CCCs) - where one additionally conjugates every qubit by the same one-qubit gate U - can perform hard sampling tasks.
Revised:  We show that in contrast, "conjugated Clifford circuits" (CCCs) -- where one additionally conjugates every qubit by the same one-qubit gate U - can perform hard sampling tasks.
Edit intent: fluency
Original:  We show that in contrast, "conjugated Clifford circuits" (CCCs) - where one additionally conjugates every qubit by the same one-qubit gate U - can perform hard sampling tasks.
Revised:  We show that in contrast, "conjugated Clifford circuits" (CCCs) - where one additionally conjugates every qubit by the same one-qubit gate U -- can perform hard sampling tasks.
Edit intent: fluency
Original:  In particular, we fully classify the computational power of CCCs by showing that essentially any non-Clifford conjugating unitary U can give rise to sampling tasks which cannot be simulated classically to constant multiplicative error, unless the polynomial hierarchy collapses.
Revised:  In particular, we fully classify the computational power of CCCs by showing that essentially any non-Clifford conjugating unitary U can give rise to sampling tasks which cannot be efficiently classically simulated to constant multiplicative error, unless the polynomial hierarchy collapses.
Edit intent: clarity
Original: It is well known that the folding time of a protein correlates with the contact order, a simple measure of the spatial organization of a protein.
Revised: It is well known that the folding time correlates with the contact order, a simple measure of the spatial organization of a protein.
Edit intent: fluency
Original:  This is related to the average length of the main chain loops formed by amino acids which are in contact in the native state .
Revised:  This is related to the average length of the main chain loops formed by amino acids which are in contact .
Edit intent: clarity
Original:  In order to explore such possibility, here we introduce a novel descriptor, which we call "maximum intrachain contact entanglement".
Revised:  In order to explore such possibility, we introduce a novel descriptor, which we call "maximum intrachain contact entanglement".
Edit intent: coherence
Original: We consider the problem of estimating the latent structure of a social network based on observational data on information diffusion processes , or {\it cascades}.
Revised: We consider the problem of estimating the latent structure of a social network based on the observed information diffusion events , or {\it cascades}.
Edit intent: clarity
Original:  Here for a given cascade, we only observe the time a node/agent is infected but not the source of infection.
Revised:  Here for a given cascade, we only observe the times of infection for infected nodes but not the source of infection.
Edit intent: clarity
Original:  Existing literature has focused on estimating network diffusion matrix without any underlying assumptions on the structure of the network.
Revised:  Existing literature has focused on estimating a diffusion matrix without any underlying assumptions on the structure of the network.
Edit intent: fluency
Original:  We propose a novel model for inferring network diffusion matrix based on the intuition that an information datum is more likely to propagate among two nodes if they are interested in similar topics , which are common with the information .
Revised:  We propose a novel model based on the intuition that an information datum is more likely to propagate among two nodes if they are interested in similar topics , which are common with the information .
Edit intent: clarity
Original:  We propose a novel model for inferring network diffusion matrix based on the intuition that an information datum is more likely to propagate among two nodes if they are interested in similar topics , which are common with the information .
Revised:  We propose a novel model for inferring network diffusion matrix based on the intuition that an information is more likely to propagate among two nodes if they are interested in similar topics , which are common with the information .
Edit intent: clarity
Original:  We propose a novel model for inferring network diffusion matrix based on the intuition that an information datum is more likely to propagate among two nodes if they are interested in similar topics , which are common with the information .
Revised:  We propose a novel model for inferring network diffusion matrix based on the intuition that an information datum is more likely to propagate among two nodes if they are interested in similar topics which are also prominent in the information content .
Edit intent: clarity
Original:  In particular, our model endows each node with an influence vector ( how authoritative they are on each topic) and a receptivity vector ( how susceptible they are on each topic).
Revised:  In particular, our model endows each node with an influence vector ( how authoritative they are on each topic) and a receptivity vector ( which measures how susceptible the node is for each topic).
Edit intent: clarity
Original:  The estimated model can be used to build recommendation system based on the receptivity vectors, as well as for marketing based on the influence vectors  .
Revised:  The estimated model can be used to build recommendation systems based on the receptivity vectors, as well as for marketing based on the influence vectors .
Edit intent: fluency
Original: We consider the problem of estimating the latent structure of a social network based on the observed information diffusion events, or %DIFDELCMD < {\it %%% cascades .
Revised: We consider the problem of estimating the latent structure of a social network based on the observed information diffusion events, or %DIFDELCMD < {\it %%% .
Edit intent: clarity
Original:  Here for a given cascade , we only observe the times of infection for infected nodes but not the source of the infection.
Revised:  Here for a given cascade consist of only the timestamps of infection for infected nodes but not the source of the infection.
Edit intent: clarity
Original: Deep neural networks (DNN) have been successfully applied for music classification tasks including music tagging.
Edit intent: clarity
Original:  We perform comprehensive experiments involving audio preprocessing using different time-frequency representations, logarithmic magnitude compression, frequency weighting  and scaling.
Revised:  We perform comprehensive experiments involving audio preprocessing using different time-frequency representations, logarithmic magnitude compression, frequency weighting , and scaling.
Edit intent: fluency
Original: It is now well known that symplectic integrators lose many of their desirable properties when variable step sizes are used.
Revised: It is well known that symplectic integrators lose many of their desirable properties when variable step sizes are used.
Edit intent: coherence
Original:  However, all the algorithmic results developed in the literature so far only hold for unweighted instances, i.e., assuming unit weights on the edges of G. We give the first polynomial-time algorithm to find a minimum cardinality subset of vertices whose removal from G yields a stable graph, for any weighted graph G. The algorithm is combinatorial and exploits new structural properties of basic fractional matchings, which may be of independent interest  .
Revised:  However, all the algorithmic results developed in the literature so far only hold for unweighted instances, i.e., assuming unit weights on the edges of G. We give the first polynomial-time algorithm to find a minimum cardinality subset of vertices whose removal from G yields a stable graph, for any weighted graph G. The algorithm is combinatorial and exploits new structural properties of basic fractional matchings, which are of independent interest .
Edit intent: coherence
Original:  We also extend our framework to take into account batch effects and other confounding factors  and propose a natural Bayesian hypothesis framework for differential expression that outperforms tradition DESeq2.
Revised:  We also extend our framework to account for batch effects and other confounding factors and propose a natural Bayesian hypothesis framework for differential expression that outperforms tradition DESeq2.
Edit intent: fluency
Original:  We also extend our framework to take into account batch effects and other confounding factors  and propose a natural Bayesian hypothesis framework for differential expression that outperforms tradition DESeq2.
Revised:  We also extend our framework to take into account batch effects and other confounding factors , and propose a natural Bayesian hypothesis framework for differential expression that outperforms tradition DESeq2.
Edit intent: fluency
Original:  We also extend our framework to take into account batch effects and other confounding factors  and propose a natural Bayesian hypothesis framework for differential expression that outperforms tradition DESeq2.
Revised:  We also extend our framework to take into account batch effects and other confounding factors and propose a Bayesian hypothesis test for differential expression that outperforms tradition DESeq2.
Edit intent: clarity
Original:  We also extend our framework to take into account batch effects and other confounding factors  and propose a natural Bayesian hypothesis framework for differential expression that outperforms tradition DESeq2.
Revised:  We also extend our framework to take into account batch effects and other confounding factors and propose a natural Bayesian hypothesis framework for differential expression that outperforms DESeq2.
Edit intent: clarity
Original: Objectives: Information in clinical trial registries can be used to identify evidence for systematic reviews and measure reporting biases .
Revised: Objectives: Trial registries can be used to identify evidence for systematic reviews and measure reporting biases .
Edit intent: clarity
Original: Objectives: Information in clinical trial registries can be used to identify evidence for systematic reviews and measure reporting biases .
Revised: Objectives: Information in clinical trial registries can be used to measure reporting biases .
Edit intent: clarity
Original:  Performance was measured by the median rank of linked trial reports , and the proportion of links that can be verified by checking ranked trial reports in order.
Revised:  Performance was measured by the median rank of linked trial reports , and the proportion of unreported links that could be found by screening ranked candidate articles in order.
Edit intent: clarity
Original:  For one in three registrations, the matching article was ranked first .
Revised:  The matching article was ranked first .
Edit intent: clarity
Original:  For four in every five registrations, the matching article could be found by checking 50 or fewer candidates . Conclusions: Leveraging the growth in the corpus of reported links between ClinicalTrials.gov and PubMed, we found that automated methods can assist in the identification of unreported links between trial registrations and corresponding published trial reports .
Revised:  For four in every five registrations, the matching article could be found by checking 50 or fewer candidates . Conclusions: Leveraging the growth in the corpus of reported links between ClinicalTrials.gov and PubMed, we found that automated methods can assist in the identification of unreported links between trial registrations and corresponding articles .
Edit intent: clarity
Original:  We show using Markov chain Monte Carlo methods that within a simulation estimation framework, a model fitted to sequential infection data accurately captures the timing and extent of cross-protection , and attributes such cross-protection to the correct broad immune components .
Revised:  We show that virological data from sequential infection experiments can be used to accurately extract the timing and extent of cross-protection , and attributes such cross-protection to the correct broad immune components .
Edit intent: clarity
Original:  In addition, sequential infection data enables recovery of the timing and role of each immune component in controlling a primary infection .
Revised:  In addition, sequential infection data enables recovery of the timing and strength of some immune components in controlling a primary infection .
Edit intent: clarity
Original:  On the other hand, extensive experimental work leads to the conclusion, that the invariance induced by mel-spectrogram coefficients is both desirable and hard to infer by the learning process.
Revised:  We also conducted extensive experimental work leads to the conclusion, that the invariance induced by mel-spectrogram coefficients is both desirable and hard to infer by the learning process.
Edit intent: clarity
Original:  Previous work has found connections between the asymptotic rank of M_k and the complexity of the Hamiltonian Cycle problem: Cygan et al. (STOC 2013) showed that the rank of M_k over \mathbb Z _2 is \Theta(\sqrt 2^k) and used this to give an O^*((2+2)^{pw}) time algorithm for counting Hamiltonian cycles modulo 2 on graphs of pathwidth pw.
Revised:  Cygan et al. (STOC 2013) showed that the rank of M_k over \mathbb Z _2 is \Theta(\sqrt 2^k) and used this to give an O^*((2+2)^{pw}) time algorithm for counting Hamiltonian cycles modulo 2 on graphs of pathwidth pw.
Edit intent: clarity
Original:  Previous work has found connections between the asymptotic rank of M_k and the complexity of the Hamiltonian Cycle problem: Cygan et al. (STOC 2013) showed that the rank of M_k over \mathbb Z _2 is \Theta(\sqrt 2^k) and used this to give an O^*((2+2)^{pw}) time algorithm for counting Hamiltonian cycles modulo 2 on graphs of pathwidth pw.
Revised:  Previous work has found connections between the asymptotic rank of M_k and the complexity of the Hamiltonian Cycle problem: Cygan et al. (STOC 2013) showed that the rank of \mathbf{M _2 is \Theta(\sqrt 2^k) and used this to give an O^*((2+2)^{pw}) time algorithm for counting Hamiltonian cycles modulo 2 on graphs of pathwidth pw.
Edit intent: clarity
Original:  We present a new technique to simulate a similar "pattern propagation " when only a black-box lower bound on the asymptotic rank of M _k is given  . Given appropriate rank bounds, our technique yields lower bounds for counting Hamiltonian cycles (also modulo fixed primes p) parameterized by pathwidth.
Revised:  We present a new technique for a similar pattern propagation when only a black-box lower bound on the asymptotic rank of M _k is given . Given appropriate rank bounds, our technique yields lower bounds for counting Hamiltonian cycles (also modulo fixed primes p) parameterized by pathwidth.
Edit intent: clarity
Original:  To apply this technique, we prove that the rank of M_k over \mathbb Q is 4^k / \mathrm{poly}(k) , using the representation theory of the symmetric group and insights from algebraic combinatorics .
Revised:  To apply this technique, we prove that the rank of M_k over \mathbb Q is 4^k / \mathrm{poly}(k) .
Edit intent: coherence