wanyu/IteraTeR_v2 huggingface dataset:
Original:  Despite the fact that its gigantic scale and impact make difficult to anticipate the effects in humans, we claim from it to be fast, secure, reliable, all-inclusive and trustworthy .
Revised:  Despite the fact that its gigantic scale and interdependence incommode our ability to find relevant information and develop trustworthy contexts .
Edit intent: clarity
Original:  It is time for science to compensate and provide an epistemological "antidote" to these issues.
Revised:  It is time for science to compensate by providing an epistemological "antidote" to these issues.
Edit intent: clarity
Original:  We initiate the dialogue for a theory about being in the Web that will serve as a bridge between philosophical thinking and engineering.
Revised:  We initiate the dialogue for a theory about the Web being that will bridge philosophical thinking and engineering.
Edit intent: clarity
Original:  We analyze existence and spatiotemporality in the Web , as a closed techno-social system, and how it transforms the traditional conceptions about actuality.
Revised:  We analyze existence and spatiotemporality in the Web and how it transforms the traditional conceptions about actuality.
Edit intent: clarity
Original:  Location in the Web space is specified by the Web being's URI and the URI's of incoming and outgoing links.
Revised:  Location in the Web space is specified by incoming and outgoing links.
Edit intent: clarity
Original:  The primer role of visiting durations is best approximated by Bergsonian time.
Revised:  The primordial role of visiting durations is best approximated by Bergsonian time.
Edit intent: fluency
Original:  The primer role of visiting durations is best approximated by Bergsonian time.
Revised:  The primer role of visiting durations in Web's existence is approximated by Bergsonian time.
Edit intent: clarity
Original:  Components of human activity are becoming asynchronous, (partially) synchronous and continuous in the Web . Networked individuals operate in a flexible , less-bounded and spatially dispersed environment.
Revised:  Components of human activity are becoming asynchronous, (partially) synchronous and continuous . Networked individuals operate in a flexible , less-bounded and spatially dispersed environment.
Edit intent: clarity
Original:  Components of human activity are becoming asynchronous, (partially) synchronous and continuous in the Web . Networked individuals operate in a flexible , less-bounded and spatially dispersed environment.
Revised:  Components of human activity are becoming asynchronous, (partially) synchronous and continuous in the Web . Networked individuals operate in a flexible and spatially dispersed environment.
Edit intent: clarity
Original:  The resulting issues are related to the self-determination of being in the Web and the prerequisites for the Web to remain an open platform for innovation and participation .
Revised:  The resulting issues concern the self-determination of being in the Web and the prerequisites for the Web to remain an open platform for innovation and participation .
Edit intent: clarity
Original:  The resulting issues are related to the self-determination of being in the Web and the prerequisites for the Web to remain an open platform for innovation and participation .
Revised:  The resulting issues are related to the self-determination of a being and the way in which the Web could be a free and open platform for innovation and participation .
Edit intent: clarity
Original: Exact exponential time algorithms for NP-hard problems have thrived over the last decade.
Revised: The field of exact exponential time algorithms for NP-hard problems have thrived over the last decade.
Edit intent: clarity
Original: Exact exponential time algorithms for NP-hard problems have thrived over the last decade.
Revised: Exact exponential time algorithms for NP-hard problems has thrived over the last decade.
Edit intent: fluency
Original:  The CNF-SAT problem is the canonical example of a problem for which the brute force 2^n * poly(n)time algorithm remains the best known.
Revised:  The CNF-Sat problem is the canonical example of a problem for which the brute force 2^n * poly(n)time algorithm remains the best known.
Edit intent: fluency
Original:  The assumption that k-CNF-SAT requires 2^n time in the worst case when k grows to infinity is known as the strong exponential time hypothesis (SETH) of Impagliazzo and Paturi   .
Revised:  The assumption that k-CNF-SAT requires 2^n time in the worst case when k grows to infinity is known as the strong exponential time hypothesis (SETH) by Impagliazzo and Paturi .
Edit intent: coherence
Original:  Specifically, we show that  for every epsilon < 1, an O(2^{epsilon n Hitting Set, Set Splitting, or NAE-SAT would violate SETH .
Revised:  Specifically, we show that , for every epsilon < 1, an O(2^{epsilon n Hitting Set, Set Splitting, or NAE-SAT would violate SETH .
Edit intent: fluency
Original:  Here n is the number of elements (or variables ) in the input set system (or formula).
Revised:  Here n is the number of elements or variables in the input set system (or formula).
Edit intent: fluency
Original:  We conjecture that an O(2^{epsilon n for Set Cover would violate SETH as well , and prove  under this assumption, that improving the fastest known algorithms for Steiner Tree, Connected Vertex Cover, Set Partition or the pseudo-polynomial time algorithm for Subset Sum would violate SETH .
Revised:  We conjecture that an O(2^{epsilon n for Set Cover , and prove under this assumption, that improving the fastest known algorithms for Steiner Tree, Connected Vertex Cover, Set Partition or the pseudo-polynomial time algorithm for Subset Sum would violate SETH .
Edit intent: clarity
Original:  We conjecture that an O(2^{epsilon n for Set Cover would violate SETH as well , and prove  under this assumption, that improving the fastest known algorithms for Steiner Tree, Connected Vertex Cover, Set Partition or the pseudo-polynomial time algorithm for Subset Sum would violate SETH .
Revised:  We conjecture that an O(2^{epsilon n for Set Cover would violate SETH as well , and prove that, under this assumption, that improving the fastest known algorithms for Steiner Tree, Connected Vertex Cover, Set Partition or the pseudo-polynomial time algorithm for Subset Sum would violate SETH .
Edit intent: fluency
Original:  We conjecture that an O(2^{epsilon n for Set Cover would violate SETH as well , and prove  under this assumption, that improving the fastest known algorithms for Steiner Tree, Connected Vertex Cover, Set Partition or the pseudo-polynomial time algorithm for Subset Sum would violate SETH .
Revised:  We conjecture that an O(2^{epsilon n for Set Cover would violate SETH as well , and prove under this assumption, the fastest known algorithms for Steiner Tree, Connected Vertex Cover, Set Partition or the pseudo-polynomial time algorithm for Subset Sum would violate SETH .
Edit intent: clarity
Original:  We conjecture that an O(2^{epsilon n for Set Cover would violate SETH as well , and prove  under this assumption, that improving the fastest known algorithms for Steiner Tree, Connected Vertex Cover, Set Partition or the pseudo-polynomial time algorithm for Subset Sum would violate SETH .
Revised:  We conjecture that an O(2^{epsilon n for Set Cover would violate SETH as well , and prove under this assumption, that improving the fastest known algorithms for Steinter Tree, Connected Vertex Cover, Set Partition or the pseudo-polynomial time algorithm for Subset Sum would violate SETH .
Edit intent: fluency
Original:  We conjecture that an O(2^{epsilon n for Set Cover would violate SETH as well , and prove  under this assumption, that improving the fastest known algorithms for Steiner Tree, Connected Vertex Cover, Set Partition or the pseudo-polynomial time algorithm for Subset Sum would violate SETH .
Revised:  We conjecture that an O(2^{epsilon n for Set Cover would violate SETH as well , and prove under this assumption, that improving the fastest known algorithms for Steiner Tree, Connected Vertex Cover, Set Partitioning, and the pseudo-polynomial time algorithm for Subset Sum would violate SETH .
Edit intent: clarity
Original:  in fact, the cytoskeleton (made of helical fibers) seems always to be involved, usually in collective states induced by molecular motors.
Revised:  at the microscopic level, the cell's cytoskeleton of chiral filaments seems always to be involved, usually in collective states induced by molecular motors.
Edit intent: clarity
Original:  in fact, the cytoskeleton (made of helical fibers) seems always to be involved, usually in collective states induced by molecular motors.
Revised:  in fact, the cytoskeleton (made of helical fibers) seems always to be involved, usually in collective states driven by polymerization forces or molecular motors.
Edit intent: clarity
Original: This paper presents a stochastic recursive procedure under constraints to find the optimal distance at which an agent must post his order to minimize his execution cost .
Revised: Considering that a trader or a trading algorithm interacting with markets during continuous auctions can be modeled by an iterating procedure adjusting the price at which he posts orders at a given rhythm, this paper proposes a procedure minimizing his costs .
Edit intent: clarity
Original:  We prove the a.s. convergence of the algorithm under assumptions on the cost function and give some practical criteria on model parameters to ensure that the conditions to use the algorithm are fulfilled (using notably principle of opposite monotony ).
Revised:  We prove the a.s. convergence of the algorithm under assumptions on the cost function and give some practical criteria on model parameters to ensure that the conditions to use the algorithm are fulfilled (using notably the co-monotony principle ).
Edit intent: clarity
Original:  We illustrate our results with numerical experiments on simulated data but also by using a financial market dataset.
Revised:  We illustrate our results with numerical experiments on both simulated data and using a financial market dataset.
Edit intent: clarity
Original: There are several centrality measures in social network analysis (SNA) studies (i.e., degree, closeness, betweenness and eigenvector centralities), which primarily suggest the importance of an actor with a consideration of actor's given structural position in the network.
Revised: There are several centrality measures in social network analysis studies which primarily suggest the importance of an actor with a consideration of actor's given structural position in the network.
Edit intent: clarity
Original: There are several centrality measures in social network analysis (SNA) studies (i.e., degree, closeness, betweenness and eigenvector centralities), which primarily suggest the importance of an actor with a consideration of actor's given structural position in the network.
Revised: There are several centrality measures in social network analysis (SNA) studies (i.e., degree, closeness, betweenness and eigenvector centralities), which primarily suggest the importance of an actor with a consideration of actor's given structural position in a network.
Edit intent: fluency
Original:  Each of the existing measures suggest specific attribute of an actor (i.e., popularity, accessibility, brokerage or gate keeping behavior).
Revised:  Each of the existing measures suggest specific attribute of an actor (i.e., popularity, accessibility, brokerage behavior).
Edit intent: clarity
Original:  In this study, we propose new hybrid centrality measures (i.e., Degree-Degree, Degree-Closeness and Degree-Betweenness), which combines existing measures (  degree, closeness and betweenness) in developing a better understanding of importance of actors in a network.
Revised:  In this study, we propose new hybrid centrality measures (i.e., Degree-Degree, Degree-Closeness and Degree-Betweenness), which combines existing measures ( i.e., degree, closeness and betweenness) in developing a better understanding of importance of actors in a network.
Edit intent: fluency
Original:  Our analysis suggests that the proposed new centrality measures (especially for weighted networks) have higher significant correlation than traditional centrality measures with performance of the actors .
Revised:  Our analysis suggests that the proposed new centrality measures (especially for weighted networks) have higher significant correlation than traditional centrality measures with performance of the scholars .
Edit intent: clarity
Original:  Thus, they are useful measures which can be used instead of traditional measures to show importance of the nodes in a network.
Revised:  Thus, they are useful measures which can be used instead of traditional measures to show importance of the actors in a network.
Edit intent: clarity
Original: There are several centrality measures in social network analysis studies which primarily suggest the importance of an actor with a consideration of actor's given structural position in a network.
Revised: Existing centrality measures for social network analysis studies which primarily suggest the importance of an actor with a consideration of actor's given structural position in a network.
Edit intent: clarity
Original: There are several centrality measures in social network analysis studies which primarily suggest the importance of an actor with a consideration of actor's given structural position in a network.
Revised: There are several centrality measures in social network analysis suggest the im-portance of an actor with a consideration of actor's given structural position in a network.
Edit intent: clarity
Original: There are several centrality measures in social network analysis studies which primarily suggest the importance of an actor with a consideration of actor's given structural position in a network.
Revised: There are several centrality measures in social network analysis studies which primarily suggest the importance of an actor and give consideration to actor's given structural position in a network.
Edit intent: clarity
Original:  Each of the existing measures suggest specific attribute of an actor (i.e., popularity, accessibility,  brokerage behavior).
Revised:  These existing measures suggest specific attribute of an actor (i.e., popularity, accessibility, brokerage behavior).
Edit intent: clarity
Original:  Each of the existing measures suggest specific attribute of an actor (i.e., popularity, accessibility,  brokerage behavior).
Revised:  Each of the existing measures suggest specific attribute of an actor (i.e., popularity, accessibility, and brokerage behavior).
Edit intent: coherence
Original:  In this study, we propose new hybrid centrality measures (i.e., Degree-Degree, Degree-Closeness and Degree-Betweenness), which combines existing measures (i.e., degree, closeness and betweenness) in developing a better understanding of importance of actors in a  network.
Revised:  In this study, we propose new hybrid centrality measures (i.e., Degree-Degree, Degree-Closeness and Degree-Betweenness), by combining existing measures (i.e., degree, closeness and betweenness) in developing a better understanding of importance of actors in a network.
Edit intent: coherence
Original:  In this study, we propose new hybrid centrality measures (i.e., Degree-Degree, Degree-Closeness and Degree-Betweenness), which combines existing measures (i.e., degree, closeness and betweenness) in developing a better understanding of importance of actors in a  network.
Revised:  In this study, we propose new hybrid centrality measures (i.e., Degree-Degree, Degree-Closeness and Degree-Betweenness), which combines existing measures (i.e., degree, closeness and betweenness) in developing a better understanding of importance of actors in a given network.
Edit intent: clarity
Original:  Generalized set of measures  also proposed for weighted networks.
Revised:  Generalized set of measures are also proposed for weighted networks.
Edit intent: clarity
Original:  Our analysis of a real co-authorship network dataset suggests that the proposed new centrality measures (especially for weighted networks) have higher significant correlation than traditional centrality measures with performance of the scholars.
Revised:  Our analysis of co-authorship network dataset suggests that the proposed new centrality measures (especially for weighted networks) have higher significant correlation than traditional centrality measures with performance of the scholars.
Edit intent: clarity
Original:  Our analysis of a real co-authorship network dataset suggests that the proposed new centrality measures (especially for weighted networks) have higher significant correlation than traditional centrality measures with performance of the scholars.
Revised:  Our analysis of a real co-authorship networks dataset suggests significant correlation of our proposed new centrality measures (especially for weighted networks) have higher significant correlation than traditional centrality measures with performance of the scholars.
Edit intent: clarity
Original:  Our analysis of a real co-authorship network dataset suggests that the proposed new centrality measures (especially for weighted networks) have higher significant correlation than traditional centrality measures with performance of the scholars.
Revised:  Our analysis of a real co-authorship network dataset suggests that the proposed new centrality measures (especially weighted networks) have higher significant correlation than traditional centrality measures with performance of the scholars.
Edit intent: clarity
Original:  Our analysis of a real co-authorship network dataset suggests that the proposed new centrality measures (especially for weighted networks) have higher significant correlation than traditional centrality measures with performance of the scholars.
Revised:  Our analysis of a real co-authorship network dataset suggests that the proposed new centrality measures (especially for weighted networks) than traditional centrality measures with performance of the scholars.
Edit intent: clarity
Original:  Thus, they are useful measures which can be used instead of traditional measures to show importance of the actors in a network.
Revised:  Thus, they are useful measures which can be used instead of traditional measures to show prominence of the actors in a network.
Edit intent: clarity
Original: A weak odd dominated (WOD) set in a graph is a subset B of vertices such that there exists a disjoint subset D such that all vertices in B have an odd number of neighbors in D . We point out the connections of weak odd domination with odd domination, (\sigma,\rho) -domination, and perfect codes.
Revised: A weak odd dominated (WOD) set in a graph is a subset B of vertices for which there exists a disjoint subset D such that all vertices in B have an odd number of neighbors in D . We point out the connections of weak odd domination with odd domination, (\sigma,\rho) -domination, and perfect codes.
Edit intent: clarity
Original: A weak odd dominated (WOD) set in a graph is a subset B of vertices such that there exists a disjoint subset D such that all vertices in B have an odd number of neighbors in D . We point out the connections of weak odd domination with odd domination, (\sigma,\rho) -domination, and perfect codes.
Revised: A weak odd dominated (WOD) set in a graph is a subset B of vertices such that there exists a disjoint subset D such that all vertices in B have an odd number of neighbors in D . We point out the connections of weak odd domination with odd domination, sigma,rho -domination, and perfect codes.
Edit intent: fluency
Original:  We introduce bounds on \kappa(G), the maximum size of WOD sets of a graph G, and on \kappa'(G), the minimum size of non WOD sets of G. Moreover, we prove that the corresponding decision problems are NP complete .
Revised:  We introduce bounds on \kappa(G), the maximum size of WOD sets of a graph G, and on \kappa'(G), the minimum size of non WOD sets of G. Moreover, we prove that the corresponding decision problems are NP-complete .
Edit intent: fluency
Original:  Indeed, a graph G of order n can be used to define a quantum secret sharing protocol where \kappa_Q(G) = max(\kappa(G), n-\kappa'(G)) is a threshold ensuring that any set of more than \kappa_Q(G) players can recover the quantum secret.
Revised:  Indeed, a graph G of order n corresponds to a secret sharing protocol where \kappa_Q(G) = max(\kappa(G), n-\kappa'(G)) is a threshold ensuring that any set of more than \kappa_Q(G) players can recover the quantum secret.
Edit intent: clarity
Original:  Finally, using probabilistic methods, we show the existence of an infinite family of graphs with `small' \kappa_Q , and that with high probability a random graph G of order n satisfies \kappa_Q(G)< 0.87 n.
Revised:  Finally, using probabilistic methods, the existence of an infinite family of graphs with `small' \kappa_Q , and that with high probability a random graph G of order n satisfies \kappa_Q(G)< 0.87 n.
Edit intent: coherence
Original: Marginal utility functions, or preference functions may be modeled as distributions generated by generalized functions.
Revised: Preferences of individuals are distributions of elements generated by generalized functions.
Edit intent: clarity
Original:  Models of  decision-making derived from this mathematical basis are not only consistent with results of all experimentsin physiology so far, but also quantitatively relate experimentally obtained physiological observables with predictions of economic models so constructed:
Revised:  Models of economic decision-making derived from this mathematical basis are not only consistent with results of all experimentsin physiology so far, but also quantitatively relate experimentally obtained physiological observables with predictions of economic models so constructed:
Edit intent: fluency
Original:  Models of  decision-making derived from this mathematical basis are not only consistent with results of all experimentsin physiology so far, but also quantitatively relate experimentally obtained physiological observables with predictions of economic models so constructed:
Revised:  Models of decision-making derived from such distributions are consistent with results of all experimentsin physiology so far, but also quantitatively relate experimentally obtained physiological observables with predictions of economic models so constructed:
Edit intent: clarity
Original:  The proposed formalism encompasses a generalized circuit theory for spintronic integrated circuits based on nanomagnetic dynamics and spin transport.
Revised:  The formalism encompasses a generalized circuit theory for spintronic integrated circuits based on nanomagnetic dynamics and spin transport.
Edit intent: clarity
Original:  We then propose an extension to the modified nodal analysis for the analysis of spin circuits  .
Revised:  We then propose an extension to the Modified Nodal Analysis technique for the analysis of spin circuits .
Edit intent: clarity
Original:  We demonstrate the applicability of the proposed theory using an example spin logic circuit  .
Revised:  We demonstrate the applicability of the framework using an example spin logic circuit .
Edit intent: clarity
Original: We use computer algebra to determine explicitly the three fundamental invariants  of a 3 x 3 x 3 array over C as polynomials in the 27 variables x _ijk for 1 <= \le i, j, k <= \le 3.
Revised: We determine the three fundamental invariants of a 3 x 3 x 3 array over C as polynomials in the 27 variables x _ijk for 1 <= \le i, j, k <= \le 3.
Edit intent: clarity
Original: We use computer algebra to determine explicitly the three fundamental invariants  of a 3 x 3 x 3 array over C as polynomials in the 27 variables x _ijk for 1 <= \le i, j, k <= \le 3.
Revised: We use computer algebra to determine explicitly the three fundamental invariants of a 3 x 3 x 3 array over C as polynomials in the 27 variables x _{ijk for 1 <= \le i, j, k <= \le 3.
Edit intent: fluency