wanyu/IteraTeR_full_sent huggingface dataset:
Original:  b ) a fundamental component proportional to the log earnings over price ratio at time zero  , from which the actual stock price may deviate as an effect of random external disturbances, and c ) a driving component ensuring the diffusive behaviour of stock prices.
Revised:  b ) a fundamental component proportional to the logarithmic CAPE at time zero , from which the actual stock price may deviate as an effect of random external disturbances, and c ) a driving component ensuring the diffusive behaviour of stock prices.
Edit intent: meaning-changed
Original:  b ) a fundamental component proportional to the log earnings over price ratio at time zero  , from which the actual stock price may deviate as an effect of random external disturbances, and c ) a driving component ensuring the diffusive behaviour of stock prices.
Revised:  b ) a fundamental component proportional to the log earnings over price ratio at time zero . The initial value of the ratio determines the reference growth level , from which the actual stock price may deviate as an effect of random external disturbances, and c ) a driving component ensuring the diffusive behaviour of stock prices.
Edit intent: meaning-changed
Original:  b ) a fundamental component proportional to the log earnings over price ratio at time zero  , from which the actual stock price may deviate as an effect of random external disturbances, and c ) a driving component ensuring the diffusive behaviour of stock prices.
Revised:  b ) a fundamental component proportional to the log earnings over price ratio at time zero , from which the actual stock price may deviate as an effect of random external disturbances, and iii ) a driving component ensuring the diffusive behaviour of stock prices.
Edit intent: meaning-changed
Original:  b ) a fundamental component proportional to the log earnings over price ratio at time zero  , from which the actual stock price may deviate as an effect of random external disturbances, and c ) a driving component ensuring the diffusive behaviour of stock prices.
Revised:  b ) a fundamental component proportional to the log earnings over price ratio at time zero , from which the actual stock price may deviate as an effect of random external disturbances, and c ) a driving component which ensures the diffusive behaviour of stock prices.
Edit intent: coherence
Original:  Under these assumptions, we are able to prove that , if we consider a sufficiently large number of periods, the expected rate of return and the expected gross return are linear in the initial time value of the log earnings over price ratio , and their variance goes to zero with  rate of convergence equal to minus one .
Revised:  Under these assumptions, we prove that for a sufficiently large number of periods, the expected rate of return and the expected gross return are linear in the initial time value of the log earnings over price ratio , and their variance goes to zero with rate of convergence equal to minus one .
Edit intent: clarity
Original:  Under these assumptions, we are able to prove that , if we consider a sufficiently large number of periods, the expected rate of return and the expected gross return are linear in the initial time value of the log earnings over price ratio , and their variance goes to zero with  rate of convergence equal to minus one .
Revised:  Under these assumptions, we are able to prove that , if we consider a sufficiently large horizon the expected rate of return and the expected gross return are linear in the initial time value of the log earnings over price ratio , and their variance goes to zero with rate of convergence equal to minus one .
Edit intent: clarity
Original:  Under these assumptions, we are able to prove that , if we consider a sufficiently large number of periods, the expected rate of return and the expected gross return are linear in the initial time value of the log earnings over price ratio , and their variance goes to zero with  rate of convergence equal to minus one .
Revised:  Under these assumptions, we are able to prove that , if we consider a sufficiently large number of periods, the expected rate of return and the expected gross return are linear in the initial logarithmic CAPE , and their variance goes to zero with rate of convergence equal to minus one .
Edit intent: clarity
Original:  Under these assumptions, we are able to prove that , if we consider a sufficiently large number of periods, the expected rate of return and the expected gross return are linear in the initial time value of the log earnings over price ratio , and their variance goes to zero with  rate of convergence equal to minus one .
Revised:  Under these assumptions, we are able to prove that , if we consider a sufficiently large number of periods, the expected rate of return and the expected gross return are linear in the initial time value of the log earnings over price ratio , and their variance goes to zero with a rate of convergence equal to minus one .
Edit intent: fluency
Original:  Under these assumptions, we are able to prove that , if we consider a sufficiently large number of periods, the expected rate of return and the expected gross return are linear in the initial time value of the log earnings over price ratio , and their variance goes to zero with  rate of convergence equal to minus one .
Revised:  Under these assumptions, we are able to prove that , if we consider a sufficiently large number of periods, the expected rate of return and the expected gross return are linear in the initial time value of the log earnings over price ratio , and their variance goes to zero with rate of convergence consistent with the diffusive behaviour. Eventually this means that the momentum component may generate bubbles and crashes in the short and medium run, nevertheless the valuation ratio remains a good reference point of future long-run returns .
Edit intent: meaning-changed
Original:  In  a recent study  , it was proposed to  consider simulations as made of dozens of sequences of eigenvalue problems , where each sequence groups together eigenproblems with equal {\bf k}-vectors and an increasing outer-iteration cycle index i.
Revised:  In contrast to real-space methods, eigenpairs solving for problems at distinct cycles have either been believed to be independent or at most very loosely connected. In a recent study , it was proposed to consider simulations as made of dozens of sequences of eigenvalue problems , where each sequence groups together eigenproblems with equal {\bf k}-vectors and an increasing outer-iteration cycle index i.
Edit intent: meaning-changed
Original:  In  a recent study  , it was proposed to  consider simulations as made of dozens of sequences of eigenvalue problems , where each sequence groups together eigenproblems with equal {\bf k}-vectors and an increasing outer-iteration cycle index i.
Revised:  In a recent study \mbox{%DIFAUXCMD DBB , it was proposed to consider simulations as made of dozens of sequences of eigenvalue problems , where each sequence groups together eigenproblems with equal {\bf k}-vectors and an increasing outer-iteration cycle index i.
Edit intent: meaning-changed
Original:  In  a recent study  , it was proposed to  consider simulations as made of dozens of sequences of eigenvalue problems , where each sequence groups together eigenproblems with equal {\bf k}-vectors and an increasing outer-iteration cycle index i.
Revised:  In a recent study , it was proposed to revert this point of view and consider simulations as made of dozens of sequences of eigenvalue problems , where each sequence groups together eigenproblems with equal {\bf k}-vectors and an increasing outer-iteration cycle index i.
Edit intent: meaning-changed
Original:  In  a recent study  , it was proposed to  consider simulations as made of dozens of sequences of eigenvalue problems , where each sequence groups together eigenproblems with equal {\bf k}-vectors and an increasing outer-iteration cycle index i.
Revised:  In a recent study , it was proposed to consider simulations as made of dozens of sequences of eigenvalue problems ; each sequence groups together eigenproblems with equal {\bf k}-vectors and an increasing outer-iteration cycle index i.
Edit intent: coherence
Original:  In  a recent study  , it was proposed to  consider simulations as made of dozens of sequences of eigenvalue problems , where each sequence groups together eigenproblems with equal {\bf k}-vectors and an increasing outer-iteration cycle index i. It was then demonstrated that successive eigenproblems in a sequence are strongly correlated to one another.
Revised:  In a recent study , it was proposed to consider simulations as made of dozens of sequences of eigenvalue problems , where each sequence groups together eigenproblems with equal {\bf k}-vectors and an increasing outer-iteration cycle index \ell. From this different standpoint it was possible to demonstrate that, contrary to belief, successive eigenproblems in a sequence are strongly correlated to one another.
Edit intent: meaning-changed
Original:  In particular, by tracking the evolution of subspace angles between eigenvectors of successive eigenproblems, it was shown that these angles decrease noticeably after the first few iterations and become close to collinear  .
Revised:  In particular, by tracking the evolution of subspace angles between eigenvectors of successive eigenproblems, it was shown that these angles decrease noticeably after the first few iterations and become close to collinear : the closer to convergence the stronger the correlation becomes .
Edit intent: meaning-changed
Original:  In the present work we present a set of preliminary results confirming this initial intuition. We provide numerical examples where opportunely selected block iterative solvers benefit from the reuse of eigenvectors by achieving a substantial speed-up.
Revised:  In the present work we present results that are in line with this intuition. First, we provide numerical examples where opportunely selected block iterative solvers benefit from the reuse of eigenvectors by achieving a substantial speed-up.
Edit intent: clarity
Original:  This study systematically reveals the general roles of miRNAs in mouse pluripotent stem cells by analyzing a physical interaction network constructed from miRNA and protein binding data generated by next-generation sequencing .
Revised:  This study systematically reveals the functional and mechanistic roles of miRNAs in mouse pluripotent stem cells by analyzing a physical interaction network constructed from miRNA and protein binding data generated by next-generation sequencing .
Edit intent: clarity
Original:  During pluripotency , miRNAs primarily repress developmental processes while they inhibit metabolism in the differential state. Interestingly, in the pluripotent state, miRNAs do not directly regulate the pluripotent core activities but mediate extrinsic signal pathways associated with the pluripotency;
Revised:  During pluripotency , miRNAs primarily repress developmental processes , but surprisingly miRNAs do not directly regulate the pluripotent core activities but mediate extrinsic signal pathways associated with the pluripotency;
Edit intent: coherence
Original:  Interestingly, in the pluripotent state, miRNAs do not directly regulate the pluripotent core activities but mediate extrinsic signal pathways associated with the pluripotency;
Revised:  Interestingly, in the pluripotent state, miRNAs do not directly target the pluripotent core activities but mediate extrinsic signal pathways associated with the pluripotency;
Edit intent: clarity
Original:  Interestingly, in the pluripotent state, miRNAs do not directly regulate the pluripotent core activities but mediate extrinsic signal pathways associated with the pluripotency;
Revised:  Interestingly, in the pluripotent state, miRNAs do not directly regulate the pluripotent core factors but only mediate extrinsic signal pathways associated with the pluripotency;
Edit intent: clarity
Original:  Interestingly, in the pluripotent state, miRNAs do not directly regulate the pluripotent core activities but mediate extrinsic signal pathways associated with the pluripotency; however in the differential state, miRNAs directly repress the pluripotency.
Revised:  Interestingly, in the pluripotent state, miRNAs do not directly regulate the pluripotent core activities but mediate extrinsic signal pathways associated with pluripotency. During differentiation miRNAs mechanistically inhibit metabolism and directly repress the pluripotency.
Edit intent: meaning-changed
Original:  Together, under mediation by DNA methylation, miRNAs directly repress development but only modulate the pluripotent signal pathways in the pluripotent state; while in the developmental state miRNAs directly suppress both metabolism and pluripotency .
Revised:  Together, under mediation by DNA methylation, miRNAs directly repress development but only modulate the pluripotent signal pathways to help stem cells maintain pluripotency; yet miRNAs directly repress both pluripotency and metabolism to facilitate cell differentiation .
Edit intent: clarity
Original:  While a recently developed scheduling policy, called Delay Weighted Matching (DWM) , has been shown to be \log n) complexity hybrid scheduling policies are recently developed to guarantee } both rate-function delay-optimal (in the many-channel many-user asymptotic regime) and throughput-optimal (in general non-asymptotic setting), it has a high complexity O(n^5), which makes it impractical for modern OFDM systems .
Revised:  While a class of O(n^{2.5 \log n) complexity hybrid scheduling policies are recently developed to guarantee } both rate-function delay-optimal (in the many-channel many-user asymptotic regime) and throughput-optimal (in general non-asymptotic setting), it has a high complexity O(n^5), which makes it impractical for modern OFDM systems .
Edit intent: meaning-changed
Original:  While a recently developed scheduling policy, called Delay Weighted Matching (DWM) , has been shown to be \log n) complexity hybrid scheduling policies are recently developed to guarantee } both rate-function delay-optimal (in the many-channel many-user asymptotic regime) and throughput-optimal (in general non-asymptotic setting), it has a high complexity O(n^5), which makes it impractical for modern OFDM systems .
Revised:  While a recently developed scheduling policy, called Delay Weighted Matching (DWM) , has been shown to be \log n) complexity hybrid scheduling policies are recently developed to guarantee } both rate-function delay optimality (in the many-channel many-user asymptotic regime) and throughput-optimal (in general non-asymptotic setting), it has a high complexity O(n^5), which makes it impractical for modern OFDM systems .
Edit intent: clarity
Original:  While a recently developed scheduling policy, called Delay Weighted Matching (DWM) , has been shown to be \log n) complexity hybrid scheduling policies are recently developed to guarantee } both rate-function delay-optimal (in the many-channel many-user asymptotic regime) and throughput-optimal (in general non-asymptotic setting), it has a high complexity O(n^5), which makes it impractical for modern OFDM systems .
Revised:  While a recently developed scheduling policy, called Delay Weighted Matching (DWM) , has been shown to be \log n) complexity hybrid scheduling policies are recently developed to guarantee } both rate-function delay-optimal (in the many-channel many-user asymptotic regime) and throughput optimality (in general non-asymptotic setting), it has a high complexity O(n^5), which makes it impractical for modern OFDM systems .
Edit intent: clarity
Original:  While a recently developed scheduling policy, called Delay Weighted Matching (DWM) , has been shown to be \log n) complexity hybrid scheduling policies are recently developed to guarantee } both rate-function delay-optimal (in the many-channel many-user asymptotic regime) and throughput-optimal (in general non-asymptotic setting), it has a high complexity O(n^5), which makes it impractical for modern OFDM systems .
Revised:  While a recently developed scheduling policy, called Delay Weighted Matching (DWM) , has been shown to be \log n) complexity hybrid scheduling policies are recently developed to guarantee } both rate-function delay-optimal (in the many-channel many-user asymptotic regime) and throughput-optimal (in general non-asymptotic setting), their practical complexity is typically high .
Edit intent: clarity
Original:  To address this issue, we first develop a simple greedy policy called Delay-based Queue-Side-Greedy (D-QSG ) with a lower complexity O(n ^3 ), and rigorously prove that D-QSG not only achieves throughput optimality, but also guarantees near-optimal rate-function-based delay performance.
Revised:  To address this issue, we develop a simple greedy policy called Delay-based Queue-Side-Greedy (D-QSG ) with a lower complexity O(n ^3 ), and rigorously prove that D-QSG not only achieves throughput optimality, but also guarantees near-optimal rate-function-based delay performance.
Edit intent: coherence
Original:  To address this issue, we first develop a simple greedy policy called Delay-based Queue-Side-Greedy (D-QSG ) with a lower complexity O(n ^3 ), and rigorously prove that D-QSG not only achieves throughput optimality, but also guarantees near-optimal rate-function-based delay performance.
Revised:  To address this issue, we first develop a simple greedy policy called Delay-based Server-Side-Greedy (D-SSG ) with a lower complexity O(n ^3 ), and rigorously prove that D-QSG not only achieves throughput optimality, but also guarantees near-optimal rate-function-based delay performance.
Edit intent: meaning-changed
Original:  To address this issue, we first develop a simple greedy policy called Delay-based Queue-Side-Greedy (D-QSG ) with a lower complexity O(n ^3 ), and rigorously prove that D-QSG not only achieves throughput optimality, but also guarantees near-optimal rate-function-based delay performance.
Revised:  To address this issue, we first develop a simple greedy policy called Delay-based Queue-Side-Greedy (D-QSG ) with a lower complexity O(n ^2 ), and rigorously prove that D-QSG not only achieves throughput optimality, but also guarantees near-optimal rate-function-based delay performance.
Edit intent: meaning-changed
Original:  To address this issue, we first develop a simple greedy policy called Delay-based Queue-Side-Greedy (D-QSG ) with a lower complexity O(n ^3 ), and rigorously prove that D-QSG not only achieves throughput optimality, but also guarantees near-optimal rate-function-based delay performance.
Revised:  To address this issue, we first develop a simple greedy policy called Delay-based Queue-Side-Greedy (D-QSG ) with a lower complexity O(n ^3 ), and rigorously prove that D-SSG not only achieves throughput optimality, but also guarantees near-optimal rate-function-based delay performance.
Edit intent: clarity
Original:  Specifically, the rate-function attained by D-QSG for any fixed integer threshold b>0, is no smaller than the maximum achievable rate-function by any scheduling policy for threshold b-1.
Revised:  Specifically, the rate-function attained by D-SSG for any fixed integer threshold b>0, is no smaller than the maximum achievable rate-function by any scheduling policy for threshold b-1.
Edit intent: meaning-changed
Original:  Further, we develop another simple greedy policy called Delay-based Server-Side-Greedy (D-SSG) with an even lower complexity O(n^2), and show that D-SSG achieves the same performance as D-QSG. Thus, we are able to achieve a dramatic reduction in complexity (from O(n ^5) of DWM \log n) of the hybrid policies } to O(n^2)) with a minimal drop in the delay performance.
Revised:  Thus, we are able to achieve a dramatic reduction in complexity (from O(n ^5) of DWM \log n) of the hybrid policies } to O(n^2)) with a minimal drop in the delay performance.
Edit intent: coherence
Original:  Further, we develop another simple greedy policy called Delay-based Server-Side-Greedy (D-SSG) with an even lower complexity O(n^2), and show that D-SSG achieves the same performance as D-QSG. Thus, we are able to achieve a dramatic reduction in complexity (from O(n ^5) of DWM \log n) of the hybrid policies } to O(n^2)) with a minimal drop in the delay performance.
Revised:  Further, we develop another simple greedy policy called Delay-based Server-Side-Greedy (D-SSG) with an even lower complexity O(n^2), and show that D-SSG achieves the same performance as D-QSG. Thus, we are able to achieve a reduction in complexity (from O(n ^5) of DWM \log n) of the hybrid policies } to O(n^2)) with a minimal drop in the delay performance.
Edit intent: clarity
Original:  Further, we develop another simple greedy policy called Delay-based Server-Side-Greedy (D-SSG) with an even lower complexity O(n^2), and show that D-SSG achieves the same performance as D-QSG. Thus, we are able to achieve a dramatic reduction in complexity (from O(n ^5) of DWM \log n) of the hybrid policies } to O(n^2)) with a minimal drop in the delay performance.
Revised:  Further, we develop another simple greedy policy called Delay-based Server-Side-Greedy (D-SSG) with an even lower complexity O(n^2), and show that D-SSG achieves the same performance as D-QSG. Thus, we are able to achieve a dramatic reduction in complexity (from O(n ^{2.5 \log n) of the hybrid policies } to O(n^2)) with a minimal drop in the delay performance.
Edit intent: meaning-changed
Original:  Here we analyze the Dutch interbank network over the period 1998-2008, ending with the global crisis. We find that many topological properties, after controlling for overall densityeffects, display an abrupt change in 2008, thus providing a clear but unpredictable signature of the crisis.
Revised:  Here we analyze the Dutch interbank network over the period 1998-2008, ending with the crisis. After controlling for the link density, many topological properties display an abrupt change in 2008, thus providing a clear but unpredictable signature of the crisis.
Edit intent: clarity
Original:  By contrast, if the intrinsic heterogeneity of banks  is controlled for, the same properties undergo a slow and continuous transition , gradually connecting the crisisperiod to a much earlier stationary phase.
Revised:  By contrast, if the intrinsic heterogeneity of banks ' connectivity is controlled for, the same properties undergo a slow and continuous transition , gradually connecting the crisisperiod to a much earlier stationary phase.
Edit intent: clarity
Original:  By contrast, if the intrinsic heterogeneity of banks  is controlled for, the same properties undergo a slow and continuous transition , gradually connecting the crisisperiod to a much earlier stationary phase. This early-warning signal begins in 2005 , and is preceded by an even earlier period of "risk autocatalysis" characterized by anomalous debt loops .
Revised:  By contrast, if the intrinsic heterogeneity of banks is controlled for, the same properties show a gradual transition to the crisis, starting in 2005 , and is preceded by an even earlier period of "risk autocatalysis" characterized by anomalous debt loops .
Edit intent: clarity
Original:  This early-warning signal begins in 2005 , and is preceded by an even earlier period of "risk autocatalysis" characterized by anomalous debt loops . These remarkable precursors are undetectable if the network is reconstructed from partial bank-specific information .
Revised:  This early-warning signal begins in 2005 , and is preceded by an even earlier period of "risk autocatalysis" characterized by anomalous debt loops presumably favored the underestimation of counter-party risk. These early-warning signals are undetectable if the network is reconstructed from partial bank-specific information .
Edit intent: meaning-changed