wanyu/IteraTeR_full_sent huggingface dataset:
Original: We consider the problem of constructing a physical system whose evolution implements some specified stochastic matrix. We restrict attention to physical systemswhose dynamics can be modeled with a time-inhomogeneous master equation over a finite state space, which includes many of the systems considered in stochastic thermodynamics. It is known that many stochastic matrices cannot be implemented by any master equation, even approximately.
Revised: Master equations are commonly used to model the dynamics of physical systems. Surprisingly, many deterministic maps x \rightarrow f(x) cannot be implemented by any master equation, even approximately.
Edit intent: clarity
Original:  This raises the question of how they can arise in the real world. Here we investigate this question for the special case where the stochastic matrix being implemented is a (single-valued) function f. Examples range from logical gates in digital circuits to the (partial) function evaluated by an entire digital computer. As we show , any function f over a set of "visible" states X can be implemented--if the master equation implementing f has access to some additional "hidden" states not in X.
Revised:  This raises the question of how they arise in real-world systems like digital computers. We show that any deterministic map over some "visible" states X can be implemented--if the master equation implementing f has access to some additional "hidden" states not in X.
Edit intent: clarity
Original:  As we show , any function f over a set of "visible" states X can be implemented--if the master equation implementing f has access to some additional "hidden" states not in X. Motivated by engineering considerations, we then consider a natural decomposition of any master equation that implements a given function into a sequence of "hidden" timesteps, demarcated by changes in the set of allowed transitions between states.
Revised:  As we show , any function f over a set of "visible" states X can be implemented--if the master equation implementing f has access to some additional "hidden" states are dynamically coupled to those visible states. We also show that any master equation that implements a given function into a sequence of "hidden" timesteps, demarcated by changes in the set of allowed transitions between states.
Edit intent: meaning-changed
Original:  Motivated by engineering considerations, we then consider a natural decomposition of any master equation that implements a given function into a sequence of "hidden" timesteps, demarcated by changes in the set of allowed transitions between states.
Revised:  Motivated by engineering considerations, we then consider a natural decomposition of any master equation implementing a given map can be decomposed into a sequence of "hidden" timesteps, demarcated by changes in the set of allowed transitions between states.
Edit intent: clarity
Original:  Motivated by engineering considerations, we then consider a natural decomposition of any master equation that implements a given function into a sequence of "hidden" timesteps, demarcated by changes in the set of allowed transitions between states. We demonstrate a fundamental tradeoff between the number of hidden states and the number of hidden timesteps needed to implement any given f using master equation dynamics.
Revised:  Motivated by engineering considerations, we then consider a natural decomposition of any master equation that implements a given function into a sequence of "hidden" timesteps, demarcated by changes in what transitions are allowed under the rate matrix. Often there is a real-world cost for each additional hidden state, and for each additional hidden timestep. We derive the associated "space/time" tradeoff between the number of hidden states and the number of hidden timesteps needed to implement any given f using master equation dynamics.
Edit intent: meaning-changed
Original:  We demonstrate a fundamental tradeoff between the number of hidden states and the number of hidden timesteps needed to implement any given f using master equation dynamics. These tradeoffs are analogous to space / time tradeoffs in theoretical computer science. They can also be viewed as a type of resource theory, applying to master equation models of physical systems rather than quantum computation .
Revised:  We demonstrate a fundamental tradeoff between the number of hidden states and the number of hidden timesteps needed to implement any given f (x) .
Edit intent: clarity
Original: Master equations are commonly used to model the dynamics of physical systems . Surprisingly, many deterministic maps x \rightarrow f(x) cannot be implemented by any master equation, even approximately . This raises the question of how they arise in real-world systems like digital computers.
Revised: Master equations are commonly used to model the dynamics of physical systems . Surprisingly, many deterministic maps x \rightarrow f(x) cannot be implemented by any master equation, even approximately , which raises the question of how they arise in real-world systems like digital computers.
Edit intent: coherence
Original:  This raises the question of how they arise in real-world systems like digital computers. We show that any deterministic map over some "visible" states can be implemented with a master equation--but only if additional "hidden" states are dynamically coupled to those visible states .
Revised:  This raises the question of how they can occur in the real world. Here we show how any function over some "visible" states can be implemented with a master equation--but only if additional "hidden" states are dynamically coupled to those visible states .
Edit intent: clarity
Original:  We also show that any master equation implementing a given map can be decomposed into a sequence of "hidden" timesteps, demarcated by changes in what transitions are allowed under the rate matrix. Often there is a real-world cost for each additional hidden state, and for each additional hidden timestep.
Revised:  We also show that any master equation implementing a given map can be decomposed into a sequence of "hidden" timesteps, demarcated by changes in what state-to-state transitions have nonzero probability. In many real-world situations there is a real-world cost for each additional hidden state, and for each additional hidden timestep.
Edit intent: meaning-changed
Original:  Often there is a real-world cost for each additional hidden state, and for each additional hidden timestep. We derive the associated " space/time " tradeoff between the numbers of hidden states and  of hidden timesteps needed to implement any given f(x) .
Revised:  Often there is a cost both for more hidden states and for more hidden timesteps. Accordingly, we derive a " space/time " tradeoff between the numbers of hidden states and of hidden timesteps needed to implement any given f(x) .
Edit intent: clarity
Original:  Thus, a population pharmacokinetic ( i.e., mixed-effects stochastic differential equation ) model was developed and fitted to densely sampled salivary cortisol data of 10 males from Montreal, Canada, and sparsely sampled data of 200 mixed-sex participants from Dresden, Germany, who completed the Trier Social Stress Test (TSST).
Revised:  Thus, a population pharmacokinetic ( mixed-effects stochastic differential equation ) model was developed and fitted to densely sampled salivary cortisol data of 10 males from Montreal, Canada, and sparsely sampled data of 200 mixed-sex participants from Dresden, Germany, who completed the Trier Social Stress Test (TSST).
Edit intent: coherence
Original:  Thus, a population pharmacokinetic ( i.e., mixed-effects stochastic differential equation ) model was developed and fitted to densely sampled salivary cortisol data of 10 males from Montreal, Canada, and sparsely sampled data of 200 mixed-sex participants from Dresden, Germany, who completed the Trier Social Stress Test (TSST).
Revised:  Thus, a population pharmacokinetic ( i.e., mixed-effects SDE ) model was developed and fitted to densely sampled salivary cortisol data of 10 males from Montreal, Canada, and sparsely sampled data of 200 mixed-sex participants from Dresden, Germany, who completed the Trier Social Stress Test (TSST).
Edit intent: clarity
Original:  Besides the two major process components representing (1) stress-related cortisol secretion (reactivity) and (2) cortisol elimination (recovery), the model incorporates two additional, often disregarded components: (3) the secretory delay after stress onset, and (4) deviations from the projected steady-state concentration due to stress-unrelated fluctuations of cortisol secretion .
Revised:  Besides the two major process components representing (1) stress-related cortisol secretion (reactivity) and (2) cortisol elimination (recovery), the model incorporates two additional, often disregarded components: (3) the secretory delay after stress onset, and (4) deviations from the projected steady-state concentration .
Edit intent: clarity
Original:  The fitted model (R2 = 99\%) was thereafter used to simulate 10,000 cortisol stress responses. Based on the correlation structure of the four individually varying, and readily interpretable model parameters and eleven popular non-compartmental parameters , recommendations for statistical analysis plans are derived .
Revised:  The fitted model (R2 = 99\%) was thereafter used to investigate the correlation structure of the four individually varying, and readily interpretable model parameters and eleven popular non-compartmental parameters , recommendations for statistical analysis plans are derived .
Edit intent: clarity
Original:  Based on the correlation structure of the four individually varying, and readily interpretable model parameters and eleven popular non-compartmental parameters , recommendations for statistical analysis plans are derived .
Revised:  Based on the correlation structure of the four individually varying, and readily interpretable model parameters and eleven popular non-compartmental parameters . Based on these analyses, we recommend to use the minimum-maximum cortisol difference and the minimum concentration as proxy measures of reactivity and recovery, respectively .
Edit intent: meaning-changed
Original:  Here, we propose the concept of a significant tie to statistically evaluate the strength of a relationship . Application of the proposed method to the Italian interbank networks reveals that the percentage of relationship lending among all bilateral trades is consistently around 20\%-30\% and that their trading properties are distinct from those of transactional trades .
Revised:  Here, we propose statistical tests to identify relationship lending as a significant tie to statistically evaluate the strength of a relationship . Application of the proposed method to the Italian interbank networks reveals that the percentage of relationship lending among all bilateral trades is consistently around 20\%-30\% and that their trading properties are distinct from those of transactional trades .
Edit intent: clarity
Original:  Here, we propose the concept of a significant tie to statistically evaluate the strength of a relationship . Application of the proposed method to the Italian interbank networks reveals that the percentage of relationship lending among all bilateral trades is consistently around 20\%-30\% and that their trading properties are distinct from those of transactional trades .
Revised:  Here, we propose the concept of a significant tie between banks . Application of the proposed method to the Italian interbank networks reveals that the percentage of relationship lending among all bilateral trades is consistently around 20\%-30\% and that their trading properties are distinct from those of transactional trades .
Edit intent: clarity
Original:  Here, we propose the concept of a significant tie to statistically evaluate the strength of a relationship . Application of the proposed method to the Italian interbank networks reveals that the percentage of relationship lending among all bilateral trades is consistently around 20\%-30\% and that their trading properties are distinct from those of transactional trades .
Revised:  Here, we propose the concept of a significant tie to statistically evaluate the strength of a relationship . Application of the proposed method to the Italian interbank networks reveals that the fraction of relationship lending among all bilateral trades is consistently around 20\%-30\% and that their trading properties are distinct from those of transactional trades .
Edit intent: clarity
Original:  Here, we propose the concept of a significant tie to statistically evaluate the strength of a relationship . Application of the proposed method to the Italian interbank networks reveals that the percentage of relationship lending among all bilateral trades is consistently around 20\%-30\% and that their trading properties are distinct from those of transactional trades .
Revised:  Here, we propose the concept of a significant tie to statistically evaluate the strength of a relationship . Application of the proposed method to the Italian interbank networks reveals that the percentage of relationship lending among all bilateral trades has been quite stable and that the relationship lenders tend to impose high interest rates at the time of financial distress .
Edit intent: meaning-changed
Original: Let G be a graph embedded in the plane and let A be an arrangement of pseudolines intersecting the drawing of G.  aligned drawing of G and A is a planar polyline drawing \Gamma of G with an arrangement A of lines so that \Gamma and A are homeomorphic to G and A.
Revised: Let G be a graph embedded in the plane and let A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and A is a planar polyline drawing \Gamma of G with an arrangement A of lines so that \Gamma and A are homeomorphic to G and A.
Edit intent: fluency
Original: Let G be a graph  embedded in the plane and let \mathcal{A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and \mathcal{A is a planar polyline drawing \Gamma of G with an arrangement A of lines so that \Gamma and A are homeomorphic to G and \mathcal{A .
Revised: Let G be a graph topological embedded in the plane and let \mathcal{A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and \mathcal{A is a planar polyline drawing \Gamma of G with an arrangement A of lines so that \Gamma and A are homeomorphic to G and \mathcal{A .
Edit intent: meaning-changed
Original: Let G be a graph  embedded in the plane and let \mathcal{A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and \mathcal{A is a planar polyline drawing \Gamma of G with an arrangement A of lines so that \Gamma and A are homeomorphic to G and \mathcal{A .
Revised: Let G be a graph embedded in the plane and let \mathcal A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and \mathcal{A is a planar polyline drawing \Gamma of G with an arrangement A of lines so that \Gamma and A are homeomorphic to G and \mathcal{A .
Edit intent: fluency
Original: Let G be a graph  embedded in the plane and let \mathcal{A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and \mathcal{A is a planar polyline drawing \Gamma of G with an arrangement A of lines so that \Gamma and A are homeomorphic to G and \mathcal{A .
Revised: Let G be a graph embedded in the plane and let \mathcal{A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and \mathcal A is a planar polyline drawing \Gamma of G with an arrangement A of lines so that \Gamma and A are homeomorphic to G and \mathcal{A .
Edit intent: fluency
Original: Let G be a graph  embedded in the plane and let \mathcal{A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and \mathcal{A is a planar polyline drawing \Gamma of G with an arrangement A of lines so that \Gamma and A are homeomorphic to G and \mathcal{A .
Revised: Let G be a graph embedded in the plane and let \mathcal{A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and \mathcal{A is a planar polyline drawing \Gamma of G with an arrangement A of lines so that \Gamma and A are homeomorphic to G and \mathcal A .
Edit intent: fluency
Original:  We show that if \mathcal{A is stretchable and every edge e either entirely lies on a pseudoline or intersects at most one pseudoline, then G and \mathcal{A have a straight-line aligned drawing.
Revised:  We show that if \mathcal A is stretchable and every edge e either entirely lies on a pseudoline or intersects at most one pseudoline, then G and \mathcal{A have a straight-line aligned drawing.
Edit intent: fluency
Original:  We show that if \mathcal{A is stretchable and every edge e either entirely lies on a pseudoline or intersects at most one pseudoline, then G and \mathcal{A have a straight-line aligned drawing.
Revised:  We show that if \mathcal{A is stretchable and every edge e either entirely lies on a pseudoline or intersects at most one pseudoline, then G and \mathcal A have a straight-line aligned drawing.
Edit intent: fluency
Original:  In order to prove these results, we strengthen the result of Da Lozzo et al., and prove that a planar graph G and a single pseudoline \mathcal{C have an aligned drawing with a prescribed convex drawing of the outer face.
Revised:  In order to prove these results, we strengthen the result of Da Lozzo et al., and prove that a planar graph G and a single pseudoline \mathcal L have an aligned drawing with a prescribed convex drawing of the outer face.
Edit intent: meaning-changed
Original:  For the latter class five genetic trading algorithms are disucssed, whereby it is distinguished between two different moving average (MA) based, two trading range (TR) based, and one strategy based on historical optimal (HistOpt) trajectories.
Revised:  For the latter class five trading algorithms are disucssed, whereby it is distinguished between two different moving average (MA) based, two trading range (TR) based, and one strategy based on historical optimal (HistOpt) trajectories.
Edit intent: clarity
Original:  Mathematical tools based on dynamical systems theory are often used to model these networks . The size and complexity of these models , however, mean that their behaviour is not always intuitive and the underlying mechanisms can be difficult to decipher.
Revised:  Mathematical tools based on dynamical systems theory are often used to model these networks , but the size and complexity of these models , however, mean that their behaviour is not always intuitive and the underlying mechanisms can be difficult to decipher.
Edit intent: coherence
Original:  We demonstrate that the method captures the full dynamics of a simple cross-repressive transcriptional motif while simplifying analysis of the subnetwork and providing a natural interpretation of the memory functions .
Revised:  These memory functions provide probes of near-steady state dynamics, revealing information not easily accessible otherwise. We illustrate the method on a simple cross-repressive transcriptional motif while simplifying analysis of the subnetwork and providing a natural interpretation of the memory functions .
Edit intent: meaning-changed
Original:  We demonstrate that the method captures the full dynamics of a simple cross-repressive transcriptional motif while simplifying analysis of the subnetwork and providing a natural interpretation of the memory functions .
Revised:  We demonstrate that the method captures the full dynamics of a simple cross-repressive transcriptional motif to show that memory functions not only simplify the analysis of the subnetwork and providing a natural interpretation of the memory functions .
Edit intent: meaning-changed
Original:  Accounting for measurement error when using measures constructed from high frequency data to conduct inference on dynamic jump models would appear to be advisable  .
Revised:  Accounting for measurement error when using measures constructed from high frequency data to conduct inference on dynamic jump models would appear to be advisable P500 stock index and the IBM stock price. The paper concludes by providing guidelines for empirical researchers who wish to exploit high frequency data when drawing conclusions regarding dynamic jump processes .
Edit intent: meaning-changed
Original: This paper provides an extensive evaluation of high frequency jump tests and measures, in the context of using such testsand measures in the estimation of dynamic models for asset price jumps. Specifically, we investigate: i) the power of alternative tests to detect individual price jumps, most notably in the presence of volatility jumps; ii) the frequency with which sequences of dynamic jumps are correctly identified; iii) the accuracy with which the magnitude and sign of a sequence of jumps, including small clusters of consecutive jumps, are estimated; and iv) the robustness of inference about dynamic jumps to test and measure design.
Revised: This paper provides an extensive evaluation of price jump tests based on high-frequency financial data. After providing a concise review of multiple alternative tests, we document the size and power of all tests in a range of empirically relevant scenarios. Particular focus is given to the robustness of inference about dynamic jumps to test and measure design.
Edit intent: clarity
Original:  and iv) the robustness of inference about dynamic jumps to test and measure design. Substantial differences are discerned in the performance of alternative methods in certain dimensions, with inference being sensitive to these differences in some cases.
Revised:  and iv) the robustness of test performance to the presence of jumps in volatility and microstructure noise, and to the impact of alternative methods in certain dimensions, with inference being sensitive to these differences in some cases.
Edit intent: meaning-changed
Original:  Substantial differences are discerned in the performance of alternative methods in certain dimensions, with inference being sensitive to these differences in some cases. Accounting for measurement error when using measures constructed from high frequency data to conduct inference on dynamic jump models is also shown to have an impact . The sensitivity of inference to test and measurement construction is documented using both artificially generated data and empirical data on both the S P500 stock index and the IBM stock price .
Revised:  Substantial differences are discerned in the performance of P500 stock index and the IBM stock price .
Edit intent: clarity
Original:  Trees, as a special class of graphs, have been the focus of several papers and, recently, He and He  showed how to produce a monotone drawing of an arbitrary n-vertex tree that is contained in a 12n \times 12n grid.
Revised:  Trees, as a special class of graphs, have been the focus of several papers and, recently, He and He ~\mbox{%DIFAUXCMD mt:4 showed how to produce a monotone drawing of an arbitrary n-vertex tree that is contained in a 12n \times 12n grid.
Edit intent: meaning-changed
Original:   In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Revised:  All monotone tree drawing algorithms that have appeared in the literature consider rooted ordered trees and they draw them so that (i) the root of the tree is drawn at the origin of the drawing, (ii) the drawing is confined in the first quadrant, and (iii) the ordering/embedding of the tree is respected. In this paper, we present a simple algorithm that constructs for each arbitrary tree a monotone drawing on a grid of size at most n \times n \left\lfloor {4} }\left(\right)\right\rfloor \left\lfloor {4} }\left(\right)\right\rfloor .
Edit intent: meaning-changed