wanyu/IteraTeR_full_sent huggingface dataset:
Original:  We prove that the k-List Coloring, List k-Coloring, and k-Precoloring Extension problems are NP-complete on bipartite graphs with diameter at most d, for every k%DIFDELCMD < \ge %%% 4 and every d%DIFDELCMD < \ge %%% 3, and for k=3 and d%DIFDELCMD < \ge %%% 4, and that List k-Coloring is polynomial when d=2 (i.e., on complete bipartite graphs)
Revised:  We prove that the k-List Coloring, List k-Coloring, and k-Precoloring Extension problems on bipartite graphs with diameter at most d, for every k%DIFDELCMD < \ge %%% 4 and every d%DIFDELCMD < \ge %%% 3, and for k=3 and d%DIFDELCMD < \ge %%% 4, and that List k-Coloring is polynomial when d=2 (i.e., on complete bipartite graphs)
Edit intent: clarity
Original:  We prove that the k-List Coloring, List k-Coloring, and k-Precoloring Extension problems are NP-complete on bipartite graphs with diameter at most d, for every k%DIFDELCMD < \ge %%% 4 and every d%DIFDELCMD < \ge %%% 3, and for k=3 and d%DIFDELCMD < \ge %%% 4, and that List k-Coloring is polynomial when d=2 (i.e., on complete bipartite graphs)
Revised:  We prove that the k-List Coloring, List k-Coloring, and k-Precoloring Extension problems are NP-complete on bipartite graphs with diameter at most d, %DIFDELCMD < \ge %%% 4 and every d%DIFDELCMD < \ge %%% 3, and for k=3 and d%DIFDELCMD < \ge %%% 4, and that List k-Coloring is polynomial when d=2 (i.e., on complete bipartite graphs)
Edit intent: fluency
Original:  We prove that the k-List Coloring, List k-Coloring, and k-Precoloring Extension problems are NP-complete on bipartite graphs with diameter at most d, for every k%DIFDELCMD < \ge %%% 4 and every d%DIFDELCMD < \ge %%% 3, and for k=3 and d%DIFDELCMD < \ge %%% 4, and that List k-Coloring is polynomial when d=2 (i.e., on complete bipartite graphs)
Revised:  We prove that the k-List Coloring, List k-Coloring, and k-Precoloring Extension problems are NP-complete on bipartite graphs with diameter at most d, for every k%DIFDELCMD < \ge %%% %DIFDELCMD < \ge %%% 3, and for k=3 and d%DIFDELCMD < \ge %%% 4, and that List k-Coloring is polynomial when d=2 (i.e., on complete bipartite graphs)
Edit intent: coherence
Original:  We prove that the k-List Coloring, List k-Coloring, and k-Precoloring Extension problems are NP-complete on bipartite graphs with diameter at most d, for every k%DIFDELCMD < \ge %%% 4 and every d%DIFDELCMD < \ge %%% 3, and for k=3 and d%DIFDELCMD < \ge %%% 4, and that List k-Coloring is polynomial when d=2 (i.e., on complete bipartite graphs)
Revised:  We prove that the k-List Coloring, List k-Coloring, and k-Precoloring Extension problems are NP-complete on bipartite graphs with diameter at most d, for every k%DIFDELCMD < \ge %%% 4 and every d%DIFDELCMD < \ge %%% %DIFDELCMD < \ge %%% 4, and that List k-Coloring is polynomial when d=2 (i.e., on complete bipartite graphs)
Edit intent: coherence
Original:  We prove that the k-List Coloring, List k-Coloring, and k-Precoloring Extension problems are NP-complete on bipartite graphs with diameter at most d, for every k%DIFDELCMD < \ge %%% 4 and every d%DIFDELCMD < \ge %%% 3, and for k=3 and d%DIFDELCMD < \ge %%% 4, and that List k-Coloring is polynomial when d=2 (i.e., on complete bipartite graphs) for every k \geq 3. Since k-List Coloring was already known to be NP-complete on complete bipartite graphs, and polynomial for k=2 on general graphs, the only remaining open problems are List 3-Coloring and 3-Precoloring Extension  when d=3.
Revised:  We prove that the k-List Coloring, List k-Coloring, and k-Precoloring Extension problems are NP-complete on bipartite graphs with diameter at most d, for every k%DIFDELCMD < \ge %%% 4 and every d%DIFDELCMD < \ge %%% 3, and for k=3 and d%DIFDELCMD < \ge %%% proving NP-completeness in most cases, and leaving open only the List 3-Coloring and 3-Precoloring Extension when d=3.
Edit intent: meaning-changed
Original:  for every k \geq 3. Since k-List Coloring was already known to be NP-complete on complete bipartite graphs, and polynomial for k=2 on general graphs, the only remaining open problems are List 3-Coloring and 3-Precoloring Extension  when d=3.
Revised:  for every k \geq 3. Since k-List Coloring was already known to be NP-complete on complete bipartite graphs, and polynomial for k=2 on general graphs, the only remaining open problems are List 3-Coloring and 3-Precoloring Extension problems when d=3.
Edit intent: clarity
Original:  We also prove that the Surjective C_6-Homomorphism problem is NP-complete on bipartite graphs with diameter at most 4, answering a question posed by Bodirsky, K\'ara, and Martin [ Discret.
Revised:  Some of these results are obtained through a proof that the Surjective C_6-Homomorphism problem is NP-complete on bipartite graphs with diameter at most 4, answering a question posed by Bodirsky, K\'ara, and Martin [ Discret.
Edit intent: clarity
Original:  We also prove that the Surjective C_6-Homomorphism problem is NP-complete on bipartite graphs with diameter at most 4, answering a question posed by Bodirsky, K\'ara, and Martin [ Discret.
Revised:  We also prove that the Surjective C_6-Homomorphism problem is NP-complete on bipartite graphs with diameter at most four. Although the latter result has been already proved [ Discret.
Edit intent: meaning-changed
Original:  We also prove that the Surjective C_6-Homomorphism problem is NP-complete on bipartite graphs with diameter at most 4, answering a question posed by Bodirsky, K\'ara, and Martin [ Discret. Appl. Math. 2012 .  As a byproduct, we get that deciding whether V(G) can be partitioned into 3 subsets each inducing a complete bipartite graph is NP-complete.
Revised:  We also prove that the Surjective C_6-Homomorphism problem is NP-complete on bipartite graphs with diameter at most 4, answering a question posed by Bodirsky, K\'ara, and Martin [ . As a byproduct, we get that deciding whether V(G) can be partitioned into 3 subsets each inducing a complete bipartite graph is NP-complete.
Edit intent: coherence
Original:  Appl. Math. 2012 .  As a byproduct, we get that deciding whether V(G) can be partitioned into 3 subsets each inducing a complete bipartite graph is NP-complete.
Revised:  Appl. Math. 2012 Vikas, 2017 As a byproduct, we get that deciding whether V(G) can be partitioned into 3 subsets each inducing a complete bipartite graph is NP-complete.
Edit intent: meaning-changed
Original:  Appl. Math. 2012 .  As a byproduct, we get that deciding whether V(G) can be partitioned into 3 subsets each inducing a complete bipartite graph is NP-complete.
Revised:  Appl. Math. 2012 . , we present ours as an alternative simpler one. As a byproduct, we get that deciding whether V(G) can be partitioned into 3 subsets each inducing a complete bipartite graph is NP-complete.
Edit intent: meaning-changed
Original:  Appl. Math. 2012 .  As a byproduct, we get that deciding whether V(G) can be partitioned into 3 subsets each inducing a complete bipartite graph is NP-complete.
Revised:  Appl. Math. 2012 . As a byproduct, we also get that 3-Biclique Partition is NP-complete.
Edit intent: meaning-changed
Original:  An attempt to prove this result was presented by Fleischner, Mujuni, Paulusma, and Szeider Theor. Comput. Sci. 2009], but we realized that there was an apparently non-fixable flaw in their proof  .
Revised:  An attempt to prove this result was presented by Fleischner, Mujuni, Paulusma, and Szeider , 2009], but we realized that there was an apparently non-fixable flaw in their proof .
Edit intent: coherence
Original:  Finally, we prove that the 3-Fall Coloring problem is NP-complete on bipartite graphs with diameter at most 4, and give a polynomial reduction from 3-Fall Coloring on bipartite graphs with diameter 3 to 3-Precoloring Extension on bipartite graphs with diameter 3.
Revised:  Finally, we prove that the 3-Fall Coloring problem is NP-complete on bipartite graphs with diameter at most four, and prove that NP-completeness for diameter three would also imply NP-completeness of 3-Precoloring Extension on bipartite graphs with diameter 3.
Edit intent: meaning-changed
Original:  Finally, we prove that the 3-Fall Coloring problem is NP-complete on bipartite graphs with diameter at most 4, and give a polynomial reduction from 3-Fall Coloring on bipartite graphs with diameter 3 to 3-Precoloring Extension on bipartite graphs with diameter 3. The latter result implies that if 3-Fall Coloring is NP-complete on these graphs, then the complexity gaps mentioned above for List k-Coloring and k-Precoloring Extension would be closed .
Revised:  Finally, we prove that the 3-Fall Coloring problem is NP-complete on bipartite graphs with diameter at most 4, and give a polynomial reduction from 3-Fall Coloring on bipartite graphs with diameter 3 to 3-Precoloring Extension on diameter three, thus closing the previously mentioned open cases .
Edit intent: clarity
Original:  The model produces baseline rates of death registrations expected in the absence of the COVID-19 pandemic, and comparing those baselines to recent counts of registered deaths exposes the emergence of excess deaths late in March 2020.
Revised:  The model produces baseline rates of death registrations expected without the COVID-19 pandemic, and comparing those baselines to recent counts of registered deaths exposes the emergence of excess deaths late in March 2020.
Edit intent: fluency
Original:  Among\pm  adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Revised:  By April's end, England and Wales registered 45,300\pm adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Edit intent: meaning-changed
Original:  Among\pm  adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Revised:  Among\pm 3200 excess deaths of adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Edit intent: meaning-changed
Original:  Among\pm  adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Revised:  Among\pm adults aged 45+ . Through 8 May, the last day of available all-deaths data, 50,400 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Edit intent: meaning-changed
Original:  Among\pm  adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Revised:  Among\pm adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm %DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Edit intent: meaning-changed
Original:  Among\pm  adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Revised:  Among\pm adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% %DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Edit intent: meaning-changed
Original:  Among\pm  adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Revised:  Among\pm adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% %DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Edit intent: meaning-changed
Original:  Among\pm  adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Revised:  Among\pm adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% %DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Edit intent: meaning-changed
Original:  Among\pm  adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 567 in April's next 3 weeks ).
Revised:  Among\pm adults aged 45+ , about 38,700 excess deaths were registered in the 5 weeks comprising 21 March through 24 April (612 \pm 416 from 21-27 March, 5675%DIFDELCMD < \pm %%% 439 from 28 March through 3 April,then 9183%DIFDELCMD < \pm %%% 468, 12,712%DIFDELCMD < \pm %%% 589, and 10,511%DIFDELCMD < \pm %%% 3600 were registered (about 53\% of which were of men ).
Edit intent: meaning-changed
Original:  Both the Office for National Statistics's respective count of 26,891 death certificates which mention COVID-19, and the Department of Health and Social Care's hospital-focused count of 21,222 deaths, are appreciably less, implying that their counting methods have underestimated rather than overestimated the pandemic's true death toll.
Revised:  Both the ONS's corresponding count of 36,870 death certificates which mention COVID-19, and the Department of Health and Social Care's hospital-focused count of 21,222 deaths, are appreciably less, implying that their counting methods have underestimated rather than overestimated the pandemic's true death toll.
Edit intent: meaning-changed
Original:  Both the Office for National Statistics's respective count of 26,891 death certificates which mention COVID-19, and the Department of Health and Social Care's hospital-focused count of 21,222 deaths, are appreciably less, implying that their counting methods have underestimated rather than overestimated the pandemic's true death toll.
Revised:  Both the Office for National Statistics's respective count of 26,891 death certificates which mention COVID-19, and the Department of Health and Social Care's hospital-focused count of 29,057 deaths, are appreciably less, implying that their counting methods have underestimated rather than overestimated the pandemic's true death toll.
Edit intent: meaning-changed
Original:  Both the Office for National Statistics's respective count of 26,891 death certificates which mention COVID-19, and the Department of Health and Social Care's hospital-focused count of 21,222 deaths, are appreciably less, implying that their counting methods have underestimated rather than overestimated the pandemic's true death toll.
Revised:  Both the Office for National Statistics's respective count of 26,891 death certificates which mention COVID-19, and the Department of Health and Social Care's hospital-focused count of 21,222 deaths, are appreciably less, implying that their counting methods have underestimated , not overestimated, the pandemic's true death toll.
Edit intent: fluency
Original:  Our main result is a nearly optimal polynomial time (1-e^{-1}- \varepsilon \eps )-approximation algorithm for the problem, for any \varepsilon \eps >0.
Revised:  Our main result is an almost optimal polynomial time (1-e^{-1}- \varepsilon \eps )-approximation algorithm for the problem, for any \varepsilon \eps >0.
Edit intent: clarity
Original:  Our algorithm relies on a  refined analysis of techniques for constrained submodular optimization combined with sophisticated application of tools used in the development of approximation schemes for packing problems .
Revised:  Our algorithm relies on a structuring technique which converts a general multiple knapsack constraint to a constraint in which the bins are partitioned into groups of exponentially increasing cardinalities, each consisting of bins of uniform capacity. We derive the result by combining structuring with a refined analysis of techniques for constrained submodular optimization combined with sophisticated application of tools used in the development of approximation schemes for packing problems .
Edit intent: meaning-changed
Original: Many information retrieval and natural language processing  problems can be formalized as a semantic matchingtask. However, the existing work in this area has been focused in large part on the matching between short texts like finding answer spans, sentences and passages given a query or a natural language question.
Revised: Many information retrieval and natural language processing problems can be formalized as the task of semantic matching. Existing work in this area has been focused in large part on the matching between short texts like finding answer spans, sentences and passages given a query or a natural language question.
Edit intent: coherence
Original:  In recent years, self-attention based models like Transformers and BERT have achieved state-of-the-art performance in several natural language understanding tasks. These kinds of models, however, are still restricted to short text sequences like sentences due to the quadratic computational time and space complexity of self-attention with respect to the input sequence length.
Revised:  In recent years, self-attention based models like Transformers and BERT have achieved state-of-the-art performance in the task of text matching. These models, however, are still restricted to short text sequences like sentences due to the quadratic computational time and space complexity of self-attention with respect to the input sequence length.
Edit intent: clarity
Original:  In this paper, we address these issues by proposing the Siamese Multi-depth Transformer-based Hierarchical (SMITH) Encoder for document representation learning and matching, which contains several novel design choices to adapt self-attention models for long text inputs.
Revised:  In this paper, we address the issue by proposing the Siamese Multi-depth Transformer-based Hierarchical (SMITH) Encoder for document representation learning and matching, which contains several novel design choices to adapt self-attention models for long text inputs.
Edit intent: coherence
Original:  In this paper, we address these issues by proposing the Siamese Multi-depth Transformer-based Hierarchical (SMITH) Encoder for document representation learning and matching, which contains several novel design choices to adapt self-attention models for long text inputs.
Revised:  In this paper, we address these issues by proposing the Siamese Multi-depth Transformer-based Hierarchical (SMITH) Encoder for long-form document matching. Our model contains several innovations to adapt self-attention models for long text inputs.
Edit intent: clarity
Original:  In this paper, we address these issues by proposing the Siamese Multi-depth Transformer-based Hierarchical (SMITH) Encoder for document representation learning and matching, which contains several novel design choices to adapt self-attention models for long text inputs. For model pre-training, we propose the masked sentence block language modeling task in addition to the original masked word language modeling task used in BERT, to capture sentence block relations within a document.
Revised:  In this paper, we address these issues by proposing the Siamese Multi-depth Transformer-based Hierarchical (SMITH) Encoder for document representation learning and matching, which contains several novel design choices to adapt self-attention models for longer text input. In order to better capture sentence level semantic relations within a document, we pre-train the model with a novel masked sentence block language modeling task in addition to the original masked word language modeling task used in BERT, to capture sentence block relations within a document.
Edit intent: clarity
Original:  For model pre-training, we propose the masked sentence block language modeling task in addition to the original masked word language modeling task used in BERT, to capture sentence block relations within a document. The experimental results on several benchmark data sets for long-form document matching show that our proposed SMITH model outperforms the previous state-of-the-art Siamese matching models including hierarchical attention, multi-depth attention-based hierarchical recurrent neural network, and BERT for long-form document matching, and increases the maximum input text length from 512 to 2048 when compared with BERT-based baseline methods .
Revised:  For model pre-training, we propose the masked sentence block language modeling task in addition to the original masked word language modeling task used by BERT. Our experimental results on several benchmark data sets for long-form document matching show that our proposed SMITH model outperforms the previous state-of-the-art Siamese matching models including hierarchical attention, multi-depth attention-based hierarchical recurrent neural network, and BERT for long-form document matching, and increases the maximum input text length from 512 to 2048 when compared with BERT-based baseline methods .
Edit intent: coherence
Original:  The experimental results on several benchmark data sets for long-form document matching show that our proposed SMITH model outperforms the previous state-of-the-art Siamese matching models including hierarchical attention, multi-depth attention-based hierarchical recurrent neural network, and BERT for long-form document matching, and increases the maximum input text length from 512 to 2048 when compared with BERT-based baseline methods .
Revised:  The experimental results on several benchmark datasets for long-form document matching show that our proposed SMITH model outperforms the previous state-of-the-art Siamese matching models including hierarchical attention, multi-depth attention-based hierarchical recurrent neural network, and BERT for long-form document matching, and increases the maximum input text length from 512 to 2048 when compared with BERT-based baseline methods .
Edit intent: clarity