wanyu/IteraTeR_v2 huggingface dataset:
Original:  We apply the DST to a sociotechnical data source , usage frequencies for a subset of words on Twitter over a decade, and demonstrate the ability of the DST to filter high-dimensional data and automate the extraction of anomalous behavior .
Revised:  We apply the DST to a sociotechnical data source ( usage frequencies for a subset of words on Twitter over a decade, and demonstrate the ability of the DST to filter high-dimensional data and automate the extraction of anomalous behavior .
Edit intent: fluency
Original:  Inertial Flow is particularly fast due to the use of geographical information while still achieving acceptable quality .
Revised:  Inertial Flow is particularly fast due to the use of geographical information while still achieving decent query times .
Edit intent: clarity
Original:  We show that using 16 cores of a shared-memory machine, this preprocessing needs four minutes on the Europe road network .
Revised:  We show that using 16 cores of a shared-memory machine, this preprocessing needs four minutes .
Edit intent: clarity
Original: We prove a theorem concerning the approximation of multivariate continuous functions by deep ReLU networks, for which the curse of the dimensionality is lessened.
Revised: We prove a theorem concerning the approximation of multivariate functions by deep ReLU networks, for which the curse of the dimensionality is lessened.
Edit intent: clarity
Original: OpenCitations is a scholarly infrastructure organization dedicated to open scholarship and the publication of open bibliographic and citation data as Linked Open Data using Semantic Web technologies, to the development of software tools and services that enable convenient access to these open data, and to community advocacy for open citations.
Revised: OpenCitations is a scholarly infrastructure organization dedicated to open scholarship and the publication of open citation data as Linked Open Data using Semantic Web technologies, to the development of software tools and services that enable convenient access to these open data, and to community advocacy for open citations.
Edit intent: clarity
Original:  It introduces the OpenCitations Data Model and the SPAR (Semantic Publishing and Referencing) Ontologies for encoding scholarly bibliographic and citation data in RDF, and OpenCitations' open software of generic applicability for searching, browsing and providing REST APIs over RDF triplestores .
Revised:  These include the OpenCitations Data Model and the SPAR (Semantic Publishing and Referencing) Ontologies for encoding scholarly bibliographic and citation data in RDF, and OpenCitations' open software of generic applicability for searching, browsing and providing REST APIs over RDF triplestores .
Edit intent: clarity
Original:  It introduces the OpenCitations Data Model and the SPAR (Semantic Publishing and Referencing) Ontologies for encoding scholarly bibliographic and citation data in RDF, and OpenCitations' open software of generic applicability for searching, browsing and providing REST APIs over RDF triplestores .
Revised:  It introduces the OpenCitations Data Model ; the SPAR (Semantic Publishing and Referencing) Ontologies for encoding scholarly bibliographic and citation data in RDF, and OpenCitations' open software of generic applicability for searching, browsing and providing REST APIs over RDF triplestores .
Edit intent: coherence
Original:  It introduces the OpenCitations Data Model and the SPAR (Semantic Publishing and Referencing) Ontologies for encoding scholarly bibliographic and citation data in RDF, and OpenCitations' open software of generic applicability for searching, browsing and providing REST APIs over RDF triplestores .
Revised:  It introduces the OpenCitations Data Model and the SPAR (Semantic Publishing and Referencing) Ontologies ; OpenCitations' open software of generic applicability for searching, browsing and providing REST APIs over RDF triplestores .
Edit intent: coherence
Original:  It describes Open Citation Identifiers (OCIs) , globally unique and persistent identifiers for bibliographic citations, and the OpenCitations OCI Resolution Service that returns bibliographic and citation metadata when queried with an OCI.
Revised:  It describes Open Citation Identifiers (OCIs) and the OpenCitations OCI Resolution Service that returns bibliographic and citation metadata when queried with an OCI.
Edit intent: clarity
Original:  And it describes the OpenCitations Corpus (OCC), a database of open downloadable bibliographic and citation data harvested from bibliographic references in the scholarly literature and made available in RDF under a Creative Commons public domain dedication .
Revised:  And it describes the OpenCitations Corpus (OCC), a database of open downloadable bibliographic and citation data made available in RDF under a Creative Commons public domain dedication .
Edit intent: clarity
Original:  Finally, it outlines the Open Citation Indexes of citation data openly available in third-party bibliographic databases that OpenCitations is currently making available as Linked Open Datasets accessible via its REST API , of which the first and largest is COCI, the OpenCitations Index of Crossref  DOI-to-DOI Citations  which currently contains over 445 million bibliographic citations  .
Revised:  Finally, it outlines the Open Citation Indexes of citation data openly available in third-party bibliographic databases that OpenCitations is currently making available as Linked Open Datasets accessible via its REST API , of which the first and largest is COCI, the OpenCitations Index of Crossref DOI-to-DOI Citations , which currently contains over 445 million bibliographic citations .
Edit intent: fluency
Original: OpenCitations is a scholarly infrastructure organization dedicated to open scholarship and the publication of open citation data as Linked Open Data using Semantic Web technologies, thereby providing a disruptive alternative to traditional proprietary citation indexes.
Revised: OpenCitations is an infrastructure organization for open scholarship dedicated to the publication of open citation data as Linked Open Data using Semantic Web technologies, thereby providing a disruptive alternative to traditional proprietary citation indexes.
Edit intent: clarity
Original:  Open citation data is valuable for bibliometric analysis, increasing the reproducibility of large-scale analyses by enabling publication of the source data.
Revised:  Open citation data are valuable for bibliometric analysis, increasing the reproducibility of large-scale analyses by enabling publication of the source data.
Edit intent: fluency
Original:  as the encoder and adversarial learning as the training loss to learn representations from nodes in two different domainsand bipartite structures, in an unsupervised manner . Moreover, we devise a cascaded architecture to capture the multi-hop relationship in bipartite structure and improves the scalability as well . Extensive experiments on multiple datasets of varying scales verify the effectiveness of ABCGraph compared to state-of-the-arts.
Revised:  as the encoder and adversarial learning as the training loss to learn representations from nodes in two different domainsand bipartite structures, in an unsupervised manner . Moreover, we formulate a multi-layer BGNN in a cascaded manner to enable multi-hop relationship in bipartite structure and improves the scalability as well . Extensive experiments on multiple datasets of varying scales verify the effectiveness of ABCGraph compared to state-of-the-arts.
Edit intent: clarity
Original:  as the encoder and adversarial learning as the training loss to learn representations from nodes in two different domainsand bipartite structures, in an unsupervised manner . Moreover, we devise a cascaded architecture to capture the multi-hop relationship in bipartite structure and improves the scalability as well . Extensive experiments on multiple datasets of varying scales verify the effectiveness of ABCGraph compared to state-of-the-arts.
Revised:  as the encoder and adversarial learning as the training loss to learn representations from nodes in two different domainsand bipartite structures, in an unsupervised manner . Moreover, we devise a cascaded architecture to capture the multi-hop relation modeling while enjoying promising efficiency in training . Extensive experiments on multiple datasets of varying scales verify the effectiveness of ABCGraph compared to state-of-the-arts.
Edit intent: clarity
Original:  as the encoder and adversarial learning as the training loss to learn representations from nodes in two different domainsand bipartite structures, in an unsupervised manner . Moreover, we devise a cascaded architecture to capture the multi-hop relationship in bipartite structure and improves the scalability as well . Extensive experiments on multiple datasets of varying scales verify the effectiveness of ABCGraph compared to state-of-the-arts.
Revised:  as the encoder and adversarial learning as the training loss to learn representations from nodes in two different domainsand bipartite structures, in an unsupervised manner . Moreover, we devise a cascaded architecture to capture the multi-hop relationship in bipartite structure and improves the scalability as well . Extensive experiments on several datasets of varying scales verify the effectiveness of ABCGraph compared to state-of-the-arts.
Edit intent: fluency
Original:  For the experiment on a real-world large-scale bipartite graph system, fast training speed and low memory cost demonstrate the scalability of ABCGraph model .
Revised:  For the experiment on a large-scale bipartite graph system, fast training speed and low memory cost demonstrate the scalability of ABCGraph model .
Edit intent: clarity
Original:  For the experiment on a real-world large-scale bipartite graph system, fast training speed and low memory cost demonstrate the scalability of ABCGraph model .
Revised:  For the experiment on a real-world large-scale bipartite graph system, fast training speed and low memory cost .
Edit intent: clarity
Original:  At its core , BGNN utilizes the proposed Inter-domain Message Passing (IDMP) for message aggregation and Intra-domain Alignment (IDA) towards information fusion over domains, both of which are trained without requiring any supervision .
Revised:  At its core , BGNN utilizes a customized Inter-domain Message Passing (IDMP) for message aggregation and Intra-domain Alignment (IDA) towards information fusion over domains, both of which are trained without requiring any supervision .
Edit intent: clarity
Original:  At its core , BGNN utilizes the proposed Inter-domain Message Passing (IDMP) for message aggregation and Intra-domain Alignment (IDA) towards information fusion over domains, both of which are trained without requiring any supervision .
Revised:  At its core , BGNN utilizes the proposed Inter-domain Message Passing (IDMP) and Intra-domain Alignment (IDA) towards information fusion over domains, both of which are trained without requiring any supervision .
Edit intent: clarity
Original:  Moreover, we formulate a multi-layer BGNN in a cascaded  manner to enable multi-hop relation modeling while enjoying promising efficiency in training . Extensive experiments on several datasets of varying scales verify the effectiveness of BGNN compared to other counterparts.
Revised:  Moreover, we formulate a multi-layer BGNN in a cascaded manner to enable multi-hop relationship modeling while improving training efficiency . Extensive experiments on several datasets of varying scales verify the effectiveness of BGNN compared to other counterparts.
Edit intent: clarity
Original:  Particularly for the experiment on a large-scale bipartite graph dataset, the scalability of our BGNN is validated in terms of fast training speed and low memory cost  .
Revised:  Particularly for the experiment on a large-scale bipartite graph dataset, the scalability of our BGNN is validated in terms of fast training speed and low memory cost over a large-scale real-world bipartite graph .
Edit intent: clarity
Original: Modern experimental techniques such as Hi--C make it possible to measure the probability that different chromosomal regions are close in space.
Revised: Modern experimental techniques such as Hi--C permit to measure probabilities that different chromosomal regions are close in space.
Edit intent: clarity
Original:  Our analysis shows that Hi--C maps display a non-trivial multifractal spectrum.
Revised:  Our analysis reveals that Hi--C maps display a non-trivial multifractal spectrum.
Edit intent: fluency
Original: We introduce a simple analytical model that describes the structure of chromosomes as a hierarchical set of domains nested in each other and we solve it exactly.
Revised: We introduce a simple analytical model that describes chromosomes as a hierarchical set of domains nested in each other and we solve it exactly.
Edit intent: clarity
Original:  The predicted multifractal spectrum is characterized by a phase transition between two phases with different fractal dimension, in excellent agreement with experimental data.
Revised:  The predicted multifractal spectrum is in excellent quantitative agreement with experimental data.
Edit intent: clarity
Original: Modern biological techniques such as Hi--C permit to measure probabilities that different chromosomal regions are close in space.
Revised: Modern biological techniques such as Hi-C permit to measure probabilities that different chromosomal regions are close in space.
Edit intent: fluency
Original:  Our analysis reveals that Hi--C maps are bifractal, i.e. they are complex geometrical objects characterized by two distinct fractal dimensions.
Revised:  Our analysis reveals that Hi-C maps are bifractal, i.e. they are complex geometrical objects characterized by two distinct fractal dimensions.
Edit intent: fluency
Original:  Our analysis reveals that Hi--C maps are bifractal, i.e. they are complex geometrical objects characterized by two distinct fractal dimensions.
Revised:  Our analysis reveals that Hi--C maps are bifractal, i.e. complex geometrical objects characterized by two distinct fractal dimensions.
Edit intent: clarity
Original:  To rationalize this observation, we introduce a model that describes chromosomes as a hierarchical set of domains nested in each other and we solve it exactly.
Revised:  To rationalize this observation, we introduce a model that describes chromosomes as a hierarchical set of nested domains and we solve it exactly.
Edit intent: clarity
Original:  Our theory yields to a more robust estimation of the scaling exponent of the contact probability than existing methods.
Revised:  Moreover, we show that our theory yields to a more robust estimation of the scaling exponent of the contact probability than existing methods.
Edit intent: coherence
Original:  Weihrauch 2000, Theorem ~ 6.4.1), and of computational cost characterizing complexity class #P_1 (cmp.
Revised:  Weihrauch 2000, Theorem 6.4.1), and of computational cost characterizing complexity class #P_1 (cmp.
Edit intent: fluency
Original:  Ko 1991, Theorem ~ 5.32).
Revised:  Ko 1991, Theorem 5.32).
Edit intent: fluency
Original:  We establish that in fact every computably compact computable metric group renders the Haar integral computable: once  using an elegant synthetic argument  ;
Revised:  We establish that in fact every computably compact computable metric group renders the Haar integral computable: once asserting computability using an elegant synthetic argument ;
Edit intent: clarity
Original:  \%counter-intuitive behavior We present a fully-fledged design of bidirectional instances, covering the specification of typing and elaboration into System FC, as well as an algorithm for type inference and elaboration.
Revised:  We present a fully-fledged design of bidirectional instances, covering the specification of typing and elaboration into System FC, as well as an algorithm for type inference and elaboration.
Edit intent: coherence
Original: Two algorithms, RECURSIA and RRT, are presented, designed to increase the compression factor achieved using SIATEC-based point-set cover algorithms . RECURSIA recursively applies a TEC cover algorithm to the patterns in the TECs that it discovers.
Revised: We introduce two algorithms, RECURSIA and RRT, are presented, designed to increase the compression factor achieved using SIATEC-based point-set cover algorithms . RECURSIA recursively applies a TEC cover algorithm to the patterns in the TECs that it discovers.
Edit intent: coherence
Original: Two algorithms, RECURSIA and RRT, are presented, designed to increase the compression factor achieved using SIATEC-based point-set cover algorithms . RECURSIA recursively applies a TEC cover algorithm to the patterns in the TECs that it discovers.
Revised: Two algorithms, RECURSIA and RRT, designed to increase the compression factor achieved using SIATEC-based point-set cover algorithms . RECURSIA recursively applies a TEC cover algorithm to the patterns in the TECs that it discovers.
Edit intent: clarity
Original: Two algorithms, RECURSIA and RRT, are presented, designed to increase the compression factor achieved using SIATEC-based point-set cover algorithms . RECURSIA recursively applies a TEC cover algorithm to the patterns in the TECs that it discovers.
Revised: Two algorithms, RECURSIA and RRT, are presented, designed to increase the compression factor achievable using point-set cover algorithms . RECURSIA recursively applies a TEC cover algorithm to the patterns in the TECs that it discovers.
Edit intent: clarity
Original: We develop a dual control method for approximating investment strategies in incomplete environments that emerge from the presence of market frictions . Convex duality enables the approximate technology to generate lower and upper bounds on the optimal value function.
Revised: We develop a dual control method for approximating investment strategies in incomplete environments that emerge from the presence of trading constraints . Convex duality enables the approximate technology to generate lower and upper bounds on the optimal value function.
Edit intent: clarity
Original: We develop a dual control method for approximating investment strategies in incomplete environments that emerge from the presence of trading constraints.
Revised: We develop a dual-control method for approximating investment strategies in incomplete environments that emerge from the presence of trading constraints.
Edit intent: fluency
Original:  The mechanism rests on closed-form expressions pertaining to the portfolio composition, whence we are able to derive the near-optimal asset allocation explicitly.
Revised:  The mechanism rests on closed-form expressions pertaining to the portfolio composition, from which we are able to derive the near-optimal asset allocation explicitly.
Edit intent: clarity
Original:  In a real financial market, we illustrate the accuracy of our approximate method on a dual CRRA utility function that characterizes the preferences of some finite-horizon investor.
Revised:  In a real financial market, we illustrate the accuracy of our approximate method on a dual CRRA utility function that characterises the preferences of some finite-horizon investor.
Edit intent: fluency
Original:  In a real financial market, we illustrate the accuracy of our approximate method on a dual CRRA utility function that characterizes the preferences of some finite-horizon investor.
Revised:  In a real financial market, we illustrate the accuracy of our approximate method on a dual CRRA utility function that characterizes the preferences of a finite-horizon investor.
Edit intent: clarity
Original: In this paper we examine the information sharing behavior of Twitter users regarding the MeToo hashtag ( #MeToo ), and whether the Pareto principle applies to domain names and URLs used in the tweets containing this hashtag.
Revised: In this paper we examine the most influential resources shared on Twitter about the #MeToo ), and whether the Pareto principle applies to domain names and URLs used in the tweets containing this hashtag.
Edit intent: clarity
Original: RStudio and Python were used to retrieve and analyze the data.
Revised: RStudio and Python were used to analyze the data.
Edit intent: clarity
Original:  Results demonstrated that the most frequent domain name was twitter.com (47.20\%), followed by nytimes.com (4.42\%) and youtube.com (3.69\%).
Revised:  Results demonstrated that the most frequently shared domains were twitter.com (47.20\%), followed by nytimes.com (4.42\%) and youtube.com (3.69\%).
Edit intent: clarity
Original:  Results demonstrated that the most frequent domain name was twitter.com (47.20\%), followed by nytimes.com (4.42\%) and youtube.com (3.69\%).
Revised:  Results demonstrated that the most frequent domain name was twitter.com (47.20\%), nytimes.com (4.42\%) and youtube.com (3.69\%).
Edit intent: clarity
Original:  Domain names exhibited the Pareto Principle: 8\% of domain names accounted for 80\% of the shared content on Twitter that contained #MeToo.
Revised:  In accordance with the Pareto principle, 8\% of domain names accounted for 80\% of the shared content on Twitter that contained #MeToo.
Edit intent: clarity
Original:  The Pareto Principle did not hold when considering the URLs.
Edit intent: coherence
Original:  This study provides a better understanding of what online resources people rely on to share information about the #MeToo movement .
Revised:  This study provides a base for researchers who are interested in understanding what online resources people rely on to share information about the #MeToo movement .
Edit intent: clarity
Original:  This study provides a better understanding of what online resources people rely on to share information about the #MeToo movement .
Revised:  This study provides a better understanding of what online resources people rely on when sharing information about online social movements (e.g. #MeToo movement .
Edit intent: clarity
Original:  This study provides a better understanding of what online resources people rely on to share information about the #MeToo movement .
Revised:  This study provides a better understanding of what online resources people rely on to share information about the #MeToo ) .
Edit intent: clarity
Original: Echo chambers and opinion polarization have been recently quantified in several sociopolitical contexts , across different social media, raising concerns for the potential impact on the spread of misinformation and the openness of debates.
Revised: Echo chambers and opinion polarization recently quantified in several sociopolitical contexts , across different social media, raising concerns for the potential impact on the spread of misinformation and the openness of debates.
Edit intent: clarity
Original: Echo chambers and opinion polarization have been recently quantified in several sociopolitical contexts , across different social media, raising concerns for the potential impact on the spread of misinformation and the openness of debates.
Revised: Echo chambers and opinion polarization have been recently quantified in several sociopolitical contexts and across different social media, raising concerns for the potential impact on the spread of misinformation and the openness of debates.
Edit intent: fluency
Original: Echo chambers and opinion polarization have been recently quantified in several sociopolitical contexts , across different social media, raising concerns for the potential impact on the spread of misinformation and the openness of debates.
Revised: Echo chambers and opinion polarization have been recently quantified in several sociopolitical contexts , across different social media, raise concerns on their potential impact on the spread of misinformation and the openness of debates.
Edit intent: fluency