wanyu/IteraTeR_full_sent huggingface dataset:
Original: This work considers the following extension of the tree-depth problem : for a given input graph G and integers k and b, find a rooted forest F of height at most k and width at most b (defined as the maximum number of vertices allowed in a level of F) such that G is a subgraph of the closure of F . We are interested in the case when G is a line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive b-approximation algorithm.
Revised: This work considers the following extension of the tree-depth problem : for a given input graph G and integers k and b, find a rooted forest F of height at most k and width at most b (defined as the maximum number of vertices allowed in a level of F) such that G is a subgraph of the closure of F . We are interested in the case when G is a line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm.
Edit intent: meaning-changed
Original:  This particular class of graphs received a significant attention in the past, mainly due to a number of potential applications it provides. These include applications in parallel processing , e.g. , parallel assembly of modular products, or parallel query processing in relational databases, as well as purely combinatorial applications, including searching in tree-like partial orders (which in turn generalizes binary search on sorted data) .
Revised:  This particular class of graphs received a significant attention in the past, mainly due to a number of potential applications , e.g. , parallel assembly of modular products, or parallel query processing in relational databases, as well as purely combinatorial applications, including searching in tree-like partial orders (which in turn generalizes binary search on sorted data) .
Edit intent: clarity
Original:  These include applications in parallel processing , e.g. , parallel assembly of modular products, or parallel query processing in relational databases, as well as purely combinatorial applications, including searching in tree-like partial orders (which in turn generalizes binary search on sorted data) .
Revised:  These include applications in parallel processing , e.g. in parallel assembly of modular products, or parallel query processing in relational databases, as well as purely combinatorial applications, including searching in tree-like partial orders (which in turn generalizes binary search on sorted data) .
Edit intent: fluency
Original:  These include applications in parallel processing , e.g. , parallel assembly of modular products, or parallel query processing in relational databases, as well as purely combinatorial applications, including searching in tree-like partial orders (which in turn generalizes binary search on sorted data) . The latter can be used for automated program testing .
Revised:  These include applications in parallel processing , e.g. , parallel assembly of modular products, or parallel query processing in relational databases, as well as purely combinatorial applications, including searching in tree-like partial orders (which in turn generalizes binary search on sorted data) .
Edit intent: coherence
Original: Self-supervised acoustic pre-training has achieved impressive results on low-resource speech recognition tasks .
Revised: Self-supervised acoustic pre-training has achieved impressive results on the task of automatic speech recognition (ASR). For low-resource ASR tasks, however, labeled data can hardly satisfy the demand of end-to-end models. Self-supervised acoustic pre-training has already shown its amazing ASR performance, while the transcription is still inadequate for language modeling in end-to-end models .
Edit intent: meaning-changed
Original:  In this work, we propose an end-to-end model for the low-resource speech recognition, which fuses a pre-trained audio encoder (wav2vec2.0) and a pre-trained text decoder (BERT) .
Revised:  In this work, we propose an end-to-end model for the low-resource speech recognition, which fuses a pre-trained acoustic encoder (wav2vec2.0) and a pre-trained text decoder (BERT) .
Edit intent: fluency
Original:  In this work, we propose an end-to-end model for the low-resource speech recognition, which fuses a pre-trained audio encoder (wav2vec2.0) and a pre-trained text decoder (BERT) .
Revised:  In this work, we propose an end-to-end model for the low-resource speech recognition, which fuses a pre-trained audio encoder (wav2vec2.0) and a pre-trained linguistic encoder (BERT) .
Edit intent: clarity
Original:  In this work, we propose an end-to-end model for the low-resource speech recognition, which fuses a pre-trained audio encoder (wav2vec2.0) and a pre-trained text decoder (BERT) . The two modules are connected by a linear attention mechanism without parameters.
Revised:  In this work, we propose an end-to-end model for the low-resource speech recognition, which fuses a pre-trained audio encoder (wav2vec2.0) and a pre-trained text decoder (BERT) into an end-to-end ASR model. The fused model only needs to learn the transfer from speech to language during fine-tuning on limited labeled data. The length of the two modalities is matched by a monotonic attention mechanism without parameters.
Edit intent: meaning-changed
Original: Since March 2020, companies nationwide have started work from home (WFH) due to the rapid increase of COVID-19 confirmed cases in an attempt to help prevent the coronavirus from spreading and rescue the economy from the pandemic.
Revised: Since March 2020, companies nationwide have started work from home (WFH) due to the rapid increase of confirmed COVID-19 cases in an attempt to help prevent the coronavirus from spreading and rescue the economy from the pandemic.
Edit intent: fluency
Original:  However, due to the limited sample size in surveys and the dynamic topics over time , we instead conduct a large-scale social media study using Twitter data to portrait different groups who have positive/negative opinions about WFH.
Revised:  However, the findings are limited due to small sample size and the dynamic topics over time , we instead conduct a large-scale social media study using Twitter data to portrait different groups who have positive/negative opinions about WFH.
Edit intent: clarity
Original:  However, due to the limited sample size in surveys and the dynamic topics over time , we instead conduct a large-scale social media study using Twitter data to portrait different groups who have positive/negative opinions about WFH.
Revised:  However, due to the limited sample size in surveys and the dynamic topics over time . This study aims to understand the U.S. public opinions on working from home during the COVID-19 pandemic. We conduct a large-scale social media study using Twitter data to portrait different groups who have positive/negative opinions about WFH.
Edit intent: meaning-changed
Original:  We present heuristic upper bounds for the  biomass density and the number density of motile lifeforms for the Martian subsurface and the ocean of Enceladus by presuming that the motile microbes in question derive their energy from methanogenesis.
Revised:  We present heuristic upper bounds for the average biomass density and the number density of motile lifeforms for the Martian subsurface and the ocean of Enceladus by presuming that the motile microbes in question derive their energy from methanogenesis.
Edit intent: meaning-changed
Original:  Classifying  industries according to their contribution to system-related uncertainty across business cycles, we uncover an uncertainty hub role for the communications, industrials and information technology sectors, while shocks to materials, real estate and utilities do not propagate strongly across the network.
Revised:  Classifying U.S. industries according to their contribution to system-related uncertainty across business cycles, we uncover an uncertainty hub role for the communications, industrials and information technology sectors, while shocks to materials, real estate and utilities do not propagate strongly across the network.
Edit intent: meaning-changed
Original:  Classifying  industries according to their contribution to system-related uncertainty across business cycles, we uncover an uncertainty hub role for the communications, industrials and information technology sectors, while shocks to materials, real estate and utilities do not propagate strongly across the network.
Revised:  Classifying industries according to their contribution to system-related uncertainty across business cycles, we uncover an uncertainty hub role for the communications, industrials and information technology sectors, while shocks to materials, real estate and utilities do not create strong linkages in the network.
Edit intent: clarity
Original: In an undirected graph  , a matching cut is an edge cut which is also a matching. we refer MATCHING CUT to the problemof deciding if a given graph contain a matching cut or not.
Revised: Given a positive integer d, the d-CUT problem is to decide if an undirected graph , a matching cut is an edge cut which is also a matching. we refer MATCHING CUT to the problemof deciding if a given graph contain a matching cut or not.
Edit intent: meaning-changed
Original: In an undirected graph  , a matching cut is an edge cut which is also a matching. we refer MATCHING CUT to the problemof deciding if a given graph contain a matching cut or not.
Revised: In an undirected graph G=(V,E) has a non trivial bipartition (A,B) of V such that every vertex in A (resp. B) has at most d neighbors in B (resp. A). When d=1, this is the MATCHING CUT problem. Gomes and Sau, in IPEC 2019, gave the first fixed parameter tractable algorithm for d-CUT, when parameterized by maximum number of the crossing edges in the cut (i.e. the size of edge cut). However , a matching cut is an edge cut which is also a matching. we refer MATCHING CUT to the problemof deciding if a given graph contain a matching cut or not.
Edit intent: meaning-changed
Original: In an undirected graph  , a matching cut is an edge cut which is also a matching. we refer MATCHING CUT to the problemof deciding if a given graph contain a matching cut or not. For the matching cut problem, the size of the edge cut also known as the number of crossing edges is a natural parameter.Gomes et al. in \mbox{%DIFAUXCMD Gomes-Sau0pt%DIFAUXCMD showed that MATCHING CUT is FPT when parameterized by maximum size of the edge cutusing a reduction on results provided by Marx et. al \mbox{%DIFAUXCMD marx_treewidth_reduction}0pt%DIFAUXCMD . However,
Revised: In an undirected graph , 0pt%DIFAUXCMD showed that MATCHING CUT is FPT when parameterized by maximum size of the edge cutusing a reduction on results provided by Marx et. al \mbox{%DIFAUXCMD marx_treewidth_reduction}0pt%DIFAUXCMD . However,
Edit intent: clarity
Original:  they didn}  't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{%DIFAUXCMD marx_treewidth_reduction relies on a MSOL formulation for matching cut and Courcelle's Theorem \mbox{%DIFAUXCMD courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Revised:  they didn} their paper doesn 't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{%DIFAUXCMD marx_treewidth_reduction relies on a MSOL formulation for matching cut and Courcelle's Theorem \mbox{%DIFAUXCMD courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Edit intent: clarity
Original:  they didn}  't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{%DIFAUXCMD marx_treewidth_reduction relies on a MSOL formulation for matching cut and Courcelle's Theorem \mbox{%DIFAUXCMD courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Revised:  they didn} 't provide an explicit bound on the running time , as it indirectly relies on a MSOL formulation for matching cut and Courcelle's Theorem \mbox{%DIFAUXCMD courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Edit intent: clarity
Original:  they didn}  't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{%DIFAUXCMD marx_treewidth_reduction relies on a MSOL formulation for matching cut and Courcelle's Theorem \mbox{%DIFAUXCMD courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Revised:  they didn} 't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{%DIFAUXCMD marx_treewidth_reduction relies on a MSOL formulation and Courcelle's Theorem \mbox{%DIFAUXCMD courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Edit intent: fluency
Original:  they didn}  't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{%DIFAUXCMD marx_treewidth_reduction relies on a MSOL formulation for matching cut and Courcelle's Theorem \mbox{%DIFAUXCMD courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Revised:  they didn} 't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{%DIFAUXCMD marx_treewidth_reduction relies on a MSOL formulation for matching cut and Courcelle's Theorem . Motivated by this, we design and present an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit.
Edit intent: coherence
Original:  they didn}  't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{%DIFAUXCMD marx_treewidth_reduction relies on a MSOL formulation for matching cut and Courcelle's Theorem \mbox{%DIFAUXCMD courcelle1990monadic an FPT algorithm for the MATCHING CUT where the dependence on the parameter is explicit. In this paper we present an FPT algorithm for matching cut problem for general graphs with running time O( 2^{O(k\log k)}n^{O(1)} ) . This is the first FPT algorithm for the MATCHING CUT where the dependence on the matching cut size as a parameter is explicit and bounded .
Revised:  they didn} 't provide an explicit bound on the running time as the treewidth reduction technique of \mbox{%DIFAUXCMD marx_treewidth_reduction relies on a MSOL formulation for matching cut and Courcelle's Theorem \mbox{%DIFAUXCMD courcelle1990monadic an FPT algorithm for the MATCHING CUT (and more generally for d-CUT) for general graphs with running time O( 2^{O(k\log k)}n^{O(1)} ) . This is the first FPT algorithm for the MATCHING CUT where the dependence on the matching cut size as a parameter is explicit and bounded .
Edit intent: meaning-changed
Original:  In this paper we present an FPT algorithm for matching cut problem for general graphs with running time O( 2^{O(k\log k)}n^{O(1)} ) . This is the first FPT algorithm for the MATCHING CUT where the dependence on the matching cut size as a parameter is explicit and bounded .
Revised:  In this paper we present an FPT algorithm for matching cut problem for general graphs with running time 2^{O(k\log k)}n^{O(1)} ) . This is the first FPT algorithm for the MATCHING CUT where the dependence on the matching cut size as a parameter is explicit and bounded .
Edit intent: fluency
Original:  In this paper we present an FPT algorithm for matching cut problem for general graphs with running time O( 2^{O(k\log k)}n^{O(1)} ) . This is the first FPT algorithm for the MATCHING CUT where the dependence on the matching cut size as a parameter is explicit and bounded .
Revised:  In this paper we present an FPT algorithm for matching cut problem for general graphs with running time O( 2^{O(k\log k)}n^{O(1)} where k is the maximum size of the edge cut . This is the first FPT algorithm for the MATCHING CUT where the dependence on the matching cut size as a parameter is explicit and bounded .
Edit intent: meaning-changed
Original:  In this paper we present an FPT algorithm for matching cut problem for general graphs with running time O( 2^{O(k\log k)}n^{O(1)} ) . This is the first FPT algorithm for the MATCHING CUT where the dependence on the matching cut size as a parameter is explicit and bounded .
Revised:  In this paper we present an FPT algorithm for matching cut problem for general graphs with running time O( 2^{O(k\log k)}n^{O(1)} ) . This is the first FPT algorithm for the MATCHING CUT (and d-CUT) with an explicit dependence on this parameter. We also observe a lower bound of 2^{\Omega(k) .
Edit intent: meaning-changed
Original:  It has been hypothesized that patterns could emerge from a water-mediated scale-dependent feedback (SDF), whereby interactions favoring plant growth dominate at short distances while growth-inhibitory interactions dominate in the long-range.
Revised:  Some theories hypothesize that patterns could emerge from a water-mediated scale-dependent feedback (SDF), whereby interactions favoring plant growth dominate at short distances while growth-inhibitory interactions dominate in the long-range.
Edit intent: clarity
Original:  It has been hypothesized that patterns could emerge from a water-mediated scale-dependent feedback (SDF), whereby interactions favoring plant growth dominate at short distances while growth-inhibitory interactions dominate in the long-range.
Revised:  It has been hypothesized that patterns could result from a scale-dependent feedback (SDF), whereby interactions favoring plant growth dominate at short distances while growth-inhibitory interactions dominate in the long-range.
Edit intent: clarity
Original:  It has been hypothesized that patterns could emerge from a water-mediated scale-dependent feedback (SDF), whereby interactions favoring plant growth dominate at short distances while growth-inhibitory interactions dominate in the long-range.
Revised:  It has been hypothesized that patterns could emerge from a water-mediated scale-dependent feedback (SDF), whereby interactions favoring plant growth dominate at short distances and growth-inhibitory interactions dominate in the long-range.
Edit intent: fluency
Original:  It has been hypothesized that patterns could emerge from a water-mediated scale-dependent feedback (SDF), whereby interactions favoring plant growth dominate at short distances while growth-inhibitory interactions dominate in the long-range. As precipitation declines, this framework predicts a sequential change from gapped to labyrinthine to spotted spatial patterns.
Revised:  It has been hypothesized that patterns could emerge from a water-mediated scale-dependent feedback (SDF), whereby interactions favoring plant growth dominate at short distances while growth-inhibitory interactions dominate in the long range.
Edit intent: clarity
Original:  However, we know little about how net plant-to-plant interactions may shift from positive to negative as a function of inter-individual distance, and in the absence of strong empirical support, the relevance of  SDF for vegetation pattern formation remains disputed.
Revised:  However, we know little about how net plant-to-plant interactions may change sign with inter-individual distance, and in the absence of strong empirical support, the relevance of SDF for vegetation pattern formation remains disputed.
Edit intent: clarity
Original:  However, we know little about how net plant-to-plant interactions may shift from positive to negative as a function of inter-individual distance, and in the absence of strong empirical support, the relevance of  SDF for vegetation pattern formation remains disputed.
Revised:  However, we know little about how net plant-to-plant interactions may shift from positive to negative as a function of inter-individual distance, and in the absence of strong empirical support, the relevance of this SDF for vegetation pattern formation remains disputed.
Edit intent: fluency
Original:  Alternative theories show that the same sequence of patterns could emerge when interactions between plants are always inhibitory if their intensity decays sharply enough with inter-individual distance .
Revised:  These theories predict a sequential change in pattern shape from gapped to labyrinthine to spotted spatial patterns as precipitation declines. Nonetheless, alternative theories show that the same sequence of patterns could emerge when interactions between plants are always inhibitory if their intensity decays sharply enough with inter-individual distance .
Edit intent: meaning-changed
Original:  Although these alternative hypotheses lead to visually indistinguishable spatial distributions of plants, they predict different ecosystem-level consequences for the patterns, thus limiting their potential use as ecosystem-state indicators .
Revised:  Although these alternative hypotheses lead to visually indistinguishable patterns they predict very different desertification dynamics following the spotted pattern. Moreover, vegetation interaction with other ecosystem components can introduce additional spatio-temporal scales that reshape both the patterns and the desertification dynamics .
Edit intent: clarity
Original:  Here, we review existing theories for vegetation URLanization and their conflicting ecosystem-level predictions . We discuss ways to reconcile these predictions . We focus on the mechanistic differences among models, which can provide valuable information to help researchers decide which model to use for a particular system and /or whether it requires modification .
Revised:  Here, we review existing theories for vegetation URLanization and their conflicting predictions about desertification dynamics. We further discuss possible ways for reconciling these predictions and potential empirical tests via manipulative experiments to improve our understanding of how vegetation URLanizes and better predict the fate of the ecosystems where they form .
Edit intent: meaning-changed
Original:  Analysing the agents' performances on the test data, we argue that the agents are able to create a dynamic representation of the underlying environment highlighting the occasional regularities present in the data and exploiting them to create long-term profitable trading strategies  .
Revised:  Analysing the agents' performances on test data, we argue that the agents are able to create a dynamic representation of the underlying environment highlighting the occasional regularities present in the data and exploiting them to create long-term profitable trading strategies .
Edit intent: fluency
Original:  Analysing the agents' performances on the test data, we argue that the agents are able to create a dynamic representation of the underlying environment highlighting the occasional regularities present in the data and exploiting them to create long-term profitable trading strategies  .
Revised:  Analysing the agents' performances on the test data, we argue that the agents are able to create a dynamic representation of the underlying environment . They identify occasional regularities present in the data and exploiting them to create long-term profitable trading strategies .
Edit intent: coherence
Original:  Analysing the agents' performances on the test data, we argue that the agents are able to create a dynamic representation of the underlying environment highlighting the occasional regularities present in the data and exploiting them to create long-term profitable trading strategies  .
Revised:  Analysing the agents' performances on the test data, we argue that the agents are able to create a dynamic representation of the underlying environment highlighting the occasional regularities present in the data and exploit them to create long-term profitable trading strategies .
Edit intent: fluency