wanyu/IteraTeR_full_sent huggingface dataset:
Original:  We also show that Lasso based, cross-fit, debiased machine learning estimators are asymptotically efficient under these conditions. In addition we show efficiency of an estimator without cross-fitting when the functional depends on the regressors and the regressionsparse approximation rate satisfies \xi_{1 1/ 2.
Revised:  We also show that Lasso based, cross-fit, debiased machine learning estimators are asymptotically efficient under minimal conditions. These estimators use no cross-fitting when the functional depends on the regressors and the regressionsparse approximation rate satisfies \xi_{1 1/ 2.
Edit intent: clarity
Original:  In addition we show efficiency of an estimator without cross-fitting when the functional depends on the regressors and the regressionsparse approximation rate satisfies \xi_{1 1/ 2.
Revised:  In addition we show efficiency of an estimator without cross-fitting when the functional depends on the regressors and the regressionsparse approximation rate satisfies \xi_{1 1/ \sqrt{n
Edit intent: meaning-changed
Original: A Systemic Optimal Risk Transfer Equilibrium (SORTE) was introduced in  "Systemic Optimal Risk Transfer Equilibrium "  for the analysis of the equilibrium among financial institutions or in insurance-reinsurance markets.
Revised: A Systemic Optimal Risk Transfer Equilibrium (SORTE) was introduced in : "Systemic Optimal Risk Transfer Equilibrium " for the analysis of the equilibrium among financial institutions or in insurance-reinsurance markets.
Edit intent: fluency
Original: A Systemic Optimal Risk Transfer Equilibrium (SORTE) was introduced in  "Systemic Optimal Risk Transfer Equilibrium "  for the analysis of the equilibrium among financial institutions or in insurance-reinsurance markets.
Revised: A Systemic Optimal Risk Transfer Equilibrium (SORTE) was introduced in "Systemic optimal risk transfer equilibrium " for the analysis of the equilibrium among financial institutions or in insurance-reinsurance markets.
Edit intent: fluency
Original: A Systemic Optimal Risk Transfer Equilibrium (SORTE) was introduced in  "Systemic Optimal Risk Transfer Equilibrium "  for the analysis of the equilibrium among financial institutions or in insurance-reinsurance markets.
Revised: A Systemic Optimal Risk Transfer Equilibrium (SORTE) was introduced in "Systemic Optimal Risk Transfer Equilibrium " , Mathematics and Financial Economics (2021), for the analysis of the equilibrium among financial institutions or in insurance-reinsurance markets.
Edit intent: meaning-changed
Original:  In this paper we extend such  notion to the case in which the value function to be optimized has two components, one being the sum of the single agents' utility functions, the other consisting of a truly systemic component.
Revised:  In this paper we extend such a notion to the case in which the value function to be optimized has two components, one being the sum of the single agents' utility functions, the other consisting of a truly systemic component.
Edit intent: fluency
Original:  In this paper we extend such  notion to the case in which the value function to be optimized has two components, one being the sum of the single agents' utility functions, the other consisting of a truly systemic component.
Revised:  In this paper we extend such notion to the case when the value function to be optimized has two components, one being the sum of the single agents' utility functions, the other consisting of a truly systemic component.
Edit intent: clarity
Original:  In this paper we extend such  notion to the case in which the value function to be optimized has two components, one being the sum of the single agents' utility functions, the other consisting of a truly systemic component.
Revised:  In this paper we extend such notion to the case in which the value function to be optimized is multivariate in a general sense, and it is not simply given by the sum of the single agents' utility functions, the other consisting of a truly systemic component.
Edit intent: meaning-changed
Original:  In this paper we extend such  notion to the case in which the value function to be optimized has two components, one being the sum of the single agents' utility functions, the other consisting of a truly systemic component. The latter could be either enforced by an external regulator or be agreed on by the participants in the market .
Revised:  In this paper we extend such notion to the case in which the value function to be optimized has two components, one being the sum of univariate utility functions. This takes into account the fact that preferences of single agents might depend on the actions of other participants in the market .
Edit intent: meaning-changed
Original:  First, we model the risks of the guaranteed-loan network by a probabilistic graph, which consists of the guarantee-loan network structure, self-risks for the nodes , and diffusion probability for the edges.
Revised:  First, we model the risks of the guaranteed-loan network by a probabilistic graph, which consists of the guarantee-loan network structure, self-risk probability for the nodes , and diffusion probability for the edges.
Edit intent: fluency
Original: Groups of small and medium enterprises (SMEs) can back each other to obtain loans from banks and thus form guarantee networks. If the loan repayment of a small company in the network defaults, its backers are required to repay the loan. Therefore, risk over networked enterprises may cause significant contagious damage. In real-world applications,  it is critical to detect top vulnerable nodesin such complex financial network with near real-time performance.
Revised: Uncertain graphs have been widely used to model complex linked data in many real-world applications, it is critical to detect top vulnerable nodesin such complex financial network with near real-time performance.
Edit intent: meaning-changed
Original:  In real-world applications,  it is critical to detect top vulnerable nodesin such complex financial network with near real-time performance.
Revised:  In real-world applications, such as guaranteed-loan networks and power grids, where a node or edge may be associated with a probability. In these networks, a node usually has a certain chance of default or breakdown due to self-factors or the influence from upstream nodes. For regulatory authorities and companies, it is critical to detect top vulnerable nodesin such complex financial network with near real-time performance.
Edit intent: meaning-changed
Original:  In real-world applications,  it is critical to detect top vulnerable nodesin such complex financial network with near real-time performance. To address this challenge, we introduce VulnDS: a top-k vulnerable SME detection system for large-scale financial networks, which is deployed in our collaborated bank.
Revised:  In real-world applications, it is critical to efficiently identify the vulnerable nodes, i.e., nodes with high default risks, such that they could pay more attention to these nodes for the purpose of risk management. In this paper, we propose and investigate the problem of top-k vulnerable SME detection system for large-scale financial networks, which is deployed in our collaborated bank.
Edit intent: meaning-changed
Original:  To address this challenge, we introduce VulnDS: a top-k vulnerable SME detection system for large-scale financial networks, which is deployed in our collaborated bank. First, we model the risks of the guaranteed-loan network by a probabilistic graph, which consists of the guarantee-loan network structure, self-risk probability for the nodes and diffusion probability for the edges. Moreover, to identify the vulnerable enterprises, we propose a sampling-based approach with tight theoretical guarantee .
Revised:  To address this challenge, we introduce VulnDS: a top-k vulnerable nodes detection in uncertain graphs. We formally define the problem and prove its hardness. To identify the k most vulnerable nodes, a sampling-based approach with tight theoretical guarantee .
Edit intent: meaning-changed
Original:  The evaluation results show that the proposed method can achieve up to 100x speedup ratio compared with baseline methods. Case studies are further conducted in the deployed systemto demonstrate the effectiveness of proposed model .
Revised:  The evaluation results show that the proposed method can achieve up to 2 orders of magnitudes speedup compared with the baseline approach. Moreover, to further verify the advantages of our model in real-life scenarios, we integrate the proposed techniques with our current loan risk control system, which is deployed in the collaborated bank, for more evaluation. Particularly, we show that our proposed new model has superior performance on real-life guaranteed-loan network data, which can better predict the default risks of enterprises compared to the state-of-the-art techniques .
Edit intent: meaning-changed
Original:  Our approach significantly improves cross-lingual sentence retrieval performance over all other approaches , as well as convincingly outscores mapping methods while maintaining parity with jointly trained methods on word-translation.
Revised:  Our approach significantly improves cross-lingual sentence retrieval performance over all other approaches , as well as convincingly outscores mapping methods while maintaining parity with the current state-of-the-art methods on word-translation.
Edit intent: clarity
Original:  On the basis of these types, {\AE}THEL further provides 72 ,623 validated derivations, presented in four equivalent formats: natural-deduction and sequent-style proofs, linear logic proofnets and the associated programs (lambda terms) for meaning composition.
Revised:  On the basis of these types, {\AE}THEL further provides 72 192 validated derivations, presented in four equivalent formats: natural-deduction and sequent-style proofs, linear logic proofnets and the associated programs (lambda terms) for meaning composition.
Edit intent: meaning-changed
Original:  On the basis of these types, {\AE}THEL further provides 72 ,623 validated derivations, presented in four equivalent formats: natural-deduction and sequent-style proofs, linear logic proofnets and the associated programs (lambda terms) for meaning composition.
Revised:  On the basis of these types, {\AE}THEL further provides 72 ,623 validated derivations, presented in four formats: natural-deduction and sequent-style proofs, linear logic proofnets and the associated programs (lambda terms) for meaning composition.
Edit intent: clarity
Original:  The following resources are open-sourced with {\AE}THEL: the lexical mappings between words and types, a subset of the dataset consisting of 8,569 semantic parses, and the Python code that implements the extraction algorithm.
Revised:  The following resources are open-sourced with {\AE}THEL: the lexical mappings between words and types, a subset of the dataset consisting of 7 924 semantic parses, and the Python code that implements the extraction algorithm.
Edit intent: meaning-changed
Original:   When the bacterial populations are able to split into subpopulations to have two phenotypes with different average lag time , the fraction of the finite lag time population shows continuous transition when changing the severeness of antibiotics application .
Revised:  This suggests the possibility of reducing tolerant bacteria by controlled usage of antibiotics application. When the bacterial populations are able to split into subpopulations to have two phenotypes with different average lag time , the fraction of the finite lag time population shows continuous transition when changing the severeness of antibiotics application .
Edit intent: meaning-changed
Original:   When the bacterial populations are able to split into subpopulations to have two phenotypes with different average lag time , the fraction of the finite lag time population shows continuous transition when changing the severeness of antibiotics application .
Revised:  When the bacterial populations are able to split into subpopulations to have two phenotypes with different lag times , the fraction of the finite lag time population shows continuous transition when changing the severeness of antibiotics application .
Edit intent: clarity
Original:   When the bacterial populations are able to split into subpopulations to have two phenotypes with different average lag time , the fraction of the finite lag time population shows continuous transition when changing the severeness of antibiotics application . The result suggests the possibility of reducing tolerant bacteria by controlled usage of antibiotics application .
Revised:  When the bacterial populations are able to split into subpopulations to have two phenotypes with different average lag time , the fraction of the second phenotype that has different lag time shows a continuous transition. We then present a generic framework to investigate the optimal lag time distribution for total population fitness for a given distribution of the antibiotic application duration. The obtained optimal distributions have multiple peaks for a wide range of the antibiotic application duration distributions, including the case where the latter is monotonically decreasing. The analysis supports the advantage in evolving multiple, possibly discrete phenotypes in lag time for bacterial long-term fitness .
Edit intent: meaning-changed
Original:  However, they differ in their general architectures (with key details such as the support for the parallel execution of graph updates  , or the incorporated graph URLanization), the types of updates and workloads allowed, and many others.
Revised:  However, they differ in their general architectures (with key details such as the support for the concurrent execution of graph updates , or the incorporated graph URLanization), the types of updates and workloads allowed, and many others.
Edit intent: clarity
Original:  However, they differ in their general architectures (with key details such as the support for the parallel execution of graph updates  , or the incorporated graph URLanization), the types of updates and workloads allowed, and many others.
Revised:  However, they differ in their general architectures (with key details such as the support for the parallel execution of graph updates and queries , or the incorporated graph URLanization), the types of updates and workloads allowed, and many others.
Edit intent: meaning-changed
Original:  Moreover, we provide a bridge with the very rich landscape of graph streaming theory by giving a broad overview of recent theoretical related advances, and by analyzing which graph streaming models and settings could be helpful in developing more powerful streaming frameworks and designs.
Revised:  Moreover, we provide a bridge with the very rich landscape of graph streaming theory by giving a broad overview of recent theoretical related advances, and by discussing which graph streaming models and settings could be helpful in developing more powerful streaming frameworks and designs.
Edit intent: clarity
Original: Topological descriptors  have been shown to be useful for summarizing and differentiating shapes . Related work uses persistence diagrams and Euler characteristic curves to differentiate between shapes and quantifies the number of descriptorsnecessary for shape reconstruction, given certain assumptions such as minimum curvature .
Revised: Topological descriptors , such as persistence diagrams and Euler characteristic curves, have been shown to be useful for summarizing and differentiating shapes . Related work uses persistence diagrams and Euler characteristic curves to differentiate between shapes and quantifies the number of descriptorsnecessary for shape reconstruction, given certain assumptions such as minimum curvature .
Edit intent: clarity
Original: Topological descriptors  have been shown to be useful for summarizing and differentiating shapes . Related work uses persistence diagrams and Euler characteristic curves to differentiate between shapes and quantifies the number of descriptorsnecessary for shape reconstruction, given certain assumptions such as minimum curvature .
Revised: Topological descriptors have been shown to be useful for summarizing and differentiating shapes , both empirically and theoretically. The theoretical justification for their use is based on the fact that shapes can be fully reconstructed using just the descriptors .
Edit intent: coherence
Original:  The theoretical justification for their use is based on the fact that shapes can be fully reconstructed using just the descriptors .
Revised:  One common summary tool is the Persistent Homology Transform (PHT), which represents a shape with a multiset of persistence diagrams parameterized by directions in the ambient space. For practical applicability, we must bound the number of directions needed in order to ensure that the PHT is a faithful representation of a shape .
Edit intent: meaning-changed
Original:  In this work, we provide the first algorithm using directional persistence diagrams to reconstruct simplicial complexes in arbitrary finite dimension  .
Revised:  In this work, we provide such a bound for geometric simplicial complexes in arbitrary finite dimension and only general position assumptions (as opposed to bounding curvature). Furthermore, through our choice of proof method, we also provide an algorithm to reconstruct simplicial complexes in arbitrary finite dimension .
Edit intent: meaning-changed
Original:  In this work, we provide the first algorithm using directional persistence diagrams to reconstruct simplicial complexes in arbitrary finite dimension  .
Revised:  In this work, we provide the first algorithm using directional persistence diagrams to reconstruct simplicial complexes in arbitrary finite dimension using an oracle to query for augmented persistence diagrams. In the process, we also describe a discretization of other topological transforms, including the Betti Curve Transform and Euler Characteristic Curve Transform .
Edit intent: meaning-changed
Original:  The predicted prevalence of URLanelles in distal boutons may explain the "dying back" pattern of axonal degeneration observed in dopaminergic neurons in Parkinson's disease  .
Revised:  The predicted prevalence of URLanelles in distal boutons may explain the "dying back" pattern of axonal degeneration observed in dopaminergic neurons in Parkinson's disease . The predicted difference of two hours between the age of older DCVs residing in distal boutons and the age of younger DCVs residing in proximal boutons agrees with the age difference deduced from experimental observations. The age density of resident DCVs is found to be bimodal, which is because DCVs are captured from two transiting states: the anterograde transiting state that contains younger DCVs and the retrograde transiting state that contains older DCVs .
Edit intent: meaning-changed
Original:  Accurate simulation of the mean age of DCVs in boutons requires the development of a model that would account for both residentand transiting populationsof DCVs . In this paper, such a model is developed.
Revised:  Accurate simulation of the mean age of DCVs in boutons requires the development of a model that would account for resident, transiting-anterograde, and transiting-retrograde DCV populations . In this paper, such a model is developed.
Edit intent: meaning-changed
Original:  The predicted difference of two hours between the age of older DCVs residing in distal boutons and the age of younger DCVs residing in proximal boutons agrees with the age difference deduced from experimental observations.
Revised:  The predicted difference of two hours between the age of older DCVs residing in distal boutons and the age of younger DCVs residing in proximal boutons is consistent with an approximate estimate of age difference deduced from experimental observations.
Edit intent: clarity
Original: This paper describes how to use the R package backbone for extracting the backbone of a weighted graph. The analysis and visualization of weighted graphs are inherently challenging , and thus it is often of use to only examine edges which are deemed significant.
Revised: Bipartite projections are used in a wide range of network contexts including politics (bill co-sponsorship), genetics (gene co-expression), economics (executive board co-membership), and innovation (patent co-authorship). However, because bipartite projections are always weighted graphs, which are inherently challenging , and thus it is often of use to only examine edges which are deemed significant.
Edit intent: meaning-changed
Original:  The analysis and visualization of weighted graphs are inherently challenging , and thus it is often of use to only examine edges which are deemed significant. There are several methods for extracting from a weighted graph an unweighted or signed backbone which retains only the significant edges.
Revised:  The analysis and visualization of weighted graphs are inherently challenging , and thus it is often useful to examine the 'backbone', an unweighted subgraph containing only the most significant edges.
Edit intent: clarity
Original:  We show that a simple thresholded version of ProbKnot, which we call ThreshKnot, leads to more accurate overall predictions by filtering out unlikely pairs whose probability falls under a given threshold.
Revised:  We show that a simple thresholded version of ProbKnot, which we call ThreshKnot, leads to more accurate overall predictions by filtering out unlikely pairs whose probabilities fall under a given threshold.
Edit intent: fluency
Original:  We also show that on three widely-used folding engines (RNAstructure, Vienna RNAfold, and CONTRAfold), ThreshKnot always outperforms the much more involved MEA algorithm  (1) in structure prediction accuracy, (2) in its capability to predict pseudoknots,  (3) and in its faster running time .
Revised:  We also show that on three widely-used folding engines (RNAstructure, Vienna RNAfold, and CONTRAfold), ThreshKnot always outperforms the much more involved MEA algorithm in (1) in structure prediction accuracy, (2) in its capability to predict pseudoknots, (3) and in its faster running time .
Edit intent: coherence
Original:  We also show that on three widely-used folding engines (RNAstructure, Vienna RNAfold, and CONTRAfold), ThreshKnot always outperforms the much more involved MEA algorithm  (1) in structure prediction accuracy, (2) in its capability to predict pseudoknots,  (3) and in its faster running time .
Revised:  We also show that on three widely-used folding engines (RNAstructure, Vienna RNAfold, and CONTRAfold), ThreshKnot always outperforms the much more involved MEA algorithm (1) its higher structure prediction accuracy, (2) in its capability to predict pseudoknots, (3) and in its faster running time .
Edit intent: meaning-changed
Original:  We also show that on three widely-used folding engines (RNAstructure, Vienna RNAfold, and CONTRAfold), ThreshKnot always outperforms the much more involved MEA algorithm  (1) in structure prediction accuracy, (2) in its capability to predict pseudoknots,  (3) and in its faster running time .
Revised:  We also show that on three widely-used folding engines (RNAstructure, Vienna RNAfold, and CONTRAfold), ThreshKnot always outperforms the much more involved MEA algorithm (1) in structure prediction accuracy, (2) its capability to predict pseudoknots, (3) and in its faster running time .
Edit intent: fluency
Original:  We also show that on three widely-used folding engines (RNAstructure, Vienna RNAfold, and CONTRAfold), ThreshKnot always outperforms the much more involved MEA algorithm  (1) in structure prediction accuracy, (2) in its capability to predict pseudoknots,  (3) and in its faster running time .
Revised:  We also show that on three widely-used folding engines (RNAstructure, Vienna RNAfold, and CONTRAfold), ThreshKnot always outperforms the much more involved MEA algorithm (1) in structure prediction accuracy, (2) in its capability to predict pseudoknots, and (3) and in its faster running time .
Edit intent: coherence