wanyu/IteraTeR_v2 huggingface dataset:
Original:  Our evaluation of the current small network shows that this system is efficient and reliable , and we discuss how it could grow to handle the large amounts of structured data that modern science is producing and consuming .
Revised:  Evaluation of the current small network shows that this system is efficient and reliable , and we discuss how it could grow to handle the large amounts of structured data that modern science is producing and consuming .
Edit intent: clarity
Original:  Our evaluation of the current small network shows that this system is efficient and reliable , and we discuss how it could grow to handle the large amounts of structured data that modern science is producing and consuming .
Revised:  Our evaluation of the current small network shows that this system is efficient and reliable .
Edit intent: coherence
Original: We present linear-time algorithms to construct tree-structured Voronoi diagrams , after the sequence of their regions at infinity or along a given boundary is known.
Revised: We present linear-time algorithms to construct tree-structured Voronoi diagrams , after the sequence of their faces along an enclosing boundary (or at infinity) is known.
Edit intent: clarity
Original:  We focus on Voronoi diagrams of line segments , including the farthest-segment Voronoi diagram, the order-(k+1) subdivision within a given order-k Voronoi region, and deleting a segment from a nearest-neighbor  diagram.
Revised:  We focus on Voronoi diagrams of line segments including the farthest-segment Voronoi diagram, the order-(k+1) subdivision within a given order-k Voronoi region, and deleting a segment from a nearest-neighbor diagram.
Edit intent: fluency
Original:  We focus on Voronoi diagrams of line segments , including the farthest-segment Voronoi diagram, the order-(k+1) subdivision within a given order-k Voronoi region, and deleting a segment from a nearest-neighbor  diagram.
Revised:  We focus on Voronoi diagrams of line segments , including the farthest-segment Voronoi diagram, the order-(k+1) subdivision within an order-k Voronoi region, and deleting a segment from a nearest-neighbor diagram.
Edit intent: clarity
Original:  We focus on Voronoi diagrams of line segments , including the farthest-segment Voronoi diagram, the order-(k+1) subdivision within a given order-k Voronoi region, and deleting a segment from a nearest-neighbor  diagram.
Revised:  We focus on Voronoi diagrams of line segments , including the farthest-segment Voronoi diagram, the order-(k+1) subdivision within a given order-k Voronoi region, and deleting a site from a nearest-neighbor diagram.
Edit intent: clarity
Original:  We focus on Voronoi diagrams of line segments , including the farthest-segment Voronoi diagram, the order-(k+1) subdivision within a given order-k Voronoi region, and deleting a segment from a nearest-neighbor  diagram.
Revised:  We focus on Voronoi diagrams of line segments , including the farthest-segment Voronoi diagram, the order-(k+1) subdivision within a given order-k Voronoi region, and deleting a segment from a nearest-neighbor segment Voronoi diagram.
Edit intent: fluency
Original:  The sequence of their faces along the relevant boundary forms a Davenport-Schinzel sequence of order 3. Once this sequence is known, we show how to compute the corresponding Voronoi diagram in linear time, expected or deterministic, augmenting the existing linear frameworks for points in convex position , with the ability to handle non-uniqueness of Voronoi faces.
Revised:  The sequence of their faces along the relevant boundary forms a Davenport-Schinzel sequence of order 3. Once this sequence is known, we show how to compute the corresponding Voronoi diagram in linear time, expected or deterministic, augmenting the existing frameworks for points in convex position , with the ability to handle non-uniqueness of Voronoi faces.
Edit intent: fluency
Original:  The sequence of their faces along the relevant boundary forms a Davenport-Schinzel sequence of order 3. Once this sequence is known, we show how to compute the corresponding Voronoi diagram in linear time, expected or deterministic, augmenting the existing linear frameworks for points in convex position , with the ability to handle non-uniqueness of Voronoi faces.
Revised:  The sequence of their faces along the relevant boundary forms a Davenport-Schinzel sequence of order 3. Once this sequence is known, we show how to compute the corresponding Voronoi diagram in linear time, expected or deterministic, augmenting the existing linear frameworks for points in convex position with the ability to handle non-uniqueness of Voronoi faces.
Edit intent: fluency
Original:  The sequence of their faces along the relevant boundary forms a Davenport-Schinzel sequence of order 3. Once this sequence is known, we show how to compute the corresponding Voronoi diagram in linear time, expected or deterministic, augmenting the existing linear frameworks for points in convex position , with the ability to handle non-uniqueness of Voronoi faces.
Revised:  The sequence of their faces along the relevant boundary forms a Davenport-Schinzel sequence of order 3. Once this sequence is known, we show how to compute the corresponding Voronoi diagram in linear time, expected or deterministic, augmenting the existing linear frameworks for points in convex position , with the ability to handle non-point sites and multiple Voronoi faces.
Edit intent: clarity
Original: We present  linear-time algorithms to construct tree-like Voronoi diagrams with disconnected regions, after the  sequence of their faces along an enclosing boundary (or at infinity) is known.
Revised: We present linear-time algorithm to construct the sequence of their faces along an enclosing boundary (or at infinity) is known.
Edit intent: clarity
Original:  With respect to market efficiency , we show that in the case the insider knows the release time of information , the market is fully efficient.
Revised:  In particular , we show that in the case the insider knows the release time of information , the market is fully efficient.
Edit intent: coherence
Original:  With respect to market efficiency , we show that in the case the insider knows the release time of information , the market is fully efficient.
Revised:  With respect to market efficiency , we show that in the case the insider knows the information release time , the market is fully efficient.
Edit intent: clarity
Original:  Sometimes increased variety leads to a boost in the number of inventors, but in early phases--when the technology is still under construction--it can also be the other way round  .
Revised:  Sometimes increased variety leads to a boost in the number of inventors, but in early phases--when the technology is still under constructio--it can also be the other way round .
Edit intent: fluency
Original:  Given a flock of k identical UAVs, can one ensure that every target is repeatedly visited by some UAV at intervals of duration at most the target's relative deadline?
Revised:  Given a flock of identical UAVs, can one ensure that every target is repeatedly visited by some UAV at intervals of duration at most the target's relative deadline?
Edit intent: fluency
Original:  The special case of there being a single UAV (i.e., k = 1) is claimed to be NP-complete in the literature.
Revised:  The special case of there being a single UAV is claimed to be NP-complete in the literature.
Edit intent: clarity
Original: We have extended the domain-specific language UFL, the Unified Form Language , to support symbolic product operations on finite elements .
Revised: We have extended the domain-specific language UFL, the Unified Form Language .
Edit intent: clarity
Original:  We have made corresponding extensions to FIAT, the FInite element Automatic Tabulator, to enable numerical tabulation of these spaces.
Revised:  We have made corresponding extensions to FIAT, the FInite element Automatic Tabulator, to enable numerical tabulation of such spaces.
Edit intent: fluency
Original:  we make use of the full Firedrake package in this paper to present numerical examples.
Revised:  we make use of the full Firedrake package to present numerical examples.
Edit intent: clarity
Original:  We establish uniqueness of a positive eigenfunction of the pricing operator such that X is recurrent under a new probability measure associated with this eigenfunction (recurrent eigenfunction).
Revised:  A key result is the uniqueness theorem for a positive eigenfunction of the pricing operator such that X is recurrent under a new probability measure associated with this eigenfunction (recurrent eigenfunction).
Edit intent: clarity
Original:  Sibling nuclei can have limited intersections, which allows for discovery of overlapping dense subgraphs.
Revised:  Sibling nuclei can have limited intersections, which enables discovering overlapping dense subgraphs.
Edit intent: fluency
Original:  With the right parameters, the nuclear decomposition generalizes the classic notions of k-cores and k-trusses .
Revised:  With the right parameters, the nucleus decomposition generalizes the classic notions of k-cores and k-trusses .
Edit intent: fluency
Original:  With the right parameters, the nuclear decomposition generalizes the classic notions of k-cores and k-trusses .
Revised:  With the right parameters, the nuclear decomposition generalizes the classic notions of k-cores and k-truss decompositions .
Edit intent: clarity
Original:  We give provable efficient algorithms for nuclear decompositions, and empirically evaluate their behavior in a variety of real graphs.
Revised:  We give provably efficient algorithms for nuclear decompositions, and empirically evaluate their behavior in a variety of real graphs.
Edit intent: fluency
Original:  We give provable efficient algorithms for nuclear decompositions, and empirically evaluate their behavior in a variety of real graphs.
Revised:  We give provable efficient algorithms for nucleus decompositions, and empirically evaluate their behavior in a variety of real graphs.
Edit intent: fluency
Original: {\alpha}-synuclein ({\alpha}-syn) is the intrinsically disordered protein which is considered to be one of the causes of Parkinson's disease.
Revised: {\alpha}-synuclein ({\alpha}-syn) is an intrinsically disordered protein which is considered to be one of the causes of Parkinson's disease.
Edit intent: fluency
Original:  From a Monte Carlo simulation, we provide scenarios of crowding-induced fibril formation.
Revised:  Based on Monte Carlo simulation, we provide scenarios of crowding-induced fibril formation.
Edit intent: clarity
Original:  The main assumption was that {\alpha}-syn can be expressed as coarse-grained particles with internal states coupled with effective volume;
Revised:  The main assumption is that {\alpha}-syn can be expressed as coarse-grained particles with internal states coupled with effective volume;
Edit intent: fluency
Original:  and disordered states were modeled by larger particles with larger internal entropy than other states.
Revised:  and disordered states are modeled by larger particles with larger internal entropy than other states.
Edit intent: fluency
Original:  and the crowding effect reduces the effective internal entropyof disordered states . Based on Monte Carlo simulation, we provide scenarios of crowding-induced fibril formation.
Revised:  and the crowding effect reduces the internal entropy . Based on Monte Carlo simulation, we provide scenarios of crowding-induced fibril formation.
Edit intent: clarity
Original: This paper provides a proof of concept for an EEG-based evolution of a visual image which is on a user's mind.
Revised: This paper provides a proof of concept for an EEG-based reconstruction of a visual image which is on a user's mind.
Edit intent: clarity
Original:  Each selection step had an average classification accuracy of about 75\\%DIF < . An in-depth investigation suggests that most of the misclassification %DIF > . \\%DIF > of the images could be reconstructed completely, while more than 65\\%  were not misinterpretations of the BCI concerning the users' intent , but ratherstemmed from the fact that the users tried to select different polygons than the experimenter wanted them to select .
Revised:  Selection steps have an average classification accuracy of about 75\\%DIF < . An in-depth investigation suggests that most of the misclassification %DIF > . \\%DIF > of the images could be reconstructed completely, while more than 65\\% were not misinterpretations of the BCI concerning the users' intent , but ratherstemmed from the fact that the users tried to select different polygons than the experimenter wanted them to select .
Edit intent: fluency
Original:  Each selection step had an average classification accuracy of about 75\\%DIF < . An in-depth investigation suggests that most of the misclassification %DIF > . \\%DIF > of the images could be reconstructed completely, while more than 65\\%  were not misinterpretations of the BCI concerning the users' intent , but ratherstemmed from the fact that the users tried to select different polygons than the experimenter wanted them to select .
Revised:  Each selection step had an average classification accuracy of 75\\%DIF < . An in-depth investigation suggests that most of the misclassification %DIF > . \\%DIF > of the images could be reconstructed completely, while more than 65\\% were not misinterpretations of the BCI concerning the users' intent , but ratherstemmed from the fact that the users tried to select different polygons than the experimenter wanted them to select .
Edit intent: clarity
Original:  Each selection step had an average classification accuracy of about 75\\%DIF < . An in-depth investigation suggests that most of the misclassification %DIF > . \\%DIF > of the images could be reconstructed completely, while more than 65\\%  were not misinterpretations of the BCI concerning the users' intent , but ratherstemmed from the fact that the users tried to select different polygons than the experimenter wanted them to select .
Revised:  Each selection step had an average classification accuracy of about 75\\%DIF < . An in-depth investigation suggests that most of the misclassification %DIF > . 25\\%DIF > of the images could be reconstructed completely, while more than 65\\% were not misinterpretations of the BCI concerning the users' intent , but ratherstemmed from the fact that the users tried to select different polygons than the experimenter wanted them to select .
Edit intent: clarity
Original:  Each selection step had an average classification accuracy of about 75\\%DIF < . An in-depth investigation suggests that most of the misclassification %DIF > . \\%DIF > of the images could be reconstructed completely, while more than 65\\%  were not misinterpretations of the BCI concerning the users' intent , but ratherstemmed from the fact that the users tried to select different polygons than the experimenter wanted them to select .
Revised:  Each selection step had an average classification accuracy of about 75\\%DIF < . An in-depth investigation suggests that most of the misclassification %DIF > . \\%DIF > of the images could be reconstructed completely, while more than 65\\% of the available visual details could be captured on average. Most of the misclassifications were not misinterpretations of the BCI concerning the users' intent , but ratherstemmed from the fact that the users tried to select different polygons than the experimenter wanted them to select .
Edit intent: clarity
Original:  Each selection step had an average classification accuracy of about 75\\%DIF < . An in-depth investigation suggests that most of the misclassification %DIF > . \\%DIF > of the images could be reconstructed completely, while more than 65\\%  were not misinterpretations of the BCI concerning the users' intent , but ratherstemmed from the fact that the users tried to select different polygons than the experimenter wanted them to select .
Revised:  Each selection step had an average classification accuracy of about 75\\%DIF < . An in-depth investigation suggests that most of the misclassification %DIF > . \\%DIF > of the images could be reconstructed completely, while more than 65\\% were not misinterpretations of the BCI concerning users' intent , but ratherstemmed from the fact that the users tried to select different polygons than the experimenter wanted them to select .
Edit intent: fluency
Original:  Each selection step had an average classification accuracy of about 75\\%DIF < . An in-depth investigation suggests that most of the misclassification %DIF > . \\%DIF > of the images could be reconstructed completely, while more than 65\\%  were not misinterpretations of the BCI concerning the users' intent , but ratherstemmed from the fact that the users tried to select different polygons than the experimenter wanted them to select .
Revised:  Each selection step had an average classification accuracy of about 75\\%DIF < . An in-depth investigation suggests that most of the misclassification %DIF > . \\%DIF > of the images could be reconstructed completely, while more than 65\\% were not misinterpretations of the BCI concerning the users' intent ; rather, users tried to select different polygons than the experimenter wanted them to select .
Edit intent: coherence
Original:  Each selection step had an average classification accuracy of about 75\\%DIF < . An in-depth investigation suggests that most of the misclassification %DIF > . \\%DIF > of the images could be reconstructed completely, while more than 65\\%  were not misinterpretations of the BCI concerning the users' intent , but ratherstemmed from the fact that the users tried to select different polygons than the experimenter wanted them to select .
Revised:  Each selection step had an average classification accuracy of about 75\\%DIF < . An in-depth investigation suggests that most of the misclassification %DIF > . \\%DIF > of the images could be reconstructed completely, while more than 65\\% were not misinterpretations of the BCI concerning the users' intent , but ratherstemmed from the fact that the users tried to select polygons that were different than what was intended by the experimenters .
Edit intent: clarity
Original:  Open problems and alternatives to develop a practical BCI- based image reconstruction application are discussed.
Revised:  Open problems and alternatives to develop a practical BCI-based image reconstruction application are discussed.
Edit intent: fluency
Original:  We also are also comment on the sequence dependence and effect of overhangs.
Revised:  We also comment on the sequence dependence and effect of overhangs.
Edit intent: clarity
Original:  The calculated persistence length is in  range of few microns which is close to the reported experimental results on certain class of  DNA nanotubes.
Revised:  The calculated persistence length is in the range of few microns which is close to the reported experimental results on certain class of DNA nanotubes.
Edit intent: fluency
Original:  The calculated persistence length is in  range of few microns which is close to the reported experimental results on certain class of  DNA nanotubes.
Revised:  The calculated persistence length is in range of few microns which is close to the reported experimental results on certain class of the DNA nanotubes.
Edit intent: fluency
Original:  In our first result, we show that there exists a considerably smaller subgraph of K_3^{\otimes R} which exhibits the following property (shown for K_3^{\otimes R} by Alon et . al.): independent sets close in size to the maximum independent set are well approximated by dictators.
Revised:  In our first result, we show that there exists a considerably smaller subgraph of K_3^{\otimes R} which exhibits the following property (shown for K_3^{\otimes R} by Alon et al.): independent sets close in size to the maximum independent set are well approximated by dictators.
Edit intent: fluency
Original:  The "majority is stablest" type of result of Dinur et . al. and Dinur and Shinkar shows that if there exist two sets of vertices A and B in K_3^{\otimes R} with very few edges with one endpoint in A and another in B, then it must be the case that the two sets A and B share a single influential coordinate.
Revised:  The "majority is stablest" type of result of Dinur et al. and Dinur and Shinkar shows that if there exist two sets of vertices A and B in K_3^{\otimes R} with very few edges with one endpoint in A and another in B, then it must be the case that the two sets A and B share a single influential coordinate.
Edit intent: fluency
Original:  Motivated by wireless network applications "soft" or "probabilistic" connection models have recently been introduced, involving a "connection function" H(r) that gives the probability that two nodes at distance r directly connect.
Revised:  Motivated by wireless ad-hoc networks "soft" or "probabilistic" connection models have recently been introduced, involving a "connection function" H(r) that gives the probability that two nodes at distance r directly connect.
Edit intent: clarity
Original:  In many applications , not only in wireless networks , it is desirable that the graph is fully connected, that is every node is connected to every other node in a multihop fashion.
Revised:  In many applications (not only wireless networks) , it is desirable that the graph is fully connected, that is every node is connected to every other node in a multihop fashion.
Edit intent: fluency
Original:  Motivated by wireless ad-hoc networks "soft" or "probabilistic" connection models have recently been introduced, involving a "connection function" H(r) that gives the probability that two nodes at distance r directly connect .
Revised:  Motivated by wireless ad-hoc networks "soft" or "probabilistic" connection models have recently been introduced, involving a "connection function" H(r) that gives the probability that two nodes at distance r are linked (directly connect) .
Edit intent: clarity
Original:  In many applications (not only wireless networks), it is desirable that the graph is fully connected, that is every node is connected to every other node in a multihop fashion.
Revised:  In many applications (not only wireless networks), it is desirable that the graph is connected, that is every node is connected to every other node in a multihop fashion.
Edit intent: clarity
Original:  In many applications (not only wireless networks), it is desirable that the graph is fully connected, that is every node is connected to every other node in a multihop fashion.
Revised:  In many applications (not only wireless networks), it is desirable that the graph is fully connected, that is every node is linked to every other node in a multihop fashion.
Edit intent: clarity
Original:  Here, the full connection probability of a dense network in a convex domain in two or three dimensions is expressed in terms of contributions from boundary components, for a very general class of connection functions.
Revised:  Here, the connection probability of a dense network in a convex domain in two or three dimensions is expressed in terms of contributions from boundary components, for a very general class of connection functions.
Edit intent: clarity
Original:  Our proposal uses the estimation of the Mutual Information of the received bits .
Revised:  Our proposal uses the estimation of the mutual information between the received and the sent symbols, in order to estimate the number of bits necessary to decode the message at next transmission .
Edit intent: clarity
Original:  The adaptive retransmission technique we propose, shows a better performance in terms of efficiency while maintaining an acceptable delay for services.
Revised:  The adaptive retransmission technique has better efficiency while keeping an acceptable delay for services.
Edit intent: clarity