wanyu/IteraTeR_v2 huggingface dataset:
Original:  Morone and Makse proposed an algorithm employing the non-backtracking matrix of given networks, which outperforms various existing algorithms with a reasonable computational cost .
Revised:  Morone and Makse proposed an algorithm employing the non-backtracking matrix of given networks, which outperforms various existing algorithms .
Edit intent: clarity
Original:  In contrast to this approach, we adapt to the temporal setting the Bron-Kerbosch algorithm - an efficient, recursive backtracking algorithm which enumerates all maximal cliques in static graphs  .
Revised:  In contrast to this approach, we adapt the Bron-Kerbosch algorithm - an efficient, recursive backtracking algorithm which enumerates all maximal cliques in static graphs .
Edit intent: clarity
Original:  The latter culminates in a significant improvement for most interesting delta-values concerning running time in comparison with the algorithm of Viard, Latapy, and Magnien (typically two orders of magnitude) .
Revised:  The latter culminates in an improvement for most interesting delta-values concerning running time in comparison with the algorithm of Viard, Latapy, and Magnien (typically two orders of magnitude) .
Edit intent: clarity
Original:  The latter culminates in a significant improvement for most interesting delta-values concerning running time in comparison with the algorithm of Viard, Latapy, and Magnien (typically two orders of magnitude) .
Revised:  The latter culminates in a significant improvement for most interesting delte-values concerning running time in comparison with the algorithm of Viard, Latapy, and Magnien (typically two orders of magnitude) .
Edit intent: fluency
Original:  The latter culminates in a significant improvement for most interesting delta-values concerning running time in comparison with the algorithm of Viard, Latapy, and Magnien (typically two orders of magnitude) .
Revised:  The latter culminates in a significant improvement for most interesting delta-values concerning running time in comparison with the algorithm of Viard, Latapy, and Magnien .
Edit intent: clarity
Original:  Existing active topology discovery techniques and production systems require significant probing time -- time during which the underlying network may change or experience short-lived dynamics.
Revised:  Existing active topology discovery techniques and systems require significant probing time -- time during which the underlying network may change or experience short-lived dynamics.
Edit intent: clarity
Original:  We compare Yarrp 's topological recall and discovery rate against existing systems, and present some of the first results of topological dynamics exposed via the high sampling rates Yarrp enables.
Revised:  We compare Yarrp against existing systems, and present some of the first results of topological dynamics exposed via the high sampling rates Yarrp enables.
Edit intent: clarity
Original:  We compare Yarrp 's topological recall and discovery rate against existing systems, and present some of the first results of topological dynamics exposed via the high sampling rates Yarrp enables.
Revised:  We compare Yarrp 's topological recall and discovery rate against existing systems, and present examples of topological dynamics exposed via the high sampling rates Yarrp enables.
Edit intent: clarity
Original:  We propose and investigate the use of a dynamic version of the degree corrected stochastic block model (DCSBM) as a means to model and monitor dynamic networks that undergo a significant structural change.
Revised:  We propose and investigate the use of a dynamic version of the degree corrected stochastic block model (DCSBM) to model and monitor dynamic networks that undergo a significant structural change.
Edit intent: clarity
Original: Using a simple monitoring strategy on the DCSBM, we are able to detect significant changes in the U.S. Senate co-voting network that reflects both times of cohesion and times of polarization among Republican and Democratic members.
Revised: Using a simple monitoring strategy on the DCSBM, we are able to detect significant changes in the network that reflect both times of cohesion and times of polarization among Republican and Democratic members.
Edit intent: clarity
Original: Maxwell's equations are considered with transparent boundary conditions, with initial conditions and inhomogeneity having support in a bounded, not necessarily convex three-dimensional domain or in a collection of such domains.
Revised: Maxwell's equations are considered with transparent boundary conditions, for initial conditions and inhomogeneity having support in a bounded, not necessarily convex three-dimensional domain or in a collection of such domains.
Edit intent: coherence
Original:  The proposed computational scheme only involves the interior domain and its boundary.
Revised:  The numerical method only involves the interior domain and its boundary.
Edit intent: clarity
Original:  The existence of such a reduction for extractors is a long-standing open question ;
Revised:  The existence of such a reduction for extractors is a long-standing open question ,
Edit intent: fluency
Original:  How this type of intrinsically generated fluctuations appears in more realistic networks of spiking neurons has been a long standing question.
Revised:  How this type of intrinsi- cally generated fluctuations appears in more realistic networks of spiking neurons has been a long standing question.
Edit intent: fluency
Original:  The comparison between rate and spiking networks has in particular been hampered by the fact that most previous studies on randomly connected rate networks focused on highly simplified models, in which excitation and inhibition were not segregated and firing rates fluctuated symmetrically around zero because of built-in symmetries.
Edit intent: coherence
Original:  To ease the comparison between rate and spiking networks, we investigate the dynamical regimes of sparse, randomly-connected rate networks with segregated excitatory and inhibitory populations, and firing rates constrained to be positive.
Revised:  To ease the comparison between rate and spiking networks, recent works investigated the dynami- cal regimes of randomly-connected rate networks with segregated excitatory and inhibitory populations, and firing rates constrained to be positive.
Edit intent: clarity
Original:  We moreover found that excitatory-inhibitory networksdevelop two different fluctuating regimes: for moderate synaptic coupling, recurrent inhibition is sufficient to stabilize fluctuations;
Revised:  We moreover found that excitatory-inhibitory networksdevelop two different fluctuating regimes: for moderate overall coupling, recurrent inhibition is sufficient to stabilize fluctuations;
Edit intent: clarity
Original:  Excitation moreover induces two different fluctuating regimes: for moderate overall coupling, recurrent inhibition is sufficient to stabilize fluctuations ;
Revised:  Excitation moreover induces two different fluctuating regimes: for moderate overall coupling, recurrent inhibition is sufficient to stabilize fluctuations ,
Edit intent: fluency
Original:  We first crawl the service  to understand its usage patterns and then perform an in-depth analysis of its salient features.
Revised:  We first crawl the service in order to understand its usage patterns and then perform an in-depth analysis of its salient features.
Edit intent: coherence
Original:  In particular , we study the protocols and adaptation strategies involved , the typical quality of experience indicators, such as playback smoothness and latency, video quality, and their influencing factors.
Revised:  In particular , we study the protocols used , the typical quality of experience indicators, such as playback smoothness and latency, video quality, and their influencing factors.
Edit intent: clarity
Original:  Hence, the proposed approach can detect the noisy elements if the measurements are contaminated with additive white Gaussian noise plus sparse noise with large magnitude , which could be caused by data injection attacks .
Revised:  Hence, the proposed approach can detect the noisy elements if the measurements are contaminated with additive white Gaussian noise plus sparse noise with large magnitude .
Edit intent: coherence
Original:  When we apply the resident-proposing differed acceptance algorithm of Gale and Shapley to I, the algorithm produces a set of tentative matches (resident-hospital pairs).
Revised:  When we apply the resident-proposing deferred acceptance algorithm of Gale and Shapley to I, the algorithm produces a set of tentative matches (resident-hospital pairs).
Edit intent: fluency
Original: Usually a customer make the decision to buy a product if she/he is cumulatively impacted by  enough pieces of information for the product .
Revised: Usually a customer make the decision to buy a product if she/he is cumulatively impacted by receiving enough pieces of information for the product .
Edit intent: clarity
Original: Usually a customer make the decision to buy a product if she/he is cumulatively impacted by  enough pieces of information for the product .
Revised: Usually a customer make the decision to buy a product if she/he is cumulatively impacted by enough pieces of information propagated to her before she makes the final purchase decision .
Edit intent: clarity
Original:  Two optimization problems are investigated under this framework: seed minimization with cumulative activation (SM-CA) problem , which asks how to select a seed set with minimum size such that the number of cumulatively active nodes can reach a given threshold ;
Revised:  Two optimization problems are investigated under this framework: seed minimization with cumulative activation (SM-CA) , which asks how to select a seed set with minimum size such that the number of cumulatively active nodes can reach a given threshold ;
Edit intent: clarity
Original:  Two optimization problems are investigated under this framework: seed minimization with cumulative activation (SM-CA) problem , which asks how to select a seed set with minimum size such that the number of cumulatively active nodes can reach a given threshold ;
Revised:  Two optimization problems are investigated under this framework: seed minimization with cumulative activation (SM-CA) problem , which asks how to select a seed set with minimum size such that the number of cumulatively active nodes reaches a given requirement \eta ;
Edit intent: clarity
Original:  influence maximization with cumulative activation (IM-CA) problem , which asks how to choose a seed set with a fixed budget to maximize the number of cumulatively active nodes.
Revised:  influence maximization with cumulative activation (IM-CA) , which asks how to choose a seed set with a fixed budget to maximize the number of cumulatively active nodes.
Edit intent: clarity
Original:  influence maximization with cumulative activation (IM-CA) problem , which asks how to choose a seed set with a fixed budget to maximize the number of cumulatively active nodes.
Revised:  influence maximization with cumulative activation (IM-CA) problem , which asks how to choose a seed set with fixed budget to maximize the number of cumulatively active nodes.
Edit intent: fluency
Original:  For SM-CA problem, we design a greedy algorithm which yields a bicriteria O(\ln n)-approximation when \eta=n, here \eta is the given threshold and n is the number of nodes in the network.
Revised:  For SM-CA problem, we design a greedy algorithm that yields a bicriteria O(\ln n)-approximation when \eta=n, here \eta is the given threshold and n is the number of nodes in the network.
Edit intent: fluency
Original:  For SM-CA problem, we design a greedy algorithm which yields a bicriteria O(\ln n)-approximation when \eta=n, here \eta is the given threshold and n is the number of nodes in the network.
Revised:  For SM-CA problem, we design a greedy algorithm which yields a bicriteria O(\ln n)-approximation when \eta=n, where n is the number of nodes in the network.
Edit intent: clarity
Original:  What's more, we provide }  two efficient heuristic algorithms for SM-CA and IM-CA respectively . Experiments results on different real-world social networks show that our heuristic algorithms outperform many previous algorithms.
Revised:  What's more, we provide } two efficient heuristic algorithms for SM-CA and IM-CA respectively . Experiments results on different real-world social networks show that our algorithms significantly outperform baseline algorithms.
Edit intent: clarity
Original:  They can emulate context-free grammars, regular tree grammars, and synchronous grammars, allowing  to work with all these generating systems in a unified way.
Revised:  They can emulate context-free grammars, regular tree grammars, and synchronous grammars, allowing us to work with all these generating systems in a unified way.
Edit intent: fluency
Original:  The theory of bud generating systems presented here heavily uses the one of colored operads.
Revised:  The theory of bud generating systems uses colored operads.
Edit intent: clarity
Original:  Moreover, with the aim to compute the generating series of the languages of bud generating systems, we introduce formal power series on colored operads and several operations on these : a pre-Lie product, an associative product, and two analogues of the Kleene star operation .
Revised:  To compute the generating series of the languages of bud generating systems, we introduce formal power series on colored operads and several operations on these : a pre-Lie product, an associative product, and two analogues of the Kleene star operation .
Edit intent: coherence
Original:  Moreover, with the aim to compute the generating series of the languages of bud generating systems, we introduce formal power series on colored operads and several operations on these : a pre-Lie product, an associative product, and two analogues of the Kleene star operation .
Revised:  Moreover, with the aim to compute the generating series of the languages of bud generating systems, we introduce formal power series on colored operads and several operations on these .
Edit intent: clarity
Original:  Series on colored operads intervene to express in several ways the languages specified by bud generating systems and allow  to enumerate combinatorial objects with respect to some statistics.
Revised:  Series on colored operads are crucial to express the languages specified by bud generating systems and allow to enumerate combinatorial objects with respect to some statistics.
Edit intent: clarity
Original:  Series on colored operads intervene to express in several ways the languages specified by bud generating systems and allow  to enumerate combinatorial objects with respect to some statistics.
Revised:  Series on colored operads intervene to express in several ways the languages specified by bud generating systems and allow us to enumerate combinatorial objects with respect to some statistics.
Edit intent: fluency
Original:  Some examples of bud generating systems are constructed , in particular to specify some sorts of balanced trees and specific intervals in the Tamari lattices, and obtain recursive formulae enumerating these.
Revised:  Some examples of bud generating systems are constructed ; in particular to specify some sorts of balanced trees and specific intervals in the Tamari lattices, and obtain recursive formulae enumerating these.
Edit intent: fluency
Original:  Some examples of bud generating systems are constructed , in particular to specify some sorts of balanced trees and specific intervals in the Tamari lattices, and obtain recursive formulae enumerating these.
Revised:  Some examples of bud generating systems are constructed , in particular to specify some sorts of balanced trees and to obtain recursive formulas enumerating these.
Edit intent: clarity
Original:  This bound is best possible and improves a recent bound of 19{100 . Connectivity is essential: If G is not connected then only a bound of 1{5}m can be guaranteed.
Revised:  This bound is best possible . Connectivity is essential: If G is not connected then only a bound of 1{5}m can be guaranteed.
Edit intent: coherence
Original:  Images in the semantic space have reduced semantic gap and thus they are likely to give better annotation performance.
Edit intent: coherence
Original:  We evaluate our framework on four popular datasets.
Revised:  We report extensive results on four popular datasets.
Edit intent: clarity
Original:  Our results show that our KCCA-based approach can be applied to several state-of-the-art label transfer methods to obtain significant improvements .
Revised:  Our results show that our KCCA-based framework can be applied to several state-of-the-art label transfer methods to obtain significant improvements .
Edit intent: clarity
Original: The function sep(w,x) is defined as the size of the smallest deterministic finite automaton that accepts w and rejects x.
Revised: A deterministic finite automaton that accepts w and rejects x.
Edit intent: clarity
Original:  combining photon and cosmic ray effects, we find that a supernova at 100 pc can have only a small effect on terrestrial organisms from visible light , but tropospheric ionization due to the penetration of \geq TeV \geqTeV cosmic rays will increase by nearly an order of magnitude for thousands of years, and irradiation by muons on the ground and in the upper ocean will increase 20-fold, which will approximately triple the overall radiation load on terrestrial organisms.
Revised:  combining photon and cosmic ray effects, we find that a supernova at 100 pc can have only a small effect on terrestrial organisms from visible light , but tropospheric ionization due to the penetration of \geqTeV cosmic rays will increase by nearly an order of magnitude for thousands of years, and irradiation by muons on the ground and in the upper ocean will increase 20-fold, which will approximately triple the overall radiation load on terrestrial organisms.
Edit intent: fluency
Original:  These effects make possible changes in climate and increased cancer and mutation rates.
Revised:  Such irradiation has been linked to possible changes in climate and increased cancer and mutation rates.
Edit intent: clarity
Original:  Further research on the effects of these changes is needed.
Revised:  Further research on the effects is needed.
Edit intent: clarity
Original:  Numerical simulations of the Langevin model indicate positive correlations between the Gini index and the total wealth, that suggests a growing inequality with increasing income.
Revised:  Numerical simulations of the resulting model indicate positive correlations between the Gini index and the total wealth, that suggests a growing inequality with increasing income.
Edit intent: clarity
Original:  Complementary analysis shows a simultaneous decrease in inequality as social mobility increases in presence of a conserved total wealth, in conformity with economic expectations .
Revised:  Further analysis shows a simultaneous decrease in inequality as social mobility increases in presence of a conserved total wealth, in conformity with economic expectations .
Edit intent: clarity
Original:  Complementary analysis shows a simultaneous decrease in inequality as social mobility increases in presence of a conserved total wealth, in conformity with economic expectations .
Revised:  Complementary analysis shows a simultaneous decrease in inequality as social mobility increases in presence of a conserved total wealth, in conformity with economic data .
Edit intent: clarity
Original: Many hierarchically modular systems are structured in a way that resembles a bow-tie or hourglass.
Revised: Many hierarchically modular systems are structured in a way that resembles an hourglass.
Edit intent: clarity
Original:  This "hourglass effect" means that the system generates many outputs from many inputs through a relatively small number of intermediate modules that are critical for the operation of the entire system ( the waist of the hourglass ) . We investigate the hourglass effect in general ( not necessarily layered ) hierarchical dependency networks.
Revised:  This "hourglass effect" means that the system generates many outputs from many inputs through a relatively small number of intermediate modules that are critical for the operation of the entire system , referred to as the waist of the hourglass ) . We investigate the hourglass effect in general ( not necessarily layered ) hierarchical dependency networks.
Edit intent: clarity
Original:  This "hourglass effect" means that the system generates many outputs from many inputs through a relatively small number of intermediate modules that are critical for the operation of the entire system ( the waist of the hourglass ) . We investigate the hourglass effect in general ( not necessarily layered ) hierarchical dependency networks.
Revised:  This "hourglass effect" means that the system generates many outputs from many inputs through a relatively small number of intermediate modules that are critical for the operation of the entire system ( the waist of the hourglass . We investigate the hourglass effect in general ( not necessarily layered ) hierarchical dependency networks.
Edit intent: fluency
Original:  This "hourglass effect" means that the system generates many outputs from many inputs through a relatively small number of intermediate modules that are critical for the operation of the entire system ( the waist of the hourglass ) . We investigate the hourglass effect in general ( not necessarily layered ) hierarchical dependency networks.
Revised:  This "hourglass effect" means that the system generates many outputs from many inputs through a relatively small number of intermediate modules that are critical for the operation of the entire system ( the waist of the hourglass ) . We investigate the hourglass effect in general , not necessarily layered ) hierarchical dependency networks.
Edit intent: fluency
Original:  This "hourglass effect" means that the system generates many outputs from many inputs through a relatively small number of intermediate modules that are critical for the operation of the entire system ( the waist of the hourglass ) . We investigate the hourglass effect in general ( not necessarily layered ) hierarchical dependency networks.
Revised:  This "hourglass effect" means that the system generates many outputs from many inputs through a relatively small number of intermediate modules that are critical for the operation of the entire system ( the waist of the hourglass ) . We investigate the hourglass effect in general ( not necessarily layered , hierarchical dependency networks.
Edit intent: fluency
Original:  As a possible explanation for the hourglass effect, we propose the Reuse Preference (RP) model that captures the bias of new modules for reusing intermediate modules of high complexity instead of connecting directly to sources  .
Revised:  As a possible explanation for the hourglass effect, we propose the Reuse Preference (RP) model that captures the bias of new modules to reuse intermediate modules of high complexity instead of connecting directly to sources .
Edit intent: fluency
Original: Adblocking tools  continue to rise in popularity, altering the dynamics of advertising revenue streams.
Revised: Adblocking tools continue to rise in popularity, potentially threatening the dynamics of advertising revenue streams.
Edit intent: clarity
Original:  In response, a number of publishers have ramped up efforts to develop and deploy tools for detecting and/or counter-blocking adblockers ( tools we refer to as anti-adblockers), effectively escalating the online advertising arms race.
Revised:  In response, a number of publishers have ramped up efforts to develop and deploy mechanisms for detecting and/or counter-blocking adblockers ( tools we refer to as anti-adblockers), effectively escalating the online advertising arms race.
Edit intent: clarity