wanyu/IteraTeR_v2 huggingface dataset:
Original:  This allows for a full calculation of the population dynamics of the 24-site FMO trimer for long timescales with very little effort, and we present the first fully converged, exact results for the full 24-site trimer and for the canonical 7-site subsystem of the monomer  .
Revised:  This allows for a full calculation of the population dynamics of the 24-site FMO trimer for long timescales with very little effort, and we present the first fully converged, exact results for the 7-site subsystem of the monomer .
Edit intent: clarity
Original:  This allows for a full calculation of the population dynamics of the 24-site FMO trimer for long timescales with very little effort, and we present the first fully converged, exact results for the full 24-site trimer and for the canonical 7-site subsystem of the monomer  .
Revised:  This allows for a full calculation of the population dynamics of the 24-site FMO trimer for long timescales with very little effort, and we present the first fully converged, exact results for the full 24-site trimer and for the canonical 7-site subsystem of the monomer , and for the full 24-site trimer .
Edit intent: coherence
Original: We study temporal link prediction problem, where , given past interactions, our goal is to predict new interactions.
Revised: We propose a scalable temporal latent space model for link prediction in dynamic social networks, where the goal is to predict new interactions.
Edit intent: clarity
Original:  This method assumes that interactions are more likely between users that are similar to each other in the latent space representation.
Revised:  This method assumes that interactions are more likely to form between similar users in the latent space representation.
Edit intent: clarity
Original:  We propose a global optimization algorithm to effectively learn the temporal latent space with quadratic convergence rate and bounded error.
Revised:  We propose a global optimization algorithm to effectively infer the temporal latent space with quadratic convergence rate and bounded error.
Edit intent: clarity
Original:  We propose a global optimization algorithm to effectively learn the temporal latent space with quadratic convergence rate and bounded error.
Revised:  We propose a global optimization algorithm to effectively learn the temporal latent space , with a quadratic convergence rate and bounded error.
Edit intent: fluency
Original:  We evaluate our model on a number of real-world dynamic networks and demonstrate that our model significantly outperforms existing approaches for temporal link prediction in terms of both scalability and predictive power.
Revised:  We evaluate our model on a number of real-world dynamic networks , significantly outperforms existing approaches for temporal link prediction in terms of both scalability and predictive power.
Edit intent: coherence
Original:  We also often observe some viral videos suddenly become worldwide popular through one night diffusion in OSNs . Do these seemingly different phenomena share common structure?
Revised:  We also often observe some viral videos suddenly become worldwide popular through one night diffusion in online social networks (OSNs) . Do these seemingly different phenomena share common structure?
Edit intent: clarity
Original:  All these phenomena are related to sudden surges of user activities in OSNs , and are referred to as bursts in this work.
Revised:  All these phenomena are related to sudden surges of user activities in networks , and are referred to as bursts in this work.
Edit intent: fluency
Original:  All these phenomena are related to sudden surges of user activities in OSNs , and are referred to as bursts in this work.
Revised:  All these phenomena are related to sudden surges of user activities in OSNs , and are called bursts in this work.
Edit intent: fluency
Original:  To relieve the burden of handling huge activity data generated by OSN users, we then develop a delicately designed sample-estimate solution to estimate triadic cardinality distribution efficiently from sampled data.
Revised:  To relieve the burden of handling massive activity data generated by OSN users, we then develop a delicately designed sample-estimate solution to estimate triadic cardinality distribution efficiently from sampled data.
Edit intent: fluency
Original: In our everyday lives , we often observe abnormally frequent interactions among people before or during some important day , e.g., we receive/send more greetings from/to  friends on Christmas Day  than usual.
Revised: In everyday life , we often observe abnormally frequent interactions among people before or during some important day , e.g., we receive/send more greetings from/to friends on Christmas Day than usual.
Edit intent: clarity
Original: In our everyday lives , we often observe abnormally frequent interactions among people before or during some important day , e.g., we receive/send more greetings from/to  friends on Christmas Day  than usual.
Revised: In our everyday lives , we often observe unusually frequent interactions among people before or during some important day , e.g., we receive/send more greetings from/to friends on Christmas Day than usual.
Edit intent: fluency
Original: In our everyday lives , we often observe abnormally frequent interactions among people before or during some important day , e.g., we receive/send more greetings from/to  friends on Christmas Day  than usual.
Revised: In our everyday lives , we often observe abnormally frequent interactions among people before or during important events , e.g., we receive/send more greetings from/to friends on Christmas Day than usual.
Edit intent: clarity
Original: In our everyday lives , we often observe abnormally frequent interactions among people before or during some important day , e.g., we receive/send more greetings from/to  friends on Christmas Day  than usual.
Revised: In our everyday lives , we often observe abnormally frequent interactions among people before or during some important day , e.g., we receive/send more greetings from/to our friends on Christmas Day than usual.
Edit intent: clarity
Original: In our everyday lives , we often observe abnormally frequent interactions among people before or during some important day , e.g., we receive/send more greetings from/to  friends on Christmas Day  than usual.
Revised: In our everyday lives , we often observe abnormally frequent interactions among people before or during some important day , e.g., we receive/send more greetings from/to friends on Christmas Day , than usual.
Edit intent: fluency
Original:  We also often observe some viral videos suddenly become worldwide popular through one night diffusion in online social networks (OSNs).
Revised:  We also observe that some videos suddenly go viral through people's sharing in online social networks (OSNs).
Edit intent: clarity
Original:  Do these seemingly different phenomena share  common structure?
Revised:  Do these seemingly different phenomena share a common structure?
Edit intent: fluency
Original:  All these phenomena are related to sudden surges of user activities in networks, and are called bursts in this work.
Revised:  All these phenomena are associated with sudden surges of user activities in networks, and are called bursts in this work.
Edit intent: clarity
Original:  All these phenomena are related to sudden surges of user activities in networks, and are called bursts in this work.
Revised:  All these phenomena are related to sudden surges of user activities in networks, which we call "bursts" in this work.
Edit intent: coherence
Original:  We find that the emergence of a burst is accompanied with the formation of new triangles in networks.
Revised:  We find that the emergence of a burst is accompanied with the formation of triangles in networks.
Edit intent: clarity
Original:  This finding provokes a new method for detecting bursts in OSNs.
Revised:  This finding motivates us to propose a new method for detecting bursts in OSNs.
Edit intent: clarity
Original:  This finding provokes a new method for detecting bursts in OSNs.
Revised:  This finding provokes a new method to detect bursts in OSNs.
Edit intent: fluency
Original:  We first introduce a new measure, named triadic cardinality distribution , which measures the fraction of nodes with certain number of triangles, i.e., triadic cardinality, in a network.
Revised:  We first introduce a new measure, " triadic cardinality distribution , which measures the fraction of nodes with certain number of triangles, i.e., triadic cardinality, in a network.
Edit intent: fluency
Original:  We first introduce a new measure, named triadic cardinality distribution , which measures the fraction of nodes with certain number of triangles, i.e., triadic cardinality, in a network.
Revised:  We first introduce a new measure, named triadic cardinality distribution ", corresponding to the fractions of nodes with certain number of triangles, i.e., triadic cardinality, in a network.
Edit intent: clarity
Original:  We first introduce a new measure, named triadic cardinality distribution , which measures the fraction of nodes with certain number of triangles, i.e., triadic cardinality, in a network.
Revised:  We first introduce a new measure, named triadic cardinality distribution , which measures the fraction of nodes with certain number of triangles, i.e., triadic cardinalities, within a network.
Edit intent: clarity
Original:  The distribution will change when burst occurs, and is congenitally immunized against spamming social bots .
Revised:  We demonstrate that this distribution changes when a burst occurs, and is congenitally immunized against spamming social bots .
Edit intent: clarity
Original:  The distribution will change when burst occurs, and is congenitally immunized against spamming social bots .
Revised:  The distribution will change when burst occurs, and is naturally immunized against spamming social bots .
Edit intent: clarity
Original:  The distribution will change when burst occurs, and is congenitally immunized against spamming social bots .
Revised:  The distribution will change when burst occurs, and is congenitally immunized against spamming social-bot attacks .
Edit intent: clarity
Original:  Hence, by tracking triadic cardinality distributions, we are able to detect bursts in OSNs.
Revised:  Hence, by tracking triadic cardinality distributions, we can reliably detect bursts in OSNs.
Edit intent: clarity
Original:  To relieve the burden of handling massive activity data generated by OSN users, we then develop a delicately designed sample-estimate solution to estimate  triadic cardinality distribution efficiently from sampled data.
Revised:  To avoid handling massive activity data generated by OSN users, we then develop a delicately designed sample-estimate solution to estimate triadic cardinality distribution efficiently from sampled data.
Edit intent: clarity
Original:  To relieve the burden of handling massive activity data generated by OSN users, we then develop a delicately designed sample-estimate solution to estimate  triadic cardinality distribution efficiently from sampled data.
Revised:  To relieve the burden of handling massive activity data generated by OSN users, we design an efficient sample-estimate solution to estimate triadic cardinality distribution efficiently from sampled data.
Edit intent: clarity
Original:  To relieve the burden of handling massive activity data generated by OSN users, we then develop a delicately designed sample-estimate solution to estimate  triadic cardinality distribution efficiently from sampled data.
Revised:  To relieve the burden of handling massive activity data generated by OSN users, we then develop a delicately designed sample-estimate solution to estimate the triadic cardinality distribution efficiently from sampled data.
Edit intent: fluency
Original:  To relieve the burden of handling massive activity data generated by OSN users, we then develop a delicately designed sample-estimate solution to estimate  triadic cardinality distribution efficiently from sampled data.
Revised:  To relieve the burden of handling massive activity data generated by OSN users, we then develop a delicately designed sample-estimate solution to estimate triadic cardinality distribution from sampled data.
Edit intent: clarity
Original:  Extensive experiments conducted on real data demonstrate the usefulness of this triadic cardinality distribution and  effectiveness of our sample-estimate solution.
Revised:  Extensive experiments conducted on real data demonstrate the usefulness of this triadic cardinality distribution and the effectiveness of our sample-estimate solution.
Edit intent: fluency
Original:  Moreover, both of the above papers explored and summarized Gh06  in some depth and systematically, promise problems in the context of the theory of the main computational complexity classes as well as in the context of cracking of the public key cryptography.
Revised:  Moreover, both of the above papers explored and summarized Gh06 , in some depth and systematically, promise problems in the context of the theory of the main computational complexity classes as well as in the context of cracking of the public key cryptography.
Edit intent: fluency
Original:  Moreover, both of the above papers explored and summarized Gh06  in some depth and systematically, promise problems in the context of the theory of the main computational complexity classes as well as in the context of cracking of the public key cryptography.
Revised:  Moreover, both of the above papers explored and summarized Gh06 in some depth and systematically, promise problems in the context of the theory of the main computational complexity classes as well as in the context of cracking out the public key cryptography.
Edit intent: fluency
Original:  In the present paper a variety of issues is explored concerning dealing with the promise problems on the level of finite, classical, quantum and also semi-quantum  automata.
Revised:  In the present paper a variety of issues is explored concerning promise problems on the level of finite, classical, quantum and also semi-quantum automata.
Edit intent: clarity
Original:  In the present paper a variety of issues is explored concerning dealing with the promise problems on the level of finite, classical, quantum and also semi-quantum  automata.
Revised:  In the present paper a variety of issues is explored concerning dealing with the promise problems on the level of classical, quantum and also semi-quantum automata.
Edit intent: clarity
Original:  This is also to capture and explore the case that even in the case the promise is simple (say regular), its disjoint subsets  for so called yes and no cases  do not have to be so.
Revised:  This is also to capture and explore the case that even if a promise is simple (say regular), its disjoint subsets for so called yes and no cases do not have to be so.
Edit intent: clarity
Original:  This is also to capture and explore the case that even in the case the promise is simple (say regular), its disjoint subsets  for so called yes and no cases  do not have to be so.
Revised:  This is also to capture and explore the case that even in the case the promise is simple (say regular), its disjoint subsets , for so called yes and no cases do not have to be so.
Edit intent: fluency
Original:  This is also to capture and explore the case that even in the case the promise is simple (say regular), its disjoint subsets  for so called yes and no cases  do not have to be so.
Revised:  This is also to capture and explore the case that even in the case the promise is simple (say regular), its disjoint subsets for so called yes and no cases , do not have to be so.
Edit intent: fluency
Original:  In addition, some results concerning descriptional complexity impacts on outcomes of some operations on promise problems are shown as well as the significant power of quantum versions of classical automata is demonstrated when dealing with some promise problems.
Revised:  In addition, several results concerning descriptional complexity impacts on outcomes of some operations on promise problems are shown as well as the significant power of quantum versions of classical automata is demonstrated when dealing with some promise problems.
Edit intent: style
Original:  In addition, some results concerning descriptional complexity impacts on outcomes of some operations on promise problems are shown as well as the significant power of quantum versions of classical automata is demonstrated when dealing with some promise problems.
Revised:  In addition, some results concerning descriptional complexity impacts on outcomes of some operations on promise problems are shown and the increasing power of quantum versions of classical automata is demonstrated when dealing with some promise problems.
Edit intent: clarity
Original:  In addition, some results concerning descriptional complexity impacts on outcomes of some operations on promise problems are shown as well as the significant power of quantum versions of classical automata is demonstrated when dealing with some promise problems.
Revised:  In addition, some results concerning descriptional complexity impacts on outcomes of some operations on promise problems are shown as well as the significant power of quantum versus classical automata is demonstrated when dealing with some promise problems.
Edit intent: clarity
Original: In pioneering papers \mbox{ ESY84,Gh060pt , the concept of the }%DIFDELCMD < {\em %%% promise problems was introduced and started to be systematically explored  .
Revised: 0pt , the concept of the }%DIFDELCMD < {\em %%% promise problems was introduced and started to be systematically explored .
Edit intent: coherence
Original: In pioneering papers \mbox{ ESY84,Gh060pt , the concept of the }%DIFDELCMD < {\em %%% promise problems was introduced and started to be systematically explored  .
Revised: In pioneering papers \mbox{ ESY84,Gh060pt , the concept of the }%DIFDELCMD < {\em %%% The concept of promise problems was introduced and started to be systematically explored .
Edit intent: fluency
Original:  It has been argued that promise problems should be seen as partial %DIFDELCMD < {\em %%% decision problems and as such that they are more fundamental than decision problems and formal languages that used to be considered as the basic ones for complexity theory issues explorations.
Revised:  It has been argued that promise problems should be seen as partial %DIFDELCMD < {\em %%% decision problems and as such that they are more fundamental than decision problems and formal languages that used to be considered as the basic ones for complexity theory issues explorations.
Edit intent: fluency
Original:  Two acceptance modes ,%DIFDELCMD < {\em %%% recognizability and%DIFDELCMD < {\em %%% solvability are introduced and their basic properties are explored.
Revised:  %DIFDELCMD < {\em %%% recognizability and%DIFDELCMD < {\em %%% solvability are introduced and their basic properties are explored.
Edit intent: clarity
Original:  Two acceptance modes ,%DIFDELCMD < {\em %%% recognizability and%DIFDELCMD < {\em %%% solvability are introduced and their basic properties are explored.
Revised:  Two acceptance modes ,%DIFDELCMD < {\em %%% and%DIFDELCMD < {\em %%% solvability are introduced and their basic properties are explored.
Edit intent: clarity
Original:  Two acceptance modes ,%DIFDELCMD < {\em %%% recognizability and%DIFDELCMD < {\em %%% solvability are introduced and their basic properties are explored.
Revised:  Two acceptance modes ,%DIFDELCMD < {\em %%% recognizability %DIFDELCMD < {\em %%% solvability are introduced and their basic properties are explored.
Edit intent: coherence
Original:  Two acceptance modes ,%DIFDELCMD < {\em %%% recognizability and%DIFDELCMD < {\em %%% solvability are introduced and their basic properties are explored.
Revised:  Two acceptance modes ,%DIFDELCMD < {\em %%% recognizability and%DIFDELCMD < {\em %%% are introduced and their basic properties are explored.
Edit intent: clarity
Original: The design and implementation of static analyzers have becoming increasingly systematic.
Revised: The design and implementation of static analyzers has become increasingly systematic.
Edit intent: fluency
Original:  We solve the problem of systematically constructing static analyzers by introducing Galois transformers: monad transformers that transports Galois connection properties.
Revised:  We solve the problem of systematically constructing static analyzers by introducing Galois transformers: monad transformers that transport Galois connection properties.
Edit intent: fluency
Original:  In concert with a monadic interpreter, we define a library of monad transformers that implement building blocks for classic analysis parameters like context-, path-, and heap- (in- )sensitivity.
Revised:  In concert with a monadic interpreter, we define a library of monad transformers that implement building blocks for classic analysis parameters like context, path, and heap (in )sensitivity.
Edit intent: fluency
Original: The concept of a nested canalizing Boolean function has been studied over the last decade in the context of understanding the regulatory logic of molecular interaction networks, such as gene regulatory networks .
Revised: This paper provides a collection of mathematical and computational tools for the study of robustness in nonlinear gene regulatory networks .
Edit intent: clarity
Original:  However, the underlying mechanism that drives real networks to be navigable is yet unclear .
Revised:  However, the underlying mechanism that drives real networks to be navigable is not yet well understood .
Edit intent: clarity
Original:  Moreover, we prove that the navigable small-world equilibrium tolerates collusions of any size and arbitrary deviations of  large random set of nodes, while non-navigable equilibria do not tolerate small group collusions or random perturbations.
Revised:  Moreover, we prove that the navigable small-world equilibrium tolerates collusions of any size and arbitrary deviations of a large random set of nodes, while non-navigable equilibria do not tolerate small group collusions or random perturbations.
Edit intent: fluency
Original:  Our theoretical and empirical analyses provide important new insight on the connection between , distance, reciprocity, and navigability in social networks.
Revised:  Our theoretical and empirical analyses provide important new insight on the connection between distance, reciprocity, and navigability in social networks.
Edit intent: fluency
Original:  Our empirical evaluation further demonstrates that the system always converges to the navigable network even when limited or no information about other players' strategies is available  .
Revised:  Our empirical evaluation demonstrates that the system always converges to the navigable network even when limited or no information about other players' strategies is available .
Edit intent: clarity
Original:  Our theoretical and empirical analyses provide important new insight on the connection between distance, reciprocity , and navigability in social networks.
Revised:  Our theoretical and empirical analyses provide important new insight on the connection between distance, reciprocity and navigability in social networks.
Edit intent: fluency
Original:  By considering these two and using the Fokker-Plank equation , the probability distribution function and mean number of tumor cell are calculated.
Revised:  The Fokker-Plank equation , the probability distribution function and mean number of tumor cell are calculated.
Edit intent: coherence
Original: Cyclic, non-hierarchical interactions among biological species represent a general mechanism by which ecosystems are able to maintain high levels of biodiversity.
Revised: Cyclic, nonhierarchical interactions among biological species represent a general mechanism by which ecosystems are able to maintain high levels of biodiversity.
Edit intent: fluency