wanyu/IteraTeR_v2 huggingface dataset:
Original: Information about primary transmitter location is crucial in enabling several key capabilities in dynamic spectrum access networks, including improved spatio-temporal sensing, intelligent location-aware routing, as well as aiding spectrum policy enforcement.
Revised: Information about primary transmitter location is crucial in enabling several key capabilities in cognitive radio networks, including improved spatio-temporal sensing, intelligent location-aware routing, as well as aiding spectrum policy enforcement.
Edit intent: clarity
Original:  We also propose a practical method for employing WCL through a distributed cluster-based implementation.
Revised:  We also propose a power-efficient method for implementing WCL through a distributed cluster-based implementation.
Edit intent: clarity
Original:  This approach achieves comparable accuracy with its centralized counterpart , and greatly reduces total transmit power .
Revised:  This approach achieves comparable accuracy with its centralized counterpart .
Edit intent: clarity
Original:  In the specific case when the weight is given by the product of nodes  degree raised to a power , theta, we derive a rich phase-diagram, with the consensus time exhibiting various scaling laws depending on theta and on the exponent of the degree distribution , gamma.
Revised:  In the specific case when the weight is given by the product of nodes ' degree raised to a power , theta, we derive a rich phase-diagram, with the consensus time exhibiting various scaling laws depending on theta and on the exponent of the degree distribution , gamma.
Edit intent: fluency
Original:  In the specific case when the weight is given by the product of nodes  degree raised to a power , theta, we derive a rich phase-diagram, with the consensus time exhibiting various scaling laws depending on theta and on the exponent of the degree distribution , gamma.
Revised:  In the specific case when the weight is given by the product of nodes degree raised to a power theta, we derive a rich phase-diagram, with the consensus time exhibiting various scaling laws depending on theta and on the exponent of the degree distribution , gamma.
Edit intent: fluency
Original:  In the specific case when the weight is given by the product of nodes  degree raised to a power , theta, we derive a rich phase-diagram, with the consensus time exhibiting various scaling laws depending on theta and on the exponent of the degree distribution , gamma.
Revised:  In the specific case when the weight is given by the product of nodes degree raised to a power , theta, we derive a rich phase-diagram, with the consensus time exhibiting various scaling laws depending on theta and on the exponent of the degree distribution gamma.
Edit intent: fluency
Original: Proteins in organisms  usually form protein complexes to perform cellular functions rather than act alone.
Revised: Proteins in organisms , rather than act alone, usually form protein complexes to perform cellular functions rather than act alone.
Edit intent: fluency
Original:  Statistical properties of those networks are compared to those of conventional protein-protein interaction networks, and it turns out that the networks from the protein complexes show more homogeneous structures than  the binary protein interactions, which implies the formation of complexes causing relatively more uniform numbers of interaction partners.
Revised:  Compared to conventional protein-protein interaction networks, and it turns out that the networks from the protein complexes show more homogeneous structures than the binary protein interactions, which implies the formation of complexes causing relatively more uniform numbers of interaction partners.
Edit intent: clarity
Original:  Statistical properties of those networks are compared to those of conventional protein-protein interaction networks, and it turns out that the networks from the protein complexes show more homogeneous structures than  the binary protein interactions, which implies the formation of complexes causing relatively more uniform numbers of interaction partners.
Revised:  Statistical properties of those networks are compared to those of conventional protein-protein interaction networks, the networks from the protein complexes show more homogeneous structures than the binary protein interactions, which implies the formation of complexes causing relatively more uniform numbers of interaction partners.
Edit intent: coherence
Original:  Statistical properties of those networks are compared to those of conventional protein-protein interaction networks, and it turns out that the networks from the protein complexes show more homogeneous structures than  the binary protein interactions, which implies the formation of complexes causing relatively more uniform numbers of interaction partners.
Revised:  Statistical properties of those networks are compared to those of conventional protein-protein interaction networks, and it turns out that the networks from the protein complexes show more homogeneous structures than those of the binary protein interactions, which implies the formation of complexes causing relatively more uniform numbers of interaction partners.
Edit intent: fluency
Original:  Statistical properties of those networks are compared to those of conventional protein-protein interaction networks, and it turns out that the networks from the protein complexes show more homogeneous structures than  the binary protein interactions, which implies the formation of complexes causing relatively more uniform numbers of interaction partners.
Revised:  Statistical properties of those networks are compared to those of conventional protein-protein interaction networks, and it turns out that the networks from the protein complexes show more homogeneous structures than the binary protein interactions, implying the formation of complexes causing relatively more uniform numbers of interaction partners.
Edit intent: coherence
Original:  Statistical properties of those networks are compared to those of conventional protein-protein interaction networks, and it turns out that the networks from the protein complexes show more homogeneous structures than  the binary protein interactions, which implies the formation of complexes causing relatively more uniform numbers of interaction partners.
Revised:  Statistical properties of those networks are compared to those of conventional protein-protein interaction networks, and it turns out that the networks from the protein complexes show more homogeneous structures than the binary protein interactions, which implies the formation of complexes that cause a relatively more uniform numbers of interaction partners.
Edit intent: clarity
Original:  Statistical properties of those networks are compared to those of conventional protein-protein interaction networks, and it turns out that the networks from the protein complexes show more homogeneous structures than  the binary protein interactions, which implies the formation of complexes causing relatively more uniform numbers of interaction partners.
Revised:  Statistical properties of those networks are compared to those of conventional protein-protein interaction networks, and it turns out that the networks from the protein complexes show more homogeneous structures than the binary protein interactions, which implies the formation of complexes causing relatively more uniform number of interaction partners.
Edit intent: fluency
Original:  In addition, we suggest a new optimization method to determine the abundance and function of protein complexes  based on the information of their global organization.
Revised:  In addition, we suggest a new optimization method to determine the abundance and function of protein complexes , based on the information of their global organization.
Edit intent: fluency
Original:  Estimating abundance and biological functions is of great importance , by giving much more quantitative description of behaviors in a cell than just "catalogues" of list of protein interactions , for researches such as kinetic modeling of the cell in the future .
Revised:  Estimating abundance and biological functions is of great importance for many researches, by providing a quantitative description of behaviors in a cell than just "catalogues" of list of protein interactions , for researches such as kinetic modeling of the cell in the future .
Edit intent: clarity
Original:  Estimating abundance and biological functions is of great importance , by giving much more quantitative description of behaviors in a cell than just "catalogues" of list of protein interactions , for researches such as kinetic modeling of the cell in the future .
Revised:  Estimating abundance and biological functions is of great importance , by giving much more quantitative description of cell behaviors, instead of just a "catalogues" of list of protein interactions , for researches such as kinetic modeling of the cell in the future .
Edit intent: clarity
Original:  Estimating abundance and biological functions is of great importance , by giving much more quantitative description of behaviors in a cell than just "catalogues" of list of protein interactions , for researches such as kinetic modeling of the cell in the future .
Revised:  Estimating abundance and biological functions is of great importance , by giving much more quantitative description of behaviors in a cell than just "catalogues" of the lists of protein interactions , for researches such as kinetic modeling of the cell in the future .
Edit intent: fluency
Original:  Estimating abundance and biological functions is of great importance , by giving much more quantitative description of behaviors in a cell than just "catalogues" of list of protein interactions , for researches such as kinetic modeling of the cell in the future .
Revised:  Estimating abundance and biological functions is of great importance , by giving much more quantitative description of behaviors in a cell than just "catalogues" of list of protein interactions .
Edit intent: clarity
Original:  The algorithm decides whether a density matrix is separable or  eps-away from the set of the separable states in time exp(O(eps ^(-2) log |A| log |B|)), where |A| and |B| are the local dimensions, and the distance is measured with either the Euclidean norm, or with the so-called LOCC norm.
Revised:  The algorithm decides whether a density matrix is separable or whether it is eps-away from the set of the separable states in time exp(O(eps ^(-2) log |A| log |B|)), where |A| and |B| are the local dimensions, and the distance is measured with either the Euclidean norm, or with the so-called LOCC norm.
Edit intent: clarity
Original:  The algorithm decides whether a density matrix is separable or  eps-away from the set of the separable states in time exp(O(eps ^(-2) log |A| log |B|)), where |A| and |B| are the local dimensions, and the distance is measured with either the Euclidean norm, or with the so-called LOCC norm.
Revised:  The algorithm decides whether a density matrix is separable or eps-away from the set of the separable states in time exp(O(eps ^-2 log |A| log |B|)), where |A| and |B| are the local dimensions, and the distance is measured with either the Euclidean norm, or with the so-called LOCC norm.
Edit intent: fluency
Original:  We also obtain improved algorithms for optimizing over the set of separable states , for estimating the minimal output entropy of quantum channels and for computing the ground-state energy of mean-field Hamiltonians.
Revised:  We also obtain improved algorithms for optimizing over the set of separable states and for computing the ground-state energy of mean-field Hamiltonians.
Edit intent: clarity
Original:  This answers a question posed by Aaronson et al . (Theory of Computing 5, 1, 2009) and provides two new characterizations of the complexity class QMA  . Our algorithm uses semidefinite programming to search for a symmetric extension, as first proposed by Doherty, Parrilo and Spedialieri (Phys.
Revised:  This answers a question posed by Aaronson et al (Theory of Computing 5, 1, 2009) and provides two new characterizations of the complexity class QMA . Our algorithm uses semidefinite programming to search for a symmetric extension, as first proposed by Doherty, Parrilo and Spedialieri (Phys.
Edit intent: fluency
Original:  Rev. A  69, 022308, 2004).
Revised:  Rev. A , 69, 022308, 2004).
Edit intent: fluency
Original:  The bound on the runtime follows from an improved de Finetti-type bound quantifying the monogamy of quantum entanglement (Brandao, Christandl and Yard, arXiv:1010.1750).
Revised:  The bound on the runtime follows from an improved de Finetti-type bound quantifying the monogamy of quantum entanglement , proved in ( arXiv:1010.1750).
Edit intent: clarity
Original: This paper studiesshort quantum games , which are zero-sum games played by two competing quantum players in which each player answers a question from a referee, who then declares payoffs to the players.
Revised: This paper short quantum games , which are zero-sum games played by two competing quantum players in which each player answers a question from a referee, who then declares payoffs to the players.
Edit intent: fluency
Original: This paper studiesshort quantum games , which are zero-sum games played by two competing quantum players in which each player answers a question from a referee, who then declares payoffs to the players.
Revised: This paper studies , which are zero-sum games played by two competing quantum players in which each player answers a question from a referee, who then declares payoffs to the players.
Edit intent: clarity
Original:  We prove that optimal strategies for short quantum games can be found by an efficient parallel algorithm  based on the matrix multiplicative weights update method.
Revised:  We prove that optimal strategies for short quantum games can be found by an efficient parallel algorithm based on the matrix multiplicative weight (MMW) update method.
Edit intent: clarity
Original:  If the referee is specified succinctly by quantum circuits then our algorithm can be used to find optimal strategies in polynomial space .
Revised:  Our algorithm can be used to find optimal strategies in polynomial space .
Edit intent: coherence
Original:  This algorithm is optimal in that it is already known to be QIP   QIP PSPACE -hard to approximate the value of a game, even for the special caseof\emph{classical games with\emph{simultaneous questions.
Revised:  This algorithm is optimal in that it is already known to beany QIP QIP PSPACE -hard to approximate the value of a game, even for the special caseof\emph{classical games with\emph{simultaneous questions.
Edit intent: clarity
Original:  This algorithm is optimal in that it is already known to be QIP   QIP PSPACE -hard to approximate the value of a game, even for the special caseof\emph{classical games with\emph{simultaneous questions.
Revised:  This algorithm is optimal in that it is already known to be QIP QIP PSPACE \emph{classical games with\emph{simultaneous questions.
Edit intent: clarity
Original:  This algorithm is optimal in that it is already known to be QIP   QIP PSPACE -hard to approximate the value of a game, even for the special caseof\emph{classical games with\emph{simultaneous questions.
Revised:  This algorithm is optimal in that it is already known to be QIP QIP PSPACE -hard to approximate the value of a game, even for the special caseof\emph{ games with\emph{simultaneous questions.
Edit intent: clarity
Original:  This algorithm is optimal in that it is already known to be QIP   QIP PSPACE -hard to approximate the value of a game, even for the special caseof\emph{classical games with\emph{simultaneous questions.
Revised:  This algorithm is optimal in that it is already known to be QIP QIP PSPACE -hard to approximate the value of a game, even for the special caseof\emph{classical \emph{simultaneous questions.
Edit intent: clarity
Original:  This algorithm is optimal in that it is already known to be QIP   QIP PSPACE -hard to approximate the value of a game, even for the special caseof\emph{classical games with\emph{simultaneous questions.
Revised:  This algorithm is optimal in that it is already known to be QIP QIP PSPACE -hard to approximate the value of a game, even for the special caseof\emph{classical games with\emph{ questions.
Edit intent: clarity
Original:  It follows from our work that the two competing-provers complexity classes \cls{PSPACE} \cls{QRG}(2) \cls{SQG} and %DIFDELCMD < \cls{QRG}(2) %%% induced by short quantum games with sequential and simultaneous questions, respectively, are both equal to%DIFDELCMD < \cls{PSPACE}%%% \cls{DIP} \cls{DQIP} .
Revised:  It follows from our work that several competing-provers complexity classes \cls{PSPACE} \cls{QRG}(2) \cls{SQG} and %DIFDELCMD < \cls{QRG}(2) %%% induced by short quantum games with sequential and simultaneous questions, respectively, are both equal to%DIFDELCMD < \cls{PSPACE}%%% \cls{DIP} \cls{DQIP} .
Edit intent: clarity
Original:  It follows from our work that the two competing-provers complexity classes \cls{PSPACE} \cls{QRG}(2) \cls{SQG} and %DIFDELCMD < \cls{QRG}(2) %%% induced by short quantum games with sequential and simultaneous questions, respectively, are both equal to%DIFDELCMD < \cls{PSPACE}%%% \cls{DIP} \cls{DQIP} .
Revised:  It follows from our work that the two competing-provers complexity classes \cls{PSPACE} such as\cls{QRG}(2) \cls{SQG} and %DIFDELCMD < \cls{QRG}(2) %%% induced by short quantum games with sequential and simultaneous questions, respectively, are both equal to%DIFDELCMD < \cls{PSPACE}%%% \cls{DIP} \cls{DQIP} .
Edit intent: clarity
Original:  It follows from our work that the two competing-provers complexity classes \cls{PSPACE} \cls{QRG}(2) \cls{SQG} and %DIFDELCMD < \cls{QRG}(2) %%% induced by short quantum games with sequential and simultaneous questions, respectively, are both equal to%DIFDELCMD < \cls{PSPACE}%%% \cls{DIP} \cls{DQIP} .
Revised:  It follows from our work that the two competing-provers complexity classes \cls{PSPACE} \cls{QRG}(2), \cls{SQG} and %DIFDELCMD < \cls{QRG}(2) %%% induced by short quantum games with sequential and simultaneous questions, respectively, are both equal to%DIFDELCMD < \cls{PSPACE}%%% \cls{DIP} \cls{DQIP} .
Edit intent: fluency
Original:  It follows from our work that the two competing-provers complexity classes \cls{PSPACE} \cls{QRG}(2) \cls{SQG} and %DIFDELCMD < \cls{QRG}(2) %%% induced by short quantum games with sequential and simultaneous questions, respectively, are both equal to%DIFDELCMD < \cls{PSPACE}%%% \cls{DIP} \cls{DQIP} .
Revised:  It follows from our work that the two competing-provers complexity classes \cls{PSPACE} \cls{QRG}(2) \cls{SQG} and %DIFDELCMD < \cls{QRG}(2) %%% induced by short quantum games with sequential and simultaneous questions, respectively, are both equal to%DIFDELCMD < \cls{PSPACE}%%% \cls{DIP} and\cls{DQIP} .
Edit intent: fluency
Original: This paper presents an efficient parallel algorithm for a new class of min-max problems based on the matrix multiplicative weight (MMW) update method .
Revised: This paper presents an efficient parallel approximation scheme for a new class of min-max problems based on the matrix multiplicative weight (MMW) update method .
Edit intent: clarity
Original: This paper presents an efficient parallel algorithm for a new class of min-max problems based on the matrix multiplicative weight (MMW) update method .
Revised: This paper presents an efficient parallel algorithm for a new class of min-max problems . The algorithm is derived from the matrix multiplicative weight (MMW) update method .
Edit intent: coherence
Original:  Our algorithm can be used to find near-optimal strategies for competitive two-player classical or quantum games in which a referee exchanges any number of messages with one player followed by any number of additional messages with the other.
Revised:  Our algorithm can be used to find near-optimal strategies for competitive two-party classical or quantum games in which a referee exchanges any number of messages with one player followed by any number of additional messages with the other.
Edit intent: fluency
Original:  Our algorithm can be used to find near-optimal strategies for competitive two-player classical or quantum games in which a referee exchanges any number of messages with one player followed by any number of additional messages with the other.
Revised:  Our algorithm can be used to find near-optimal strategies for competitive two-player classical or quantum interactions in which a referee exchanges any number of messages with one player followed by any number of additional messages with the other.
Edit intent: clarity
Original:  Our algorithm can be used to find near-optimal strategies for competitive two-player classical or quantum games in which a referee exchanges any number of messages with one player followed by any number of additional messages with the other.
Revised:  Our algorithm can be used to find near-optimal strategies for competitive two-player classical or quantum games in which a referee exchanges any number of messages with one party followed by any number of additional messages with the other.
Edit intent: clarity
Original:  This algorithm considerably extends the class of games which admit parallel solutions and demonstrates for the first time the existence of a parallel algorithm for \emph{any game (classical or quantum) in which one player reacts adaptively to the other.
Revised:  It considerably extends the class of games which admit parallel solutions and demonstrates for the first time the existence of a parallel algorithm for \emph{any game (classical or quantum) in which one player reacts adaptively to the other.
Edit intent: clarity
Original:  This algorithm considerably extends the class of games which admit parallel solutions and demonstrates for the first time the existence of a parallel algorithm for \emph{any game (classical or quantum) in which one player reacts adaptively to the other.
Revised:  This algorithm considerably extends the class of interactions which admit parallel solutions and demonstrates for the first time the existence of a parallel algorithm for \emph{any game (classical or quantum) in which one player reacts adaptively to the other.
Edit intent: clarity
Original:  This algorithm considerably extends the class of games which admit parallel solutions and demonstrates for the first time the existence of a parallel algorithm for \emph{any game (classical or quantum) in which one player reacts adaptively to the other.
Revised:  This algorithm considerably extends the class of games which admit parallel solutions , demonstrating for the first time the existence of a parallel algorithm for \emph{any game (classical or quantum) in which one player reacts adaptively to the other.
Edit intent: coherence
Original:  This algorithm considerably extends the class of games which admit parallel solutions and demonstrates for the first time the existence of a parallel algorithm for \emph{any game (classical or quantum) in which one player reacts adaptively to the other.
Revised:  This algorithm considerably extends the class of games which admit parallel solutions and demonstrates for the first time the existence of a parallel algorithm for \emph{ game (classical or quantum) in which one player reacts adaptively to the other.
Edit intent: clarity
Original:  This algorithm considerably extends the class of games which admit parallel solutions and demonstrates for the first time the existence of a parallel algorithm for \emph{any game (classical or quantum) in which one player reacts adaptively to the other.
Revised:  This algorithm considerably extends the class of games which admit parallel solutions and demonstrates for the first time the existence of a parallel algorithm for \emph{any an interaction in which one player reacts adaptively to the other.
Edit intent: clarity