wanyu/IteraTeR_v2 huggingface dataset:
Original:  We formulate the robust minimum reflector placement problem and the robust maximum utility reflector placement problem with the objective to minimize the number of reflectors deployed and maximize the network utility, respectively.
Revised:  We formulate the robust minimum reflector placement problem and the robust maximum utility relay placement problem with the objective to minimize the number of reflectors deployed and maximize the network utility, respectively.
Edit intent: clarity
Original:  We formulate the robust minimum reflector placement problem and the robust maximum utility reflector placement problem with the objective to minimize the number of reflectors deployed and maximize the network utility, respectively.
Revised:  We formulate the robust minimum reflector placement problem and the robust maximum utility reflector placement problem with the objective to minimize the number of relays deployed and maximize the network utility, respectively.
Edit intent: clarity
Original: We present a 2D nearest-neighbor quantum architecture for Shor's factoring algorithm in polylogarithmic depth.
Revised: We contribute a 2D nearest-neighbor quantum architecture for Shor's factoring algorithm in polylogarithmic depth.
Edit intent: clarity
Original:   We evaluate the proposal with a ULS computing system provided with genetic adaptation mechanisms.
Revised:  These measures allow the evaluation of ULS systems and thus can be used to guide their design. We evaluate the proposal with a ULS computing system provided with genetic adaptation mechanisms.
Edit intent: coherence
Original:   We evaluate the proposal with a ULS computing system provided with genetic adaptation mechanisms.
Revised:  We evaluate the proposal with a ULS computing system provided with adaptation mechanisms.
Edit intent: clarity
Original: User cooperation although improves performance of wireless systems, it requires incentives for the potential  relays to spend their energy for cooperation .
Revised: User cooperation although improves performance of wireless systems, it requires incentives for the potential relays to spend their energy .
Edit intent: clarity
Original:  Once the source is informed about the contracts  the potential relays are willing to accept in each subcarrier, the problem of relay selection in each subcarrier while maximizing the capacity under a budget constraint is shown to be a nonlinear non-separable knapsack problem and we propose a heuristic solution .
Revised:  Once the source is informed about the contracts that the potential relays are willing to accept in each subcarrier, the problem of relay selection in each subcarrier while maximizing the capacity under a budget constraint is shown to be a nonlinear non-separable knapsack problem and we propose a heuristic solution .
Edit intent: fluency
Original:  Once the source is informed about the contracts  the potential relays are willing to accept in each subcarrier, the problem of relay selection in each subcarrier while maximizing the capacity under a budget constraint is shown to be a nonlinear non-separable knapsack problem and we propose a heuristic solution .
Revised:  Once the source is informed about the contracts the potential relays are willing to accept in each subcarrier, the problem of relay selection in each subcarrier while maximizing the capacity under a budget constraint is shown to be a nonlinear non-separable knapsack problem which is therefore solved heuristically .
Edit intent: coherence
Original: User cooperation although improves performance of wireless systems, it requires incentives for the potential cooperating nodes that act as relays to spend their energy  .
Revised: User cooperation although improves performance of wireless systems, it requires incentives for the potential cooperating nodes to spend their energy .
Edit intent: clarity
Original: User cooperation although improves performance of wireless systems, it requires incentives for the potential cooperating nodes that act as relays to spend their energy  .
Revised: User cooperation although improves performance of wireless systems, it requires incentives for the potential cooperating nodes that act as relays to spend their energy acting as relays .
Edit intent: clarity
Original:  Once the source is informed about the contracts that the potential relays are willing to accept in each subcarrier  , the problem of relay selection in each subcarrier while maximizing the capacity under a budget constraint is shown to be a nonlinear non-separable knapsack problem which is therefore solved heuristically .
Revised:  Once the source is informed about the contracts that the potential relays are willing to accept in each subcarrier , the problem of relay selection in each subcarrier in order to maximize the capacity is a nonlinear non-separable knapsack problem which is therefore solved heuristically .
Edit intent: clarity
Original:  Once the source is informed about the contracts that the potential relays are willing to accept in each subcarrier  , the problem of relay selection in each subcarrier while maximizing the capacity under a budget constraint is shown to be a nonlinear non-separable knapsack problem which is therefore solved heuristically .
Revised:  Once the source is informed about the contracts that the potential relays are willing to accept in each subcarrier , the problem of relay selection in each subcarrier while maximizing the capacity under a budget constraint is shown to be a nonlinear non-separable knapsack problem . We propose a heuristic relay selection scheme to solve this problem .
Edit intent: clarity
Original:  We derive the device requirements for sub 100 fJ/  bit interconnects including tuning power, serialization-deserialization energy, and optical insertion losses . Using silicon photonics as an example platform, we derive the energy/bit, linear and areal bandwidth density of optical interconnects.
Revised:  We derive the device requirements for sub 100 fJ/ bit interconnects including tuning power, serialization-deserialization energy, optical insertion losses . Using silicon photonics as an example platform, we derive the energy/bit, linear and areal bandwidth density of optical interconnects.
Edit intent: fluency
Original:  We also derive the targets for device performance which indicate the need for continued improvements in mode volume (< 1 \mu%DIFDELCMD < }%%% m^3), insertion losses (<8dB),  operational speeds (>40 Gb/s), tuning power (< 250 {\mu}W/nm), serialization-deserialization (< 5 fJ/bit/Operation) and necessity for spectrally selective devices with wavelength multiplexing (> 6 channels) .
Revised:  We also derive the targets for device performance which indicate the need for continued improvements in \mu%DIFDELCMD < }%%% m^3), insertion losses (<8dB), operational speeds (>40 Gb/s), tuning power (< 250 {\mu}W/nm), serialization-deserialization (< 5 fJ/bit/Operation) and necessity for spectrally selective devices with wavelength multiplexing (> 6 channels) .
Edit intent: clarity
Original:  We also derive the targets for device performance which indicate the need for continued improvements in mode volume (< 1 \mu%DIFDELCMD < }%%% m^3), insertion losses (<8dB),  operational speeds (>40 Gb/s), tuning power (< 250 {\mu}W/nm), serialization-deserialization (< 5 fJ/bit/Operation) and necessity for spectrally selective devices with wavelength multiplexing (> 6 channels) .
Revised:  We also derive the targets for device performance which indicate the need for continued improvements in mode volume (< 1 %DIFDELCMD < }%%% m^3), insertion losses (<8dB), operational speeds (>40 Gb/s), tuning power (< 250 {\mu}W/nm), serialization-deserialization (< 5 fJ/bit/Operation) and necessity for spectrally selective devices with wavelength multiplexing (> 6 channels) .
Edit intent: coherence
Original:  We also derive the targets for device performance which indicate the need for continued improvements in mode volume (< 1 \mu%DIFDELCMD < }%%% m^3), insertion losses (<8dB),  operational speeds (>40 Gb/s), tuning power (< 250 {\mu}W/nm), serialization-deserialization (< 5 fJ/bit/Operation) and necessity for spectrally selective devices with wavelength multiplexing (> 6 channels) .
Revised:  We also derive the targets for device performance which indicate the need for continued improvements in mode volume (< 1 \mu%DIFDELCMD < }%%% insertion losses (<8dB), operational speeds (>40 Gb/s), tuning power (< 250 {\mu}W/nm), serialization-deserialization (< 5 fJ/bit/Operation) and necessity for spectrally selective devices with wavelength multiplexing (> 6 channels) .
Edit intent: clarity
Original:  We also derive the targets for device performance which indicate the need for continued improvements in mode volume (< 1 \mu%DIFDELCMD < }%%% m^3), insertion losses (<8dB),  operational speeds (>40 Gb/s), tuning power (< 250 {\mu}W/nm), serialization-deserialization (< 5 fJ/bit/Operation) and necessity for spectrally selective devices with wavelength multiplexing (> 6 channels) .
Revised:  We also derive the targets for device performance which indicate the need for continued improvements in mode volume (< 1 \mu%DIFDELCMD < }%%% m^3), insertion losses (<8dB), laser efficiency, operational speeds (>40 Gb/s), tuning power (< 250 {\mu}W/nm), serialization-deserialization (< 5 fJ/bit/Operation) and necessity for spectrally selective devices with wavelength multiplexing (> 6 channels) .
Edit intent: clarity
Original:  Counting queries of the form "What fraction of individual records in the database satisfy the property q?" We prove that if one-way functions exist, then there is no algorithm that takes as input a database %DIFDELCMD < \db %DIFDELCMD < %%% \in%DIFDELCMD < \dbset%%% , } and k = %DIFDELCMD < \Theta%%% (n^2) arbitrary efficiently computable counting queries, runs in time %DIFDELCMD < \poly%%%  (d, n), and returns an approximate answer to each query, while satisfying differential privacy.
Revised:  Counting queries of the form "What fraction of individual records in the database satisfy the property q?" We prove that if one-way functions exist, then there is no algorithm that takes as input a database %DIFDELCMD < \db %DIFDELCMD < %%% %DIFDELCMD < \dbset%%% , } and k = %DIFDELCMD < \Theta%%% (n^2) arbitrary efficiently computable counting queries, runs in time %DIFDELCMD < \poly%%% (d, n), and returns an approximate answer to each query, while satisfying differential privacy.
Edit intent: coherence
Original:  Counting queries of the form "What fraction of individual records in the database satisfy the property q?" We prove that if one-way functions exist, then there is no algorithm that takes as input a database %DIFDELCMD < \db %DIFDELCMD < %%% \in%DIFDELCMD < \dbset%%% , } and k = %DIFDELCMD < \Theta%%% (n^2) arbitrary efficiently computable counting queries, runs in time %DIFDELCMD < \poly%%%  (d, n), and returns an approximate answer to each query, while satisfying differential privacy.
Revised:  Counting queries of the form "What fraction of individual records in the database satisfy the property q?" We prove that if one-way functions exist, then there is no algorithm that takes as input a database %DIFDELCMD < \db %DIFDELCMD < %%% \in%DIFDELCMD < \dbset%%% D in ( } and k = %DIFDELCMD < \Theta%%% (n^2) arbitrary efficiently computable counting queries, runs in time %DIFDELCMD < \poly%%% (d, n), and returns an approximate answer to each query, while satisfying differential privacy.
Edit intent: clarity
Original:  We also consider the complexity of answering "simple" counting queries, and make some progress in this direction by showing that the above result holds even when we require that the queries are computable by constant depth ( AC^0 ) circuits.
Revised:  We also consider the complexity of answering "simple" counting queries, and make some progress in this direction by showing that the above result holds even when we require that the queries are computable by constant depth ( AC-0 ) circuits.
Edit intent: clarity
Original:  it asksfor some intervals pre-drawn by the input whether it is possible to extend this partial representation to the entire graph.
Revised:  it asksfor some intervals pre-drawn by the input , whether the partial representation can be extended to a representation of the entire graph.
Edit intent: clarity
Original:  We continue in this line of research and present a linear-time algorithm for proper interval graphs and an almost quadratic-time algorithm for  unit interval graphs.
Revised:  In this paper, we give a linear-time algorithm for proper interval graphs and an almost quadratic-time algorithm for unit interval graphs.
Edit intent: clarity
Original:  We continue in this line of research and present a linear-time algorithm for proper interval graphs and an almost quadratic-time algorithm for  unit interval graphs.
Revised:  We continue in this line of research and present a linear-time algorithm for extending proper interval representations and an almost quadratic-time algorithm for unit interval graphs.
Edit intent: clarity
Original:  We also verify up to 316 vertices a conjecture of Barnett that cubic planar graphs with maximum face size 6 are hamiltonian  .
Revised:  We also check up to 316 vertices a conjecture of Barnett that cubic planar graphs with maximum face size 6 are hamiltonian .
Edit intent: clarity
Original:  In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with  time delay blocks  in a discrete-time setting.
Revised:  In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with time delay blocks in a discrete-time setting.
Edit intent: fluency
Original:  In this note we improve the results of Chan et al., using a simpler proof.
Revised:  In this work we improve the results of Chan et al., using a simpler proof.
Edit intent: clarity
Original:  These expressions show how the network performance depends on the tuning of Aloha and routing parameters and on the external noise level.
Revised:  These expressions show how the network performance depends on the tuning of Aloha and on the external noise level.
Edit intent: clarity
Original:  We also consider a Poisson-line MANET model, in which nodes are located on roads forming a Poisson-line process .
Revised:  We also consider a Poisson-line ad-hoc network in which all nodes (including interfering ones) are randomly located on a Poisson process of lines (routes) .
Edit intent: clarity
Original:  In this case our linear route is rigorously (in the sense of Palm theory)  the typical route in this Poisson-line MANET .
Revised:  In this case our analysis rigorously (in the sense of Palm theory) the typical route in this Poisson-line MANET .
Edit intent: clarity
Original:  In this case our linear route is rigorously (in the sense of Palm theory)  the typical route in this Poisson-line MANET .
Revised:  In this case our linear route is rigorously (in the sense of Palm theory) corresponds to the typical route in this Poisson-line MANET .
Edit intent: clarity
Original:  In this case our linear route is rigorously (in the sense of Palm theory)  the typical route in this Poisson-line MANET .
Revised:  In this case our linear route is rigorously (in the sense of Palm theory) the typical route of this network .
Edit intent: clarity
Original:  Assuming slotted Aloha and the signal-to-interference-and-noise ratio capture condition, with the usual power-law path loss model and Rayleigh fading, we explicitly evaluate several local and end-to-end performance characteristics related to nearest-neighbour packet relaying on this line .
Revised:  Assuming slotted Aloha and the signal-to-interference-and-noise ratio capture condition, with the usual power-law path loss model and Rayleigh fading, we explicitly evaluate several local and end-to-end performance characteristics related to the nearest-neighbor packet relaying on this line .
Edit intent: fluency
Original:  We study how these metrics depend on the density of relaying nodes and interferers, tuning of Aloha and on the external noise level.
Revised:  We study how these metrics depend on the density of relaying and on the external noise level.
Edit intent: clarity
Original:  We consider natural applications of these results in a vehicular ad-hoc network , where vehicles are randomly located on a straight road.
Revised:  We consider natural applications of these results in a vehicular ad-hoc networks , where vehicles are randomly located on a straight road.
Edit intent: fluency
Original:  We also propose to use this model to study a "typical " route traced in a (general) planar ad-hoc network by some routing mechanism.
Revised:  The second use is to study a "typical " route traced in a (general) planar ad-hoc network by some routing mechanism.
Edit intent: clarity
Original:  We also propose to use this model to study a "typical " route traced in a (general) planar ad-hoc network by some routing mechanism.
Revised:  We also propose to use this model to study a typical route traced in a (general) planar ad-hoc network by some routing mechanism.
Edit intent: fluency
Original:  Such a decoupling of a given route from the rest of the network in particular allows us to quantitatively evaluate the non-efficiency of long-distance routing in " pure ad-hoc " networks , previously observed in the planar scenario, and the need for a well-tuned structure of "fixed " relaying nodes.
Revised:  The approach we have chosen allows us to quantitatively evaluate the non-efficiency of long-distance routing in " pure ad-hoc " networks , previously observed in the planar scenario, and the need for a well-tuned structure of "fixed " relaying nodes.
Edit intent: clarity
Original:  Such a decoupling of a given route from the rest of the network in particular allows us to quantitatively evaluate the non-efficiency of long-distance routing in " pure ad-hoc " networks , previously observed in the planar scenario, and the need for a well-tuned structure of "fixed " relaying nodes.
Revised:  Such a decoupling of a given route from the rest of the network in particular allows us to quantify the non-efficiency of long-distance routing in " pure ad-hoc " networks , previously observed in the planar scenario, and the need for a well-tuned structure of "fixed " relaying nodes.
Edit intent: clarity
Original:  Such a decoupling of a given route from the rest of the network in particular allows us to quantitatively evaluate the non-efficiency of long-distance routing in " pure ad-hoc " networks , previously observed in the planar scenario, and the need for a well-tuned structure of "fixed " relaying nodes.
Revised:  Such a decoupling of a given route from the rest of the network in particular allows us to quantitatively evaluate the non-efficiency of long-distance routing in pure ad-hoc " networks , previously observed in the planar scenario, and the need for a well-tuned structure of "fixed " relaying nodes.
Edit intent: fluency
Original:  We consider several extensions of our basic Poison-line-in-Poisson field-model, notably as Poisson-line ad-hoc network in which all nodes (including interfering ones) are randomly located on a Poisson process of lines(routes).
Revised:  We consider several extensions of our basic Poison-line-in-Poisson field-model, notably as Poisson-line field of interfering nodes, in which all nodes (including interfering ones) are randomly located on a Poisson process of lines(routes).
Edit intent: clarity
Original:  We consider several extensions of our basic Poison-line-in-Poisson field-model, notably as Poisson-line ad-hoc network in which all nodes (including interfering ones) are randomly located on a Poisson process of lines(routes).
Revised:  We consider several extensions of our basic Poison-line-in-Poisson field-model, notably as Poisson-line ad-hoc network in which all the nodes are randomly located on a Poisson process of lines(routes).
Edit intent: clarity
Original: We establish an improved upper bound for the number of incidences between m points and n arbitrary circles in three dimensions.
Revised: We establish an improved upper bound for the number of incidences between m points and n circles in three dimensions.
Edit intent: clarity
Original:  Nevertheless, we show that if the set of circles is required to be "truly three-dimensional" in the sense that there exists a q<n so that no sphere or plane contains more than q of the circles,  then the bound can be improved to %DIFDELCMD < \[%%% O^*%DIFDELCMD < \big(%%% m^{3/7n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n}%DIFDELCMD < \big)%%% . \[O*(m^{3/7}n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n).
Revised:  Nevertheless, we show that if the set of circles is required to be "truly three-dimensional" in the sense that no sphere or plane contains more than q of the circles, then the bound can be improved to %DIFDELCMD < \[%%% O^*%DIFDELCMD < \big(%%% m^{3/7n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n}%DIFDELCMD < \big)%%% . \[O*(m^{3/7}n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n).
Edit intent: clarity
Original:  Nevertheless, we show that if the set of circles is required to be "truly three-dimensional" in the sense that there exists a q<n so that no sphere or plane contains more than q of the circles,  then the bound can be improved to %DIFDELCMD < \[%%% O^*%DIFDELCMD < \big(%%% m^{3/7n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n}%DIFDELCMD < \big)%%% . \[O*(m^{3/7}n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n).
Revised:  Nevertheless, we show that if the set of circles is required to be "truly three-dimensional" in the sense that there exists a q<n so that no sphere or plane contains more than q of the circles, then the bound can be improved to %DIFDELCMD < \[%%% %DIFDELCMD < \big(%%% m^{3/7n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n}%DIFDELCMD < \big)%%% . \[O*(m^{3/7}n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n).
Edit intent: coherence
Original:  Nevertheless, we show that if the set of circles is required to be "truly three-dimensional" in the sense that there exists a q<n so that no sphere or plane contains more than q of the circles,  then the bound can be improved to %DIFDELCMD < \[%%% O^*%DIFDELCMD < \big(%%% m^{3/7n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n}%DIFDELCMD < \big)%%% . \[O*(m^{3/7}n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n).
Revised:  Nevertheless, we show that if the set of circles is required to be "truly three-dimensional" in the sense that there exists a q<n so that no sphere or plane contains more than q of the circles, then the bound can be improved to %DIFDELCMD < \[%%% O^*%DIFDELCMD < \big(%%% n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n}%DIFDELCMD < \big)%%% . \[O*(m^{3/7}n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n).
Edit intent: fluency
Original:  Nevertheless, we show that if the set of circles is required to be "truly three-dimensional" in the sense that there exists a q<n so that no sphere or plane contains more than q of the circles,  then the bound can be improved to %DIFDELCMD < \[%%% O^*%DIFDELCMD < \big(%%% m^{3/7n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n}%DIFDELCMD < \big)%%% . \[O*(m^{3/7}n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n).
Revised:  Nevertheless, we show that if the set of circles is required to be "truly three-dimensional" in the sense that there exists a q<n so that no sphere or plane contains more than q of the circles, then the bound can be improved to %DIFDELCMD < \[%%% O^*%DIFDELCMD < \big(%%% m^{3/7n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n}%DIFDELCMD < \big)%%% \[O*(m^{3/7}n^{6/7} + m^{2/3}n^{1/2}q^{1/6} + m^{6/11}n^{15/22}q^{3/22} + m + n).
Edit intent: coherence