wanyu/IteraTeR_full_sent huggingface dataset:
Original:  We also compared the DTF model with random forest and logistic regression models and found that the DTF outperformed the two methods. A further look at the predictive performance of the DTF on the basis of individual cell lines found that the DTF showed an AUC greater than 0.90 for the majority of the cell lines . Applying the DTF model to predict missing entries in our drug-cell line tensor, we identified novel synergistic drug combinations for 27 cell lines from the six cancer types.
Revised:  We also compared the DTF model with random forest and logistic regression models and found that the DTF outperformed the logistic regression model and achieved almost the same performance as DeepSynergy using several typical metrics for the classification task . Applying the DTF model to predict missing entries in our drug-cell line tensor, we identified novel synergistic drug combinations for 27 cell lines from the six cancer types.
Edit intent: meaning-changed
Original:  A further look at the predictive performance of the DTF on the basis of individual cell lines found that the DTF showed an AUC greater than 0.90 for the majority of the cell lines . Applying the DTF model to predict missing entries in our drug-cell line tensor, we identified novel synergistic drug combinations for 27 cell lines from the six cancer types.
Revised:  A further look at the predictive performance of the DTF on the basis of individual cell lines found that the DTF showed an AUC greater than 0.90 for the majority of the cell lines . Applying the DTF model to predict missing entries in our drug-cell line tensor, we identified novel synergistic drug combinations for 10 cell lines from the six cancer types.
Edit intent: meaning-changed
Original:  A further look at the predictive performance of the DTF on the basis of individual cell lines found that the DTF showed an AUC greater than 0.90 for the majority of the cell lines . Applying the DTF model to predict missing entries in our drug-cell line tensor, we identified novel synergistic drug combinations for 27 cell lines from the six cancer types.
Revised:  A further look at the predictive performance of the DTF on the basis of individual cell lines found that the DTF showed an AUC greater than 0.90 for the majority of the cell lines . Applying the DTF model to predict missing entries in our drug-cell line tensor, we identified novel synergistic drug combinations for 27 cell lines from the 5 cancer types.
Edit intent: meaning-changed
Original: Social categorizations are an important aspect of human society, dividing people into "us" and "them  " often along  attributes such as race or even political ideology . Social categorizations can, on the one hand, lead to a sense of belonging, and on the other hand, fuel conflicts.
Revised: Social categorizations are an important aspect of human society, dividing people into "us" and "them " often along attributes such as political ideology or skin color. This division results in both positive consequences, such as a sense of belonging, and on the other hand, fuel conflicts.
Edit intent: meaning-changed
Original:  Social categorizations can, on the one hand, lead to a sense of belonging, and on the other hand, fuel conflicts. Thus, it is vital to understand where and how the boundaries for social categories form. We present a dynamical systems model for the formation of two social groups  on a continuous attribute.
Revised:  Social categorizations can, on the one hand, lead to a sense of community, and negative ones, such as group conflict. Further, individuals in the middle of the spectrum can fall through the cracks of this categorization process and are seen as out-group by individuals on either side of the spectrum, becoming inbetweeners. Here, we propose a quantitative, dynamical-system model that studies the joint influence of cognitive and social processes. We model where two social groups on a continuous attribute.
Edit intent: coherence
Original:   We test the model's prediction using US political survey data on how political independents are perceived by registered party members , as well as existing experiments on the perception of racially ambiguous faces, and find support .
Revised:  As a result, each group sees the individuals in the middle of the attribute space as an out-group. We test the model's prediction using US political survey data on how political independents are perceived by registered party members , as well as existing experiments on the perception of racially ambiguous faces, and find support .
Edit intent: meaning-changed
Original:   We test the model's prediction using US political survey data on how political independents are perceived by registered party members , as well as existing experiments on the perception of racially ambiguous faces, and find support . Our model suggests that inbetweeners can arise as the result of both groups drawing a more restrictive boundary than the middle of the spectrum, motivated by improving categorization accuracy alone. The model prediction is general and may be extended to social categorization along many other attributes .
Revised:  We test the model's prediction using US political survey data on how political independents are perceived by registered party members , as well as existing experiments on the perception of racially ambiguous faces, and find support .
Edit intent: coherence
Original:  Gray matter segments resulting from voxel-based morphometry preprocessing of N = 1753 cisgender (CG) healthy participants were used to train (N=1402) and validate (20 \% hold-out  N = 351) a support vector machine classifying the biological sex.
Revised:  Gray matter segments resulting from voxel-based morphometry preprocessing of N = 1753 cisgender (CG) healthy participants were used to train (N=1402) and validate (20 \% hold-out ; N = 351) a support vector machine classifying the biological sex.
Edit intent: fluency
Original:  Gray matter segments resulting from voxel-based morphometry preprocessing of N = 1753 cisgender (CG) healthy participants were used to train (N=1402) and validate (20 \% hold-out  N = 351) a support vector machine classifying the biological sex.
Revised:  Gray matter segments resulting from voxel-based morphometry preprocessing of N = 1753 cisgender (CG) healthy participants were used to train (N=1402) and validate (20 \% hold-out N = 351) a support-vector machine classifying the biological sex.
Edit intent: fluency
Original:  A third validation was performed using the matched CG sample of the transgender women ( TW) application sample . Subsequently, the classifier was applied to N = 25 TW . Finally, we compared brain volumes of CG-men, women and TW pre /post treatment ( CHT ) in a univariate analysis controlling for sexual orientation, age and total brain volume.
Revised:  A third validation was performed using the matched CG sample of the transgender women ( TWs) application-sample . Subsequently, the classifier was applied to N = 25 TW . Finally, we compared brain volumes of CG-men, women and TW pre /post treatment ( CHT ) in a univariate analysis controlling for sexual orientation, age and total brain volume.
Edit intent: clarity
Original:  A third validation was performed using the matched CG sample of the transgender women ( TW) application sample . Subsequently, the classifier was applied to N = 25 TW . Finally, we compared brain volumes of CG-men, women and TW pre /post treatment ( CHT ) in a univariate analysis controlling for sexual orientation, age and total brain volume.
Revised:  A third validation was performed using the matched CG sample of the transgender women ( TW) application sample . Subsequently, the classifier was applied to N = 26 TWs . Finally, we compared brain volumes of CG-men, women and TW pre /post treatment ( CHT ) in a univariate analysis controlling for sexual orientation, age and total brain volume.
Edit intent: meaning-changed
Original:  A third validation was performed using the matched CG sample of the transgender women ( TW) application sample . Subsequently, the classifier was applied to N = 25 TW . Finally, we compared brain volumes of CG-men, women and TW pre /post treatment ( CHT ) in a univariate analysis controlling for sexual orientation, age and total brain volume.
Revised:  A third validation was performed using the matched CG sample of the transgender women ( TW) application sample . Subsequently, the classifier was applied to N = 25 TW . Finally, we compared brain volumes of CG-men, women and TW-pre /post treatment ( CHT ) in a univariate analysis controlling for sexual orientation, age and total brain volume.
Edit intent: fluency
Original:  A third validation was performed using the matched CG sample of the transgender women ( TW) application sample . Subsequently, the classifier was applied to N = 25 TW . Finally, we compared brain volumes of CG-men, women and TW pre /post treatment ( CHT ) in a univariate analysis controlling for sexual orientation, age and total brain volume.
Revised:  A third validation was performed using the matched CG sample of the transgender women ( TW) application sample . Subsequently, the classifier was applied to N = 25 TW . Finally, we compared brain volumes of CG-men, women and TW pre /post treatment ( cross-sex hormone treatment ) in a univariate analysis controlling for sexual orientation, age and total brain volume.
Edit intent: meaning-changed
Original:  The univariate analysis of the transgender application sample revealed that TW pre /post treatment show brain structural differences from CG-women and CG-men in the putamen and insula, as well as the whole-brain analysis.
Revised:  The univariate analysis of the transgender application-sample revealed that TW-pre /post treatment show brain structural differences from CG-women and CG-men in the putamen and insula, as well as the whole-brain analysis.
Edit intent: fluency
Original:  In this paper, we show how these computations in the most general case reduce to finding a canonical form of a matrix associated with a type-A quiver representation, which in turn can be computed using factorizations of associated matrices.
Revised:  In this paper, we show how these computations in the most general case reduce to finding a canonical form of a matrix associated with a type A quiver representation, which in turn can be computed using factorizations of associated matrices.
Edit intent: fluency
Original:  The EPF quantifies the transition of dissipation from local to global coherent oscillations in space and time and integrating it gives a bound on the entropy production rate. The EPF measures how microscopic irreversibility propagates to larger length and time scales and integration through frequency space bounds the net dissipation of stochastic processes .
Revised:  The EPF quantifies the transition of dissipation from local to global coherent oscillations , bounding the energetic cost to establish spatially synchronized biochemical oscillations .
Edit intent: clarity
Original:  We demonstrate the capabilities of ART on simulated and real data setsand discuss possible difficulties in achieving satisfactory predictive power .
Revised:  We demonstrate the capabilities of ART on simulated data sets, as well as experimental data from real metabolic engineering projects producing renewable biofuels, hoppy flavored beer without hops, and fatty acids. Finally, we discuss the limitations of this approach, and the practical consequences of the underlying assumptions failing .
Edit intent: meaning-changed
Original:  Using our method instead of Guided Backprop,  class activation methods such as Grad-CAM , Grad-CAM+ + and Smooth Grad-CAM + + will run several orders of magnitude faster, have a significantly smaller memory footprint and be more accurate .
Revised:  Using our method instead of Guided Backprop, coarse-resolution class activation methods such as Grad-CAM , Grad-CAM+ + and Smooth Grad-CAM + + will run several orders of magnitude faster, have a significantly smaller memory footprint and be more accurate .
Edit intent: meaning-changed
Original:  Using our method instead of Guided Backprop,  class activation methods such as Grad-CAM , Grad-CAM+ + and Smooth Grad-CAM + + will run several orders of magnitude faster, have a significantly smaller memory footprint and be more accurate .
Revised:  Using our method instead of Guided Backprop, class activation methods such as Grad-CAM and Grad-CAM+ + and Smooth Grad-CAM + + will run several orders of magnitude faster, have a significantly smaller memory footprint and be more accurate .
Edit intent: meaning-changed
Original:  Using our method instead of Guided Backprop,  class activation methods such as Grad-CAM , Grad-CAM+ + and Smooth Grad-CAM + + will run several orders of magnitude faster, have a significantly smaller memory footprint and be more accurate .
Revised:  Using our method instead of Guided Backprop, class activation methods such as Grad-CAM , Grad-CAM+ + + will run several orders of magnitude faster, have a significantly smaller memory footprint and be more accurate .
Edit intent: coherence
Original:  Using our method instead of Guided Backprop,  class activation methods such as Grad-CAM , Grad-CAM+ + and Smooth Grad-CAM + + will run several orders of magnitude faster, have a significantly smaller memory footprint and be more accurate .
Revised:  Using our method instead of Guided Backprop, class activation methods such as Grad-CAM , Grad-CAM+ + and Smooth Grad-CAM + seem to yield demonstrably superior results without sacrificing speed .
Edit intent: meaning-changed
Original:  This will make such methods feasible on resource limited platforms such as robots, cell phones and low cost industrial devices. This will also significantly help them work in extremely data intensive applications such as satellite image processing. All without sacrificing accuracy. Our method is generally straight forward and should be applicable to the most commonly used CNNs. We also show examples of our method used to enhance Grad-CAM++ .
Revised:  This will make such methods feasible on resource limited platforms such as robots, cell phones , low-cost industrial devices, astronomy and satellite imagery .
Edit intent: clarity
Original: During the past decade, rapid advancements in sequencing technologies have enabled the study of human-associated microbiomes at an unprecedented scale. Metagenomics, specifically, is emerging as a clinical tool to identify the agents of infection, track the spread of diseases, and surveil potential pathogens.
Revised: During the past decade, rapid advancements in sequencing technologies have enabled the study of human-associated microbiome is closely tied to human health and is of substantial clinical interest. Metagenomics-based tools are emerging for clinical diagnostics, tracking the spread of diseases, and surveil potential pathogens.
Edit intent: meaning-changed
Original:  Yet, despite advances in high-throughput sequencing technologies and bioinformatics algorithms, metagenomics still has limitations barring mass clinical acceptance and broad implementation. Algorithms currently struggle to balance sensitivity and specificity of discovered biomarkers, genomic reference databases are incomplete, and studies are frequently not reproducible beyond the original environmental settings.
Revised:  Yet, despite advances in high-throughput sequencing technologies and bioinformatics algorithms, metagenomics still has limitations barring the tools from clinical validation.
Edit intent: clarity
Original:  Here we present an overview of metagenomics methods with a discussion of computational challenges and limitations . Our review covers clinical applications and presents applications for strain identification of Mycobacterium tuberculosis (TB), identification of infectious agents in cases of encephalitis, biomarkers for Inflammatory Bowel Disease, and explores the challenges of sampling the microbiome in various tissues. Our review also summarizes 11 of the most recent clinical metagenomics studies and discusses their commonalities and unique features .
Revised:  Here we present an overview of metagenomics methods with a discussion of computational challenges and limitations .
Edit intent: coherence
Original: A       signed graph is a graph with a sign assignment to its edges.
Revised: A if it is chordal, and every cycle of even length larger than 6 has an odd chord (a chord that connects two vertices that are an odd distance apart in the cycle). In this work, we show that a graph is strongly chordal if and only if it has an intersection representation by unit balls in a signed graph is a graph with a sign assignment to its edges.
Edit intent: meaning-changed
Original:  The Sitting Closer to Friends than Enemies (SCFE ) problem is to find an injection of the vertex set of a given signed graph into a metric space such that  for every pair of incident edges with different signs  the end vertices of the positive edge are injected closer in the space than the end vertices of the negative edge.
Revised:  The SCFE problem is to find an injection of the vertex set of a given signed graph into a metric space such that for every pair of incident edges with different signs the end vertices of the positive edge are injected closer in the space than the end vertices of the negative edge.
Edit intent: clarity
Original:  The Sitting Closer to Friends than Enemies (SCFE ) problem is to find an injection of the vertex set of a given signed graph into a metric space such that  for every pair of incident edges with different signs  the end vertices of the positive edge are injected closer in the space than the end vertices of the negative edge.
Revised:  The Sitting Closer to Friends than Enemies (SCFE ) problem is to find an injection of the vertex set of a given signed graph into a metric space such that , for every pair of incident edges with different signs the end vertices of the positive edge are injected closer in the space than the end vertices of the negative edge.
Edit intent: fluency
Original:  The Sitting Closer to Friends than Enemies (SCFE ) problem is to find an injection of the vertex set of a given signed graph into a metric space such that  for every pair of incident edges with different signs  the end vertices of the positive edge are injected closer in the space than the end vertices of the negative edge.
Revised:  The Sitting Closer to Friends than Enemies (SCFE ) problem is to find an injection of the vertex set of a given signed graph into a metric space such that for every pair of incident edges with different signs , the end vertices of the positive edge are injected closer in the space than the end vertices of the negative edge.
Edit intent: fluency
Original:  Such an injection is called a valid distance drawing. In this document, we study the SCFE problem in real trees (also known as \mathbb{R show that a complete signed graph has a valid distance drawing in a real tree if  and only if  its subgraph composed of all (and only) its positive edges is strongly chordal .
Revised:  Such an injection is called a valid distance drawing show that a complete signed graph has a valid distance drawing in a real tree if and only if its subgraph composed of all (and only) its positive edges is strongly chordal .
Edit intent: clarity
Original:  In this document, we study the SCFE problem in real trees (also known as \mathbb{R show that a complete signed graph has a valid distance drawing in a real tree if  and only if  its subgraph composed of all (and only) its positive edges is strongly chordal .
Revised:  In this document, we study the SCFE problem in real trees (also known as \mathbb{R. Using the characterization for strongly chordal graphs, we show that a complete signed graph has a valid distance drawing in a real tree if and only if its subgraph composed of all (and only) its positive edges is strongly chordal .
Edit intent: meaning-changed
Original:  In this document, we study the SCFE problem in real trees (also known as \mathbb{R show that a complete signed graph has a valid distance drawing in a real tree if  and only if  its subgraph composed of all (and only) its positive edges is strongly chordal .
Revised:  In this document, we study the SCFE problem in real trees (also known as \mathbb{R show that a complete signed graph has a valid distance drawing in a real tree if , and only if its subgraph composed of all (and only) its positive edges is strongly chordal .
Edit intent: fluency
Original:  In this document, we study the SCFE problem in real trees (also known as \mathbb{R show that a complete signed graph has a valid distance drawing in a real tree if  and only if  its subgraph composed of all (and only) its positive edges is strongly chordal .
Revised:  In this document, we study the SCFE problem in real trees (also known as \mathbb{R show that a complete signed graph has a valid distance drawing in a real tree if and only if , its subgraph composed of all (and only) its positive edges is strongly chordal .
Edit intent: fluency
Original:  In this document, we study the SCFE problem in real trees (also known as \mathbb{R show that a complete signed graph has a valid distance drawing in a real tree if  and only if  its subgraph composed of all (and only) its positive edges is strongly chordal . Furthermore, as an instrumental result, we show that the set of strongly chordal graphs is equal to the set of graphs with an intersection model of unit balls, proper balls, and balls in a real tree .
Revised:  In this document, we study the SCFE problem in real trees (also known as \mathbb{R show that a complete signed graph has a valid distance drawing in a real tree if and only if its subgraph composed of all (and only) its positive edges is strongly chordal .
Edit intent: meaning-changed
Original:  There have been numerous attempts to define and mathematically formulate this concept in various  scientific fields in literature . The current indirect effects formulations for an economic system represent the sum of the subsequent gross outputs of goods and services at each step of a production chain to supply the final demands, generally after the first gross outputs from each sector in the system.
Revised:  There have been numerous attempts to define and mathematically formulate this concept in various scientific fields in literature as well. The existing indirect effects formulations for an economic system represent the sum of the subsequent gross outputs of goods and services at each step of a production chain to supply the final demands, generally after the first gross outputs from each sector in the system.
Edit intent: clarity
Original:  These existing formulations cannot quantify the indirect interactions  between any two sectors . The indirect transactions between two sectors of an economic system and the corresponding indirect requirements  are introduced in the present article , based on the system decomposition theory .
Revised:  These existing formulations cannot quantify the indirect interactions between any two sectors of an economic system. Therefore, although the direct and total requirement matrices are formulated and used for economic system analysis, the indirect requirements matrices has never been formulated before. Based on the system decomposition theory, the indirect transactions between two sectors of an economic system and the corresponding indirect requirements are introduced in the present article , based on the system decomposition theory .
Edit intent: meaning-changed