wanyu/IteraTeR_v2 huggingface dataset:
Original:  We study the effect of network architecture on these fast sparsely synchronized rhythms in an inhibitory population of suprathreshold fast spiking (FS) Izhikevich interneurons (which fire spontaneously without noise) .
Revised:  We study the effect of network architecture on these fast sparsely synchronized rhythms in an inhibitory population of suprathreshold fast spiking (FS) Izhikevich interneurons .
Edit intent: clarity
Original:  Fast sparsely synchronized states of relatively high degree are found to appear for large values of J and D.
Revised:  Thus, fast sparsely synchronized states of relatively high degree are found to appear for large values of J and D.
Edit intent: coherence
Original: This paper describes some biologically-oriented processes that could be used to build the sort of networks  we associate with the human brain.
Revised: This paper describes some biologically-inspired processes that could be used to build the sort of networks we associate with the human brain.
Edit intent: clarity
Original: This paper describes some biologically-oriented processes that could be used to build the sort of networks  we associate with the human brain.
Revised: This paper describes some biologically-oriented processes that could be used to build the sort of networks that we associate with the human brain.
Edit intent: fluency
Original:  The paper also shows how most of the recent research results can be part of a more complete model.
Revised:  The paper also shows how recent research can be combined with established theories, to produce a more complete model.
Edit intent: clarity
Original:  There are  some important updates from an earlier version of this paper.
Revised:  There are also some important updates from an earlier version of this paper.
Edit intent: coherence
Original:  For our characterization, we combine modifications of canonical split decompositions with an idea of Megiddo, Hakimi, Garey, Johnson, Papadimitriou : The complexity of searching a graph.
Revised:  For our characterization, we combine modifications of canonical split decompositions with an idea of Megiddo, Hakimi, Garey, Johnson, Papadimitriou The complexity of searching a graph.
Edit intent: fluency
Original:  JACM 1988], used for computing the path-width of trees.
Revised:  J. ACM 1988], used for computing the path-width of trees.
Edit intent: fluency
Original:  We also provide a set of distance-hereditary graphs which contains the set of distance-hereditary vertex-minor obstructions for  linear rank-width.
Revised:  We provide a set of distance-hereditary graphs which contains the set of distance-hereditary vertex-minor obstructions for linear rank-width.
Edit intent: coherence
Original:  We also provide a set of distance-hereditary graphs which contains the set of distance-hereditary vertex-minor obstructions for  linear rank-width.
Revised:  We also provide a set of distance-hereditary graphs that contains the set of distance-hereditary vertex-minor obstructions for linear rank-width.
Edit intent: fluency
Original:  The set given in Jeong, Kwon, Oum: Excluded vertex-minors for graphs of linear rank-width at most k. STACS 2013: 221-232 is a subset of our obstruction set .
Revised:  Jeong, Kwon, Oum: Excluded vertex-minors for graphs of linear rank-width at most k. STACS 2013: 221-232 is a subset of our obstruction set .
Edit intent: clarity
Original:  The set given in Jeong, Kwon, Oum: Excluded vertex-minors for graphs of linear rank-width at most k. STACS 2013: 221-232 is a subset of our obstruction set .
Revised:  The set given in Jeong, Kwon, Oum: Excluded vertex-minors for graphs of linear rank-width at most is a subset of our obstruction set .
Edit intent: clarity
Original: We present a characterization of the linear rank-width of distance-hereditary graphs.
Revised: Linear rank-width of distance-hereditary graphs.
Edit intent: clarity
Original:  J. ACM , 35 (1): 18--44, 1988 ] , used for computing the path-width of trees.
Revised:  , 35 (1): 18--44, 1988 ] , used for computing the path-width of trees.
Edit intent: clarity
Original:  In most cases the coordinated motion is a helpful aspect of the given phenomenon and results in making a related process more efficient (e.g., embryogenesis or wound healing), while in the case of tumor cell invasion it appears to speed up the progression of the decease .
Revised:  In most cases the coordinated motion is a helpful aspect of the given phenomenon and results in making a related process more efficient (e.g., embryogenesis or wound healing), while in the case of tumor cell invasion it appears to speed up the progression of the disease .
Edit intent: fluency
Original:  In essence, they do not preserve this metadata.
Revised:  In essence, they do not preserve this metadata.
Edit intent: fluency
Original:  We extend a persistent, authenticated search tree to become an authenticated dictionary for arbitrary length key/value pairs, which we use to store all integrity metadata, accessible simply by object name.
Revised:  We introduce a treap-based persistent authenticated dictionary managing arbitrary length key/value pairs, which we use to store all integrity metadata, accessible simply by object name.
Edit intent: clarity
Original:  Verifiers store and offer attestation on digests and have minimal storage requirements, while preservers efficiently synchronize a complete copy of the catalog to assist in recovery in case of  detected catalog compromise on the local system.
Revised:  Verifiers store and offer attestation on digests and have minimal storage requirements, while preservers efficiently synchronize a complete copy of the catalog to assist in recovery in case of detected catalog compromise on the local system.
Edit intent: fluency
Original:  Verifiers store and offer attestation on digests and have minimal storage requirements, while preservers efficiently synchronize a complete copy of the catalog to assist in recovery in case of  detected catalog compromise on the local system.
Revised:  Verifiers store and offer attestations on digests and have minimal storage requirements, while preservers efficiently synchronize a complete copy of the catalog to assist in recovery in case of detected catalog compromise on the local system.
Edit intent: fluency
Original:  Verifiers store and offer attestation on digests and have minimal storage requirements, while preservers efficiently synchronize a complete copy of the catalog to assist in recovery in case of  detected catalog compromise on the local system.
Revised:  Verifiers store and offer attestation on digests and have minimal storage requirements, while preservers efficiently synchronize a complete copy of the catalog to assist in recovery in case of a detected catalog compromise on the local system.
Edit intent: fluency
Original:  However, recent chromosome conformation capture studies (e.g. Hi-C) show that enhancer and promoters are embedded in a complex network of cell-type specific looping interactions.
Revised:  However, recent chromosome conformation capture studies (e.g. Hi-C) show that enhancer and promoters are embedded in a complex network of looping interactions.
Edit intent: clarity
Original:  Here we  investigate whether, and to what extent, looping interactions between elements in the vicinity of an enhancer- promoter pair can influence the frequencyof enhancer-promoter contacts.
Revised:  Here we investigate whether, and to what extent, looping interactions between elements in the vicinity of an enhancer-promoter pair can influence the frequencyof enhancer-promoter contacts.
Edit intent: fluency
Original:  Our polymer simulations show that a chromatin loop  formed by elements flanking either an enhancer or a promoter  suppresses enhancer-promoter interactions, working as a topological insulator.
Revised:  Our polymer simulations show that a chromatin loop , formed by elements flanking either an enhancer or a promoter suppresses enhancer-promoter interactions, working as a topological insulator.
Edit intent: fluency
Original:  Our polymer simulations show that a chromatin loop  formed by elements flanking either an enhancer or a promoter  suppresses enhancer-promoter interactions, working as a topological insulator.
Revised:  Our polymer simulations show that a chromatin loop formed by elements flanking either an enhancer or a promoter , suppresses enhancer-promoter interactions, working as a topological insulator.
Edit intent: fluency
Original:  Our polymer simulations show that a chromatin loop  formed by elements flanking either an enhancer or a promoter  suppresses enhancer-promoter interactions, working as a topological insulator.
Revised:  Our polymer simulations show that a chromatin loop formed by elements flanking either an enhancer or a promoter suppresses enhancer-promoter interactions, working as an insulator.
Edit intent: clarity
Original:  Overall, our results show that looping interactions which do not directly involve an enhancer-promoter contact can nevertheless significantly modulate their interactions.
Revised:  Overall, our results show that looping interactions that do not directly involve an enhancer-promoter contact can nevertheless significantly modulate their interactions.
Edit intent: fluency
Original:  Overall, our results show that looping interactions which do not directly involve an enhancer-promoter contact can nevertheless significantly modulate their interactions.
Revised:  Overall, our results show that looping interactions which do not directly involve an enhancer-promoter pair can nevertheless significantly modulate their interactions.
Edit intent: clarity
Original:  This illustrates the intricate effects that local chromatin organization can have on gene expression .
Revised:  This phenomenon is analogous to allosteric regulation in proteins, where a conformational change triggered by binding of a regulatory molecule to one site affects the state of another site .
Edit intent: clarity
Original:  This classic result , however, does not explain why the normalized Fourier transform , which has a unit determinant, should take \Omega(n\log n) steps to compute .
Revised:  This classic result does not explain why the normalized Fourier transform , which has a unit determinant, should take \Omega(n\log n) steps to compute .
Edit intent: coherence
Original:  This classic result , however, does not explain why the normalized Fourier transform , which has a unit determinant, should take \Omega(n\log n) steps to compute .
Revised:  This classic result , however, does not explain why the Fourier transform , which has a unit determinant, should take \Omega(n\log n) steps to compute .
Edit intent: clarity
Original:  This classic result , however, does not explain why the normalized Fourier transform , which has a unit determinant, should take \Omega(n\log n) steps to compute .
Revised:  This classic result , however, does not explain why the normalized normalized Fourier transform (of unit determinant) should require \Omega(n\log n) steps to compute .
Edit intent: clarity
Original:  This classic result , however, does not explain why the normalized Fourier transform , which has a unit determinant, should take \Omega(n\log n) steps to compute .
Revised:  This classic result , however, does not explain why the normalized Fourier transform , which has a unit determinant, should take \Omega(n\log n) steps .
Edit intent: clarity
Original:  More recently, Ailon (2013) showed that in a layered linear circuit model restricted to unitary 2\times 2 gates , one obtains an \Omega(n\log n) lower bound.
Revised:  More recently, Ailon (2013) showed that if only unitary 2-by-2 gates are used , one obtains an \Omega(n\log n) lower bound.
Edit intent: clarity
Original:  The main conclusion from that work was that a potential function that might eventually help proving the \Omega(n\log n) conjectured lower bound for computation of Fourier transform is not related to matrix determinant, but rather to a notion of matrix entropy.
Edit intent: coherence
Original:  In this work we take another step and show that an \Omega(n\log n) lower bound in a considerably less restricted computational model.
Revised:  In this work we take another step and show an \Omega(n\log n) lower bound in a considerably less restricted computational model.
Edit intent: fluency
Original:  Our restriction is that, for any t, after gates 1,%DIFDELCMD < \dots%%% , t are executed, the resulting transformation as well as its inverse have spectral norm at most R for some constant R.
Revised:  Our restriction is that, for any t, after gates 1,%DIFDELCMD < \dots%%% at any moment, the corresponding transformation is well conditioned with constant R.
Edit intent: clarity
Original:  An early result by Morgenstern from 1973  , provides an \Omega(n \log n) lower bound for the unnormalized FFT when the constants used in the computation are bounded.
Revised:  An early result by Morgenstern ( 1973 , provides an \Omega(n \log n) lower bound for the unnormalized FFT when the constants used in the computation are bounded.
Edit intent: clarity
Original:  An early result by Morgenstern from 1973  , provides an \Omega(n \log n) lower bound for the unnormalized FFT when the constants used in the computation are bounded.
Revised:  An early result by Morgenstern from 1973 ) , provides an \Omega(n \log n) lower bound for the unnormalized FFT when the constants used in the computation are bounded.
Edit intent: fluency
Original:  An early result by Morgenstern from 1973  , provides an \Omega(n \log n) lower bound for the unnormalized FFT when the constants used in the computation are bounded.
Revised:  An early result by Morgenstern from 1973 , provides an \Omega(n \log n) lower bound for the FFT when the constants used in the computation are bounded.
Edit intent: clarity
Original:  More recently, Ailon (2013) showed that if only unitary 2-by-2 gates are used, one obtains an \Omega(n\log n) lower bound .
Revised:  Ailon (2013) showed that if only unitary 2-by-2 gates are used, one obtains an \Omega(n\log n) lower bound .
Edit intent: coherence
Original:  This is a practical requirement from an engineering point of view because an ill conditioned transformation must result in numerical instability for certain inputs .
Revised:  This is a practical requirement from an engineering point of view because high condition number restricts the set of inputs on which the computation is numerically stable .
Edit intent: clarity
Original:  An early result by Morgenstern ( 1973 ) , provides an \Omega(n \log n) lower bound for the unnormalized Fourier transform when the constants used in the computation are bounded.
Revised:  An early result by Morgenstern ( 1973 , provides an \Omega(n \log n) lower bound for the unnormalized Fourier transform when the constants used in the computation are bounded.
Edit intent: fluency
Original:  The determinant of the unnormalized Fourier transform is n^{n/2 does not explain why the normalized Fourier transform (of unit determinant) should require \Omega(n\log n) steps.
Revised:  The result does not explain why the normalized Fourier transform (of unit determinant) should require \Omega(n\log n) steps.
Edit intent: coherence
Original:  In this work we take another step and show an \Omega(n\log n) lower bound for computing  the Fourier transform under ANY scaling, while allowing the gates to perform any nonsingular (not necessarily unitary) transformation involving 2 variables .
Revised:  In this work we take another step and show an \Omega(n\log n) lower bound for computing any scaling of the Fourier transform under ANY scaling, while allowing the gates to perform any nonsingular (not necessarily unitary) transformation involving 2 variables .
Edit intent: clarity
Original:  In this work we take another step and show an \Omega(n\log n) lower bound for computing  the Fourier transform under ANY scaling, while allowing the gates to perform any nonsingular (not necessarily unitary) transformation involving 2 variables .
Revised:  In this work we take another step and show an \Omega(n\log n) lower bound for computing the Fourier transform .
Edit intent: clarity
Original:  Our restriction is that  the composition of all gates up to any given step is well conditioned with constant R.
Revised:  Our restriction is that , the composition of all gates up to any given step is well conditioned with constant R.
Edit intent: fluency
Original:  The main technical technique is extending the notion of matrix entropy of Ailon (2013) to the nonsingular group.
Revised:  The main technical contribution is an extension of matrix entropy of Ailon (2013) to the nonsingular group.
Edit intent: clarity
Original:  The main technical technique is extending the notion of matrix entropy of Ailon (2013) to the nonsingular group.
Revised:  The main technical technique is extending the notion of matrix entropy used in Ailon (2013) to the nonsingular group.
Edit intent: clarity
Original:  The main technical contribution is an extension of matrix entropy used in Ailon (2013) for unitary matrices to a potential function computable for any matrix, using Shannon entropy on `` quasi-probabilities '' .
Revised:  The main technical contribution is an extension of matrix entropy used in Ailon (2013) for unitary matrices to a potential function computable for any matrix, using Shannon entropy on " quasi-probabilities '' .
Edit intent: fluency
Original:  The main technical contribution is an extension of matrix entropy used in Ailon (2013) for unitary matrices to a potential function computable for any matrix, using Shannon entropy on `` quasi-probabilities '' .
Revised:  The main technical contribution is an extension of matrix entropy used in Ailon (2013) for unitary matrices to a potential function computable for any matrix, using Shannon entropy on `` quasi-probabilities " .
Edit intent: fluency
Original: Long genomic segments that are nearly identical between a pair of individuals and are inherited from a recent common ancestor without recombination are called identical-by-descent (IBD) segments.
Revised: A long genomic segment inherited by a pair of individuals and are inherited from a recent common ancestor without recombination are called identical-by-descent (IBD) segments.
Edit intent: clarity
Original: Long genomic segments that are nearly identical between a pair of individuals and are inherited from a recent common ancestor without recombination are called identical-by-descent (IBD) segments.
Revised: Long genomic segments that are nearly identical between a pair of individuals from a single, recent common ancestor without recombination are called identical-by-descent (IBD) segments.
Edit intent: clarity
Original: Long genomic segments that are nearly identical between a pair of individuals and are inherited from a recent common ancestor without recombination are called identical-by-descent (IBD) segments.
Revised: Long genomic segments that are nearly identical between a pair of individuals and are inherited from a recent common ancestor is said to be identical-by-descent (IBD) segments.
Edit intent: clarity
Original:  We describe a general framework for the IBD process along the chromosome under the Markovian models (SMC/SMC'), as well as introduce and justify a new model, which we term the renewal approximation, under which lengths of successive segments are  independent.
Revised:  We describe a general framework for the IBD process along the chromosome under the Markovian models (SMC/SMC'), as well as introduce and justify a new model, which we term the renewal approximation, under which lengths of successive segments are assumed to be independent.
Edit intent: clarity
Original:  Then, considering the infinite-chromosome limit of the IBD process, we recover previous results (for SMC) and derive new results (for SMC') for the average fraction of the chromosome found in long shared segments and the average number of such segments.
Revised:  Then, considering the infinite-chromosome limit of the IBD process, we recover previous results (for SMC) and derive new results (for SMC') for the mean fraction of the chromosome found in long shared segments and the average number of such segments.
Edit intent: clarity
Original:  Then, considering the infinite-chromosome limit of the IBD process, we recover previous results (for SMC) and derive new results (for SMC') for the average fraction of the chromosome found in long shared segments and the average number of such segments.
Revised:  Then, considering the infinite-chromosome limit of the IBD process, we recover previous results (for SMC) and derive new results (for SMC') for the average fraction of the chromosome found in long shared segments and the mean number of such segments.
Edit intent: clarity
Original:  A number of new results for tree heights in SMC' are proved as lemmas.
Edit intent: coherence
Original:  While the expression is again in Laplace space, we could invert the first two moments and compare a number of approximations .
Revised:  While the expression is again in Laplace space, we could invert the first two moments .
Edit intent: clarity
Original:  Finally, we generalized all results to populations with variable historical effective size.
Revised:  Finally, we generalize all results to populations with variable historical effective size.
Edit intent: fluency
Original:  Finally, we generalized all results to populations with variable historical effective size.
Revised:  Finally, we generalized all results to populations with a variable effective size.
Edit intent: clarity
Original:  We describe a general framework for the IBD process along the chromosome under the Markovian models (SMC/SMC'), as well as introduce and justify a new model, which we term the renewal approximation, under which lengths of successive segments are assumed to be independent.
Revised:  We describe a general framework for the IBD process along the chromosome under the Markovian models (SMC/SMC'), as well as introduce and justify a new model, which we term the renewal approximation, under which lengths of successive segments are independent.
Edit intent: clarity
Original:  Then, considering the infinite-chromosome limit of the IBD process, we recover previous results (for SMC) and derive new results (for SMC') for the mean  fraction of the chromosome found in long shared segments and the mean number of such segments.
Revised:  Then, considering the infinite-chromosome limit of the IBD process, we recover previous results (for SMC) and derive new results (for SMC') for the mean fraction of the chromosome found in such segments.
Edit intent: clarity
Original:  We also compute (again, in Laplace space) the distribution of the fraction of the chromosome shared , from which we obtain explicit expressions for the first two moments.
Revised:  We also compute (again, in Laplace space) the distribution of the fraction of the chromosome in shared segments , from which we obtain explicit expressions for the first two moments.
Edit intent: clarity
Original:  Our proof is more involved and, in particular, uses a very useful result of Marx, O'Sullivan and Razgon (2013) on the treewidth of torso graphs with respect to small cuts .
Revised:  Our proof is more involved and, in particular, uses a very useful result of Marx, O'Sullivan and Razgon (2013) on the treewidth of torso graphs with respect to small separators .
Edit intent: clarity
Original:  Our proof is more involved and, in particular, uses a very useful result of Marx, O'Sullivan and Razgon (2013) on the treewidth of torso graphs with respect to small separators  .
Revised:  Our proof is more involved and, in particular, uses a well-known result of Marx, O'Sullivan and Razgon (2013) on the treewidth of torso graphs with respect to small separators .
Edit intent: clarity