wanyu/IteraTeR_full_sent huggingface dataset:
Original:  Finally, we show that every graph has an additive 6W-spanner on O(n^{4/3}) edges where W is a constant}  .
Revised:  Finally, we show that every graph has an additive 6W-spanner on O(n^{4/3}) edges where W is a constant} . For a technical reason, the +6 unweighted spanner becomes a +8W weighted spanner; closing this error gap is an interesting remaining open problem .
Edit intent: meaning-changed
Original:  In this paper  we introduce a market price of risk for delivery periods of electricity swaps . In particular, we suggest a weighted geometric average of an artificial geometric electricity futures price over the corresponding delivery period.
Revised:  In this paper we introduce a market price of risk for delivery periods of electricity swaps , thereby opening an arbitrage-free pricing framework for derivatives based on these contracts. Furthermore, we use a weighted geometric average of an artificial geometric electricity futures price over the corresponding delivery period.
Edit intent: meaning-changed
Original:  Our framework allows to include typical features as the Samuelson effect, seasonalities as well as a stochastic volatilityin the absence of arbitrage. We show that our suggested model is suitable for pricing options on electricity swaps using the Heston method. Especially, we illustrate the related pricing procedure for electricity swaps and options in the setting of Arismendi et al. (2016), Schneider and Tavin (2018)  and Fanelli and Schmeck (2019)  .
Revised:  Our framework allows to include typical features as the Samuelson effect, seasonalities , and stochastic volatility. In particular, we investigate the pricing procedures for electricity swaps and options in the setting of Arismendi et al. (2016), Schneider and Tavin (2018) and Fanelli and Schmeck (2019) .
Edit intent: clarity
Original:  Especially, we illustrate the related pricing procedure for electricity swaps and options in the setting of Arismendi et al. (2016), Schneider and Tavin (2018)  and Fanelli and Schmeck (2019)  .
Revised:  Especially, we illustrate the related pricing procedure for electricity swaps and options in line with Arismendi et al. (2016), Schneider and Tavin (2018) and Fanelli and Schmeck (2019) .
Edit intent: clarity
Original:  Especially, we illustrate the related pricing procedure for electricity swaps and options in the setting of Arismendi et al. (2016), Schneider and Tavin (2018)  and Fanelli and Schmeck (2019)  .
Revised:  Especially, we illustrate the related pricing procedure for electricity swaps and options in the setting of Arismendi et al. (2016), Schneider and Tavin (2018) , and Fanelli and Schmeck (2019) .
Edit intent: fluency
Original:  Especially, we illustrate the related pricing procedure for electricity swaps and options in the setting of Arismendi et al. (2016), Schneider and Tavin (2018)  and Fanelli and Schmeck (2019)  .
Revised:  Especially, we illustrate the related pricing procedure for electricity swaps and options in the setting of Arismendi et al. (2016), Schneider and Tavin (2018) and Fanelli and Schmeck (2019) . A numerical study highlights the differences between these models depending on the delivery period .
Edit intent: meaning-changed
Original: A unit disk graph G on a given set of points P in the plane is a geometric graph where an edge exists between two points p,q \in P if and only if |pq| \leq 1. A subgraph G' of G is a k-hop spanner if and only if for every edge pq\in G, the topological shortest path between p,q in G' has at most k edges.
Revised: A unit disk graph G on a given set of points P in the plane is a geometric graph where an edge exists between two points p,q \in P if and only if |pq| \leq 1. A subgraph G' of G is a k-hop spanner if and only if for every edge pq\in G, the topological shortest path between p,q in G' has at most k edges.
Edit intent: fluency
Original:  We analyze the family of spanners constructed by Biniaz ( WADS 2019 ) and improve the upper bound on the number of edges from 9n to 5.5n. ( ii ) Using a new construction, we show that every n-vertex unit disk graph has a 3-hop spanner with at most 11n edges.
Revised:  We analyze the family of spanners constructed by Biniaz ( 2020 ) and improve the upper bound on the number of edges from 9n to 5.5n. ( ii ) Using a new construction, we show that every n-vertex unit disk graph has a 3-hop spanner with at most 11n edges.
Edit intent: meaning-changed
Original:  We analyze the family of spanners constructed by Biniaz ( WADS 2019 ) and improve the upper bound on the number of edges from 9n to 5.5n. ( ii ) Using a new construction, we show that every n-vertex unit disk graph has a 3-hop spanner with at most 11n edges.
Revised:  We analyze the family of spanners constructed by Biniaz ( WADS 2019 ) and improve the upper bound on the number of edges from 9n to 5.5n. ( II ) Using a new construction, we show that every n-vertex unit disk graph has a 3-hop spanner with at most 11n edges.
Edit intent: fluency
Original:  This is the first construction of a 2-hop spanner with a subquadratic number of edges. (iv ) For every sufficiently large n, there exists a set P of n points  such that every plane hop spanner on P has hop stretch factor at least 4. Previously, no lower bound greater than 2 was known.
Revised:  This is the first construction of a 2-hop spanners. (IV ) For every sufficiently large n, there exists a set P of n points such that every plane hop spanner on P has hop stretch factor at least 4. Previously, no lower bound greater than 2 was known.
Edit intent: clarity
Original:  (iv ) For every sufficiently large n, there exists a set P of n points  such that every plane hop spanner on P has hop stretch factor at least 4. Previously, no lower bound greater than 2 was known.
Revised:  (iv ) For every sufficiently large n, there exists a set P of n points on a circle, such that every plane hop spanner on P has hop stretch factor at least 4. Previously, no lower bound greater than 2 was known.
Edit intent: meaning-changed
Original: Head mounted displaysbring eye tracking into daily use and this raises privacy concerns for users . Privacy-preservation techniques such as differential privacy mechanisms are recently applied to the eye tracking data obtained from such displays ;
Revised: New generation head-mounted displays, such as VR and AR glasses, are coming into the market with already integrated eye tracking and are expected to enable novel ways of human-computer interaction in many applications. However, since eye movement properties contain biometric information, privacy concerns have to be handled properly . Privacy-preservation techniques such as differential privacy mechanisms are recently applied to the eye tracking data obtained from such displays ;
Edit intent: meaning-changed
Original: Head mounted displaysbring eye tracking into daily use and this raises privacy concerns for users . Privacy-preservation techniques such as differential privacy mechanisms are recently applied to the eye tracking data obtained from such displays ; however, standard differential privacy mechanisms  are vulnerable to temporal correlations in the eye movement features.
Revised: Head mounted displaysbring eye tracking into daily use and this raises privacy concerns for users . Privacy-preservation techniques such as differential privacy mechanisms are recently applied to the eye tracking data obtained from such displays . Standard differential privacy mechanisms are vulnerable to temporal correlations in the eye movement features.
Edit intent: coherence
Original:  In this work, a transform coding based differential privacy mechanism is proposed for the first time in the eye tracking literature to further adapt it to  statistics of eye movement feature data by comparing various low-complexity methods.
Revised:  In this work, we propose a novel transform-coding based differential privacy mechanism is proposed for the first time in the eye tracking literature to further adapt it to statistics of eye movement feature data by comparing various low-complexity methods.
Edit intent: meaning-changed
Original:   Fourier Perturbation Algorithm, which is a differential privacy mechanism, is extended and a scaling mistake in its proof is corrected. Significant reductions in correlations in addition to query sensitivities are illustrated , which provide the best utility-privacy trade-off in the literature for the eye tracking dataset used.
Revised:  Fourier Perturbation Algorithm, which is a differential privacy mechanism, is extended and a scaling mistake in its proof . Furthermore, we illustrate significant reductions in sample correlations in addition to query sensitivities are illustrated , which provide the best utility-privacy trade-off in the literature for the eye tracking dataset used.
Edit intent: meaning-changed
Original:  Significant reductions in correlations in addition to query sensitivities are illustrated , which provide the best utility-privacy trade-off in the literature for the eye tracking dataset used. The differentially private eye movement data are evaluated also for classification accuracies for gender and document-type predictions to show that higher privacy is obtained without a reduction in the classification accuracies by using proposed methods .
Revised:  Significant reductions in correlations in addition to query sensitivities are illustrated , which provide the best utility-privacy trade-off in the eye tracking literature. Our results show significantly high privacy without loss in classification accuracies as well .
Edit intent: coherence
Original:  Yet, only a few reaction systems are well-understood due to a large number of important reaction pathways involved but still unknown. Revealing unknown reaction pathways is an important task for scientific discovery that takes decades and requires lots of expert knowledge. This work presents a neural network approach for discovering unknown reaction pathways from concentration time series data.
Revised:  Yet, revealing the reaction pathways for complex systems and processes is still challenging due to the lack of knowledge of the involved species and reactions. Here, we present a neural network approach for discovering unknown reaction pathways from concentration time series data.
Edit intent: clarity
Original:  The neural network denoted as Chemical Reaction Neural Network (CRNN), is designed to be equivalent to chemical reaction networks by following the fundamental physics laws of the Law of Mass Action and  Arrhenius Law.
Revised:  The neural network denoted as Chemical Reaction Neural Network (CRNN), is designed to be equivalent to chemical reaction networks by following the fundamental physics laws , including the Law of Mass Action and Arrhenius Law.
Edit intent: clarity
Original:  The neural network denoted as Chemical Reaction Neural Network (CRNN), is designed to be equivalent to chemical reaction networks by following the fundamental physics laws of the Law of Mass Action and  Arrhenius Law.
Revised:  The neural network denoted as Chemical Reaction Neural Network (CRNN), is designed to be equivalent to chemical reaction networks by following the fundamental physics laws of the Law of Mass Action and the Arrhenius Law.
Edit intent: fluency
Original:  The CRNN is physically interpretable , and its weights correspond to the reaction pathways and rate constants of the chemical reaction network. Then, inferencing the reaction pathways and the rate constants are accomplished by training the equivalent CRNN via stochastic gradient descent.
Revised:  The CRNN is physically interpretable , and its weights correspond to the reaction pathways can be interpreted, and the kinetic parameters can be quantified simultaneously from the weights of the neural network. The inference of the chemical pathways is accomplished by training the equivalent CRNN via stochastic gradient descent.
Edit intent: meaning-changed
Original:  The approach precludes the need for expert knowledge in proposing candidate reactions, such that the inference is autonomous and applicable to new systemsfor which there is no existing empirical knowledge to propose reaction pathways .
Revised:  We demonstrate the successful implementations and the robustness of the approach in elucidating the chemical reaction pathways of several chemical engineering and biochemical systems. The autonomous inference by the CRNN approach precludes the need for expert knowledge in proposing candidate reactions, such that the inference is autonomous and applicable to new systemsfor which there is no existing empirical knowledge to propose reaction pathways .
Edit intent: meaning-changed
Original:  The physical interpretability also makes the CRNN not only capable of fitting the data for a given system but also developing knowledge of unknown pathways that could be generalized to similar chemical systems . Finally, the approach is applied to several chemical systems in chemical engineering and biochemistry to demonstrate its robustness and generality .
Revised:  The physical interpretability also makes the CRNN not only capable of fitting the data for a given system but also developing knowledge of unknown pathways that could be generalized to similar chemical systems .
Edit intent: coherence
Original: The Semantic Web is made of structured sources of information, such as DBpedia or GeoNames, also known as Linked Data(LD). They can be linked and queried together. The information they contain is atomized into triples , each triple being a simple statement composed of a subject, a predicate and an object. Triples can be combined to form higher level statements  following information needs.
Revised: Knowledge Graphs have become a ubiquitous technology powering search engines, recommender systems, connected objects, corporate knowledge management and Open Data. They rely on small units of information named triples that can be combined to form higher level statements following information needs.
Edit intent: clarity
Original:  We present a new parallel algorithm for k-clique counting  that has polylogarithmic span  and is work-efficient with respect to the well-known sequential algorithmfor k-clique listing by Chiba and Nishizeki .
Revised:  We present a new parallel algorithm for k-clique counting /listing that has polylogarithmic span and is work-efficient with respect to the well-known sequential algorithmfor k-clique listing by Chiba and Nishizeki .
Edit intent: clarity
Original:  We present a new parallel algorithm for k-clique counting  that has polylogarithmic span  and is work-efficient with respect to the well-known sequential algorithmfor k-clique listing by Chiba and Nishizeki .
Revised:  We present a new parallel algorithm for k-clique counting that has polylogarithmic span (parallel time) and is work-efficient with respect to the well-known sequential algorithmfor k-clique listing by Chiba and Nishizeki .
Edit intent: meaning-changed
Original:  We present a new parallel algorithm for k-clique counting  that has polylogarithmic span  and is work-efficient with respect to the well-known sequential algorithmfor k-clique listing by Chiba and Nishizeki .
Revised:  We present a new parallel algorithm for k-clique counting that has polylogarithmic span and is work-efficient (matches the work of the best sequential algorithm) for sparse graphs .
Edit intent: meaning-changed
Original:  Our algorithm can be extended to support listing and enumeration, and is based on computing low out-degree orientations . We present a new linear-work and polylogarithmic span algorithm for computing such orientations, and new parallel algorithms for producing unbiased estimations of clique counts  .
Revised:  Our algorithm can be extended to support listing and enumeration, and is based on computing low out-degree orientations , which we present new linear-work and polylogarithmic span algorithm for computing such orientations, and new parallel algorithms for producing unbiased estimations of clique counts .
Edit intent: coherence
Original:  Finally, we design  new parallel work-efficient algorithms for approximating the k-clique densest subgraph . Our first algorithm gives a 1/k-approximation and is based on iteratively peeling vertices with the lowest clique counts;
Revised:  Finally, we design new parallel work-efficient algorithms for approximating the k-clique densest subgraph , the first of which is a 1/k-approximation and is based on iteratively peeling vertices with the lowest clique counts;
Edit intent: clarity
Original:  Our first algorithm gives a 1/k-approximation and is based on iteratively peeling vertices with the lowest clique counts; our algorithm is work-efficient, but we prove that this process is P-complete and hence does not have polylogarithmic span. Our second algorithm gives a 1/(k(1+\epsilon))-approximation , is work-efficient, and has polylogarithmic span.
Revised:  Our first algorithm gives a 1/k-approximation and the second of which is a 1/(k(1+\epsilon))-approximation , is work-efficient, and has polylogarithmic span.
Edit intent: coherence
Original:  On a 60-core machine , we achieve 13.23 -38.99 x and 1.19 -13.76 x self-relative parallel speedup for k-clique counting and k-clique densest subgraph, respectively.
Revised:  On a 30-core machine with two-way hyper-threading, our algorithms achieve 13.23 -38.99 x and 1.19 -13.76 x self-relative parallel speedup for k-clique counting and k-clique densest subgraph, respectively.
Edit intent: meaning-changed
Original:  On a 60-core machine , we achieve 13.23 -38.99 x and 1.19 -13.76 x self-relative parallel speedup for k-clique counting and k-clique densest subgraph, respectively.
Revised:  On a 60-core machine , we achieve 13.23 --38.99 x and 1.19 -13.76 x self-relative parallel speedup for k-clique counting and k-clique densest subgraph, respectively.
Edit intent: fluency
Original:  On a 60-core machine , we achieve 13.23 -38.99 x and 1.19 -13.76 x self-relative parallel speedup for k-clique counting and k-clique densest subgraph, respectively.
Revised:  On a 60-core machine , we achieve 13.23 -38.99 x and 1.19 --13.76 x self-relative parallel speedup for k-clique counting and k-clique densest subgraph, respectively.
Edit intent: fluency
Original:  Compared to the state-of-the-art parallel k-clique counting algorithms, we achieve a 1.31-9.88 x speedup, and compared to existing implementations of k-clique densest subgraph, we achieve a 1.01-11.83 x speedup.
Revised:  Compared to the state-of-the-art parallel k-clique counting algorithms, we achieve up to 9.88 x speedup, and compared to existing implementations of k-clique densest subgraph, we achieve a 1.01-11.83 x speedup.
Edit intent: meaning-changed
Original:  Compared to the state-of-the-art parallel k-clique counting algorithms, we achieve a 1.31-9.88 x speedup, and compared to existing implementations of k-clique densest subgraph, we achieve a 1.01-11.83 x speedup.
Revised:  Compared to the state-of-the-art parallel k-clique counting algorithms, we achieve a 1.31-9.88 x speedup, and compared to existing implementations of k-clique densest subgraph, we achieve up to 11.83 x speedup.
Edit intent: clarity
Original:  In this paper we study the problem of estimating the relative value of  spatio-temporal data sold in wholesale and retail data marketplaces for the purpose of forecasting future demand in a certain area, e. g. a city.
Revised:  In this paper we study the problem of estimating the relative value of different spatio-temporal data sold in wholesale and retail data marketplaces for the purpose of forecasting future demand in a certain area, e. g. a city.
Edit intent: meaning-changed
Original:  In this paper we study the problem of estimating the relative value of  spatio-temporal data sold in wholesale and retail data marketplaces for the purpose of forecasting future demand in a certain area, e. g. a city.
Revised:  In this paper we study the problem of estimating the relative value of spatio-temporal datasets combined in wholesale and retail data marketplaces for the purpose of forecasting future demand in a certain area, e. g. a city.
Edit intent: meaning-changed
Original:  In this paper we study the problem of estimating the relative value of  spatio-temporal data sold in wholesale and retail data marketplaces for the purpose of forecasting future demand in a certain area, e. g. a city.
Revised:  In this paper we study the problem of estimating the relative value of spatio-temporal data sold in wholesale and retail marketplaces for the purpose of forecasting future demand in a certain area, e. g. a city.
Edit intent: fluency
Original:  In this paper we study the problem of estimating the relative value of  spatio-temporal data sold in wholesale and retail data marketplaces for the purpose of forecasting future demand in a certain area, e. g. a city.
Revised:  In this paper we study the problem of estimating the relative value of spatio-temporal data sold in wholesale and retail data marketplaces for the purpose of predicting demand in metropolitan areas.
Edit intent: clarity
Original:  Using as case studies large datasets of taxi rides from Chicago and New York, we ask questions such as "When does it make sense for different taxi companies to combine their data?"  and "How should different companies be compensated for the data that they share?".
Revised:  Using as case studies large datasets of taxi rides from Chicago and New York, we ask questions such as "When does it make sense for different taxi companies to combine their data?" , and "How should different companies be compensated for the data that they share?".
Edit intent: fluency
Original:  Overall, we show that simplistic approaches, such as assuming that the value of the dataheld by companies or drivers is proportional to its volumeare inaccurate, because they fail to consider the complex complementarities that may exist among different datasets. To remedy this ,  more complex notions of value-sharing from economics and game-theory, such as the Shapley value need to be used to capture the effect of mixing datasets on the accuracy of forecasting algorithms driven by them .
Revised:  Overall, we show that simplistic but popular approaches for estimating the relative value of data, such as using volume , more complex notions of value-sharing from economics and game-theory, such as the Shapley value need to be used to capture the effect of mixing datasets on the accuracy of forecasting algorithms driven by them .
Edit intent: clarity
Original:  To remedy this ,  more complex notions of value-sharing from economics and game-theory, such as the Shapley value need to be used to capture the effect of mixing datasets on the accuracy of forecasting algorithms driven by them .
Revised:  To remedy this , or the ``leave-one-out'' heuristic, are inaccurate. Instead, more complex notions of value-sharing from economics and game-theory, such as the Shapley value need to be used to capture the effect of mixing datasets on the accuracy of forecasting algorithms driven by them .
Edit intent: meaning-changed
Original:  To remedy this ,  more complex notions of value-sharing from economics and game-theory, such as the Shapley value need to be used to capture the effect of mixing datasets on the accuracy of forecasting algorithms driven by them .
Revised:  To remedy this , more complex notions of value from economics and game-theory, such as the Shapley value need to be used to capture the effect of mixing datasets on the accuracy of forecasting algorithms driven by them .
Edit intent: clarity
Original:  To remedy this ,  more complex notions of value-sharing from economics and game-theory, such as the Shapley value need to be used to capture the effect of mixing datasets on the accuracy of forecasting algorithms driven by them .
Revised:  To remedy this , more complex notions of value-sharing from economics and game-theory, such as the Shapley value need to be employed if one wishes to capture the effect of mixing datasets on the accuracy of forecasting algorithms driven by them .
Edit intent: clarity