wanyu/IteraTeR_v2 huggingface dataset:
Original:  We first assess the educational challenges presented by distance learning as a whole , and identify 4 main challenges that distance learning currently presents as compared to in-person instruction: the lack of social interaction, reduced student engagement and focus, reduced comprehension and information retention, and the lack of flexible and customizable instructor resources.
Revised:  We first assess the educational challenges presented by distance learning as a whole and identify 4 main challenges that distance learning currently presents as compared to in-person instruction: the lack of social interaction, reduced student engagement and focus, reduced comprehension and information retention, and the lack of flexible and customizable instructor resources.
Edit intent: fluency
Original:  In contrast to circuit optimization at runtime , this is achieved while incurring only a small constant overhead in compilation time, making this a compelling approach for quantum program optimization at application scale.
Revised:  In contrast to circuit optimization at run time , this is achieved while incurring only a small constant overhead in compilation time, making this a compelling approach for quantum program optimization at application scale.
Edit intent: clarity
Original: For optimization problems with sparse linear equality constraints, we observe that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraints .
Revised: For optimization problems with linear equality constraints, we observe that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraints .
Edit intent: clarity
Original: For optimization problems with sparse linear equality constraints, we observe that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraints .
Revised: For optimization problems with sparse linear equality constraints, we prove that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraints .
Edit intent: clarity
Original: For optimization problems with sparse linear equality constraints, we observe that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraints .
Revised: For optimization problems with sparse linear equality constraints, we observe that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraint matrix .
Edit intent: clarity
Original:  Orthogonal projections are implemented by  sparse QR factorization or  preconditioned LSQR iteration.
Revised:  Orthogonal projections are implemented by a sparse QR factorization or preconditioned LSQR iteration.
Edit intent: fluency
Original:  Orthogonal projections are implemented by  sparse QR factorization or  preconditioned LSQR iteration.
Revised:  Orthogonal projections are implemented by sparse QR factorization or a preconditioned LSQR iteration.
Edit intent: fluency
Original:  This work proposes a distributed planning approach based on local search , and shows how to reduce its computation and communication requirements without sacrificing algorithm performance .
Revised:  This work proposes a distributed planning approach based on local search and shows how to reduce its computation and communication requirements without sacrificing algorithm performance .
Edit intent: fluency
Original:  This work proposes a distributed planning approach based on local search , and shows how to reduce its computation and communication requirements without sacrificing algorithm performance .
Revised:  This work proposes a distributed planning approach based on local search , and shows how to reduce its computation and communication of the approach .
Edit intent: clarity
Original:  We demonstrate the efficacy of our proposed method by coordinating robot teams composed of both ground and aerial vehicles with different sensing and control profiles , and evaluate the algorithm's performance in two target tracking scenarios.
Revised:  We demonstrate the efficacy of the proposed method by coordinating robot teams composed of both ground and aerial vehicles with different sensing and control profiles , and evaluate the algorithm's performance in two target tracking scenarios.
Edit intent: fluency
Original:  We demonstrate the efficacy of our proposed method by coordinating robot teams composed of both ground and aerial vehicles with different sensing and control profiles , and evaluate the algorithm's performance in two target tracking scenarios.
Revised:  We demonstrate the efficacy of our proposed method by coordinating robot teams composed of both ground and aerial vehicles with different sensing /control profiles and evaluate the algorithm's performance in two target tracking scenarios.
Edit intent: fluency
Original: In Bayesian peer-to-peer decentralized data fusion for static and dynamic systems , the underlying estimated or communicated distributions are frequently assumed to be homogeneous between agents .
Revised: In Bayesian peer-to-peer decentralized data fusion , the underlying estimated or communicated distributions are frequently assumed to be homogeneous between agents .
Edit intent: clarity
Original: In Bayesian peer-to-peer decentralized data fusion for static and dynamic systems , the underlying estimated or communicated distributions are frequently assumed to be homogeneous between agents .
Revised: In Bayesian peer-to-peer decentralized data fusion for static and dynamic systems , the underlying estimated or communicated distributions are frequently assumed to be over the same set of variables (homogeneous) .
Edit intent: clarity
Original:  This work considers a family of heterogeneous decentralized fusion problems, where we consider the set of problems in which either the communicated or the estimated distributions describe different, but overlapping, states of interest that are subsets of a larger full global joint state  .
Revised:  This work studies a family of heterogeneous decentralized fusion problems, where we consider the set of problems in which either the communicated or the estimated distributions describe different, but overlapping, states of interest that are subsets of a larger full global joint state .
Edit intent: fluency
Original:  This work considers a family of heterogeneous decentralized fusion problems, where we consider the set of problems in which either the communicated or the estimated distributions describe different, but overlapping, states of interest that are subsets of a larger full global joint state  .
Revised:  This work considers a family of heterogeneous decentralized fusion problems, where the set of problems in which either the communicated or the estimated distributions describe different, but overlapping, states of interest that are subsets of a larger full global joint state .
Edit intent: fluency
Original:  This work considers a family of heterogeneous decentralized fusion problems, where we consider the set of problems in which either the communicated or the estimated distributions describe different, but overlapping, states of interest that are subsets of a larger full global joint state  .
Revised:  This work considers a family of heterogeneous decentralized fusion problems, where we consider the set of problems in which either the communicated or the processed distributions describe different, but overlapping, states of interest that are subsets of a larger full global joint state .
Edit intent: clarity
Original:  This work considers a family of heterogeneous decentralized fusion problems, where we consider the set of problems in which either the communicated or the estimated distributions describe different, but overlapping, states of interest that are subsets of a larger full global joint state  .
Revised:  This work considers a family of heterogeneous decentralized fusion problems, where we consider the set of problems in which either the communicated or the estimated distributions describe different, but overlapping, states of interest that are subsets of a larger full global joint state is considered .
Edit intent: clarity
Original:  Numerical examples show more than 99.5 \% \\%DIF > potential communication reduction for heterogeneous channel filter fusion, and a multi-target tracking simulation shows that these methods provide consistent estimates.
Revised:  Numerical examples show more than 99.5 \\%DIF > potential communication reduction for heterogeneous channel filter fusion, and a multi-target tracking simulation shows that these methods provide consistent estimates.
Edit intent: coherence
Original: The point-to-set principle  characterizes the Hausdorff dimension of a subset E\subseteq\R^n by the effective  dimension of its individual points.
Revised: The point-to-set principle characterizes the Hausdorff dimension of a subset E\subseteq\R^n by the effective dimension of its individual points.
Edit intent: fluency
Original:  In this paper, we introduce an extension of point-to-set principle - the notion of optimal oracles for subsets E\subseteq\R^n.
Revised:  In this paper, we introduce an extension of point-to-set principle - the notion of optimal oracles for subsets E\subseteq\R^n.
Edit intent: fluency
Original:   Thus, the existence of optimal oracles subsume the currently known sufficient conditions for Marstrand's theorem to hold.
Revised:  Thus, the existence of optimal oracles extends the currently known sufficient conditions for Marstrand's theorem to hold.
Edit intent: clarity
Original:  Both the number of variables and number of constraints in our formulation are  bounded by O( Wn)where W is the total sum of (integer) voting weights and n is the number of players .
Revised:  The numbers of variables and number of constraints in our formulation are bounded by O( Wn)where W is the total sum of (integer) voting weights and n is the number of players .
Edit intent: coherence
Original:  Both the number of variables and number of constraints in our formulation are  bounded by O( Wn)where W is the total sum of (integer) voting weights and n is the number of players .
Revised:  Both the number of variables and constraints in our formulation are bounded by O( Wn)where W is the total sum of (integer) voting weights and n is the number of players .
Edit intent: fluency
Original:  Both the number of variables and number of constraints in our formulation are  bounded by O( Wn)where W is the total sum of (integer) voting weights and n is the number of players .
Revised:  Both the number of variables and number of constraints in our formulation are both bounded by O( Wn)where W is the total sum of (integer) voting weights and n is the number of players .
Edit intent: clarity
Original:  Both the number of variables and number of constraints in our formulation are  bounded by O( Wn)where W is the total sum of (integer) voting weights and n is the number of players .
Revised:  Both the number of variables and number of constraints in our formulation are bounded by O( Wn)where W is the total sum of (integer) voting weights .
Edit intent: clarity
Original:  Work has shown that framing controversial issues using the values of the audience can improve reception of opposing views.
Revised:  Work has shown that framing controversial issues using the values of the audience can improve understanding of opposing views.
Edit intent: clarity
Original:  In this paper, we present Pano, an interactive system motivated by moral framing theory that educates news consumers to think in a framework of fundamental human values . Pano encourages users to challenge their understanding of opposing views through collaborative annotation and discussion of moral framing in articles and comments .
Revised:  In this paper, we present Pano, an interactive system motivated by moral framing theory that educates news consumers to engage using a framework of fundamental human values . Pano encourages users to challenge their understanding of opposing views through collaborative annotation and discussion of moral framing in articles and comments .
Edit intent: clarity
Original:  In this paper, we present Pano, an interactive system motivated by moral framing theory that educates news consumers to think in a framework of fundamental human values . Pano encourages users to challenge their understanding of opposing views through collaborative annotation and discussion of moral framing in articles and comments .
Revised:  In this paper, we present Pano, an interactive system motivated by moral framing theory that educates news consumers to think in a framework of fundamental human values . Pano encourages users to challenge their understanding of opposing views , including annotation of moral frames in news articles, discussion of those frames via inline comments, and recommendations based on relevant moral frames .
Edit intent: clarity
Original:  We describe two iterations of Pano -- the first covering a suite of ways to interact with  news, and the second tailored toward annotation and discussion.
Revised:  We describe two versions of features -- the first covering a suite of ways to interact with news, and the second tailored toward annotation and discussion.
Edit intent: clarity
Original:  We describe two iterations of Pano -- the first covering a suite of ways to interact with  news, and the second tailored toward annotation and discussion.
Revised:  We describe two iterations of Pano -- the first covering a suite of ways to interact with news, and the second tailored towards collaborative annotation and discussion.
Edit intent: clarity
Original:  We find that compared to a control, Pano users more often empathize with and re-frame arguments in the moral values of the opposing side , showing promise toward the ultimate goal of bridging the ideological divide .
Revised:  We find that compared to a control, Pano users more often empathize with and re-frame their discourse in moral values of the opposing side , showing promise toward the ultimate goal of bridging the ideological divide .
Edit intent: clarity
Original:  In this paper, we present our work designing systems for addressing ideological division through educating U.S. ~ news consumers to engage using a framework of fundamental human values known as Moral Foundations.
Revised:  In this paper, we present our work designing systems for addressing ideological division through educating U.S. news consumers to engage using a framework of fundamental human values known as Moral Foundations.
Edit intent: fluency
Original: Cellular networks have changed the world we are living in, and the fifth generation (5G) of radio technology is expected to further revolutionise our everyday lives, by enabling a high degree of automation, through its larger capacity, massive connectivity, and ultra-reliable low latency communications.
Revised: Cellular networks have changed the world we are living in, and the fifth generation (5G) of radio technology is expected to further revolutionise our everyday lives, by enabling a high degree of automation, through its larger capacity, massive connectivity, and ultra-reliable low-latency communications.
Edit intent: fluency
Original:  Then, as a main contribution, we survey in detail -- from a theoretical and a practical viewpoint -- the main energy efficiency enabling features that 3GPP NR provides, together with their main benefits and challenges.
Revised:  Then, as a main contribution, we survey in detail -- from a theoretical and a practical viewpoint -- the main energy efficiency enabling technologies that 3GPP NR provides, together with their main benefits and challenges.
Edit intent: clarity
Original:  Special attention is paid to four key technology features , i.e., massive multiple-input multiple-output (MIMO), lean carrier design, and advanced idle modes, together with the role of artificial intelligence capabilities.
Revised:  Special attention is paid to four key enabling technologies , i.e., massive multiple-input multiple-output (MIMO), lean carrier design, and advanced idle modes, together with the role of artificial intelligence capabilities.
Edit intent: clarity
Original: Data integration is a long-standing interest of the data management community and has many disparate applications, including business, government and Web search .
Revised: Data integration is a long-standing interest of the data management community and has many disparate applications, including business, science and government .
Edit intent: clarity
Original:  We have recently witnessed impressive results in isolated data integration tasks, such as Entity Resolution, thanks to the increasing availability of benchmarks for training and testing purposes.
Revised:  We have recently witnessed impressive results in specific data integration tasks, such as Entity Resolution, thanks to the increasing availability of benchmarks for training and testing purposes.
Edit intent: clarity
Original:  Unfortunately, such benchmarks often come with their own task definition and it can be difficult to leverage them for more complex pipelines.
Revised:  Unfortunately, such benchmarks often come with their own task definition and it can be difficult to leverage them for complex integration pipelines.
Edit intent: clarity
Original:  As a result, evaluating automated pipelines for the entire data integration process is still an elusive goal.
Revised:  As a result, evaluating end-to-end pipelines for the entire data integration process is still an elusive goal.
Edit intent: clarity
Original:  In this work, we present the Alaskabenchmark , the first  real-world dataset to support seamlessly multiple tasks and tasks variants of the data integration pipeline.
Revised:  In this work, we present Alaska , the first real-world dataset to support seamlessly multiple tasks and tasks variants of the data integration pipeline.
Edit intent: fluency
Original:  In this work, we present the Alaskabenchmark , the first  real-world dataset to support seamlessly multiple tasks and tasks variants of the data integration pipeline.
Revised:  In this work, we present the Alaskabenchmark , the first real-world dataset to support seamlessly multiple tasks (and their variants) of the data integration pipeline.
Edit intent: fluency
Original:  It consists of a wide and heterogeneous selection of product specifications from different electronics e-commerce websites and providing hundreds of different product properties .
Revised:  It consists of a wide and heterogeneous selection of product specifications from 71 e-commerce websites and providing hundreds of different product properties .
Edit intent: clarity
Original:  It consists of a wide and heterogeneous selection of product specifications from different electronics e-commerce websites and providing hundreds of different product properties .
Revised:  It consists of a wide and heterogeneous selection of product specifications from different electronics e-commerce websites with thousands of different product properties .
Edit intent: clarity
Original:  It consists of a wide and heterogeneous selection of product specifications from different electronics e-commerce websites and providing hundreds of different product properties .
Revised:  It consists of a wide and heterogeneous selection of product specifications from different electronics e-commerce websites and providing hundreds of different product attributes .
Edit intent: clarity
Original:  Our benchmark comes with profiling meta-data,  pre-defined use cases with different characteristics, and an extensive manually curated ground truth.
Revised:  Our benchmark comes with profiling meta-data, a set of pre-defined use cases with different characteristics, and an extensive manually curated ground truth.
Edit intent: clarity
Original:  Our benchmark comes with profiling meta-data,  pre-defined use cases with different characteristics, and an extensive manually curated ground truth.
Revised:  Our benchmark comes with profiling meta-data, pre-defined use cases with diverse characteristics, and an extensive manually curated ground truth.
Edit intent: clarity
Original:  Our benchmark allows us to compare on the same stage a variety of methods that previously were difficult to picture together, and we hope that it can foster the design of more holistic data integration solutions.
Revised:  Our benchmark allows us to compare on the same stage a variety of methods that previously were difficult to compare, and can foster the design of more holistic data integration solutions.
Edit intent: clarity
Original:  Implementing the framework for our dataset, we find that at the federal level, the American legal system is increasingly dominated by regulations, whereas the German legal system remains governed by statutes.
Revised:  Implementing the framework for our dataset, we find that at the federal level, the United States legal system is increasingly dominated by regulations, whereas the German legal system remains governed by statutes.
Edit intent: clarity
Original:  In non-adaptive group testing, all tests are independent, can be performed in parallel and represented as a measurement matrix .
Revised:  In non-adaptive group testing, all tests are fixed in advance and can be performed in parallel and represented as a measurement matrix .
Edit intent: clarity
Original:  In non-adaptive group testing, all tests are independent, can be performed in parallel and represented as a measurement matrix .
Revised:  In non-adaptive group testing, all tests are independent, can be performed in parallel .
Edit intent: clarity
Original:  In particular, without storing measurement matrices , we can identify up to d consecutive positives with 2 \frac{n{d} + 2d (4 \frac{n{d}} + 2d, resp. ) tests in O }%DIFDELCMD < \left( %%% \log_2^2{\frac{n{d}} + d }%DIFDELCMD < \right) %%% (O%DIFDELCMD < \left( %%% \log_2{\frac{n{d}} + d }%DIFDELCMD < \right)%%% , resp.) time .
Revised:  In particular, without storing measurement matrices , we can identify up to d consecutive positives with 2 \frac{n{d} + 2d (4 \frac{n{d}} + 2d, resp. ) tests in O }%DIFDELCMD < \left( %%% {d}} + d }%DIFDELCMD < \right) %%% (O%DIFDELCMD < \left( %%% \log_2{\frac{n{d}} + d }%DIFDELCMD < \right)%%% , resp.) time .
Edit intent: clarity
Original:  In particular, without storing measurement matrices , we can identify up to d consecutive positives with 2 \frac{n{d} + 2d (4 \frac{n{d}} + 2d, resp. ) tests in O }%DIFDELCMD < \left( %%% \log_2^2{\frac{n{d}} + d }%DIFDELCMD < \right) %%% (O%DIFDELCMD < \left( %%% \log_2{\frac{n{d}} + d }%DIFDELCMD < \right)%%% , resp.) time .
Revised:  In particular, without storing measurement matrices , we can identify up to d consecutive positives with 2 \frac{n{d} + 2d (4 \frac{n{d}} + 2d, resp. ) tests in O }%DIFDELCMD < \left( %%% \log_2^2{\frac{n{d}} + d }%DIFDELCMD < \right) %%% %DIFDELCMD < \left( %%% \log_2{\frac{n{d}} + d }%DIFDELCMD < \right)%%% , resp.) time .
Edit intent: coherence
Original:  In particular, without storing measurement matrices , we can identify up to d consecutive positives with 2 \frac{n{d} + 2d (4 \frac{n{d}} + 2d, resp. ) tests in O }%DIFDELCMD < \left( %%% \log_2^2{\frac{n{d}} + d }%DIFDELCMD < \right) %%% (O%DIFDELCMD < \left( %%% \log_2{\frac{n{d}} + d }%DIFDELCMD < \right)%%% , resp.) time .
Revised:  In particular, without storing measurement matrices , we can identify up to d consecutive positives with 2 \frac{n{d} + 2d (4 \frac{n{d}} + 2d, resp. ) tests in O }%DIFDELCMD < \left( %%% \log_2^2{\frac{n{d}} + d }%DIFDELCMD < \right) %%% (O%DIFDELCMD < \left( %%% {d}} + d }%DIFDELCMD < \right)%%% , resp.) time .
Edit intent: fluency