wanyu/IteraTeR_v2 huggingface dataset:
Original: Wireless edge caching is a popular strategy to avoid backhaul congestion in the next generation networks, where the content is cached in advance at the base stations to fulfil the redundant requests during peak  periods.
Revised: Wireless edge caching is a popular strategy to avoid backhaul congestion in the next generation networks, where the content is cached in advance at the base stations to serve redundant requests during peak periods.
Edit intent: clarity
Original: Wireless edge caching is a popular strategy to avoid backhaul congestion in the next generation networks, where the content is cached in advance at the base stations to fulfil the redundant requests during peak  periods.
Revised: Wireless edge caching is a popular strategy to avoid backhaul congestion in the next generation networks, where the content is cached in advance at the base stations to fulfil the redundant requests during peak congestion periods.
Edit intent: fluency
Original:  Also, since the observations are correlated across time, files, and base stations, in this paper, we formulate the caching, prediction and recommendation problem as a fourth-order tensor completion  problem.
Revised:  Also, since the observations are correlated across time, files, and base stations, in this paper, we formulate the cooperative caching with recommendations as a fourth-order tensor completion problem.
Edit intent: clarity
Original:  Since the content library can be large leading to a large dimension tensor, we modify the latent norm-based Frank-Wolfe (FW) algorithm with tensor-ring decomposition towards a lower time complexity using random mode selection.
Revised:  Since the content library can be large leading to a large dimension tensor, we modify the latent norm-based Frank-Wolfe (FW) algorithm with towards a much lower time complexity using random mode selection.
Edit intent: clarity
Original:  Simulations with MovieLens datasetshows the approximately similar reconstruction errors for the presented FW algorithm as compared to that of the recent FW algorithm, albeit with lower computation overhead.
Revised:  Simulations with MovieLens datasetshows the approximately similar reconstruction errors for the proposed algorithm as compared to that of the recent FW algorithm, albeit with lower computation overhead.
Edit intent: clarity
Original:  I_{\ell})/(I_h + I_{\ell}), it is shown that (1) when a < 1 or I_{\ell} >0, oscillation of the infection curve is self-organized and the period of the oscillation is in proportion to the ratio of  (I_h -
Revised:  I_{\ell})/(I_h + I_{\ell}), it is shown that (1) when a < 1 or I_{\ell} >0, oscillation of the infection curve is self-organized and the period of the oscillation is in proportion to the ratio of the difference (I_h -
Edit intent: clarity
Original:  Specifically, we provide the first non-trivial algorithms for the problem of ranked enumeration where the query results are returned incrementally in an order dictated by a given ranking function.
Revised:  Specifically, we provide the first non-trivial algorithms for the problem of ranked enumeration where the answers are returned incrementally in an order dictated by a given ranking function.
Edit intent: clarity
Original:  Our approach offers strong data-complexity guarantees in the standard RAM model of computation that are surprisingly close to those of equi-joins.
Revised:  Our approach offers strong data-complexity guarantees in the standard RAM model of computation , getting surprisingly close to those of equi-joins.
Edit intent: clarity
Original:  The key ingredient is an O(n polylog n)-size factorized representation of all query results that is constructed in a preprocessing step . As a side benefit, our techniques are also applicable to the easier task of unranked enumeration ( i.e., without an output ordering) where we are able to return k join results in \mathcal{O}(n \operatorname{polylog} n + k).
Revised:  The key ingredient is an O(n polylog n)-size factorized representation of the query output, which is constructed on-the-fly for a given query and database . As a side benefit, our techniques are also applicable to the easier task of unranked enumeration ( i.e., without an output ordering) where we are able to return k join results in \mathcal{O}(n \operatorname{polylog} n + k).
Edit intent: clarity
Original:  The key ingredient is an O(n polylog n)-size factorized representation of all query results that is constructed in a preprocessing step . As a side benefit, our techniques are also applicable to the easier task of unranked enumeration ( i.e., without an output ordering) where we are able to return k join results in \mathcal{O}(n \operatorname{polylog} n + k).
Revised:  The key ingredient is an O(n polylog n)-size factorized representation of all query results that is constructed in a preprocessing step . As a side benefit, our techniques are also applicable to unranked enumeration ( i.e., without an output ordering) where we are able to return k join results in \mathcal{O}(n \operatorname{polylog} n + k).
Edit intent: clarity
Original:  The key ingredient is an O(n polylog n)-size factorized representation of all query results that is constructed in a preprocessing step . As a side benefit, our techniques are also applicable to the easier task of unranked enumeration ( i.e., without an output ordering) where we are able to return k join results in \mathcal{O}(n \operatorname{polylog} n + k).
Revised:  The key ingredient is an O(n polylog n)-size factorized representation of all query results that is constructed in a preprocessing step . As a side benefit, our techniques are also applicable to the easier task of unranked enumeration ( where answers can be returned in any order) for joins with inequalities, returning k answers in \mathcal{O}(n \operatorname{polylog} n + k).
Edit intent: clarity
Original:  This guarantee is asymptotically superior to any known alternative for large values of k.
Revised:  This guarantee improves over the state of the art for large values of k.
Edit intent: clarity
Original:  In an experimental study, we show that our ranked enumeration approach is not only theoretically interesting, but also fast and memory-efficient in practice.
Revised:  In an experimental study, we show that our ranked-enumeration approach is not only theoretically interesting, but also fast and memory-efficient in practice.
Edit intent: fluency
Original:  Our approach offers strong time and space complexity guarantees in the standard RAM model of computation, getting surprisingly close to those of equi-joins.
Revised:  Our approach achieves strong time and space complexity guarantees in the standard RAM model of computation, getting surprisingly close to those of equi-joins.
Edit intent: clarity
Original:  In an experimental study , we show that our ranked-enumeration approach is not only theoretically interesting, but also fast and memory-efficient in practice .
Revised:  In an experimental study that our ranked-enumeration approach is not only theoretically interesting, but also fast and memory-efficient in practice .
Edit intent: coherence
Original:  In an experimental study , we show that our ranked-enumeration approach is not only theoretically interesting, but also fast and memory-efficient in practice .
Revised:  In an experimental study , we show that our ranked-enumeration approach is also memory-efficient in practice .
Edit intent: coherence
Original:  This is within a polylogarithmic factor of (n + k \log k), i.e., } the best known complexity for equi-joins  and even of O(n+k),  the time it takes to look at the input and return k answers in any order.
Revised:  This is within a polylogarithmic factor of (n + k \log k), i.e., } the best known complexity for equi-joins , and even of O(n+k), the time it takes to look at the input and return k answers in any order.
Edit intent: fluency
Original:  This is within a polylogarithmic factor of (n + k \log k), i.e., } the best known complexity for equi-joins  and even of O(n+k),  the time it takes to look at the input and return k answers in any order.
Revised:  This is within a polylogarithmic factor of (n + k \log k), i.e., } the best known complexity for equi-joins and even of O(n+k), i.e., the time it takes to look at the input and return k answers in any order.
Edit intent: fluency
Original:  Our guarantees extend to join queries with selections and many types of projections , such as the so-called free-connex queries . Remarkably, they hold even when the entire output is of size n^\ell for a join of \ell relations.
Revised:  Our guarantees extend to join queries with selections and many types of projections (namely those called " free-connex queries . Remarkably, they hold even when the entire output is of size n^\ell for a join of \ell relations.
Edit intent: clarity
Original:  Our guarantees extend to join queries with selections and many types of projections , such as the so-called free-connex queries . Remarkably, they hold even when the entire output is of size n^\ell for a join of \ell relations.
Revised:  Our guarantees extend to join queries with selections and many types of projections , such as the so-called free-connex queries . Remarkably, they hold even when the number of join results is n^\ell for a join of \ell relations.
Edit intent: clarity
Original: This paper describes computer models for three palliations used in treating refractory pulmonary hypertension  .
Revised: This paper describes computer models of three interventions used for treating refractory pulmonary hypertension .
Edit intent: clarity
Original: This paper describes computer models for three palliations used in treating refractory pulmonary hypertension  .
Revised: This paper describes computer models for three palliations used in treating refractory pulmonary hypertension (RPH) .
Edit intent: clarity
Original:  These procedures effectively create an atrial septal defect, a ventricular septal defect, or a patent ductus arteriosus, also known as a Potts shunt  .
Revised:  These procedures create either an atrial septal defect, a ventricular septal defect, or a patent ductus arteriosus, also known as a Potts shunt .
Edit intent: clarity
Original:  These procedures effectively create an atrial septal defect, a ventricular septal defect, or a patent ductus arteriosus, also known as a Potts shunt  .
Revised:  These procedures effectively create an atrial septal defect, a ventricular septal defect, or , in the case of a Potts shunt .
Edit intent: clarity
Original:  These procedures effectively create an atrial septal defect, a ventricular septal defect, or a patent ductus arteriosus, also known as a Potts shunt  .
Revised:  These procedures effectively create an atrial septal defect, a ventricular septal defect, or a patent ductus arteriosus, also known as a Potts shunt , a patent ductus arteriosus .
Edit intent: fluency
Original:  The aim in all three cases is to generate a right-to-left shunt, allowing for either pressure or volume unloading of the right side of the heart in the setting of right ventricular failure, while allowing for maintenance of cardiac output.
Revised:  The aim in all three cases is to generate a right-to-left shunt, allowing for either pressure or volume unloading of the right side of the heart in the setting of right ventricular failure, while maintaining cardiac output.
Edit intent: fluency
Original:  However, these shunts are created  at the expense of introducing de-oxygenated blood into the systemic circulation, thereby lowering the systemic arterial oxygen saturation.
Revised:  These shunts are created at the expense of introducing de-oxygenated blood into the systemic circulation, thereby lowering the systemic arterial oxygen saturation.
Edit intent: coherence
Original:  However, these shunts are created  at the expense of introducing de-oxygenated blood into the systemic circulation, thereby lowering the systemic arterial oxygen saturation.
Revised:  However, these shunts are created , however, at the expense of introducing de-oxygenated blood into the systemic circulation, thereby lowering the systemic arterial oxygen saturation.
Edit intent: coherence
Original:  Both bounds rely on spectral techniques -- applied to a certain matrix in the first case, and a certain continuous time Markov chain in the second .
Revised:  Both bounds rely on spectral gaps -- applied to a certain matrix in the first case, and a certain continuous time Markov chain in the second .
Edit intent: clarity
Original:  The necessary spectral gap bounds arise from the log-concavity of the volume of a simple polytope in terms of its slack variables , which is extended to non-simple polytopes via an approximation argument .
Revised:  The necessary spectral gap bounds arise from the log-concavity of the volume of a simple polytope in terms of its slack variables .
Edit intent: clarity
Original:  This novel method predicts intervertebral joint centers with an average mean error of 0.99+/ - 0.68 cm in the frontal axis and 1.21+/ - 0.97 cm in the transverse axis relative to radiographic reference data.
Revised:  This novel method predicts intervertebral joint centers with an average mean error of 0.99+/ -0.68 cm on the frontal and 1.21+/ - 0.97 cm in the transverse axis relative to radiographic reference data.
Edit intent: clarity
Original:  This novel method predicts intervertebral joint centers with an average mean error of 0.99+/ - 0.68 cm in the frontal axis and 1.21+/ - 0.97 cm in the transverse axis relative to radiographic reference data.
Revised:  This novel method predicts intervertebral joint centers with an average mean error of 0.99+/ - 0.68 cm in the frontal axis and 1.21+/ -0.97 cm on the transverse axis relative to radiographic reference data.
Edit intent: clarity
Original:  The results of this study demonstrate the suitability of the proposed method and associated OpenSim workflow for inter- and intra-subject investigations  of muscle activity and joint reaction forces in the spine .
Revised:  The results of this study demonstrate the suitability of the proposed method and associated workflow for inter- and intra-subject investigations of muscle activity and joint reaction forces in the spine .
Edit intent: clarity
Original:  We integrate the stochastic dynamics of social activity into traditional epidemiological models .
Revised:  By integrating the stochastic dynamics of social activity into traditional epidemiological models .
Edit intent: fluency
Original:  Our results also provide a new mechanism for emerging pathogens to transition from a fast-paced epidemic  to the endemic state.
Revised:  The existence of the long timescale due to the interplay between epidemic and social dynamics provides a unifying picture of how a fast-paced epidemic to the endemic state.
Edit intent: coherence
Original:  These two sources have the particularity of including in the metadata information on the date in which papers were indexed.
Revised:  These two sources have the particularity of including in the metadata information the date in which papers were indexed.
Edit intent: clarity
Original:  We present global predictions, plus predictions in three specific settings: by type of access (Open Access), by NLM source (PubMed and PMC), and by domain-specific repository (SSRN and MedRxiv).
Revised:  We present global predictions, plus predictions in three specific settings: type of access (Open Access), by NLM source (PubMed and PMC), and by domain-specific repository (SSRN and MedRxiv).
Edit intent: fluency
Original:  We present global predictions, plus predictions in three specific settings: by type of access (Open Access), by NLM source (PubMed and PMC), and by domain-specific repository (SSRN and MedRxiv).
Revised:  We present global predictions, plus predictions in three specific settings: by type of access (Open Access), NLM source (PubMed and PMC), and by domain-specific repository (SSRN and MedRxiv).
Edit intent: fluency
Original:  We present global predictions, plus predictions in three specific settings: by type of access (Open Access), by NLM source (PubMed and PMC), and by domain-specific repository (SSRN and MedRxiv).
Revised:  We present global predictions, plus predictions in three specific settings: by type of access (Open Access), by NLM source (PubMed and PMC), and domain-specific repository (SSRN and MedRxiv).
Edit intent: fluency
Original: The fifth-generation (5G) of cellular networks use revolutionary and evolutionary technologies to notably improve wireless communication performance .
Revised: The fifth-generation (5G) of cellular networks use revolutionary and evolutionary technologies to notably improve the performance of wireless networks .
Edit intent: clarity
Original:  However, given the envisioned new use cases ( e.g., holographic communication ) and the ever-increasing deployment of  smart-physical end devices , the volume of network traffic has considerably raised, and the current mobile networks cannot wholly meet the ever-increasing demands.
Revised:  However, given the envisioned new use-cases, e.g., holographic communication ) and the ever-increasing deployment of smart-physical end devices , the volume of network traffic has considerably raised, and the current mobile networks cannot wholly meet the ever-increasing demands.
Edit intent: fluency
Original:  However, given the envisioned new use cases ( e.g., holographic communication ) and the ever-increasing deployment of  smart-physical end devices , the volume of network traffic has considerably raised, and the current mobile networks cannot wholly meet the ever-increasing demands.
Revised:  However, given the envisioned new use cases ( e.g., holographic communication , and the ever-increasing deployment of smart-physical end devices , the volume of network traffic has considerably raised, and the current mobile networks cannot wholly meet the ever-increasing demands.
Edit intent: fluency
Original:  However, given the envisioned new use cases ( e.g., holographic communication ) and the ever-increasing deployment of  smart-physical end devices , the volume of network traffic has considerably raised, and the current mobile networks cannot wholly meet the ever-increasing demands.
Revised:  However, given the envisioned new use cases ( e.g., holographic communication ) and the ever-increasing deployment of smart-physical end devices , the volume of network traffic has considerably raised, and therefore, the current generation of mobile networks cannot wholly meet the ever-increasing demands.
Edit intent: clarity
Original:  Hence, it is envisioned that  6G networks will play a critical role to alleviate these challenges by providing new communication services, network capacity, and ultra-low latency communications  .
Revised:  Hence, it is envisioned that 6G ) networks, need to play a critical role to alleviate these challenges by providing new communication services, network capacity, and ultra-low latency communications .
Edit intent: clarity
Original:  In this paper, first, the need of 6G networks is discussed.
Revised:  In this paper, first, the need for 6G networks is discussed.
Edit intent: fluency
Original: Data-plane programmability is now mainstream, both in the form of programmable switches and smart network-interface cards ( NICs ).
Revised: Data-plane programmability is now mainstream, both in the form of programmable switches and smart network-interface cards ( SmartNICs ).
Edit intent: clarity
Original:  We show that Menshen can support multiple modules simultaneously, allows one module to be quickly updated without disrupting other modules, and consumes a modest amount of additional hardware resources relative to an RMT pipeline.
Revised:  We show that Menshen supports multiple modules simultaneously, allows one module to be quickly updated without disrupting other modules, and consumes a modest amount of additional hardware resources relative to an RMT pipeline.
Edit intent: clarity
Original:  This paper presents a system, Menshen, for inter-module isolation on programmable packet-processing pipelines similar to the RMT/PISA architecture.
Revised:  This paper presents Menshen, an extension of the RMT/PISA architecture.
Edit intent: clarity
Original:  We prototype the Menshen hardware using the NetFPGA switch and Corundum FPGA NIC platforms and the Menshen software using the open-source P4-16 reference compiler  .
Revised:  We prototype the Menshen hardware using the NetFPGA switch and Corundum FPGA NIC platforms and an extension to the open source P4-16 reference compiler .
Edit intent: clarity
Original:  We have open sourced the code for Menshen's hardware and software at URL Although we do not have an ASIC implementation of Menshen, we believe its primitives are simple enough that they can be added to an ASIC realization of RMT as well.
Revised:  We have open sourced the code for Menshen's hardware and software at URL 
Edit intent: coherence
Original:  This prior art has mainly focused on star topologies consisting of distributed clients and a central server.
Revised:  The prior art has mainly focused on star topologies consisting of distributed clients and a central server.
Edit intent: fluency
Original: A classical result by Lov\'asz asserts that two graphs G and H are isomorphic if and only if they have the same left-homomorphism vector ,
Revised: A classical result by Lov\'asz asserts that two graphs G and H are isomorphic if and only if they have the same left profile ,
Edit intent: clarity
Original:  that is, for every graph F, the number of homomorphisms from F to G coincides with the number of homomorphisms from F to H.  }} Dell, Grohe, and Rattan showed that restrictions of the left-homomorphism vector to a class of graphs can capture several different relaxations of isomorphism, including  co-spectrality (i.e., two graphs having the same characteristic polynomial) , fractional isomorphism and, more broadly, equivalence in counting logics with a fixed number of variables .
Revised:  that is, for every graph F, the number of homomorphisms from F to G coincides with the number of homomorphisms from F to H. Dvor }} Dell, Grohe, and Rattan showed that restrictions of the left-homomorphism vector to a class of graphs can capture several different relaxations of isomorphism, including co-spectrality (i.e., two graphs having the same characteristic polynomial) , fractional isomorphism and, more broadly, equivalence in counting logics with a fixed number of variables .
Edit intent: clarity
Original:  that is, for every graph F, the number of homomorphisms from F to G coincides with the number of homomorphisms from F to H.  }} Dell, Grohe, and Rattan showed that restrictions of the left-homomorphism vector to a class of graphs can capture several different relaxations of isomorphism, including  co-spectrality (i.e., two graphs having the same characteristic polynomial) , fractional isomorphism and, more broadly, equivalence in counting logics with a fixed number of variables .
Revised:  that is, for every graph F, the number of homomorphisms from F to G coincides with the number of homomorphisms from F to H. \'{a}} Dell, Grohe, and Rattan showed that restrictions of the left-homomorphism vector to a class of graphs can capture several different relaxations of isomorphism, including co-spectrality (i.e., two graphs having the same characteristic polynomial) , fractional isomorphism and, more broadly, equivalence in counting logics with a fixed number of variables .
Edit intent: coherence