wanyu/IteraTeR_v2 huggingface dataset:
Original: The progressive digitization of historical archives provides new, often domain specific, textual resources that report on facts and events  happened in the past;
Revised: The progressive digitization of historical archives provides new, often domain specific, textual resources that report on facts and events which have happened in the past;
Edit intent: clarity
Original:  among them , memoirs are a very common type of primary source.
Revised:  among these , memoirs are a very common type of primary source.
Edit intent: clarity
Original:  We assess quantitatively each of the key-steps of our approach and provide a graph-based representation of the extracted knowledge, which allows the end user to move between close and distant reading of the collection.
Revised:  We evaluate quantitatively each of the key-steps of our approach and provide a graph-based representation of the extracted knowledge, which allows the end user to move between close and distant reading of the collection.
Edit intent: fluency
Original:  We assess quantitatively each of the key-steps of our approach and provide a graph-based representation of the extracted knowledge, which allows the end user to move between close and distant reading of the collection.
Revised:  We assess quantitatively each of the key-steps of our approach and provide a graph-based representation of the extracted knowledge, which allows to move between close and distant reading of the collection.
Edit intent: clarity
Original:  We assess quantitatively each of the key-steps of our approach and provide a graph-based representation of the extracted knowledge, which allows the end user to move between close and distant reading of the collection.
Revised:  We assess quantitatively each of the key-steps of our approach and provide a graph-based representation of the extracted knowledge, which allows the end user to move between a Close and a Distant Reading of the collection.
Edit intent: fluency
Original:  Specifically, in the broadcast tree model ( which has important applications to phylogenetic reconstruction and close connections to community detection ) , we show the following: (1) No AC^0 circuit can guess the label of the root with positive advantage over random guessing, independent of the depth for any non-trivial choice of parameters.
Revised:  Specifically, in the broadcast tree model , which has important applications to phylogenetic reconstruction and close connections to community detection ) , we show the following: (1) No AC^0 circuit can guess the label of the root with positive advantage over random guessing, independent of the depth for any non-trivial choice of parameters.
Edit intent: fluency
Original:  Specifically, in the broadcast tree model ( which has important applications to phylogenetic reconstruction and close connections to community detection ) , we show the following: (1) No AC^0 circuit can guess the label of the root with positive advantage over random guessing, independent of the depth for any non-trivial choice of parameters.
Revised:  Specifically, in the broadcast tree model ( which has important applications in phylogenetic reconstruction and close connections to community detection ) , we show the following: (1) No AC^0 circuit can guess the label of the root with positive advantage over random guessing, independent of the depth for any non-trivial choice of parameters.
Edit intent: fluency
Original:  (3) There is a 16 label broadcast tree model  in which it is possible to accurately guess the label of the root, but beating random guessing is NC^1-hard .
Revised:  We also show that there is a 16 label broadcast tree model in which it is possible to accurately guess the label of the root, but beating random guessing is NC^1-hard .
Edit intent: coherence
Original:  For that purpose, we define the concept of community inconsistency that indicates how inconsistently a node is identified as a member of a community regarding the other nodes.
Revised:  For that purpose, we define the concept of companionship inconsistency that indicates how inconsistently a node is identified as a member of a community regarding the other nodes.
Edit intent: clarity
Original:  Analyzing model and real networks, we show that community inconsistency discloses unique characteristics of nodes, thus we suggest it as a new type of node centrality.
Revised:  Analyzing model and real networks, we show that companionship inconsistency discloses unique characteristics of nodes, thus we suggest it as a new type of node centrality.
Edit intent: clarity
Original:  In social networks, for example, community inconsistency can classify outsider nodes without firm community membership and promiscuous nodes with multiple connections to several communities.
Revised:  In social networks, for example, companionship inconsistency can classify outsider nodes without firm community membership and promiscuous nodes with multiple connections to several communities.
Edit intent: clarity
Original:  Community inconsistency, therefore, abstracts individual nodes' intrinsic property on its relationship to a higher-order organization of the network.
Revised:  Companionship inconsistency, therefore, abstracts individual nodes' intrinsic property on its relationship to a higher-order organization of the network.
Edit intent: clarity
Original:  Here we present a formulation for fitting Gaussian Mixture Models (GMMs) directly to geometric objects, using the triangles of triangular mesh instead of using points sampled from its surface.
Revised:  Here we present a formulation for fitting Gaussian Mixture Models (GMMs) directly to a triangular mesh instead of using points sampled from its surface.
Edit intent: clarity
Original: The adaptive immune system  can detect, respond to, and learn diverse pathogens from the past experience.
Revised: The adaptive immune system can detect, respond to, and memorize diverse pathogens from the past experience.
Edit intent: clarity
Original: The adaptive immune system  can detect, respond to, and learn diverse pathogens from the past experience.
Revised: The adaptive immune system can detect, respond to, and learn diverse pathogens from past experience.
Edit intent: fluency
Original:  By employing recent advancements of the deep RL, we show that the Th immune network can acquire the association of antigen patterns of pathogens and the effective responses to them .
Revised:  By employing recent advancements of the deep RL, we show that the Th immune network can acquire the association between antigen patterns of pathogens and the effective responses to them .
Edit intent: clarity
Original:  By employing recent advancements of the deep RL, we show that the Th immune network can acquire the association of antigen patterns of pathogens and the effective responses to them .
Revised:  By employing recent advancements of the deep RL, we show that the Th immune network can acquire the association of antigen patterns of and the effective responses to them .
Edit intent: clarity
Original:  By employing recent advancements of the deep RL, we show that the Th immune network can acquire the association of antigen patterns of pathogens and the effective responses to them .
Revised:  By employing recent advancements of the deep RL, we show that the Th immune network can acquire the association of antigen patterns of pathogens and the effective responses to pathogens .
Edit intent: clarity
Original:  Moreover, the clonal selection as well as other inter-lymphocyte interactions are derived as a learning rule of the network.
Revised:  Moreover, the clonal selection as well as other inter-cellular interactions are derived as a learning rule of the network.
Edit intent: clarity
Original:  Our theoretical framework can contribute to revising and renewing our understanding of adaptive immunity as a learning system.
Revised:  Our theoretical framework may contribute to revising and renewing our understanding of adaptive immunity as a learning system.
Edit intent: clarity
Original:  We review the first order conditions for optimality, and the conditions ensuring optimality after discretization .
Revised:  We review the first order conditions for optimality, and the conditions ensuring optimality after discretisation .
Edit intent: fluency
Original: Twin vertices of a graph have the same common neighbours .
Revised: Twin vertices of a graph have the same open neighbourhood .
Edit intent: clarity
Original:  If they are  adjacent, then they are called duplicates and contribute the eigenvalue zero to the adjacency matrix.
Revised:  If they are not adjacent, then they are called duplicates and contribute the eigenvalue zero to the adjacency matrix.
Edit intent: coherence
Original:  We obtain closed formulae for the characteristic polynomial of a graph with twin vertices in terms of two polynomials associated with the perturbed graph.
Revised:  We obtain a closed formula for the characteristic polynomial of a graph with twin vertices in terms of two polynomials associated with the perturbed graph.
Edit intent: fluency
Original:  We also reveal some important wavenumber for malignancy, that can be associated mainly to lipids, cytochrome c and phenylalanine.
Revised:  We also reveal some important wavenumber for malignancy, that can be associated mainly to lipids, cytochrome and phenylalanine.
Edit intent: fluency
Original:  For such an influence propagation model, we address the question of how many seeded voters a candidate need to place among undecided voters in order to win an election.
Revised:  For such an influence propagation model, we address the question of how many seeded voters a candidate needs to place among undecided voters in order to win an election.
Edit intent: fluency
Original:  By conducting extensive experiments, we show that our theoretical percolation thresholds are very close to those obtained from simulations for random networks and the errors are within 10 \% for a real-world network.
Revised:  By conducting extensive experiments, we show that our theoretical percolation thresholds are very close to those obtained from simulations for random networks and the errors are within 10 
Edit intent: clarity
Original:  The motor consists of a cytoplasmic 'rotor' ring and a number of 'stator' units, which are rooted to the cell wall of the bacterium.
Revised:  The motor consists of a cytoplasmic 'rotor' ring and a number of 'stator' units, which are bound to the cell wall of the bacterium.
Edit intent: clarity
Original:  Here, we manipulate the motor to three different speed levels in two different ion-motive force (IMF) conditions.
Revised:  We manipulate the motor to three different speed levels in two different ion-motive force (IMF) conditions.
Edit intent: coherence
Original:  The a-posteriori error is estimated to enable goal-oriented adaptive mesh refinement for the spatial dimensions, while the a-priori error is estimated to guarantee quadratic convergence of the L^2-error .
Revised:  The a-posteriori error is estimated to enable goal-oriented adaptive mesh refinement for the spatial dimensions, while the a-priori error is estimated to guarantee convergence of the L^2-error .
Edit intent: clarity
Original:  The main result of this work is the inclusion of NEEXP (nondeterministic doubly epxonential time) in MIP*.
Revised:  The main result of this work is the inclusion of NEEXP (nondeterministic doubly exponential time) in MIP*.
Edit intent: fluency
Original:  We conclude with a discussion of future work, including assessment of enqueueing policies that may have smaller age of information in some cases .
Revised:  We conclude with a discussion of future work, including assessment of enqueueing policies that may have smaller age of information measures .
Edit intent: clarity
Original: Let G = ( A \cup B ,E) be an instance of the stable marriage problem where every vertex ranks its neighbors in a strict order of preference.
Revised: Let G = ( (A,B) ,E) be an instance of the stable marriage problem where every vertex ranks its neighbors in a strict order of preference.
Edit intent: coherence
Original:  That is, \phi(M,N) %DIFDELCMD < \ge %%%  \phi(N,M) where \phi(M,N) (similarly, \phi (N,M)) is the number of votes for M (resp., N) in the M-vs-N election.
Revised:  That is, \phi(M,N) %DIFDELCMD < \ge %%% \phi(N,M) where \phi(M,N) (similarly, phi (N,M)) is the number of votes for M (resp., N) in the M-vs-N election.
Edit intent: clarity
Original:  Call a matching M quasi-popular if \phi(M,N) %DIFDELCMD < \ge %%%  \phi(N,M)/2 for every matching N.
Revised:  Call a matching M quasi-popular if \phi(M,N) %DIFDELCMD < \ge %%% >= \phi(N,M)/2 for every matching N.
Edit intent: fluency
Original:  That is, \phi(M,N) >= \phi(N,M) where \phi(M,N) (similarly, phi (N,M)) is the number of votes for M (resp., N) in the M-vs-N election.
Revised:  That is, \phi(M,N) >= \phi(N,M) where \phi(M,N) (similarly, \phi (N,M)) is the number of votes for M (resp., N) in the M-vs-N election.
Edit intent: fluency
Original:  Stable matchings are, in fact, popular matchings of minimum size . Unfortunately, unlike in the case of stable matchings , it is NP-hard to find a popular matching of minimum cost , when a linear cost function is given on the edge set -- even worse, the min-cost popular matching problem is hard to approximate up to any factor.
Revised:  Every stable matching is a min-size popular matching . Unfortunately, unlike in the case of stable matchings , it is NP-hard to find a popular matching of minimum cost , when a linear cost function is given on the edge set -- even worse, the min-cost popular matching problem is hard to approximate up to any factor.
Edit intent: coherence
Original:  Stable matchings are, in fact, popular matchings of minimum size . Unfortunately, unlike in the case of stable matchings , it is NP-hard to find a popular matching of minimum cost , when a linear cost function is given on the edge set -- even worse, the min-cost popular matching problem is hard to approximate up to any factor.
Revised:  Stable matchings are, in fact, popular matchings of minimum size . Unfortunately, when there are edge costs , it is NP-hard to find a popular matching of minimum cost , when a linear cost function is given on the edge set -- even worse, the min-cost popular matching problem is hard to approximate up to any factor.
Edit intent: clarity
Original:  Stable matchings are, in fact, popular matchings of minimum size . Unfortunately, unlike in the case of stable matchings , it is NP-hard to find a popular matching of minimum cost , when a linear cost function is given on the edge set -- even worse, the min-cost popular matching problem is hard to approximate up to any factor.
Revised:  Stable matchings are, in fact, popular matchings of minimum size . Unfortunately, unlike in the case of stable matchings , it is NP-hard to find a popular matching of minimum cost -- even worse, the min-cost popular matching problem is hard to approximate up to any factor.
Edit intent: coherence
Original:  The goal of this paper is to obtain efficient algorithms for computing desirable matchings (wrt cost ) by paying the price of mildly relaxing popularity.
Revised:  Let opt be the cost of a min-cost popular matching. Our goal is to efficiently compute a matching of cost at most opt by paying the price of mildly relaxing popularity.
Edit intent: clarity
Original:  Our main positive result is a bi-criteria algorithm that finds in polynomial time a  quasi-popular  matching of cost at most opt , where opt is the cost of a min-cost popular matching . Key to the  algorithm are a number of results for certain polytopes related to matchings and that we believe to be of independent interest .
Revised:  Our main positive result is a bi-criteria algorithm that finds in polynomial time a quasi-popular " matching of cost at most opt , where opt is the cost of a min-cost popular matching . Key to the algorithm are a number of results for certain polytopes related to matchings and that we believe to be of independent interest .
Edit intent: fluency
Original:  Our main positive result is a bi-criteria algorithm that finds in polynomial time a  quasi-popular  matching of cost at most opt , where opt is the cost of a min-cost popular matching . Key to the  algorithm are a number of results for certain polytopes related to matchings and that we believe to be of independent interest .
Revised:  Our main positive result is a bi-criteria algorithm that finds in polynomial time a quasi-popular matching of cost at most opt , where opt is the cost of a min-cost popular matching . Key to the other algorithm are a number of results for certain polytopes related to matchings and that we believe to be of independent interest .
Edit intent: clarity
Original:  Our main positive results are two bi-criteria algorithms that find in polynomial time a near-popular or " quasi-popular " matching of cost at most opt.
Revised:  Our main positive results are two bi-criteria algorithms that find in polynomial time a near-popular or quasi-popular " matching of cost at most opt.
Edit intent: fluency
Original:  Our main positive results are two bi-criteria algorithms that find in polynomial time a near-popular or " quasi-popular " matching of cost at most opt.
Revised:  Our main positive results are two bi-criteria algorithms that find in polynomial time a near-popular or " quasi-popular matching of cost at most opt.
Edit intent: fluency
Original:  Moreover, one of the algorithms finds a quasi-popular matching of cost at most that of a min-cost popular fractional matching -- this cost could be much smaller than opt.
Revised:  Moreover, one of the algorithms finds a quasi-popular matching of cost at most that of a min-cost popular fractional matching , which could be much smaller than opt.
Edit intent: coherence
Original:  We design a methodology to coarsen and interpolate the problem in space using the spectral basis of the SH that is key for the accuracy and efficiency of the approach.
Revised:  We design a methodology that relies on the spectral basis of the SH that is key for the accuracy and efficiency of the approach.
Edit intent: clarity
Original:  The proposed methods are evaluated on the shallow-water equations on the rotating sphere using a set of tests commonly used in the atmospheric flow community and characterized by the fast generation of small-scale features in the solution .
Revised:  The proposed methods are evaluated on the shallow-water equations on the sphere using a set of tests commonly used in the atmospheric flow community and characterized by the fast generation of small-scale features in the solution .
Edit intent: clarity
Original:  The proposed methods are evaluated on the shallow-water equations on the rotating sphere using a set of tests commonly used in the atmospheric flow community and characterized by the fast generation of small-scale features in the solution .
Revised:  The proposed methods are evaluated on the shallow-water equations on the rotating sphere using a set of tests commonly used in the atmospheric flow community .
Edit intent: coherence
Original:  We assess the convergence of PFASST-SH upon refinement in time to investigate the impact of the coarsening strategy on the accuracy of the scheme, and specifically on its ability to capture the high-frequency modes accumulating in the solution.
Revised:  We assess the convergence of PFASST-SH upon refinement in time . We also investigate the impact of the coarsening strategy on the accuracy of the scheme, and specifically on its ability to capture the high-frequency modes accumulating in the solution.
Edit intent: clarity
Original:  We also study the computational cost of PFASST-SH to demonstrate that our scheme can resolve the main features of the solution multiple times faster than the serial schemes and to illustrate the scalability of the approach.
Revised:  Finally, we study the computational cost of PFASST-SH to demonstrate that our scheme can resolve the main features of the solution multiple times faster than the serial schemes and to illustrate the scalability of the approach.
Edit intent: coherence
Original:  We also study the computational cost of PFASST-SH to demonstrate that our scheme can resolve the main features of the solution multiple times faster than the serial schemes and to illustrate the scalability of the approach.
Revised:  We also study the computational cost of PFASST-SH to demonstrate that our scheme resolves the main features of the solution multiple times faster than the serial schemes and to illustrate the scalability of the approach.
Edit intent: clarity
Original:  We propose a multi-level parallel-in-time integration method combining the Parallel Full Approximation Scheme in Space and Time (PFASST) with a spatial discretization based on Spherical Harmonics (SH).
Revised:  We present a multi-level parallel-in-time integration method combining the Parallel Full Approximation Scheme in Space and Time (PFASST) with a spatial discretization based on Spherical Harmonics (SH).
Edit intent: clarity
Original:  This iterative algorithm computes multiple time steps concurrently by interweaving parallel high-order fine corrections and serial corrections performed on a coarsened problem to propagate the updated initial conditions between time steps.
Revised:  The iterative algorithm computes multiple time steps concurrently by interweaving parallel high-order fine corrections and serial corrections performed on a coarsened problem to propagate the updated initial conditions between time steps.
Edit intent: fluency
Original:  We design a methodology that relies on the spectral basis of the SH to coarsen and interpolate the problem in space.
Revised:  We design a methodology relying on the spectral basis of the SH to coarsen and interpolate the problem in space.
Edit intent: fluency
Original:  Finally, we study the computational cost of PFASST-SH to demonstrate that our scheme resolves the main features of the solution multiple times faster than the serial schemes and to illustrate the scalability of the approach .
Revised:  Finally, we study the computational cost of PFASST-SH to demonstrate that our scheme resolves the main features of the solution multiple times faster than the serial schemes .
Edit intent: coherence
Original:  We show that when run for few iterations, the output of the algorithm on A is almost deterministic.
Revised:  We show that when run for few iterations, the output of Lanczos on A is almost deterministic.
Edit intent: clarity
Original:  For instance , we show that  there exists c >0 depending only on  a certain global property of the spectrum of A (in particular, not depending on n) such that when Lanczos is run for at most c \log n iterations, the Jacobi coefficients and the Ritz values deviate from their medians by t with probability at most e^{-\sqrt{n for t<\Vert A \Vert _{\text{op}.
Revised:  More precisely , we show that there exists c >0 depending only on a certain global property of the spectrum of A (in particular, not depending on n) such that when Lanczos is run for at most c \log n iterations, the Jacobi coefficients and the Ritz values deviate from their medians by t with probability at most e^{-\sqrt{n for t<\Vert A \Vert _{\text{op}.
Edit intent: clarity
Original:  These citations are described in RDF by means of the new extended version of the OpenCitations Data Model (OCDM).
Revised:  These citations are described in RDF by means of the newly extended version of the OpenCitations Data Model (OCDM).
Edit intent: fluency
Original:  We introduce the workflow we have developed for creating these data, and also show the additional services that facilitate the access to and querying of these data by means of different access points: a SPARQL endpoint, a REST API, bulk downloads, Web interfaces, and direct access to the citations via HTTP content negotiation.
Revised:  We introduce the workflow we have developed for creating these data, and also show the additional services that facilitate the access to and querying of these data via different access points: a SPARQL endpoint, a REST API, bulk downloads, Web interfaces, and direct access to the citations via HTTP content negotiation.
Edit intent: clarity