wanyu/IteraTeR_v2 huggingface dataset:
Original:  The model enables the analytic computation of many new predictions for the spread of diseases and other social phenomena on highly spatially inhomogeneous populations by importing the mathematical formalism of random fields instead of traditional discrete graph techniques .
Revised:  The model enables the analytic computation of many new predictions for the spread of diseases and other social phenomena on highly spatially inhomogeneous populations by importing the mathematical formalism of random fields .
Edit intent: coherence
Original:  For a small distinguishability error , an O(1/N)-scaling of the mismatch of internal states of bosons is required for a realistic device with N bosons to have a constant trace distance to the ideal case .
Revised:  For a small distinguishability error a realistic device with N bosons to have a constant trace distance to the ideal case .
Edit intent: clarity
Original:  For a small distinguishability error , an O(1/N)-scaling of the mismatch of internal states of bosons is required for a realistic device with N bosons to have a constant trace distance to the ideal case .
Revised:  For a small distinguishability error , an O(1/N)-scaling of the mismatch of internal states of bosons is required for a realistic device with N bosons is at a constant trace distance to the ideal case .
Edit intent: clarity
Original:  They are applicable to an arbitrary multi-mode network for an arbitrary input state of bosons , having a certain number of particles per input mode , and arbitrary dissimilar detectors .
Revised:  They are applicable for arbitrary multi-mode network for an arbitrary input state of bosons , having a certain number of particles per input mode , and arbitrary dissimilar detectors .
Edit intent: fluency
Original:  They are applicable to an arbitrary multi-mode network for an arbitrary input state of bosons , having a certain number of particles per input mode , and arbitrary dissimilar detectors .
Revised:  They are applicable to an arbitrary multi-mode networks and arbitrary input states of bosons with a certain number of particles per input mode , and arbitrary dissimilar detectors .
Edit intent: fluency
Original:  They are applicable to an arbitrary multi-mode network for an arbitrary input state of bosons , having a certain number of particles per input mode , and arbitrary dissimilar detectors .
Revised:  They are applicable to an arbitrary multi-mode network for an arbitrary input state of bosons , having a certain number of particles per input mode .
Edit intent: coherence
Original:  One bound is on the trace distance between  output probability distributions of a realistic device and the ideal Boson-Sampling computer, whereas the other is on the difference between probabilities of an output configuration in such networks.
Revised:  One bound is on the trace distance between the output probability distributions of a realistic device and the ideal Boson-Sampling computer, whereas the other is on the difference between probabilities of an output configuration in such networks.
Edit intent: fluency
Original:  One bound is on the trace distance between  output probability distributions of a realistic device and the ideal Boson-Sampling computer, whereas the other is on the difference between probabilities of an output configuration in such networks.
Revised:  One bound is on the trace distance between output probability distributions . An upper bound on the trace distance to the ideal bosonic network is proven and also a bound on the difference between probabilities of an output configuration in such networks.
Edit intent: clarity
Original:  For a small distinguishability error  a realistic device with N bosons is at a constant trace distance to the ideal bosonic network under an O(N^{-1})-scaling of boson internal states mismatch.
Revised:  For a small distinguishability error it is shown that a realistic device with N bosons is at a constant trace distance to the ideal bosonic network under an O(N^{-1})-scaling of boson internal states mismatch.
Edit intent: clarity
Original:  They are applicable for arbitrary multi-mode networks and arbitrary input states of bosons with a certain number of particles per input mode .
Revised:  They are applicable for arbitrary multi-mode networks and arbitrary input states of bosons .
Edit intent: clarity
Original: We study the closeness of an experimental unitary bosonic network with only partially indistinguishable bosons in an arbitrary mixed input state, in particular an experimental realization of the Boson-Sampling computer , to the ideal bosonic network, where the measure of closeness of two networks is the trace distance between the output probability distributions.
Revised: We study the closeness of an experimental unitary bosonic network with only partially indistinguishable bosons in an arbitrary mixed input state, in particular an experimental realization of the Boson Sampling , to the ideal bosonic network, where the measure of closeness of two networks is the trace distance between the output probability distributions.
Edit intent: clarity
Original:  For a small distinguishability error it is shown that a realistic device with N bosons is at a constant trace distance to the ideal Boson-Sampling computer under the O(N^{-1})-scaling of the mismatch of internal states of bosons.
Revised:  For a small distinguishability error it is shown that a realistic device with N bosons is at a constant trace distance to the ideal Boson Sampling under the O(N^{-1})-scaling of the mismatch of internal states of bosons.
Edit intent: clarity
Original: Given a set P of terminals in the plane and a partition of P into k subsets P_1, \ldots , P_k, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree T_i connecting the terminals in each set P_i (i=1, %DIFDELCMD < \dots%%%  ,k) and a top-level tree T_{top} connecting the trees T_1, \ldots , T_k.
Revised: Given a set P of terminals in the plane and a partition of P into k subsets P_1, ... , P_k, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree T_i connecting the terminals in each set P_i (i=1, %DIFDELCMD < \dots%%% ,k) and a top-level tree T_{top} connecting the trees T_1, \ldots , T_k.
Edit intent: coherence
Original: Given a set P of terminals in the plane and a partition of P into k subsets P_1, \ldots , P_k, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree T_i connecting the terminals in each set P_i (i=1, %DIFDELCMD < \dots%%%  ,k) and a top-level tree T_{top} connecting the trees T_1, \ldots , T_k.
Revised: Given a set P of terminals in the plane and a partition of P into k subsets P_1, \ldots , P_k, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree T_i connecting the terminals in each set P_i (i=1, %DIFDELCMD < \dots%%% ... ,k) and a top-level tree T_{top} connecting the trees T_1, \ldots , T_k.
Edit intent: fluency
Original: Given a set P of terminals in the plane and a partition of P into k subsets P_1, \ldots , P_k, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree T_i connecting the terminals in each set P_i (i=1, %DIFDELCMD < \dots%%%  ,k) and a top-level tree T_{top} connecting the trees T_1, \ldots , T_k.
Revised: Given a set P of terminals in the plane and a partition of P into k subsets P_1, \ldots , P_k, a two-level rectilinear Steiner tree consists of a rectilinear Steiner tree T_i connecting the terminals in each set P_i (i=1, %DIFDELCMD < \dots%%% ,k) and a top-level tree T_{top} connecting the trees T_1, ... , T_k.
Edit intent: fluency
Original:  For the general case we propose an algorithm that predetermines a connection point for each T_i and T_{top} (i=1, \ldots ,k).
Revised:  For the general case we propose an algorithm that predetermines a connection point for each T_i and T_{top} (i=1, ... ,k).
Edit intent: clarity
Original:  By linking 30640 publications in F1000 to citations in Scopus, we investigated the effect of research level and article type on the internal consistency of assessment results based on citations and FFa scores.
Revised:  By linking 30640 publications in F1000 to citations in Scopus, we investigated the effect of research level and article type on the internal consistency of assessments based on citations and FFa scores.
Edit intent: clarity
Original:  The two measures are significantly different for two groups: non-primary research or evidence-based research publications are more highly cited rather than highly recommended, however, translational research or transformative research publications are more highly recommended by faculties but gather relatively lower citations.
Revised:  These two measures are significantly different for two groups: non-primary research or evidence-based research publications are more highly cited rather than highly recommended, however, translational research or transformative research publications are more highly recommended by faculties but gather relatively lower citations.
Edit intent: fluency
Original:  The two measures are significantly different for two groups: non-primary research or evidence-based research publications are more highly cited rather than highly recommended, however, translational research or transformative research publications are more highly recommended by faculties but gather relatively lower citations.
Revised:  The two measures are significantly different for two groups: non-primary research or evidence-based research publications are more highly cited rather than highly recommended, however, translational research or transformative research publications are more highly recommended by faculty members but gather relatively lower citations.
Edit intent: clarity
Original:  It is logical because citation routines are usually practiced by academic authors while the potential for scientific revolutions and the suitability for clinical practice of an article should be investigated from the practitioners' points of view.
Revised:  This can be expected because citation activities are usually practiced by academic authors while the potential for scientific revolutions and the suitability for clinical practice of an article should be investigated from the practitioners' points of view.
Edit intent: clarity
Original:  We conclude with a policy relevant recommendation that the application of bibliometric approaches in research evaluation procedures could include the proportion of three types of publications: evidence-based research, transformative research, and translational research.
Revised:  We conclude with a policy relevant recommendation that the application of bibliometric approaches in research evaluation procedures should include the proportion of three types of publications: evidence-based research, transformative research, and translational research.
Edit intent: clarity
Original: We report on a contactless and airborne ultrasonic tactile display (AUTD) stimulus-based BCIparadigm.
Revised: This chapter presents results of our project, which studied whether contactless and airborne ultrasonic tactile display (AUTD) stimulus-based BCIparadigm.
Edit intent: coherence
Original:  Six palm positions are used to evoke somatosensory brain responses , in order to define a novel contactless tactile BCI.
Revised:  Six palm positions are used to evoke somatosensory brain responses to implement a novel contactless tactile BCI.
Edit intent: clarity
Original:  A comparison is made with classical attached vibrotactile transducers . Experiment results of subjects performing online experiments validate the novel BCI paradigm .
Revised:  A comparison is made with classical attached vibrotactile transducer-based BCI paradigm . Experiment results of subjects performing online experiments validate the novel BCI paradigm .
Edit intent: clarity
Original:  A comparison is made with classical attached vibrotactile transducers . Experiment results of subjects performing online experiments validate the novel BCI paradigm .
Revised:  A comparison is made with classical attached vibrotactile transducers . Experiment results from subjects performing online experiments validate the novel BCI paradigm .
Edit intent: fluency
Original:  This problem is qualitatively similar to the classical Hidden Markov Model problem and has been studied from a practical point of view in several works beginning with the work presented in: Shalizi, C.R., Shalizi, K.L., Crutchfield, J.P. (2002) arXiv:cs \textit{  / 0210025 .
Revised:  This problem is qualitatively similar to the classical Hidden Markov Model problem and has been studied from a practical point of view in several works beginning with the work presented in: Shalizi, C.R., Shalizi, K.L., Crutchfield, J.P. (2002) \textit{ / 0210025 .
Edit intent: coherence
Original:  This problem is qualitatively similar to the classical Hidden Markov Model problem and has been studied from a practical point of view in several works beginning with the work presented in: Shalizi, C.R., Shalizi, K.L., Crutchfield, J.P. (2002) arXiv:cs \textit{  / 0210025 .
Revised:  This problem is qualitatively similar to the classical Hidden Markov Model problem and has been studied from a practical point of view in several works beginning with the work presented in: Shalizi, C.R., Shalizi, K.L., Crutchfield, J.P. (2002) arXiv:cs \textit{ / .
Edit intent: clarity
Original:  In this context, we propose an enhanced HARQ ( Hybrid Automatic Repeat reQuest  ) for delay tolerant services.
Revised:  In this context, we propose an enhanced Hybrid Automatic Repeat reQuest ) for delay tolerant services.
Edit intent: clarity
Original:  We evaluate the performance of the proposed method with land mobile satellite channel by means of simulations.
Revised:  We evaluate the performance of the proposed method for a land mobile satellite channel by means of simulations.
Edit intent: clarity
Original: A complex contagion is an infectious process in which an individual may require multiple transmissions .
Revised: A complex contagion is an infectious process in which individuals may require multiple transmissions .
Edit intent: fluency
Original:  We typically think of individuals  beginning inactive and becoming active once they are contacted by sufficient numbers of active partners.
Revised:  We typically think of individuals as beginning inactive and becoming active once they are contacted by sufficient numbers of active partners.
Edit intent: fluency
Original:  We typically think of individuals  beginning inactive and becoming active once they are contacted by sufficient numbers of active partners.
Revised:  We typically think of individuals beginning inactive and becoming active after contact with a sufficient number of active partners.
Edit intent: clarity
Original:  These have been studied in a number of contexts, but the analytic models for  dynamic spread of complex contagions are typically complex.
Revised:  These have been studied in a number of cases, but analytic models for dynamic spread of complex contagions are typically complex.
Edit intent: clarity
Original:  These have been studied in a number of contexts, but the analytic models for  dynamic spread of complex contagions are typically complex.
Revised:  These have been studied in a number of contexts, but the analytic models for the dynamic spread of complex contagions are typically complex.
Edit intent: fluency
Original:  Here we study the dynamics of a generalized Watts Threshold Model ( gWTM) . We first show that a wide range of other processes can be thought of as a special case of this gWTM.
Revised:  Here we study the dynamics of the Watts Threshold Model ( gWTM) . We first show that a wide range of other processes can be thought of as a special case of this gWTM.
Edit intent: clarity
Original:  Then we adapt an "edge-based compartmental modeling" approach used for infectious diseases in networks to develop and analyze analytic models for the dynamics the gWTM in configuration model and a class of random clustered (triangle-based) networks.
Revised:  Then we adapt an "edge-based compartmental modeling" approach used for infectious diseases in networks to develop and analyze analytic models for the dynamics of the WTM in Configuration Model networks and a class of random clustered (triangle-based) networks.
Edit intent: clarity
Original:  The resulting model is relatively simple and compact , and we use this model to gain insights into the dynamics.
Revised:  The resulting model is relatively simple and compact . We use it to gain insights into the dynamics.
Edit intent: coherence
Original:  We also sometimes observe hybrid phase transitions when cascades are not possible for small initial conditions, but do occur for large enough initial conditions.
Revised:  We also observe hybrid phase transitions when cascades are not possible for small initial conditions, but do occur for large enough initial conditions.
Edit intent: coherence
Original:  We also sometimes observe hybrid phase transitions when cascades are not possible for small initial conditions, but do occur for large enough initial conditions.
Revised:  We also sometimes observe hybrid phase transitions when cascades are not possible for small initial conditions, but occur for large enough initial conditions.
Edit intent: clarity
Original:  We derive some simple new sufficient conditions for the hybrid phase transition to occur.
Revised:  We derive sufficient conditions for the hybrid phase transition to occur.
Edit intent: clarity
Original:  We derive some simple new sufficient conditions for the hybrid phase transition to occur.
Revised:  We derive some simple new sufficient conditions for this hybrid phase transition to occur.
Edit intent: fluency
Original:  We show that in many cases, above the hybrid phase transition  , all individuals will eventually become active.
Revised:  We show that in many cases, above the hybrid phase transition , all individuals eventually become active.
Edit intent: clarity
Original:  This approach allows us to unify many existing disparate results and derive some new results.
Revised:  This approach allows us to unify many existing disparate observations and derive new results.
Edit intent: clarity
Original: We study an inhomogeneous host-pathogen dynamics to model the global amphibian population extinction in a lake basin system.
Revised: We study inhomogeneous host-pathogen dynamics to model the global amphibian population extinction in a lake basin system.
Edit intent: fluency
Original:  In this model we show how the pathogen spreads from one lake to other eventually spreading to the entire lake basin system in a wave like pattern.
Revised:  In this model we show how the pathogen spreads from one lake to another, eventually spreading to the entire lake basin system in a wave like pattern.
Edit intent: fluency
Original:  We give linear estimates of the extinction time  .
Revised:  Linear estimate of the extinction time .
Edit intent: clarity
Original:  Then the authors prove a near-optimal algorithm listing all the maximal cliques of these graphs in O(kn( 3^{k/3}) ) time .
Revised:  Then the authors prove an algorithm listing all the maximal cliques of these graphs in O(kn( 3^{k/3}) ) time .
Edit intent: clarity
Original:  Then the authors prove a near-optimal algorithm listing all the maximal cliques of these graphs in O(kn( 3^{k/3}) ) time .
Revised:  Then the authors prove a near-optimal algorithm listing all the maximal cliques of these graphs in O(kn( 3^{k/3}) .
Edit intent: clarity
Original: A graph is k-degenerate if there exists an ordering of its vertices v_{1,. ..,v_{n} such that for all i, |N(v_{i})\cap V_{i}|\leq kwhere N(v_{i})is the open neighbourhood of v_{i} and V_{i}=\{v_{i},...,v_{n}\}.
Revised: A graph is k-degenerate if ,. ..,v_{n} such that for all i, |N(v_{i})\cap V_{i}|\leq kwhere N(v_{i})is the open neighbourhood of v_{i} and V_{i}=\{v_{i},...,v_{n}\}.
Edit intent: clarity
Original:  In }  [D. Eppstein, M. Loffler and D, Strash, Listing All Maximal Cliques in Large Sparse Real-World Graphs, JEA (2013 )] , it was proved that the largest possible number of maximal cliques in an n-vertex k-degenerate graph is ( n-k) 3 ^{ k/3%DIFDELCMD < \MBLOCKRIGHTBRACE%%% . Then the authors prove an [  algorithm listing all the maximal cliques of these graphs in optimal time O (k(n-k)3^{k/3}) . In this paper we prove another optimal algorithm ]) and O(k(\log\log k)^{2}}\slash  .
Revised:  In } [D. Eppstein, M. Loffler and D, Strash, Listing All Maximal Cliques in Large Sparse Real-World Graphs, JEA (2013 )] , it was proved that the largest possible number of maximal cliques in an n-vertex k-degenerate graph is ( n-k) 3 ^{ k/3%DIFDELCMD < \MBLOCKRIGHTBRACE%%% . Then the authors prove an [ algorithm listing all maximal cliques in time O (k(n-k)3^{k/3}) . In this paper we prove another optimal algorithm ]) and O(k(\log\log k)^{2}}\slash .
Edit intent: clarity
Original:  In }  [D. Eppstein, M. Loffler and D, Strash, Listing All Maximal Cliques in Large Sparse Real-World Graphs, JEA (2013 )] , it was proved that the largest possible number of maximal cliques in an n-vertex k-degenerate graph is ( n-k) 3 ^{ k/3%DIFDELCMD < \MBLOCKRIGHTBRACE%%% . Then the authors prove an [  algorithm listing all the maximal cliques of these graphs in optimal time O (k(n-k)3^{k/3}) . In this paper we prove another optimal algorithm ]) and O(k(\log\log k)^{2}}\slash  .
Revised:  In } [D. Eppstein, M. Loffler and D, Strash, Listing All Maximal Cliques in Large Sparse Real-World Graphs, JEA (2013 )] , it was proved that the largest possible number of maximal cliques in an n-vertex k-degenerate graph is ( n-k) 3 ^{ k/3%DIFDELCMD < \MBLOCKRIGHTBRACE%%% . Then the authors prove an [ algorithm listing all the maximal cliques of these graphs in optimal time O (k(n-k)3^{k/3}) . In this paper we prove another optimal algorithm D. Eppstein, M. L\"offler, and D. Strash, Listing all maximal cliques in large sparse real-world graphs, JEA, (2013)]) and O(k(\log\log k)^{2}}\slash .
Edit intent: coherence
Original:  In }  [D. Eppstein, M. Loffler and D, Strash, Listing All Maximal Cliques in Large Sparse Real-World Graphs, JEA (2013 )] , it was proved that the largest possible number of maximal cliques in an n-vertex k-degenerate graph is ( n-k) 3 ^{ k/3%DIFDELCMD < \MBLOCKRIGHTBRACE%%% . Then the authors prove an [  algorithm listing all the maximal cliques of these graphs in optimal time O (k(n-k)3^{k/3}) . In this paper we prove another optimal algorithm ]) and O(k(\log\log k)^{2}}\slash  .
Revised:  In } [D. Eppstein, M. Loffler and D, Strash, Listing All Maximal Cliques in Large Sparse Real-World Graphs, JEA (2013 )] , it was proved that the largest possible number of maximal cliques in an n-vertex k-degenerate graph is ( n-k) 3 ^{ k/3%DIFDELCMD < \MBLOCKRIGHTBRACE%%% . Then the authors prove an [ algorithm listing all the maximal cliques of these graphs in optimal time O (k(n-k)3^{k/3}) . In this paper we prove another optimal algorithm ]) and O(k(\log\log k)^{2}}\slash (\log k)^{3 .
Edit intent: fluency
Original: We study a multiplicative limit order book model for an illiquid  market, where price impact by large orders is multiplicative in relation to the current price, transient over time  , and non-linear in volume (market) impact.
Revised: We study a limit order book model for an illiquid market, where price impact by large orders is multiplicative in relation to the current price, transient over time , and non-linear in volume (market) impact.
Edit intent: fluency
Original: We study a multiplicative limit order book model for an illiquid  market, where price impact by large orders is multiplicative in relation to the current price, transient over time  , and non-linear in volume (market) impact.
Revised: We study a multiplicative limit order book model for an illiquid financial market, where price impact by large orders is multiplicative in relation to the current price, transient over time , and non-linear in volume (market) impact.
Edit intent: clarity