wanyu/IteraTeR_v2 huggingface dataset:
Original: Heuristically adapted from methods originally developed for social networks , current network modularity approaches to account for negative BOLD-signal correlations in fMRI-derived connectomes yield variable results with suboptimal reproducibility.
Revised: Understanding the modularity of fMRI-derived connectomes yield variable results with suboptimal reproducibility.
Edit intent: clarity
Original:  As an alternative, we propose a new, reproducible approach that exploits how frequent the BOLD-signal correlation between two nodes is negative.
Revised:  Here we present an alternative, we propose a new, reproducible approach that exploits how frequent the BOLD-signal correlation between two nodes is negative.
Edit intent: clarity
Original:  As an alternative, we propose a new, reproducible approach that exploits how frequent the BOLD-signal correlation between two nodes is negative.
Revised:  As an alternative, reproducible approach that exploits how frequent the BOLD-signal correlation between two nodes is negative.
Edit intent: clarity
Original:  We validated this novel probability-based modularity approach on two independent publically available resting state connectome datasets (the Human Connectome Project and the 1000 Functional Connectomes) and demonstrated that negative correlations alone are sufficient in understanding resting-state fMRI connectome modularity.
Revised:  We validated this novel probability-based modularity approach on two independent publicly-available resting-state connectome dataset (the Human Connectome Project and the 1000 Functional Connectomes) and demonstrated that negative correlations alone are sufficient in understanding resting-state fMRI connectome modularity.
Edit intent: clarity
Original:  We validated this novel probability-based modularity approach on two independent publically available resting state connectome datasets (the Human Connectome Project and the 1000 Functional Connectomes) and demonstrated that negative correlations alone are sufficient in understanding resting-state fMRI connectome modularity.
Revised:  We validated this novel probability-based modularity approach on two independent publically available resting state connectome datasets (the Human Connectome Project and the 1000 Functional Connectomes) and demonstrated that negative correlations alone are sufficient in understanding resting-state modularity.
Edit intent: clarity
Original:  In fact, this approach  permits a dual formulation that leads to equivalent solutions regardless of whether one considers positive or negative edges . Results confirmed the superiority of our approach in that:
Revised:  In fact, this approach permits a dual formulation , leading to equivalent solutions regardless of whether one considers positive or negative edges . Results confirmed the superiority of our approach in that:
Edit intent: coherence
Original:  1 ) correlations with  highest probability of being negative are consistently placed between modules, 2 ) due to the equivalent dual forms, no arbitrary weighting factor is required to balance the influence between negative and positive correlations, as is currently employed in all Q modularity-based approaches .
Revised:  a ) correlations with highest probability of being negative are consistently placed between modules, 2 ) due to the equivalent dual forms, no arbitrary weighting factor is required to balance the influence between negative and positive correlations, as is currently employed in all Q modularity-based approaches .
Edit intent: fluency
Original:  1 ) correlations with  highest probability of being negative are consistently placed between modules, 2 ) due to the equivalent dual forms, no arbitrary weighting factor is required to balance the influence between negative and positive correlations, as is currently employed in all Q modularity-based approaches .
Revised:  1 ) correlations with the highest probability of being negative are consistently placed between modules, 2 ) due to the equivalent dual forms, no arbitrary weighting factor is required to balance the influence between negative and positive correlations, as is currently employed in all Q modularity-based approaches .
Edit intent: fluency
Original: Ties between individuals on a social networks can represent different dimensions of interactions, and the spreading of information and innovations on these networks could potentially be driven by some dimensions more than by others.
Revised: Ties between individuals on a social network can represent different dimensions of interactions, and the spreading of information and innovations on these networks could potentially be driven by some dimensions more than by others.
Edit intent: fluency
Original:  We also show by numerical experiments guided by theoretical insights, how our invented bio-mimetic algorithm can achieve competitive predictions with even with very small problem specific data.
Revised:  We also show by numerical experiments guided by theoretical insights, how our invented bio-mimetic algorithm can achieve competitive predictions even with very small problem specific data.
Edit intent: fluency
Original: In quantum cryptography, a quantum one-way permutation is a one-to-one and onto , (secure ) unitary mapping that is easy to compute on every input, but hard to invert given the image of a random input.
Revised: In quantum cryptography, a quantum one-way permutation is a one-to-one and onto (secure unitary) mapping that is easy to compute on every input, but hard to invert given the image of a random input.
Edit intent: fluency
Original:  Levin  (2003) has conjectured that the mapping g(a,x)=(a,f(x)+ax), where f is any length-preserving function and a,x \in GF_{ 2 ^{x }, is an information-theoretically secure permutation within a polynomial factor.
Revised:  Levin (2003) has conjectured that the operator g(a,x)=(a,f(x)+ax), where f is any length-preserving function and a,x \in GF_{ 2 ^{x }, is an information-theoretically secure permutation within a polynomial factor.
Edit intent: clarity
Original:  Here, we prove that Levin  one-way permutation is a secure unitary operator because the probability of inverting it approaches zero faster than the reciprocal of any positive polynomial p(x) over the Boolean ring of all subsets of x. Our result demonstrates by well-known theorems that existence of one-way functions implies existence of a quantum one-way permutation  .
Revised:  Here, we prove that Levin 's one-way permutation is a secure unitary operator because the probability of inverting it approaches zero faster than the reciprocal of any positive polynomial p(x) over the Boolean ring of all subsets of x. Our result demonstrates by well-known theorems that existence of one-way functions implies existence of a quantum one-way permutation .
Edit intent: fluency
Original:  Here, we prove that Levin  one-way permutation is a secure unitary operator because the probability of inverting it approaches zero faster than the reciprocal of any positive polynomial p(x) over the Boolean ring of all subsets of x. Our result demonstrates by well-known theorems that existence of one-way functions implies existence of a quantum one-way permutation  .
Revised:  Here, we prove that Levin one-way permutation is a quantum operator that is secure because the probability of inverting it approaches zero faster than the reciprocal of any positive polynomial p(x) over the Boolean ring of all subsets of x. Our result demonstrates by well-known theorems that existence of one-way functions implies existence of a quantum one-way permutation .
Edit intent: clarity
Original:  Here, we prove that Levin  one-way permutation is a secure unitary operator because the probability of inverting it approaches zero faster than the reciprocal of any positive polynomial p(x) over the Boolean ring of all subsets of x. Our result demonstrates by well-known theorems that existence of one-way functions implies existence of a quantum one-way permutation  .
Revised:  Here, we prove that Levin one-way permutation is a secure unitary operator because the probability of inverting it approaches zero faster than the multiplicative inverse of any positive polynomial p(x) over the Boolean ring of all subsets of x. Our result demonstrates by well-known theorems that existence of one-way functions implies existence of a quantum one-way permutation .
Edit intent: clarity
Original: In quantum cryptography, a quantum one-way permutation is a one-to-one and onto (secure unitary ) mapping\to  that is easy to compute on every input, but hard to invert given the image of a random input.
Revised: In quantum cryptography, a one-way permutation is a one-to-one and onto (secure unitary ) mapping\to that is easy to compute on every input, but hard to invert given the image of a random input.
Edit intent: fluency
Original:  Inf. Transm., vol. 39 (1): 92-103 (2003)] has conjectured that the operator g(a,x)=(a,f(x)+ax), where f is any length-preserving function and a,x \in GF_{{2}^{\|x\|}}, is an information-theoretically secure permutation within a polynomial factor.
Revised:  Inf. Transm., vol. 39 (1): 92-103 (2003)] has conjectured that the unitary transformation g(a,x)=(a,f(x)+ax), where f is any length-preserving function and a,x \in GF_{{2}^{\|x\|}}, is an information-theoretically secure permutation within a polynomial factor.
Edit intent: clarity
Original:  Inf. Transm., vol. 39 (1): 92-103 (2003)] has conjectured that the operator g(a,x)=(a,f(x)+ax), where f is any length-preserving function and a,x \in GF_{{2}^{\|x\|}}, is an information-theoretically secure permutation within a polynomial factor.
Revised:  Inf. Transm., vol. 39 (1): 92-103 (2003)] has conjectured that the operator g(a,x)=(a,f(x)+ax), where f is any length-preserving function and a,x \in GF_{{2}^{\|x\|}}, is an information-theoretically secure operator within a polynomial factor.
Edit intent: clarity
Original:  Here, we prove that Levin's one-way permutation is a quantum operator that is secure because the probability of inverting it approaches zero faster than the multiplicative inverse of any positive polynomial p (x) over the Boolean ring of all subsets of x. Our result demonstrates by well-known theorems that existence of  one-way functions implies existence of a  quantum one-way permutation that cannot be inverted in subexponential time in the worst case.
Revised:  Here, we show that Levin's one-way permutation is a quantum operator that is secure because the probability of inverting it approaches zero faster than the multiplicative inverse of any positive polynomial p (x) over the Boolean ring of all subsets of x. Our result demonstrates by well-known theorems that existence of one-way functions implies existence of a quantum one-way permutation that cannot be inverted in subexponential time in the worst case.
Edit intent: coherence
Original:  Here, we prove that Levin's one-way permutation is a quantum operator that is secure because the probability of inverting it approaches zero faster than the multiplicative inverse of any positive polynomial p (x) over the Boolean ring of all subsets of x. Our result demonstrates by well-known theorems that existence of  one-way functions implies existence of a  quantum one-way permutation that cannot be inverted in subexponential time in the worst case.
Revised:  Here, we prove that Levin's one-way permutation is a quantum operator that is secure because the probability of inverting it approaches zero faster than the multiplicative inverse of any positive polynomial poly (x) over the Boolean ring of all subsets of x. Our result demonstrates by well-known theorems that existence of one-way functions implies existence of a quantum one-way permutation that cannot be inverted in subexponential time in the worst case.
Edit intent: fluency
Original:  Here, we prove that Levin's one-way permutation is a quantum operator that is secure because the probability of inverting it approaches zero faster than the multiplicative inverse of any positive polynomial p (x) over the Boolean ring of all subsets of x. Our result demonstrates by well-known theorems that existence of  one-way functions implies existence of a  quantum one-way permutation that cannot be inverted in subexponential time in the worst case.
Revised:  Here, we prove that Levin's one-way permutation is a quantum operator that is secure because the probability of inverting it approaches zero faster than the multiplicative inverse of any positive polynomial p (x) over the Boolean ring of all subsets of x. Our results demonstrate through well-known theorems that existence of one-way functions implies existence of a quantum one-way permutation that cannot be inverted in subexponential time in the worst case.
Edit intent: fluency
Original:  Here, we prove that Levin's one-way permutation is a quantum operator that is secure because the probability of inverting it approaches zero faster than the multiplicative inverse of any positive polynomial p (x) over the Boolean ring of all subsets of x. Our result demonstrates by well-known theorems that existence of  one-way functions implies existence of a  quantum one-way permutation that cannot be inverted in subexponential time in the worst case.
Revised:  Here, we prove that Levin's one-way permutation is a quantum operator that is secure because the probability of inverting it approaches zero faster than the multiplicative inverse of any positive polynomial p (x) over the Boolean ring of all subsets of x. Our result demonstrates by well-known theorems that existence of one-way functions implies existence of a quantum one-way permutation that cannot be inverted in subexponential time in the worst ca
Edit intent: coherence
Original:  As an application, we illustrate the influence of the market dimension, i.e. the number of stocks in the market, on free lunch with vanishing risk and generalized arbitrage .
Revised:  As an application, we construct a financial market in which the number of stocks in the market, on free lunch with vanishing risk and generalized arbitrage .
Edit intent: clarity
Original:  As an application, we construct a financial market in which the number of  assets determines the absence of arbitrage while the sources of risk have the same dimension .
Revised:  As an application, we construct a financial market in which the number of risky assets determines the absence of arbitrage while the sources of risk have the same dimension .
Edit intent: clarity
Original:  As an application, we construct a financial market in which the number of  assets determines the absence of arbitrage while the sources of risk have the same dimension .
Revised:  As an application, we construct a financial market in which the number of assets determines the absence of arbitrage and equals the number of sources of risk have the same dimension .
Edit intent: clarity
Original:  As an application, we construct a financial market in which the number of  assets determines the absence of arbitrage while the sources of risk have the same dimension .
Revised:  As an application, we construct a financial market in which the number of assets determines the absence of arbitrage while the sources of risk .
Edit intent: clarity
Original:  As an application, we construct a financial market in which the number of risky assets determines the absence of arbitrage and equals the number of sources of risk \emph{ \emph{  .
Revised:  As an application, we construct a financial market in which the \emph{ \emph{ .
Edit intent: clarity
Original:  The use of  block method also allows us to improve the concurrency of the computation, and take advantage of the memory hierarchy of modern microprocessors to increase the arithmetic intensity of the computation relative to data movement.
Revised:  The use of a block method also allows us to improve the concurrency of the computation, and take advantage of the memory hierarchy of modern microprocessors to increase the arithmetic intensity of the computation relative to data movement.
Edit intent: fluency
Original: Research on generative models plays a central role in the emerging field of network science, studying how statistical patterns found in real networks can be generated by formal rules.
Revised: Research on generative models is a central project in the emerging field of network science, studying how statistical patterns found in real networks can be generated by formal rules.
Edit intent: clarity
Original: Research on generative models plays a central role in the emerging field of network science, studying how statistical patterns found in real networks can be generated by formal rules.
Revised: Research on generative models plays a central role in the emerging field of network science, and it studies how statistical patterns found in real networks can be generated by formal rules.
Edit intent: coherence
Original: Research on generative models plays a central role in the emerging field of network science, studying how statistical patterns found in real networks can be generated by formal rules.
Revised: Research on generative models plays a central role in the emerging field of network science, studying how statistical patterns found in real networks could be generated by formal rules.
Edit intent: clarity
Original:   During the last two decades, a variety of models has been proposed with an ultimate goal of achieving comprehensive realism for the generated networks.
Revised:  Output from these generative models is then the basis for designing and evaluating computational methods on networks, and for verification and simulation studies. During the last two decades, a variety of models has been proposed with an ultimate goal of achieving comprehensive realism for the generated networks.
Edit intent: clarity
Original:  (b) explore how  models can be fitted to an original network to produce a structurally similar replica, and (c) aim for producing much larger networks than the original exemplar  .
Revised:  (b) explore how models can be fitted to an original network to produce a structurally similar replica, (c) aim for producing much larger networks than the original exemplar .
Edit intent: coherence
Original:  In a comparative experimental study, we find ReCoN often superior to many other state-of-the-art network generation methods.
Revised:  In a comparative experimental study, we find that ReCoN is often superior to many other state-of-the-art network generation methods.
Edit intent: clarity
Original:  Our design yields a scalable and effective tool for replicating a given network while preserving important properties at both micro- and macroscopic scales and (optionally) scaling the replica by orders of magnitude in size .
Revised:  We argue that ReCoN is a scalable and effective tool for replicating a given network while preserving important properties at both micro- and macroscopic scales and (optionally) scaling the replica by orders of magnitude in size .
Edit intent: clarity
Original:  Our design yields a scalable and effective tool for replicating a given network while preserving important properties at both micro- and macroscopic scales and (optionally) scaling the replica by orders of magnitude in size .
Revised:  Our design yields a scalable and effective tool for modeling a given network while preserving important properties at both micro- and macroscopic scales and (optionally) scaling the replica by orders of magnitude in size .
Edit intent: clarity
Original:  Our design yields a scalable and effective tool for replicating a given network while preserving important properties at both micro- and macroscopic scales and (optionally) scaling the replica by orders of magnitude in size .
Revised:  Our design yields a scalable and effective tool for replicating a given network while preserving important properties at both micro- and macroscopic scales , and for scaling the exemplar data by orders of magnitude in size .
Edit intent: clarity
Original: Mitochondrial networks have been shown to exhibit a variety of complex behaviors, including  cell-wide oscillations of mitochondrial energy states , as well as a phase transition  in response to oxidative stress.
Revised: Mitochondrial networks exhibit a variety of complex behaviors, including cell-wide oscillations of mitochondrial energy states , as well as a phase transition in response to oxidative stress.
Edit intent: clarity
Original: Mitochondrial networks have been shown to exhibit a variety of complex behaviors, including  cell-wide oscillations of mitochondrial energy states , as well as a phase transition  in response to oxidative stress.
Revised: Mitochondrial networks have been shown to exhibit a variety of complex behaviors, including coordinated cell-wide oscillations of mitochondrial energy states , as well as a phase transition in response to oxidative stress.
Edit intent: clarity
Original: Mitochondrial networks have been shown to exhibit a variety of complex behaviors, including  cell-wide oscillations of mitochondrial energy states , as well as a phase transition  in response to oxidative stress.
Revised: Mitochondrial networks have been shown to exhibit a variety of complex behaviors, including cell-wide oscillations of energy states as well as a phase transition in response to oxidative stress.
Edit intent: fluency
Original:  Since functional status and structural properties are often intertwined, in this work we look at the structural properties of the organelle in normal mouse embryonic fibroblasts , describing its most relevant features . Subsequently we manipulated mitochondrial morphology using two interventions with opposite effects:
Revised:  Since functional and structural properties are often intertwined, in this work we look at the structural properties of the organelle in normal mouse embryonic fibroblasts , describing its most relevant features . Subsequently we manipulated mitochondrial morphology using two interventions with opposite effects:
Edit intent: clarity
Original:  Since functional status and structural properties are often intertwined, in this work we look at the structural properties of the organelle in normal mouse embryonic fibroblasts , describing its most relevant features . Subsequently we manipulated mitochondrial morphology using two interventions with opposite effects:
Revised:  Since functional status and structural properties are often interwinded, here we characterize the structure of mitochondrial networks in mouse embryonic fibroblasts , describing its most relevant features . Subsequently we manipulated mitochondrial morphology using two interventions with opposite effects:
Edit intent: clarity
Original:  over-expression of mitofusin 1, a protein that promotes mitochondria fusion , and paraquat treatment, a compound that induces mitochondrial fragmentation due to oxidative stress . Quantitative analysis of the organelle's structural clusters revealed that healthy mitochondrial networks were in a status intermediate between the extremes of highly fragmented and completely fusioned networks.
Revised:  over-expression of mitofusin 1, a protein that promotes mitochondria fusion , and paraquat treatment, a compound that induces mitochondrial fragmentation due to oxidative stress . Quantitative analysis of mitochondrial clusters revealed that healthy mitochondrial networks were in a status intermediate between the extremes of highly fragmented and completely fusioned networks.
Edit intent: clarity
Original:  over-expression of mitofusin 1, a protein that promotes mitochondria fusion , and paraquat treatment, a compound that induces mitochondrial fragmentation due to oxidative stress . Quantitative analysis of the organelle's structural clusters revealed that healthy mitochondrial networks were in a status intermediate between the extremes of highly fragmented and completely fusioned networks.
Revised:  over-expression of mitofusin 1, a protein that promotes mitochondria fusion , and paraquat treatment, a compound that induces mitochondrial fragmentation due to oxidative stress . Quantitative analysis of the organelle's structural clusters revealed that the structural parameters of healthy mitochondria lay in between the extremes of highly fragmented and completely fusioned networks.
Edit intent: clarity