wanyu/IteraTeR_full_sent huggingface dataset:
Original:  We verify thataccuracy scores may be inflated up to 41\% , even if a well-designed 10x5 iterated cross-validation DAP is applied, unless all images from the same subject are kept together either in the internal training or validation splits. Results are replicated for 4 classification tasks in digital pathology on 3  datasets, for a total of 373 subjects, and 543 total slides (around 27,000 tiles ).
Revised:  We verify thataccuracy scores may be inflated up to 41\% , even if a well-designed 10x5 iterated cross-validation DAP is applied, unless all images from the same subject are used both in training and validation sets by deep learning models. We replicate the experiments for 4 classification tasks in digital pathology on 3 datasets, for a total of 373 subjects, and 543 total slides (around 27,000 tiles ).
Edit intent: clarity
Original:  Results are replicated for 4 classification tasks in digital pathology on 3  datasets, for a total of 373 subjects, and 543 total slides (around 27,000 tiles ).
Revised:  Results are replicated for 4 classification tasks in digital pathology on 3 histopathological datasets, for a total of 373 subjects, and 543 total slides (around 27,000 tiles ).
Edit intent: meaning-changed
Original:  Results are replicated for 4 classification tasks in digital pathology on 3  datasets, for a total of 373 subjects, and 543 total slides (around 27,000 tiles ).
Revised:  Results are replicated for 4 classification tasks in digital pathology on 3 datasets, for a total of 374 subjects, 556 slides and more than 27,000 tiles ).
Edit intent: meaning-changed
Original:  Results are replicated for 4 classification tasks in digital pathology on 3  datasets, for a total of 373 subjects, and 543 total slides (around 27,000 tiles ). Impact of applying transfer learning strategies with models pre-trained on general-purpose or digital pathology datasets is also discussed .
Revised:  Results are replicated for 4 classification tasks in digital pathology on 3 datasets, for a total of 373 subjects, and 543 total slides (around 27,000 tiles . Also, we discuss the effects of data leakage on transfer learning strategies with models pre-trained on general-purpose or digital pathology datasets is also discussed .
Edit intent: meaning-changed
Original:  Impact of applying transfer learning strategies with models pre-trained on general-purpose or digital pathology datasets is also discussed .
Revised:  Impact of applying transfer learning strategies with models pre-trained on general-purpose datasets or off-task digital pathology collections. Finally, we propose a solution that automates the creation of leakage-free deep learning pipelines for digital pathology based on histolab, a novel Python package for histology data preprocessing. We validate the solution on two public datasets (TCGA and GTEx) .
Edit intent: meaning-changed
Original:  In this work, we present new computational Bayesian techniques that accelerate inference for expensive stochastic models by using computationally cheap approximations to inform feasible regions in parameter space, and through learning transforms that adjust the biased approximate inferences to closer represent the correct inferences under the expensive stochastic model.
Revised:  In this work, we present new computational Bayesian techniques that accelerate inference for expensive stochastic models by using computationally inexpensive approximations to inform feasible regions in parameter space, and through learning transforms that adjust the biased approximate inferences to closer represent the correct inferences under the expensive stochastic model.
Edit intent: fluency
Original: An investigation is presented of how a comprehensive choice of five most important measures of concordance (namely Spearman's rho, Kendall's tau, Spearman's footrule, Gini's gamma, and Blomqvist's beta  ) relate to non-exchangeability, i.e., asymmetry on copulas.
Revised: An investigation is presented of how a comprehensive choice of five most important measures of concordance (namely Spearman's rho, Kendall's tau, Gini's gamma, and Blomqvist's beta ) relate to non-exchangeability, i.e., asymmetry on copulas.
Edit intent: clarity
Original: An investigation is presented of how a comprehensive choice of five most important measures of concordance (namely Spearman's rho, Kendall's tau, Spearman's footrule, Gini's gamma, and Blomqvist's beta  ) relate to non-exchangeability, i.e., asymmetry on copulas.
Revised: An investigation is presented of how a comprehensive choice of five most important measures of concordance (namely Spearman's rho, Kendall's tau, Spearman's footrule, Gini's gamma, Blomqvist's beta ) relate to non-exchangeability, i.e., asymmetry on copulas.
Edit intent: fluency
Original: An investigation is presented of how a comprehensive choice of five most important measures of concordance (namely Spearman's rho, Kendall's tau, Spearman's footrule, Gini's gamma, and Blomqvist's beta  ) relate to non-exchangeability, i.e., asymmetry on copulas.
Revised: An investigation is presented of how a comprehensive choice of five most important measures of concordance (namely Spearman's rho, Kendall's tau, Spearman's footrule, Gini's gamma, and Blomqvist's beta , and their weaker counterpart Spearman's footrule ) relate to non-exchangeability, i.e., asymmetry on copulas.
Edit intent: meaning-changed
Original:  Besides these results, the method proposed also seems to be new and may serve as a raw model for exploration of the relationship between a specific property of a copula and some of its measures of dependence structure, or perhaps the relationship between various measures of dependence structure themselves . In order to simplify the view on this method and provide a more conceptual interpretation a formulation is proposed borrowed from the imprecise probability setting which has been made possible for a standard probability method due to some recent discoveries .
Revised:  Besides these results, the method proposed also seems to be new and may serve as a raw model for exploration of the relationship between a specific property of a copula and some of its measures of dependence structure, or perhaps the relationship between various measures of dependence structure themselves .
Edit intent: coherence
Original:  However,  the high-reliability limit is subject to a fundamental error-energy-efficiency tradeoff that arises from time-symmetric control . Requiring a low probability of error causes energy consumption to diverge as logarithm of the inverse error rate for nonreciprocal logical transitions.
Revised:  However, we demonstrate that the high-reliability limit is subject to a fundamental error-energy-efficiency tradeoff that arises from time-symmetric control . Requiring a low probability of error causes energy consumption to diverge as logarithm of the inverse error rate for nonreciprocal logical transitions.
Edit intent: clarity
Original:  However,  the high-reliability limit is subject to a fundamental error-energy-efficiency tradeoff that arises from time-symmetric control . Requiring a low probability of error causes energy consumption to diverge as logarithm of the inverse error rate for nonreciprocal logical transitions.
Revised:  However, the high-reliability limit is subject to a fundamental error-energy-efficiency tradeoff that arises from time-symmetric control : Requiring a low probability of error causes energy consumption to diverge as logarithm of the inverse error rate for nonreciprocal logical transitions.
Edit intent: coherence
Original:  The reciprocity (self-invertibility) of a computation is a stricter condition for thermodynamic efficiency than logical reversibility (invertibility), the latter being the root of Landauer's work bound . In fact, the average energy required for reliable erasure is well above that bound. Explicit simulations of work production closely track the error-dissipation tradeoff , diverging from the Landauer bound as the error rate decreases.
Revised:  The reciprocity (self-invertibility) of a computation is a stricter condition for thermodynamic efficiency than logical reversibility (invertibility), the latter being the root of Landauer's work bound on erasing information. Beyond engineered computation, the results identify a generic error-dissipation tradeoff , diverging from the Landauer bound as the error rate decreases.
Edit intent: clarity
Original:  Explicit simulations of work production closely track the error-dissipation tradeoff , diverging from the Landauer bound as the error rate decreases. And, unlike the Landauer work, which can be recovered, the nonreciprocal work must be irreversibly dissipated. Analogous bounds hold for the universal NAND gate and extend to circuits of logical gates. That said, strictly-reciprocal logic gates, such as communication relays and NOT gates, are exempt and can be efficiently implemented via time-symmetric protocols. For all other computations, though, time-asymmetric control must be used to avoid dissipation arising from nonreciprocity.
Revised:  Explicit simulations of work production closely track the error-dissipation tradeoff in steady-state transformations of genetic information carried out by URLanisms.
Edit intent: meaning-changed
Original:  We identify the tuning parameters , which are consistent with experiments , and show that scale-free neural avalanches occur only at the critical point .
Revised:  The neural avalanches are defined using causal connections between the firing neurons. We analyze the scaling of causal neural avalanches as the critical point is approached from the absorbing phase. By using cluster analysis tools from percolation theory, we characterize the critical properties of the neural avalanches. We identify the tuning parameters , which are consistent with experiments , and show that scale-free neural avalanches occur only at the critical point .
Edit intent: meaning-changed
Original:   Critical slowing-down and algebraic relaxation of avalanches demonstrate that the dynamics are also consistent with the system being at a critical point.
Revised:  We also find data collapse for the avalanche distribution functions, which is a stronger evidence of criticality than just the existence of power laws. Critical slowing-down and algebraic relaxation of avalanches demonstrate that the dynamics are also consistent with the system being at a critical point.
Edit intent: meaning-changed
Original:  For this we introduce energy levels for the concepts (words ) used in the story and we also introduce the new notion of 'cogniton' as the quantum of human language. Concepts (words ) are then cognitons in different energy states as it is the case for photons in different energy states,  states of different frequency radiation , when the considered boson gas would be light .
Revised:  For this we introduce energy levels for the concepts (words ) used in the story and we also introduce the new notion of 'cogniton' as the quantum of human thought. Words (concepts ) are then cognitons in different energy states as it is the case for photons in different energy states, states of different frequency radiation , when the considered boson gas would be light .
Edit intent: clarity
Original:  Concepts (words ) are then cognitons in different energy states as it is the case for photons in different energy states,  states of different frequency radiation , when the considered boson gas would be light .
Revised:  Concepts (words ) are then cognitons in different energy states as it is the case for photons in different energy states, or states of different frequency radiation , when the considered boson gas would be light .
Edit intent: clarity
Original:  Concepts (words ) are then cognitons in different energy states as it is the case for photons in different energy states,  states of different frequency radiation , when the considered boson gas would be light .
Revised:  Concepts (words ) are then cognitons in different energy states as it is the case for photons in different energy states, states of different radiative frequency , when the considered boson gas would be light .
Edit intent: clarity
Original:  Concepts (words ) are then cognitons in different energy states as it is the case for photons in different energy states,  states of different frequency radiation , when the considered boson gas would be light .
Revised:  Concepts (words ) are then cognitons in different energy states as it is the case for photons in different energy states, states of different frequency radiation , when the considered boson gas is that of the quanta of the electromagnetic field .
Edit intent: meaning-changed
Original:  We investigate the issue of 'identity and indistinguishability' from this new perspective and conjecture that the way one can easily understand how two  'the same concepts' are 'absolutely identical and indistinguishable' in human language is also the way in which quantum particles are absolutely identical and indistinguishable in physical reality, providing  new evidence for our conceptuality interpretation of quantum theory.
Revised:  We investigate the issue of 'identity and indistinguishability' from this new perspective and conjecture that the way one can easily understand how two of 'the same concepts' are 'absolutely identical and indistinguishable' in human language is also the way in which quantum particles are absolutely identical and indistinguishable in physical reality, providing new evidence for our conceptuality interpretation of quantum theory.
Edit intent: clarity
Original:  We investigate the issue of 'identity and indistinguishability' from this new perspective and conjecture that the way one can easily understand how two  'the same concepts' are 'absolutely identical and indistinguishable' in human language is also the way in which quantum particles are absolutely identical and indistinguishable in physical reality, providing  new evidence for our conceptuality interpretation of quantum theory.
Revised:  We investigate the issue of 'identity and indistinguishability' from this new perspective and conjecture that the way one can easily understand how two 'the same concepts' are 'absolutely identical and indistinguishable' in human language is also the way in which quantum particles are absolutely identical and indistinguishable in physical reality, providing in this way new evidence for our conceptuality interpretation of quantum theory.
Edit intent: coherence
Original: Major depression , also known as clinical depression, is a constant sense of despair and hopelessness. It is a major mental disorder that can affect people of any age including children and that affect negatively person's personal life, work life, social life and health conditions. Globally, over 300 million people of all ages are estimated to suffer from clinical depression. A deep recurrent neural network-based framework is presented in this paper to detect depression and to predict its severity level from speech.
Revised: Clinical depression or Major Depressive Disorder (MDD) is a common and serious medical illness. In this paper, a deep recurrent neural network-based framework is presented in this paper to detect depression and to predict its severity level from speech.
Edit intent: clarity
Original:  To overcome the problem of the small size of Speech Depression Recognition (SDR) datasets, data augmentation techniques are used to expand the labeled training set and also transfer learning is performed where the proposed model is trained on a related task and reused as starting point for the proposed model on SDR task .
Revised:  To overcome the problem of the small size of Speech Depression Recognition (SDR) datasets, expanding training labels and transferred features are considered. The proposed approach outperforms the state-of-art approaches on the DAIC-WOZ database with an overall accuracy of 76.27\% and a root mean square error of 0.4 in assessing depression, while a root mean square error of 0.168 is achieved in predicting the depression severity levels .
Edit intent: meaning-changed
Original:  The proposed framework is evaluated on the DAIC-WOZ corpus of the AVEC2017 challenge and promising results are obtained. An overall accuracy of 76.27%DIFDELCMD < \\%%% %DIF < with a root mean square error of 0.4 is achieved in assessing depression, while a root mean square error of 0.168 is achieved in predicting the depression severity levels.abstract 
Revised:  The proposed framework %DIFDELCMD < \\%%% %DIF < with a root mean square error of 0.4 is achieved in assessing depression, while a root mean square error of 0.168 is achieved in predicting the depression severity levels.abstract 
Edit intent: clarity
Original:  An overall accuracy of 76.27%DIFDELCMD < \\%%% %DIF < with a root mean square error of 0.4 is achieved in assessing depression, while a root mean square error of 0.168 is achieved in predicting the depression severity levels.abstract 
Revised:  An overall accuracy of 76.27%DIFDELCMD < \\%%% %DIF < with a root mean square error of 0.4 is achieved in assessing depression, while a root mean square error of 0.168 is achieved in predicting the depression severity levels.abstract has several advantages (fastness, non-invasiveness, and non-intrusion), which makes it convenient for real-time applications. The performances of the proposed approach are evaluated under a multi-modal and a multi-features experiments. MFCC based high-level features hold relevant information related to depression. Yet, adding visual action units and different other acoustic features further boosts the classification results by 20\% and 10\% to reach an accuracy of 95.6\% and 86\%, respectively. Considering visual-facial modality needs to be carefully studied as it sparks patient privacy concerns while adding more acoustic features increases the computation time.
Edit intent: meaning-changed
Original: A simple drawing {\em  D(G) of a graph G = (V,E) is a drawing in which two edges have at most one point in common that is either an endpoint or a proper crossing.
Revised: A simple drawing {\em simple drawing D(G) of a graph G = (V,E) is a drawing in which two edges have at most one point in common that is either an endpoint or a proper crossing.
Edit intent: meaning-changed
Original:  An edge e from the complement of G can be inserted {\em  into D(G) if there exists a simple drawing of G ' = (V, E\cup \{e \ D(G) as a subdrawing.
Revised:  An edge e in the complement of G can be inserted {\em into D(G) if there exists a simple drawing of G ' = (V, E\cup \{e \ D(G) as a subdrawing.
Edit intent: clarity
Original:  An edge e from the complement of G can be inserted {\em  into D(G) if there exists a simple drawing of G ' = (V, E\cup \{e \ D(G) as a subdrawing.
Revised:  An edge e from the complement of G can be {\em into D(G) if there exists a simple drawing of G ' = (V, E\cup \{e \ D(G) as a subdrawing.
Edit intent: clarity
Original:  An edge e from the complement of G can be inserted {\em  into D(G) if there exists a simple drawing of G ' = (V, E\cup \{e \ D(G) as a subdrawing.
Revised:  An edge e from the complement of G can be inserted {\em inserted into D(G) if there exists a simple drawing of G ' = (V, E\cup \{e \ D(G) as a subdrawing.
Edit intent: meaning-changed
Original:  An edge e from the complement of G can be inserted {\em  into D(G) if there exists a simple drawing of G ' = (V, E\cup \{e \ D(G) as a subdrawing.
Revised:  An edge e from the complement of G can be inserted {\em into D(G) if there exists a simple drawing of G +e extending D(G) as a subdrawing.
Edit intent: meaning-changed
Original:  An edge e from the complement of G can be inserted {\em  into D(G) if there exists a simple drawing of G ' = (V, E\cup \{e \ D(G) as a subdrawing. We show that it is NP-complete to decide whether a given edge can be inserted into a simple drawing , by this solving an open question by Arroyo, Derka, and Parada and a pseudosegment \sigma, it can be decided in polynomial time whether there exists a pseudocircle \Phi_\sigma extending \sigma for which \mathcal{A}\cup\{\Phi_\sigma\} is again an arrangement of pseudocircles} .
Revised:  An edge e from the complement of G can be inserted {\em into D(G) if there exists a simple drawing of G ' = (V, E\cup \{e \ D(G) . As a result of Levi's Enlargement Lemma, if a drawing is rectilinear (pseudolinear), that is, the edges can be extended into an arrangement of lines (pseudolines), then any edge in the complement of G can be inserted. In contrast, we show that it is NP-complete to decide whether a given edge can be inserted into a simple drawing , by this solving an open question by Arroyo, Derka, and Parada and a pseudosegment \sigma, it can be decided in polynomial time whether there exists a pseudocircle \Phi_\sigma extending \sigma for which \mathcal{A}\cup\{\Phi_\sigma\} is again an arrangement of pseudocircles} .
Edit intent: meaning-changed
Original:  We show that it is NP-complete to decide whether a given edge can be inserted into a simple drawing , by this solving an open question by Arroyo, Derka, and Parada and a pseudosegment \sigma, it can be decided in polynomial time whether there exists a pseudocircle \Phi_\sigma extending \sigma for which \mathcal{A}\cup\{\Phi_\sigma\} is again an arrangement of pseudocircles} .
Revised:  We show that it is NP -complete to decide whether a given edge can be inserted into a simple drawing , by this solving an open question by Arroyo, Derka, and Parada and a pseudosegment \sigma, it can be decided in polynomial time whether there exists a pseudocircle \Phi_\sigma extending \sigma for which \mathcal{A}\cup\{\Phi_\sigma\} is again an arrangement of pseudocircles} .
Edit intent: fluency
Original:  We show that it is NP-complete to decide whether a given edge can be inserted into a simple drawing , by this solving an open question by Arroyo, Derka, and Parada and a pseudosegment \sigma, it can be decided in polynomial time whether there exists a pseudocircle \Phi_\sigma extending \sigma for which \mathcal{A}\cup\{\Phi_\sigma\} is again an arrangement of pseudocircles} .
Revised:  We show that it is NP-complete to decide whether one edge can be inserted into a simple drawing , by this solving an open question by Arroyo, Derka, and Parada and a pseudosegment \sigma, it can be decided in polynomial time whether there exists a pseudocircle \Phi_\sigma extending \sigma for which \mathcal{A}\cup\{\Phi_\sigma\} is again an arrangement of pseudocircles} .
Edit intent: clarity
Original:  We show that it is NP-complete to decide whether a given edge can be inserted into a simple drawing , by this solving an open question by Arroyo, Derka, and Parada and a pseudosegment \sigma, it can be decided in polynomial time whether there exists a pseudocircle \Phi_\sigma extending \sigma for which \mathcal{A}\cup\{\Phi_\sigma\} is again an arrangement of pseudocircles} .
Revised:  We show that it is NP-complete to decide whether a given edge can be inserted into a simple drawing . This remains true even if we assume that the drawing is pseudocircular, that is, the edges can be extended to an arrangement of pseudocircles. On the positive side, we show that, given an arrangement of pseudocircles \mathcal{A and a pseudosegment \sigma, it can be decided in polynomial time whether there exists a pseudocircle \Phi_\sigma extending \sigma for which \mathcal{A}\cup\{\Phi_\sigma\} is again an arrangement of pseudocircles} .
Edit intent: coherence
Original:  We also study app performance (web browsing and HTTP download) over 5G , and how Internet server selection affects the end-to-end performance for 5G users.
Revised:  We explore the feasibility of using location and possibly other environmental information to predict the network performance. We also study the app performance (web browsing and HTTP download) over 5G , and how Internet server selection affects the end-to-end performance for 5G users.
Edit intent: meaning-changed