wanyu/IteraTeR_v2 huggingface dataset:
Original:  Furthermore, we describe an%DIFDELCMD < O%%% (mn^{\omega+1 + n^{2\omega+2}) algorithm for finding a suitably approximate John's ellipsoid for a symmetric polytope based on Vaidya's algorithm, and show the mixing time is retained using these approximate ellipsoids (where \omega < 2.373 is the current value of the fast matrix multiplication constant)}  containing x, }\left|{|q-x|}}\right|  .
Revised:  Furthermore, we describe an%DIFDELCMD < O%%% + n^{2\omega+2}) algorithm for finding a suitably approximate John's ellipsoid for a symmetric polytope based on Vaidya's algorithm, and show the mixing time is retained using these approximate ellipsoids (where \omega < 2.373 is the current value of the fast matrix multiplication constant)} containing x, }\left|{|q-x|}}\right| .
Edit intent: coherence
Original: This note accompanies T. Martinez-Coronado, A. Mir, F. Rossello and G. Valiente's work "A balance index for phylogenetic trees based on quartets", introducing a new balance index for trees.
Revised: This paper builds up on T. Martinez-Coronado, A. Mir, F. Rossello and G. Valiente's work "A balance index for phylogenetic trees based on quartets", introducing a new balance index for trees.
Edit intent: clarity
Original:  In a calibration exercise we show that a parsimonious model specification has a good fit with Euribor interest rate swaps and swaptions, Euro Stoxx 50 index dividend futures and dividend futures options, and Euro Stoxx 50 index options.
Revised:  In a calibration exercise we show that a parsimonious model specification has a good fit with Euribor interest rate swaps and swaptions, Euro Stoxx 50 index dividend futures and dividend options, and Euro Stoxx 50 index options.
Edit intent: clarity
Original:  Whereas we find that the identification of top spreaders is optimal when prior knowledge is complete and free of mistakes, we also find that the quality of the top spreaders identified using noisy information does not necessarily decrease as the noise level increases.
Revised:  Whereas we find that the identification of top spreaders is optimal when prior knowledge is complete and free of mistakes, we also find that the quality of the top spreaders identified using noisy information doesn't necessarily decrease as the noise level increases.
Edit intent: fluency
Original:  We present two mass-conservative and unconditional energy-stable first order time schemes: the (nonlinear ) Backward Euler scheme and a linearized coupled version .
Revised:  We present two mass-conservative and unconditional energy-stable first-order time schemes: the (nonlinear ) Backward Euler scheme and a linearized coupled version .
Edit intent: fluency
Original:  We also analyze positivity, solvability, convergence towards weak solutions and error estimates of these schemes .
Revised:  We also analyze positivity, solvability, convergence towards weak solutions and error estimates .
Edit intent: clarity
Original:  This hypothesis is simplified in 2D domains where a\le  global in time strong estimate is proved.
Revised:  This hypothesis is simplified in 2D domains where a\le global in time strong estimates are proved.
Edit intent: fluency
Original: This work is devoted to study a fully discrete scheme for a repulsive chemotaxis with quadratic production model.
Revised: This work is devoted to the study of a fully discrete scheme for a repulsive chemotaxis with quadratic production model.
Edit intent: fluency
Original:  By following the ideas presented in [Guilen-Gonzalez et al], we introduce an auxiliary variable (the gradient of the chemical concentration), and then the corresponding Finite Element (FE) backward Euler scheme is mass-conservative and unconditional energy-stable.
Revised:  By following the ideas presented in [Guilen-Gonzalez et al], we introduce an auxiliary variable (the gradient of the chemical concentration), and prove that the corresponding Finite Element (FE) backward Euler scheme is mass-conservative and unconditional energy-stable.
Edit intent: coherence
Original:  By following the ideas presented in [Guilen-Gonzalez et al], we introduce an auxiliary variable (the gradient of the chemical concentration), and then the corresponding Finite Element (FE) backward Euler scheme is mass-conservative and unconditional energy-stable.
Revised:  By following the ideas presented in [Guilen-Gonzalez et al], we introduce an auxiliary variable (the gradient of the chemical concentration), and then the corresponding Finite Element (FE) backward Euler scheme is conservative and unconditionally energy-stable.
Edit intent: clarity
Original:  For this nonlinear scheme, we study some properties like solvability,  convergence towards weak solutions , error estimates, and weak, strong and more regular a priori estimates of the scheme.
Revised:  Additionally, we also study some properties like solvability, convergence towards weak solutions , error estimates, and weak, strong and more regular a priori estimates of the scheme.
Edit intent: coherence
Original:  For this nonlinear scheme, we study some properties like solvability,  convergence towards weak solutions , error estimates, and weak, strong and more regular a priori estimates of the scheme.
Revised:  For this nonlinear scheme, we study some properties like solvability, a priori estimates, convergence towards weak solutions , error estimates, and weak, strong and more regular a priori estimates of the scheme.
Edit intent: fluency
Original:  Additionally , we propose two different linear iterative methods to approach the nonlinear scheme: an energy-stable Picard 's method and the Newton's method.
Revised:  Additionally , we propose two linear iterative methods to approach the nonlinear scheme: an energy-stable Picard 's method and the Newton's method.
Edit intent: clarity
Original:  Additionally , we propose two different linear iterative methods to approach the nonlinear scheme: an energy-stable Picard 's method and the Newton's method.
Revised:  Additionally , we propose two different linear iterative methods to approach the nonlinear scheme: an energy-stable Picard method and Newton's method.
Edit intent: fluency
Original:  We prove solvability and convergence of both methods to the nonlinear scheme.
Revised:  We prove solvability and convergence of both methods towards the nonlinear scheme.
Edit intent: fluency
Original:  Finally, we provide some numerical results in agreement with our theoretical analysis about the error estimates.
Revised:  Finally, we provide some numerical results in agreement with our theoretical analysis with respect to the error estimates.
Edit intent: clarity
Original:  Here we develop a general method for making estimates of network structure and properties from any form of network data, simple or complex, when the data are unreliable, and give example applications to a selection of social and biological networks.
Revised:  Here we develop a general method for making estimates of network structure and properties using any form of network data, simple or complex, when the data are unreliable, and give example applications to a selection of social and biological networks.
Edit intent: clarity
Original:  Further, we applied the CLT to develop an `uncertainty relation' for Impact Factors, which provides an upper (f_{max{\it   by analyzing the complete set of 166,498 journals  in the 1997--2016 Journal Citation Reports (JCR) of Clarivate Analytics, the top-cited portion of 345,177 papers published in 2014--2015 in physics , as well as the citation distributions of an arbitrarily sampled list of  journals.
Revised:  Further, we applied the CLT to arrive at the{\it by analyzing the complete set of 166,498 journals in the 1997--2016 Journal Citation Reports (JCR) of Clarivate Analytics, the top-cited portion of 345,177 papers published in 2014--2015 in physics , as well as the citation distributions of an arbitrarily sampled list of journals.
Edit intent: clarity
Original:  Further, we applied the CLT to develop an `uncertainty relation' for Impact Factors, which provides an upper (f_{max{\it   by analyzing the complete set of 166,498 journals  in the 1997--2016 Journal Citation Reports (JCR) of Clarivate Analytics, the top-cited portion of 345,177 papers published in 2014--2015 in physics , as well as the citation distributions of an arbitrarily sampled list of  journals.
Revised:  Further, we applied the CLT to develop an `uncertainty relation' for Impact Factors, which provides an upper (f_{max{\it by analyzing the complete set of 166,498 journals listed in the 1997--2016 Journal Citation Reports (JCR) of Clarivate Analytics, the top-cited portion of 345,177 papers published in 2014--2015 in physics , as well as the citation distributions of an arbitrarily sampled list of journals.
Edit intent: clarity
Original:  Further, we applied the CLT to develop an `uncertainty relation' for Impact Factors, which provides an upper (f_{max{\it   by analyzing the complete set of 166,498 journals  in the 1997--2016 Journal Citation Reports (JCR) of Clarivate Analytics, the top-cited portion of 345,177 papers published in 2014--2015 in physics , as well as the citation distributions of an arbitrarily sampled list of  journals.
Revised:  Further, we applied the CLT to develop an `uncertainty relation' for Impact Factors, which provides an upper (f_{max{\it by analyzing the complete set of 166,498 journals in the 1997--2016 Journal Citation Reports of Clarivate Analytics, the top-cited portion of 345,177 papers published in 2014--2015 in physics , as well as the citation distributions of an arbitrarily sampled list of journals.
Edit intent: clarity
Original:  Further, we applied the CLT to develop an `uncertainty relation' for Impact Factors, which provides an upper (f_{max{\it   by analyzing the complete set of 166,498 journals  in the 1997--2016 Journal Citation Reports (JCR) of Clarivate Analytics, the top-cited portion of 345,177 papers published in 2014--2015 in physics , as well as the citation distributions of an arbitrarily sampled list of  journals.
Revised:  Further, we applied the CLT to develop an `uncertainty relation' for Impact Factors, which provides an upper (f_{max{\it by analyzing the complete set of 166,498 journals in the 1997--2016 Journal Citation Reports (JCR) of Clarivate Analytics, the top-cited portion of 345,177 papers published in 2014--2015 in physics , as well as the citation distributions of an arbitrarily sampled list of physics journals.
Edit intent: fluency
Original:  Because the size-dependent effectsare strong , Impact Factor rankings can be misleading , unless one compares like-sized journals or adjusts for these effects  .
Revised:  Because the size-dependent effectsare strong , Impact Factor rankings are misleading unless one compares like-sized journals or adjusts for these effects .
Edit intent: clarity
Original:  Second, a scale-dependent stratification of journals is expected from the CLT in IF rankings, whereby small journals occupy the top, middle, %DIFDELCMD < {\it %%% and bottom ranks;
Revised:  Second, a scale-dependent stratification of journals in IF rankings, whereby small journals occupy the top, middle, %DIFDELCMD < {\it %%% and bottom ranks;
Edit intent: coherence
Original:  Second, a scale-dependent stratification of journals is expected from the CLT in IF rankings, whereby small journals occupy the top, middle, %DIFDELCMD < {\it %%% and bottom ranks;
Revised:  Second, a scale-dependent stratification of journals is expected from the CLT in IF rankings, whereby small journals occupy top, middle, %DIFDELCMD < {\it %%% and bottom ranks;
Edit intent: fluency
Original:  Second, a scale-dependent stratification of journals is expected from the CLT in IF rankings, whereby small journals occupy the top, middle, %DIFDELCMD < {\it %%% and bottom ranks;
Revised:  Second, a scale-dependent stratification of journals is expected from the CLT in IF rankings, whereby small journals occupy the top, middle, %DIFDELCMD < {\it %%% and bottom ranks;
Edit intent: fluency
Original:  mid-sized journals occupy the middle ranks;
Revised:  mid-sized journals occupy middle ranks;
Edit intent: fluency
Original:  Third, we apply the CLT to arrive at the%DIFDELCMD < {\it %%% `Impact Factor uncertainty relation,' a mathematical expression for the range of IF values expected at a given journal size.
Revised:  Third, we apply the CLT to arrive at the%DIFDELCMD < {\it %%% a mathematical expression for the range of IF values expected at a given journal size.
Edit intent: clarity
Original:  We have also used the Impact Factor uncertainty relation to explain the individual IF variations from year to year for the%DIFDELCMD < \sim13%%% ,000 unique journals in the 1997--2016 period.
Revised:  We %DIFDELCMD < \sim13%%% ,000 unique journals in the 1997--2016 period.
Edit intent: coherence
Original:  We conclude that the CLT---via the Impact Factor uncertainty relation---is a good predictor of the range of IF values observed in actual journals, while sustained deviations from the expected IF range is a mark of true, i.e., non-random, citation impact.
Revised:  We conclude that the CLT is a good predictor of the range of IF values observed in actual journals, while sustained deviations from the expected IF range is a mark of true, i.e., non-random, citation impact.
Edit intent: clarity
Original:  We conclude that the CLT---via the Impact Factor uncertainty relation---is a good predictor of the range of IF values observed in actual journals, while sustained deviations from the expected IF range is a mark of true, i.e., non-random, citation impact.
Revised:  We conclude that the CLT---via the Impact Factor uncertainty relation---is a good predictor of the IF range of actual journals, while sustained deviations from the expected IF range is a mark of true, i.e., non-random, citation impact.
Edit intent: clarity
Original:  We conclude that the CLT---via the Impact Factor uncertainty relation---is a good predictor of the range of IF values observed in actual journals, while sustained deviations from the expected IF range is a mark of true, i.e., non-random, citation impact.
Revised:  We conclude that the CLT---via the Impact Factor uncertainty relation---is a good predictor of the range of IF values observed in actual journals, while sustained deviations from its predictions are a mark of true, i.e., non-random, citation impact.
Edit intent: clarity
Original:  We conclude that the CLT---via the Impact Factor uncertainty relation---is a good predictor of the range of IF values observed in actual journals, while sustained deviations from the expected IF range is a mark of true, i.e., non-random, citation impact.
Revised:  We conclude that the CLT---via the Impact Factor uncertainty relation---is a good predictor of the range of IF values observed in actual journals, while sustained deviations from the expected IF range is a mark of true, non-random, citation impact.
Edit intent: coherence
Original:  Due to the strength of scale dependent effects, Impact Factor rankings are misleading unless one compares like-sized journals or adjusts for these effects , and we suggest one way to do that here .
Revised:  IF rankings are thus misleading unless one compares like-sized journals or adjusts for these effects , and we suggest one way to do that here .
Edit intent: clarity
Original: The GM-MDS conjecture of Dau et al. (ISIT 2014) speculates that the MDS condition , which guarantees the existence of MDS matrices with a prescribed set of zeros over large fields, is in fact sufficient for existence of such matrices over small fields.
Revised: The GM-MDS conjecture of Dau et al. (ISIT 2014) conjectured that the MDS condition , which guarantees the existence of MDS matrices with a prescribed set of zeros over large fields, is in fact sufficient for existence of such matrices over small fields.
Edit intent: clarity
Original:  This type of optimization problems is characterized by a constraint ofinfinity -dimension, that is, the derivatives of the decision quantile functions are bounded.
Revised:  This type of optimization problems is characterized by a constraint of -dimension, that is, the derivatives of the decision quantile functions are bounded.
Edit intent: clarity
Original:  Xu et al. (2019) investigated the same problem, but took the incentive compatibility%DIFDELCMD < } %%% constraint into consideration to avoid that moral hazard.
Revised:  Xu et al. (2019) investigated the same problem, but took the %DIFDELCMD < } %%% constraint into consideration to avoid that moral hazard.
Edit intent: clarity
Original: We show that the Ising distribution can be treated as a latent variable model, where a set of N real-valued, correlated random variables are drawn and used to generate N binary spins independently.
Revised: It is shown that the Ising distribution can be treated as a latent variable model, where a set of N real-valued, correlated random variables are drawn and used to generate N binary spins independently.
Edit intent: clarity
Original:  The rules of such games are simply given by a list L of positive integers corresponding to the number of sub-heaps that a heap must be split into .
Revised:  The rules of such games are simply given by a set of positive integers corresponding to the number of sub-heaps that a heap must be split into .
Edit intent: clarity
Original:  The rules of such games are simply given by a list L of positive integers corresponding to the number of sub-heaps that a heap must be split into .
Revised:  The rules of such games are simply given by a list L of positive integers , which specifies the number of sub-heaps that a heap must be split into .
Edit intent: clarity
Original:  The data at each stage of a pipeline is stored using a fixed-point data type ( \alpha ,%DIFDELCMD < {%%% \beta ) where%DIFDELCMD < {%%% \alpha and%DIFDELCMD < {%%% \beta denote the number of integral and fractional bits.
Revised:  The data at each stage of a pipeline is stored using a fixed-point data type ( ,%DIFDELCMD < {%%% \beta ) where%DIFDELCMD < {%%% \alpha and%DIFDELCMD < {%%% \beta denote the number of integral and fractional bits.
Edit intent: fluency
Original:  The data at each stage of a pipeline is stored using a fixed-point data type ( \alpha ,%DIFDELCMD < {%%% \beta ) where%DIFDELCMD < {%%% \alpha and%DIFDELCMD < {%%% \beta denote the number of integral and fractional bits.
Revised:  The data at each stage of a pipeline is stored using a fixed-point data type ( \alpha %DIFDELCMD < {%%% \beta ) where%DIFDELCMD < {%%% \alpha and%DIFDELCMD < {%%% \beta denote the number of integral and fractional bits.
Edit intent: fluency
Original:  The data at each stage of a pipeline is stored using a fixed-point data type ( \alpha ,%DIFDELCMD < {%%% \beta ) where%DIFDELCMD < {%%% \alpha and%DIFDELCMD < {%%% \beta denote the number of integral and fractional bits.
Revised:  The data at each stage of a pipeline is stored using a fixed-point data type ( \alpha ,%DIFDELCMD < {%%% ) where%DIFDELCMD < {%%% \alpha and%DIFDELCMD < {%%% \beta denote the number of integral and fractional bits.
Edit intent: fluency
Original:  The data at each stage of a pipeline is stored using a fixed-point data type ( \alpha ,%DIFDELCMD < {%%% \beta ) where%DIFDELCMD < {%%% \alpha and%DIFDELCMD < {%%% \beta denote the number of integral and fractional bits.
Revised:  The data at each stage of a pipeline is stored using a fixed-point data type ( \alpha ,%DIFDELCMD < {%%% \beta %DIFDELCMD < {%%% \alpha and%DIFDELCMD < {%%% \beta denote the number of integral and fractional bits.
Edit intent: coherence
Original:  The data at each stage of a pipeline is stored using a fixed-point data type ( \alpha ,%DIFDELCMD < {%%% \beta ) where%DIFDELCMD < {%%% \alpha and%DIFDELCMD < {%%% \beta denote the number of integral and fractional bits.
Revised:  The data at each stage of a pipeline is stored using a fixed-point data type ( \alpha ,%DIFDELCMD < {%%% \beta ) where%DIFDELCMD < {%%% and%DIFDELCMD < {%%% \beta denote the number of integral and fractional bits.
Edit intent: fluency
Original:  The data at each stage of a pipeline is stored using a fixed-point data type ( \alpha ,%DIFDELCMD < {%%% \beta ) where%DIFDELCMD < {%%% \alpha and%DIFDELCMD < {%%% \beta denote the number of integral and fractional bits.
Revised:  The data at each stage of a pipeline is stored using a fixed-point data type ( \alpha ,%DIFDELCMD < {%%% \beta ) where%DIFDELCMD < {%%% \alpha %DIFDELCMD < {%%% \beta denote the number of integral and fractional bits.
Edit intent: coherence
Original:  Thirdly, for estimating fractional bit requirements ( \beta -analysis ), we propose a simple and practical heuristic search algorithm, which makes very few profile passes, as against techniques such as simulated annealing proposed in prior work.
Revised:  Thirdly, for estimating fractional bit requirements ( -analysis ), we propose a simple and practical heuristic search algorithm, which makes very few profile passes, as against techniques such as simulated annealing proposed in prior work.
Edit intent: coherence
Original:  Secondly, we propose a novel compilation framework in which any range analysis algorithm, be it intervalor affine arithmetic , can be deployed with ease .
Revised:  Secondly, we propose a software architecture for easily deploying any kind of interval/affine arithmetic based range analyses in the DSL compiler .
Edit intent: clarity
Original:  Thirdly, for estimating fractional bit requirements (beta-analysis), we propose a simple and practical heuristic search algorithm, which makes very few profile passes, as against techniques such as simulated annealing proposed in prior work.
Revised:  Thirdly, we propose a simple and practical heuristic search algorithm, which makes very few profile passes, as against techniques such as simulated annealing proposed in prior work.
Edit intent: coherence
Original: We evaluated our bit-width analysis algorithms on four image processing benchmarks with regard to quality, power and area metrics.
Revised: We evaluated our bitwidth analysis algorithms on four image processing benchmarks with regard to quality, power and area metrics.
Edit intent: fluency
Original: The shape of an electoral district may suggest whether it was drawn with political motivations , or gerrymandered.
Revised: Political districts may be drawn to favor one group or political party over another , or gerrymandered.
Edit intent: clarity
Original:  This complicates using compactness as a legislative or judicial standard to counteract unfair redistricting practices.
Revised:  This complicates using compactness as a legislative or judicial standards to counteract unfair redistricting practices.
Edit intent: fluency
Original:  This paper accompanies the release of packages in C++, Python, and R which correctly, efficiently, and reproducibly calculate a variety of compactness scores.
Revised:  This paper accompanies the release of packages in C++, Python, and R that correctly, efficiently, and reproducibly calculate a variety of compactness scores.
Edit intent: fluency
Original:  We uncover variations of country- and transaction-based nestedness over time, and identify the countries and industries that most contributed to nestedness by assessing the effects of the removal of nodes and layers on the participation matrices .
Revised:  We uncover variations of country- and transaction-based nestedness over time, and identify the countries and industries that most contributed to nestedness .
Edit intent: clarity
Original:  Our method is applicable in public health domains where efficient identification of pathogens is paramount, such as the monitoring of disease outbreaks.
Revised:  Our method is applicable in public health domains where efficient identification of pathogens is paramount, e.g., for the monitoring of disease outbreaks.
Edit intent: clarity
Original:  The problem has similar structure to blind deconvolution, except binary constraints are present in the formulation and enforced in our approach.
Revised:  The problem at hand has a similar structure to blind deconvolution, except binary constraints are present in the formulation and enforced in our approach.
Edit intent: clarity