wanyu/IteraTeR_v2 huggingface dataset:
Original:  We show that conservation, essentiality and functional specialization of genes control in a quite universal way the topology of the emerging bacterial PPI networks.
Revised:  We show that conservation, essentiality and functional specialisation of genes constrain the connectivity of the corresponding proteins in bacterial PPI networks.
Edit intent: clarity
Original: Both the fraction of stem over differentiated cell numbers, N_s / N_d, and the cell division rate, m_s, experience relatively large variations (three decades) when different human tissuesare considered.
Revised: Compiled data for the stem cell numbers, N_s / N_d, and the cell division rate, m_s, experience relatively large variations (three decades) when different human tissuesare considered.
Edit intent: clarity
Original:  We propose an average notion of program sensitivity for probabilistic programs---expected sensitivity---that averages a distance function over a probabilistic coupling of two output distributions from two nearby inputs.
Revised:  We propose an average notion of program sensitivity for probabilistic programs---expected sensitivity---that averages a distance function over a probabilistic coupling of two output distributions from two similar inputs.
Edit intent: clarity
Original:  By varying the distance, expected sensitivity captures useful notions of probabilistic function sensitivity, including algorithmic stability of machine learning algorithms and convergence of Markov chains.
Revised:  By varying the distance, expected sensitivity recovers useful notions of probabilistic function sensitivity, including algorithmic stability of machine learning algorithms and convergence of Markov chains.
Edit intent: clarity
Original:  By varying the distance, expected sensitivity captures useful notions of probabilistic function sensitivity, including algorithmic stability of machine learning algorithms and convergence of Markov chains.
Revised:  By varying the distance, expected sensitivity captures useful notions of probabilistic function sensitivity, including stability of machine learning algorithms and convergence of Markov chains.
Edit intent: clarity
Original:  First, relational pre-conditions and post-conditions are expressed using distances, which can be seen as a real-valued generalization of typical boolean-valued (relational) assertions.
Revised:  First, relational pre-conditions and post-conditions are expressed using distances, a real-valued generalization of typical boolean-valued (relational) assertions.
Edit intent: clarity
Original:  We demonstrate our logic on two classes of examples : formalizing uniform stability for the stochastic gradient algorithm from machine learning, and rapid mixing for a model of asexual population dynamics.
Revised:  We demonstrate our logic on two classes of examples : formalizing uniform stability for the stochastic gradient method. Furthermore, we prove rapid mixing for a model of asexual population dynamics.
Edit intent: clarity
Original:  We demonstrate our logic on two classes of examples : formalizing uniform stability for the stochastic gradient algorithm from machine learning, and rapid mixing for a model of asexual population dynamics.
Revised:  We demonstrate our logic on two classes of examples : formalizing uniform stability for the stochastic gradient algorithm from machine learning, and rapid mixing for a probabilistic model of population dynamics.
Edit intent: clarity
Original:  The performance of this frequency-difference dependent stochastic resonance is influenced by both the beat frequency and the two forcing frequencies.
Revised:  The performance of this frequency-difference-dependent stochastic resonance is influenced by both the beat frequency and the two forcing frequencies.
Edit intent: fluency
Original:  Our results thus introduce and provide insights into the generation and modulation mechanism of the frequency-difference dependent stochastic resonance in neural systems.
Revised:  Our results thus introduce and provide insights into the generation and modulation mechanism of the frequency-difference-dependent stochastic resonance in neural systems.
Edit intent: fluency
Original: We consider the problem of feedback control when the controller is  constructed solely of deterministic spiking neurons.
Revised: We address the problem of feedback control when the controller is constructed solely of deterministic spiking neurons.
Edit intent: clarity
Original: We consider the problem of feedback control when the controller is  constructed solely of deterministic spiking neurons.
Revised: We consider the problem of learning feedback control where the controller is constructed solely of deterministic spiking neurons.
Edit intent: clarity
Original: We consider the problem of feedback control when the controller is  constructed solely of deterministic spiking neurons.
Revised: We consider the problem of feedback control when the controller is a network constructed solely of deterministic spiking neurons.
Edit intent: clarity
Original:  Experiments demonstrate that the proposed controller has a larger region of stability as compared to the traditional PID controller, and its trajectories differ qualitatively from those of the PID controller.
Revised:  Experiments demonstrate that the proposed controller has a stability region comparable to a traditional PID controller, and its trajectories differ qualitatively from those of the PID controller.
Edit intent: clarity
Original:  Experiments demonstrate that the proposed controller has a larger region of stability as compared to the traditional PID controller, and its trajectories differ qualitatively from those of the PID controller.
Revised:  Experiments demonstrate that the proposed controller has a larger region of stability as compared to the traditional PID controller, its trajectories differ qualitatively from those of the PID controller.
Edit intent: coherence
Original:  This resolves an open problem raised by Epstein and van Stee (WAOA 2008).
Edit intent: coherence
Original: This article conerns the expressive power of depth in neural nets with ReLU activations .
Revised: This article concerns the expressive power of depth in neural nets with ReLU activations .
Edit intent: fluency
Original:  We prove that ReLU nets with width 2d+2 can approximate any continuous scalar function on the d-dimensional cube [0,1]^d arbitrarily well.
Revised:  We prove that ReLU nets with width 2d+2 can approximate any continuous function on the d-dimensional cube [0,1]^d arbitrarily well.
Edit intent: clarity
Original:  We prove that ReLU nets with width 2d+2 can approximate any continuous scalar function on the d-dimensional cube [0,1]^d arbitrarily well.
Revised:  We prove that ReLU nets with width 2d+2 can approximate any continuous scalar function on the unit cube [0,1]^d arbitrarily well.
Edit intent: clarity
Original:  Indeed, we give a constructive proof that ReLU nets with width d+1 can approximate any continuous convex function of d  arbitrarily well.
Revised:  In particular, we prove that ReLU nets with width d+1 can approximate any continuous convex function of d arbitrarily well.
Edit intent: clarity
Original:  Moreover, when approximating convex, piecewise affine functions by width d+1 ReLU nets, we obtain matching upper and lower bounds on the required depth, proving that our construction is essentially optimal.  ]
Revised:  Moreover, when approximating convex, piecewise affine functions by such nets, we obtain matching upper and lower bounds on the required depth, proving that our construction is essentially optimal. ]
Edit intent: clarity
Original: Online social media (OSM) has a great influence in todays' world.
Revised: Online social media (OSM) has a enormous influence in today's world.
Edit intent: clarity
Original:  Some individuals view OSM as fertile ground for abuse and use it to disseminate misinformation , political propaganda, slander competitors, and spread spam.
Revised:  Some individuals view OSM as fertile ground for abuse and use it to disseminate misinformation and political propaganda, slander competitors, and spread spam.
Edit intent: fluency
Original:  The detection of online discussion topics manipulated by OSM abusers is an emerging problem attracting significant attention.
Revised:  The detection of online discussion topics manipulated by OSM abusers is an emerging problem attracting significant attention.
Edit intent: fluency
Original:  The detection of online discussion topics manipulated by OSM abusers is an emerging problem attracting significant attention.
Revised:  The detection of online discussion topics manipulated by OSM abusers is an emerging issue attracting significant attention.
Edit intent: clarity
Original:  In this paper  we propose an approach for quantifying the authenticity of online discussions based on the similarity of OSM accounts participating in the discussion to known abusers and legitimate accounts.
Revised:  In this paper , we propose an approach for quantifying the authenticity of online discussions based on the similarity of OSM accounts participating in the discussion to known abusers and legitimate accounts.
Edit intent: fluency
Original:  Our method uses multiple similarity functions for the analysis and classification of OSM accounts.
Revised:  Our method uses several similarity functions for the analysis and classification of OSM accounts.
Edit intent: fluency
Original:  The proposed methods are demonstrated using Twitter data collected for this study and previously published Arabic Honeypots data \emph{ .
Revised:  The proposed methods are demonstrated using Twitter data collected for this study and previously published \emph{ .
Edit intent: clarity
Original:  Demonstration of the topic's authenticity, derived from account similarity functions, shows that the suggested approach is effective for discriminating between topics that were strongly promoted by abusers and topics that attracted authentic public interest.
Revised:  Evaluation of the topic's authenticity, derived from account similarity functions, shows that the suggested approach is effective for discriminating between topics that were strongly promoted by abusers and topics that attracted authentic public interest.
Edit intent: fluency
Original:  In contrast to the traditional approaches that build their speaker embeddings using manual- ly hand-crafted spectral features, we propose to train for this purpose a recur- rent convolutional neural network applied directly on magnitude spectrograms.
Revised:  In contrast to the traditional approaches that build their speaker embeddings using manually hand-crafted spectral features, we propose to train for this purpose a recur- rent convolutional neural network applied directly on magnitude spectrograms.
Edit intent: fluency
Original:  In contrast to the traditional approaches that build their speaker embeddings using manual- ly hand-crafted spectral features, we propose to train for this purpose a recur- rent convolutional neural network applied directly on magnitude spectrograms.
Revised:  In contrast to the traditional approaches that build their speaker embeddings using manual- ly hand-crafted spectral features, we propose to train for this purpose a recurrent convolutional neural network applied directly on magnitude spectrograms.
Edit intent: fluency
Original:  The results of our evaluation on the new dataset and three other benchmark datasets show that our proposed method significantly outperforms the competitors and reduces diarization error rate by a large margin of over 30\% with re- spect to the baseline.
Revised:  The results of our evaluation on the new dataset and three other benchmark datasets show that our proposed method significantly outperforms the competitors and reduces diarization error rate by a large margin of over 30\% with respect to the baseline.
Edit intent: fluency
Original:  In this paper, we propose a decentralized multi-cell-aware opportunistic random access ( MA-ORA ) protocol that achieves the optimal throughput scaling in an ultra-dense K-cell random access network with one access point (AP)
Revised:  In this paper, we propose a decentralized multi-cell-aware opportunistic random access ( MA-ORA ) protocol that achieves the optimal throughput scaling in an ultra-dense multi-cell random access network with one access point (AP)
Edit intent: fluency
Original:  and N users in each cell ,
Revised:  and a number of users in each cell ,
Edit intent: clarity
Original:  which is suited for machine-type communications . Unlike opportunistic scheduling for cellular multiple access where users are selected by base stations, under our MA-ORA protocol, each user opportunistically transmits with a predefined physical layer data rate in a decentralized manner if the desired signal power to the serving AP is sufficiently large and the generating interference leakage power to the other APs is sufficiently small (i.e., two threshold conditions are fulfilled).
Revised:  which is suited for machine-type communications . Unlike opportunistic scheduling for cellular multiple access where users are selected by base stations, under our IA-ORA protocol, each user opportunistically transmits with a predefined physical layer data rate in a decentralized manner if the desired signal power to the serving AP is sufficiently large and the generating interference leakage power to the other APs is sufficiently small (i.e., two threshold conditions are fulfilled).
Edit intent: clarity
Original:  As a main result, it is proved that the aggregate throughput scales as K{e(1-\epsilon) \log (}snr \log N) in a high signal-to-noise ratio (SNR) regime if N scales faster thansnr ^{\frac{K-1{1-\delta}} for small constants \epsilon, \delta>0.
Revised:  As a main result, it is proved that the (1-\epsilon) \log (}snr \log N) in a high signal-to-noise ratio (SNR) regime if N scales faster thansnr ^{\frac{K-1{1-\delta}} for small constants \epsilon, \delta>0.
Edit intent: clarity
Original:  As a main result, it is proved that the aggregate throughput scales as K{e(1-\epsilon) \log (}snr \log N) in a high signal-to-noise ratio (SNR) regime if N scales faster thansnr ^{\frac{K-1{1-\delta}} for small constants \epsilon, \delta>0.
Revised:  As a main result, it is proved that the aggregate throughput scales as K{e(1-\epsilon) \log (} \log N) in a high signal-to-noise ratio (SNR) regime if N scales faster thansnr ^{\frac{K-1{1-\delta}} for small constants \epsilon, \delta>0.
Edit intent: fluency
Original:  As a main result, it is proved that the aggregate throughput scales as K{e(1-\epsilon) \log (}snr \log N) in a high signal-to-noise ratio (SNR) regime if N scales faster thansnr ^{\frac{K-1{1-\delta}} for small constants \epsilon, \delta>0.
Revised:  As a main result, it is proved that the aggregate throughput scales as K{e(1-\epsilon) \log (}snr \log N) in a high signal-to-noise ratio snr ^{\frac{K-1{1-\delta}} for small constants \epsilon, \delta>0.
Edit intent: clarity
Original:  As a main result, it is proved that the aggregate throughput scales as K{e(1-\epsilon) \log (}snr \log N) in a high signal-to-noise ratio (SNR) regime if N scales faster thansnr ^{\frac{K-1{1-\delta}} for small constants \epsilon, \delta>0.
Revised:  As a main result, it is proved that the aggregate throughput scales as K{e(1-\epsilon) \log (}snr \log N) in a high signal-to-noise ratio (SNR) regime if N scales faster than ^{\frac{K-1{1-\delta}} for small constants \epsilon, \delta>0.
Edit intent: fluency
Original:  In addition, numerical evaluation  confirms that under a practical setting , the proposed MA-ORA protocol outperforms conventional opportunistic random access protocols in terms of  throughput.
Revised:  In addition, numerical evaluation confirms that under practical settings , the proposed MA-ORA protocol outperforms conventional opportunistic random access protocols in terms of throughput.
Edit intent: fluency
Original: Due to the difficulty of coordination in multi-cell random access, it is a practical challenge how to achieve the optimal throughput  with decentralized transmission  .
Revised: It is a challenging task to design a random access protocol that achieves the optimal throughput with decentralized transmission .
Edit intent: clarity
Original: Due to the difficulty of coordination in multi-cell random access, it is a practical challenge how to achieve the optimal throughput  with decentralized transmission  .
Revised: Due to the difficulty of coordination in multi-cell random access, it is a practical challenge how to achieve the optimal throughput in multi-cell random access with decentralized transmission .
Edit intent: fluency
Original: Due to the difficulty of coordination in multi-cell random access, it is a practical challenge how to achieve the optimal throughput  with decentralized transmission  .
Revised: Due to the difficulty of coordination in multi-cell random access, it is a practical challenge how to achieve the optimal throughput with decentralized transmission due to the difficulty of coordination .
Edit intent: coherence
Original:  In this paper, we propose a decentralized interference-aware opportunistic random access (IA-ORA) protocol that achieves the optimal throughput scaling in an ultra-dense multi-cell random access network with one access point (AP) and a number of users in each cell.
Revised:  In this paper, we present a decentralized interference-aware opportunistic random access (IA-ORA) protocol that achieves the optimal throughput scaling in an ultra-dense multi-cell random access network with one access point (AP) and a number of users in each cell.
Edit intent: clarity
Original:  In this paper, we propose a decentralized interference-aware opportunistic random access (IA-ORA) protocol that achieves the optimal throughput scaling in an ultra-dense multi-cell random access network with one access point (AP) and a number of users in each cell.
Revised:  In this paper, we propose a decentralized interference-aware opportunistic random access (IA-ORA) protocol that enables us to obtain the optimal throughput scaling in an ultra-dense multi-cell random access network with one access point (AP) and a number of users in each cell.
Edit intent: clarity
Original:  Unlike opportunistic scheduling for cellular multiple access where users are selected by base stations, under our IA-ORA protocol, each user opportunistically transmits with a predefined physical layer  data rate in a decentralized manner if  the desired signal power to the serving AP is sufficiently large and the generating interference leakage power to the other APs is sufficiently small (i.e., two threshold conditions are fulfilled).
Revised:  Unlike opportunistic scheduling for cellular multiple access where users are selected by base stations, under the IA-ORA protocol, each user opportunistically transmits with a predefined physical layer data rate in a decentralized manner if the desired signal power to the serving AP is sufficiently large and the generating interference leakage power to the other APs is sufficiently small (i.e., two threshold conditions are fulfilled).
Edit intent: fluency
Original:  Unlike opportunistic scheduling for cellular multiple access where users are selected by base stations, under our IA-ORA protocol, each user opportunistically transmits with a predefined physical layer  data rate in a decentralized manner if  the desired signal power to the serving AP is sufficiently large and the generating interference leakage power to the other APs is sufficiently small (i.e., two threshold conditions are fulfilled).
Revised:  Unlike opportunistic scheduling for cellular multiple access where users are selected by base stations, under our IA-ORA protocol, each user opportunistically transmits with a predefined physical layer data rate in a decentralized manner if not only the desired signal power to the serving AP is sufficiently large and the generating interference leakage power to the other APs is sufficiently small (i.e., two threshold conditions are fulfilled).
Edit intent: clarity
Original:  Unlike opportunistic scheduling for cellular multiple access where users are selected by base stations, under our IA-ORA protocol, each user opportunistically transmits with a predefined physical layer  data rate in a decentralized manner if  the desired signal power to the serving AP is sufficiently large and the generating interference leakage power to the other APs is sufficiently small (i.e., two threshold conditions are fulfilled).
Revised:  Unlike opportunistic scheduling for cellular multiple access where users are selected by base stations, under our IA-ORA protocol, each user opportunistically transmits with a predefined physical layer data rate in a decentralized manner if the desired signal power to the serving AP is sufficiently large but also the generating interference leakage power to the other APs is sufficiently small (i.e., two threshold conditions are fulfilled).
Edit intent: coherence
Original:  As a main result, it is proved that the optimal aggregate physical layer throughput scaling (i.e., the MAC throughput of \frac{1}{e} in a cell and the power gain) is achieved in a high signal-to-noise ratio regime if the number of per-cell users is higher than a certain level.
Revised:  As a main result, it is shown that the optimal aggregate physical layer throughput scaling (i.e., the MAC throughput of \frac{1}{e} in a cell and the power gain) is achieved in a high signal-to-noise ratio regime if the number of per-cell users is higher than a certain level.
Edit intent: coherence
Original:  As a main result, it is proved that the optimal aggregate physical layer throughput scaling (i.e., the MAC throughput of \frac{1}{e} in a cell and the power gain) is achieved in a high signal-to-noise ratio regime if the number of per-cell users is higher than a certain level.
Revised:  As a main result, it is proved that the optimal aggregate throughput scaling (i.e., the MAC throughput of \frac{1}{e} in a cell and the power gain) is achieved in a high signal-to-noise ratio regime if the number of per-cell users is higher than a certain level.
Edit intent: clarity
Original:  We describe the first mathematical memory models that are truly declarative by generating explicit semantic triples describing both memory content and sensory inputs .
Revised:  We describe the first detailed mathematical models for the complete processing pipeline from sensory input and its semantic decoding, i.e., perception, to the formation of episodic and semantic memories and their declarative semantic decodings .
Edit intent: clarity
Original:  As numerical relativity continues to blend in with routine gravitational wave data analyses to validate the discovery of gravitational wave transients , it is essential to develop open source tools to streamline these studies.
Revised:  As numerical relativity continues to blend in with routine gravitational wave data analyses to validate the discovery of gravitational wave events , it is essential to develop open source tools to streamline these studies.
Edit intent: clarity
Original:  Among others, the scattering of THz waves from any object, including walls and furniture, and ultra-wideband highly directional links lead to fundamentally new propagation and interference structures.
Revised:  Among others, the scattering of THz waves from any object, including walls and furniture, and ultra-wideband highly-directional links lead to fundamentally new propagation and interference structures.
Edit intent: fluency
Original: Allen-Zhu, Gelashvili, Micali, and Shavit constructed a sparse, sign-consistent Johnson Lindenstrauss distribution, and proved that this distribution yields an essentially optimal dimension for the correct choice of sparsity.
Revised: Allen-Zhu, Gelashvili, Micali, and Shavit construct a sparse, sign-consistent Johnson Lindenstrauss distribution, and proved that this distribution yields an essentially optimal dimension for the correct choice of sparsity.
Edit intent: fluency