wanyu/IteraTeR_full_sent huggingface dataset:
Original:  To determine the role of the nucleocapsid , we perform coarse-grained computational modeling of budding in the presence and absence of a nucleocapsid.
Revised:  To determine the role of the nucleocapsid , we perform coarse-grained computational model with which we investigate budding dynamics as a function of glycoprotein and nucleocapsid interactions, as well as budding in the presence and absence of a nucleocapsid.
Edit intent: meaning-changed
Original:  The simulations demonstrate that glycoprotein-directed budding leads to larger and more polydisperse particles than nucleocapsid-directed budding .
Revised:  We find that there is a transition between glycoprotein-directed budding and nucleocapsid-directed budding which occurs above a threshold strength of nucleocapsid interactions. The simulations predict that glycoprotein-directed budding leads to larger and more polydisperse particles than nucleocapsid-directed budding .
Edit intent: meaning-changed
Original:  We present a phase diagram for  morphologies of budded particles , which can be compared against experiments to establish bounds on whether budding is directed by glycoprotein or nucleocapsid interactions  .
Revised:  We present a phase diagram for morphologies of budded particles , which can be compared against experiments to establish bounds on whether budding is directed by glycoprotein or nucleocapsid interactions . Although our model is motivated by alphaviruses, we discuss implications of our results for other enveloped viruses .
Edit intent: meaning-changed
Original:  It is the creation of public markets for DINs that makes possible the use of public market pricing to indirectly establish a market capitalization for the underlying venture-bank investment , which is the key to achieving regulatory acceptance of the fully-insured version of this proposal.
Revised:  It is the creation of public markets for EDSs that makes possible the use of public market pricing to indirectly establish a market capitalization for the underlying venture-bank investment , which is the key to achieving regulatory acceptance of the fully-insured version of this proposal.
Edit intent: meaning-changed
Original:  It is the creation of public markets for DINs that makes possible the use of public market pricing to indirectly establish a market capitalization for the underlying venture-bank investment , which is the key to achieving regulatory acceptance of the fully-insured version of this proposal.
Revised:  It is the creation of public markets for DINs that makes possible the use of public market pricing to indirectly provide a potential market capitalization for the underlying venture-bank investment , which is the key to achieving regulatory acceptance of the fully-insured version of this proposal.
Edit intent: clarity
Original:  It is the creation of public markets for DINs that makes possible the use of public market pricing to indirectly establish a market capitalization for the underlying venture-bank investment , which is the key to achieving regulatory acceptance of the fully-insured version of this proposal. That fully-insured version insulates the venture-bank from losses in most situations, and multiplies profitability quite dramatically in all scenarios.
Revised:  It is the creation of public markets for DINs that makes possible the use of public market pricing to indirectly establish a market capitalization for the underlying venture-bank investment . Full coverage insulates the venture-bank from losses in most situations, and multiplies profitability quite dramatically in all scenarios.
Edit intent: clarity
Original:  I further propose a new feature for insurance type derivativeswhich is a clawback lien, here 77\%,  to be paid back to the underwriter  to prevent perverse incentive .
Revised:  I further propose a new feature for insurance type derivativeswhich is a clawback lien, closes out the equity default swap. Here it is optimized at 77\%, to be paid back to the underwriter to prevent perverse incentive .
Edit intent: meaning-changed
Original:  I further propose a new feature for insurance type derivativeswhich is a clawback lien, here 77\%,  to be paid back to the underwriter  to prevent perverse incentive .
Revised:  I further propose a new feature for insurance type derivativeswhich is a clawback lien, here 77\%, and is to be paid back to the underwriter to prevent perverse incentive .
Edit intent: coherence
Original:  I further propose a new feature for insurance type derivativeswhich is a clawback lien, here 77\%,  to be paid back to the underwriter  to prevent perverse incentive .
Revised:  I further propose a new feature for insurance type derivativeswhich is a clawback lien, here 77\%, to be paid back to the underwriter at a future date to prevent perverse incentive .
Edit intent: meaning-changed
Original:  I further propose a new feature for insurance type derivativeswhich is a clawback lien, here 77\%,  to be paid back to the underwriter  to prevent perverse incentive . This proposal solves an old problem in banking, because it matches the term of the loan with the term of the investment.
Revised:  I further propose a new feature for insurance type derivativeswhich is a clawback lien, here 77\%, to be paid back to the underwriter to prevent perverse incentive to deliberately fail. This new feature creates an Equity Default Clawback Swap (EDCS) which can be used safely. This proposal also solves an old problem in banking, because it matches the term of the loan with the term of the investment.
Edit intent: meaning-changed
Original:  However, for small portfolios this approach often leads to zero counts and high count volatility, which makes the estimations unreliable and volatile , and can also produce counter-intuitive prediction patterns  .
Revised:  However, for small portfolios this approach often leads to zero counts and high count volatility, which makes the estimations unreliable and volatile , and can also produce counter-intuitive prediction patterns such as non-parallel/crossing forward PD patterns .
Edit intent: meaning-changed
Original:  Moreover, the approach can be efficiently applied for data consisting of continuous (undiscretized)PDs . In the IFRS9 context, the approach offers an additional merit of an easy way to account for the macroeconomic adjustments, which are required by the IFRS 9 accounting standard.
Revised:  Moreover, the approach can be efficiently applied to data consisting of continuous (undiscretized)PDs . In the IFRS9 context, the approach offers an additional merit of an easy way to account for the macroeconomic adjustments, which are required by the IFRS 9 accounting standard.
Edit intent: fluency
Original:  Moreover, the approach can be efficiently applied for data consisting of continuous (undiscretized)PDs . In the IFRS9 context, the approach offers an additional merit of an easy way to account for the macroeconomic adjustments, which are required by the IFRS 9 accounting standard.
Revised:  Moreover, the approach can be efficiently applied for data consisting of continuous PDs (prior to rating discretization) . In the IFRS9 context, the approach offers an additional merit of an easy way to account for the macroeconomic adjustments, which are required by the IFRS 9 accounting standard.
Edit intent: meaning-changed
Original:  Moreover, the approach can be efficiently applied for data consisting of continuous (undiscretized)PDs . In the IFRS9 context, the approach offers an additional merit of an easy way to account for the macroeconomic adjustments, which are required by the IFRS 9 accounting standard.
Revised:  Moreover, the approach can be efficiently applied for data consisting of continuous (undiscretized)PDs . In the IFRS 9 context, the approach offers an additional merit of an easy way to account for the macroeconomic adjustments, which are required by the IFRS 9 accounting standard.
Edit intent: fluency
Original:  Moreover, the approach can be efficiently applied for data consisting of continuous (undiscretized)PDs . In the IFRS9 context, the approach offers an additional merit of an easy way to account for the macroeconomic adjustments, which are required by the IFRS 9 accounting standard.
Revised:  Moreover, the approach can be efficiently applied for data consisting of continuous (undiscretized)PDs . In the IFRS9 context, the approach offers an additional merit : it can easily account for the macroeconomic adjustments, which are required by the IFRS 9 accounting standard.
Edit intent: clarity
Original: This article conerns the expressive power of depth in neural nets with ReLU activations . We prove that ReLU nets with width 2d+2 can approximate any continuous scalar function on the d-dimensional cube [0,1]^d arbitrarily well.
Revised: This article conerns the expressive power of depth in neural nets with ReLU activations and bounded width. We are particularly interested in the following questions: what is the minimal width w_{\text{min that ReLU nets with width 2d+2 can approximate any continuous scalar function on the d-dimensional cube [0,1]^d arbitrarily well.
Edit intent: meaning-changed
Original:  We prove that ReLU nets with width 2d+2 can approximate any continuous scalar function on the d-dimensional cube [0,1]^d arbitrarily well. We obtain quantitative depth estimates for such approximations .
Revised:  We prove that ReLU nets with width 2d+2 can approximate any continuous scalar function on the d-dimensional cube [0,1]^d aribitrarily well? For ReLU nets near this minimal width, what can one say about the depth necessary to approximate a given function? We obtain an essentially complete answer to these questions for convex functions .
Edit intent: meaning-changed
Original:  Moreover, when approximating convex, piecewise affine functions by width d+1 ReLU nets, we obtain matching upper and lower bounds on the required depth, proving that our construction is essentially optimal.  ]
Revised:  Moreover, when approximating convex, piecewise affine functions by width d+1 ReLU nets, we obtain matching upper and lower bounds on the required depth, proving that our construction is essentially optimal. These results then give quantitative depth estimates for the rate of approximation of any continuous scalar function on the d-dimensional cube ]
Edit intent: meaning-changed
Original:  Moreover, when approximating convex, piecewise affine functions by width d+1 ReLU nets, we obtain matching upper and lower bounds on the required depth, proving that our construction is essentially optimal.  ]
Revised:  Moreover, when approximating convex, piecewise affine functions by width d+1 ReLU nets, we obtain matching upper and lower bounds on the required depth, proving that our construction is essentially optimal. 0,1]
Edit intent: meaning-changed
Original:  Moreover, when approximating convex, piecewise affine functions by width d+1 ReLU nets, we obtain matching upper and lower bounds on the required depth, proving that our construction is essentially optimal.  ]
Revised:  Moreover, when approximating convex, piecewise affine functions by width d+1 ReLU nets, we obtain matching upper and lower bounds on the required depth, proving that our construction is essentially optimal. ]^d by ReLU nets with width d+3.
Edit intent: meaning-changed
Original: 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 .
Revised: Let G be a graph that is topologically 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: clarity
Original: 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 .
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 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 .
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 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 .
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:  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: meaning-changed
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 it has at most one pseudoline , then G and \mathcal A have a straight-line aligned drawing.
Edit intent: clarity
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 intersection with \mathcal{A , then G and \mathcal A have a straight-line aligned drawing.
Edit intent: meaning-changed
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: meaning-changed
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 L have an aligned drawing with a prescribed convex drawing of the outer face.
Revised:  In order to prove this result , 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: 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 L have an aligned drawing with a prescribed convex drawing of the outer face.
Revised:  In order to prove these results , we strengthen a 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: 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 L 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 information aggregation, we introduce a tractable multilayer aggregation procedure to integrate security-wise and time-wise information about investor category trading networks. We use transaction bootstrapping to capture the properties of the actual data generation process and to have a more robust statistical testing procedure .
Revised:  For information aggregation, we introduce a tractable multilayer aggregation procedure to integrate security-wise and time-wise information about investor trading networks, but it is not limited to finance. In fact, it can be used for different applications, such as gene, transportation, and social networks, were they inferred or observable. Additionally, in the investor network inference, we use transaction bootstrapping to capture the properties of the actual data generation process and to have a more robust statistical testing procedure .
Edit intent: meaning-changed
Original:  Importantly, the use of our proposed aggregation framework is not limited to the field of investor trading networks; in fact, it can be used for different non-financial applications, with both observable and inferred relationships, spanning a number of different information layers .
Revised:  We apply this procedure by analyzing a unique data set of Finnish shareholders during the period 2004-2009. We find that households in the capital have high centrality in investor networks, which, under the theory of information channels in investor networks suggests that they are well-informed investors .
Edit intent: meaning-changed
Original:  This problem arises in various scenarios in thermodynamics of computation and nonequilibrium statistical physics  (e.g., when designing processes to implement some desired computation, feedback-control protocol, or Maxwellian demon).
Revised:  This problem arises often in the thermodynamics of computation and nonequilibrium statistical physics (e.g., when designing processes to implement some desired computation, feedback-control protocol, or Maxwellian demon).
Edit intent: clarity
Original:  This problem arises in various scenarios in thermodynamics of computation and nonequilibrium statistical physics  (e.g., when designing processes to implement some desired computation, feedback-control protocol, or Maxwellian demon).
Revised:  This problem arises in various scenarios in thermodynamics of computation and nonequilibrium statistical physics more generally (e.g., when designing processes to implement some desired computation, feedback-control protocol, or Maxwellian demon).
Edit intent: meaning-changed
Original:  This problem arises in various scenarios in thermodynamics of computation and nonequilibrium statistical physics  (e.g., when designing processes to implement some desired computation, feedback-control protocol, or Maxwellian demon).
Revised:  This problem arises in various scenarios in thermodynamics of computation and nonequilibrium statistical physics (e.g., when designing processes to implement some desired computation, feedback controller, or Maxwell demon).
Edit intent: clarity
Original:  Here we show that any conditional distribution P can however be implemented if the master equation dynamics has access to additional "hidden" states , not in X . We investigate how the minimal number of such hidden states needed to implement some P in a thermodynamically reversible manner depends on P.
Revised:  However, here we show that any conditional distribution P can however be implemented if the master equation dynamics has access to additional "hidden" states , not in X . We investigate how the minimal number of such hidden states needed to implement some P in a thermodynamically reversible manner depends on P.
Edit intent: coherence
Original:  Here we show that any conditional distribution P can however be implemented if the master equation dynamics has access to additional "hidden" states , not in X . We investigate how the minimal number of such hidden states needed to implement some P in a thermodynamically reversible manner depends on P.
Revised:  Here we show that any conditional distribution P can in fact be implemented---if additional "hidden" states , not in X . We investigate how the minimal number of such hidden states needed to implement some P in a thermodynamically reversible manner depends on P.
Edit intent: clarity
Original:  Here we show that any conditional distribution P can however be implemented if the master equation dynamics has access to additional "hidden" states , not in X . We investigate how the minimal number of such hidden states needed to implement some P in a thermodynamically reversible manner depends on P.
Revised:  Here we show that any conditional distribution P can however be implemented if the master equation dynamics has access to additional "hidden" states not in X . We investigate how the minimal number of such hidden states needed to implement some P in a thermodynamically reversible manner depends on P.
Edit intent: fluency
Original:  Here we show that any conditional distribution P can however be implemented if the master equation dynamics has access to additional "hidden" states , not in X . We investigate how the minimal number of such hidden states needed to implement some P in a thermodynamically reversible manner depends on P.
Revised:  Here we show that any conditional distribution P can however be implemented if the master equation dynamics has access to additional "hidden" states , not in X are available. Moreover, we show that it is always possible to implement P in a thermodynamically reversible manner. We then investigate a novel cost of the physical resources needed to implement a given distribution P: the minimal number of such hidden states needed to implement some P in a thermodynamically reversible manner depends on P.
Edit intent: meaning-changed
Original:  Here we show that any conditional distribution P can however be implemented if the master equation dynamics has access to additional "hidden" states , not in X . We investigate how the minimal number of such hidden states needed to implement some P in a thermodynamically reversible manner depends on P.
Revised:  Here we show that any conditional distribution P can however be implemented if the master equation dynamics has access to additional "hidden" states , not in X . We investigate how the minimal number of hidden states needed to implement some P in a thermodynamically reversible manner depends on P.
Edit intent: clarity