wanyu/IteraTeR_v2 huggingface dataset:
Original:  In addition, we identify features of the pandemic's geographic spread that can only be attributed to changes in the commuter mobility network.
Revised:  In addition, we identify features of the pandemic's geographic spread that we attribute to changes in the commuter mobility network.
Edit intent: clarity
Original: Many real-world dynamical systems can successfully be analyzed using the temporal network formalism.
Revised: Many dynamical systems can successfully be analyzed using the temporal network formalism.
Edit intent: clarity
Original:  Empirical temporal networks and dynamic processes that take place in these situations show heterogeneous, non-Markovian, and intrinsically correlated dynamics, making their analysis particularly challenging.
Revised:  Empirical temporal networks and dynamic processes that take place in these situations show heterogeneous, non-Markovian, and intrinsically correlated topologies and dynamics. This makes their analysis particularly challenging.
Edit intent: clarity
Original:  Randomized reference models (RRMs) for temporal networks constitute a versatile toolbox for studying such systems.
Revised:  Randomized reference models (RRMs) have emerged as a general and versatile toolbox for studying such systems.
Edit intent: clarity
Original:   However, the effects of most randomization procedures on temporal network characteristics remain poorly understood, rendering their use non-trivial and susceptible to misinterpretation.
Revised:  However, the effects of most shuffling procedures on network features remain poorly understood, rendering their use non-trivial and susceptible to misinterpretation.
Edit intent: clarity
Original:  We use this framework to propose a canonical naming convention for existing randomization procedures, classify them, and deduce their effects on a range of important temporal network features.
Revised:  We use this framework to propose a canonical naming convention , classifies them, and deduce their effects on a range of important temporal network features.
Edit intent: clarity
Original:  We use this framework to propose a canonical naming convention for existing randomization procedures, classify them, and deduce their effects on a range of important temporal network features.
Revised:  We use this framework to propose a canonical naming convention for existing randomization procedures, classify them, and deduces their effects on a range of important temporal network features.
Edit intent: fluency
Original:  We use this framework to propose a canonical naming convention for existing randomization procedures, classify them, and deduce their effects on a range of important temporal network features.
Revised:  We use this framework to propose a canonical naming convention for existing randomization procedures, classify them, and deduce their effects on a range of important network features.
Edit intent: clarity
Original:  We furthermore show that certain classes of compatible MRRMs may be applied in sequential composition to generate more than a hundred new MRRMs from  existing ones surveyed in this article.
Revised:  We furthermore show that certain classes of compatible MRRMs may be applied in sequential composition to generate over a hundred new MRRMs from existing ones surveyed in this article.
Edit intent: fluency
Original:  We furthermore show that certain classes of compatible MRRMs may be applied in sequential composition to generate more than a hundred new MRRMs from  existing ones surveyed in this article.
Revised:  We furthermore show that certain classes of compatible MRRMs may be applied in sequential composition to generate more than a hundred new MRRMs from the existing ones surveyed in this article.
Edit intent: fluency
Original:  We furthermore show that certain classes of compatible MRRMs may be applied in sequential composition to generate over a hundred new MRRMs from the existing ones surveyed in this article.
Revised:  We furthermore show that certain classes of compatible MRRMs may be applied in sequential composition to generate new MRRMs from the existing ones surveyed in this article.
Edit intent: clarity
Original:  We provide two tutorials showing applications of the MRRM framework to empirical temporal networks: 1) to analyze how different features of a network affect other features and 2) to analyze how such features affect a dynamic process in the network.
Revised:  We provide two tutorials showing applications of the MRRM framework to empirical temporal networks: 1) to analyze how different network features affect a dynamic process in the network.
Edit intent: clarity
Original:  Here we derive the addition to the minimal heat flow out of a system that implements a desired computation using a given circuit rather than using an idealized system that has no constraints.
Revised:  Here we derive the addition to the minimal heat , we first decompose the heat generated by any physical process that implements a desired computation using a given circuit rather than using an idealized system that has no constraints.
Edit intent: clarity
Original:  We call this " circuit mismatch loss " . It is the extra heat that is dissipated when a physical circuit that is designed to dissipate least heat when it is run with a distribution q over its inputs, is instead run with a distribution p%DIFDELCMD < \ne %%% q over its inputs.
Revised:  We call this " circuit mismatch loss " . It is the extra heat that is dissipated when a physical circuit that %DIFDELCMD < \ne %%% q over its inputs.
Edit intent: clarity
Original: Circuit mismatch loss can be either positiveor negative .
Revised: Circuit mismatch loss can be either positive .
Edit intent: clarity
Original: Real-world digital computers implement computations using circuits, as do many naturally occurring systems (e.g., gene regulatory networks).
Revised: Digital computers implement computations using circuits, as do many naturally occurring systems (e.g., gene regulatory networks).
Edit intent: clarity
Original:  The topology of any such circuit restricts which degrees of freedom may be physically coupled during the operation of the circuit.
Revised:  The topology of any such circuit restricts which variables may be physically coupled during the operation of the circuit.
Edit intent: clarity
Original:  First, we calculate the additional entropy production that arises due to the restriction that the physical process implementing any gate in a circuit is not coupled to any degrees of freedom in the rest of the circuit unless they feed in or out of that gate.
Revised:  First, we calculate the additional entropy production that arises due to the restriction that the physical process implementing that gate can only be coupled to variables in the rest of the circuit unless they feed in or out of that gate.
Edit intent: clarity
Original:  First, we calculate the additional entropy production that arises due to the restriction that the physical process implementing any gate in a circuit is not coupled to any degrees of freedom in the rest of the circuit unless they feed in or out of that gate.
Revised:  First, we calculate the additional entropy production that arises due to the restriction that the physical process implementing any gate in a circuit is not coupled to any degrees of freedom in the rest of the circuit that feed in or out of that gate.
Edit intent: clarity
Original:  We then build on this calculation  to analyze how the thermodynamic costs of implementing a computation with a full circuit, comprising multiple connected gates, depends on the topology of that circuit.
Revised:  We then build on this calculation , to analyze how the thermodynamic costs of implementing a computation with a full circuit, comprising multiple connected gates, depends on the topology of that circuit.
Edit intent: fluency
Original:  The topology of any such circuit restricts which variables may be physically coupled during the operation of a system implementing a circuit.
Revised:  The topology of any such circuit restricts which variables may be physically coupled during the operation of a circuit.
Edit intent: clarity
Original:  We investigate how such restrictions on the physical coupling affects the thermodynamic costs of  the circuit.
Revised:  We investigate how such restrictions on the physical coupling affects the thermodynamic costs of running the circuit.
Edit intent: clarity
Original:  To do this we first calculate the minimal additional entropy production that arises when we run a given gate in a circuit , if the physical process implementing that gate can only be coupled to variables in the rest of the circuit that feed in or out of that gate .
Revised:  To do this we first calculate the minimal additional entropy production that arises when we run a given gate in a circuit .
Edit intent: clarity
Original:  Our analysis improves cost estimates compared to multi-level algorithms for similar problems and mathematically underpins the outstanding practical performance of multi-index algorithms for partial differential equations with random coefficients.
Revised:  Our analysis improves cost estimates compared to multi-level algorithms for similar problems and mathematically underpins the superior practical performance of multi-index algorithms for partial differential equations with random coefficients.
Edit intent: clarity
Original: We study general Delaunay-graphs, which are a natural generalizations of Delaunay triangulations to arbitrary families  .
Revised: We study general Delaunay-graphs, which are natural generalizations of Delaunay triangulations to arbitrary families .
Edit intent: fluency
Original:  We find that strongly synchronized population spiking events lead to complete cessation of activity in excitatory networks, but not in gap-junction or inhibitory networks.
Revised:  We find that strongly synchronized population spiking events lead to complete cessation of activity in excitatory networks, but not in gap junction or inhibitory networks.
Edit intent: fluency
Original:  We identify the underlying mechanism responsible for this phenomenon by examining the particular shape of the excitatory post-synaptic currents that arise in the neurons.
Revised:  We identify the underlying mechanism responsible for this phenomenon by examining the particular shape of the excitatory postsynaptic currents that arise in the neurons.
Edit intent: fluency
Original:  However, higher order vertices or multicellular rosettes exist prevalently in developmental and {\it in vitro} processes and have been recognized as crucial in many important aspects of development , disease, and physiology.
Revised:  However, higher order vertices or multicellular rosettes are prevalent in developmental and {\it in vitro} processes and have been recognized as crucial in many important aspects of development , disease, and physiology.
Edit intent: clarity
Original:  However, higher order vertices or multicellular rosettes exist prevalently in developmental and {\it in vitro} processes and have been recognized as crucial in many important aspects of development , disease, and physiology.
Revised:  However, higher order vertices or multicellular rosettes exist prevalently in developmental and {\it in vitro} processes and have been recognized as crucial in many important aspects of morphogenesis , disease, and physiology.
Edit intent: clarity
Original:  This phase transition exhibits several hallmarks of a second-order phase transition such as a growing correlation length and a universal critical scaling in the vicinity a critical point.
Revised:  This transition exhibits several hallmarks of a second-order phase transition such as a growing correlation length and a universal critical scaling in the vicinity a critical point.
Edit intent: fluency
Original:  Further, we elucidate the nature of rigidity transitions in dense tissues using a generalized Maxwell constraint counting to answer a long-standing puzzle of the origin of solidity in the vertex model .
Revised:  Further, we elucidate the nature of rigidity transitions in dense tissues using a generalized Maxwell constraint counting approach. This answers a long-standing puzzle of the origin of solidity in the vertex model .
Edit intent: clarity
Original:  Further, we elucidate the nature of rigidity transitions in dense tissues using a generalized Maxwell constraint counting to answer a long-standing puzzle of the origin of solidity in the vertex model .
Revised:  Further, we elucidate the nature of rigidity transitions in dense tissues using a generalized Maxwell constraint counting to answer a long-standing puzzle of the origin of solidity in these systems .
Edit intent: clarity
Original: In this work, we present a novel , data-based approach to turbulence modelling for Large Eddy Simulation  .
Revised: In this work, we present a novel data-based approach to turbulence modelling for Large Eddy Simulation .
Edit intent: fluency
Original:  The Beck-Fiala conjecture suggests that the right bound is O(t), but for three decades the only known bound not depending on the size of  set system has been O(t).
Revised:  The Beck-Fiala conjecture suggests that the right bound is O(t), but for three decades the only known bound not depending on the size of the set system has been O(t).
Edit intent: fluency
Original: Fog radio access network ( F-RAN ) has been recently proposed to satisfy the low-latency communication requirements of Internet of Things (IoT) applications.
Revised: In light of the quick proliferation of Internet of things (IoT) devices and applications, fog radio access network ( F-RAN ) has been recently proposed to satisfy the low-latency communication requirements of Internet of Things (IoT) applications.
Edit intent: clarity
Original: Fog radio access network ( F-RAN ) has been recently proposed to satisfy the low-latency communication requirements of Internet of Things (IoT) applications.
Revised: Fog radio access network ( Fog-RAN ) has been recently proposed to satisfy the low-latency communication requirements of Internet of Things (IoT) applications.
Edit intent: fluency
Original:  We consider the problem of sequentially allocating the limited resources of a fog node to a heterogeneous population of IoT applications with varying latency requirements.
Revised:  We consider the problem of sequentially allocating the FN's limited resources to the IoT applications of heterogeneous latency requirements.
Edit intent: clarity
Original:  Specifically, for each service request it receives in time, fog node needs to decide whether to serve that user locally to provide it with low-latency communication service or to refer it to the cloud control center to keep valuable fog resources available for future users with potentially higher utility to the system (i.e., lower latency requirement).
Revised:  For each access request from an IoT user, the FN needs to decide whether to serve that user locally to provide it with low-latency communication service or to refer it to the cloud control center to keep valuable fog resources available for future users with potentially higher utility to the system (i.e., lower latency requirement).
Edit intent: clarity
Original:  Specifically, for each service request it receives in time, fog node needs to decide whether to serve that user locally to provide it with low-latency communication service or to refer it to the cloud control center to keep valuable fog resources available for future users with potentially higher utility to the system (i.e., lower latency requirement).
Revised:  Specifically, for each service request it receives in time, fog node needs to decide whether to serve that user locally to provide it with low-latency communication service or to refer it to the cloud to conserve its valuable resources for future users with potentially higher utility to the system (i.e., lower latency requirement).
Edit intent: clarity
Original:  Specifically, for each service request it receives in time, fog node needs to decide whether to serve that user locally to provide it with low-latency communication service or to refer it to the cloud control center to keep valuable fog resources available for future users with potentially higher utility to the system (i.e., lower latency requirement).
Revised:  Specifically, for each service request it receives in time, fog node needs to decide whether to serve that user locally to provide it with low-latency communication service or to refer it to the cloud control center to keep valuable fog resources available for future users of potentially higher utility to the system (i.e., lower latency requirement).
Edit intent: clarity
Original: We here describe and present results of a simple neutral network that predicts individual researchers' future citation counts based on a variety of data from the researchers' past.
Revised: We here describe and present results of a simple neural network that predicts individual researchers' future citation counts based on a variety of data from the researchers' past.
Edit intent: clarity
Original: Human relations are driven by social events - people interact, exchange information, share knowledge and emotions, or gather news from mass media.
Revised: Human relations are driven by social events-people interact, exchange information, share knowledge and emotions, or gather news from mass media.
Edit intent: fluency
Original: Human relations are driven by social events - people interact, exchange information, share knowledge and emotions, or gather news from mass media.
Revised: Human relations are driven by social events - people interact, exchange information, share knowledge and emotions, and gather news from mass media.
Edit intent: coherence
Original:  Here, we introduce a novel Cognition-driven Social Network (CogSNet) model that accounts for cognitive aspects of social perception and explicitly represents human memory dynamics.
Revised:  Here, we introduce a novel cognition-driven social network (CogSNet) model that accounts for cognitive aspects of social perception and explicitly represents human memory dynamics.
Edit intent: fluency
Original:  The results show that CogSNet significantly improves  quality of modeling of human interactions in social networks.
Revised:  The results show that CogSNet significantly improves the quality of modeling of human interactions in social networks.
Edit intent: fluency
Original: We define a  class of models representing natural selection on a single biallelic locus in a population with arbitrary---but fixed---spatial and genetic structure . Biological events (e.g.  births, deaths, mating, dispersal) may depend in an arbitrarily complex way on the current population state.
Revised: We define a class of models representing natural selection on a single biallelic locus in a population with arbitrary---but fixed---spatial and genetic structure . Biological events (e.g. ~ births, deaths, mating, dispersal) may depend in an arbitrarily complex way on the current population state.
Edit intent: fluency
Original: We define a  class of models representing natural selection on a single biallelic locus in a population with arbitrary---but fixed---spatial and genetic structure . Biological events (e.g.  births, deaths, mating, dispersal) may depend in an arbitrarily complex way on the current population state.
Revised: We define a class of models representing natural selection on a single biallelic locus in a population with arbitrary---but fixed---spatial and genetic structure . Biological events (e.g. births, deaths, mating, dispersal) depend in arbitrary fashion on the current population state.
Edit intent: clarity
Original:  Genetics may be haploid, diploid, haplodiploid, or polyploid.
Edit intent: coherence
Original:  Selection occurs via replacement events, in which some alleles are replaced by copies of others.
Revised:  Selection occurs via replacement events, in which alleles in some sites are replaced by copies of others.
Edit intent: clarity
Original:  Within this formalism, we  identify four criteria for determining if an allele is selected , and show that these become equivalent in the limit of low mutation.
Revised:  Within this formalism, we identify four criteria for evaluating which allele is selected , and show that these become equivalent in the limit of low mutation.
Edit intent: clarity
Original:  Within this formalism, we  identify four criteria for determining if an allele is selected , and show that these become equivalent in the limit of low mutation.
Revised:  Within this formalism, we identify four criteria for determining if an allele is selected and show that these become equivalent in the limit of low mutation.
Edit intent: fluency
Original: We consider the action of a linear subspace U of \{0,1\}^n on the set of AC^0 formulas with inputs labeled by literals in  \{X_1,\overline X_1,\dots,X_n,\overline X_n\}, where an element u \in U acts by toggling negations on literals with indices i  such that u_i=1.
Revised: We consider the action of a linear subspace U of \{0,1\}^n on the set of AC^0 formulas with inputs labeled by literals in the set \{X_1,\overline X_1,\dots,X_n,\overline X_n\}, where an element u \in U acts by toggling negations on literals with indices i such that u_i=1.
Edit intent: fluency
Original: We consider the action of a linear subspace U of \{0,1\}^n on the set of AC^0 formulas with inputs labeled by literals in  \{X_1,\overline X_1,\dots,X_n,\overline X_n\}, where an element u \in U acts by toggling negations on literals with indices i  such that u_i=1.
Revised: We consider the action of a linear subspace U of \{0,1\}^n on the set of AC^0 formulas with inputs labeled by literals in \{X_1,\overline X_1,\dots,X_n,\overline X_n\}, where an element u \in U acts by toggling negations on literals with indices i n such that u_i=1.
Edit intent: fluency
Original:  For example, the smallest known construction of depth d+1 formulas computing \mathrm{PARITY of size O( n2^{dn^{1/d } P-invariant where P is the subspace of even-weight elements of \{0,1\}^n.
Revised:  For example, the smallest known construction of depth d+1 formulas computing \mathrm{PARITY of size O( n } P-invariant where P is the subspace of even-weight elements of \{0,1\}^n.
Edit intent: clarity
Original:  In this paper , we show a nearly matching 2^{d(n^{1/d}-1)} lower bound on the P-invariant depth d+1 formula size of \mathrm{PARITY Quantitatively this improves the best known \Omega(2^{1{84}d(n^{1/d}-1)}) lower bound for unrestricted depth d+1 formulas .)
Revised:  In this paper we establish a nearly matching 2^{d(n^{1/d}-1)} lower bound on the P-invariant depth d+1 formula size of \mathrm{PARITY Quantitatively this improves the best known \Omega(2^{1{84}d(n^{1/d}-1)}) lower bound for unrestricted depth d+1 formulas .)
Edit intent: clarity
Original:  In this paper , we show a nearly matching 2^{d(n^{1/d}-1)} lower bound on the P-invariant depth d+1 formula size of \mathrm{PARITY Quantitatively this improves the best known \Omega(2^{1{84}d(n^{1/d}-1)}) lower bound for unrestricted depth d+1 formulas .)
Revised:  In this paper , we show a nearly matching 2^{d(n^{1/d}-1)} lower bound on the P-invariant depth d+1 formula size of PARITY. Quantitatively this improves the best known \Omega(2^{1{84}d(n^{1/d}-1)}) lower bound for unrestricted depth d+1 formulas .)
Edit intent: coherence
Original:  Quantitatively this improves the best known \Omega(2^{1{84}d(n^{1/d}-1)}) lower bound for unrestricted {\em  depth d+1 formulas, while avoiding the use of the switching lemma.
Revised:  Quantitatively this improves the best known \Omega(2^{1{84}d(n^{1/d}-1)}) lower bound for {\em depth d+1 formulas, while avoiding the use of the switching lemma.
Edit intent: clarity
Original:  Quantitatively this improves the best known \Omega(2^{1{84}d(n^{1/d}-1)}) lower bound for unrestricted {\em  depth d+1 formulas, while avoiding the use of the switching lemma.
Revised:  Quantitatively this improves the best known \Omega(2^{1{84}d(n^{1/d}-1)}) lower bound for unrestricted {\em unrestricted depth d+1 formulas, while avoiding the use of the switching lemma.
Edit intent: fluency