wanyu/IteraTeR_v2 huggingface dataset:
Original:  In this paper we aim to develop a principled framework for robust and time- or condition-specific causal discovery, by addressing the above issues.
Revised:  In this paper we propose a principled framework for robust and time- or condition-specific causal discovery, by addressing the above issues.
Edit intent: clarity
Original:  We model systems-level chromosomal crosstalk by unifying intrinsic parameters (chromosomal length and number of coding genes) across all chromosome pairs of the genome to derive an extrinsic parameter called effective protein-coding gene density.
Revised:  We model systems-level chromosomal crosstalk by unifying intrinsic parameters (chromosomal length and number of genes) across all chromosome pairs of the genome to derive an extrinsic parameter called effective protein-coding gene density.
Edit intent: fluency
Original:  We model systems-level chromosomal crosstalk by unifying intrinsic parameters (chromosomal length and number of coding genes) across all chromosome pairs of the genome to derive an extrinsic parameter called effective protein-coding gene density.
Revised:  We model systems-level chromosomal crosstalk by unifying intrinsic parameters (chromosomal length and number of coding genes) across all pairs of chromosomes in the genome to derive an extrinsic parameter called effective protein-coding gene density.
Edit intent: clarity
Original:  We model systems-level chromosomal crosstalk by unifying intrinsic parameters (chromosomal length and number of coding genes) across all chromosome pairs of the genome to derive an extrinsic parameter called effective protein-coding gene density.
Revised:  We model systems-level chromosomal crosstalk by unifying intrinsic parameters (chromosomal length and number of coding genes) across all chromosome pairs of the genome to derive an extrinsic parameter called effective gene density.
Edit intent: clarity
Original:  The hierarchical clustering and underlying degeneracy in such effective gene density space corroborates experimental data on spatial chromosomal arrangement in human nuclei, thereby implying that protein-coding genome constrains chromosomal arrangement  .
Revised:  The hierarchical clustering and underlying degeneracy in the effective gene density space corroborates experimental data on spatial chromosomal arrangement in human nuclei, thereby implying that protein-coding genome constrains chromosomal arrangement .
Edit intent: clarity
Original:  We model systems-level chromosomal crosstalk by unifying intrinsic parameters (chromosomal length and number of genes) across all pairs of chromosomes in the genome to derive an extrinsic parameter called effective gene density.
Revised:  Here, we model systems-level chromosomal crosstalk by unifying intrinsic parameters (chromosomal length and number of genes) across all pairs of chromosomes in the genome to derive an extrinsic parameter called effective gene density.
Edit intent: coherence
Original:  The method does not increase  complexity of the synthesized design comparing to the solution based on manual latency adjustment.
Revised:  The method does not increase the complexity of the synthesized design comparing to the solution based on manual latency adjustment.
Edit intent: fluency
Original: We introduce two new Kirchhoff-law-Johnson-noise (KLJN) secure key distribution schemes , which are the generalization of the original KLJN version .
Revised: We introduce two new Kirchhoff-law-Johnson-noise (KLJN) secure key distribution schemes which are generalizations of the original KLJN version .
Edit intent: fluency
Original: We introduce two new Kirchhoff-law-Johnson-noise (KLJN) secure key distribution schemes , which are the generalization of the original KLJN version .
Revised: We introduce two new Kirchhoff-law-Johnson-noise (KLJN) secure key distribution schemes , which are the generalization of the original KLJN scheme .
Edit intent: clarity
Original:  The first system , the Random-Resistor (RR-) KLJN scheme is using random resistors chosen from a quasi-continuum set of resistance values .
Revised:  The first of these , the Random-Resistor (RR-) KLJN scheme is using random resistors chosen from a quasi-continuum set of resistance values .
Edit intent: clarity
Original:  The first system , the Random-Resistor (RR-) KLJN scheme is using random resistors chosen from a quasi-continuum set of resistance values .
Revised:  The first system , the Random-Resistor (RR-) KLJN scheme , uses random resistors with values chosen from a quasi-continuum set of resistance values .
Edit intent: clarity
Original:  The first system , the Random-Resistor (RR-) KLJN scheme is using random resistors chosen from a quasi-continuum set of resistance values .
Revised:  The first system , the Random-Resistor (RR-) KLJN scheme is using random resistors chosen from a quasi-continuum set .
Edit intent: clarity
Original:  It is well known since the creation of the KLJN concept that such  system could work  because Alice and Bob can calculate the unknown resistance value from measurements ;
Revised:  It is well-known since the creation of the KLJN concept that such system could work because Alice and Bob can calculate the unknown resistance value from measurements ;
Edit intent: fluency
Original:  It is well known since the creation of the KLJN concept that such  system could work  because Alice and Bob can calculate the unknown resistance value from measurements ;
Revised:  It is well known since the creation of the KLJN concept that such a system could work because Alice and Bob can calculate the unknown resistance value from measurements ;
Edit intent: fluency
Original:  however, it has not been addressed in publications as it was considered impractical.
Revised:  however, it has not been addressed in prior publications since it was considered impractical.
Edit intent: clarity
Original:  The reason for discussing it  is the second scheme, the Random-Resistor-Random-Temperature (RRRT-) KLJN key exchanger inspired by a recent paper of Vadai-Mingesz-Gingl where security was maintained at non-zero power flow.
Revised:  The reason for discussing it is the second scheme, the Random-Resistor-Random-Temperature (RRRT-) KLJN key exchange, inspired by a recent paper of Vadai-Mingesz-Gingl where security was maintained at non-zero power flow.
Edit intent: fluency
Original:  The reason for discussing it  is the second scheme, the Random-Resistor-Random-Temperature (RRRT-) KLJN key exchanger inspired by a recent paper of Vadai-Mingesz-Gingl where security was maintained at non-zero power flow.
Revised:  The reason for discussing it is the second scheme, the Random-Resistor-Random-Temperature (RRRT-) KLJN key exchanger inspired by a recent paper of Vadai, Mingesz and Gingl, wherein security was shown to be maintained at non-zero power flow.
Edit intent: clarity
Original:  In the RRRT-KLJN secure key exchanger scheme, both the resistances and their temperatures are continuum random variables.
Revised:  In the RRRT-KLJN secure key exchange scheme, both the resistances and their temperatures are continuum random variables.
Edit intent: fluency
Original:  We prove that the security of the RRRT-KLJN system can be maintained at non-zero power flow  thus the physical law guaranteeing the security is not the Second Law of Thermodynamics but the Fluctuation-Dissipation Theorem.
Revised:  We prove that the security of the RRRT-KLJN scheme can prevail at non-zero power flow thus the physical law guaranteeing the security is not the Second Law of Thermodynamics but the Fluctuation-Dissipation Theorem.
Edit intent: clarity
Original:  We prove that the security of the RRRT-KLJN system can be maintained at non-zero power flow  thus the physical law guaranteeing the security is not the Second Law of Thermodynamics but the Fluctuation-Dissipation Theorem.
Revised:  We prove that the security of the RRRT-KLJN system can be maintained at non-zero power flow , and thus the physical law guaranteeing the security is not the Second Law of Thermodynamics but the Fluctuation-Dissipation Theorem.
Edit intent: coherence
Original:  We prove that the security of the RRRT-KLJN system can be maintained at non-zero power flow  thus the physical law guaranteeing the security is not the Second Law of Thermodynamics but the Fluctuation-Dissipation Theorem.
Revised:  We prove that the security of the RRRT-KLJN system can be maintained at non-zero power flow thus the physical law guaranteeing security is not the Second Law of Thermodynamics but the Fluctuation-Dissipation Theorem.
Edit intent: clarity
Original:  Knowing their own resistance and temperature values, Alice and Bob can calculate the resistance and temperature values at the other end from the measured voltage, current and power-flow data in the wire.
Revised:  Alice and Bob know their own resistances and temperatures and can calculate the resistance and temperature values at the other end from the measured voltage, current and power-flow data in the wire.
Edit intent: clarity
Original:  Knowing their own resistance and temperature values, Alice and Bob can calculate the resistance and temperature values at the other end from the measured voltage, current and power-flow data in the wire.
Revised:  Knowing their own resistance and temperature values, Alice and Bob can calculate the resistance and temperature values at the other end of the communication channel from measured voltage, current and power-flow data in the wire.
Edit intent: clarity
Original:   Eve cannot determine these values because, for her, there are 4 unknown quantities , while she can set up only 3 equations.
Revised:  However, Eve cannot determine these values because, for her, there are 4 unknown quantities , while she can set up only 3 equations.
Edit intent: coherence
Original:   Eve cannot determine these values because, for her, there are 4 unknown quantities , while she can set up only 3 equations.
Revised:  Eve cannot determine these values because, for her, there are four unknown quantities while she can set up only 3 equations.
Edit intent: coherence
Original:   Eve cannot determine these values because, for her, there are 4 unknown quantities , while she can set up only 3 equations.
Revised:  Eve cannot determine these values because, for her, there are 4 unknown quantities , while she can set up only three equations.
Edit intent: coherence
Original:  The RRRT-KLJN scheme has several advantages and makes all the existing former attacks invalid or incomplete.
Revised:  The RRRT-KLJN scheme has several advantages and makes all former attacks on the KLJN scheme invalid or incomplete.
Edit intent: clarity
Original: Since 1975 Zahavi's handicap principle has provided an elegant explanation for extravagant ornaments in the animal world: namely, that ornaments advertise fitness and must be costly in order to enforce honest signaling.
Revised: Species spanning the animal kingdom have evolved extravagant and costly ornaments to attract mating partners. Zahavi's handicap principle has provided an elegant explanation for extravagant ornaments in the animal world: namely, that ornaments advertise fitness and must be costly in order to enforce honest signaling.
Edit intent: clarity
Original: Since 1975 Zahavi's handicap principle has provided an elegant explanation for extravagant ornaments in the animal world: namely, that ornaments advertise fitness and must be costly in order to enforce honest signaling.
Revised: Since 1975 Zahavi's handicap principle offers an elegant explanation for extravagant ornaments in the animal world: namely, that ornaments advertise fitness and must be costly in order to enforce honest signaling.
Edit intent: clarity
Original:  If we want to only tally permutations according to \Pi-patterns, rather than to store information about every permutation, then all of our algorithms can be implemented in O(n^{k+1}k) space.
Revised:  If we want to only count permutations of according to \Pi-patterns, rather than to store information about every permutation, then all of our algorithms can be implemented in O(n^{k+1}k) space.
Edit intent: clarity
Original:  We introduce an O(n !k)-time algorithm computing P_\Pi(w) for each w \in S_n, and an(\Pi), the set of permutations of length at most n avoiding the patterns in \Pi, in time } O(|S_{\le n-1 }(\Pi)| \cdot k + |S _n (\Pi)|)  -time algorithm computing S_{\le n(\Pi ) = \{w : w \in S_{\le n}, P_{\Pi}(w) = 0\}}  . Surprisingly, when |\Pi| = 1, we can improve the run-time to \Theta (n!)
Revised:  We introduce an O(n !k)-time algorithm computing P_\Pi(w) for each w \in S_n, and an(\Pi), the set of permutations of length at most n avoiding the patterns in \Pi, in time } O(|S_{\le n - 1 }(\Pi)| \cdot k + |S _n (\Pi)|) -time algorithm computing S_{\le n(\Pi ) = \{w : w \in S_{\le n}, P_{\Pi}(w) = 0\}} . Surprisingly, when |\Pi| = 1, we can improve the run-time to \Theta (n!)
Edit intent: fluency
Original:  We introduce an O(n !k)-time algorithm computing P_\Pi(w) for each w \in S_n, and an(\Pi), the set of permutations of length at most n avoiding the patterns in \Pi, in time } O(|S_{\le n-1 }(\Pi)| \cdot k + |S _n (\Pi)|)  -time algorithm computing S_{\le n(\Pi ) = \{w : w \in S_{\le n}, P_{\Pi}(w) = 0\}}  . Surprisingly, when |\Pi| = 1, we can improve the run-time to \Theta (n!)
Revised:  We introduce an O(n !k)-time algorithm computing P_\Pi(w) for each w \in S_n, and an(\Pi), the set of permutations of length at most n avoiding the patterns in \Pi, in time } O(|S_{\le n-1 }(\Pi)| \cdot k + |S _{n (\Pi)|) -time algorithm computing S_{\le n(\Pi ) = \{w : w \in S_{\le n}, P_{\Pi}(w) = 0\}} . Surprisingly, when |\Pi| = 1, we can improve the run-time to \Theta (n!)
Edit intent: fluency
Original:  We introduce an O(n !k)-time algorithm computing P_\Pi(w) for each w \in S_n, and an(\Pi), the set of permutations of length at most n avoiding the patterns in \Pi, in time } O(|S_{\le n-1 }(\Pi)| \cdot k + |S _n (\Pi)|)  -time algorithm computing S_{\le n(\Pi ) = \{w : w \in S_{\le n}, P_{\Pi}(w) = 0\}}  . Surprisingly, when |\Pi| = 1, we can improve the run-time to \Theta (n!)
Revised:  We introduce an O(n !k)-time algorithm computing P_\Pi(w) for each w \in S_n, and an(\Pi), the set of permutations of length at most n avoiding the patterns in \Pi, in time } O(|S_{\le n-1 }(\Pi)| \cdot k + |S _n (\Pi)|) . Additionally, we present an O(n!k) -time algorithm computing S_{\le n(\Pi ) = \{w : w \in S_{\le n}, P_{\Pi}(w) = 0\}} . Surprisingly, when |\Pi| = 1, we can improve the run-time to \Theta (n!)
Edit intent: clarity
Original:  We introduce an O(n !k)-time algorithm computing P_\Pi(w) for each w \in S_n, and an(\Pi), the set of permutations of length at most n avoiding the patterns in \Pi, in time } O(|S_{\le n-1 }(\Pi)| \cdot k + |S _n (\Pi)|)  -time algorithm computing S_{\le n(\Pi ) = \{w : w \in S_{\le n}, P_{\Pi}(w) = 0\}}  . Surprisingly, when |\Pi| = 1, we can improve the run-time to \Theta (n!)
Revised:  We introduce an O(n !k)-time algorithm computing P_\Pi(w) for each w \in S_n, and an(\Pi), the set of permutations of length at most n avoiding the patterns in \Pi, in time } O(|S_{\le n-1 }(\Pi)| \cdot k + |S _n (\Pi)|) -time algorithm computing S_{\le n(\Pi ) = \{w : w \in S_{\le n}, P_{\Pi}(w) = 0\}} for counting the number of copies of patterns from \Pi in each permutation in S_n . Surprisingly, when |\Pi| = 1, we can improve the run-time to \Theta (n!)
Edit intent: clarity
Original:  We introduce an O(n !k)-time algorithm computing P_\Pi(w) for each w \in S_n, and an(\Pi), the set of permutations of length at most n avoiding the patterns in \Pi, in time } O(|S_{\le n-1 }(\Pi)| \cdot k + |S _n (\Pi)|)  -time algorithm computing S_{\le n(\Pi ) = \{w : w \in S_{\le n}, P_{\Pi}(w) = 0\}}  . Surprisingly, when |\Pi| = 1, we can improve the run-time to \Theta (n!)
Revised:  We introduce an O(n !k)-time algorithm computing P_\Pi(w) for each w \in S_n, and an(\Pi), the set of permutations of length at most n avoiding the patterns in \Pi, in time } O(|S_{\le n-1 }(\Pi)| \cdot k + |S _n (\Pi)|) -time algorithm computing S_{\le n(\Pi ) = \{w : w \in S_{\le n}, P_{\Pi}(w) = 0\}} . Surprisingly, when |\Pi| = 1, this runtime can be improved to O (n!)
Edit intent: clarity
Original:  for computing P_\Pi(w) for each w \in S_n. In contrast, the best previous algorithms, based on generate-and-check, take exponential time per permutation analyzed  .
Revised:  , spending only constant time per permutation. Whereas the previous best algorithms, based on generate-and-check, take exponential time per permutation analyzed .
Edit intent: clarity
Original:  We obtained thousands of novel pattern-avoidance conjectures , thirteen of which we present .
Revised:  We obtained thousands of novel pattern-avoidance conjectures .
Edit intent: clarity
Original:  Our algorithms extend to considering permutations in any set closed under normalization of subsequences.
Revised:  Our algorithms extend to considering permutations in any set closed under standardization of subsequences.
Edit intent: clarity
Original:  We construct guard candidate and witness sets G, W \subset T of polynomial size , such that any feasible (optimal) guard cover G ' \subseteq G for W is also feasible (optimal) for the continuous TGP.
Revised:  We construct guard candidate and witness sets G, W \subset T of polynomial size such that any feasible (optimal) guard cover G ' \subseteq G for W is also feasible (optimal) for the continuous TGP.
Edit intent: fluency
Original:  (2) provide a Polynomial Time Approximation Scheme (PTAS) for the continuous TGP using the existing PTAS for the discrete TGP by Gibson et al.;
Revised:  (2) provide a Polynomial Time Approximation Scheme (PTAS) for the continuous TGP using the PTAS for the discrete TGP by Gibson et al.;
Edit intent: clarity
Original: In the NP-hard continuous 1.5D Terrain Guarding Problem (TGP) we are given an x-monotone chain of line segments in R^2 (the terrain T) , and ask for the minimum number of guards (located anywhere on T) required to guard all of T.
Revised: In the NP-hard continuous 1.5D Terrain Guarding Problem (TGP) we are given an x-monotone chain of line segments in R^2 (the terrain T) and ask for the minimum number of guards (located anywhere on T) required to guard all of T.
Edit intent: fluency
Original:  This discretization allows us to : (1) settle NP-completeness for the continuous TGP ;
Revised:  This discretization allows us to (1) settle NP-completeness for the continuous TGP ;
Edit intent: fluency
Original:  This discretization allows us to : (1) settle NP-completeness for the continuous TGP ;
Revised:  This discretization allows us to : (1) settle NP-completeness for the continuous TGP ,
Edit intent: fluency
Original:  (2) provide a Polynomial Time Approximation Scheme (PTAS) for the continuous TGP using the PTAS for the discrete TGP by Gibson et al. ;
Revised:  (2) provide a Polynomial Time Approximation Scheme (PTAS) for the continuous TGP using the PTAS for the discrete TGP by Gibson et al. , and
Edit intent: coherence
Original:  Inspired by this stream, an online resource allocation problem for a network of mobile access points (AP) travelling on the edge of space is studied .
Revised:  Inspired by this stream, an online resource allocation problem for a mobile access point (AP) travelling on the edge of space is studied .
Edit intent: clarity
Original:  Inspired by this stream, an online resource allocation problem for a network of mobile access points (AP) travelling on the edge of space is studied .
Revised:  Inspired by this stream, an online resource allocation problem for a network of mobile access points (AP) travelling at high altitude is formulated .
Edit intent: clarity
Original:  The AP allocates its resources (available energy) to maximize the total service provided to the users such as total utility (reward)  .
Revised:  The AP allocates its resources (available energy) to maximize the total utility (reward) .
Edit intent: clarity
Original:  In deterministic model , several online heuristics are proposed based on an instantaneous threshold that can adapt to short-time-scale dynamics.
Revised:  In deterministic model , several online approximations are proposed based on an instantaneous threshold that can adapt to short-time-scale dynamics.
Edit intent: clarity
Original:  For the stochastic model,  the optimality of a threshold based solution is shown using a dynamic programming setup, and a threshold based policy via the expected threshold method is obtained.
Revised:  For the stochastic model, after showing the optimality of a threshold based solution is shown using a dynamic programming setup, and a threshold based policy via the expected threshold method is obtained.
Edit intent: clarity
Original:  For the stochastic model,  the optimality of a threshold based solution is shown using a dynamic programming setup, and a threshold based policy via the expected threshold method is obtained.
Revised:  For the stochastic model, the optimality of a threshold based solution on a dynamic programming setup, and a threshold based policy via the expected threshold method is obtained.
Edit intent: clarity
Original:  For the stochastic model,  the optimality of a threshold based solution is shown using a dynamic programming setup, and a threshold based policy via the expected threshold method is obtained.
Revised:  For the stochastic model, the optimality of a threshold based solution is shown using a dynamic programming (DP) formulation, an approximate threshold based policy via the expected threshold method is obtained.
Edit intent: clarity
Original:  For the stochastic model,  the optimality of a threshold based solution is shown using a dynamic programming setup, and a threshold based policy via the expected threshold method is obtained.
Revised:  For the stochastic model, the optimality of a threshold based solution is shown using a dynamic programming setup, and a threshold based policy is obtained.
Edit intent: clarity
Original:  The performance analysis of all heuristics is comparatively conducted .
Revised:  The performances of proposed policies are compared with that of the optimal solution obtained through DP .
Edit intent: clarity
Original:  This is in contrast to existing airborne network testbeds, which typically rely on inflexible off-the-shelf radios based on fixed standards and protocols, e.g., IEEE ~ 802.11 (Wi-Fi) or IEEE ~ 802.15.4 (Zigbee).
Revised:  This is in contrast to existing airborne network testbeds, which typically rely on inflexible off-the-shelf radios based on fixed standards and protocols, e.g., IEEE 802.11 (Wi-Fi) or IEEE ~ 802.15.4 (Zigbee).
Edit intent: fluency
Original:  This is in contrast to existing airborne network testbeds, which typically rely on inflexible off-the-shelf radios based on fixed standards and protocols, e.g., IEEE ~ 802.11 (Wi-Fi) or IEEE ~ 802.15.4 (Zigbee).
Revised:  This is in contrast to existing airborne network testbeds, which typically rely on inflexible off-the-shelf radios based on fixed standards and protocols, e.g., IEEE ~ 802.11 (Wi-Fi) or IEEE 802.15.4 (Zigbee).
Edit intent: fluency
Original:  It is built on two open-source frameworks, namely, GNU Radio for the physical and medium access control layers and C++ ~ Qt for the higher layers of the network protocol stack including the network, transport, and application layers.
Revised:  It is built on two open-source frameworks, namely, GNU Radio for the physical and medium access control layers and C++ Qt for the higher layers of the network protocol stack including the network, transport, and application layers.
Edit intent: fluency
Original: We present the University at Buffalo's Software-Defined Airborne Networking and Communications Testbed (UB-ANC  ).
Revised: We present the University at Buffalo's Airborne Networking and Communications Testbed (UB-ANC ).
Edit intent: clarity